I'm not talking about Domino Effect or Murphy's Law, it's something else. I used to know it, but for the life of me, I can't seem to remember. Any help would be greatly appreciated. I think it was "something" effect. Lol. Please help guys or I won't be able to sleep tonight.
Something small goes wrong, and this triggers something slightly bigger, which triggers something slightly bigger, and so on and so forth until you end up with a chain of problems of increasing severity until it ends in catastrophy.  Something like the old saying "for want of a nail the battle was lost", only highlighting that each intermediate issue was a problem in its own right, not just a stepping-stone to the final disaster.  Is there a common word/phrase that specifically describes this? I'm thinking "cascade of ever-increasing problems", but this seems clumsy, and I suspect there might already be a neat word or expression that covers it.
How to use CDF and PDF statistics for analysis This may be too much of a general question but I hope I can find help here. I am starting a RA job in my university and my topic will be related to Internet Traffic Analysis. I am fairly new to the world of analysis but I guess in the world of research this is what I have to do a lot of.  I've been through a few papers and in a lot of them I find they use Probability Density (PDF), CDF, CCDF etc to explain the results they've obtained. For example, PDF of user session duration, CDF of bytes transferred each day etc. I have taken probability and statistics class so I understand what they are but I am still confused to the cases in which such representation would be chosen.  So, if there is anyone out there who does such graphs and analysis (in any other topic in general or this) could you tell me simply in what situation would I use one or the other of these representations How to install Windows 7 after Ubuntu and dual boot? I just installed Ubuntu, a full install removing the prior OS. I was forced to remove  from my  because of the max four partitions already being there. I didn't lose anything, all backed up. However, now I am looking to create another partition and install Windows&nbsp;7 on it.   Do I also need some sort of boot loader that lets me choose which to boot? How to make \left, \right pairs of delimiter work over multiple lines? I have a very long equation that must be separated into two lines, and it has several pairs of nesting \left \right delimiters. Unfortunately, it seems that they need to be on the same line in order for them to work.  Also I'm using the align environment because I need the aligning functionality. Is there a way to have the size of delimiters automatically adjusted over multiple lines? Why does my water pressure fluctuate? Let $b_n$ be a sequence which decreases monotonically to zero, prove $\sum b_nz^n$ converges for $|z|\leq 1$ and $z\neq 1$.  So I was able to prove it converges on the open unit disk in the complex plane, but except for a few special points on the boundary, such as $-1$ and $i$, where I was able to use the alternating series test, I can't seem to prove it converges in general on the boundary minus $z=1$.  I feel I have to somehow use the fact that all the numbers on the unit circle except $z=1$ rotate around and around as you raise them to higher and higher powers, thus you get the real and imaginary parts of your series to alternate between sets of positive and negative terms, but in a very irregular way for most initial angles.  I tried to simplify the problem by breaking the series into its real and imaginary parts, and then trying to prove they each converge separately, but I still can't prove either converges:  $$\sum_{n=0}^{\infty}b_ne^{n\theta i} = \sum_{n=0}^{\infty}b_n\cos(n\theta) +i\sum_{n=0}^{\infty}b_n\sin(n\theta).$$ What communication can be intercepted by network I'm connected over VPN to? I have to connect to client's network over VPN, and I was wondering if the client can intercept (and read) my Google Talk messages (or any other IM communication) while I'm VPN-ing.  My main concern is them having access to our internal conversations.  Suggest workarounds if you have any. I'd like to get an advanced frame in Firefall. I've been told that I can use "Pilot Tokens" to unlock other frames without having to pay money.  How soon would I be able to unlock an advanced frame? Do I have to level a base frame all the way to level 40? More than once? Which serial protocol or encoding scheme does this scoreboard use? I am trying to decode a signal stream coming from a Nevco scoreboard controller:    Packets like this are sent every ~2.7 ms.  I suspect it is some sort of UART signal because it is on the RX line of a ATMEGA48, but I cannot identify the finer protocol details like parity and stop bits. All the combinations I have tried returns junk data, so it may be another encoding scheme.  What's unusual is that the same signal is also sent to the MOSI pin of the microcontroller, but there is no clock signal anywhere.  A .vcd file is .   The shortest pulses (both high and low) are always 8us in length.    This is what two packets look like. Anyone got ideas? Given $n$ independent geometric random variables $X_n$, each with probability parameter $p$ (and thus expectation $E\left(X_n\right) = \frac{1}{p}$), what is $$E_n = E\left(\max_{i \in 1 .. n}X_n\right)$$    If we instead look at a continuous-time analogue, e.g. exponential random variables $Y_n$ with rate parameter $\lambda$, this is simple: $$E\left(\max_{i \in 1 .. n}Y_n\right) = \sum_{i=1}^n\frac{1}{i\lambda}$$  (I think this is right... that's the time for the first plus the time for the second plus ... plus the time for the last.)  However, I can't find something similarly nice for the discrete-time case.    What I have done is to construct a Markov chain modelling the number of the $X_n$ that haven't yet "hit". (i.e. at each time interval, perform a binomial trial on the number of $X_n$ remaining to see which "hit", and then move to the number that didn't "hit".) This gives $$E_n = 1 + \sum_{i=0}^n \left(\begin{matrix}n\\i\end{matrix}\right)p^{n-i}(1-p)^iE_i$$ which gives the correct answer, but is a nightmare of recursion to calculate. I'm hoping for something in a shorter form. In vanilla Gmail, clicking on a conversation alters the fragment ID in the URL, allowing you to link back to that conversation.  (It opens in its own Gmail interface.)  I am using the preview pane, which is great, except that the URL no longer updates when viewing specific emails, so there appears to be no way to get the link to the currently-viewed conversation.  (The 'open in new window' button doesn't help, since it pulls its contents in on the client side; it isn't a standalone link.)  The only solution I've found is to turn off the preview pane, find the message again in the list, open it, grab the link, go back to the message list, and turn preview pane back on.  That's fairly onerous for something I do often though (to clip Gmail conversations to Evernote, where my GTD setup lives). Why do people not upvote, or accept answers that worked for them? I am regular Stack Exchange user, especially at Stack Overflow.  One of the things I really dislike about new and sometimes veteran users is that:   Either they do not accept an answer that works for them, Or they accept the answer but do not vote it up   I mean they can really both accept the answer and vote it up but somehow they wouldn't =(.  How many of you feel the same way? Source Code Margin Comments In the paper "Beautiful Code Compelling Evidence", by J.R. Heard -- Code is formated in a particular way which includes margin comments. I am looking for a way to do this as I think it is a very clear way to comment comment code in a literate programming style. How to create immutable objects in Java? bash profile works for user but not sudo Which way is up? (electric outlet) My house has electric outlets in both orientations.  Which one is correct?  Should the ground hole be at the bottom or the top?    OR I've heard that Lubuntu consumes less resources than Ubuntu. Is it because of the fact that Lubuntu uses different desktop environment and window manager?  If so, would it be equivalent to install lubuntu-desktop on top of Ubuntu rather than doing a fresh install? WinterBash site exhibits some strange 404 behavior I was poking around winterba.sh for secret hats and I figured there may be a secret hat linked to a URL so I decided to look at some different URLs and got plenty of 404s but, some pages throw different 404s than others. Why?  Example:  throws the classic "Page Not Found" winterbash style... but  just has the text "404"  ( used to throw just the text "404" but since that has changed)  Still happening at 2016 with . I am having difficulty with this proof. I have previously proved that for an automorphism on the extension field $K$ of $F$ that when restricted to $F$ is the identity automorphism must take roots of $f(x)\in F[x]$ in $E$ to roots of $f(x)$ in $E$. I was thinking of using the minimal polynomial $x^{3}-2\in\mathbb{Q}[x]$ and the result of previous problem I solved, but I suspect there are automorphisms that don't fix the subfield, so the result can't be used or I need to prove that any automorphism of an extension field must fix the subfield that is being extended or always sends roots in $E$ to roots in $E$.  I am not asking for a solution to this, but maybe a hint or pointer in the right direction. This problem is introduced in the text prior to Galois theory, so please keep that in consideration. Can we re-request features that were declined a sufficient while ago? Reference help for "fuzzy mathematics" I want to study Fuzzy Sets and Fuzzy logic self. For that what would be better book to start from basic?