which  version of ubuntu (13.10 or  12) i should install?  Your help would be great!  dps    Just clicking on About This Compute to open
For a given hardware configuration, how do I find out if Ubuntu will run on it? What considerations should I take into account when choosing an Ubuntu version and  such as:    with a lighter desktop than the usual Gnome and Unity  with the even lighter LXDE desktop   Obviously Ubuntu does not run on some processor architectures. So how do I go about choosing the right version and derivate. How can I find out the minmal system requirements?
How can I return pivot table output in MySQL? I'm playing around with fdisk and I tried to create a partition on an empty USB drive. Here's how that went: Command (m for help): n Partition number (1-128, default 1): 1 First sector (34-61187102, default 2048): 2048 Last sector, +/-sectors or +/-size{K,M,G,T,P} (2048-61187102, default 61187102): +30000000           Created a new partition 1 of type 'Linux filesystem' and of size 14,3 GiB.  so just one partition with 30 million sectors. However, when I check how many sectors it contains I get:  I'm checking with a different program and I see again that additional sector:  Sorry for the pettiness :) I'm learning. Minipage: 2 tables side by side isn't working I have the following code to layout two tables side by side:  \begin{minipage}{0.3\textwidth} \begin{tabular}{c | c | c | c | c | c | c} F &amp; D &amp; E &amp; G &amp; P &amp; A &amp; L\\ \hline C &amp; H &amp; I &amp; I &amp; U &amp; G &amp; F\\ \hline G &amp; Z &amp; G &amp; A &amp; F &amp; Z &amp; U\\ \hline F &amp; R &amp; \textbf{H} &amp; \textbf{A} &amp; \textbf{U} &amp; \textbf{S} &amp; Z\\ \hline R &amp; P &amp; L &amp; I &amp; N &amp; F &amp; H\\ \hline L &amp; U &amp; G &amp; I &amp; A &amp; C &amp; T\\ \hline A &amp; B &amp; D &amp; N &amp; E &amp; R &amp; Z\\ \end{tabular}  \end{minipage}  \begin{minipage}{0.3\textwidth} \begin{tabular}{c | c | c | c | c | c | c} F &amp; D &amp; E &amp; G &amp; P &amp; A &amp; L\\ \hline C &amp; H &amp; I &amp; I &amp; U &amp; G &amp; F\\ \hline G &amp; Z &amp; G &amp; A &amp; F &amp; Z &amp; U\\ \hline F &amp; R &amp; \textbf{H} &amp; \textbf{A} &amp; \textbf{U} &amp; \textbf{S} &amp; Z\\ \hline R &amp; P &amp; L &amp; I &amp; N &amp; F &amp; H\\ \hline L &amp; U &amp; G &amp; I &amp; A &amp; C &amp; T\\ \hline A &amp; B &amp; D &amp; N &amp; E &amp; R &amp; Z\\ \end{tabular}  \end{minipage}   But it doesn't work. The tables are one below the other. What am I doing wrong? $\nabla U=0 \implies U=\mathrm{constant}$ only if $U$ is defined on a connected set? For any triangle with sides $a$, $b$, $c$, show that $a^2b(a-b)+b^2c(b-c)+c^2a(c-a)\ge 0$ For any triangle with sides $a$, $b$, $c$, prove the inequality $$a^2b(a-b)+b^2c(b-c)+c^2a(c-a)\ge 0 .$$   This is IMO 1983 problem 6.  I tried substituting $a=x+y$, $b=y+z$, $c=z+x$ but well it doesn't help in any sense except wasting 3 pages that lead to nothing (please don't mind the joke). Using $a=2R\sin A$, $b=2R\sin B$, $c=2R\sin C$ also didn't lead to anything for me. Could you give me a hint for finding the proper substitution? Present and future of bots on Stack Exchange There are discussions on Meta already for some time now about the potential usage of bots on Stack Exchange (SE). The earliest I could find goes back to  , but there have been others , .  Here’s an  about having a bot that tries to answer “easy” questions. The scenario is that (almost) duplicate, simple questions are asked time after time, despite SE’s efforts to prevent this by listing related questions at posting time. This is where the bot could be of service: it could quickly retrieve and post an answer from a previous duplicate (or with smarter Artificial Intelligence - AI)  even from elsewhere on the web, like a user manual or a mailing list discussion). I imagine this might save some review time for moderators, and perhaps users would also enjoy not having to answer over and over again to the same question. Besides, answers would be very fast, which should make everyone happy if they are also of good quality.  This idea of “janitor” bots can have more use cases besides answering “easy” questions (see also discussion ), like suggesting missing tags and re-formatting what should have been code blocks, to name a few.  Yet, despite a long time since these discussions, better Machine Learning Classifiers (ML) and AI over the years, and   , it doesn’t seem that any such bots are among us (except maybe ). As part of a research project at the university, I am trying to understand why this is the case.  For this reason I’d like your opinion on the following:   Do you consider a bot “harmful” for the SE communities?   If yes, would you consider the bot harmful even if   it operates in an automatic manner only in limited scenarios (e.g. specific tags) it operates in a semi-automatic manner (namely with the supervision of a moderator who decides for posting or not the answer).  it operates only for a limited amount of time in a small community (e.g. here).   Would you consider it too risky to give a bot a try? Would you accept an answer provided by a bot?   If not, why ? (e.g. you don’t trust replies from machines)  Would you consider useless a “sloppy” answer by a bot, even if it is provided in just a few seconds? Answers may be not perfect, but they may link to other relevant threads that can help the asker to fix the problem without waiting extra time for a human response. The symmetric cryptosystem one-time pad (OTP) seems to be very beautiful since it is perfectly secret according to Shannon. Many books, however, point out the main drawback: one must create a secret key the same length as the plaintext. For this reason, the concept of perfect secrecy has these days been abandoned, and we prefer other cryptosystems.   Now, for example, suppose I want to encode my text message with the ASCII scheme, and moreover suppose that this plaintext is 10 gigabytes long, therefore (using an OTP) the key must be the same length, 10 gigabytes. I think, however, this is a ''sustainable price'' because I'm sure that the ciphertext can't be attacked.  Practically, I don't understand why having such long keys with an OTP is a big disadvantage if we reach "the dream"-- namely, perfect secrecy. Nowadays the storage of information is very easy, so what is the real problem? I can, for example, share the "long key" in person. Cannot delete directory with Directory.Delete(path, true) I'm using .NET 3.5, trying to recursively delete a directory using:  Directory.Delete(myPath, true);   My understanding is that this should throw if files are in use or there is a permissions problem, but otherwise it should delete the directory and all of its contents.  However, I occasionally get this:  System.IO.IOException: The directory is not empty.     at System.IO.__Error.WinIOError(Int32 errorCode, String maybeFullPath)     at System.IO.Directory.DeleteHelper(String fullPath, String userPath, Boolean recursive)     at System.IO.Directory.Delete(String fullPath, String userPath, Boolean recursive)     ...   I'm not surprised that the method sometimes throws, but I'm surprised to get this particular message when recursive is true.  (I know the directory is not empty.)  Is there a reason I'd see this instead of AccessViolationException? Another simple series convergence question: $\sum\limits_{n=3}^\infty \frac1{n (\ln n)\ln(\ln n)}$ I'm being asked to determine if $\displaystyle\sum\limits_{n=3}^\infty \frac1{n (\ln n)\ln(\ln n)}$ converges. So, using Cauchy's Condensation Test, I reduced the problem to one of determining the convergence of $\displaystyle\sum\limits_{n=3}^\infty\frac 1{n\ln (n\ln 2)}$. Am I on the right path, and how do I proceed from here? How to find out how many games I have won with a specific race on ladder 1v1?  The profile screen just gives me the total wins and losses but I play with all three races and I would like to know my stats per race.  Thanks.  PS: I have been playing Starcraft from the release date but I don't have the old replays as I format my computer often. Jawa asked me this  and I didn't know the answer. So I present it to the meta SO community:     [To get the Yearling badge] Do you need to earn the 200 rep within that one year or is it enough to get 200 at some point after being a member for a year? And does 'a year' mean the very first 12 months or the last (sliding window of) 12 months?    I would assume that if you hit 200 reputation after you've already been around for a year, then you would get the Yearling badge. But I don't know. density of $X^2$ when $X$ has uniform $[-1, 2]$ distribution How to get a JavaScript object's class? I have a simple question answer to which would help me more deeply understand the concept of (non)commutative structures. Let's take for example (our teacher's definition of) a ring:  Let $R\neq \emptyset$ be a set, let $\oplus:A\times A \to A$ and $\bullet :A\times A \to A$ be binary operations. Moreover, let $(R, \oplus)$ be a commutative group, $(R, \bullet)$ be a monoid and following property holds for all $a, b, c\in R$: $$a\bullet(b\oplus c) = (a\bullet b)\oplus(a \bullet c)$$ $$(b\oplus c)\bullet a = (b\bullet a)\oplus(c \bullet a)$$ Then ordered triple $\mathbf R = (R, \oplus, \bullet \mathbf)$ is called a (unitary) ring.  Moreover, we call ring $\mathbf R$ commutative iff $(R, \bullet)$ is a commutative monoid. Commutativity of a ring is always a matter of its multiplicative operation because the additive operation is always assumed to be commutative.  Could anyone explain me the bold part? Why do we even in non-commutative rings (and fields etc.) assume the addition to be always commutative? Is there some serious reason? Would it make any trouble? Or studying of structures with non-commutative addition just doesn't give us anything new so we can take addition as commutative simply because of our comfort? Seasonal Loan Amortization Hi I can compute a Basic Loan Amortization Schedule, But now I'm trying to Calculate a Seasonal Loan Amortization Schedule . So for example A loan starts at January And Will go on for 3 years, with Monthly Payments. Interest is at 3% Annually and is compounded Annually. During the months of September, October, November, December It'll only accumulate Interest But no payments and principal. Principal is 100000. How Do I calculate Payments and interest. No hyper refs from citation to bibliography using BiBTeX, hyperref and harvard Happened on , fwiw. In particular I voted to reject it, then visited to add comment and vote to close, and wanted to add a  tag, but couldn't because had to wait to see the fate of the edit. I wrote a regular expression which works well in a certain program (grep, sed, awk, perl, python, ruby, ksh, bash, zsh, find, emacs, vi, vim, gedit, …). But when I use it in a different program (or on a different unix variant), it stops matching. Why? How to prevent form from being submitted? Icons of Meta.SE and Stack Apps have gone missing