I am facing problems with library dependencies when trying to install sphirewall-core. Is there any way to solve this or to install that dependencies?  These are the steps I followed:   $ sudo apt-get install sphirewall-core Reading package lists... Done Building dependency tree        Reading state information... Done Some packages could not be installed. This may mean that you have requested an impossible situation or if you are using the unstable distribution that some required packages have not yet been created or been moved out of Incoming. The following information may help to resolve the situation:  The following packages have unmet dependencies:  sphirewall-core : Depends: libboost-random1.49.0 (>= 1.49.0-1) but it is not installable                    Depends: libboost-regex1.49.0 (>= 1.49.0-1) but it is not installable                    Depends: libboost-serialization1.49.0 (>= 1.49.0-1) but it is not installable                    Depends: libboost-system1.49.0 (>= 1.49.0-1) but it is not installable                    Depends: libboost-thread1.49.0 (>= 1.49.0-1) but it is not installable                    Depends: libprocps0 (>= 1:3.3.2-1) but it is not installable                    Depends: libboost-random1.49-dev but it is not installable E: Unable to correct problems, you have held broken packages.
After upgrading from 10.04 to 12.04 I am trying to install different packages.  For instance ia32-libs and skype (4.0).  When trying to install these, I am getting the 'Unable to correct problems, you have held broken packages' error message.   Output of commands:  sudo apt-get install -f Reading package lists... Done Building dependency tree        Reading state information... Done 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.   After running this:  sudo dpkg --configure -a foo@foo:~$ sudo apt-get install -f Reading package lists... Done Building dependency tree        Reading state information... Done 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.
How to get from Gatwick airport to Paddington? What's the most straightforward way to get from Gatwick airport to Paddington station in London using public transport?   I'm mostly interested in travel time &amp; general smoothness of the trip (e.g. buying just one ticket for the whole trip would be nice). Price is a secondary concern. When certain nationalities of people want to travel in the Schengen zone, they are required to apply for a Schengen visa. This is a straight-forward process for most, but when an applicant has had problems with removals or refusals they may be reluctant to apply because they want to avoid the complexities of serial visa refusals. This reluctance may lead some into wondering how their history can be expunged, and this line of thought inevitably leads to the idea of getting their passport replaced with a new one.  This sounds like a great formula for people who have had prior refusals or removals.  In essence they can become 'reincarnated' as a first-time traveller and hence avoid the unpleasantness of revealing their prior interactions with the Schengen authorities.  The relevant parts of the application form are shown here...    Nothing asks about a prior removal or refusal, and the applicant is left with simple denials for 3 questions in order to present themselves as a first-time traveller.  Assuming the person is happy to set aside the moral issues associated with denying their history, are there any holes to this strategy?  This question is scoped to Schengen visa applications so that it will not be unmanageably broad, but answers from other regimes (particularly the affluent Commonwealth and the USA) are acceptable as long as the main points are relatively consistent with Schengen. I recently came across the paper . The author raised a few common misconceptions regarding hypothesis testing and p-values, about which I have two specific questions:   The p-value is technically $P({\rm observation}|H_{0})$, which, as pointed out by the paper, generally does not tell us anything about $P(H_{0}|{\rm observation})$, unless we happen to know the marginal distributions, which is rarely the case in "everyday" hypothesis testing. When we obtain a small p-value and "reject the null hypothesis," what exactly is the probabilistic statement that we are making, since we cannot say anything about $P(H_{0}|{\rm observation})$? The second question relates to a particular statement from page 6(652) of the paper:      Since the p-value, or range of p-values indicated by stars, is not set a priori, it is not the long-run probability of making a Type I error but is typically treated as such.   Can anyone help to explain what is meant by this statement? Martingale formulation of Bellman's Optimality Principle From David Williams' Probability with Martingales     Related question:   What I tried: For no 2, if $\ln Z_n - n \alpha$ is a supermartingale, then for $m &lt; n$, $$E[\ln Z_n - n \alpha | \mathscr F_m] \le \ln Z_m - m \alpha$$ $$ \to E[\ln Z_N - N \alpha | \mathscr F_0] \le \ln Z_0 - 0 \alpha$$ $$ \to E[\ln Z_N - N \alpha] \le \ln Z_0$$ $$ \to E[\ln \frac{Z_N}{Z_0}] \le N \alpha$$ Is that right?  For no 1, for $m &lt; n$, $$E[\ln Z_n - n \alpha | \mathscr F_m] = E[\ln Z_n | \mathscr F_m] - n \alpha$$ $$ = E[\ln \frac{Z_n}{Z_0} | \mathscr F_m] - n \alpha + \ln Z_0$$ $$ = E[\ln \frac{Z_n}{Z_{n-1}} | \mathscr F_m] + ... + E[\ln \frac{Z_{m+1}}{Z_{m}} | \mathscr F_m]$$ $$+ \ln \frac{Z_m}{Z_{m-1}} + ... + \ln \frac{Z_{1}}{Z_{0}} - n \alpha + \ln Z_0$$ Note that $$Z_n - Z_{n-1} \le |Z_n - Z_{n-1}| \le C_n |\epsilon_n - \epsilon_{n-1}| \le 2C_n \le 2Z_{n-1}$$ Also, I think $$\ln \frac{Z_n}{Z_{n-1}} \le |Z_n - Z_{n-1}|$$ Hence we have $$E[\ln \frac{Z_n}{Z_{n-1}} | \mathscr F_m] + ... + E[\ln \frac{Z_{m+1}}{Z_{m}} | \mathscr F_m]$$ $$+ \ln Z_m - n \alpha$$ $$\le E[2Z_{n-1} | \mathscr F_m] + ... + E[2Z_{m} | \mathscr F_m]$$ $$+ \ln Z_m - n \alpha$$ $$= 2(E[Z_{n-1} | \mathscr F_m] + ... + E[Z_{m} | \mathscr F_m])$$ $$+ \ln Z_m - n \alpha$$ One thing to do would be to show that $$2E[Z_{n-1} | \mathscr F_m] + ... + 2E[Z_{m} | \mathscr F_m] \le (n-m) \alpha$$ possibly by showing that $2E[Z_{\{\cdot\}} | \mathscr F_m] \le \alpha$ How would I do that? Something else: $$E[\ln \frac{Z_n}{Z_m} | \mathscr F_m] + \ln Z_m - n \alpha$$ $$ \le E[|Z_n - Z_m| | \mathscr F_m] + \ln Z_m - n \alpha$$ $$ \le E[2Z_m | \mathscr F_m] + \ln Z_m - n \alpha$$ $$ \le 2Z_m + \ln Z_m - n \alpha$$ Now $2Z_m \le (n-m) \alpha?$ We have $$2Z_m = 2\sum_{k=1}^{m} C_k(\epsilon_k - \epsilon_{k-1})$$ $$\le 2\sum_{k=1}^{m} Z_{k-1}$$ I'm not quite sure how to show that $$2\sum_{k=1}^{m} Z_{k-1} \le (n-m)\alpha$$ if that's even true. How can/else can I approach this problem?  For no 3, no idea. Any hints? I think it has something to do with a stopping time. Might we have to use the ff lemma (red box):    ? Merge two PDF files containing even and odd pages of a book I have two searchable PDF  documents, say even.pdf and odd.pdf which contain even and odd pages of a book, respectively.   I can decompile each PDF to separate files 001.pdf 002.pdf 003.pdf, et cetera. The question is how to merge them?  They are both even and odd sequences numbered 1, 2, 3. If the numbering in the decompile process with pdftk were different, e.g. 1, 3, 5 for even and 2, 4, 6 for odd instead of 1, 2, 3, 4, I could simply merge them.  Can I do this any other way? Using X11 in OSX 10.8.3 : "ld: library not found for -lX11" Is it possible that $a_n>0$ and $\sum a_n$ converges then $na_n \to 0$? (without assuming $a_n$ is decreasing) What's using up my disk space? My Vista 64 installation has drive C, a 150 GB hard drive.  I also has a 1.5 TB drive D.  My C drive has 12.3 GB free.  I don't know what's using up all the space.  There's almost 83 GB unaccounted for!!!  As per  question and  question, I downloaded  and .  WinDirStat, once I found the right options, tells me there's 82.9 GB of .  SpaceMonger, which has a particularly nice display of the data, tells me there's 82.3 GB "Unscanned", with 2 unscannable folders.  Where do I turn now?  Both tools roughly agree there's a large amount of data on my drive, but neither seem to be able to tell me what.  I've tried the standard approach; disk cleanup, remove hibernation file, set the virtual memory to the D drive instead of the C drive. Select first occurring element after another element $\sum \cos$ when angles are in arithmetic progression Possible Duplicate:          Prove $$\cos(\alpha) + \cos(\alpha + \beta) + \cos(\alpha + 2\beta) + \dots + \cos[\alpha + (n-1)\beta] = \frac{\cos(\alpha + \frac{n-1}{2}\beta) \cdot \sin\frac{n\beta}{2}}{\sin\frac{\beta}{2}} $$ How do I find least cost path over a DEM based on slope magnitude and direction? What sort of algorithms can I use to find a least cost path through a DEM where it costs more to traverse a cell going downhill or uphill than it does to follow the contour of the land?  All the examples I've seen involve creating a least cost surface where the magnitude of the slope is part of the cost - but the direction isn't.    Additionally, the examples assume the cost to travel through a cell does not depend on the direction of travel. The problem of counting the solutions $(a_1,a_2,\ldots,a_n)$ with integer $a_i\geq0$ for $i\in\{1,2,\ldots,n\}$ such that $$a_1+a_2+a_3+....a_n=N$$ can be solved with a stars-and-bars argument. What is the solution if one adds the constraint that $a_i\leq r_i$ for certain integers $r_1,\ldots,r_n$?  e.g. for $n=3$, $N=6$ and $(r_1,r_2,r_3)=(3,3,2)$, the tuple $(a_1,a_2,a_3)=(2,3,1)$ is a solution, but $(2,1,3)$ is not a solution because $a_3=3&gt;2=r_3$. Modify a class definition's annotation string parameter at runtime Why aren't variable-length arrays part of the C++ standard? Where can I ask questions regarding Firefox? I can't seem to find info on installing a Swedish language package on my machine. The language is not listed  and the hits on Google I got led nowhere (or, rather, to the said page).  Where can I ask such a question (within the realm of Stack Exchange)? How do I set up an email server? Touch enabled monitors and Android Can long term sleeping at day damage your health? I've passed half or more of my life, sleeping in very late and often after the sun rises. Now I believe that I'm already feeling its effect. Some of my hormones are under the ideal levels and I have a deficiency in vitamin D.  What are the effects of sleeping during the day and not at night for work reasons or just habit? Is there any effect that can't be reversed simply by sleeping at night? (Assuming that you are sleeping enough time per day like 7-8 hours)  Could this sleep pattern be related to endocrine ills and other ills? Best choice between using \\ or leaving space after each paragraph to end the paragraph Here is the thing, I have always used a blank space between paragraphs in order to tell latex that there is a new paragraph. But there is someone I work with very often that keeps using \\ to break a line after a paragraph...  This is really annoying so I wanted to know if there is a real advantage of using \\ over just leaving a space.  Note that I am not referring to the paragraph environment, but to the simple term paragraph. Short story or novel from the 1970s or before about two warring alien tribes