How exactly does Java prevent itself from buffer overflow ? Is it just by throwing the "ArrayIndexOutofBounds" ?
Does Java have buffer overflows?
How widely-accepted is "What do you got?" to Americans? Watching , I noticed that Melanie Griffith twice asked    I recognise this as an American construction which sounds strange to me — Brits invariably say either "What have you got?" or "What do you have?". But I'd be interested to know if it's considered "normal" by most/all Americans, or if it's regionally or otherwise restricted. How can I get id,class or name attr an element with jquery When I type "[singular noun] and [singular noun]" in Word 2010, I find some interesting things.        Bread and butter is essential. (the auto-correction warns me of subject-verb disagreement.)   Bread and butter are essential. (OK)   A knife and fork is on the table. (OK)   A knife and fork are on the table. (OK)   The needle and thread is new. (OK)   The needle and thread are new. (OK)   Cost and revenue is directly linked. (OK)   Cost and revenue are directly linked. (OK)      I wonder how a native speaker would consider this phenomenon. When should I add another answer? I have been member of SO for 4 months. I have a question regarding some functionality. Whenever I give an answer to a question, there is functionality given Add Another Answer. I can comment on my answer at any time and also able to edit answer. Then   Why this functionality given on SO to add another answer?  When should I add another answer?  Why there is requirement of multiple answers? What is limit of adding answers to single question? Is a Mexican passport needed to fly into Mexico from the United States? Name lookups in C++ templates Vertical spaces between lines in cases environment \documentclass{article} \usepackage{amsmath} \begin{document} \begin{equation*}   X_i =    \begin{cases}     \left[\begin{smallmatrix}       0 \\ 1 \\ 2     \end{smallmatrix}\right]     &amp;     \text{if $i$ is even;}     \\     \left[\begin{smallmatrix}       2 \\ 1 \\ 0     \end{smallmatrix}\right]     &amp;     \text{otherwise.}   \end{cases} \end{equation*} \end{document}   This is the LaTeX code that I wrote based on a cases environment. There's no space between the matrices on the right. What's the best way to add some vertical spaces to separate them?    p.s. This is a simplified form of my original writing, so I cannot just accept suggestions like 'use a matrix transpose to transform the column vector into a row vector.' Count occurrences of each element in a List[List[T]] in Scala Assume $\bar A\cap\bar B=\emptyset$. Is $\partial (A \cup B)=\partial A\cup\partial B$, where $\partial A$ and $\bar A$ mean the boundary set and closure of set $A$?   I can prove that $\partial (A \cup B)\subset \partial A\cup\partial B$ but for proving $\partial A\cup\partial B\subset \partial (A \cup B)$ it seems not trivial. I tried to show that for $x\in \partial A\cup\partial B$ WLOG, $x\in \partial A$ so $B(x)\cap A$ and $B(x)\cap A^c$ not equal to $\emptyset$ but it seems not enough to show the result. Can I smoothly upgrade from one LTS to next LTS release? Internal microphone not working I have an internal microphone in my laptop. I think it uses Intel High Definition Audio. But I can't get it to work with Ubuntu. It doesn't work with either the Sound Recorder or Skype.  On the Input tab in 'Sound Preferences', I just see Internal Analog Input Device... If an polynomial has a complex root, is it necessary that its conjugate is also a root? If an polynomial has a complex root, is it necessary that the conjugate of that root is also a root of the polynomial? I am not sure about this. Please comment on this. Prove a assertion concerning Lebesgue space Let $f_n \in L^1$ such that $f_n\rightrightarrows f$. Then I want to conclude that If $\mu(X)&lt;\infty,$ then $f\in L^1$ and $\int f_n\to\int f$, so I want to make use of the Dominated convergence theorem, the thing is that I don't know which would be my dominating function.  I was trying to figure out if the measure could play that role, but after thinking a little bit I have realize that the measure doesn't have to be bigger than the absolute value of the functions of the sequence.  Another thing I was thinking of, is to apply Fatou's lemma, but I can't ensure that my functions are positive.  So, Can someone help me to prove this theorem please ?  Thanks a lot in advance :).    NOTE: I think this theorem is taken from Folland's Real analysis, modern techniques, and their aplications 2nd Edition :), This is to have all the definitions so we can talk the same language as in the book (this is, same notation and theorems or machinery) Automatically resize uploaded images Possible Duplicate:             Could large images of more then 640 pixels wide automatically be resized to reduce loading time and band width use? Not that I have a prehistoric internet connection here, but sometimes pages seem to need unnecessary time to load fully.  I just resized the image  from 179 kb down to 32 kb using a 15% compression rate. I think that is already worth it, although there have been much bigger downsizes in the past.  This feature then propably should/could be combined with , and uploading an image then would result in the following post addition:  [![enter image description here][2]][1]  [1]: http://i.stack.imgur.com/ZSBxw.gif "View &lt;image title&gt; full sized" [2]: http://i.stack.imgur.com/VXmBA.jpg "&lt;Image title&gt;"   Update:  I now understand from  that images áre resized already, but that post authors have to do some changes themselves. Could it then be automated to add the already resized image (that with the l suffix):  [![enter image description here][2]][1]  [1]: http://i.stack.imgur.com/ZSBxw.gif "View &lt;image title&gt; full sized" [2]: http://i.stack.imgur.com/ZSBxwl.jpg "&lt;Image title&gt;" Proving that two systems of linear equations are equivalent if they have the same solutions I've just begun to work learn Linear Algebra on my own through Hoffman and Kunze's book and the first problem set already has a question that I can't solve:  Prove that if two homogeneous systems of linear equations in two unknowns have the same solutions, then they are equivalent.  I can't seem to figure out how to prove this without resorting to case work where you account for the cases where one of the coefficients are zero and when both are.  Is there an elegant way to prove in general that when two systems of linear equations have the same solutions, they are equivalent? The converse is obvious enough though.  Definition of equivalence from the text :     Let us say that two systems of linear equations are equivalent if each equation in each system is a linear combination of the equations   in the other system. Is it ever revealed what Crookshanks is? When Hermione first got her pet thing Crookshanks, there was a mention that it looked kinda like a cat, but wasn't.  Was it ever revealed what Crookshanks really was? How do I reset proxy in terminal to automatic if not connected via proxy I tried to reset proxy of the terminal by some commands but it doesn't happen and automatically switches back to this proxy 172.16.0.16 (which apparently was my college proxy).   I checked in my system settings.I don't understand why this is recurring. Please be comprehensive.Also I further would like to know how to bypass proxy server since I couldn't access any of the ubuntu repositories as they were blocked in my college's proxy settings as is Ubuntu's homepage.  Thanks for your time.    For sudo ls /etc/apt/apt.conf.d/        It displays a different set of options where proxy is not listed.I am on 12.10,if this should help any.I put a snap of the terminal after the above command has been entered. Is it possible to stop my laptop going to sleep when I close the lid?  GNOME 3.20, Fedora 24.    My laptop does not reliably wake from sleep.  (It happens to be a hardware issue... I think I basically killed it while trying to replace a wifi card.  But I want to keep using it for a while longer). Presheaf which is not a sheaf -- holomorphic functions which admit a holomorphic square root I'm thinking about a problem in Ravi Vakil's algebraic geometry notes  (Exercise 3.2B) and I'm having trouble with the second part of the exercise as my understanding of complex analysis is quite rudimentary.   If to every open set $U\subset \mathbb{C}$ we associate the ring of holomorphic functions which admit a holomorphic square root, this defines a presheaf on $\mathbb{C}$ (I can see this).   Apparently however this is not a sheaf -- supposedly it fails to satisfy the gluing property.   To prove this, we need to take an open cover $\{U_i\}$ of some open $U\subseteq \mathbb{C}$, a holomorphic function $f_i:U_i\to \mathbb{C}$ for each $i$ which has a holomorphic square root (i.e. there exists a holomorphic function $g_i$ for each $i$ such that $f_i(z)=g_i(z)^2$ for all $z\in U_i$), which all agree nicely on the intersections of the various open sets, but such that it is impossible to find a holomorphic function $f:U\to \mathbb{C}$ with a holomorphic function which restricts to $f_i$ on each $U_i$.   Any help would be great -- my problem is in showing that such a function cannot exist. I need to customize the UI for a group of users at another office.  I want to turn off a bunch of toolbars and menus that are not needed.  I know how to save my configurations (Settings -> Customization...) to a INI file.    How do I setup the other users computers to load the INI at startup?   I am using Windows 7 and Qgis 2.0.1.