I had not installing any packages recently, but when i launched Software center, I saw a message: "Item cannot be installed or removed..."  /i am translating dumps from foreign language, so it might be not super precise with original/      those solutions didnt work at all. I have some kind of paradox:  sudo apt-get install -f   tells me, that 2 packages will be installed: libdbus-glib-1-2:i386 libnspr4:i386 (and there is need to download 0 B/217 kB of archives) - strange; why it needs i386 deps in x64 arch system anyway?  I choose Y and it dumps:  (Reading database ... 300571 files and directories currently installed.) Unpacking libdbus-glib-1-2:i386 (from .../libdbus-glib-1-2_0.98-1ubuntu1.1_i386.deb) ... dpkg: processing error /var/cache/apt/archives/libdbus-glib-1-2_0.98-1ubuntu1.1_i386.deb (--unpack):  './usr/share/doc/libdbus-glib-1-2/changelog.Debian.gz' is different from the same file on the system Missing report of program apport, becouse MaxReports limit reached Unpacking libnspr4:i386 (from .../libnspr4_4.9.5-0ubuntu0.12.04.1_i386.deb) ... dpkg: processing error /var/cache/apt/archives/libnspr4_4.9.5-0ubuntu0.12.04.1_i386.deb (--unpack):  './usr/share/doc/libnspr4/changelog.Debian.gz' is different from the same file on the system Missing report of program apport, becouse MaxReports limit reached dpkg-deb: error: subprocess paste was killed by signal (Interrupted stream) There were errors while processing:  /var/cache/apt/archives/libdbus-glib-1-2_0.98-1ubuntu1.1_i386.deb  /var/cache/apt/archives/libnspr4_4.9.5-0ubuntu0.12.04.1_i386.deb E: Sub-process /usr/bin/dpkg returned an error code (1)   therefore I've removed /var/cache/ folder just in case;  then tried to install required deps independently:  sudo apt-get install libdbus-glib-1-2:i386   dumped:  You need to use "apt-get -f install", to repair following problems: Following packages has broken dependencies:  libnss3:i386 : Requires: libnspr4:i386 (&gt;= 4.8.6) but it will be not installed E: Broken dependencies. Please try use "apt-get -f install" without packages (or give a solution).   so then I did:  sudo apt-get install libnspr4:i386   and it dumped:  You need to use "apt-get -f install", to repair following problems: Following packages has broken dependencies:  libgconf-2-4:i386 : Requires: libdbus-glib-1-2:i386 (&gt;= 0.78) but it will be not installed E: Broken dependencies. Please try use "apt-get -f install" without packages (or give a solution).   both needs each one to allow install other one? paradox? i am in mess.  ps, if no solutions will be found to this I can copy packages from other working mirror pc /just dont want to clone whole partition/, which folder is used for storing this packages?
Encountered an error while updating through Synaptic Manager. Subsequent updates gave the error at the bottom of the output. I'm a noob so any help is appreciated.  al@al:~$ sudo apt-get -f upgrade Reading package lists... Done Building dependency tree        Reading state information... Done Correcting dependencies... Done The following NEW packages will be installed:   libjack-jackd2-0:i386 The following packages have been kept back:   linux-headers-generic skype 0 upgraded, 1 newly installed, 0 to remove and 2 not upgraded. Need to get 0 B/202 kB of archives. After this operation, 493 kB of additional disk space will be used. Do you want to continue [Y/n]? y (Reading database ... 310056 files and directories currently installed.) Unpacking libjack-jackd2-0:i386 (from .../libjack-jackd2-0_1.9.8~dfsg.2-1precise1_i386.deb) ... dpkg: error processing /var/cache/apt/archives/libjack-jackd2-0_1.9.8~dfsg.2-1precise1_i386.deb (--unpack):  './usr/share/doc/libjack-jackd2-0/buildinfo.gz' is different from the same file on the system dpkg-deb: error: subprocess paste was killed by signal (Broken pipe) Errors were encountered while processing:  /var/cache/apt/archives/libjack-jackd2-0_1.9.8~dfsg.2-1precise1_i386.deb E: Sub-process /usr/bin/dpkg returned an error code (1)
Prove that $n! + k$ is a composite number What is the difference between "source x", ". x" and "./x" in Bash? Is there a name for function with the exponential property $f(x+y)=f(x) \cdot f(y)$? I was wondering if there is a name for a function that satisfies the conditions  $f:\mathbb{R} \to \mathbb{R}$ and $f(x+y)=f(x) \cdot f(y)$?  Thanks and regards! Meaning of Sun Lamp Size? In Cycles, a sun lamp is treated as infinitely far away - only the angle matters, not the position. Other lamps have their sizes defined in blender units: a point lamp with size 1 emits light from a area with size of 1. But if a sun lamp at infinity had a size of 1 blender unit, the angular arc of that sun would be nonexistent.  Clearly, when you change the size of a sun lamp, shadows get fuzzier or sharper. But what does that actually mean? What are you changing? On the left is the normal map generated by the Bevel node. On the right is an unbeveled cube with the Bevel node in action. I wish to convert this to a BW map where The edges/gradients are highlighted and the rest isn't. Does anyone know if this can be achieved with more nodes? Just noticed a minor css issue on this question:    The related questions on the right hand side have some overlapping text in Chrome:        (This only applies to this very site, Meta Stack Exchange) This seems to be a basic issue, but I just realized that I actually don't know how to test equality of coefficients from two different regressions. Can anyone shed some light on this?   More formally, suppose I ran the following two regressions:  $$ y_1 = X_1\beta_1 + \epsilon_1 $$ and  $$ y_2 = X_2\beta_2 + \epsilon_2 $$ where $X_i$ refers to the design matrix of regression $i$, and $\beta_i$ to the vector of coefficients in regression $i$. Note that $X_1$ and $X_2$ are potentially very different, with different dimensions etc. I am interested in for instance whether or not $\hat\beta_{11} \neq \hat\beta_{21}$.   If these came from the same regression, this would be trivial. But since they come from different ones, I am not quite sure how to do it. Does anyone have an idea or can give me some pointers?   My problem in detail: My first intuition was to look at the confidence intervals, and if they overlap, then I would say they are essentially the same. This procedure does not come with the correct size of the test, though (i.e. each individual confidence interval has $\alpha=0.05$, say, but looking at them jointly will not have the same probability). My "second" intuition was to conduct a normal t-test. That is, take   $$ \frac{\beta_{11}-\beta_{21}}{sd(\beta_{11})} $$  where $\beta_{21}$ is taken as the value of my null hypothesis. This does not take into account the estimation uncertainty of $\beta_{21}$, though, and the answer may depend on the order of the regressions (which one I call 1 and 2).   My third idea was to do it as in a standard test for equality of two coefficients from the same regression, that is take  $$ \frac{\beta_{11}-\beta_{21}}{sd(\beta_{11}-\beta_{21})} $$   The complication arises due to the fact that both come from different regressions. Note that   $$ Var(\beta_{11}-\beta_{21}) = Var(\beta_{11}) + Var(\beta_{21}) -2 Cov(\beta_{11},\beta_{21}) $$ but since they are from different regressions, how would I get $Cov(\beta_{11},\beta_{21})$?  This led me to ask this question here. This must be a standard procedure / standard test, but I cound not find anything that was sufficiently similar to this problem. So, if anyone can point me to the correct procedure, I would be very grateful! Calculator Program improvements I'm pretty new to programming and made a few programs so far. I recently made a Calculator program and I hope you guys could tell me what I could do to improve. int firstNumber; string sign; int secondNumber; int answer;  Console.WriteLine(&quot;Input Number:&quot;); firstNumber = Convert.ToInt32(Console.ReadLine()); Console.Clear();  Console.WriteLine(&quot;Input Sign:&quot;); sign = Console.ReadLine(); Console.Clear();  Console.WriteLine(&quot;Input Second Number:&quot;); secondNumber = Convert.ToInt32(Console.ReadLine()); Console.Clear();  switch (sign) {     case &quot;+&quot;:         answer = firstNumber + secondNumber;         Console.WriteLine(answer);         Console.ReadKey();     break;     case &quot;-&quot;:         answer = firstNumber - secondNumber;         Console.WriteLine(answer);         Console.ReadKey();     break;     case &quot;*&quot;:         answer = firstNumber * secondNumber;         Console.WriteLine(answer);         Console.ReadKey();     break;     case &quot;/&quot;:         answer = firstNumber / secondNumber;         Console.WriteLine(answer);         Console.ReadKey();     break;     default:         Console.WriteLine(&quot;Invalid Input&quot;);     break; } If you make a search for something that returns more than 10,000 items in result. For example, search for  return 161,338 results on MSE. But if you select a page where 10,000+ result should be shown:        In the edge case  shows zero results:        But this is actual for any page where per_page * page_number is more than 10,000.  Though this does not happen for Stack Overflow in English. It looks like all other sites are affected.  Related bug report on ruSO.meta: Probability of winning the game 1-2-3-4-5-6-7-8-9-10-J-Q-K A similar question to mine was answered here on stackexchange:    However, I am unable to follow the formulas so perhaps someone could show the calculation and the way they arrived at it to answer this question.  My card game is very similar, except the counting of cards goes all the way from 1 (Ace) through to King and then restarts.  If you can make it through an entire deck of cards without hitting the same ranked card you win.  So, for example, if you call out Ace - 2 -3 - 4 - 5 - 6, etc. and hit "7" when you've just called out "7", you lose.  What is the chance of winning this card game? Can I uninstall and reinstall Ubuntu Software Center? How to see data from .RData file? When is unbalanced data really a problem in Machine Learning? We already had multiple questions about unbalanced data when using , , ,  and a number of other similar questions, what makes it a very popular topic! Unfortunately, each of the questions seems to be algorithm-specific and I didn't find any general guidelines for dealing with unbalanced data.  Quoting , dealing with unbalanced data     (...) heavily depends on the learning method. Most general purpose   approaches have one (or several) ways to deal with this.   But when exactly should we worry about unbalanced data? Which algorithms are mostly affected by it and which are able to deal with it? Which algorithms would need us to balance the data? I am aware that discussing each of the algorithms would be impossible on Q&amp;A site like this, I am rather looking for a general guidelines on when it could be a problem. My computer boots to a black screen, what options do I have to fix it? Problem: A lot of the time I downvote something that clearly shows lack of research or effort on OP's part, and when they edit to improve it, I usually find out pretty late, because there are no notifications to help with that.  Proposition: add a Get notified when this post is edited button/checkbox under a post which you have downvoted (per post, not just all posts ever), so that if there is a significant improvement, you could remove your downvote or even change it to an upvote to show you recognize the improvement.  I believe this would improve public thinking about votes, and make people (who choose to participate like this on the SE sites more often) vote more freely and more often, and everybody else would not think of a &lt;0 post score as a death sentence for their contribution.  I'm not asking to enable this on SO (for a number of obvious reasons), and that's why I propose an opt-in subscription. This would be most useful on lower activity sites like the SE, in my opinion, but who knows.    I want to know if someone has improved their post after a downvote to reinforce the positive behavior and I get -4 on my good intentions? What kind of culture are you trying to cultivate? Please, explain why you disagree without silently downvoting. If you think there's a better way, yes, I want to know your thoughts. A generalized version of the second Borel-Cantelli lemma says     Theorem 5.3.2. Second Borel-Cantelli lemma, II. Let $\mathcal F_n, n \ge 0$ be a filtration   with $F_0 = \{\emptyset, \Omega\}$ and $A_n , n \ge 1$ a sequence of events with $A_n ∈ \mathcal F_n$ . Then   $$ \{A_n \,i.o.\} = \left\{\sum_{n \ge 1} P (A_n |\mathcal F_{n−1}) =\infty \right\}. $$   An exercise of this lemma is     Exercise 5.3.6. Show    $\sum_{n \ge 2} \mathbb P (A_n | \cap_{m=1}^{n−1} A_m^c ) = \infty$ implies $P (∩_{m \ge 1} A_m^c ) = 0$.   I think we can actually prove that $\cap_{m \ge 1} A_m^c = \emptyset$. My proof is like this: Let $B_n = \cup_{m = 1}^n A_n$. Let $\mathcal F_n = \sigma(A_1,\dots,A_n)$, which forms a filtration. It is easy to verify that $$ \mathbb P (A_n | B_{n-1}^c ) = \mathbb P (A_n | \mathcal F_{n-1})(\omega) $$ when $\omega \in B_{n-1}^c$.  Assume there exist $\omega \in \cap_{m \ge 1} A_m^c$. It follows from the previous lemma that $$ \omega \in \left\{\sum_{n \ge 1} P (A_n |\mathcal F_{n−1}) =\infty \right\} = \{A_n \,i.o.\}. $$ In other words, $\omega \in \cap_{m \ge 1} \cup_{n \ge m} A_n$, which contradicts $\omega \in \cap_{m \ge 1} A_m^c$.  Is this the right proof? In Pillow Problems and a Tangled Tale Lewis Carroll presents the following problem:     A bag contains a counter, known to be either white or black. A white counter is put in, the bag is shaken, and a counter is drawn out, which proves to be white. What is now the chance of drawing a white counter?   One can easily reason that in the end, the bag must be in one of three states:   Black remains, new white taken New white remains, original white taken Original white remains, new white taken   In two of those states, a white counter remains to be drawn. Therefore, the chance is 2/3.  How can one arrive to this answer using Bayes' theorem? How does searching a file (locate) or autocompletion work? I am a Windows user and coming from Windows with all the indexing and eternal wait times when searching for files, I find it surprising how fast does locate work or the autocompletion (that I know) work in linux.  Is there any indexing being done in the background or how is this achieved? I still have a pretty clean installation, so maybe this goes bad with time, but in Windows the moment you want to search on a folder which is not indexed you have to wait for some seconds. Out-of-control starship results in some crew members landing in a rebirthed universe? I've read many years ago in books, that the brain has no nerves on it, and if someone was touching your brain, you couldn't feel a thing.  Just two days before now, I had a very bad migraine, due to a cold. It's become better now, but when I had it I felt my head was going to literally split in half, as the pain was literally coming from my brain.  So it lead me to the question: How come people can get headaches if the brain has no nerves?