How can i delete windows? I only want ubuntu on my pc. I dont want windows. It came together with windows when I am downloading ubuntu but I dont want windows. Is there any way to delete windows 7? I am using ubuntu 13.04 please help me.  Please explaing me how to delete that windows 7  I tried to reinstall my ubuntu but my windows 7 still exist. I cant delete that windows 7. Please explain how to delete that os. I only want ubuntu on my pc because ubuntu is best os ever in this planet!
I just installed Ubuntu and it is great.  However, I installed in beside the Windows Vista OS.  I now want to remove Windows in an effort to improve performance.  What is the easiest way to do this?
How to interpret these acf and pacf plots Let $\Omega$ be an open subset in $\mathbb{C}$. Let $\{f_n\}$ be a sequence of holomorphic functions on $\Omega$ such that $f_n\to f$ pointwise and converges uniformly on any compact subset $K\subseteq \Omega$. Then by Cauchy Theorem and Morera Theorem, $f$ is holomorphic. Let $f_n$ and $f'$ be the derivatives of $f_n$ and $f$ respectively. Prove that $f_n'\to f'$ uniformly on any compact subset $K\subseteq \Omega$.   How to prove? Can you create a strong blockcipher with small blocksize, given a strong blockcipher of conventional blocksize? Fantasy book with shape shifting dragon warriors Set in a fantasy world with shape shifting Dragon kings and their warriors. They terrorize the humans, and kill those with magic.   The protagonist is the great-grandson of a powerful warlock. He finds out that he has magic, and fights with it to save his new friends, the Griffin, Blackhorse (I think that's his name), some creepy necromancer who is immortal, and Gwen (fellow sorceress), along with the kingdom that the Griffin rules in.   They fight the protagonist's father, the leader of the Dragon kings, the king's Duke, and the creepy sorcerer, who has a curse (when he dies, he changes side from good to bad, or bad to good). I have no clue what this is called, but I want to find out, since I'm out of things to read. How does the Deposit-User work? Why don't gksu/gksudo or launching a graphical application with sudo work with Wayland? Compute the period of a decimal number a priori I noticed that , given an operation like $\frac{n}{m},\;n,m \in N$ that result in a periodic decimal number, computes really fast the length of the period.  E.g. $\frac{3923}{6173}$ has a period of 3086: .  I was wondering how this computation is done: is there some method to do this (except the trivial one of executing the division and looking for a sequence repetition) ? INSERT takes over 5 hours, when inserting more than specific number of rows When inserting less then about 1,350,000 rows to the table it all takes about 2 minutes, however when number of inserted rows is bigger, then the time needed to insert data grows to about 5 hours.  The problem is not connected with query or indexes, because everything has been working fine for a long time and nothing has changed in the structure of query, tables or indexes.   Problem appeared for the first time about 2 weeks ago and it appears repeatedly on days, when number of inserted rows is bigger than +-1,350,000. For example on one day number of inserted rows is 1,200,000 and the process takes 2 minutes, on the other day number of rows is 1,450,000 and it takes 5-6 hours to insert data.  I tried to rebuild indexes, but it has not helped. Can regular expressions be used to match nested patterns? Is it possible to write a regular expression that matches a nested pattern that occurs an unknown number of times? For example, can a regular expression match an opening and closing brace when there are an unknown number of open/close braces nested within the outer braces?  For example:  public MyMethod() {   if (test)   {     // More { }   }    // More { } } // End   Should match:  {   if (test)   {     // More { }   }    // More { } } Self adjoint operators and trace class property This is a variation of the  questioned some time ago.  For a complex Hilbert space $H$ let $T: H \rightarrow H$ be a bounded operator. We call that $T$ is a trace-class operator if the following sum  $$\sum_{i}{\langle |T|e_{i}, e_{i} \rangle} &lt; \infty$$  converges, where $|T| = (T T^{*})^{\frac{1}{2}}$ is the absolute value of the operator.  Assume that  $$\sum_{i}{\langle Te_{i}, e_{i} \rangle}$$  converges for any basis in the space $H$. How to prove that if the aformentioned property holds then the operator is a trace class operator?  The progress on the problem is the following: Given an arbitrary bounded operator $T: H \rightarrow H$, one can use the following decomposition $$T = \big( \frac{T + T^{*}}{2} \big) ^{*} + i \big( \frac{T^{*} - T}{2i} \big) ^{*}$$  The latter line gives the decomposition $$T = A + i B$$ where $A, B$ are normal operators.  For the normal operators we can apply the spectral theorem that proposes that $T$ is unitary equivalent to  $$(UT U^{-1})(f(x)) = g(x) f(x)$$  where  $$U: H \rightarrow L^{2}(X, \mu)$$ $$g \in L^{\infty}(X, \mu)$$  Though this decomposition classify the operator in a broad sence, i see no direct way to conclude the statement. Are the any hints that may extend the previous argument? If not, are there any ways to conclude the statement? Is it okay to record audio for a lecture? Sometimes the Professor will say things quickly, or say things before I can write them down. It would be of great benefit if I could record audio for the course, but I am not sure the legal guidelines around doing so. Splitting string into pair of characters in Ruby What do I say to make a new line when using voice recognition? I've found I can make punctuation happen by saying "comma", or "period", but I can't find the word for new line.  I tried "paragraph", and "line break", but it just prints those words. Do subdomains help/hurt SEO? Why do I get (author?) when I use \citet with natbib? I would like to show the author names using \citet but I get just the reference number. Here is a minimal code:  \documentclass{report} \usepackage[utf8]{inputenc} \usepackage[english]{babel} \usepackage{natbib}  \begin{document}   The author \citet{toschi09} has shown that ..  \bibliographystyle{plain} \bibliography{foo}  \end{document}   And here is foo.bib  @article{toschi09, author = {Toschi, F. and Bodenschatz, E.}, title = {Lagrangian Properties of Particles in Turbulence}, journal = {Annual Review of Fluid Mechanics}, volume = {41}, number = {1}, pages = {375-404}, year = {2009},  }   What I get is:     The author (author?) [1] has shown that ..   Any help will be more than welcome, thank you! I am used to Turbo C++ and I am new to Ubuntu.  I really need Turbo C++ to get started.  Can somebody please help me to install Turbo C++ on Ubuntu. ASP.NET Call Code Behind Function From Javascript How did the ending happen from Neil's perspective? I am trying to figure out the scene near the finale of Tenet where Neil unlocks the door and gets shot in the face. I can't really see the flow where he opens and holds the door and the protagonist walks in and fights the bad guy. Can you tell the series of events as Neil sees them happen till he gets shot? UPDATE If I am not wrong, I see it like this: Neil was running down towards the door, both the protagonist and his mate are inside with the door locked fighting the bad guy, then, he unlocks the door and walks in and stands behind the door. The protagonist's mate comes out of the room, then the protagonist, then he closes the room, then he look back to get shot in the face. But this doesn't make sense, if he wanted to unlock the door when he was running down, they were already in fighting the bad guy!!!!! I have some pairs of datasets (n=200 or thereabouts), of samples which are non-negative and not normally distributed. I think these pairs of variables are related, probably linearly.   Calculating Spearman's rank correlation on these datasets gives some strange results. The correlation coefficients show that the pairs of variables are weakly, positively correlated (e.g. rho of around 0.4), but the p-values are very low (e.g. 4.1e-10).  My vague understanding of this is that the variables are weakly, positively correlated but the probability of unrelated variables producing the same correlation is very low. Does this mean we can be reasonably certain that a positive correlation exists or have I misunderstood? Returning a const reference to an object instead of a copy