How can we improve the inconsistent tagging of the questions relating to the recent uproar and associated issues? Question description  There are many questions (~250 in the last five weeks) relating to      sometimes they are about licensing, legal issues, , , , etc.  These questions relate to the same growing polarization between community and Stack&nbsp;Exchange staff. But, it is not easy to search or filter them because the tags are not uniform for those questions, they do not have the same tags.  Could we group all these posts together by some common tag (new or not)? (in addition, maybe we should create less of these questions, they tend to become noise now, water down the core message, and it is ).    Relevance  Overview of current tags (aside from the discussion tag) for the first ten  (           ) questions relating to  (ordered by relevance)                              1   2   3   4   5   6   7   8   9   10     moderators              x           x   x   x     community               x           x   x     etiquette                   x     users                       x     company                     x     moderation                      x     code-of-conduct                     x       x       x     deleted-questions                               x     legal                                                   x   These tags are obviously not the same while it is arguably the same topic (it is even for the same, specific, search term) .  Instead of using multiple searches one might wish to control tracking these question by adding some single relevant tag to watched tags or ignore tags. But, this is difficult when they do not use the same tag. And in the case of ignoring one might ignore too much when the tag is not specific.  Another indicator that these posts need consistent tagging is the fact that there exist highly upvoted answers that function as an archive for these questions (see  and ). But it is only a hack/workaround for the absence of a common tag; they are not an optimal solution.    Why now?  In an older question () it was suggested to create a specific tag. That was rejected at that point. But, now we are several weeks, and many many questions, further. The situation is more escalated than what might have foreseen at that point. The overview becomes a mess and something needs to be done.  See the bump in the image below which indicates that something is 'going on' and it entails a large fraction of the current post. (obtained from )
Should we have a tag for significant points in time? There are many discussions about the current incidence. For example:          Should we have a whole tag for this incidence? In general, if in the future there are more crises and incidences like this, should they have their own tags too? I feel it's fine, as we have specific tags for individual events like . And, should we have a  tag?    Related:        Note that these questions are specifically about the conflict 2019, while this question is simply about creating meta tags for significant events.
apt-get update fails to fetch files, “Temporary failure resolving …” error Err http://archive.canonical.com natty InRelease     Err http://security.ubuntu.com oneiric-security InRelease                Err http://extras.ubuntu.com natty InRelease                             Err http://security.ubuntu.com oneiric-security Release.gpg   Temporary failure resolving ‘security.ubuntu.com’ Err http://archive.canonical.com natty Release.gpg   Temporary failure resolving ‘archive.canonical.com’ Err http://extras.ubuntu.com natty Release.gpg   Temporary failure resolving ‘extras.ubuntu.com’ Err http://gb.archive.ubuntu.com oneiric InRelease Err http://gb.archive.ubuntu.com oneiric-updates InRelease Err http://gb.archive.ubuntu.com natty-backports InRelease Err http://gb.archive.ubuntu.com oneiric Release.gpg   Temporary failure resolving ‘gb.archive.ubuntu.com’ Err http://gb.archive.ubuntu.com oneiric-updates Release.gpg   Temporary failure resolving ‘gb.archive.ubuntu.com’ Err http://gb.archive.ubuntu.com natty-backports Release.gpg   Temporary failure resolving ‘gb.archive.ubuntu.com’  Reading package lists... Done W: Failed to fetch http://gb.archive.ubuntu.com/ubuntu/dists/oneiric/InRelease       W: Failed to fetch http://gb.archive.ubuntu.com/ubuntu/dists/oneiric-updates/InRelease   W: Failed to fetch http://gb.archive.ubuntu.com/ubuntu/dists/natty-backports/InRelease   W: Failed to fetch http://security.ubuntu.com/ubuntu/dists/oneiric-security/InRelease   W: Failed to fetch http://archive.canonical.com/ubuntu/dists/natty/InRelease   W: Failed to fetch http://extras.ubuntu.com/ubuntu/dists/natty/InRelease   W: Failed to fetch http://archive.canonical.com/ubuntu/dists/natty/Release.gpg  Temporary failure resolving ‘archive.canonical.com’ W: Failed to fetch http://security.ubuntu.com/ubuntu/dists/oneiric-security/Release.gpg  Temporary failure resolving ‘security.ubuntu.com’ W: Failed to fetch http://extras.ubuntu.com/ubuntu/dists/natty/Release.gpg  Temporary failure resolving ‘extras.ubuntu.com’ W: Failed to fetch http://gb.archive.ubuntu.com/ubuntu/dists/oneiric/Release.gpg  Temporary failure resolving ‘gb.archive.ubuntu.com’ W: Failed to fetch http://gb.archive.ubuntu.com/ubuntu/dists/oneiric-updates/Release.gpg  Temporary failure resolving ‘gb.archive.ubuntu.com’ W: Failed to fetch http://gb.archive.ubuntu.com/ubuntu/dists/natty-backports/Release.gpg  Temporary failure resolving ‘gb.archive.ubuntu.com’ W: Some index files failed to download. They have been ignored, or old ones used instead.   This is what I'm seeing when I try to run sudo apt-get update. I did an update on my instance yesterday and am now experiencing this. Why is a geometric progression called so? Just curious about why geometric progression is called so. Is it related to geometry? Generating values from a multivariate Gaussian distribution I am currently trying to simulate values of a $N$-dimensional random variable $X$ that has a multivariate normal distribution with mean vector $\mu = (\mu_1,...,\mu_N)^T$ and covariance matrix $S$.  I am hoping to use a procedure similar to the inverse CDF method, meaning that I want to first generate a $N$-dimensional uniform random variable $U$ and then plug that into the inverse CDF of this distribution, so to generate value $X$.  I am having issues because the procedure is not well documented and there are slight differences between the  and a .  In my case, I am also choosing the parameters of the distribution randomly. In particular, I generate each of the means, $\mu_i$, from a uniform distribution $U(20,40)$. I then build the covariance matrix $S$ using the following procedure:   Create a lower triangular matrix $L$ where $L(i,i) = 1$ for $i=1..N$ and $L(i,j)  = U(-1,1)$ for  $i &lt; j$ Let $S = LL^T$ where $L^T$ denotes the transpose of $L$.   This procedure allows me to ensure that $S$ is symmetric and positive definite. It also provides a lower triangular matrix $L$ so that $S = LL^T$, which I believe is required to generate values from the distribution.  Using the guidelines on Wikipedia, I should be able to generate values of $X$ using a $N$-dimensional uniform as follows:   $X = \mu + L * \Phi^{-1}(U)$   According to the MATLAB function however, this is typically done as:   $X = \mu + L^T * \Phi^{-1}(U)$   Where $\Phi^{-1}$ is the inverse CDF of a $N$-dimensional, separable, normal distribution, and the only difference between both methods is simply whether to use $L$ or $L^T$.  Is MATLAB or Wikipedia the way to go? Or are both wrong? Add Item to Finder Sidebar Getting text from the Resource file in asp.net 4 Proving $\lim_{x\to 1} x^3=1$ with $\epsilon$-$\delta$ definition Problem: I need to formally prove that $$\lim_{x\to 1} x^3 = 1.$$ My work: This is what I have so far and I'm generally a bit stuck with these proofs from here onwards. Because$$-\epsilon &lt; x^3-1 &lt; \epsilon  =  | x^3-1 | &lt; \epsilon,$$ then $$ -\epsilon &lt; x^3-1 &lt; \epsilon$$ $$-\epsilon+1 &lt; x^3 &lt; \epsilon +1$$ $$ \sqrt[3]{-\epsilon+1}&lt; x &lt; \sqrt[3]{\epsilon+1}.$$ Hoping that what I have done so far is correct. Am I right in thinking that $$ \sqrt[3]{-\epsilon+1}&lt; x &lt; \sqrt[3]{\epsilon+1}$$ is giving me an interval where $x$ is going to give me a $f(x)$ value that falls within the distance $\epsilon$ from the limit on the $y$-axis ? Or is this interval smaller than the $\epsilon$-distance on the $y$-axis? I have a PHP script that can encode a PNG image to a Base64 string.  I'd like to do the same thing using JavaScript. I know how to open files, but I'm not sure how to do the encoding. I'm not used to working with binary data. I can't play online. I can only play solo. I have bought Minecraft so it should work fine, but, when I try to connect to a server, it says:  Internal client error: java.net.UnknownHostException: session.minecraft.net   I have tried over 20 different servers and it says the same thing for every single one.   Note: These are not Hamachi servers. I'm attempting a direct connection. What does the colon in Tikz coordinates mean? Solder does not stick to tip of soldering iron? Basic question here, but it's driving me insane!  The solder does not seem to stick to the tip of my soldering iron. After the iron heats up, the tip appears black (sometimes on all sides and sometimes on one side), then either it doesn't melt the solder at all, or it I fiddle around with it for a while; it melts the solder, but the solder rolls into itself into a ball and doesn't stick to the tip.  I've seen this many times while soldering before and usually it's solved by cleaning the tip on a soldering sponge or cooling it down and scraping the tip off with a blade, but I have scraped this particular one many times and still it's the same problem: it heats up and gets black, then the solder doesn't stick to it.  It doesn't help that this soldering iron has a very fine tip and I have to use it to solder very tiny chips and wires under a microscope (I'm just starting to learn soldering under microscopes).  Any ideas on what I can do?    PS: Is scraping the tip a bad idea? I have been doing it with my other bigger soldering irons and it seemed to work (at least in most cases) but I am not sure whether it is a good solution or not. Possible Duplicate:                I know that the sum of the squares of the first n natural numbers is $\frac{n(n + 1)(2n + 1)}{6}$. I know how to prove it inductively. But how, presuming I have no idea about this formula, should I determine it? The sequence $a(n)=1^2+2^2+...+n^2$ is neither geometric nor arithmetic. The difference between the consecutive terms is 4, 9, 16 and so on, which doesn't help. Could someone please help me and explain how should I get to the well known formula assuming I didn't know it and was on some desert island? Blender 2.80 system Req + GPU req Can someone please let me know the minimum system requirements and GPU requirement to run blender 2.80 and eevee smoothly?   Also please let me know the optimum system requirements for the purpose of    environment modeling Game development charachter modelling and animation   Also if someone can suggest me a good desktop/laptop for personal use that is compatible with blender 2.80 in a low budget.  Any help will be much appreciated.  Thanks in advance! How can I split a beamer bibliography across two slides? Why doesn't PHP DOM include slash on self closing tags? Why aren't the humans wearing environmental suits in Star Wars spacecraft? Callback functions in Java ListPlot and filling between curves Parsing DD MM YY HH MM SS columns from TXT file using Python's pandas For a given class I would like to have tracing functionality i.e. I would like to log every method call (method signature and actual parameter values) and every method exit (just the method signature).      How do I accomplish this assuming that:     I don't want to use any 3rd party AOP libraries for C#, I don't want to add duplicate code to all the methods that I want to trace,   I don't want to change the public API of the class - users of the class should be able to call all the methods in exactly the same way.     To make the question more concrete let's assume there are 3 classes:     public class Caller   {      public static void Call()       {          Traced traced = new Traced();          traced.Method1();          traced.Method2();       }  }   public class Traced   {      public void Method1(String name, Int32 value) { }       public void Method2(Object object) { }  }   public class Logger  {      public static void LogStart(MethodInfo method, Object[] parameterValues);       public static void LogEnd(MethodInfo method);  }   How do I invoke Logger.LogStart and Logger.LogEnd for every call to Method1 and Method2 without modifying the Caller.Call method and without adding the calls explicitly to Traced.Method1 and Traced.Method2?  Edit:  What would be the solution if I'm allowed to slightly change the Call method? Let $x \in \mathbb R$  Find a closed form of $\int_0^\infty\dfrac{\cos(xt)}{1+t^2}dt$ .   Let me give some context: this is an exercise from an improper integrals course for undergraduates. My teacher was not able to give a valid solution without  resorting to Fourier series.   He actually wanted to prove first that the function is a solution of the ODE $$ y-y'' =0$$ without succeeding in proving it.   Anyway the result sould be $\dfrac{\pi}{2}e^{-x}$  Thanks for any help on this subject.