Moderators should be able to see deleted posts in the Activity tab on a user's profile As a moderator I can see deleted posts in a profile, but -- without visiting each one -- I can't see when they were deleted.  This came up because I came across a user with a small number of posts, all deleted, and I wanted to know if I was looking at a rage-quit.  If deletions caused entries in the "activity" tab on a profile this would be easy to check; instead I had to visit each post to see what was going on.  But even beyond suspected rage-quits, it seems like this would be a helpful addition to understanding a user's activity -- for example, in detecting a pattern of deleting questions as soon as an answer comes in.  Since deletions that produce reputation changes have to be tracked on the "reputation" tab, it seems like deletions already produce some per-user record-keeping.  Is it feasible to add information about self-deletions to the record of the user doing the deletion?
Allow moderators to see delete/undelete activity on users' profiles We get auto flags for 'possible vandalism' related to deletes, and these can be helpful at times in finding 'rage quit' users, or other potential problems.  But often, I would like to know if there is a prior pattern with the user doing this. While we can see posts of theirs which have been flagged, and perhaps find previous auto flags this way, it would be nice to see an overall view of their self-deletions and undeletions; mostly just to identify patterns.  Such a feature would be nice if it was activity centered, rather than post-centered. That is; each delete/undelete action should be shown. So we could easily see, for example, if someone went back-and-forth on a single post.  The "activity" tab in the profile would be a logical place to show these events.  I think this would be best to be limited to instant self-deletions, not deletion votes.
$$\sqrt{x + \sqrt{x + \sqrt{x + \cdots}}}= 5$$ How to make an alias permanent? I have created an alias:  alias shh='sqlplus hfdora/hfdora@hfd1"     After creating this alias I was able to enter my database only by typing shh.  But after closing my shell, I wasn't able to find the alias next time. Even after typing only alias, shh was not showing in the list.  Is there any file to make an alias permanent so that it will not be erased? It confuses/blows my mind that the Binomial has variance proportional to $p(1-p)$. Equivalently, the Fisher information is proportional to $\frac{1}{p(1-p)}$. What is the reason for this? Why is the Fisher Information minimized at $p=0.5$? That is, why is inference most difficult at $p=0.5$?  Context:  I'm working on a sample size calculator, and the formula for $N$, the sample size needed, is an increasing factor of $p(1-p)$, the result of a variance estimation in the derivation. So what I decided to do is to start a small case with only 3 people. There are three possible combinations that I could pair up the people, using the symbols A, B, and C to represent the persons involved: A&amp;B, A&amp;C, B&amp;C. The probability of each pair having the same birthday is $1\over365$ (the first guy gets any birthday, and the second guy only gets one birthday to choose from). What my intuition directed me to do next is to find the probability that any of the three events are true, or the union of the three events, which involved adding up the probabilities.   To put this generally, the equation for the probability SHOULD be:  ${n \choose 2} \div 365$  However, clearly this is not the case since $n \choose 2$ gets over 365 when $n = 28$. And with 28 people, there is obviously still a chance that they all have different birthdays (Person 1 has Jan. 1, Person 2 has Jan. 2. ... Person 28 has Jan. 28). Could anyone tell me what's wrong with my intuition? I don't want to know what's the right solution, I just want to know what's wrong with my solution .. it makes sense to my intuition, even though it's incorrect. Equidistant points across Bezier curves Money making in Runescape -Bash command not found appearing every time I start terminal every time I start my terminal, it always says "-bash:  .: command not found" twice.  Does anyone know how I can get rid of that? Where does "pay through the nose" originate? How to detect the Internet connection is offline in JavaScript? TeXnicCenter & Adobe Acrobat 10 Hide processes from other users based on groups (under Linux)? Is it possible to configure process hiding for certain user groups under a linux system?  For example: Users from group X should not see processes owned by users from group Y in ps/top or under /proc.  Is it possible to configure such a setup with SELinux?  (I vaguely remember a similar feature in the funny grsecurity patch set - but IIRC, it was more generic - and besides, I want to configure a stock linux distro without having to maintain a custom kernel.)  Edit: For better illustration, . The example is not that generic, but one can configure that a user or some users can only see information of their own processes in ps etc. Let $A\neq I$ be a $5\times5$ matrix with real entries such that the sum of the entries in each row of $A$ is $1$. Then the sum of all the entries in $A^3$ is  1)$\space 3$ $\qquad $2)$\space 15$ $\qquad$ 3)$\space 5$ $\qquad$ 4)$\space 125$  Solution:  The answer is $5$ if $A = I$, but for $A \neq I$,  I found that vectors $\begin{pmatrix} 1\\ 1\\ 1\\ 1\\ 1\\ \end{pmatrix}$ and  $\begin{pmatrix} -1\\ -1\\ -1\\ -1\\ -1\\ \end{pmatrix}$  are eigen vectors for the matrix $A$ corresponding to eigen value $1$. From here, I dont know how to proceed, please help me solve the question..and if there are mistakes in my argument, please tell me.. This discussion informed our process for seven years, but eventually required updates and augmentation. For discussion regarding the successors to this process, please see:    Stack Exchange has some of the best Moderators around — seriously — and that is due in no small part to the communities who scrutinize and vote in our Moderator elections.  We have a rather formal process for electing moderators, but up until now  has been quite informal. On those rare, rare occasion when things just aren't working out, you can see why it becomes such a sticky business to remove someone from a democratically elected position. Our current process is one of &quot;we've got your back.&quot; The Community Team routinely monitors moderator activities, so if a moderator violates the  or fails to uphold the , we can and do intervene. If the disputes and problems persist without resolution, eventually we can ask someone to step down. That's not good enough. We need a much more transparent and prescribed process for when — and more importantly how — to intervene when on-going problems are going unresolved. In urgent situations, we'll step in to protect a site, but ideally the process should be impartial and not subject to accusations of Stack Exchange simply applying undue influence over a community when the whim strikes. The Question: Before we start bouncing around ideas internally, I'd like to hear what you think. What process should be in place to add some checks and balances to deal with higher issues like possible impeachment of a moderator? When and how would such a process come into play? How should such situations be resolved? How do we keep it from being abused? Have at it. This is a round table vetting of ideas. I have been thinking a bit about Morita equivalence   and I would like to know whether it also applies to subrings such as right or left ideals.  And, if so, how specifically? Could you illustrate if with the example of 2x2 matrices with zero entries in the bottom row? Since Morita equivalence concerns non-commutative rings, I am assuming it should apply, but I am just guessing.  Thanks in advance. When I am in texture mode one of my objects looks like it is in solid mode. The model is textured like all other models in the scene, but it doesn't look like it is in texture mode.  Screenshot will explain better:      What this model looks like. What all models should look like in texture mode. Average distance between two random points in a square A square with side $a$ is given. What is the average distance between two uniformly-distributed random points inside the square?  For more general "rectangle" case, see . The proof found there is fairly complex, and I am looking for a simpler proof for this special case. I expect it could be significantly simpler.  See also . How to get back a declined Outlook invitation Do vulnerability and resistance cancel out? Converting date to specified format and two date comparisions Do computer viruses affect all user accounts on a computer? Do computer viruses affect all user accounts on a computer?  IF a virus affects a local user will that effect administrator account and vise-versa?