What is the difference between this two declaration in java?  public int hashes[];  public int[] hashes;
I have recently been thinking about the difference between the two ways of defining an array:   int[] array int array[]   Is there a difference?
How do I undo the most recent local commits in Git? Boot Error - ACPI PCC Probe Failed ACPI PCC Probe Failed is the error that pops up instead of the default GRUB loader after I updated my kernel to 3.19.  I searched around and couldn't find much information except that it is a known error and it is registered in kernel.org's launchpad . My question is, is anyone else facing it?, what are the impacts of this? And if only an update in the future can fix it, any suggestions or safety tips till then? Where does the word "torsion" in algebra come from? What happens to waves when they hit smaller apertures than their wavelenghts? I was wondering this for quite a long time now. Let's say you have a water wave (like ripples, not the ones you see during tsunamis) with wavelength 10 m. Imagine you put a boundary with an opening of 1 m. Will diffraction be observed? According to my research, no. But, then, what would be seen? Close Lightning Modal by clicking anywhere outside of it Collinearity diagnostics problematic only when the interaction term is included How do I show that $\ln(x) = \lim_{n\to\infty} n (x^{1/n} - 1)$?  I ran into this identity on . I haven't been able to find any proof online and my efforts to get from $\ln(x) := \int_1^x \frac{\mathrm dt}t$ to that limit have been a failure. Divergence of $\sum_{n=1}^{\infty} \frac{1}{2+i^n}$? I notice that,  $i^n = i, \quad if \text{ } n \equiv \text{ } 1 \text{ } mod \text{ } 4$  $i^n = -1, \quad if \text{ }n \equiv \text{ } 2 \text{ } mod \text{ } 4$  $i^n = -i, \quad if \text{ }n \equiv \text{ } 3 \text{ } mod \text{ } 4$  $i^n = 1, \quad if \text{ } n \equiv \text{ } 0 \text{ } mod \text{ } 4$  so the series $\sum_{n=1}^{\infty} \frac{1}{2+i^n}$ seems to be an alternating series that does not converge to any point in the complex plane. Is there a rigorous way to prove this divergence? How would you write a proof to this divergence or convergence (if I am wrong)?  Thanks! Will Area 51 be supported in the app? Will  be supported on the Android App in the future? I visit A51 rather frequently and I would like to see it in the App. Prove the equality of circle's areas Through a random point inside the circle, we draw $4$ lines with $45$ degrees between each other. Prove, that the total area of odd pieces, equals total area of even pieces.    I suppose there is a solution using integrals, but maybe there is geometric solution as well. The Weyl equidistribution theorem states that the sequence of fractional parts ${n \xi}$, $n = 0, 1, 2, \dots$ is uniformly distributed for $\xi$ irrational.   This can be proved using a bit of ergodic theory, specifically the fact that an irrational rotation is uniquely ergodic with respect to Lebesgue measure. It can also be proved by simply playing with trigonometric polynomials (i.e., polynomials in $e^{2\pi i k x}$ for $k$ an integer) and using the fact they are dense in the space of all continuous functions with period 1.  In particular, one shows that if $f(x)$ is a continuous function with period 1, then for any $t$,  $\int_0^1 f(x) dx = \lim \frac{1}{N} \sum_{i=0}^{N-1} f(t+i \xi)$. One shows this by checking this (directly) for trigonometric polynomials via the geometric series.  This is a very elementary and nice proof.  The general form of Weyl's theorem states that if $p$ is a monic integer-valued polynomial, then the sequence ${p(n \xi)}$ for $\xi$ irrational is uniformly distributed modulo 1.  I believe this can be proved using extensions of these ergodic theory techniques -- it's an exercise in Katok and Hasselblatt.  I'd like to see an elementary proof.  Can the general form of Weyl's theorem be proved using the same elementary techniques as in the basic version? This afternoon I set up a Win Server 2008 R2 system for use with Team Foundation source code control. In order to give my team-mates the right to connect, I had to create a user account for each person, 10 in total. (I can't, and I don't want to create a domain).  Now, after doing this, all user accounts are displayed in the login screen.  What can I do so that all the accounts are not displayed there? Did not receive site association bonus (+100 rep) How do I split a string so I can access item x? Using SQL Server, how do I split a string so I can access item x?  Take a string "Hello John Smith". How can I split the string by space and access the item at index 1 which should return "John"? A different approach in distributing $8$ distinct balls into $6$ distinct boxes Find the number of ways in distributing $8$ distinct balls into $6$ distinct boxes such that there is at least $1$ ball in each box.  We are well acquainted with the traditional Inclusion-Exclusion principle in solving this and it will come up as $191520$ ways.  I tried in this way:  When we distribute $8$ balls into $6$ boxes we have two possible cases  Case $1.$ There are exactly $2$ boxes with $2$ balls each  Case $2.$ There is exactly $1$ Box with $3$ balls in it.  For Case $1$, the distribution is done by choosing $2$ boxes from $6$ boxes and $2$ balls from $8$ balls and those two balls can be arranged in $2!$ ways. But I require another two balls from remaining $6$ balls to be placed in each of these two boxes which can be done in $\binom{6}{2} \times 2!$ ways. Finally remaining $4$ balls can be distributed in remaining $4$ boxes in $4!$ ways. So total number of ways for Case $1.$ is  $$\binom{6}{2} \times \binom{8}{2} \times 2! \times \binom{6}{2} \times 2! \times 4!=604800$$  For Case $2$, the number of ways is  $$\binom{6}{1} \times \binom{8}{3} \times 5!=40320$$  I am pretty sure the value obtained for Case $2.$ is correct. but I could not find where I went wrong in Case $1.$ What are the effects of exceptions on performance in Java? Question:  Is exception handling in Java actually slow?  Conventional wisdom, as well as a lot of Google results, says that exceptional logic shouldn't be used for normal program flow in Java.  Two reasons are usually given,   it is really slow - even an order of magnitude slower than regular code (the reasons given vary),     and    it is messy because people expect only errors to be handled in exceptional code.     This question is about #1.  As an example,  describes Java exception handling as "very slow" and relates the slowness to the creation of the exception message string - "this string is then used in creating the exception object that is thrown. This is not fast."  The article  says that "the reason for this is due to the object creation aspect of exception handling, which thereby makes throwing exceptions inherently slow".  Another reason out there is that the stack trace generation is what slows it down.  My testing (using Java 1.6.0_07, Java HotSpot 10.0, on 32 bit Linux), indicates that exception handling is no slower than regular code.  I tried running a method in a loop that executes some code.  At the end of the method, I use a boolean to indicate whether to return or throw.  This way the actual processing is the same. I tried running the methods in different orders and averaging my test times, thinking it may have been the JVM warming up.  In all my tests, the throw was at least as fast as the return, if not faster (up to 3.1% faster).  I am completely open to the possibility that my tests were wrong, but I haven't seen anything out there in the way of the code sample, test comparisons, or results in the last year or two that show exception handling in Java to actually be slow.  What leads me down this path was an API I needed to use that threw exceptions as part of normal control logic.  I wanted to correct them in their usage, but now I may not be able to.  Will I instead have to praise them on their forward thinking?  In the paper , the authors suggest that the presence of exception handlers alone, even if no exceptions are thrown, is enough to prevent the JIT compiler from optimizing the code properly, thus slowing it down.  I haven't tested this theory yet. Replace unknown reference (?) with the tag from \ref or \cite While working on a document, it would be helpful if instead of a ? for unresolved references or citations the tag used in the \ref{thisthings} or \cite{Bloke1978} could appear instead.  Is there a package that turns on this behaviour? Fourier transform of a radial function Consider a function $f \in L^2(\mathbb{R}^n)$ such that $f$ is radial. My question is, is the Fourier transform $\hat{f}(\xi)$ automatically radial (I can see it is even in each variable $x_i$), or we need some conditions on $f$? Thanks for your help. Motherboard BEEPS Code I am using a Gigabyte motherboard. Today my screen suddenly went black and the beep sound began. I tried to restart my PC, but when it tried to boot into Windows, the same beep sound appear again. I had to totally power off the PC and start it again to get it to run properly.  I am curious about the beep sound and want to know why my PC crashed. The beep code is a repeating, long beep code. Something like "BEEEEEEEEEEEEP ........ BEEEEEEEEEEEEP  ........ BEEEEEEEEEEEEP".  I tried online search, but I can't find my beep code. Do you know what it means?  Thank you. Is $\emptyset \in \emptyset$ or $\emptyset \subseteq \emptyset$?