Requested Feature  I'd like to get a notification when a question that I've voted to close (but isn't closed yet) is edited, so I can review the changed question and retract my close vote if appropriate.  Workings and Rationale  Questions can be voted to be closed for a number of (custom) reasons. Those reasons are requests to the OP to adjust their question — to make them less broad, to make them on topic, to provide a test case, and so on. The OP (or another user) may edit the question to address the issue, but the close votes remain. If another user casts the final vote, the question is closed, even though the original issue was resolved.  To prevent that, the close voters should be notified that the question was edited, so that they can review the edited question and adjust their vote accordingly.  This is for a question in the process of being closed only.  Related Feature Requests   Not a duplicate, since my request is about questions in the process of being closed, while that request is about questions that are already closed. That could notify users years after they've closed the question. That seems unnecessary and we have the regular re-open process to deal with it anyway.   Same request as mine, but (incorrectly, IMHO) closed as a duplicate of the former.
When a user votes to close a question (for whatever reason), it would helpful to receive a notification (in the inbox) when the question is edited (either the text, tags, if it closes then is re-opened) so that the user can then modify his or her vote if the question is properly adjusted.
How much to store luggage at SFO for 24 hours? How do I make my rim brakes stop squealing? My rear rim brakes are squeaking loudly. I don't know what the problem is, but I am sure it has nothing to do with rain because it happens all the time even if it is dry.  Anybody have an idea what could be problem and how to solve it? It makes the rear brakes kind of useless, because if I use them I will scare the people or drivers around me. SEO for importing the page header with JavaScript rather than PHP My website has the same header/sidebar/footer on every page, so I have been importing them using PHP. To do this I forced all html files to be processed through the apache servers PHP handler via htaccess. I have come to understand that is not necessarily the best thing to do and so found out how to do everything I need using simple JavaScript. I also store a variable in the initial page that then gets used in the imported html.  Questions: By switching from:  &lt;?php include "_header.html";?&gt;   to  &lt;script type="text/javascript" src="_header.js"&gt;&lt;/script&gt;   I am noticing that the "view source" shows the header.js link, whereas the PHP method will show the source as if the html had been there all along. Will search engines recognize the html in the JavaScript just as they would when loaded with PHP?  I understand it is bad practice to alter the page contents -after- it is downloaded, but this doesn't fall into that category does it? That would detail things like after a wait function, or after user interaction, correct?  Are there any other foreseeable downfalls to switching to JavaScript and turning off the forced PHP processing? rent a car, rent out a car, hire a car I am trying to perform stepwise regression for variable selection in R.  In matlab, the stepwisefit function is able to work in n &lt; p problems. Trying to use step() for such problems i get the error message AIC is -infinity for this model, so 'step' cannot proceed. Is there a way to modify parameters so i can use step function? Why will Ubuntu no longer measure file size unit as byte, megabyte, gigabyte, etc? I read on  that Ubuntu will no longer use the familiar file size units we all know by now (kB, MB, GB, TB) and switch to a different IEC standard (KiB, MiB, GiB, TiB). If this is true, I would like to know what's the reasoning behind this change, and the impact (if any) this change has, especially with multiplatform applications or applications run with Wine. Pair-wise iteration in C# or sliding window enumerator If I have an IEnumerable like:  string[] items = new string[] { "a", "b", "c", "d" };   I would like to loop thru all the pairs of consecutive items (sliding window of size 2). Which would be   ("a","b"), ("b", "c"), ("c", "d")   My solution was is this       public static IEnumerable&lt;Pair&lt;T, T&gt;&gt; Pairs(IEnumerable&lt;T&gt; enumerable) {         IEnumerator&lt;T&gt; e = enumerable.GetEnumerator(); e.MoveNext();         T current = e.Current;         while ( e.MoveNext() ) {             T next = e.Current;             yield return new Pair&lt;T, T&gt;(current, next);             current = next;         }     }   // used like this :  foreach (Pair&lt;String,String&gt; pair in IterTools&lt;String&gt;.Pairs(items)) {     System.Out.PrintLine("{0}, {1}", pair.First, pair.Second)  }   When I wrote this code, I wondered if there are already functions in the .NET framework that do the same thing and do it not just for pairs but for any size tuples.  IMHO there should be a nice way to do this kind of sliding window operations.  I use C# 2.0 and I can imagine that with C# 3.0 (w/ LINQ) there are more (and nicer) ways to do this, but I'm primarily interested in C# 2.0 solutions. Though, I will also appreciate C# 3.0 solutions. Can I prepay a Credit Card to make a Large Purchase greater than my credit limit? I want to make a large purchase at a retail store to the sum of $10,000 but the credit limit on my card is set at $2000.  If I send $10K to my credit card will the purchase be allowed to go through?  Not sure if the credit limit is a hard limit or not?  I don't want to be left embarrassed if my card is declined in the store lol.  I called my bank but the answer they gave wasn't too convincing. It was kind of "Errr yes i think its OK!"  Does any one know first hand? How does chain fishing work? How to install brackets.io from the command line? For some reason the gnome installer that handles .deb packages on my system is not working. I'm not concerned.  How would one install the Brackets.io program from the terminal? What is the scope of variables in JavaScript? Regex (C#): Replace \n with \r\n How can I replace lone instances of \n with \r\n (LF alone with CRLF) using a regular expression in C#?  Sorry if it's a stupid question, I'm new to Regex.  I know to do it using plan String.Replace, like:  myStr.Replace("\n", "\r\n"); myStr.Replace("\r\r\n", "\r\n");   However, this is inelegant, and would destroy any "\r+\r\n" already in the text (although they are not likely to exist). Minecraft Failed To Bind Port I made a server and used my IPv4 address for the IP. I decided to scratch that server and make a Bukkit server so I can use plugins. I tried to use my IPv4 address which I used for my other server but I keep getting the message [17:31:15 WARN]: ****FAILED TO BIND TO PORT!  Is there any thing I can do to get a new address to use or is there a way to delete the old server? Do I need to use a different computer? Please help! I've don't know how to fix this problem. If you have any suggestions please tell me and I'll give it a try. Are continuous self-bijections of connected spaces homeomorphisms? I hope this doesn't turn out to be a silly question.  There are lots of nice examples of continuous bijections $X\to Y$ between topological spaces that are not homeomorphisms.  But in the examples I know, either $X$ and $Y$ are not homeomorphic to one another, or they are (homeomorphic) disconnected spaces.    My Question: Is there a connected topological space $X$ and a continuous bijection $X\to X$ that is not a homeomorphism?    For the record, my example of a continuous bijection $X\to X$ that is not a homeomorphism is the following.  Roughly, the idea is to find an ordered family of topologies $\tau_i$ ( $i\in \mathbb Z$) on a set $S$ and use the shift map to create a continuous bijection from $\coprod_{i\in \mathbb Z} (S, \tau_i)$ to itself.  Let $S = \mathbb{Z} \coprod \mathbb Z$.  The topology $\tau_i$ is as follows: if $i&lt;0$, then the left-hand copy of $\mathbb Z$ is topologized as the disjoint union of the discrete topology on $[-n, n]$ and the indiscrete topology on its complement, while the right-hand copy of $\mathbb Z$ is indiscrete.  The space $(S, \tau_0)$ is then indiscrete.  For $i&gt;0$, the left-hand copy of $\mathbb Z$ is indiscrete, while the right-hand copy is the disjoint union of the indiscrete topology on $[-n, n]$ with the discrete topology on its complement.  Now the map $\coprod_{i\in \mathbb Z} (S, \tau_i)\to \coprod_{i\in \mathbb Z} (S, \tau_i)$ sending $(S, \tau_i) \to (S, \tau_{i+1})$ by the identity map of $S$ is a continuous bijection, but not a homeomorphism. Prove that $\lim_{n\to\infty}a_n\le \lim_{n\to\infty}b_n$ Theorem  Let $\{a_n\}$ and $\{b_n\}$ be convergent real sequences. Assume that there exists a $N\in\mathbb{N}$ so  $a_n\le b_n$ (eq. 1)  for all $n\ge N$. Then  $\lim_{n\to\infty}a_n\le \lim_{n\to\infty}b_n$.  My attempt at proving  Let $a=\lim_{n\to\infty}a_n$ and $b=\lim_{n\to\infty}b_n$. $a$ and $b$ are real numbers because the limit of a sequence of real numbers is a real number (which is a corollary in my textbook). For proof by contradiction, assume  $b&lt;a$.  Let $\epsilon=\frac{a-b}{2}$. Then we can find $N_a,N_b\in\mathbb{N}$ so  $|a-a_n|\le\frac{\epsilon}{2}$ when $n\ge N_a$, (eq. 2)  $|b-b_n|\le\frac{\epsilon}{2}$ when $n\ge N_b$. (eq. 3)  In a textbook I found that I should do the following:  Choose a $n$ so $n\ge\max(N,N_a,N_b$), then eqs. (1-3) are satisfied. Then  $a-\epsilon\le a_n+\frac{\epsilon}{2}-\epsilon$  How do I get that last thing? Is it necessary to do a proof by contradiction or can one do a direct proof? What do \makeatletter and \makeatother do? Many LaTeX “hacks” begin with \makeatletter and end with \makeatother. What do these commands do? I have Ubuntu on my laptop. Now I want install Windows 7 in a dual-boot. How can I do this? I can't lose my Ubuntu files, and I'm afraid that I might break . Go  for UEFI only! Cards changing mana color What cards across all sets allow the utilization of mana, either colorless or otherwise, as colored mana of another color?  One early example with an unlimited  1:1 ratio:     Sunglasses of Urza   Continuous Artifact: White mana in your mana pool can also be used as red mana.   What other cards have similar abilities? What is the fastest way to get from Courmayeur/Aosta to Milan? We will be crossing the Italian/French border through Mont Blanc via cable cars, which we heard through Rick Steve's article: .  We will be starting off in Chamonix and arriving in Courmayeur. What's the fastest (and relatively cost-effective) way to get to Milan from Courmayeur? This is really two questions.   Is there a definition of the principal $n$th root of a complex number? I can't find it anywhere. Presumably, the usual definition is $[r\exp(i\theta)]^{1/n} = r^{1/n}\exp(i\theta/n)$ for $\theta \in [0,2\pi)$, but I have yet to see this anywhere. Is this because it has bad properties? For instance, according to this definition is it true that for all complex $z$ it holds that $(z^{1/a})^b = (z^b)^{1/a}$?