How to mount an unmounted USB device Ubuntu using command?
Re-mounting an un-mounted USB stick
Is there a Google Drive client available? Undelete accidentally deleted records in Sqlite3 As title, possible? I have by accident deleted another record due to my ugly html interface in FireFox. The bad thing is this record delete is a root folder which the program automatically cascade delete everything :( I read this story 30+ years ago in grade school. A man crashes on an alien planet. He has a small amount of water and accidentally spills some, and the planet replicates it but it must destroy part of itself to do so.  The man then finds some stale crumbs in his pocket, puts them in a trough, and the planet replicates them as well, but it's disgusting to eat. The man eventually decides that his situation is hopeless, so he lays down to die on a table in a hot room and thinks he can at least give back to the planet some of the nutrients it sacrificed for him. He falls asleep, and when he awakens, he has been transformed into an alien creature that is perfectly suited and adapted to live on the planet without discomfort to himself or damage the planet. What are attention mechanisms exactly? Attention mechanisms have been used in various Deep Learning papers in the last few years. Ilya Sutskever, head of research at Open AI, has enthusiastically praised them:    Eugenio Culurciello at Purdue University has claimed that RNNs and LSTMs should be abandoned in favor of purely attention-based neural networks:    This seems an exaggeration, but it's undeniable that purely attention-based models have done quite well in sequence modeling tasks: we all know about the aptly named paper from Google,   However, what exactly are attention-based models? I've yet to find a clear explanation of such models. Suppose I want to forecast the new values of a multivariate time series, given its historical values. It's quite clear how to do that with an RNN having LSTM cells. How would I do the same with an attention-based model? Equivalent definitions of convexity for $f\in\mathcal C^1(\mathbb R^n)$ I noticed many identical questions on this site relating to equivalent definitions of convexity, see for example , , , , , ,  and there might be more. So I wanted to create a &quot;big list&quot; of equivalent definitions of convex functions, I will start with some equivalent definitions and post my proofs in my answer below. Feel free to add any other equivalent definitions. This question can then serve as an abstract duplicate. Claim. Let $n\in\mathbb N$ and $f\in\mathcal C^1(\mathbb R^n)$. Then the following are equivalent:  $f$ is convex, i.e. $f(\lambda x_1 + (1-\lambda x_2))\le\lambda f(x_1)+(1-\lambda)f(x_2)$ for all $\lambda\in[0,1]$ and $x_1,x_2\in\mathbb R^n$. For all $x,y\in\mathbb R^n$, $\langle\nabla f(x)-\nabla f(y),x-y\rangle\geq0$. For every $x,y\in\mathbb R^n$, $f(y)\geq f(x)+\langle y-x,\nabla f(x)\rangle$. Inequality : $\sum_{k=1}^n x_k\cdot \sum_{k=1}^n \frac{1}{x_k} \geq n^2$ I have to show the inequality of $$\left(\sum_{i=1}^n x_i\right)*\left(\sum_{i=1}^n \frac{1}{x_i}\right) \geq n^2.$$For $x_1, ... x_n \in \mathbb{R_{&gt;0}}$ and $ n \geq 1$. I wanted to show this inequality by induction. The basis is clear, but I am not sure how to do the inductive step. Can someone help me with that? Can Sasuke use Tsukuyomi? Eclipse freeze accessing project -> properties -> android tab Why do mathematicians use single-letter variables? I've encountered a particular type of writing occasionally and it being, derp, in writing, it's hard to tell whether there's an accent behind it. The English used seems to me to be simply incorrect, but I can't help but feel that the following features are part of a dialect or a regional style of English. One of the most glaring (and grating) features is the substitution of &quot;saw&quot; with &quot;seen&quot;.  He seen him at the shop the other day. I seen that you were looking for... etc.  The use of &quot;away (to)&quot; is also peculiar, if not incorrect.  He was away to open the door when... He was away to get what he had asked for. etc.  I haven't come across these forms very often, and even then it was accompanied by otherwise mostly correct English, which is what makes me wonder what the hell. This is more intellectual curiosity than anything else. Counterexample to Leibniz criterion for alternating series I have this statement and I need to say if it is true or false:  Let $\{a_n\}$ be a real sequence.  $$\lim_{n\to +\infty} a_n = 0 \quad \implies \quad \sum_{n=1}^{\infty}(-1)^na_n \quad \text{converges}$$  I know, from the Leibniz criterion that:     If $a_n \to 0$, $a_n$ is decreasing and positive then $\sum_{n=1}^{\infty}(-1)^na_n$ converges   From this fact I believe that the statement is false but I couldn't come up with an infinitesimal sequence that isn't decreasing and for that reason is divergent. I tried some function with $sin(\frac{1}{n})$ without any luck. Any help would be very appreciated, thank you! The rules of Transfiguration: examples of making the inedible edible? Information from the official website of J.K.Rowling is generally considered canon. I remember at least one case when she 'changed her mind' after a particular rule has been  published on her website (what happens with a secret if a Secret Keeper dies). Nevertheless, the information from the website can generally be considered reliable.  A rather obscure piece of information is J.K.Rowling's Wizards' Ordinary Magic and Basic Aptitude Test () published on her website in 2007 and now accessible with a Time Turner.   In particular, we know that only one of the following options is correct (as the software allows you to choose only one option):     Which of the following is CORRECT?            a. Food can be conjured out of thin air.       b. Any object can be Transfigured into food.       c. Foodstuffs can be increased, Transfigured, summoned from a distance and magically cooked.       d. It is impossible to make the inedible, edible.   e. Food-related Charms are some of the simplest forms of magic.      W.O.M.B.A.T. Grade 3, 13 June 2007, question 8   The test appeared on J.K.Rowling's website before the release of Book 7, but we can almost safely assume that there was no time for J.K.Rowling to change her mind after compiling the test (though she must have submitted these questions weeks before they were eventually published).  As Hermione explained in Harry Potter and the Deathly Hallows:      Your mother can’t produce food out of thin air, no one can. Food is the first of the  to . It’s impossible to make good food out of nothing! You can Summon it if you know where it is, you can transform it, you can increase the quantity if you’ve already got some...   It means that the correct option is c, and therefore all other statements are false. So, apparently, you can make food out of something else, though not any object can be transfigured into food. Can you come up with any example of such transformation mentioned in the books? $\lambda=\frac{2h}{p}$ instead of $\lambda=\frac{h}{p}$? I am studying quantum physics and there is something I don't understand:   I know that for any particle $E=hf$ (Einstein relation) and  $v=\lambda f$ ($v$ is the speed of the particle). I also know that the kinetic energy is $E_k=\frac{mv^2}{2}$.    Solving those 3 equations for $\lambda$:  $$h\frac{v}{\lambda}=\frac{mv^2}{2},$$ I finally find $$\lambda=\frac{2h}{mv}=\frac{2h}{p},$$ which is not consistent with the De Broglie relation $$\lambda=\frac{h}{p}.$$ Where am I wrong in my development? What is the difference between '/' and '//' when used for division? How do you install an APK file in the Android emulator? how to loop through arguments in a bash script Property of $\{0^n, 1^n, \ldots\}$ The differences between adjacent squares are the odd numbers:  0 1 4 9 16 25 …  1 3 5 7  9 …  The differences between adjacent odd numbers are 2 = 2!  I found that this truth is more general: If the differences between adjacent powers of $n$ are written out, and the differences of those differences etc, the $(n+1)$th sequence is {n!, n!, …}  Is this a well-known theorem? Does it have an easy proof? Prove that $ AB$ is a subgroup of order $mn$ if $m$ and $n$ are relatively prime. For instance, does the compiler know to translate  string s = "test " + "this " + "function";   to  string s = "test this function";   and thus avoid the performance hit with the string concatenation? Object-oriented shell for *nix