I am a Linux user for 20 years and I know how to automatically mount Windows partitions in LINUX. But I am trapped in Kubuntu that too on a Lenovo laptop. How can I auto mount windows partitions on Kubuntu?
I have two NTFS partitions, and I don't want to mount them manually every-time I start Ubuntu.   How can I do this?  Is there a tool or a code to use?   If so, is it safe to automount? specially when they are being used by another OS?
Who created the veil in the death chamber, and why? Was the veil created by someone or was it always there in HP? What is its purpose? If one can't communicate with the dead through the veil, then what/how do unspeakables learn from the the veil? (except investigating how does it flutter,I suppose,,,,) I'm trying to create a signature and date line in a document.  I need the date line to always be in the same spot on the page no matter what name is under the signature line, such as:  ----------------------   ---------------------- Representative           Date  ----------------------   ---------------------- Program Manager          Date   Here is the code I currently have:  \makebox[2.5in]{\hrulefill} \hspace {1.0in}\makebox[2.5in]{\hrulefill} \\ User Representative \makebox[2.5in][r]{Date} \\  \vspace{.2in} \makebox[2.5in]{\hrulefill} \hspace {1.0in}\makebox[2.5in]{\hrulefill} \\ Program Manager \makebox[2.5in][r]{Date} \   I want to be able to change the names, such as change Program Manager to Joe Foo and have the word 'Date' stay in the exact place.  Any help would be greatly appreciated.  I'm still a newbie at TeX so please forgive my ignorance. Two definitions of $\limsup$ Cleveref with counters with same name I am trying to use the  package.  I have the following counters defined (hopefully this is the right way to do it!)  \newtheorem{thm}{Theorem}[section] \newtheorem{lemma}[thm]{Lemma} \newtheorem{cor}[thm]{Corollary}   This works as I would like (i.e. Theorem 1.1, Corollary 1.2, Lemma 1.3, etc.)  My problem is \cref always returns Theorem 1.2, Theorem 1.3. I   Perhaps this is not right? (In my preamble)  \crefname{thm}{theorem}{theorem's} \crefname{lemma}{lemma}{lemma's} What apps are people using to record voice meetings on the iPad? Cannot truncate table because it is being referenced by a FOREIGN KEY constraint? Using MSSQL2005, can I truncate a table with a foreign key constraint if I first truncate the child table (the table with the primary key of the FK relationship)?  I know that I can either   Use a DELETE without a where clause and then RESEED the identity (or) Remove the FK, truncate the table, and recreate the FK.   I thought that as long as I truncated the child table before the parent, I'd be okay without doing either of the options above, but I'm getting this error:     Cannot truncate table 'TableName' because it is being referenced by a FOREIGN KEY constraint. How do I make a program auto-start every time I log in? I frequently need to start several programs that I use every time I start my computer. How can I make it so that whenever I login the program is automatically launched? Specific system of differential equations I have the following system of equations:  \begin{eqnarray}\frac{dx}{dt} = x(1 - x^2 - y^2) \\ \frac{dy}{dt} = y(4 - x^2 - y^2) \end{eqnarray}  I want to prove that if a solutions starts (at time $t = 0$) in the region   $$ G = \{(x, y) \in \mathbb{R}^2 : x &gt; 0, y &gt; 0 \text{ and } 1 &lt; x^2 + y^2  &lt; 4\} $$  that it remains there for all $t \geq 0$. I have already proven that, from $G$, a solution cannot cross the $x$-axis where $0 &lt; x &lt; 2$ or the $y$-axis where $0 &lt; y &lt; 2$ (since those line segments are orbits), but the pieces of the circles with radius 1 and 2 (where $x &gt; 0, y &gt; 0$) are the lines I haven't done yet. In this question we can focus on just the circle with radius 1 since the proof for the other circle is completely analogous to it.  In my book, there is a similar problem where they show that if a solution crosses a certain line, that solution attains its maximum or minimum value for $x$ and $y$, and then they derive a contradiction. However, in this case, for $n \geq 1$ the $n$-th derivative of $x$ equals 0 on the circle with radius 1. (If the second derivative were negative, $x$ would attain its maximum on the circle, a contradiction since $\frac{dx}{dt} &lt; 0$ in $G$, so $x$ is decreasing.)  I don't see why a solution can't cross the circle at all. On the circle, $\frac{dx}{dt} = 0$ and $\frac{dy}{dt} &gt; 0$, so after crossing the circle, the solution would go back up to $G$.  Is the circle itself an orbit?  EDIT I think I have found the answer. Using polar coordinates, I found $$ \frac{dr}{dt} = r - r^3 + 3r \sin^2(\theta) $$ Now, $$ \frac{dr}{dt} &gt; 0 \Leftrightarrow 0 &lt; r - r^3 + 3r \sin^2(\theta) \leq r - r^3 + 3r = 4r - r^3 $$ since $0 \leq \sin^2(\theta) \leq 1$. Note that $0 &lt; r \leq 1$ satisfies $4r - r^3 &gt; 0$, and thus $\frac{dr}{dt} &gt; 0$. Therefore, if a solution goes from $G$ to the edge of the unit circle, $r$ must, on the edge, either be decreasing or constant (i.e., its derivative is less than or equal to 0), contradicting the fact that the derivative is positive.  Can someone tell me if this is correct? Access to our computer (not only to the internet) needs to be restricted for the accounts of my kids (7, 8) until they are old enough to manage this by themselves. Until then we need to be able to define the following:   the hours of the day when computing is o.k. (e.g. 5 - 9 pm) the days of the week when computing is not o.k. (e.g. mondays to fridays) the amount of time allowed per day (e.g. 2 hours)   In 11.10 all of the following that used to do the job don't work any more:   : for > 11.10 no more available through the ppa. : command line alternative, but from 11.10 removed from the repositories. : Looks great but repeatedly crashes to force restarting X-server. So we can't use or recommed this program at the moment.   Are there any other alternatives? Is there a specific purpose in terms of efficiency or functionality why the k-means algorithm does not use for example cosine (dis)similarity as a distance metric, but can only use the Euclidean norm? In general, will K-means method comply and be correct when other distances than Euclidean are considered or used?  [Addition by @ttnphns. The question is two-fold. "(Non)Euclidean distance" may concern distance between two data points or distance between a data point and a cluster centre. Both ways have been attempted to address in the answers so far.] Is it a good practice to show a sign-up or registration form as seperate parts rather than in one go? I am designing a registration form for a site with multiple sets of information required from the user. I have categorized the data fields into relevant groups. Now should I present the form sections in one go or follow a wizard-like approach? What things should I keep in mind while deciding on this? What is tail recursion? Whilst starting to learn lisp, I've come across the term tail-recursive. What does it mean exactly? Beryllium Vacuum Sphere Boat/Aircraft Is it possible to make a solid rigid evacuated "balloon" out of Beryllium or other elements or alloys?  The critical buckling pressure at which an evacuated sphere is given as $$ P_1=\frac{2E\cdot\left(h/R\right)^2}{\sqrt{3\left(1-\nu^2\right)}} $$ where $E$ is , $h$ the shell's thickness, $R$ the radius to the midsurface shell, and $\nu$ is .  Of course this is theoretical and experimental and literature values for submersibles hover around 1/4 of the theoretical pressure.  Beryllium has the following properties:   Density=1.85 g/cm$^3$ Young's Modulus=287*10$^9$ Pa Poisson Ratio=0.032   Calculating the upward force, buoyancy at 101.3 kPa atmospheric pressure and Radius of 10m gives 4.24*10$^8$ N. The weight of this sphere with shell thickness 1mm has 2.32*10$^7$ N downward force of Beryllium material, so it will theoretically float at ground level.   Calculating the critical buckling stress of this beryllium sphere is 331.57 kPa, which is 3.27 times the atmospheric pressure of 101.3 kPa, so theoretically it won't buckle. But in experimentation done in earlier experiments as stated before, due to construction/material non-ideal situations, the critical buckling formula predicts about 4 times stronger than actual, so it would need about 400 kPa, not 331 kPa as Beryllium sphere with this specification would hold. Increasing the strength capability also increases weight and therefore lowers it's ability to float, but Beryllium is the closest element with this situation I have calculated that could work if ideal (I have only been using periodic table elements and household materials)  Is it possible with an alloy of elements? Using the equations for buckling and buoyancy, the following is needed. What alloys/materials come to your mind?  Material considerations:   Material with larger Poisson ratio Material with larger Young's Modulus Less dense material Construction (is it possible)   Material considerations affect on lift   Thickness can be larger, increases strength by the squared. But also increases weight. If a material with lower density with similar structural properties as Beryllium is used, it would help. Radius can be lower for same reason, but also lowers buoyancy (volume)   My other designs (don't worry about these just yet, just if you are curious is a vacuum sphere with a pressurized "outer tube" with spokes in tension (carbon fiber nanotubes maybe) to keep the 2 spheres in position. Another is a spherical truss out of carbon fiber nanotubes with a light membrane around. The truss prevents the outer membrane from collapsing due to the atmospheric pressure  The "point" of this if you ask, as to why not use a traditional balloon is it can be used as a boat by filling the sphere with air, and then used as a aircraft at will by evacuating the sphere. An alternative mode of transportation for sea vessels etc. For some reason my Steam just broke today after working perfectly since I installed it a few days ago.  It was originally installed via the deb from the Steam site. So I uninstalled that using the Ubuntu Software Center. Then I installed steam-launcher. When I run it from the menu it does nothing at all. When I go through terminal it gives this message, no error:  $ steam/usr/bin/steam:  line 196: /home/andrew/.local/share/Steam/steam.sh: Success   So I purge-removed it and removed the .steams directory from my home directory but on re-installation its the same story.  I am using Xubuntu 12.10 64bit.  It appears that steam .local/share/Steam/steam.sh is blank. What is it meant to have in it? I am so confused with how reinstalling it doesn't fix it. Why is Wine not installable on my system? I upgraded on a fresh install to Ubuntu 12.10, and I've tried installing wine many times, but I always get this:  This error could be caused by required additional software packages which are missing or not installable.  Furthermore there could be a conflict between software packages which are not allowed to be installed at the same time. The following packages have unmet dependencies:  wine:   It won't let me install the dependencies either it says it needs another set of dependencies to install them. Using Asus KJ50 64bit OS, dual boot with Windows 7  sudo apt-get install wine1.5 Reading package lists... Done Building dependency tree        Reading state information... Done Some packages could not be installed. This may mean that you have requested an impossible situation or if you are using the unstable distribution that some required packages have not yet been created or been moved out of Incoming. The following information may help to resolve the situation:  The following packages have unmet dependencies:  wine1.5 : Depends: wine1.5-i386 (= 1.5.15-0ubuntu1) but it is not installable            Recommends: gnome-exe-thumbnailer but it is not going to be installed or                        kde-runtime but it is not going to be installed            Recommends: ttf-droid            Recommends: ttf-mscorefonts-installer but it is not going to be installed            Recommends: ttf-umefont but it is not going to be installed            Recommends: ttf-unfonts-core but it is not going to be installed            Recommends: winbind but it is not going to be installed            Recommends: winetricks but it is not going to be installed E: Unable to correct problems, you have held broken packages. The canonical way to return multiple values in languages that support it is often . Option: Using a tuple Consider this trivial example: def f(x):   y0 = x + 1   y1 = x * 3   y2 = y0 ** y3   return (y0, y1, y2)  However, this quickly gets problematic as the number of values returned increases. What if you want to return four or five values? Sure, you could keep tupling them, but it gets easy to forget which value is where. It's also rather ugly to unpack them wherever you want to receive them. Option: Using a dictionary The next logical step seems to be to introduce some sort of 'record notation'. In Python, the obvious way to do this is by means of a dict. Consider the following: def g(x):   y0 = x + 1   y1 = x * 3   y2 = y0 ** y3   return {'y0': y0, 'y1': y1 ,'y2': y2}  (Just to be clear, y0, y1, and y2 are just meant as abstract identifiers. As pointed out, in practice you'd use meaningful identifiers.) Now, we have a mechanism whereby we can project out a particular member of the returned object. For example, result['y0']  Option: Using a class However, there is another option. We could instead return a specialized structure. I've framed this in the context of Python, but I'm sure it applies to other languages as well. Indeed, if you were working in C this might very well be your only option. Here goes: class ReturnValue:   def __init__(self, y0, y1, y2):      self.y0 = y0      self.y1 = y1      self.y2 = y2  def g(x):   y0 = x + 1   y1 = x * 3   y2 = y0 ** y3   return ReturnValue(y0, y1, y2)  In Python the previous two are perhaps very similar in terms of plumbing - after all { y0, y1, y2 } just end up being entries in the internal __dict__ of the ReturnValue. There is one additional feature provided by Python though for tiny objects, the __slots__ attribute. The class could be expressed as: class ReturnValue(object):   __slots__ = [&quot;y0&quot;, &quot;y1&quot;, &quot;y2&quot;]   def __init__(self, y0, y1, y2):      self.y0 = y0      self.y1 = y1      self.y2 = y2  From the :  The __slots__ declaration takes a sequence of instance variables and reserves just enough space in each instance to hold a value for each variable. Space is saved because __dict__ is not created for each instance.  Option: Using a  (Python 3.7+) Using Python 3.7's new dataclasses, return a class with automatically added special methods, typing and other useful tools: @dataclass class Returnvalue:     y0: int     y1: float     y3: int  def total_cost(x):     y0 = x + 1     y1 = x * 3     y2 = y0 ** y3     return ReturnValue(y0, y1, y2)  Option: Using a list Another suggestion which I'd overlooked comes from Bill the Lizard: def h(x):   result = [x + 1]   result.append(x * 3)   result.append(y0 ** y3)   return result  This is my least favorite method though. I suppose I'm tainted by exposure to Haskell, but the idea of mixed-type lists has always felt uncomfortable to me. In this particular example the list is -not- mixed type, but it conceivably could be. A list used in this way really doesn't gain anything with respect to the tuple as far as I can tell. The only real difference between lists and tuples in Python is that lists are , whereas tuples are not. I personally tend to carry over the conventions from functional programming: use lists for any number of elements of the same type, and tuples for a fixed number of elements of predetermined types. Question After the lengthy preamble, comes the inevitable question. Which method (do you think) is best? Unique pair of positive integers $(p,n)$ satisfying $p^3-p=n^7-n^3$ where $p$ is prime Q. Find all pairs $(p,n)$ of positive integers where $p$ is prime and $p^3-p=n^7-n^3$.   Rewriting the given equation as $p(p+1)(p-1)=n^3(n^2+1)(n+1)(n-1)$, we see that $p$ must divide one of the factors $n,n+1,n-1,n^2+1$ on the $\text{r.h.s}$.   Now, the $\text{l.h.s}$ is an increasing function of $p$ for $p\ge1$. This implies that for any given $n\ge1$, there is exactly one real $p$ for which $\text{l.h.s}=\text{r.h.s}$. For $p=n^2$, we get $\text{l.h.s}=n^6-n^2&lt;n^7-n^3=\text{r.h.s}.$ This means that either $p&gt;n^2$ or $p&lt;n^2$ must hold.  Assuming $p&gt;n^2$, it follows that the prime $p$ cannot divide any of $n,n+1,n-1$. So $p$ must divide $n^2+1$ and hence $p=n^2+1\quad (\because p&gt;n^2)$.  Substituting the value of $p$ in the given equation we get, $n^2+2=n^3-n\implies n^3-n^2-n=2$. As the factor $n$ on the $\text{l.h.s}$ must divide $2$, the above equation has a unique integer solution $n=2$.  Finally, we get $(5,2)$ as the solution to the given equation.      But how do I conclude this is the only solution possible? Also, why does'nt $p&lt;n^2$ (the case which I ignored) hold? As a bonus question, I would like to ask for any alternative/elegant solution (possibly using congruence relations) to the problem. Decomposition of semisimple Lie algebra via its roots Continued fraction of a square root If I want to find the continued fraction of $\sqrt{n}$ how do I know which number to use for $a_0$? Is there a way to do it without using a calculator or anything like that? What's the general algorithm for computing it? I tried to read the wiki article but was overwhelmed and lost. I tried Googling but couldn't find a website that actually explained this question.  If anyone has a good site that answers these questions either, please let me know. Thanks! "This edit would have to be a suggested edit" / edit button grayed out A couple of times recently when I attempted to edit a post while reviewing it from the "First Posts" queue, I received the following message when I tried to submit the form:  This edit would have to be a suggested edit. (x)   This is a rather cryptic message, considering that edits made from a review are suggested edits, subject to the same peer review process. There was no indication of how the edit would have to be submitted differently, much less why. I searched both help and meta for more information about this message, but came up empty.  The first time it happened, after I cancelled out I saw that someone else had just edited the post, so I thought maybe that's why I couldn't submit an edit from the review (and wondered why, if that's the case, the error message didn't just say that instead of telling me something that doesn't make any sense - that the edit I'm trying to suggest can't be submitted because it would have to be a suggested edit). However, the second time I received this message (last night, for this question: ), there was no other edit. So, I clicked the No action needed button and tried to edit the post outside the review process, only to discover that the edit link was grayed out.   I see several explanations of possible causes for graying out the edit link here: . However, there was no tooltip when I hovered over the disabled link, and the edit queue was in the single digits.  A few minutes later, I noticed that the edit link was no longer grayed out, so I edited the post and my edit was accepted.   My best hypothesis based on my experience with the error so far and the explanations I've read here at meta is that someone submitted a suggested edit while I was reviewing the post, which (a) caused me to get the cryptic error message and (b) caused the edit link to be grayed out when I accessed the post the normal way. Then a few minutes later, the suggested edit was rejected, opening up the question for new edit suggestions.  Rather than speculating about it and trying to determine the answer scientifically, it would be helpful if someone could give me the answer (as Seinfeld fans might put it, "Why don't you just tell me why I can't edit the post?"). It would be even more helpful if the error message itself provided the explanation, or if the message were defined somewhere in the help pages. But, at the very least, hopefully there will soon be an answer on meta to enlighten people who scratch their chins over this in the future. :)