How do I get the total population of each specific year from a table in SQLServer?
How to get Total Pupulation From Tables In Sqlserver?
Output of which command used for input to cd I would like to take the output of a which command, and cd to the parent directory. For example, say I have the following:  which someprogram   With output:  /home/me/somedirectory/someprogram   And I would like to cd to the directory that someprogram lives in:  cd /home/me/somedirectory   I'd like to accomplish this in one line. What is the most elegant, tricky, short way to do this? Eeeeek - what happened to my @ salutation? How to get sudo to prompt you for a password each time How do I set up my studio for shooting large rugs from the ceiling? I was asked to prove the following:  If $\{ E_1,E_2,\ldots,E_n\}$ is a fully independent set of events, prove that:  $$ P\left(\bigcup_{i = 1}^n E_i \right) = 1 - \prod_{i = 1}^n \left[ 1 - P(E_i) \right]  $$  (Hint: use complements)  I got the following:  Let $\alpha = E_1\cup E_2 \cup \cdots \cup E_n = \{E^C_1 \cap E^C_2 \cap \cdots\cap E_n^C\}^C$. Then, $\alpha^C = \{ E^C_1 \cap E^C_2 \cap \cdots \cap E^C\} $.  Assuming that the set of complements of each ${E_i}$ is also fully independent, we have:  \begin{align} &amp; P(\alpha^C) = \prod_{i = 1}^n P(E_i^C)  = \prod_{i = 1}^n \left[ 1 - P(E_i) \right] \\ &amp; P(\alpha) = 1 - P(\alpha^C) = 1 - \prod_{i = 1}^n \left[ 1 - P(E_i) \right] \\ &amp; P(\bigcup_{i = 1}^n E_i) = 1 - \prod_{i = 1}^n \left[ 1 - P(E_i) \right] \end{align}  However, even though I know (by Googling it) that my assumption is true, I'm unable to prove it so I could validly use it as a lemma. Is there another way to prove this equality? How to modify the system default background image I am about to ship a new 10.04 installed system to a customer. This is the 1st system that we are shipping with our preinstalled software and an additional hardware test platform, so I thought it would be a nice idea to have the desktop wallpaper include our company's logo.  What I want to do is just to add the logo to the default background image. the questions are:   Where are the set of backgrounds stored? What are the rules for creating a custom background from scratch? If I create a background from scratch, how do I add it to the system's background set (i.e., not just save it in the user's Pictures directory - I want it to be available to all future users of the machine)? As far as I see the "Blatantly off-topic" flag      Blatantly off-topic (this question has nothing to do with %site topic%)    is only available for low-rep users without the close vote privilege.  What is the reason to remove this option for high-rep users? I think it could be very usefull in some cases where now we must select      Other (add a comment explaining what is wrong)    option and waste time to type obvious message for a reason. Should I use the singular or plural verb in mathematical formulae ("Two and two make/makes four")? Can graduated Stack Exchange sites get closed too? Getting Windows 7 admin account password? Can I use HMAC-SHA1 in counter mode to make a stream cipher? Say I have an embedded device which is only capable of doing HMAC-SHA1 transformations (that device is, in fact, a YubiKey).  Would it be secure to feed it like a block cipher in counter mode to get a random pad suitable as an stream cipher?  Of course, I'm talking about not repeating the counter value ever to encrypt data (so this construction would also need some random IV or treating the counter value as a nonce forever). An excerpt from Introduction to Analytic Number Theory by Tom M. Apostol.      I have three main concerns regarding this proof:    What is the abscissa of convergence for $\frac{1}{F(s)}$ - why can we take the product of the two series. I only know this is true if the two series are absolutely convergent.  Why can we do term by term integration? I believe its suffices to show that the series converges locally uniformly - BUT is this true?  How does the proof show that $G(s)$ converges uniformly? Omission of "the" in "elected him president" and "made captain" Machine learning cookbook / reference card / cheatsheet? I find resources like the  and  incredibly useful. They obviously serve well as references but also help me to organize my thoughts on a subject and get the lay of the land.   Q: Does anything like these resources exist for machine learning methods?  I'm imagining a reference card which for each ML method would include:   General properties When the method works well When the method does poorly From which or to which other methods the method generalizes. Has it been mostly superseded? Seminal papers on the method Open problems associated with the method Computational intensity   All these things can be found with some minimal digging through textbooks I'm sure. It would just be really convenient to have them on a few pages. I want to start using the terminal more often, but I don't know what are the different commands available to me. Is there a way to list all the different commands that I can make use of? Worldwide Dissertation Database? or French, German, Italian ones? Is there a global/worldwide database of dissertations? If not, how can I access French, German, Italian, etc. dissertations online? Cycles Normal Bake does'nt bake indents that are not tapered Q: Will there be, or have there been, any “late blooming” students in the school who come into their magic potential as adults, rather than as children? By the way, I loved meeting you, and hearing you speak, when you came to Anderson's in Naperville. I can hardly wait until you tour again. JKR: Ahhh! I loved the event at Anderson’s. It was one of my favorites. That is completely true. No, is the answer. In my books, magic almost always shows itself in a person before age 11; however, there is a character who does manage in desperate circumstances to do magic quite late in life, but that is very rare in the world I am writing about. (src: )  Who was JKR referring to in “there is a character”? Clearly, it not a student; so the most obvious guess of &quot;Neville Longbottom&quot; is wrong – both due to “no” answer regarding the question itself, and the fact that Neville bloomed in his 6th/7th year, well before you can legitimately term “quite late in life”. I accidentally deleted a file from my laptop. I'm using Fedora. Is it possible to recover the file? Prove by induction that for all $n \geq 3$: $n^{n+1} > (n+1)^n$