Ubuntu 18.04 USB installer fails to start: "Ubiquity not installed" Trying to install Ubuntu 18.04 on an Asus UX305C.  I Downloaded Ubuntu Desktop ISO on 21/06/2018 about 16:00H  I used Unetbootin from a ThinkPad running 18.04 to install the iso files onto a USB2 SanDisk USB.   I boot the laptop from the USB. I chose Install.   Instead of Installing it takes me to the "try Ubuntu" live session. I click install disk icon nothing happens.   I tried to manually run Ubiquity. It produces a crash report that says Ubiquity is not installed.   I go to that location and the BIN directory is there.  I run it again (with the bug report open) to be sure that it's currently running.   Close bug report, run again. Nothing. Wait a bit, get same bug crash report.   What am I doing wrong?
How do I install Ubuntu alongside a pre-installed Windows with UEFI? 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?
Shortest path from points in one layer to points in another layer via roads in QGIS Why is "if not someobj:" better than "if someobj == None:" in Python? No reason for anyone to see pending close votes, except OP (and maybe people who already voted) I have edited (created) the php.ini file and the .htaccess file in accordance with  post. I have also found a plug-in (called Upload Max File Size) that claims to raise the file size limit of media files. With the plug-in activated, I see on the add new media screen that the limit has been changed. However, when I attempt to upload a 2.7MB image, I receive the error:  The uploaded file exceeds the upload_max_filesize directive in php.ini.   The contents of php.ini are:  upload_max_filesize = 32M post_max_size = 32M max_execution_time = 300   My .htaccess file contains:  # BEGIN WordPress  php_value upload_max_filesize 100M php_value post_max_size 1M php_value max_execution_time 300 php_value max_input_time 300  # END WordPress   I am currently hosting the word press site myself and have root privileges to anything. How can I create a select menu in a shell script? I'm creating a simple bash script and I want to create a select menu in it, like this:  $./script  echo "Choose your option:"  1) Option 1   2) Option 2   3) Option 3   4) Quit     And according to user's choice, I want different actions to be executed. I'm a bash shell scripting noob, I've searched the web for some answers, but got nothing really concrete. Associates in Integral Domain Let $x$ and $y$ be nonzero elements of an integral domain $D$. Then $x$ and $y$ are associates if and only if $x = yd$ for some unit $d \in D$.    I am done proving the $\Leftarrow$ part. For $\Rightarrow$ what I did was: If $x$ and $y$ are associates then $x \mid y$ and $y \mid x$, so $x \mid y$ implies that $xs = y$ for some $s \in D$ and $y \mid x$ implies that $yt = x$ for some $t \in D$. That is, $yts=y$ which implies $ts=1$. Therefore $s$ is a unit and $t$ is a unit.    Am I on the right track? Can I say that the proof is complete? Why use gradient descent with neural networks? When training a neural network using the back-propagation algorithm, the gradient descent method is used to determine the weight updates. My question is: Rather than using gradient descent method to slowly locate the minimum point with respect to a certain weight, why don't we just set the derivative $\frac{d(\text{Error})}{dw}=0$, and find the value of weight $w$ which minimizes the error? Also, why are we sure that the error function in back-propagation will be a minimum? Can't it turn out the error function is a maximum instead? Is there a specific property of the squashing functions that guarantees that a network with any number of hidden nodes with arbitrary weights and input vectors will always give an error function that has some minima? A result of Stieltjes Integral While studying the Riemann - Stieltjes integral, I read this exercise in my book:  "Let $f:[a, b]\to \mathbb{R}$ be a bounded function. Denoted $L(P, f)$ the lower Darboux sum and $|P|$ the mesh of the partition $P$. Prove that for every $\epsilon&gt;0$, there exists $\delta&gt;0$ such that for every partition $P$ with $|P|&lt;\delta$, we have: $\underline{\int_{a}^{b}}f(x)dx-L(P, f)&lt;\epsilon$."  My question is: Can we generalize this problem for Stieltjes integral, with $\underline{\int_{a}^{b}}f(x)d\alpha$ instead of $\underline{\int_{a}^{b}}f(x)dx$?  Particularly, can we have this theorem?  Let $f:[a, b]\to \mathbb{R}$ be a bounded function and $\alpha$ is a monotonic function on $[a, b]$ . Denoted $L(P, f, \alpha)$ the lower Darboux sum and $|P|$ the mesh of the partition $P$. Prove that for every $\epsilon&gt;0$, there exists $\delta&gt;0$ such that $\underline{\int_{a}^{b}}f(x)d\alpha-L(P, f, \alpha)&lt;\epsilon$ for every partition $P$ with $|P|&lt;\delta$?  I don't know how the mesh of the partition relate to the function $\alpha$. My inline-block elements are not lining up properly Javascript variables keep track to their copies? After purge mussels 6 time in salt water 20 mins each, why they still exude much grime? I  buy mussels at Pusateri and Whole Food Market for a year in Toronto. They sell them on ice and dry, not in running water.      , Bart teaches add salt to cold water and  soak for 20 mins. But I repeat 6 times...so 20 mins x 6 times = 120 mins of soaking!!! Mussels exudate less black grime every next time, but even after 6 times, water still has much black grime! See my pic under! Why? This happening for a year!     Part 2,  has GIF that shows you what I mean. Profitable strategy in coin tossing? There is a coin with a probability $p$ of heads, and $1-p$ of tails. Tosses are independent of each other. When you bet an amount of money $x$, you receive $2x$ if it lands heads, and you lose what you bet if it lands tails.  We are going to use the following strategy:  You start betting an initial amount $x_0$. Every time you lose, you bet twice what you bet in the previous throw. You keep doing this, until you win, at which point you retire, or start again, betting $x_0$.  The interesting case of course is when $p &lt; 0.5$.  The question is: How profitable is this strategy? Intuitively I feel that eventually I can always win an arbitrarily large amount of money. But that can't be entirely right ("the house always wins!"). So what am I missing here? What's the expected win in each run?  Also, does this sort of strategy have a name in the literature?  P.S.: Found this later, How are the number of views in a question calculated? I saw it's not just a page views number, because, if I press F5 several times, it won't increase the number of views.  They could store my IP address in a table, but wouldn't that make it slow? They would need to query a database one more time for each request. Why is you subjective? (Catchy title, eh?)  I am asking the following on the photo.SE site:     How do you change from portrait to landscape in Lightroom   DANGER! DANGER! This appears to be subjective and is likely to be closed.  If I ask the following radically different question:     How do I change from portrait to landscape in Lightroom   ... there is no problem.  So, like the title says: Why is "you" subjective?  (And  where Jeff spills the regex) In classical logic, why is $(p\Rightarrow q)$ True if $p$ is False and $q$ is True? How do you "OR" criteria together when using a criteria query with hibernate? Start new chapter on same page One way to prove that there is an infinity of consecutive powerful integers is to just note that there are infinite solutions to the equation $x^2-8y^2=1$, because clearly $x^2$ and $8y^2$ are clearly powerful. But this uses a bit of theory.  I found this problem under an induction worksheet, and all of the surrounding problems are easy. Is there really an elementary solution to the problem?  All of my attempts have been fruitless.  Note: a number is powerful if whenever a prime $p$ divides it we have that $p^2$ also divides it. I want to print two files in two columns -- first file on the left side and second on the right side. paste doesn't do the job, because it can only insert a character as delimiter, so if first file lines have different length output will be twisted: $ cat file1 looooooooong line line $ cat file2 hello world $ paste file1 file2 looooooooong line   hello line    world  If it was a command to add trailing spaces like fmt --add-spaces --width 50 the problem would be solved: $ paste &lt;(fmt --add-spaces --width 50 file1) file2 looooooooong line                                 hello line                                              world  But I don't know a simple way to do this. So how to merge and print several files horizontally without twisting? Actually, I just want to look at them simultaneously.  UPD: command to add trailing spaces does exist (for example, xargs -d '\n' printf '%-50s\n') But solution like $ paste &lt;(add-trailing-spaces file1) file2  does not work as expected when file1 has fewer lines than file2. When constructing the matrices for the two CNOT based on the target and control qubit, I can use reasoning:  "If $q_0$==$|0\rangle$, everything simply passes through", resulting in an Identity matrix style $\begin{bmatrix}1&amp;0\\0&amp;1\end{bmatrix}$ in the top left. "If $q_0==|1\rangle$, we need to let $q_0$ pass and swap $q_1$, resulting in a Pauli X $\begin{bmatrix}0&amp;1\\1&amp;0\end{bmatrix}$ in the bottom right.  $CNOT \equiv \begin{bmatrix}1&amp;0&amp;0&amp;0\\0&amp;1&amp;0&amp;0\\0&amp;0&amp;0&amp;1\\0&amp;0&amp;1&amp;0\end{bmatrix}$  "If $q_1$==$|0\rangle$, everything simply passes through", results in leaving $|00\rangle$ and $|10\rangle$ unaffected. "If $q_1==|1\rangle$, we need to let $q_1$ pass and swap $q_0$, mapping $|01\rangle$ to $|11\rangle$ and  $|11\rangle$ to $|01\rangle$  $CNOT \equiv \begin{bmatrix}1&amp;0&amp;0&amp;0\\0&amp;0&amp;0&amp;1\\0&amp;0&amp;1&amp;0\\0&amp;1&amp;0&amp;0\end{bmatrix}$  This all seems to check out, but here comes my question: I would like to know if there is a more mathematical way to express this, just as there would be when combining for instance two hadamard gates: $H \otimes H \equiv \frac{1}{\sqrt{2}}\begin{bmatrix}1&amp;1\\1&amp;-1\\ \end{bmatrix} \otimes \frac{1}{\sqrt{2}}\begin{bmatrix}1&amp;1\\1&amp;-1\\ \end{bmatrix} = \frac{1}{2}\begin{bmatrix}1&amp;1&amp;1&amp;1\\1&amp;-1&amp;1&amp;-1\\1&amp;1&amp;-1&amp;-1\\1&amp;-1&amp;-1&amp;1 \end{bmatrix}$  And a bonus question:  How I can, using notation like "CNOT", show which qubit is the control bit and which qubit the target bit?