's my original post on Meta Italian.SE, which I'm now transposing here since I'm now positive that this is happening network-wide.  I've noticed that edits of other users performed on my own posts are not notified on some sites across the network (they are notified e.g. on Ask Ubuntu but they're not notified e.g. on Italian.SE and on Meta.SE), despite this happening on other sites across the network.  The last time this happened was just a few minutes ago:    As you can see the latest notification hails from 29 minutes before the screenshot was taken, and there's no notification of the more recent edit whatsoever.
Normally, when a user edits one of my posts, I receive a notification like on the following depending on the case   User has editing privilege (click to visit revision)   Users' edit is submitted to review queue (click to visit review queue)     The above notifications were received instantaneously (or less than 30 minutes, in case caching is supposed to be the answer) as the edit was done/suggested.  But I did not receive any such notification today (yet) on an edit made on my . I think it is a possible bug and should be looked at. The recent notifications list I have is shown below:
Is there i.i.d. assumption on logistic regression? Is there i.i.d. assumption on the response variable of logistic regression?  For example, suppose we have $1000$ data points. It seems the response $Y_i$ is coming from a Bernoulli distribution with $p_i=\text{logit}^{-1}(\beta_0+\beta_1 x_i)$. Therefore, we should have $1000$ Bernoulli distributions, with different parameter $p$.  So, they are "independent", but are not "identical".  Am I right?    PS. I learned logistic regression from "machine learning" literature, where we optimize the objective function and check if it is good in testing data, without talking too much about assumptions.   My question started with this post  Where I try to learn more on statistical assumptions. Escape velocity from long ladder Math.cos() gives wrong result I'm interested: What is C#'s analog of std::pair in C++? I found System.Web.UI.Pair class, but I'd prefer something template-based.  Thank you! Automatically updating column in feature class when another column is changed? I have a feature class in a file geodatabase and it contains a field called [curing] in short integer type and another field called [IsPopulated] in short integer as well.  What I want to achieve is to make [IsPopulated] automatically populated with "0" or "1" depending on whether the [curing] column is filled with a numeric value.  "Field Calculator" does not help as it's just a one-off operation and NOT automatic. Proving that if $A^n = 0$, then $I - A$ is invertible and $(I - A)^{-1} = I + A + \cdots + A^{n-1}$ How to prove that $p-1$ is squarefree infinitely often, where $p$ is prime?  I had thought of using Dirichlet's theorem on arithmetic progressions.  The number of squareful values of $p-1$ less than or equal to $n$ is bounded by $\sum_{q}{\pi_{q^2,1}(n)}$, each term $\pi_{q^2,1}(n) \approx \frac{\pi(n)}{q \cdot (q-1)}$, and $\sum_{q}{\frac{1}{q \cdot (q-1)}} \lt 1$.  But using for example , the possibility is open that the error in each approximation for $\pi_{q^2,1}(n)$ may continue to increase with $q$, and since the sum runs up to $\sqrt{n}$, this argument is invalid.  Is there a more refined version of Dirichlet's theorem that can be used to circumvent this issue?  Or an entirely different way to prove this statement? Pullback of a Volume Form Under a Diffeomorphism. I have an exercise here, which I have no idea how to do.     Problem: Let $ U $ and $ V $ be open sets in $ \mathbb{R}^{n} $ and $ f: U \to V $ an orientation-preserving diffeomorphism. Then show that   $$   {f^{*}}(\text{vol}_{V}) = \sqrt{\det \! \left( \left[   \left\langle {\partial_{i} f}(\bullet),{\partial_{j} f}(\bullet) \right\rangle   \right]_{i,j = 1}^{n} \right)} \cdot   \text{vol}_{U}. $$   Notation:         $ \text{vol}_{U} $ and $ \text{vol}_{V} $ denote the volume forms on $ U $ and $ V $ respectively.   $ f^{*}: {\Lambda^{n}}(T^{*} V) \to {\Lambda^{n}}(T^{*} U) $ denotes the pullback operation on differential $ n $-forms corresponding to $ f $. I am trying to determine what issues could be caused by using the following serialization surrogate to enable serialization of anonymous functions/delegate/lambdas.   // see http://msdn.microsoft.com/msdnmag/issues/02/09/net/#S3 class NonSerializableSurrogate : ISerializationSurrogate {     public void GetObjectData(object obj, SerializationInfo info, StreamingContext context)     {         foreach (FieldInfo f in obj.GetType().GetFields(BindingFlags.Instance | BindingFlags.Public | BindingFlags.NonPublic))             info.AddValue(f.Name, f.GetValue(obj));     }      public object SetObjectData(object obj, SerializationInfo info, StreamingContext context,                                 ISurrogateSelector selector)     {         foreach (FieldInfo f in obj.GetType().GetFields(BindingFlags.Instance | BindingFlags.Public | BindingFlags.NonPublic))             f.SetValue(obj, info.GetValue(f.Name, f.FieldType));         return obj;     } }     Listing 1 adapted from   The main issue I can think of that might be a problem is that the anonymous class is an internal compiler detail and it's structure is not guaranteed to remain constant between revisions to the .NET Framework. I'm fairly certain this is the case based on my research into the similar problem with iterators.  Background  I am investigating the serialization of anonymous functions. I was expecting this not to work, but found it did for some cases. As long as the lambda did *not&amp; force the compiler to generate an anonymous class everything works fine.   A SerializationException is thrown if the compiler requires a generated class to implement the anonymous function. This is because the compiler generated class is not marked as serializable.  Example  namespace Example {     [Serializable]     class Other     {         public int Value;     }      [Serializable]     class Program     {         static void Main(string[] args)         {             MemoryStream m = new MemoryStream();             BinaryFormatter f = new BinaryFormatter();              // Example 1             Func&lt;int&gt; succeeds = () =&gt; 5;             f.Serialize(m, succeeds);              // Example 2             Other o = new Other();             Func&lt;int&gt; fails = () =&gt; o.Value;             f.Serialize(m, fails); // throws SerializationException - Type 'Example.Program+&lt;&gt;c__DisplayClass3' in Assembly 'Example, Version=1.0.0.0, Culture=neutral, PublicKeyToken=null' is not marked as serializable.         }     }   Listing 2  This is similar to the issue of trying to serialize iterators and I had found the following code in a previous search (see ) Using the code from Listing 1 and an ISurrogateSelector I was able to successfully serialize and deserialize the second failing example.  Objective  I have a system that is exposed via a web service. The system has a complex but small state (many objects, not a lot of properties per object). The state is saved in the ASP.NET Cache, but is also serialized to a BLOB in SQL in case of cache expiration. Some objects need to execute arbitrary "events" upon reaching some condition. Hence they have properties accepting Action/Func objects. Contrived example:      class Command     {         public Command(Action action, Func&lt;bool&gt; condition);     }   Somewhere else      void DoSomethingWithThing(Thing thing)     {         state = Store.GetCurrentState();          Command cmd = new Command(() =&gt; thing.Foo(), () =&gt; thing.IsReady())         state.Add(cmd);          Store.Save(state);     } Windows 7 task bar at autohide, make it totally disapear? My desktop look is empty so all I have is a nice wallpaper. My Windows taskbar has the "Taskbar Appearance" setting to "Auto-hide the taskbar". Although hidden, it leaves a thin top layer so you can still see it a bit, and where the pinned shortcuts are. Is it possible to totally have it hidden without a trace? This is a serious question. It really bugs m. A Polygon is inscribed in a circle $\Gamma$ A regular polygon P is inscribed in a circle $\Gamma$. Let A, B, and C, be three consecutive vertices on the polygon P, and let M be a point on the arc AC of $\Gamma$ that does not contain B. Prove that  $MA\cdot MC=MB^2-AB^2$  I inscribed the polygon P in the unit circle and let B=1. Past this, I'm not really sure how to proceed. It might be helpful to have M at 1 as well but given that the polygon would have the n-th roots of unity in it B seemed like a good choice. What would be a good way to proceed from here? Testing for linear dependence among the columns of a matrix I have a correlation matrix of security returns whose determinant is zero. (This is a bit surprising since the sample correlation matrix and the corresponding covariance matrix should theoretically be positive definite.)  My hypothesis is that at least one security is linearly dependent on other securities. Is there a function in R that sequentially tests each column a matrix for linear dependence?  For example, one approach would be to build up a correlation matrix one security at a time and calculate the determinant at each step. When the determinant = 0 then stop as you have identified the security who is a linear combination of other securities.  Any other techniques to identify linear dependence in such a matrix are appreciated. Show the post's comments on the "Suggested Edits" review interface Having recently reviewed a few suggested edits, I've found that not being able to see the comments on the post is hindering my understanding of the context of some edits.  In particular, there have been a few posts where someone has made a substantial edit to a question or answer which significantly alters its meaning. Typically I'd reject that as "too radical", since it can't be known that the new meaning of the post was what the original author intended.  However, in some cases it is clear from the comments that the original author is aware of the intended change, and as such the editor is not in fact misrepresenting the author's intentions. In these cases, it would have been useful to see the comments when making the review decision.  As an example, a common cause of this is when an inexperienced user is asked to clarify their question, and ends up writing a comment that would be better off as an edit to the question (due to length, excess code content, etc), presumably due to lack of awareness that the question can be edited. Often, other users will helpfully edit the question to include the information the OP put in the comment (see ,  and  for examples). In this situation, it is clear that the edit reflects the OP's intentions, but this information is only present in the comments which are not visible in the review interface.  Following is the suggested edit screen showing the suggested edit. It seems indentation is increased and one line is moved a few lines upwards and some empty lines added to increase readability. But it look like an invalid edit since changing the related line may cause alteration on the runtime. So not looks lie a valid edit. Better open the answer and examine it        Checking the Q&amp;A itself reveals that a talk had taken place between the OP and the answerer and revision done by the OP with the permission of the answerer. So it was indeed a valid edit.        In short: is there any particular reason comments are not displayed in the suggested edit review interface? I think it would add useful contextual information when making review decisions, and presumably this would be trivial to implement.  Note: this is not a dupe of , as it does not concern comments posted after the suggested edit. How to create an Atlas based on point attributes? Essentially I am wanting to produce an atlas based on a categorical field in a point layer.   i.e. I have a point layer of childcare providers with the categorical field "Provision". I've categorized each feature in this field with "After School Club" , "Breakfast Club" etc, and I now want to produce a set of maps that iterate through each category and show only the points for each. One map of after school clubs, one map of breakfast clubs etc. The extents might be subtly different.  I could do it one by one but it seems like there should be a way to produce an atlas based on the extents of each category? (I do feel i'm missing something obvious :) )   Or alternatively is there a way of automating the creation of a polygon layer and using that as a hidden coverage for the atlas?  EDIT: I've made a little progress with this  - you can use rule based styling to switch on and off features relevant to the current atlas coverage feature.  it actually works fine if all you want to do is show a different set of points. I'm now looking at tying that back to a color scheme and reactive legend. Does Google Chrome has anything similar to about:blank page in IE and Firefox? I did not find any suitable page mentioning this? PS: I tried about:blank but it looked like Chrome is trying to load something before showing blank page... (I was requested to edit the question to explain why it is different that a proposed duplicate question. This seems counterproductive to do here, inside the question it self, but that is what I have been asked by the site and moderators. There is no way for me to vote against their votes. So, here I go: Please stop voting this as a duplicate so quickly, which will eventually lead to this question being closed off. Yes, the other question linked to asks the same math, but any newcomer to the problem who was exposed to it via physics, as I was, will prefer this question instead of the one that is purely mathematically. I beg the moderators to not be pedantic on this one. This question spills into physics, which is why I did the cross post to the physics forum as well.)  How does the sum of the series “1 + 2 + 3 + 4 + 5 + 6…” to infinity = “-1/12”, in the context of physics?  I heard Lawrence Krauss say this once during a debate with Hamza Tzortzis (). I found a transcript of another debate between Krauss and William Lane Craig which has the same sum. Here is the paragraph in full:     Let’s go to some of the things Dr. Craig talked about. In fact, the   existence of infinity, which he talked about which is   self-contradictory, is not self-contradictory at all. Mathematicians   know precisely how to deal with infinity; so do physicists. We rely on   infinities. In fact, there’s a field of mathematics called “Complex   Variables” which is the basis of much of modern physics, from   electro-magnetism to quantum mechanics and beyond, where in fact we   learn to deal with infinity; without the infinities we couldn’t do the   physics. We know how to sum infinite series because we can do complex   analysis. Mathematicians have taught us how. It’s strange and very   unappetizing, and in fact you can sum things that look ridiculous. For   example, if you sum the series, “1 + 2 + 3 + 4 + 5 + 6…” to infinity,   what’s the answer? “-1/12.” You don’t like it? Too bad! The   mathematics is consistent if we assign that. The world is the way it   is whether we like it or not.   -- Lawrence Krauss, debating William Lane Craig, March 30, 2011  Source:   CROSS POST: I'm not sure if I should post this in mathematics or physics, so I posted it in both. Cross post:   EDIT: I did not mean to begin a debate on why Krauss said this. I only wished to understand this interesting math. He was likely trying to showcase Craig's lack of understanding of mathematics or logic or physics or something. Whatever his purpose can be determined from the context of the full script that I linked to above. Anyone who is interested, please do. Please do not judge him out of context. Since I have watched one of these debates, I understand the context and do not hold the lack of a full breakdown as being ignorant. Keep in mind the debate I heard this in was different from the debate above. A (highfalutin) word for a highfalutin word? To illustrate the question, badroit used the word "meretricious" meretriciously.   Is there an English word that describes highfalutin words like "meretricious" that are (gratuitously) used in place of better-understood words like "garish"?  The word may or may not be self-describing. Toy Line (Production) Run I am not sure about the meaning of this:          Transformers: Generation 1 (also known as Generation One or G1) was a children's toy line that ran from 1984 to 1991 and was produced by Hasbro.     Would the following rewrite be better?        Transformers: Generation 1 (also known as Generation One or G1) was a children's toy line the production of which ran from 1984 to 1991 and was produced by Hasbro. biblatex broken overnight As late as last week my setup for biblatex worked fine. Going back to the same project today not even a minimal file compiles:  \documentclass{article}   \usepackage{biblatex} %\addbibresource{biblatex-examples.bib}   \begin{document}  test%foo\nocite{*}    %\printbibliography  \end{document}   but breaks off with   /usr/local/texlive/2017/texmf-dist/tex/latex/biblatex/biblatex.sty:3776: LaTeX  Error: Missing \begin{document}.  See the LaTeX manual or LaTeX Companion for explanation. Type  H &lt;return&gt;  for immediate help.  ...                                                l.3776   australian,newzealand} ?  /usr/local/texlive/2017/texmf-dist/tex/latex/biblatex/biblatex.sty:3776: Math f ormula deleted: Insufficient symbol fonts. \expandafter -&gt;american|  l.3776   australian,newzealand}   And keeps repeating the last one until    (That makes 100 errors; please try again.)   when I ignore it.  Files without biblatex work as expected.  Using tlmgr to go my two backup versions of biblatex back in time to 1st Jan I still get the same errors.  Could this be another update from the last week or so that causes this?  If I swich back to TL 16 things work as expected. (For my work I need TL 17 because of packages.) One of our SQL Server 2014 database transaction logs is growing very fast and I cannot find the root cause for this.  Database in Simple recovery mode. During full backup the log file grows to its limits (800GB) and backup fails.  I checked the transactions during the backup and did not find anything strange.  All transactions are our regular loading and no maintenance jobs (index rebuilds etc.)  I am aware of that backup keep the log from reuse but this mean 800GB changes during the backup period and this does not make any sense.  I had compared this DB to similar DB size, loading and backup duration. The second DB Log is not growing more than 400GB.  DB size is 7TB. Backup time is ~20H. The only time log is growing is during backup. Log_reuse shows correct Backup_Restore. No long running transactions.  The problem is the "speed" of log growth - compared to similar sites with same load and same backup duration, the log is 4 time less.