How do I have to make the partitions with Ubuntu 15.0 thus I can choose from the Boot Sector when I turn on the pc. I want to install ubuntu 15.0 with windows 8.1. I have a notebook with a hard disk with 3 partitions: C: with windows 8.1, D: with my personal information with windows and E: only for Ubuntu. Thanks.
I'm absolutely new to Linux. I would like to know how to install Ubuntu alongside the pre-installed Windows 8+ OS.  Should I do it with Wubi, or through the Live USB/DVD?  What steps do I need to take to correctly install Ubuntu?
How to start git-gui? Computing the best constant in classical Hardy's inequality Classical Hardy's inequality (cfr. Hardy-Littlewood-Polya Inequalities, Theorem 327)  If $p&gt;1$, $f(x) \ge 0$ and $F(x)=\int_0^xf(y)\, dy$ then   $$\tag{H} \int_0^\infty \left(\frac{F(x)}{x}\right)^p\, dx &lt; C\int_0^\infty (f(x))^p\, dx $$  unless $f \equiv 0$. The best possibile constant is $C=\left(\frac{p}{p-1}\right)^p$.   I would like to prove the statement in italic regarding the best constant. As already noted by Will Jagy , the book suggests stress-testing the inequality with   $$f(x)=\begin{cases} 0 &amp; 0\le x &lt;1 \\ x^{-\alpha} &amp; 1\le x \end{cases}$$   with $1/p&lt; \alpha &lt; 1$, then have $\alpha \to 1/p$. If I do so I get for $C$ the lower bound  $$\operatorname{lim sup}_{\alpha \to 1/p}\frac{\alpha p -1}{(1-\alpha)^p}\int_1^\infty (x^{-\alpha}-x^{-1})^p\, dx\le C$$  but now I find myself in trouble in computing that lim sup. Can someone lend me a hand, please?    UPDATE: A first attempt, based on an idea by Davide Giraudo, unfortunately failed. Davide pointed out that the claim would easily follow from   $$\tag{!!} \left\lvert \int_1^\infty (x^{-\alpha}-x^{-1})^p\, dx - \int_1^\infty x^{-\alpha p }\, dx\right\rvert \to 0\quad \text{as}\ \alpha \to 1/p. $$  But this is false in general: for example if $p=2$ we get   $$\int_1^\infty (x^{-2\alpha} -x^{-2\alpha} + 2x^{-\alpha-1}-x^{-2})\, dx \to \int_1^\infty(2x^{-3/2}-x^{-2})\, dx \ne 0.$$ When computing the covariance matrix of a sample, is one then guaranteed to get a symmetric and positive-definite matrix?  Currently my problem has a sample of 4600 observation vectors and 24 dimensions. How do you create product mock-ups? Scaling vs Offsetting in Quasi-Poisson GLM I  modeled insurance claim frequency assuming a Quasi-Poisson distribution in R. My frequency dependent variable was calculated, in advance of modeling, as the number of claims per underlying exposure. Someone  that it would be incorrect to do this, and that the correct method was to model the observed claim counts and use the underlying exposure as an offset.   Can someone explain the theoretical and practical differences between scaling and offsetting? I ran the code both ways and noticed that the deviance residuals are significantly smaller when using offsets, but otherwise there were no material differences in variable selection.   P.S. Note the similar but still different question . When should parents stop changing clothes in front of children? Proving an inequality involving the logarithm function: $\frac{1}{n+1} \leq \ln \left(1+\frac 1n\right) \leq \frac 1n$ The question is to prove the inequality $$\frac{1}{n+1} \leq \ln \left(1+\frac 1n\right) \leq \frac 1n\\\forall n \geq 1, n\in \mathbb N$$  I tried using Taylor expansion but couldn't figure out anything. Any ideas? Thanks. Add 'Page' above page numbers in Table of Contents From Windows Vista to 7, can I get rid of folder Windows.old? I've just changed my laptop OS from Windows Vista to Windows 7.  I didn't choose to have both OS together, I just want to have Windows 7.   I was specting Windows 7 instalation program to format/clean my HD and leave me most of its capacity for a fresh start. But I've found, once the OS has been isntalled, that all files and programs from the Vista era are still in my HD, in a folder called Windows.old   I don't need these programs and files, I want to have as much HD space as possible and Windows 7 as clean as possible, what should I do?  Can I just delete Windows.old folder? Would that affect the how Windows 7 works?  Maybe is because I ended up angry with Vista, but I don't like the fact that there wasn't any cleaning/formatting ..   Thanks a lot Dropping z dimension programmatically Show that $a^{q-1} \equiv 1 \pmod{pq}$ Assume that $p$ and $q$ are distinct add primes such that $p-1\mid q-1$. If $\gcd(a,pq)=1$ ,show that: $$a^{q-1} \equiv 1 \pmod{pq}$$   I have tried as follows: $$a^{q-1} \equiv 1 \pmod{q} \quad \text{and} \quad a^{p-1} \equiv 1 \pmod{p}$$ $$\implies a^{(q-1)(p-1)} \equiv 1 \pmod{q} \quad \text{and} \quad a^{(q-1)(p-1)} \equiv 1 \pmod{p}$$ $$\implies a^{(q-1)(p-1)} \equiv 1 \pmod{pq}$$ But then I am stuck - please help. How do I specify unique constraint for multiple columns in MySQL? How do I reset the Windows XP Administrator password? Should I load an entire html page with AJAX? Is the collection of all functions between two sets a set? Ok, I have to admit, I don't really delve too deep into the semantics of the spatial operators list below, I'm more of a user, I write software to drive the SQL most of the time and don't really think about it too much.  However, I have a situation where a spatial operation I'm doing is going dog slow, on a table that has great indexes on and has never caused a problem before now.  As a result, I'm trying to figure out which of the following is my best bet to use, that will give me the best performance, however, sometimes I find my searches don't return anything when I know they should, and sometimes return stuff when they shouldn't.  SO I'm reaching out, to ask if some one can give me the actual definition, such as criteria to match, fully within enclosing geometry, or within outer ring etc etc of each of the following operations:  Equals(Geom1, Geom2):int Disjoint(Geom1, Geom2):int Touches(Geom1, Geom2):int Within(Geom1, Geom2):int Overlaps(Geom1, Geom2):int Crosses(Geom1, Geom2):int Intersects(Geom1, Geom2):int Contains(Geom1, Geom2):int Relate(Geom1, Geom2):int   If you can give a concrete example of when they will and will not match too, that would be great.  For reference, I'm searching on a table of Linestrings, using a rectangular polygon, rotated to be pointing in the direction of travel (It's part of a traffic managment app)  For further reference, here is a sample of the SQL the app generates to perform a search:  SELECT recordID,AsBinary(geometry) AS geometry,Distance(GeomFromText('POINT(-1.84101 54.85078)',4326), geometry) AS distanceFromGps FROM linegrid WHERE Intersects(GeomFromText('POLYGON ((-1.8413149820810311 54.850782468607292, -1.8409507853094111 54.850952257034713, -1.8408279009723911 54.850864894077496, -1.8411920982612455 54.850695105650068, -1.8413149820810311 54.850782468607292))'), geometry)   You can see in this example I'm using intersects trying the others as mentioned doesn't quite give the results I expect, hence why I'm asking the question.  Please note, I'm not particularly bothered about actual faster/other ways of doing this at the moment, BUT if you do happen to spot a better way do feel free to shout up :-)  For now all I'm mostly trying to understand is the differences between each of the operations.  As for doing it faster/better I intend to open a different question for that at a later date.  For more reference, the Spatial engine this is working against is Spatilite 2.3.0, and I can't upgrade it due to the devices it's running on not having a more up to date build for it (Windows CE)    I'm going to choose mintix'es answer here as that provided a super easy to understand grid and description of all the various operations, which answered my question.  I'm still faced with getting performance on the routines up, but I do now have a few strategies to try on that one, I may still seek advice here from the group with regards to that.  @Vince deserves some credit too, as that white paper is definitely the definitive answer, but it's also quite challenging to read (I had to read through it several times) , for anyone wanting the real I am on these operations The Clementini paper is the way to go, if you need an easy to understand overview while developing solutions however, the FME link should be open in another browser tab. Why does $(x \to a) ≠ (x = a)$ , But $f(x \to a) = f(x = a)$ Map matching links and ideas? I'm using OpenStreetMap and its vectorial road network and I'd like to implement a map matcher algorithm.   Currently I'm able, for each GPS position, to retrieve the nearest road segment and calculate the projection of this position to that segment, like on this image (Red pin is the pure GPS position, in blue the mapped segment and in Green the mapped position):    However, due to the lack of accuracy of the GPS, sometimes the mapped position jumps from segment to another and can provide some inconsistent mapped position from time to time.  My current algorithm is very basic : from the pure GPS position, I get the nearest segment and decide that the mapped matched position is on this one. I know that this can be really improved.  I can imagine that taking the vehicle direction into account will improve the map matching but do you know any other approach that would enable me to improve my map matcher ?  I seek any link, and/or open source software? How to connect nodes to node group inputs and outputs in python? Remember a half-typed command while I check something I often find myself in the following position: I've started typing a long command at the bash prompt, but half-way through I find out I need to check something with another command. This is a problem when I'm at the console (no X), which is often the case, because then I only have the following unsatisfactory ways to do it, that I know of:    Hit ctrl+alt+F2 and log in on another virtual console, and find out what I wanted, then go back and continue  ctrl+a, type echo + space + enter, find out what I wanted, press ↑ until I find my command, ctrl+a, del x 5, ctrl+e, and continue  Highlight what I've typed so far with my mouse (if gpm is running, which it usually is), press ctrl+c to interrupt, find out what I wanted while being careful not to use my mouse to highlight stuff, then press middle mouse button on a new prompt and continue  Pray to the command line gods that the half-written command will have no adverse effects but simply fail, and gingerly press enter, then find out what I wanted, press uparrow until I get my command back, and continue  Jump into my time machine, travel back in time and remind myself to start screen before starting to type command, travel back to the present, press ctrl+a c, find out what I wanted, press ctrl+a ctrl+a, and continue   So what I want to know is, is there some more elegant way of doing this? A sort of subshell-command or similar?  I'm most interested in methods that do not require any preparations or setup to work.