Is there some simple way to make ls display the file size number with thousand (and million, billion, ...) separator? A sample output should look like this:  $ ls -lAF /bin/ -rwxr-xr-x 1 root root 975,488 Dec 30  2012 bash* -rwxr-xr-x 3 root root  31,184 Jul 29  2012 bunzip2* -rwxr-xr-x 3 root root  31,184 Jul 29  2012 bzcat*   This would, in my opinion, greatly increase the readability of ls output, especially with large files. Without the thousand (and million, billion..) separator, it is almost impossible to correctly read the magnitude of a big file.
It is possible to make ls -l output the size field with digits grouped by thousands? If so, how?  For instance:  $ ls -l -rw-rw---- 1 dahl dahl 43,210,052 2012-01-01 21:52 test.py   (Note the commas in the size).  Maybe by modifying the LC_NUMERIC setting inside the locale I'm using (en_US.utf8)?  I'm on Kubuntu 12.04 LTS.
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. What's the difference between Wubi and a regular "alongside Windows" installation? Is it possible to edit a layer in QGIS while there is an active query? I am new to Quantum and I am digitizing polygon layers using the editing features. I would like to apply simple queries ('date > 2012/08/01'), however while the query is active I cannot edit the layer. Is this possible? cant install or remove anything on 18.04 cause of DPKG error How to change maximum number of cores? It says in  that there is a maximum number of 8 cores supported by default in Ubuntu 12.04 Desktop/Server 32-Bit. What is the way to increase the maximum number of cores from the default of 8 to a higher value, like 12?  The reason I ask is because I have just built a machine with 6 hyper threading cores.  There were issues installing the 64-bit version of the software from a CD (it "panicked" and crashed several times).  The 32-bit installed with no problem, but I only see 8 of the 12 cores.  The BIOS is fine.  If I turn hyper-threading off and reboot, I see 6 cores as expected.  I am nervous to try and compile a kernal, I am still new to all of this.  Is there a config setting somewhere that I should change? Is it possible to reintegrate a Horcrux? Bibtex true unsort My first steps with bibtex, with pdflatex on a linux machine.  I use \nocite{*} so that all references are printed, either cited or not.  All the bibliography style that I have found are sorting the references, either by alphabetic or order of appearance order, "features" that I would like to avoid.  Is there a way to preserve the original order of the .bib file ?  (I would like that citing references [1] to [999] does not turn to [1] to [2]). When trying to view  via the iOS app, I get this:        It's consistent, retrying does not help and the request always fail.  All other questions load just fine, so I highly suspect the cause is the Emoji icons used in there, especially in the comments that contain lots of them.  Beta channel, version 1.0.1.85  Update: still happening in 1.0.1.88 and I also found that the "preview" seen for example in tag search shows the Emoji just fine: I have seen several answers and proofs here at MSE that a self-adjoint operator $T$ on a Hilbert space $H$ where $T^2=T$, implies $T$ being an orthogonal projection operator.   The thought struck me; what would happen if the condition $T^2=T$ is replaced by $T^3=T^2$ or instead by $T^4=T^3$ or why not more generally by $T^n=T^{n+1}$ for some $n\in\mathbb{N}$? Would this still imply $T$ to be an orthogonal projection operator?  I guess someone must have thought of this before me? In that case perhaps there is a reference in the literature for this or perhaps the proof is way simpler than I might expect? Is it possible to Pivot data using LINQ? When constructing the matrices for the two CNOT based on the target and control qubit, I can use reasoning:  "If $q_0$==$|0\rangle$, everything simply passes through", resulting in an Identity matrix style $\begin{bmatrix}1&amp;0\\0&amp;1\end{bmatrix}$ in the top left. "If $q_0==|1\rangle$, we need to let $q_0$ pass and swap $q_1$, resulting in a Pauli X $\begin{bmatrix}0&amp;1\\1&amp;0\end{bmatrix}$ in the bottom right.  $CNOT \equiv \begin{bmatrix}1&amp;0&amp;0&amp;0\\0&amp;1&amp;0&amp;0\\0&amp;0&amp;0&amp;1\\0&amp;0&amp;1&amp;0\end{bmatrix}$  "If $q_1$==$|0\rangle$, everything simply passes through", results in leaving $|00\rangle$ and $|10\rangle$ unaffected. "If $q_1==|1\rangle$, we need to let $q_1$ pass and swap $q_0$, mapping $|01\rangle$ to $|11\rangle$ and  $|11\rangle$ to $|01\rangle$  $CNOT \equiv \begin{bmatrix}1&amp;0&amp;0&amp;0\\0&amp;0&amp;0&amp;1\\0&amp;0&amp;1&amp;0\\0&amp;1&amp;0&amp;0\end{bmatrix}$  This all seems to check out, but here comes my question: I would like to know if there is a more mathematical way to express this, just as there would be when combining for instance two hadamard gates: $H \otimes H \equiv \frac{1}{\sqrt{2}}\begin{bmatrix}1&amp;1\\1&amp;-1\\ \end{bmatrix} \otimes \frac{1}{\sqrt{2}}\begin{bmatrix}1&amp;1\\1&amp;-1\\ \end{bmatrix} = \frac{1}{2}\begin{bmatrix}1&amp;1&amp;1&amp;1\\1&amp;-1&amp;1&amp;-1\\1&amp;1&amp;-1&amp;-1\\1&amp;-1&amp;-1&amp;1 \end{bmatrix}$  And a bonus question:  How I can, using notation like "CNOT", show which qubit is the control bit and which qubit the target bit? Distance Between Two Points in Matlab I'm struggling to understand the core reason to invest in stocks as a minority shareholder. Majority shareholding makes more sense as you effectively control the company, so you can pay yourself dividends or even sell the entire company at will. You can guarantee your own payback.  However, as a minority shareholder, you don't get to make any of these decisions. You're basically just hoping to eventually, some day get paid, if the majority holders decide so.  Why do so many investors agree to pay now huge sums of money (trillions in total) for something that may eventually pay dividends, and even in the best case, these dividends are only a fraction of the price you paid to acquire these stocks?  The average annual dividend rate for the US stock market is 2%. That means if you bought 100 million worth of shares, you'd have to wait 50 years to recover your investment.  Of course, the most probable way you'd eventually get liquidity for these shares is by selling them to some other starry-eyed investor - which makes the whole thing seem like a giant Ponzi scheme.  Given all that, it's unclear to me why the public is willing to spend so much money to acquire minority shares in companies. How does one attack a two-time pad (i.e. one time pad with key reuse)? My question might appear the same as the question , but actually I did read all the answers and none of them helped me with the details I need.  I am new to cryptography and my problem is with two time pad attacks on OTP. The problem I had in my course was that I have 10 ciphertexts encrypted with the same key $K$. I am then given another ciphertext that I should decrypt.  I know that XOR-ing two ciphers gives me the XOR of their original messages.  My question is what is the correct thing to do after that?  I tried to take 3 ciphertexts $C_1, C_2$ and $C_3$.  Then get $S_1 = C_1 \oplus C_2  \oplus $' ', also get $S_2 = C_1 \oplus C_3 \oplus$ ' '.  After that I compared all corresponding characters in $S_1$ and $S_2$,  and if $S_1[i] = S_2[i]$ then I calculate $S_1[i] \oplus C_2[i]$ to get $K[i]$.  I tried this on paper before coding and it worked, but I might be missing something.  Is this the right approach? Why does it work? This is one of the possible ways I come out:  struct RetrieveKey {     template &lt;typename T&gt;     typename T::first_type operator()(T keyValuePair) const     {         return keyValuePair.first;     } };  map&lt;int, int&gt; m; vector&lt;int&gt; keys;  // Retrieve all keys transform(m.begin(), m.end(), back_inserter(keys), RetrieveKey());  // Dump all keys copy(keys.begin(), keys.end(), ostream_iterator&lt;int&gt;(cout, "\n"));   Of course, we can also retrieve all values from the map by defining another functor RetrieveValues.  Is there any other way to achieve this easily? (I'm always wondering why std::map does not include a member function for us to do so.) (Almost) double light speed It's my understanding that the phrase "Winter is Coming" is the motto of the Stark house, when the story first reaches the wall it's implied that the winter is not a periodic season like it is in our world.  Does the winter refer to a particularly severe season or does a winter only occur every few years? Whenever I read about the curvature of spacetime as an explanation for gravity, I see pictures of a sheet (spacetime) with various masses indenting the sheet to form &quot;gravity wells.&quot; Objects which are gravitationally attracted are said to roll down the curved sheet of spacetime into the gravity well. This is troubling to me, because, in order for objects on the locally slanted spacetime sheet to accelerate, gravity must be assumed. Therefore I ask; does the explanation of gravity as the curvature of spacetime assume gravity? If yes, what is the point of the theory? If No, what am I missing? Centre of $GL_n(\mathbb R)$ How to prove that center of $GL_n(\mathbb R)$ is scalar matrices?  Again what can you say about the center of set of all upper triangular matrices and center of set of all diagonal matrices. How do I remove objects from an array in Java? Given an array of n Objects, let's say it is an array of strings, and it has the following values:  foo[0] = "a"; foo[1] = "cc"; foo[2] = "a"; foo[3] = "dd";   What do I have to do to delete/remove all the strings/objects equal to "a" in the array?