The badge:     Active member for a year, earning at least 200 reputation   I'm curious to how this is calculated.  Lets say i've been active for almost a year on the site and earned 250 reputation.   Lets also say that I gave away a bounty or engaged in other activity on the site that lowered my reputation below 200 before the anniversary.  Does the system look at the net total reputation on the anniversary day, or does the system take into consideration all of the reputation EARNED, not subtracted?
Jawa asked me this  and I didn't know the answer. So I present it to the meta SO community:     [To get the Yearling badge] Do you need to earn the 200 rep within that one year or is it enough to get 200 at some point after being a member for a year? And does 'a year' mean the very first 12 months or the last (sliding window of) 12 months?    I would assume that if you hit 200 reputation after you've already been around for a year, then you would get the Yearling badge. But I don't know.
Is it possible to host a web server from behind a NAT My PC is behind a NAT router that has a public IP address. If I want to host a website then I believe I need a domain name which I can purchase from some site which would pledge to resolve all DNS requests for that domain name and send the IP address of my NAT router (assuming I do not want to host my domain name on their servers). Now I want to host a web server on my computer.   What changes should be done to the NAT router's configuration to forward all HTTP requests for example.com to my PC in the internal network. Is the above strategy correct? Is it commonly used? how to set Image and text at the center of the button How to define a command that takes more than 9 arguments I have a mathematical transformation that takes 16 parameters (grouped into 3+8+5) and would like to make a latex command for it, so that I can easily change the notation for it if the need arises.  As far as I know, both \def and \newcommand take a maximum of 9 arguments, is there any (recommended) way to extend this? When handling multiple white-on-transparent png images, I am hindered by the fact that the thumbnails of these images are all-white. Both Adobe Bridge CS6 and Windows Explorer suffer the same problem, I can't discern between two of these pngs.  Is there a way to make these thumbnails useful? Is there some setting I missed that allows changing the thumbnail background colour for a png -- now a deafult white? Laws and theories What is a , a , and what is the relationship among them?  I know this is a very basic question, so any reference to epistemology will be greatly appreciated :) Looking for a powershell script that can pull a file from a set of PC's and FTP I'm looking to write a script (preferably powershell) that will essentially copy a file from a bunch of PC's and FTP it to a server.   So the structure of the environment is that we have a file on multiple PC's (around 50 or so) that need to placed on a server. Sometimes one of the PC's may be turned off so the script would first need to ensure the PC is up and running (maybe a ping result), then it would need to go into a directory on that PC, pull a file off of it, rename the file, place into a source directory, then remove the file. Naming convention doesn't matter, but date/time stamp would be easiest. Ideally, it would be best to first move all the files to a source directory to save on FTP bandwidth, but since the files will be named the same, the files must be renamed during the move process. Move not copy because the directory needs to be empty so the file can be re-created the next day. So once moved to the source directory, now all the files need to be FTP'd to a server for processing.   After all of this, we need to know which PC's on the list did not respond so we can manually retrieve the file so the script should output a file (txt is fine) that will show which PC's were offline.   Everything is one domain and script will be run from an server with admin creds.   Thank you! This is a  about understanding and remediating the Heartbleed security issue.   What exactly is CVE-2014-0160 AKA "Heartbleed"? What is the cause, what OSs and versions of OpenSSL are vulnerable, what are the symptoms, are there any methods to detect a successful exploit?   How can I check to see if my system is affected? How can this vulnerability be mitigated? Should I be concerned that my keys or other private data have been compromised? What other side effects should I be concerned about? How can I check the integrity of a downloaded Ubuntu CD? I've just downloaded a CD image of Ubuntu. I know the installer has a check CD option, but how can I check that the image is good before burning it to CD? How to remove Ubuntu and put Windows back on? I have absolutely no experience with Linux, and I desperately need to get my computer back up and running again with Windows.  How do I remove Ubuntu and reinstall Windows?    Editor's note: many of the answers are about removing Ubuntu from dual-boot but keeping Windows (which is a bit complicated), while other answers are about removing Ubuntu from single-boot (which is easy: basically just format the disk while installing Windows). The question as written is ambiguous between dual-boot or single-boot. How do I move child windows without moving or minimizing parent in GNOME 3? I have Ubuntu 17.10 with GNOME 3.  What happens: I have (for example) LibreOffice Calc open, with some data columns in it.  I highlight the columns I want to chart, then I select INSERT > CHART.  The chart child window dialog pops up on top of my data, so I want to move it to the side.  When I grab the top bar and move it, the parent (spreadsheet) window minimizes (I think it actually disappears).  Continuing the above example, if I click FINISH on the chart window, I can then see the minimized spreadsheet application, which is the window title bar plus the menu bar just below it.  This seems like really odd behaviour and certainly falls under the category of "not being useful to the user", since the whole idea of moving the child window in the first place was just to be able to better see the spreadsheet!  In other applications, for example the PDF viewer, a slightly different problem occurs.  When I try to move the child window (for example the print dialog) the parent does not minimize but instead follows the child window around.  This is less surprising than having the parent disappear entirely but equally useless in terms of allowing the user to see the information present in the parent window.  Update 2017/11/06  Pomsky's answer below fixes the problem, but leaves me wondering why the window manager is making the decision that all child windows have modal behaviour (or don't), and not the applications themselves; and further, why modal behaviour prevents moving the child screen around when it obscures useful info on the parent screen.  Neither of these seem like good design to me... Why is quantum entanglement considered to be an active link between particles? From everything I've read about quantum mechanics and quantum entanglement phenomena, it's not obvious to me why quantum entanglement is considered to be an active link. That is, it's stated every time that measurement of one particle affects the other.  In my head, there is a less magic explanation: the entangling measurement affects both particles in a way which makes their states identical, though unknown. In this case measuring one particle will reveal information about state of the other, but without a magical instant modification of remote entangled particle.  Obviously, I'm not the only one who had this idea. What are the problems associated with this view, and why is the magic view preferred? I have modeled a simple pocket watch in Blender. Every time I import it into Unity3D, regardless of whether I export it from Blender as an FBX or 3ds file, it always comes out missing faces! Why is this happening? I have never had problems importing models into Unity3D like this before.  Blender Screenshot    Unity Screenshots     It seems to me that different faces appear when I rotate it differently. How can I prevent this? Thanks! Differential form is closed if the integral over a curve is rational number. The following problem comes from do Carmo's book Differential Forms and Applications, Chapter 2, Exercise 4:  Let $\omega$ be a differentiable 1-from defined on an open subset $U\subset \mathbb{R}^n$. Assume that for each closed differential curve $C$ in $C$, $\int_C \omega$ is a rational number. Prove that $\omega$ is closed.   Can anyone give some hints? My idea was that we could try to show the integral vanishes if the curve lies in $N_\epsilon (p)$ (i.e. a small neighborhood around $p$) for any $p$ in $U$ and use the Poincare Lemma, but failed. Calculating the area of an irregular polygon Given the length of the sides of an irregular polygon (no coordinates provided) how do you compute the area of the maximum area of the polygon?   Thanks in advance Jeffrey Wooldridge in his Econometric Analysis of Cross Section and Panel Data (page 357) says that the empirical Hessian "is not guaranteed to be positive definite, or even positive semidefinite, for the particular sample we are working with.".  This seems wrong to me as (numerical problems apart) the Hessian must be positive semidefinite as a result of the definition of the M-estimator as the value of the parameter which minimizes the objective function for the given sample and the well-known fact that at a (local) minimum the Hessian is positive semidefinite.  Is my argument right?  [EDIT: The statement has been removed in the 2nd ed. of the book. See comment.]  BACKGROUND Suppose that $\widehat \theta_N$ is an estimator obtained by minimizing $${1 \over N}\sum_{i=1}^N q(w_i,\theta),$$ where $w_i$ denotes the $i$-th observation.  Let's denote the Hessian of $q$ by $H$, $$H(q,\theta)_{ij}=\frac{\partial^2 q}{\partial \theta_i \partial \theta_j}$$  The asymptotic covariance of $\widehat \theta_n$ involves $E[H(q,\theta_0)]$ where $\theta_0$ is the true parameter value. One way to estimate it is to use the empirical Hesssian  $$\widehat H=\frac{1}{N}\sum_{i=1}^N H(w_i,\widehat \theta_n)$$  It is the definiteness of $\widehat H$ which is in question. Why are lamps and mesh lights not illuminating anything? Run faster than outer turret attacks As the title says, is there any way to run faster than the turret attack (the missile like thing) so that you can arrive spawn before the attack reaches you, and therefore can't kill you? You know, when you have low health, and you are targeted by the turret? Is there any item sets or things like that? Maximal order of an element in a symmetric group If we let $S_n$ denote the symmetric group on $n$ letters, then any element in $S_n$ can be written as the product of disjoint cycles, and for $k$ disjoint cycles, $\sigma_1,\sigma_2,\ldots,\sigma_k$, we have that $|\sigma_1\sigma_2\ldots\sigma_k|=\operatorname{lcm}(\sigma_1,\sigma_2,\ldots,\sigma_k)$.  So to find the maximum order of an element in $S_n$, we need to maximize $\operatorname{lcm}(\sigma_1,\sigma_2,\ldots,\sigma_k)$ given that $\sum_{i=1}^k{|\sigma_i|}=n$. So my question:      How can we determine $|\sigma_1|,|\sigma_2|,\ldots,|\sigma_k|$ such that $\sum_{i=1}^k{|\sigma_i|}=n$ and $\operatorname{lcm}(\sigma_1,\sigma_2,\ldots,\sigma_k)$ is at a maximum?   Example  For $S_{10}$ we have that the maximal order of an element consists of 3 cycles of length 2,3, and 5 (or so I think) resulting in an element order of $\operatorname{lcm}(2,3,5)=30$.  I'm certain that the all of the magnitudes will have to be relatively prime to achieve the greatest lcm, but other than this, I don't know how to proceed. Any thoughts or references? Thanks so much. I would like to count subgroups of each order (2, 3, 4, 6, 8, 12) of $S_4$, and, hopefully, convince others that I counted them correctly.  In order to do this by hand in the term exam, I need a clever way to do this because there can be as many subgroups of a group of order 24 as $2^{23}$.  Do you know how to do this?   (I would be most grateful if you could tell me what part of the answer to the old question answers my question before voting to close.) Every planar graph has a vertex of degree at most 5. I am trying to prove the following statement, any help!?     Prove that every planar graph has a vertex of degree at most 5.