Just noticed this on :    The diamond being outside the blue owner-highlighting looks really weird. Pretty sure it used to be inside the highlighting. Could it be moved back?
In comments, moderators have their diamonds in the OP rectangle:        And in the review (suggested edits), mods have their diamonds outside the blue OP background highlight rectangle:        Of course, it Doesn't Really Matter At All, but it is a small discrepancy (I am not saying that in the review, OP rectangles have a bigger padding).
I have 2-3 different column names that I want to look up in the entire DB and list out all tables which have those columns. Any easy script? One of the boys who always give/gives the correct answer is Samuel.   As per rule, one of is followed by plural noun/pronoun and singular helping verb, so we should be using gives in the sentence. But the answer is give. I would like to get an alert (with sound) when my laptop battery is fully charged.  How can I do that? I am trying to get Juju working on Windows 8 but I am running in to some errors when trying to get juju to see my ssh keys:  C:\Users\username&gt; juju bootstrap error: error parsing environment "azure":     read C:\Users\user\SkyDrive\Documents\Azure\ssh\: The handle is invalid.   I've added a public key I generated with putty to the directory above called azure  My environments.yaml file has this in it:  authorized-keys-path: C:\Users\user\SkyDrive\Documents\Azure\ssh\   Any ideas? Printer "Filter failed" Upgraded to 18.04 from 16.04. I have a workplace printer connected through appsocket which stopped working.  Printer status is Idle-Filter failed.  Printing queue instantly goes to "stopped".  Right clicking on the printer shows "option finishings has value 3 and cannot be changed". I can't find any info on this error except one pdf to ignore the error.  The printer model Ricoh MP 2555 worked previously with the Ricoh MP C2800 driver. Now it works with neither 2800 or 2555.  The IP address of the printer pings fine. When I try and detect the printer on the network using IP address and I ask it to use the Ricoh MP 2555 driver, it asks for an additional driver which opens Ubuntu software (which never helps) and fails.  I tried changing drivers from "" by providing the ppd file. It still doesn't help. var/log/cups/error.log doesn't tell much, or I don't get it.  Hope someone knows about this error or some kind of a generic solution. Let $X$ be a normed linear space, $x\in X$ and $r&gt;0$. Define the open and closed ball centered at $x$ as  $$ B(x, r) = \{y \in X : \Vert x − y\Vert &lt; r\} $$  $$ \overline{B}(x, r) = \{y \in X : \Vert x − y\Vert \leq r\}. $$ Then $B(x, r)$ and $\overline{B}(x, r)$ are convex.  I tried to prove this, but either my calculation is incorrect, or I am on the wrong path:  I aim to show for the closed ball $\overline{B}(x,r)$ (for open ball I assume the proof is similar). Suppose $y,z \in \overline{B}(x, r)$. Then $\Vert x − y\Vert \leq r$ and $\Vert x − z\Vert \leq r$. We must show that $t \in [0,1]$ implies $ty + (1-t)z \in \overline{B}(x,r)$. But $t \in [0,1]$ implies $$ \Vert ty + (1-t)z - x\Vert = \Vert t(y-z) + z - x\Vert \leq |t| \Vert y-z\Vert + \Vert z-x\Vert \leq |t|(\Vert y-x\Vert + \Vert x-z\Vert) + \Vert z-x\Vert &lt; |t|(2r) + r = r(2|t| + 1), $$ which is not necessarily $\leq r$. We probably wanted to end up with $&lt; |t|r$ or $\leq |t|r$ as our final inequality.  Thanks in advance. Has the disputed flag message changed? I know how disputed flags work. Today, I reviewed a "not an answer" flag and marked it as invalid.   I've later seen a disputed message with this reason:     invalid flag         disputed - a moderator reviewed your flag, but found no evidence to   support it   Given that disputed flags are in the ,  Is this message applicable only to my flag or is this message also for the original flagger?  Or put otherwise, are all disputed flags now shown this message (or similar decline reason)?  I've run out of flags for today to test this further. display only 3 foreach result per row What's the proof that the Euler totient function is multiplicative? That is,     why is $\varphi(AB)=\varphi(A)\varphi(B)$, if $A$ and $B$ are two coprime positive integers?   It's not just a technical trouble—I can't see why this should be, intuitively: I bellyfeel that its multiplicativity should be an approximation at most. And why the minimum value for $\varphi (n)$ should be $ \frac{4n}{15} $ completely passes me by. I am working on vector auto-regression (VARs) and impulse response function (IRFs) estimation based on panel data with 33 individuals over 77 quarters.  How should this type of situation be analyzed?  What algorithm's exist for this purpose?  I would prefer to conduct these analyses in R, so if anyone is familiar with R code or a package designed for this purpose that they could suggest, that would be especially helpful. Say a security has been trading at under $20.10, and there are limit orders selling at $20.10 and $20.21. Then Simon issues a limit order to buy at $20.21. According to , Simon would end up buying shares at $20.10.  Why does the exchange favor the buyer here?  I.e., why does the transaction execute at the seller's limit of $20.10 instead of the buyer's limit of $20.21?  (I.e., why don't Inara/River get to sell at $20.21 / above their limit, but Simon gets to buy at $20.10 / below his limit?)  Is the example flawed?  If it makes a difference, I'm mainly curious about NASDAQ and NYSE.  I tried Googling for specs (e.g. ), but couldn't find anything.  Only found that some  implementation executes the average of the buy/ask.  Just curious how the system works. How to make a standalone document with one equation? How do I make an HTML text box show a hint when empty? I want the search box on my web page to display the word "Search" in gray italics. When the box receives focus, it should look just like an empty text box. If there is already text in it, it should display the text normally (black, non-italics). This will help me avoid clutter by removing the label.  BTW, this is an on-page  search, so it has no button. What was the meaning of the Night King's message? In S08E01 of Game of Thrones, we see this message:    We have seen this several times, the symbol drawn with horse heads, the stones around the Weirwood where White Walkers are created and in some caves, drawn by Children of the Forest.  Do we know the meaning behind this symbol? Does it or something similar occur in the books as well? My exterior door deadbolt has gotten stuck - it'll open with the lever but not the key. By spraying WD-40 inside the lock, I've been able to get it to work but it's very stiff. I'd like to remove the lock and inspect the inside, either to clean/lube it or replace it. But I can't figure out how to remove the lock; there's no obvious way to do this. (I'm used to seeing two screws on the inside of the deadbolt, usually under the lever arms when it's horizontal.)    How do I remove this? I can loosen the cover plate on the inside but it doesn't do anything other than rotate a few degrees. Neatest proof that set of finite subsets is countable? I am looking for a beautiful way of showing the following basic result in elementary set theory:     If $A$ is a countable set then the set of finite subsets of $A$ is   countable.   I proved it as follows but my proof is somewhat fugly so I was wondering if there is a neat way of showing it:  Let $|A| \le \aleph_0$. If $A$ is finite then $P(A)$ is finite and hence countable. If $|A| = \aleph_0$ then there is a bijection $A \to \omega$ so that we may assume that we are talking about finite subsets of $\omega$ from now on. Define a map $\varphi: [A]^{&lt;\aleph_0} \to (0,1) \cap \mathbb Q$ as $B \mapsto \sum_{n \in \omega} \frac{\chi_B (n)}{2^n}$. Then $\varphi$ is injective hence the claim follows. (The proof of which is what is the core-fugly part of the proof and I omit it.). Number of vertices present in all maximum matchings Given a graph $G$, we need to find the cardinality of the largest set of vertices so that each of them are present in every maximum matching possible.   Is there a solution beside the obvious remove each vertex and find the maximum matching to see it reduces? Let $H$ be a subgroup of $G$ with $[G:H]=n$ and $G$ finite.  Let $G$ act on left cosets of $H$ by left multiplication.  Let $N$ be the kernel of the action.  Show that $[G:N]$ divides $n!$.  Ok so I have a theorem that says that if $G$ is simple then it embeds into $S_n$.  So if $G$ is simple than I'm done because $G$ divides $n!$ and thus $N$ divides $n!$ and hence $[G:N]$ divides $n!$.  Now I also know that $N$ is the largest normal subgroup of $G$ contained in $H$.  Thus if $G$ isn't simple then it contains some non-trivial normal subgroup $K$ and thus $K\cap H$ is normal in $H$ and by the 2nd Iso Theorem $H/K\cap H\cong KH/H$...    As you can see I'm not sure where to go from here. I was hoping to prove that $K\cap H$ wasn't trivial and thus that $N$ couldn't be trivial since it must contain $K\cap H$, but I'm not sure I can, and even if I could I'm not sure that would help me in showing that $[G:N]$ is small enough to divide $n!$.  Can anyone give some guidance?  Thanks. Is spacetime flat inside a spherical shell? In a perfectly symmetrical spherical hollow shell, there is a null net gravitational force according to Newton, since in his theory the force is exactly inversely proportional to the square of the distance.  What is the result of general theory of relativity? Is the spacetime flat inside (given the fact that orbit of Mercury rotates I don't think so)? How is signal from the cavity redshifted to an observer at infinity? Should I activate the additional driver: Processor microcode firmware for Intel CPUs for intel-microcode I have recently noticed that there is an additional driver called Unknown: Unknown here which was not there before:    I have already read , and understand why it is there, but my question is, should I activate it? Will this make a difference? Or should I just leave it as it is as it sounds rather useful?    OS Information:  Description:    Ubuntu 15.04 Release:    15.04