In the Season Six finale of Game of Thrones,      in the second part of the Tower of Joy flashback, we see Lyanna Stark tell young Ned something, before saying "Robert will kill him, you know he will."   Do we have any lipreaders amongst us who could possibly work out what she was saying? Or was it more likely just gibberish and all done for dramatic effect?
In the final episode of season 6 we see that Lyanna Stark is whispering something to Ned. What is she saying?
When you watch a video in YouTube, you can seek it with the thumbnail preview. Many Windows' and MacOS' video players have this feature, but what about Linux's? I've already read , but the information in it seems out-of-date.  is still alive but the project is neglected (see ), and actually the player doesn't work on the latest Ubuntu or Linux Mint.  Is there any video player which has the feature and works on the latest linux distributions? Or must I use Windows' one with VirtualBox? If only VLC would implement this feature, but it seems that won't happen as far as I read .  YouTube's seek preview: Why not use exceptions as regular flow of control? Which one is correct?   Neither my friend nor I feel my best in the morning. Neither my friend nor I feel her best in the morning. Neither my friend nor I feel our best in the morning.    I already know that the verb agrees with the subject closer to the verb:   Neither my friends nor my brother understands me. (correct) Neither my friends nor my brother understand me. (wrong)   AND   Neither my brother nor my friends understand me. (correct) Neither my brother nor my friends understands me. (wrong) Why use apparently meaningless do-while and if-else statements in macros? In many C/C++ macros I'm seeing the code of the macro wrapped in what seems like a meaningless do while loop.  Here are examples.  #define FOO(X) do { f(X); g(X); } while (0) #define FOO(X) if (1) { f(X); g(X); } else   I can't see what the do while is doing.  Why not just write this without it?  #define FOO(X) f(X); g(X) In Walter Rudin's Principles of mathematical analysis Exercise 5.21, it is proved that for any closed subset $E\subseteq \mathbb{R}$, there exists a smooth function $f$ on $\mathbb{R}$ such that $E=\{x\in \mathbb{R}\mid f(x)=0\}$.   Since $E^c$ is open in $\mathbb{R}$, $E^c$ is a countable disjoint union of open intervals $(a_i,b_i)$. On an interval $(a,b)$, if we let $f(x)=\exp(\frac{1}{(x-a)(x-b)})$, $x\in(a,b)$; $f(x)=0$, $x\notin(a,b)$, ($f(x)=\exp(\frac{1}{(x-a)})$ or $f(x)=\exp(\frac{1}{(x-b)})$ on $(a,\infty)$ and $(-\infty,b)$ resp.), then $f$ is smooth. Hence we can get a smooth function on $\mathbb{R}$ such that $E$ is the zero point sets of $f$.  (1). How about a closed subset $E$ of $\mathbb{R}^n$? is it true that for any closed subset $E\subseteq \mathbb{R}^n$, there exists a smooth function $f$ on $\mathbb{R}^n$ such that $E=\{x\in \mathbb{R}^n\mid f(x)=0\}$?  An open set in $\mathbb{R}^n$ cannot be written as a disjoint union of countable open balls hence the proof above is not valid. The partition of unity only claims that for an  open set $U$, there exists open $V$ in $U$ such that $\bar V\subseteq U$ and a smooth function $f$ on $\mathbb{R}^n$ such that $supp f\subseteq U$, $f|_V=1$.   (2). The taylor series of $f(x)=\exp(\frac{1}{(x-a)(x-b)})$ does not converge around points $a,b$ hence $f$ is not analytic at $a,b$. Is it true that for any closed subset $E\subseteq \mathbb{R}$, there exists an analytic function $f$ on $\mathbb{R}$ such that $E=\{x\in \mathbb{R}\mid f(x)=0\}$? We are conducting a test on a rare disease. A positive result means that, according to the test, the subject is infected. The following characteristics are known about the test and the disease: If a person is infected, the person has a $95\%$ chance of testing positive. When a healthy person is tested, the test has a $99\%$ chance of giving a negative result. A mere $0.1\%$ of the population is infected with the disease. If a person is tested positive for the disease. What is the probability that the person actually has the disease? I don't understand how to write the conditional probabilities if someone can explain to me than I should know how to solve it, but I'm not sure how to convert the text into the mathematics language. I've read  about how some publishers (e.g., Springer) allows authors to submit to arXiv before journal submission, but they make authors wait for a year after acceptance to submit to arXiv.   My question is: Is it okay to submit to arXiv during the time when the paper is under consideration by the journal, for example after it has been "revised and resubmitted" but before final decision? script custom previews in a menu I want to know how to create a menu with previews for an add-on. Until now I know that this is related with the bpy.utils.preview. I'm making an add-on that appends objects from a .blend file, I know how to append objects but what I want to do is to create a menu with previews of the objects /(similar to the matcaps menu - see below), select them and then press an &quot;import button&quot; to append the object. Here's some documentation about the module:    Also, as this is an add-on I don't know if I should have a def register() and a def unregister() inside this .py file as well as in the __init__.py file. LINQ to read XML I got this XML file:  &lt;root&gt;     &lt;level1 name="A"&gt;         &lt;level2 name="A1" /&gt;         &lt;level2 name="A2" /&gt;     &lt;/level1&gt;     &lt;level1 name="B"&gt;         &lt;level2 name="B1" /&gt;         &lt;level2 name="B2" /&gt;     &lt;/level1&gt;     &lt;level1 name="C" /&gt; &lt;/root&gt;   Could someone give me a C# code using LINQ, the simplest way to print this result: (Note the extra space if it is a level2 node)  A   A1   A2 B   B1   B2 C   Currently I got this code:  XDocument xdoc = XDocument.Load("data.xml")); var lv1s = from lv1 in xdoc.Descendants("level1")            select lv1.Attribute("name").Value;  foreach (var lv1 in lv1s) {     result.AppendLine(lv1);      var lv2s = from lv2 in xdoc...??? } when calling SCP in PuTTY on my Win7 box, it doesn't let me use C:/, but I also have no idea where on my local machine it will look for files by default. None of program directory or user directory worked. For example, I saved file.txt next to PuTTY.exe, and also in C:\Users\Me but calling SCP file.txt file.txt in PuTTY failed both times with      cp: cannot stat 'file.txt'   So, how do I transfer a file to my server using PuTTY?  EDIT: Also, calling SCP file.txt myserver:file.txt gives a similar error: file.txt: No such file or directory I am trying to disable the touchscreen on my Asus S200E laptop.  In Ubuntu 16.04, I was able to do so with this:  Section "InputClass"     Identifier "evdev touchscreen catchall"     MatchIsTouchscreen "on"     MatchDevicePath "/dev/input/event*"     Driver "libinput" EndSection   How can this be done on Ubuntu 18.04? I am looking for a good source on group theory aimed at physicists. I'd prefer one with a good general introduction to group theory, not just focusing on Lie groups or crystal groups but one that covers "all" the basics, and then, in addition, talks about the specific subjects of group theory relevant to physicists, i.e. also some stuff on representations etc.  Is Wigner's text a good way to start? I guess it's a "classic", but I fear that its notation might be a bit outdated? How does electron move around nucleus? I need to get a nice picture about how electron moves around nucleus? I find concept of probability and orbitals quite difficult to understand? What's "Another Way In"? There's a new achievement and I'm stumped as to how to get it:     Start a game without breaking the laboratory wall   I assume it has something to do with the new Gadgets but none of them sound like they'd help. How do I get this achievement? Expected maximum of sub-Gaussian I'm trying to answer the following question from the book :  Let $X_1,X_2,\dots$ be a sequence of sub-gaussian random variables, which are not necessarily independent. Show that   $E\bigg[ \max_i \frac{|X_i|}{\sqrt{1 + \log i}} \bigg] \le CK$,  where $K = \max_i \|X_i\|_{\psi_2}$. Deduce that for ever $N \ge 2$ we have   $E\bigg[ \max_{i \le N} |X_i| \bigg] \le CK \sqrt{\log N}$.  I've tried to figure out what is the distribution of the maximum of Gaussians, but I'm reaching only inequalities that that don't help me answer the question.   I've also seen a similar question .  Does anyone have a clue or something to start with in order to answer this question?  Thanks! I want to reinstall Ubuntu, but I also want all information and settings to disappear. So everything looks like the first time I installed it. Is it possible to do so via Terminal? Or what are the steps I should follow? How to replace whitespaces in a filename? i tried it the following way:  rename 'bla bla .txt' blabla.txt   But this doesn't work, what's the correct syntax for this case? Moderator flag notifications should reach mobile I spend a great deal of time surfing SE sites from my phone during commutes and other down times. The global inbox is quite effective at reaching me even for chat pings. Quite frankly the mobile site is very well done!  However as a community moderator, there is a whole class of information not getting through. There are no notifications for moderator flags! I can switch to the full site and see these but that is inconvenient for browsing, so I only end up checking for flags periodically.  Ideally the moderator tools should all be available in mobile templates, but as a stand-by it's reasonable to switch to the full view to handle flags, but flags would get addressed in a much more timely manner if I knew about them. As it stands I often come and go from the site without even knowing there are outstanding flags.  A simple flag counter added to the header next to the notification counter and linked to the tools page (which automatically opens the full version anyway right now) would fix this. Node.JS Not working on the internet Two blue arrows at top right of icons