Using Ubuntu 12.04 LTS, upgraded from 11.10. Had no idea while installing Ubuntu for the first time. So missed SWAP partition. Now, at times Ubuntu hangs and system monitor shows the memory usage full. Is there any method that I can create a partition from the current Ubuntu partition and assign it as SWAP partition ? If yes, kindly guide me to do the same.   How much SWAP partition space is recommended ? Current specs - 6 GB RAM, 1 GB Radeon GPU.
I did not create a swap partition during Ubuntu installation.  Later, I freed up some space and made a swap partition.  Now after each boot up, I am manually opening gparted to right-click the swap partition to turn on the 'swapon' option.  How can I automatically enable the swap partition at boot?  Also, if I had not created the swap partition, what are my other options?
Can every game of Klondike-Solitaire be solved? I play a lot of Solitaire games on my Android phone and love to keep an eye out for the statistics.  Given that the Solitaire version lets you restart the game endlessly, I usually play until I solve it. But I never managed to solve more than 80% of the games played (1000+).  So now I wonder, is every Solitaire game solvable? .NET - How can you split a "caps" delimited string into an array? How do I go from this string: "ThisIsMyCapsDelimitedString"  ...to this string: "This Is My Caps Delimited String"  Fewest lines of code in VB.net is preferred but C# is also welcome.  Cheers! I found there are so much excellent answer to questions about how to product high quality typesetting output. But I wonder how to save ink with LaTeX. What we need to think about to manage cost. page layout or something else? Examples and Counterexamples of Relations which Satisfy Certain Properties Make ubuntu usb bootable on windows Possible Duplicate:             I know there are a lot of tools to create a bootable usb for ubuntu with windows.  But I'm sure, that there was a possibility in the ubuntu installation directory. I used it some time ago, but I can't find it anymore :(  I think it was a .exe, or a .bat, any case a cmd window has opened, some things were executing and the usb was bootable. And it was in the ubuntu directory!  Is there still the possibility to do that? Does that file exist? I unfortunately can't remember. comparing the first column of two files and printing the entire row of the second file if the first columns match I have two files in these formats:   file1 :  air smell hand dude road cat   file 2:   air,4,21,01,13,3,2 smell,21,4,2,5,6 dude,1,31,42,1 road,1,4,2,1,4 cat,1,5,6,3,1 hand,1,4,2,1,6 mouse,1,3,5,6,2   what I want to do is print the entire row of file 2, if the first string in column 1 of file 2 is found in file 1, and I want to keep the order of file 1.   expected output:   air,4,21,01,13,3,2 smell,21,4,2,5,6 hand,1,4,2,1,6 dude,1,31,42,1 road,1,4,2,1,4 cat,1,5,6,3,1 What's the simplest way to call Http GET url using Delphi? There's a web services I want to call in my application, I can use it with importing the WSDL or by just use "HTTP GET" with the URL and parameters, so I prefer the later because it's simple thing.  I know I can use indy idhttp.get, to do the job, but this is very simple thing and I don't want to add complex indy code to my application.  UPDATE: sorry if I was not clear, I meant by "not to add complex indy code", that I don't want add indy components for just this simple task, and prefer more lighter way for that. Help evaluating a gamma function I'm looking for a single line regex which does the following:  Given a HTML tag with the "name" attribute, I want to replace it with my own attribute. If that tag lacks the name attribute, I want to implant my own attribute. The result should look like this:  &lt;IMG name="img1" ...&gt; =&gt; &lt;IMG name="myImg1" ...&gt; &lt;IMG ...&gt; =&gt; &lt;IMG name="myImg1" ...&gt;   Can this be done with a single line regex? Generate uniformly distributed weights that sum to unity? It is common to use weights in applications like mixture modeling and to linearly combine basis functions. Weights $w_i$ must often obey $w_i ≥$ 0 and $\sum_{i} w_i=1$. I'd like to randomly choose a weight vector $\mathbf{w} = (w_1, w_2, …)$ from a uniform distribution of such vectors.  It may be tempting to use $w_i = \frac{\omega_i}{\sum_{j} \omega_j}$ where $\omega_i \sim$ U(0, 1), however as discussed in the comments below, the distribution of $\mathbf{w}$ is not uniform.  However, given the constraint $\sum_{i} w_i=1$, it seems that the underlying dimensionality of the problem is $n-1$, and that it should be possible to choose a $\mathbf{w}$ by choosing $n-1$ parameters according to some distribution and then computing the corresponding $\mathbf{w}$ from those parameters (because once $n-1$ of the weights are specified, the remaining weight is fully determined).  The problem appears to be similar to the  (but, rather than picking 3-vectors whose $ℓ_2$ norm is unity, I want to pick $n$-vectors whose $ℓ_1$ norm is unity).  Thanks! I'm building a small chat. Now I see but in other chats (whatsapp, facebook mobile chat, sms ...) that the arrangement is always the same:  Left: the chat partner. right: myself      Why is that? $\mathbb Q$ is not the direct product of two non-trivial groups. I know this has been asked before, in a bunch of places, so I expect it to be closed as a duplicate at some point, but I'd like to know if my own proof works. If the proof is incorrect, please limit answers to pointing out the errors. If the proof is correct, then thoughts on improving it would be appreciated.  Prove that $\Bbb Q$ is not the direct product of two non-trivial groups.  —Aluffi exercise II.3.5. My proof Suppose that $\Bbb Q = G \times H$, neither $G$ nor $H$ trivial. First note that $0_G$ is the only element of $G$ with finite order: If $m\ne 0$ and $m\cdot g=0_G$, then $m\cdot(g,0_H)=0_{G\times H}$, contradicting the fact that $\Bbb Q$ has no non-zero elements of finite order. Suppose that for some $m\ne 0$ and some $n\ne 0$, $\pi_G(m/n)=0_G$. Then $0_G=n\cdot\pi_G\left(\frac m n\right)=\pi_G\left(n\cdot\frac m n\right)=\pi_G(m)=m\cdot\pi_G(1)$. Since $\pi_G(1)$ has finite order, we conclude that $\pi_G(1)=0$. Since $\Bbb Z=\langle 1\rangle$, $\pi_G$ maps every integer to $0_G$. Now let $a$ and $b$ be non-zero integers. Then $b\cdot\pi_G\left(\frac a b\right)=\pi_G\left(b\cdot \frac a b\right)=\pi_G(a)=0_G$. As above, this shows that $\pi_G\left(\frac a b\right)=0_G$. Thus if $\pi_G$ is not an injective function, then it must map everything to $0_G$, so $G$ will be a trivial group. The same result holds for $\pi_H$. Since by assumption, $G$ and $H$ are non-trivial, $\pi_G$ and $\pi_H$ are both injective functions, which is of course impossible. Person, Persons, People, Peoples Argue that there exists a continuous function $g: \mathbb{R} \rightarrow \mathbb{R}$ which satisfies $g(x) = \frac{1-e^{-2x^2}}{x^2}$ for $x \neq 0$ What is the pronunciation of the possessive words that already end in s? Possible Duplicate:           My name is Greg — this is Greg 's post.  If my name ended with an 's', I am aware of the proper apostrophe usage (James&nbsp;→ James'), but how should this be pronounced?  Phonetically, am I Jameses best friend or James best friend? The following definition is needed for my actual question:  For $A, B \in \mathcal{M}_{n \times n}$ define $$  \langle A, B \rangle = \text{Trace}(B^{T}A) = \sum_{j=1}^{n}\sum_{i=1}^{n}b_{ij} \, a_{ij} $$  And here is the actual question:  For $B \in \mathcal{M}_{n \times n}$ show that $$ \text{Trace}(B)^{2} \:\leq\: n \,\text{Trace}(B^{T}B) $$  I know I have to use the Cauchy-Schwarz Inequality, but I wasn't exactly sure how to.  Here is my attempt:  Since I only have one matrix I decided to use the identity matrix $$ \begin{align} \text{Trace}(B)^{2} \:&amp;\leq\: n \,\text{Trace}(B^{T}B) \\ \text{Trace}(I^{T}B)^{2} \:&amp;\leq\: n \, \langle B, B \rangle \\ \langle I_{n}, B \rangle^{2} \:&amp;\leq\: n \, \Vert B \Vert^{2} \\ \langle I_{n}, B \rangle \:&amp;\leq\: \sqrt{n} \, \Vert B \Vert \end{align} $$  I feel like I either did it incorrect, or that I'm close but am missing something. Rounding up to next power of 2 I want to write a function that returns the nearest next power of 2 number. For example if my input is 789, the output should be 1024. Is there any way of achieving this without using any loops but just using some bitwise operators? The draft feature was discussed a lot  and in other posts, but I didn't see much talk about the OP's mention of being able to have multiple.     Optionally, allow multiple draft questions and a page to edit/delete them.    I think the draft feature where it autosaves and stores it server-side is great, but in most things where they have a draft feature (like email clients), they allow you to have multiple drafts (also stored server-side).  The expiration can even work the same as it does for the single draft system right now.  You wouldn't even need full page to store them, I think the user profile page could have a tab for it like it currently has for answers, questions, and everything else.    It could look very similar to how questions look, with it's title and tags listed there. How to read ext4 partitions on Windows? Is there a way to read ext4 partitions from Windows? If so, what can I do? As far as we know the gaze of the basilisk will instantly kill someone or eventually petrify him/her in case the gaze is somehow softened or reflected.   But why would it melt the film in Colin's camera? The film is just plastics with some specific chemicals.   A bit broader question would be - is the some information that the basilisk's gaze is somehow destructive to non-alive objects too and under what circumstances could it happen?