Goal: add Windows XP (32-bit) bootable partition to an existing dual boot system. Ghost or clonezilla (preferable) the image of a XP desktop to the third parition.   Is this possible? (assume XP drivers for the target PC are available) Is there a term \ word for ghosting a system into a multi-boot  partion? Is there a good example (link \ video \ procdure) on the web?   If you have experience performing this task, please state this and the details (context) of the initial state and outcomes.  Any lessons learned and pitfalls to avoid are appreciated: thank you  UPDATES  The insightful comments are appreciated: thank you.  The reason to avoid XP in a VM is that it running a computationally intensive algorithm and speed is important.  Target system does not use UEFI.  The task the XP drive performs takes hours on a 3Ghz desktop
A 256GB SSD has Windows-10 and 16.04 installed.  BIOS not UEFI.  A charity I work with requires me to use Quickbooks Desktop on Windows.  The plan is to ghost the existing system to a 512GB or larger SSD and create a third bootable Windows 7  partition for performing charity activities.   Is this possible to have a third partition? Is there a good example you have used as a guide? Is triple booting with two Windows partitions different from 2 Linux partitions?   If you have done this before ( with GRUB) please indicate this in your response: lessons-learned are appreciated.  Thank you
What value to use to convert ADC value to voltage? While working on my project, I got to a point where I don't know the answer. I have a 10-bit ADC (the one incorporated in the ATMEGA328P) and it returns values up to 1023 (210 - 1).   The official documentation states that the equation to convert the values from the ADC to the corresponding voltage is:   $$ V = \frac{V_{in} \cdot ADC}{2^{10}} $$  But, if the values go up to 1023, then wouldn't it be better to replace the 210 by 210&nbsp;-&nbsp;1?  Thanks. I have just installed Ubuntu 16.04 32-bit.   When I opened its software store, I found that it's not showing the apps I installed in Ubuntu 15.10 like Clementine, Gdebi package installer or synaptic package manager, dconf, acetoneiso etc.   I need these applications. How can I install them? Defining the Product of Ideals Vim-latex adds extra brackets when typing empty brackets How do I remove code duplication between similar const and non-const member functions? Is it a good practice to always scale/normalize data for machine learning? How to show that $C=C[0,1]$ is a Banach space Let $C=C[0,1]$ be the space of all continuous functions on $[0,1]$. Define $\|f \|=\max \ |f(x)|$. I want to show that $C$ is a Banach space.     Below is my attempt and I was wondering if it's ok.    I know I have to show that $C$ is a complete normed space. Clearly, $\|f\| \geqslant 0$ and $\|f\|=0 \Leftrightarrow f=0$. $\|cf \|=\max~|cf(x)|=|c|\max |f(x)|=|c| \cdot \|f\|$. $\|f+g\|=\max~|f(x)+g(x)|\leq \max~|f(x)|+\max~|g(x)|=\|f\|+ \|g\|$. So $C$ is a normed space.   Next, I show that every Cauchy sequence in $C$ is convergent. Let $\{f_n\}$ be a Cauchy sequence in $C$. Let $\varepsilon \gt 0.$ Then $\exists$ an $N_1$ such that $$ \max~|f_n(x)-f_m(x)| \lt \frac{\varepsilon}{2}$$ for $n, m \gt N_1$ and $x\in[0,1]$.  But there is a subsequence $f_{k_n} $, which converges to $f$. So $\exists$ an $N_2$ such that $$ \max~\left|f_{k_n} - f\right|\lt \frac{\varepsilon}{2}$$ for each $n\gt N_2$.  Now Let $N = \max\{N_1, N_2\}$, if $n \gt N$ then $k_n \geqslant n\gt N$. So we have $$ \max~\left|f_n(x) - f(x)\right| \leqslant \max~\left|f_n - f_{k_n}\right| + \max~\left| f_{k_n} - f\right| \lt\frac{\varepsilon}{2} + \frac{\varepsilon}{2} = \varepsilon.$$  Thus, $\|f_n-f\| \to 0$ as $n\to \infty$. $\quad \square$  Thanks. How are strings passed in .NET? What is the difference between <%# and <%= in ASP.NET MVC? How to output MySQL query results in CSV format? Is there any way to prevent mc from taking 10-30 seconds to open? How could I select one vertex from my mesh if I know ID of that vertex? I enabled bpy.app.debug = True and I can see all IDs but cant find a specific one. Disabling Intel Turbo Boost in ubuntu states:  Imports are always put at the top of the file, just after any module comments and docstrings, and before module globals and constants.  However if the class/method/function that I am importing is only used in rare cases, surely it is more efficient to do the import when it is needed? Isn't this: class SomeClass(object):      def not_often_called(self)         from datetime import datetime         self.datetime = datetime.now()  more efficient than this? from datetime import datetime  class SomeClass(object):      def not_often_called(self)         self.datetime = datetime.now() Justifying the Normal Approx to the Binomial Distribution through MGFs Would absolutely love if someone could help me with this question, in a step by step way to help those who are uninitiated to Statistics and Mathematics.   So, I am trying to "prove/justify" through MGFs how as n(the sample size) increases and goes to infinity, a standardized binomial distribution converges to the Standard Normal Distribution. So in the beginning we have $X_n $~$ Bin(n,p)$ then we standardize this $R.V.$ by subtracting the mean $E(X_n)=np$ and dividing by the $SD$ which is $np(1-p)$. After doing this, we get a new $R.V.$ with $mean=1$ and $variance=SD=1$. It is the distribution of this standardized quantity that converges to a fixed distribution, correct? Namely the Standard Normal Distribution. Let's call the standardized version of $X_n$, $Z_n$.   I think what we need to do is to find the MGF of $Z_n$ and show that this MGF becomes the Standard Normal Distribution's MGF as the sample size $(n)$ heads toward infinity. Now $Z_n$ is a function of $X_n$ which we know the MGF of which is $(1-p+pe^t)^n$.   Now I know that $Z_n$ is a linear transform and that we should be able to use this to simply the MGF but I don't understand how the course notes do it, mostly because they skip a lot of steps and it is difficult to follow. There is also a Taylor Series Expansion for the exponential that I am confused about although I do understand the concept of the series expansion.  Help would be greatly appreciated! I would love assistant in exactly how we can prove this via MGF.   Thanks so much in advance :) Should you set all the objects to null (Nothing in VB.NET) once you have finished with them?   I understand that in .NET it is essential to dispose of any instances of objects that implement the IDisposable interface to release some resources although the object can still be something after it is disposed (hence the isDisposed property in forms), so I assume it can still reside in memory or at least in part?  I also know that when an object goes out of scope it is then marked for collection ready for the next pass of the garbage collector (although this may take time).  So with this in mind will setting it to null speed up the system releasing the memory as it does not have to work out that it is no longer in scope and are they any bad side effects?  MSDN articles never do this in examples and currently I do this as I cannot  see the harm. However I have come across a mixture of opinions so any comments are useful. make iframe height dynamic based on content inside- JQUERY/Javascript After migrating 2007 to 2010- when i open the web application empty team site is created. no datas are visible I have followed this link for migrating SharePoint 2007 to 2010:    When navigating to my site after migration only the empty team site is visible. None of the data is available. Visual upgrade option is not there.  Where am I going wrong? I want to synchronise two folders in real time under Windows 7.  Basically, I want to monitor a folder and synchronise each change (new files, changed files, deleted files) to another drive. It has to be in real time, so it gets synchronised instantly when a change happens. A one-direction synchronisation is enough.  I tried Microsoft's , but it does only syncing by hand or scheduled (thus not satisfying the "real-time" requirement).  Can this be achieved with Windows 7 itself? If not, are there other methods of doing this? Subsubsection: remove the newline (like paragraph) Using the article document class, how can one remove the newline at the end of a subsubsection title?  I am using \documentclass{article}; I do not currently use titlesec or any of the alternatives; I do use fancyhdr.