How to create cmd file for Java program with dependencies
How can I pass arguments to a batch file?
I want to make a Launcher that will do privileged (requires root) commands, but I don't want to see the terminal or have to type my password into the terminal. So I found the command, gksudo that allows me to enter my password so that I can escalate my privilege level. Now I want to couple this, so that I can change the partition priority using this command cgpt add -i 6 -P 0 -S 0 /dev/sda (this command is privileged) and have it automatically reboot from this one launcher.  I setup a Luncher like this:  Name: ChromeOS  Description:  Command: gksudo gnome-terminal -e "cgpt add -i 6 -P 0 -S 0 /dev/sda;reboot"  Comment:  But it does not work. Any tips? Have the Linux kernel bugs that caused data loss when using a Samsung 850 Pro SSD been resolved? I just got a brand new Samsung 850 Pro SSD, and I would like to install Ubuntu 14.04 onto it.  I have read some pretty ugly stories of data loss with the 850 series SSDs when using Linux due to bugs in the kernel, as well as bugs in the TRIM operation.  I have done my research, but most of what I'm finding is very outdated. For example, see , and , as well as .  My question is, what is the current status? Have all major the bugs been worked out yet? Is “fortnight” an outdated word? I'm studying English vocabulary books, I find this word in each unit describing time words (days, weeks, months...).      There are 2 weeks in a fortnight.   Almost I haven't seen this word before in social websites, emails or movies. the only place I heard this word is in historical movies.  So, is it a outdated word or native speakers still use it? I need to prove that:      if a linear operator $\phi : V \rightarrow V$ on a vector space is nilpotent, then its only eigenvalue is $0$.   I know how to prove that this for a nilpotent matrix, but I'm not sure in the case of an operator. How would I be able to relate $\phi$ to a matrix?  Note: A nilpotent operator $\phi$ has been defined as an operator that satisfies $\phi^{n} = 0$ for some $n \geq 1$. Where in Europe can I purchase a car without residency? I am not a resident anywhere and plan to travel for the foreseeable future, mostly in Europe. My country has good visa-free access to most of Europe, so it is conceivable I could remain without any residency for quite some time.  I enjoy driving, and maintaining cars, and I would like to purchase a car somewhere in Europe.  Where, if anywhere, in Europe (or outside of Europe, but with the ability to drive the car in Europe) can I legally purchase and insure a car as a non-resident? I am open to creative solutions like setting up a company to own the car, if the capital and ongoing paperwork requirements for the company are not too onerous.    I am aware that I could save money, get places quicker, etc, by taking trains or flying. I have a passion for cars and driving. Suggesting that I not buy a car is out of scope of this question. Suppose that $a_1,a_2, \cdots, a_n$ are $n$ different integers. Then $[(x-a_1)(x-a_2) \cdots (x-a_n)]^2 +1$ is irreducible over $\mathbb Q$.   I've no idea why it is true. Thanks very much. calculating expected number of packets. How can I prohibit putting figure after the footnote? I have pretty simple LaTeX code that has a lot of figure environments, and I see the figure is inserted after the footnote.   \documentclass[10pt, onepage]{article}  \usepackage{graphics,graphicx} \usepackage{hyperref}  ... dependent code\footnote{You should use at least JRE 1.5 or later, but I highly recommend using JRE 1.6 or later}, you can safely use the JRE 1.5 or later.   \begin{figure} \centering \includegraphics[width=0.5\textwidth]{pic_install/4_configure_build_path.png} \caption{Configuration menu} \label{fig:config_build} \end{figure} Prove that a finite union of closed sets is also closed Let $X$ be a metric space.  If $F_i \subset X$ is closed for $1 \leq i \leq n$, prove that $\bigcup_{i=1}^n F_i$ is also closed.  I'm looking for a direct proof of this theorem.  (I already know a proof which first shows that a finite intersection of open sets is also open, and then applies De Morgan's law and the theorem "the complement of an open set is closed.")  Note that the theorem is not necessarily true for an infinite collection of closed $\{F_\alpha\}$.  Here are the definitions I'm using:  Let $X$ be a metric space with distance function $d(p, q)$.  For any $p \in X$, the neighborhood $N_r(p)$ is the set $\{x \in X \,|\, d(p, x) &lt; r\}$.  Any $p \in X$ is a limit point of $E$ if $\forall r &gt; 0$, $N_r(p) \cap E \neq \{p\}$ and $\neq \emptyset$.  Any subset $E$ of $X$ is closed if it contains all of its limit points. What happens if I use RAM of a faster speed than the CPU supports? Looking at the  CPU, under Memory types it says "DDR3-1333/1600". My question is, in what way does the CPU limit the RAM speed? What would happen if I put in a DDR3-2133 RAM chip together with the CPU, if the motherboard supports the faster RAM speed? Would it be better to get a RAM chip that is DDR3-1600 so it matches the CPU's listed frequency? Loading multiple CSV files into QGIS 2.10 How can I load multiple CSV files into QGIS with Longitude/Latitude already included in it. I downloaded the &quot;Load Them All&quot; plug-in, however, the result loaded was converted as text files and cannot be visualize on the map canvass. Any help? Are there any available plug-ins that can load multiple CSV file that will work fine in QGIS? Hello everyone interested. Here's a seemingly simple problem.  Suppose $G$ is a complete, simple graph with vertices $\{1,2,..,n\}$, $n\geq k\geq 3$.  How many cycles of length $k$ can we have on $G$?  The statement seems simple but I have trouble putting everything together.  So I say fix a vertex and start forming cycles with length k. But I get nowhere... What is the proper approach to this problem since counting is not easy? Is there a relevant theorem that I am unaware of?  Thanks for any help... During Windows installation I accidentally typed an accented name for my user name and my profile name is named after it. I already renamed my user to not have an accented character, but the profile folder is an other topic.  Basically I want this because I have some applications what have a problem with the accented character.  Is there a way to rename it? I know I have to make a copy from my profile, but how can I perform a relocation itself? I wouldn't like touch any other profiles on the machine just mine. Is it possible to have multiple bevel objects along a curve? I'm wondering if it's possible to define multiple bevel objects along a curve and have Blender interpolate between the bevels like keyframes. Find and replace text within multiple files I want to know how I can find and replace a specific text in multiple files like in Notepad++ in the linked tutorial.  e.g.: According to the original paper of , there is no key validation needed when using Curve25519 for Diffie-Hellman Key Exchange. However, where does this property come from? Is there any proof or argumentation available in order to understand this really practical property of Curve25519? Does this mean that each $x$ coordinate could belong to a point $P=(x,y)$ from Curve25519? Is that even possible? Possible pitfalls of using this (extension method based) shorthand Are C++ enums signed or unsigned? And by extension is it safe to validate an input by checking that it is &lt;= your max value, and leave out >= your min value (assuming you started at 0 and incremented by 1)? Fighting a black hole: Could a strong spherical shell inside an event horizon resist falling in to the singularity? As a thought experiment imagine an incredibly strong spherical shell with a diameter a bit smaller than the event horizon of a particular large black hole.  The shell is split into two hemispheres, and the two hemispheres are released from either side of the black hole such that they will meet and join inside the event horizon, forming a stationary uniform shell around the singularity. Of course, we consider that the shell is flawless, and exactly centred around a stationary singularity - clearly this is an unstable equilibrium but we imagine it is possible.  Is is possible that the structural forces provided by such a shell could be strong enough to resist the extreme gravity conditions inside the event horizon, and hence avoid being sucked into the singularity?      (For the purposes of this question we can consider taking the shell to extreme levels of strength, e.g. consider that the shell is made from a theoretical maximally densely packed neutronium-like material that is strongly resistant to any further compression due to the Pauli exclusion principle). I'm looking for a word which describes a task which I think is poorly designed and will lead to either mediocre results or failure, but which I have to do anyway, especially in a work setting.   The word "Dilbertian" comes to mind, however this word is obviously made up and is only meaningful to someone who is familiar with the Dilbert comic strip, so I'm looking for something which captures both the futility and compulsory nature of the task in a way which is meaningful to a broader audience.