Some time ago, we had a problem with -type questions on Earth Science Stack Exchange. After some users , we closed and deleted 500 questions with some effort and we made them off-topic. We stopped coming up as the first entry for searches for &quot;help identify my rock&quot; on Google, and the flood of questions ended. However, we still receive some questions. We close them, but I realized that +2k users were not deleting them, so I made . I asked for help from a mod but they don't want to delete them unilaterally. My question is if we are at risk of appearing again at the top of Google searches if we don't delete them, because I am a bit tired of asking users to delete the questions. Apparently the problem is that delete votes don't put posts into a review queue and we don't have many +2k users using meta frequently. Does Google index closed questions? Should I continue battling for the deletion of these unwanted questions for this reason?
I was just wondering about that because it would influence how I deal with closed questions, e.g. whether they need to be improved (tagging, formatting, code samples) after closing, or if some should be deleted altogether.  However, I'm not asking for answers to these questions, I just want to know if Google (and/or other search engines) list closed questions in their search results. (I hope they don't.)
mathtools: \dddot cause the term to rise How to tell the probability of failure if there were no failures? I was wondering if there is a way to tell the probability of something failing (a product) if we have 100,000 products in the field for 1 year and with no failures? What is the probability that one of the next 10,000 products sold fail? Can you have multiple Dropbox accounts on one computer? How do I reset a lost password (using recovery mode requires me to type the password)? Server socket program not executing after connection establishment Dual Channel RAM vs. Quad Channel RAM I just bought a motherboard that says it supports Dual-Channel RAM. The RAM I'm looking at says it's a "Quad-Channel Kit" . Will it work with my motherboard?  EDIT: Thanks all for the replies. Here is some more info:    Here is the RAM I'm looking at:    It all looks compatible to me, I just was curious about the four channel thing. Given a 4-vector $p^\mu$ the Lorentz group acts on it in the vector representation: $$ \tag{1} p^\mu \longrightarrow (J_V[\Lambda])^\mu_{\,\,\nu} p^\nu\equiv \Lambda^\mu_{\,\,\nu} p^\nu. $$ However, I can always represent a 4-vector $p^\mu$ using left and right handed spinor indices, writing $$ \tag{2} p_{\alpha \dot{\alpha}} \equiv \sigma^\mu_{\alpha \dot{\alpha}} p_\mu.$$ So the question is: in what representation does the Lorentz group act on $p_{\alpha \dot{\alpha}}$?    There are a lot of questions about this and related topics around physics.se, with a lot of excellent answers, so let me clear up more specifically what I am asking for.  I already know that the answer to this question is that the transformation law is  $$ \tag{3} p_{\alpha \dot{\alpha}} \rightarrow (A p A^\dagger)_{\alpha\dot{\alpha}}$$ with $A \in SL(2,\mathbb{C})$ (how is mentioned for example in ). I also understand that $$ \tag{4} \mathfrak{so}(1,3) \cong \mathfrak{sl}(2,\mathbb{C}),$$ (which is explained for example  by Edward Hughes,  by joshphysics,  by Qmechanic).  So what is missing? Not much really. Two things:   How do I obtain (3) and what is the specific form of $A$, i.e. its relation with the vector representation $\Lambda^\mu_{\,\,\nu}$? Defining the following $$ (\tilde p) \equiv p^\mu, \qquad \Lambda \equiv \Lambda^\mu_{\,\,\nu},$$ $$ \sigma \equiv  \sigma_{\alpha \dot \alpha}, \qquad \hat p \equiv p_{\alpha \dot \alpha},$$ we can rewrite (1) and (2) in matrix form as $$ \tag{5} \hat p \equiv \sigma \tilde p \rightarrow \sigma \Lambda \tilde p  = ( \sigma \Lambda \sigma^{-1}) \hat p,$$ however, this disagrees with (3) which I know to be right, so what is wrong with my reasoning? Why does the transformation law (3) has a form $$\tag{6} A \rightarrow U^{-1} A U,$$ while the usual vector transformation (1) has a form $V \rightarrow \Lambda V$? I suspect this comes from a similar reason to that explained  by Prahar, but I would appreciate a confirmation about this. This particular version of the "doesn't work after suspend" came after upgrading to 16.04. It seems that the upgrade includes a Wicd applet (added to Metacity Classic Gnome task bar alongside regular network icon), but doesn't seem to work after a suspend. A sudo service network-manager restart duplicates this problem. It takes a complete reboot to get Wifi going again. Any ideas why? When proving $\bar x$ and $S^2$ are independent in my noted it says that "functions of independent quantities are independent ". Can someone tell me how functions of independent quantities are independent happen?  Also let $X_1,X_2,X_3,\dots,X_n$ be a random sample.And suppose we want to estimate parameter $\theta$ using $T(x)$ as an estimator. In this I have a expression as $E\{ [  T(X)-E(T(X))][E(T(x)-\theta)]\}$.  I want to know if I can say that in $[T(X)-E(T(X))]$ since $E(T(X)$ (expected value is a one particular fixed value) and $T(X)$ are independent of one another. Also the expression $[E(T(x)-\theta)]$ is independent of $X$.  Hence the two expressions $[T(X)-E(T(X))]$ and $[E(T(x)-\theta)]$  are independent of one another. So that I can use if $a,b$ are independent $E(ab)=E(a)E(b)$ form Proving that the set of $\nu$ measurable sets $M\subseteq P(X)$ is an algebra I have two questions for you guys. I really appreciate your help.  1.- Is there a way to rename an Availability Group?  2.- Is there a way to get the T-SQL statements in order to re create a Availability Group in case that I need to drop it and create it again?  If there's information that you want me to share, please let me know and I will provide it. Rendering of Favorite/Ignored Tags in Firefox I'm currently passing the pid on the command line to the child, but is there a way to do this in the Win32 API?  Alternatively, can someone alleviate my fear that the pid I'm passing might belong to another process after some time if the parent has died? Why does the standard error of the intercept increase the further $\bar x$ is from 0? The standard error of the intercept term ($\hat{\beta}_0$) in $y=\beta_1x+\beta_0+\varepsilon$ is given by $$SE(\hat{\beta}_0)^2 = \sigma^2\left[\frac{1}{n}+\frac{\bar{x}^2}{\sum_{i=1}^n(x_i-\bar{x})^2}\right]$$ where $\bar{x}$ is the mean of the $x_i$'s.  From what I understand, the SE quantifies your uncertainty- for instance, in 95% of the samples, the interval $[\hat{\beta}_0-2SE,\hat{\beta}_0+2SE]$ will contain the true $\beta_0$. I fail to understand how the SE, a measure of uncertainty, increases with $\bar{x}$. If I simply shift my data, so that $\bar{x}=0$, my uncertainty goes down? That seems unreasonable.  An analogous interpretation is - in the uncentered version of my data, $\hat{\beta}_0$ corresponds to my prediction at $x=0$, while in the centered data, $\hat{\beta}_0$ corresponds to my prediction at $x=\bar{x}$. So does this then mean that my uncertainty about my prediction at $x=0$ is greater than my uncertainty about my prediction at $x=\bar{x}$? That seems unreasonable too, the error $\epsilon$ has the same variance for all values of $x$, so my uncertainty in my predicted values should be the same for all $x$.  There are gaps in my understanding I'm sure. Could somebody help me understand what's going on? Expected prediction error - derivation Methods to work around the problem of missing data in machine learning Virtually any database we want to make predictions using machine learning algorithms will find missing values ​​for some of the characteristics.  There are several approaches to address this problem, to exclude lines that have missing values ​​until they fill with the mean values ​​of the characteristics.  I would like to use for a somewhat more robust approach, which would basically run a regression (or another method) where the dependent variable (Y) would be each of the columns that have missing values ​​but only with the rows of the table that contain all the data , and predict the missing values ​​with this method, complete the table by the table and move to the next 'column' with missing values ​​and repeat the method until everything is filled.  But that gives me some doubts.  Why any column start? I believe that the one with the smallest missing values ​​until the one with the most  Is there any threshold of missing values ​​that is not worth trying to complete it? (for example, if this characteristic only has 10% of the values ​​filled would not it be more interesting to exclude it)  Is there any kind of implementation in traditional packages or other methods that are robust to missings? What Is the Real Name of the #? I used to say "sharp sign" to refer to the # sign.   Today a friend told me that the correct term is number sign or hash sign or even just hash.  What is the difference between these options and what's the correct usage of the names for this sign? I read this at least 20 years ago, and I believe it was originally published in the '60s.   The main character is a human, but somehow "inherits godhood" from an alien, whose species is very long lived. IIRC this is one of the old-style god thingies, i.e. "god of thunder" not "omniscient omnipotent omnipresent transcendent being".  The plot somehow revolved around identifying and fighting some enemy which, I believe, was in turn a member of the alien species who acted as the avatar of the opposite god in the alien pantheon.  The only thing I remember for sure is that the enemy was identified as "green green" or "gringrin" (sadly, I read this in translation so I am not sure what the original meant) I would like to think that some of the software I'm writing today will be used in 30 years. But I am also aware that a lot of it is based upon the UNIX tradition of exposing time as the number of seconds since 1970.  #include &lt;stdio.h&gt; #include &lt;time.h&gt; #include &lt;limits.h&gt;  void print(time_t rt) {     struct tm * t = gmtime(&amp;rt);     puts(asctime(t)); }  int main() {     print(0);     print(time(0));     print(LONG_MAX);     print(LONG_MAX+1); }   Execution results in:   Thu Jan  1 00:00:00 1970 Sat Aug 30 18:37:08 2008 Tue Jan 19 03:14:07 2038 Fri Dec 13 20:45:52 1901           The functions ctime(), gmtime(), and localtime() all take as an argument a time value representing the time in seconds since the Epoch (00:00:00 UTC, January 1, 1970; see time(3) ).      I wonder if there is anything proactive to do in this area as a programmer, or are we to trust that all software systems (aka Operating Systems) will some how be magically upgraded in the future?  Update It would seem that indeed 64-bit systems are safe from this:  import java.util.*;  class TimeTest {     public static void main(String[] args) {         print(0);         print(System.currentTimeMillis());         print(Long.MAX_VALUE);         print(Long.MAX_VALUE + 1);     }      static void print(long l) {         System.out.println(new Date(l));     } }    Wed Dec 31 16:00:00 PST 1969 Sat Aug 30 12:02:40 PDT 2008 Sat Aug 16 23:12:55 PST 292278994 Sun Dec 02 08:47:04 PST 292269055   But what about the year 292278994? So I currently have this issue where my Epson WF-3620DWF can't find the blue and yellow cartridges. (They are official epson ones) and I have a full black cartridge in there. How do I force my printer to ONLY print in black and ignore the cartridge(s) not recognised error?