How to model and generate forecasts for time series with missing observations?
Is there any gold standard for modeling irregularly spaced time series?
Hi currently Nagios sends notifications from nagios@server.domain.com, How do I go about configuring this? Thanks The  (or conjecture), suggests that black holes can be entirely described by their mass, angular momentum and charge. All other details of the BH formation are lost.  Is there a simple way of understanding why you would be able to tell the difference between a BH made from protons and one made from electrons, but not between one made from matter rather than anti-matter?  i.e. What is special about charge, and why aren't lepton number, baryon number, strangeness etc, also black hole properties? I got a brand new Windows 7 machine, installed the operating system, created one account and forgot its password. What can I do?  There is no external CD, the operating system is loaded from somewhere inside the machine.  I already tried to remember passwords and tried all candidates with all possible combinations of caps lock, num lock etc. How can I customize different nodepart with different textures? My question is how can I customize hatch patterns(grid, vertical line, etc.) for different nodepart in a node?  The following is a failed try.  \documentclass[border=2mm,convert]{standalone} \usepackage{tikz} \usetikzlibrary{shapes.multipart,patterns}  \begin{document} \begin{tikzpicture} \node[rectangle split,rectangle split parts =2,rectangle split part fill={red!30,red!10}, rectangle split part pattern={grid,},draw]{one \nodepart{second}two}; \end{tikzpicture} \end{document} Highlight a word with jQuery I basically need to highlight a particular word in a block of text. For example, pretend I wanted to highlight the word &quot;dolor&quot; in this text: &lt;p&gt;     Lorem ipsum dolor sit amet, consectetuer adipiscing elit. &lt;/p&gt; &lt;p&gt;     Quisque bibendum sem ut lacus. Integer dolor ullamcorper libero.     Aliquam rhoncus eros at augue. Suspendisse vitae mauris. &lt;/p&gt;  How do I convert the above to something like this: &lt;p&gt;     Lorem ipsum &lt;span class=&quot;myClass&quot;&gt;dolor&lt;/span&gt; sit amet, consectetuer adipiscing elit. &lt;/p&gt; &lt;p&gt;     Quisque bibendum sem ut lacus. Integer &lt;span class=&quot;myClass&quot;&gt;dolor&lt;/span&gt; ullamcorper     libero. Aliquam rhoncus eros at augue. Suspendisse vitae mauris. &lt;/p&gt;  Is this possible with jQuery? Edit: As  , this is quite possible without jQuery - but I was hoping there might be a special method of jQuery which would let you do selectors on the text itself. I'm already using jQuery heavily on this site, so keeping everything wrapped up in jQuery would make things perhaps a bit more tidy. I've recently changed to the new Minecraft launcher, and I have noticed a change in the .minecraft folder layout. I can no longer install mods just by copying it over into the versions/1.6.1 jar file, as this file refreshes every time it is launched.  For those who don't know what I am talking about, here is the new layout:    I am specifically trying to install Optifine, which does work with 1.6.1. Where do I drag in the mod files now? I can't seem to find a jar file that is suited to it, except in the version folder, but as I stated above, this refreshes every time.  After copying a recent version and renaming it in the version folder, I get this error in the development console:   Unexpected exception refreshing version list java.lang.IllegalArgumentException: Version '1.6.1' is already tracked     at net.minecraft.launcher.updater.VersionList.addVersion(VersionList.java:91)     at net.minecraft.launcher.updater.LocalVersionList.refreshVersions(LocalVersionList.java:44)     at net.minecraft.launcher.updater.VersionManager.refreshVersions(VersionManager.java:47)     at net.minecraft.launcher.Launcher$2.run(Launcher.java:164)     at java.util.concurrent.Executors$RunnableAdapter.call(Unknown Source)     at java.util.concurrent.FutureTask$Sync.innerRun(Unknown Source)     at java.util.concurrent.FutureTask.run(Unknown Source)     at java.util.concurrent.ThreadPoolExecutor.runWorker(Unknown Source)     at java.util.concurrent.ThreadPoolExecutor$Worker.run(Unknown Source)     at java.lang.Thread.run(Unknown Source) Reference book on measure theory I post this question with some personal specifications. I hope it does not overlap with old posted questions.  Recently I strongly feel that I have to review the knowledge of measure theory for the sake of starting my thesis.  I am not totally new with measure theory, since I have taken and past one course at the graduate level. Unfortunately, because the lecturer was not so good at teaching, I followed the course by self-study. Now I feel that all the knowledge has gone after the exam and still don’t have a clear overview on the structure of measure theory. And here come my specified requirements for a reference book.   I wish the book elaborates the proofs, since I will read it on my own again, sadly. And this is the most important criterion for the book. I wish the book covers most of the topics in measure theory. Although the topic of my thesis is on stochastic integration, I do want to review measure theory at a more general level, which means it could emphasize on both aspects of analysis and probability. If such a condition cannot be achieved, I'd like to more focus on probability. I wish the book could deal with convergences and uniform integrability carefully, as Chung’s probability book.    My expectation is after thorough reading, I could have strong background to start a thesis on stochastic integration at an analytic level.  Sorry for such a tedious question.  P.S: the textbook I used is Schilling’s book: measures, integrals and martingales. It is a pretty good textbook, but misprints really ruin the fun of reading. A map is continuous if and only if for every set, the image of closure is contained in the closure of image My bookmarks are not shown anymore after upgrading to 13.04 Raring ringtails and I can't add any new bookmarks. The function is not shown and the shortcut Ctrl+D isn't working either. Is this functionality just gone for some reason (as the split screen with F3) or is there something wrong with my upgrade?  Thanks for any hints. Helping someone climb I know this is kinda stupid but what is the word for "helping someone climb by allowing him to stand on your hands" (to allow him/her see above some wall or climb something)? Showing a Sequence and its Limit are Closed Let $(X, d)$ be a metric space, and $(x_n)_{n \in \mathbb{N}}$ a sequence in $X$, with $x_n \rightarrow x$ w.r.t. $d$ for some $x \in X$. Show that the set $\{x_n : n \in \mathbb{N}\}\cup\{x\}$ is closed in $(X, d)$.   I figured I should use $\overline{F} = F \cup F'$ to show the above set is closed. Let $(x_n)_{n \in \mathbb{N}} = F$. Then, all elements of the sequence are in  $F$, which is equal to $\{x_n : n \in \mathbb{N}\}$. Clearly, the sequence (or $F$) has only one accumulation point, $x$. So, $F' = \{x\}$. This shows $\{x_n : n \in \mathbb{N}\}\cup\{x\} = \overline{F}$, and thus is closed.  Is this sufficient in proving the problem? Or would I have to show that $x$ is the only accumulation point as well (figured I don't have to because we know limits are unique)? Any advice would be very helpful. Thank you. How does matter know to obey physical laws? First of all, you may say that, this is a "why" question and in physics we don't ask such a question and instead we ask about "how". However, I want to discuss this with you.  We model the behavior of matter by physical laws, for example by quantum mechanics laws. I want to know how the matter, say electron, knows that it must obey such a law. What forces the electron to obey quantum mechanics laws?  If you consider a simulation of the universe in a computer, in the view of someone  simulated in that computer the physical laws are just there. They may not know what keeps  in check the simulated matter to obey physical laws, but in our perspective those simulated physical laws are there because we implemented them as zero and ones in a hard disk. If we wanted, we could change those physical laws and in the eye of the simulated person everything would be still fine.  Is there a scientific attempt to discuss this issue? so that I can read about it. Equivalent conditions for a preabelian category to be abelian Let's fix some terminology first. A category $\mathcal{C}$ is preabelian if:  1) $Hom_{\mathcal{C}}(A,B)$ is an abelian group for every $A,B$ such that composition is biadditive,  2) $\mathcal{C}$ has a zero object,  3) $\mathcal{C}$ has binary products,  4) $\mathcal{C}$ has kernels and cokernels.  A category $\mathcal{C}$ is abelian if it is preabelian and satisfies:  5) every monomorphism is a kernel and every epimorphism is a cokernel.  Define the coimage of a map to be the cokernel of its kernel, and the image to be the kernel of its cokernel. We have the following commutative diagram:    where $\overline{f}$ is the only existing map (because of universality of kernel and cokernel).  I'm having trouble proving the following:     A preabelian category $\mathcal{C}$ is abelian iff $\overline{f}$ is an isomorphism.   The converse is easily shown, I'm having trouble proving $\Rightarrow$... I am a kid trying to teach myself Calculus in order to prepare for next year.   I have the expression  $$\lim_{x\to 2}\frac{\cos(\frac \pi x)}{x-2} $$  There is a hint that says to substitute t for $(\frac \pi2 - \frac \pi x)$ and WolframAlpha evaluates this expression as $\frac \pi4$. However, I got the answer of $1$. Can someone clarify the steps to solving this problem. Is there an elementary proof that $\sum \limits_{k=1}^n \frac1k$ is never an integer? I got a integrated GD, which is Intel, and another discrete GD, AMD Radeon 6490 HD I am using ubuntu 11.10  1st, when I boot into Windows, my GD is indeed AMD Radeon 6490 HD, but when I boot into Ubuntu, it shows that I have AMD Radeon 6470 instead.  2nd, I try most methods only to install driver for my AMD/ATI graphic card. First by jockey(fail, boot with unity 2D instead) and install manually (fail, boot into blank screen).   3rd, I give up using the AMD/ATI graphic card. Then I got a new problem. Both my graphic cards are powered on on startup, which causes my laptop to over heat.   I view the content of /sys/kernel/debug/vgaswitcheroo/switch  0:DIS: :Pwr:0000:01:00.0 1:IGD:+:Pwr:0000:00:02.0   Then I switch off IGD using echo OFF &gt; /sys/kernel/debug/vgaswitcheroo/switch and I get  0:DIS: :Off:0000:01:00.0 1:IGD:+:Pwr:0000:00:02.0   But after I reboot, the discrete graphic card is powered on again. How to solve this? To make sure that we are talking about the same, I would like to post the relevant definitions I know first.  Definitions:  A pair $(G, +)$ where $G$ is a set and  $+: G \times G \rightarrow G$  is called a commutative group if it has all of the following three characteristics:   (associativity): $\forall x,y,z \in G: (x+y)+z=x+(y+z)$ (identity element): $\exists e \in G \forall x \in G: e + x = x = x +e$ (inverse elements): $\forall x \in G \exists x^{-1} \in G: x^{-1} + x = e = x + x^{-1}$ (commutativity): $\forall x,y \in G: x+y=y+x$.     A triple $(\mathbb{K}, +, \cdot)$, where $\mathbb{K}$ is a set and  $+: \mathbb{K} \times \mathbb{K} \rightarrow \mathbb{K}$  $\cdot: \mathbb{K} \times \mathbb{K} \rightarrow \mathbb{K}$  is called a field if it has all of the following three characteristics:   $(\mathbb{K}, +)$ is a commutative group $(\mathbb{K} \setminus \{0\}, \cdot)$ is a commutative group distributive properties: $\forall x,y,z \in \mathbb{K}: x \cdot (y+z) = (x \cdot y) + (x \cdot z)$ and $\forall x,y,z \in \mathbb{K}: (y+z) \cdot x = (y \cdot x) + (z \cdot x)$     $\mathbb{N^+} := 1, 2, 3, 4, 5 ...$ (all positive integers)  $\mathbb{N}_0 := \{0\} \cup \mathbb{N}$ (the natural numbers with zero)  $\mathbb{N}$ can be both: $\mathbb{N^+}$ or $\mathbb{N}_0$.    My question: Does a field exist that has $\mathbb{N}$ as its set?  I know that $(\mathbb{Q}, +, \cdot)$ is a field and I know that $(\mathbb{N}, + )$ is only a commutative semigroup.   But maybe it's possible to define two mappings $\circ, *$ for $\mathbb{N}$ in such a way that $(\mathbb{N}, \circ, *)$ is a field.    Related:     The smallest field containing the integers is the field of rational   numbers.   Source: en-Wikipedia:   I don't know if this is true. If somebody can prove (or at least scribble the proof of) the quote it would be a good answer, I guess. Why does the reputation dropdown not show this upvote? How are multiple volunteers handled during the Reaping? While skimming through the first few chapters of The Hunger Games to answer another question, I noticed this sentence when Katniss is describing the rules surrounding volunteers after Prim's name is called (at the beginning of the second chapter):     In some districts, in which winning the reaping is such a great honor, people are eager to risk their lives, the volunteering is complicated.   The only reason I can see for volunteering being complicated is if there's more than one volunteer for a particular year, and I don't recall this ever being addressed in the books.  Is there anything in the books that I've missed or any reliable, external sources (interviews or other supplementary material by the author) that explain exactly how this situation is resolved? Let $A =$ {$(x,y,z) \in \mathbb{R}^3 |$  $x,y,z \geq 0$ and $x+y+z \leq 1$}.   Compute the integral $$\int_{A} x^m y^n z^p (1-x-y-z)^q dx dy dz$$  using new variables $u = x+y+z$, $v=\frac{y+z}{x+y+z}$, $w=\frac{z}{y+z}$.  Also, although it was not stated in the problem, I'm assuming that $m,n,p,q \in \mathbb{Z}$.   Since $f(x,y,z)=(x+y+z, \frac{y+z}{x+y+z}, \frac{z}{y+z}) = (u,v,w)$, $f^{-1}(u,v,w) = (u(1-v), uv(1-w), uvw)$  Thus J $= \begin{vmatrix} 1-v &amp; -u &amp; 0\\  v(1-w) &amp; u(1-w) &amp; -uv\\  vw &amp; uw &amp; uv\\ \end{vmatrix} = u^2v$  Skipping the part where I find the new limits of integration, and skipping some algebraic simplification we have:  $$\int_{A} x^m y^n z^p (1-x-y-z)^q dx dy dz$$   $$= \int_{0}^1 \int_{0}^1 \int_{0}^1 u^{m+n+p+2}(1-u)^q v^{n+p+1}(1-v)^mw^p(1-w)^n du dv dw$$  However, I have no  idea where to go from here. Any help would be much appreciated.