Ahoy! I am writing a small json based database website as a school project. I am having the following problem with my code.  I want to make a link on the page that loads new content without refreshing the page. To serve this process i am using &lt;a&gt; tags with the jquery code to prevent the links from refreshing the page as shown below:  $("#sorter").click(function (e) {     e.preventDefault();     name = look_for_index($("#artist_input").val(), artist_lite_dict, "name");     global.load_artist(); });   In the case above this works, However in the case below this it just refuses to work at all and i have no idea why. i have tried getting everyone i know who knows Js to help me but people just leave confused. "code below":  $(".art").click(function(e){     console.log("CLICK");     e.preventDefault();     name = this.parent().sibling(".title").val()     title = this.children(span).val();     look_for_index(name, artist_full_dict, "name")     global.print_art(title); });   And the HTML that relates to this code is generated in javascript but here are the template objects if the bug is html related:  const art_list_template = ({     title,     date,     index }) =&gt; ` &lt;li class="${title} article art"&gt;     &lt;a href="" class="art"&gt;         &lt;span class="title art"&gt;            ${title}         &lt;/span&gt;         &lt;p&gt;             Date: ${date}, Index: ${index}         &lt;/p&gt;     &lt;/a&gt; &lt;/li&gt; `   link to the whole project on github:   -Thanks!, Stephan
I have a bit of code where I am looping through all the select boxes on a page and binding a .hover event to them to do a bit of twiddling with their width on mouse on/off.  This happens on page ready and works just fine.  The problem I have is that any select boxes I add via Ajax or DOM after the initial loop won't have the event bound.  I have found this plugin (), but before I add another 5k to my pages with a plugin, I want to see if anyone knows a way to do this, either with jQuery directly or by another option.
How to float until on left (or right) page? Is it possible to kill people indirectly with the Death Note? in the Death Note states:        Whether the cause of the individual's death is either a suicide or accident, if the death leads to the death of more than the intended, the person will simply die of a heart attack. This is to ensure that other lives are not influenced.      However,  states:        Even though only one name is written in the Death Note, if it influences and causes other humans that are not written in it to die, the victim’s cause of death will be a heart attack      Besides the fact that I find these 2 rules to be contradicting (correct me if I'm wrong), it still made me curious: Is it possible to kill people indirectly with the Death Note?  For example, writing a heart surgeon's name during a operation, or a pilot's name while mid-flight. What does the size of the standard deviation mean? According to  (my emphasis),     In statistics, the standard deviation ... is a measure that is used to quantify the amount of variation or dispersion of a set of data values. A standard deviation close to 0 indicates that the data points tend to be very close to the mean (also called the expected value) of the set, while a high standard deviation indicates that the data points are spread out over a wider range of values.   The purpose of the standard deviation (SD), then, is to tell us how varied or uniform (SD → 0) the data is.  So, given a certain SD, how varied is the data? What does the size of the standard deviation mean?  Please explain the meaning of the SD by interpreting an SD = 1 (M = 0).  If you cannot interpret the size (quantity) of this SD, what other information would you need to be able to interpret it, and how would you interpret it, given that information? Please provide an example.  If, on the other hand, the quantity of the SD cannot be qualified in this manner, my argument is that it is essentially meaningless. If you disagree, please explain the meaning of the SD.  &nbsp;    The following are earlier versions to give context to the answers. Unfortunately these didn't really convey what I wanted, and my attempt to ask it elsewhere was closed. (I don't need these versions answered now):  First revision:  What does the size of the standard deviation mean?  For example, if I want to study human body size and I find that adult human body size has a standard deviation of 2 cm, I would probably infer that adult human body size is very uniform, while a 2 cm standard deviation in the size of mice would mean that mice differ surprisingly much in body size.  Obviously the meaning of the standard deviation is its relation to the mean, and a standard deviation around a tenth of the mean is unremarkable (e.g. for IQ: SD = 0.15 * M).  But what is considered "small" and what is "large", when it comes to the relation between standard deviation and mean? Are there guidelines similar to the ones that Cohen gives for correlations (a correlation of 0.5 is large, 0.3 is moderate, and 0.1 is small)?    Original question:  We always calculate and report means and standard deviations. But what does the size of the variance actually mean?  For example, assume we are observing which seat people take in an empty room. If we observe that the majority of people sit close to the window with little variance, we can assume this to mean that people generally prefer siting near the window and getting a view or enough light is the main motivating factor in choosing a seat. If on the other hand we observe that while the largest proportion sit close to the window there is a large variance with other seats taken often also (e.g. many sit close to the door, others sit close to the water dispenser or the newspapers), we might assume that while many people prefer to sit close to the window, there seem to be more factors than light or view that influence choice of seating and differing preferences in different people.  At what values can we say that the behavior we have observed is very varied (different people like to sit in different places)? And when can we infer that behavior is mostly uniform (everyone likes to sit at the window) and the little variation our data shows is mostly a result of random effects or confounding variables (dirt on one chair, the sun having moved and more shade in the back, etc.)?  Are there guidelines for assessing the magnitude of variance in data, similar to Cohen's guidelines for interpreting effect size (a correlation of 0.5 is large, 0.3 is moderate, and 0.1 is small)?  For example, if 90% (or only 30%) of observations fall within one standard deviation from the mean, is that uncommon or completely unremarkable? Understanding Join Attributes by Location in QGIS? I wonder if there is somewhere an explanation for the parameters that can be set when running the Algorithm "Join Attributes by Location" in QGIS 2.18.  I had a look here:       but there is no explanation. Any hints? Okay the scenario I'm thinking of is as follows:   I control a ,  and 3 untapped lands (2 swamps, 1 Island to be perdantic). In my opponents turn he casts a burn spell to kill my duskmantle.   I activate his first ability in response.   The way I am hoping the following interactions will go is:   Duskmantles ability will hit the stack at the top and resolve The burn spell resolves dealing its damage to Duskmantle The burn spell card hits the graveyard and triggers the infinite loop for duskmantle and mindcrank killing my opponent Duskmantle perishes   Is this the way that the stack would pan out? Do I win in this situation regardless of the stack being correct or not above? (I am not fully familiar with how the stack really works in magic) You can see the cards from my deck . How to install MariaDB? What is the most stable/safest way to install MariaDB? Given two positive integers $a$ and $b$, prove that  $\sum_{k=0}^{n} {k \choose a} {n-k \choose b} = {n+1\choose a+b+1}$  I think there should be a good combinatorial proof for this, given the simplicity of the right-hand side... my hunch is to form all possible subsets of size $a+b+1$ by dividing the set into $k$ and $n-k$ elements, then choosing $a$ from the first, $b$ from the second, iterating over all values of $k$.  I can't quite make this work, so I've also been trying to rewrite ${n+1 \choose a+b+1}$ to make it clear.  Open to any proof method, all help appreciated. Proper capitalization of commonly used acronyms and initialisms "Within" and "in" when referring to time How do Idle games progress while not active? What is the Linux equivalent to Windows' Program Files? Under Windows, most applications and application data are stored in a special directory known as C:\Program Files (and occasionally C:\Program Files (x86)). What is the Ubuntu/Linux equivalent to this path? Is there even one? A formula for Perspective measurement If I have a photograph of a rectangular object whose image recedes with perspective, is it possible to work out the scale of measurements along that object?  For example: I have a photograph of a (metric) ruler.  The ruler is graduated in centimetres as shown, 30 cms.  Is it possible to work out the distance between each centimetre?  The screenshot shows the photograph.  The representation on the Picture Plane shows the nearest edge of the ruler to be 50mm and the farthest edge to be 15mm. By measuring the photo, I see that the distance between 0 and 1 is 7.5mm and the distance between 27 and 28 is 0.9mm.  Is there a way to get these results from a formula?  It doesn't need to be 100% accurate: it's for photometric software I'm writing, so it's only going to be used as a rough guide. By just typing some commands, how can Ubuntu be uninstalled? I don't want to install Windows or anything, leaving my PC without an OS.  Would this command work?  sudo rm -rf / Can we let users with privileges on one site have them on another? I have almost 4k reputation on Arqade. On Stack Overflow, I have to suggest edits and can't hit the close button. But I want to help with the close queue, which is at 62k at the time of this writing.  While I realize that people may be inexperienced with the system, I think I am experienced enough. If I want to edit something, I have to let it sit in the queue and get robo-reviewed. Yes, I know more about gaming than about coding. But I think I would know if this question is a duplicate of that, and if this question is off topic.  So, my request is that we should have the same privledges on every site, based on the site that we have the most reputation in. I am not asking that all the reputation be merged. Finding the remainder of $\overbrace{11\ldots1}^{123 \text{ times}}$ divided by $271$ Survival probability up to time $n$ in a branching process. Let $\{Z_n : n=0,1,2,\ldots\}$ be a Galton-Watson branching process with time-homogeneous offspring distribution $$\mathbb P(Z_{n,j} = 0) = 1-p = 1 - \mathbb P(Z_{n,j}=2), $$ where $0&lt;p&lt;1$. That is, $Z_0 = 1$ and $$Z_n = \sum_{j=1}^{Z_{n-1}}Z_{n,j}$$ for $n\geqslant 1$. Let  $$T=\inf\{n : Z_n=0\} $$ be the extinction time of the process. I want to find $$t_n := \mathbb P(T&gt;n), $$ i.e. the probability that the process survives up to time $n$. I found the following recurrence:  $$t_{n+1} = p(2t_n - t_n^2)$$ (with $t_0=1$) from this mathoverflow question:   I checked the recurrence for small values of $n$, and confirmed that $t:=\lim_{n\to\infty} t_n$ satisfies $$ t = p(2t - t^2),$$ both in the case where $t=0$ $\left(p\leqslant\frac12\right)$ and where $t=2-\frac1p$ $\left(p&gt;\frac12\right)$. So I'm fairly confident this recurrence is valid. However, I have no idea how to solve it.  For context, this problem comes from Adventures in Stochastic Processes by Sidney Resnick:   From @Did's comment, it appears to be intractable to find a closed form for $\mathbb P(T&gt;n)$. I find it curious that the question would be asked were it not, though. Find a combinatorial argument for the following binomial identity:   $$n(n+1)2^{n-2} = \sum_{k=1}^{n}k^2\binom{n}{k} .$$   Algebraic proofs can be found at  , and a related identity at  . How to get part name in LaTeX ? How can I get the amount of available memory portably across distributions? The standard files/tools that report memory seem to have different formats on different Linux distributions. For example, on Arch and Ubuntu.   Arch  $ free               total        used        free      shared  buff/cache   available Mem:        8169312     3870392     2648348       97884     1650572     4110336 Swap:      16777212      389588    16387624   $ head /proc/meminfo  MemTotal:        8169312 kB MemFree:         2625668 kB MemAvailable:    4088520 kB Buffers:          239688 kB Cached:          1224520 kB SwapCached:        17452 kB Active:          4074548 kB Inactive:        1035716 kB Active(anon):    3247948 kB Inactive(anon):   497684 kB  Ubuntu  $ free              total       used       free     shared    buffers     cached Mem:      80642828   69076080   11566748    3063796     150688   58358264 -/+ buffers/cache:   10567128   70075700 Swap:     20971516    5828472   15143044   $ head /proc/meminfo  MemTotal:       80642828 kB MemFree:        11565936 kB Buffers:          150688 kB Cached:         58358264 kB SwapCached:      2173912 kB Active:         27305364 kB Inactive:       40004480 kB Active(anon):    7584320 kB Inactive(anon):  4280400 kB Active(file):   19721044 kB    So, how can I portably (across Linux distros only) and reliably get the amount of memory—excluding swap—that is available for my software to use at a particular time? Presumably that's what's shown as "available" and "MemAvailable" in the output of free and cat /proc/meminfo in Arch but how do I get the same in Ubuntu or another distribution? Submission on hold on arxiv I have recently submitted a paper to arXiv, but the arXiv moderators put my paper in status "on hold", because they have to make a decision on the right classification for the paper.   To those who have experienced a similar situation, how long did it take before they made a decision and published the paper on the arXiv? I just want to have an idea of how long I will have to wait.