I'm new to Ubuntu. Can I use this window for upgrading but without any problems?   Does the update process delete or change other applications I'm using?
What are the different ways I can use to upgrade Ubuntu from one release to another?
Why does logging in to Stack Overflow keep me signed in to my Gmail email after logging out and regardless of the Stay signed in checkbox?  Steps to reproduce:   Browse to  and confirm you are logged out Browse to  and confirm you are logged out Click login Click Google Enter Email/Password and confirm Stay signed in is unchecked Click Sign in Click logout (up top) Click Logout (down below) Browse to  and confirm you are still logged in Click Sign out &lt;- Shouldn't clicking Logout on Stack Overflow be doing the same thing as this? Browse to  and confirm you are logged out     Answers are making sense but my frustration is that clicking Logout (twice) on StackOverflow essentially does nothing. If I proceed to click login and Gmail I am immediately authenticated because I still have an active Gmail cookie. In order to effectively logout I need to click Logout twice on Stack Overflow and then manually browse to  and Sign out. tar unpack : Unexpected EOF in archive I have downloaded eclipse-platform-3.7-linux-gtk-x86_64.tar.gz.  Using Ubuntu 10.10  64-bit on Intel 64-bit processor.  While trying to unpack the contents (either double-click or right-click &amp; open-with-archive-manager) I get this error:  gzip: stdin: unexpected end of file&lt;br/&gt; tar: Unexpected EOF in archive&lt;br/&gt;  tar: Error is not recoverable: exiting now   Is there any remedy to repair it? or is the downloaded file corrupt &amp; needs to be re-downloaded? I know I'm late with this; this could be the last bug report about the old topbar. But the text on the privilege progress indicator (on your profile page) appears above the dropdown menu coming from the Stack Exchange button, as can be seen in the picture below.     Changing the z-index property of .s-progress-bar._badge .-info, .s-progress-bar._privilege .-info from 2 to 1 solves the problem.    The new menu seems to have a high enough z-index so that this is no longer a problem anymore: verb or adjective in "The blue page is *stapled* to the red page"? If $x^n=y^n$ and $n$ is odd then $x=y$ Here, we suppose that $x,y\in\mathbb{R}$ and that $x^n=y^n$, where $n$ is odd. I want to prove that $x=y$.  Maybe we can use that $x^n-y^n=(x-y)(x^{n-1}+x^{n-2}y+...+xy^{n-2}+y^{n-1})$  So, it suffices to show that if $x^n=y^n$ then $x^{n-1}+x^{n-2}y+...+xy^{n-2}+y^{n-1}\neq 0$  Any hint? I have studied that  and motional emf are two different lines of thinking but are essentially same. But then, how can Faraday's paradox be explained by Faraday's law of induction? Particularly in paradoxes in which Faraday's law of induction predicts zero EMF but there is a non-zero . The wikipedia article is more confusing rather than enlightening.  I need an explanation regarding  EDIT : I wanted to know how is flux changing if faraday's law is valid . Should Java Objects be reused as often as it can be reused ? Or should we reuse it only when they are "heavyweight", ie have OS resources associated with it ?  All old articles on the internet talk about object reuse and object pooling as much as possible, but I have read recent articles that say new Object() is highly optimized now ( 10 instructions ) and Object reuse is not as big a deal as it used to be.  What is the current best practice and how are you people doing it ? How do we define capillary number in 2D (two dimensions) In 3D the capillary number $Ca$ is defined as: $$Ca=\frac{\nu \rho U}{\gamma}$$ where $\nu$ is the kinematic viscosity ($m^2/s$), $U$ is the velocity ($m/s$)and $\gamma$ is the interfacial tension ($N/m$) and $\rho$ is the density in $kg/m^3$ . However in 2D I will have $\rho$ in units of $kg/m^2$ (2D simulation), so how to find capillary number? Finding $\lim_{n\to\infty} a_n^n$ where $a_n=\frac{(n!)^2}{(n+k)!(n-k)!}$ Is there a characterization of the nonconstant entire functions $f$ that satisfy $|f(z)|=1$ for all $|z|=1$?   Clearly, $f(z)=z^n$ works for all $n$. Also, it's not difficult to show that if $f$ is such an entire function, then $f$ must vanish somewhere inside the unit disk. What else can be said about those functions?  Thank you. Java: Difference between the setPreferredSize() and setSize() methods in components Your Mileage May Vary In the United States we have a saying, "your mileage may vary", which means "your experience may be different".  In English-speaking countries that don't use Imperial miles, is there an equivalent expression? Why is the Converse to Lagrange's Theorem False? Don't impose delay loading Close dialog when you haven't just loaded it Because of , clicking the "close" link on a question that's been edited (for me usually the edit comes in a half-second before, as I'm reaching for the link) reloads the question instead of opening the Close dialog. Clicking it again to actually open the close dialog says     You may only open the Close dialog every three seconds   I didn't open it, I refreshed the post.  And yes, there are lots of times when the post edit is so trivial it's obvious in less than a second that it doesn't affect the need to close the question. Charging Li-ion batteries in parallel I wanted some opinion on my set up here, just to make sure I got the basics right.  I have a Li-ion battery charging circuit based on the MCP73113. This is designed to be a single-cell battery charger.   The battery itself (3.7V, 650mAh) comes with its own PCB with Schottky diode and current regulators as protection. EDIT: Not a Schottky diode. Current limiter and a Protection IC.  By design, they work together just fine.  I have more batteries from the same manufacturer and wanted to make higher capacity packs by putting two cells in parallel. The two cells come with their own PCB, but I only kept one of them, as I soldered their leads together. It seems to work and they are charged and discharged just like regular batteries (3.7V, now 1300 mAh).  However, not all the packs I made work smoothly and I get a failure rate of 2 in every 10 packs. They all start out normally, but occasionally when the batteries are not charged for some time, or are used up, they tend to not work anymore. So far, in only 1 pack I found the voltage to be different (both now below 2V, aka dead).  I assume my method is not the right approach to ensure 100% success rate, so I was wondering how can this be solved. All the controllers I looked into was designed for multiple cells in series, not parallel. Am I fundamentally missing something here? This works perfectly:  $ inotifywait --event create ~/foo Setting up watches. Watches established. /home/ron/foo/ CREATE bar   However, this just sits there when directory tun0 is created under /sys/devices/virtual/net.  $ inotifywait --event create /sys/devices/virtual/net Setting up watches. Watches established.   Since those folders are world readable, I'd expect inotifywait to work.  So, what am I doing wrong?  Thanks How to secure Elliptic Curve ElGamal encryption against known plaintext attacks? If I have an encoding function  $f(x)$ that maps a message $m$ to a point $P$ on a suitable Elliptic Curve $E$ . If I have the public key $Q$ of my recepient then I can encrypt the message as follows:  Choosing a random number $k &lt; n -1 $ where $n$ is the order of the curve E .  Calculating $C = [k] G $ where $G$ is the generator point of the curve E   Calculating $R = [k]Q $ where $Q$ is the recipient's public key   Now the message is encrypted by adding $P$ to $R$ to get          $C_e$ $( = R + P)$ which is sent along with $C$ to the recepient.  DECRYPTION:  Now for the recepient to decrypt my message they compute $R = [privatekey] C $ (where $C = [k]G $) and simply subtract $R$ from $C_e$ to get the encoded point $P$ back which is then decoded by an inverse function $f^{-1}(x)$ to recover $m$.  Now , two problems arise : If the attacker knows the plaintext (suppose if I follow a particular format of data while sending messages ) he could encode his guessed plaintext and subtract it from $C_e$ to recover $ R $ back ! . If I used that same $ R  $ to encrypt further "blocks" of my message then the security of the later parts of my message has been breached!   I realize that doing  something like a scalar multiplication over and over again for every block of data, would be a huge drawback in efficiency and speed.   Is there any way to compute a different $ R $ for every block of data, without using much resources and that too quickly ?   Does reusing the same $R$ for another message break security ?  NOTE: This question is for educational purposes only. It's for the sake of expanding my knowledge on Crypto. As a follow up to my other , I would like to know whether the following is possible:  I have $20,000 in my brokerage account The price of a call option with $300 strike price is $5.00 (1 contract = 100 shares) I buy 20 contracts of these $300 calls (cost is 20 * 5 * 100 = $10,000) The price of the underlying goes up, making my option in-the-money  I decide to exercise my options. Exercising my calls means that I buy 20 * 100 = 2,000 shares of the underlying at $300 per share. However, I only have $10,000 left in my brokerage account and am unable to pay for the shares (2,000 * 300 = $600,000). What now? How does this work? Do brokers recognize that my position is profitable, and buy and sell the underlying for me as soon as I exercise my calls? In other words, do I need to worry about being able to pay for the shares of the underlying if I decide to exercise my options? Can I just take my profit without bothering with the shares at all? Why is this sentence correct? “She suggested that he go to the cinema.” Nice proofs of $\zeta(4) = \frac{\pi^4}{90}$? I know some nice ways to prove that $\zeta(2) = \sum_{n=1}^{\infty} \frac{1}{n^2} = \pi^2/6$.  For example, see  or the answers to the question "?"  Are there any nice ways to prove that $$\zeta(4) = \sum_{n=1}^{\infty} \frac{1}{n^4} = \frac{\pi^4}{90}?$$  I already know some proofs that give all values of $\zeta(n)$ for positive even integers $n$ (like #7 on Robin Chapman's list or Qiaochu Yuan's answer in the linked question).  I'm not so much interested in those kinds of proofs as I am those that are specifically for $\zeta(4)$.  I would be particularly interested in a proof that isn't an adaption of one that $\zeta(2) = \pi^2/6$.