Assuming this structure:  &lt;div id="container"&gt;     &lt;div class="sortable"&gt;         &lt;div class="box"&gt;         &lt;h1&gt;title1&lt;/h1&gt;         &lt;h3 class="price"&gt;5&lt;/h3&gt;         &lt;/div&gt;     &lt;/div&gt;      &lt;div class="sortable"&gt;         &lt;div class="box"&gt;         &lt;h1&gt;title2&lt;/h1&gt;         &lt;h3 class="price"&gt;1&lt;/h3&gt;         &lt;/div&gt;     &lt;/div&gt;      &lt;div class="sortable"&gt;         &lt;div class="box"&gt;         &lt;h1&gt;title3&lt;/h1&gt;         &lt;h3 class="price"&gt;3&lt;/h3&gt;         &lt;/div&gt;     &lt;/div&gt; &lt;/div&gt;   How can I sort the elements with the class .sortable to show in ascending/descending order based on the class .price inside of the divs? It should happen when clicking a button.  I know that with arrays I could use the .sort method, but as this is not an array, I don't really know how to approach this.
is there a quick way to sort the items of a select element? Or I have to resort to writing javascript?  Please any ideas.  &lt;select size="4" name="lstALL" multiple="multiple" id="lstALL" tabindex="12" style="font-size:XX-Small;height:95%;width:100%;"&gt; &lt;option value="0"&gt; XXX&lt;/option&gt; &lt;option value="1203"&gt;ABC&lt;/option&gt; &lt;option value="1013"&gt;MMM&lt;/option&gt; &lt;/select&gt;
Using the validation data I'm unclear on the exact process of using the validation data.  Let's say that I fit my neural network model and adjust hyperparameters using the training set and validation set. Do I then evaluate the test set on this model? Or do I recombine the validation and training sets and fit a fresh model with the hyperparameters that I found during the validation phase, and then evaluate on the test data? I have seen a number of different notebooks and examples that do both ways.  Surely, once I've found my hyperparameters, it makes sense to fit a fresh model using the full training set (recombined with validation set), since the validation loss has no effect on the weights. How can I upload files asynchronously with jQuery? how to restore windows 7 to a know working state every time it boots A couple of days ago my mother asked me to set up a computer at her house, she wants to use it to basic web browsing, video chat and nothing more.  The problem is, neither my mother nor my sister know anything about using or maintaining a computer.  What I want is to have a working base install of windows 7 and just discard everything installed, downloaded, ... when it reboots. That way I can set up a partition just for saving files and whatever they do the computer will always return to a working state at start up.  can that be done?  PS: Sadly linux is not an option since my sister wants to be able to play some games with my steam account and not all of them run with wine. Does an unpublished document you upload to ResearchGate count as prior publication when submitting to a journal? On ResearchGate, if you upload something like a thesis, and then it says publish resources, does this mean the thesis becomes properly published in the sense of the usual requirements of journals that there be no prior publication of the submitted work?   I ask because I’m drafting thesis chapters into journal articles and did not choose to publish the thesis as a whole work in order to do so, so I want to make sure that by clicking publish resources I am not actually publishing the copy I’ve uploaded, I’m just making it publicly available? Does this mean it becomes published despite it not technically being a published work? (If so, I’ll just remove the copy I uploaded). How do I eliminate the vertical realignment when using arrayrulecolor with cmidrule? I'm using consecutive \cmidrule commands in conjunction with \arrayrulecolor to alternately hide and unhide horizontal rules in a table.  However, when \arrayrulecolor is used with \cmidrule, some odd vertical spacing is introduced. I'd like to eliminate it.  (I'm using longtable, so a colorbox, minipage, or anything else tied to a page won't work.)  Below is an image that introduces the challenge. The first block shows a \toprule.  My goal is to create a shaded border around the table, so I've added a dummy column.  The second rule shows a \cmidrule that skips the first column.  The third block shows how I can use a \cmidrule to fill in the whitespace with a shorter \cmidrule.  Finally, I want to recolor this short \cmidrule to the background color and restore the color later.  Note the jagged vertical skipping in case 4 compared to case 3.  Why would \arrayrulecolor change vertical alignment?  How can I eliminate the jagged edges?    Here is the code:   \documentclass[11pt]{article}  \usepackage{longtable} \usepackage{booktabs} \usepackage{color} \usepackage{xcolor} \usepackage{colortbl}  \setlength{\aboverulesep}{0pt} \setlength{\belowrulesep}{0pt} \setlength{\extrarowheight}{0.25ex}  \newcolumntype{L}{&gt;{\columncolor[gray]{0.8}}l} \newcolumntype{C}{&gt;{\columncolor[gray]{0.8}}c} \newcolumntype{R}{&gt;{\columncolor[gray]{0.8}}r}  \begin{document}  \textsf{ \begin{longtable}{LLLLL}  &amp; \multicolumn{3}{@{}L}{\small {\tablename\ \thetable{}} - demonstration of odd vertical alignment with arrayrulecolor} &amp; \\%  &amp; \multicolumn{3}{@{}L}{\small {case 1: the line below is a toprule}} &amp; \\% \toprule  &amp; \multicolumn{3}{@{}L}{\small {case 2: the line below is a cmidrule that spans the middle 3 columns.  Note the whitespace!}} &amp; \\%  &amp; \multicolumn{3}{@{}L}{\small {The challenge: hide the widespace giving the appearance of a spacing around a longtable.}} &amp; \\% \cmidrule[\heavyrulewidth]{2-4}  &amp; \multicolumn{3}{@{}L}{\small {case 3: the line below is 3 cmidrules, 1 each for the first and last columns and 1 for the middle}} &amp; \\%  &amp; \multicolumn{3}{@{}L}{\small {note how the cmidrules align vertically ... perfect!}} &amp; \\% \cmidrule[\heavyrulewidth]{1-1}\cmidrule[\heavyrulewidth]{2-4}\cmidrule[\heavyrulewidth]{5-5}  &amp; \multicolumn{3}{@{}L}{\small {case 4: Now, lets try recoloring the first and last cmidrules}} &amp; \\%  &amp; \multicolumn{3}{@{}L}{\small {how do I eliminate the odd vertical alignments?}} &amp; \\% \arrayrulecolor[gray]{0.80}\cmidrule[\heavyrulewidth]{1-1}\arrayrulecolor[gray]{0.0}\cmidrule[\heavyrulewidth]{2-4}\arrayrulecolor[gray]{0.80}\cmidrule[\heavyrulewidth]{5-5}\arrayrulecolor[gray]{0.00} \endfirsthead  &amp;  Arizona State University &amp;  &amp; ASU &amp;\\   &amp;   Baylor University &amp;  &amp; BAYLOR &amp;\\   &amp;   Boston University &amp; 164988 &amp; BU &amp;\\   &amp;   Brown University &amp; 217156 &amp; BROWN &amp;\\   &amp;   California Institute of Technology &amp; 110404 &amp; CALTECH &amp;\\   &amp;   Carnegie Mellon University &amp; 211440 &amp; CMU &amp;\\   &amp;   Case Western Reserve University &amp; 201645 &amp; CASE &amp;\\   &amp;   Columbia University &amp; 190150 &amp; COLUMBIA &amp;\\   &amp;   Cornell University &amp; 190415 &amp; CORNELL &amp;\\      &amp; Yale University &amp; 130794 &amp; YALE &amp; % \label{tab:schools} \end{longtable} }  \end{document} I am stuck with the proof of below expression;  "If F is an infinite field, then no infinite subgroup of F* (the multiplicative group of F) is cyclic."  anyone can help? OS X lets me type special characters directly on the keyboard by holding the Option. For example: — is an em dash, “ and ” are curvy quotes, etc.  Is there a good cheat sheet listing all these keys somewhere? I tend to find myself holding option and running my hands up and down the keyboard looking for a specific character. The situation is my  has been enchanted with .  The creature has      when it dies, return it to his owner’s hand   The enchantment says     When enchanted creature dies, return that card to the battlefield under your control with a +1/+1 counter on it.   Who gets the creature? Me or my rival?  Does the creature ability trigger before or after enchantment? How can I increase the mouse pointer speed beyond the limits set by the Mouse preferences dialog? In the Mouse preferences dialog I've set the acceleration to max and the sensitivity to min and the mouse pointer is not exactly sluggish, but I'd like to make it even faster. Is it possible to be done by setting some value in the procfs or something?  Thanks! Almost universal class I so stuck with a problem of set theory. But first a recursive definition:   Define $R_0=\emptyset$ If $R_\alpha$ is defined, then $R_{\alpha+1}=\mathcal{P}(R_\alpha)$ (the power set). For a limit ordinal $\gamma$, if $R_\alpha$ is defined for all $\alpha&lt;\gamma$, then define $R_\gamma=\displaystyle\bigcup_{\alpha&lt;\gamma} R_\alpha$   We define $\text{BF}=\displaystyle\bigcup_{\alpha\in\text{OR}} R_\alpha$ (the class of well founded sets).  Next, my problem     Take $A\subseteq \text{BF}$ a proper transitive class such that $(A,\in)\models\text{ZF}$. Prove that $A$ is almost universal.    I think that the exercise is false because if it was true, then we could conclude that the strongly inaccessible cardinals doesn't exists. This because if $\kappa$ is strongly inaccessible then $R_\kappa$ satisfies the hypothesis but $R_\kappa$ isn't almost universal. I really appreciate any hint or/and suggestion.   Edit: my counterexample is wrong. But, then, how can I solve the exercise? My son is 5 years old.   Over the last few months I have been observing some disturbing sexual behavior from my child.  He is rubbing his penis on  the bed or pillow. Sometimes he would get naked and rub very tightly and make some sounds of pleasure! Previously, I thought he was playing... but later I understood.   His father doesn't want me to scold him, but one day I was really surprised and shocked by one incident... when I was in deep sleep in the afternoon, I suddenly woke up and saw he had pulled up my skirt and trying to mount me! I was really shocked!  I'm really upset.  What should I do? Why is moving directories to /dev/null dangerous? Where was this picture taken (screensaver on LG Oled TV)? Can someone please tell me where this picture was taken? The client can do several actions per frame, for instance, requesting a movement, shooting etc. Should i send a packet to the server for each action the client performed during the frame, or should i stack them in an unique packet and send it at the end of the frame?  EDIT: i'm using Jmonkeyengine and the provided network API SpiderMonkey. Undefined control sequence error on \fancy@reset, \f@ncyolh and \f@ncyorh when using newlfm class I updated to TeXLive 2017 and couldn't get newlfm.cls to work without errors.  Here is a minimal example:  \documentclass{newlfm} \begin{document} \begin{newlfm} \end{newlfm} \end{document}   LaTex is throwing undefined control sequence errors on \fancy@reset, \f@ncyolh, and \f@ncyorh.  What causes the errors?  What am I missing? Using past tense when referencing a still-true fact What equipment should I have to kill the Eye of Cthulhu? I just manually summoned the Eye of Cthulhu, going into battle with copper armour, tungsten broadsword, gold bow, jester arrows and plenty of lesser healing potions. I came rather close to death but I managed to stay alive. However, the Eye took off when I had his health down to ~1700. I'm assuming this means you only have a few minutes to finish it off after a certain point. Is there any equipment I'm missing to help kill the Eye faster and to help my survivability? If it's relevant, my current life is 120. Sum $\frac{1}{6} + \frac{5}{6\cdot 12} + \frac{5\cdot 8}{6\cdot 12\cdot 18} + \frac{5\cdot 8\cdot 11}{6\cdot 12\cdot 18\cdot 24}+\ldots$ A series is given as follows   $$\frac{1}{6} + \frac{5}{6\cdot 12} + \frac{5\cdot 8}{6\cdot 12\cdot 18} + \frac{5\cdot 8\cdot 11}{6\cdot 12\cdot 18\cdot 24}+\ldots$$  Can you give me hints to get started finding its value? Thanks. IVP Differential Equation I have stumbled across a very old exam question from my linear algebra course and the solutions are not available. I was wondering if my working/logic is correct and if any improvements can be made.     Let  $\ B=\begin{pmatrix}     1 &amp; -1 &amp; 4 \\     6 &amp; -7 &amp; 2 \\     -3 &amp; 1 &amp; -6       \end{pmatrix}\ $ and $\ \vec{v_1}=\begin{pmatrix} 1 \\ 1 \\ -1 \end{pmatrix}$.      Part (i): Calculate $(B+5I)\vec{v_1}$ and $(B+5I)^2\vec{v_1}$.   Using simply matrix multiplication, I calculated $(B+5I)\vec{v_1}=\begin{pmatrix} 1 \\ 2 \\ -1 \end{pmatrix}$ and $(B+5I)^2\vec{v_1}=\vec{0}$.     Part (ii): Find all eigenvalues and eigenvectors of B.   From our calculations in part (i), we can see that $\ \lambda=-5,-5$ are two of the eigenvalues, with corresponding eigenvector $\ \begin{pmatrix} 1 \\ 2 \\ -1 \end{pmatrix}$ and generalised eigenvector $\ \begin{pmatrix} 1 \\ 1 \\ -1 \end{pmatrix}$. From the trace of B, the remaining eigenvalue is $\lambda=-2$ with corresponding eigenvector $\begin{pmatrix} -2 \\ -2 \\ 1 \end{pmatrix}$.     Part (iii): Giving reasons, write down a basis for the generalised eigenspace $GE_{-5}$ of B.   I am unsure of this part of the question. If I had to guess, I would say a basis for $GE_{-5}=\left\{\begin{pmatrix} 1 \\ 1 \\ -1 \end{pmatrix},\begin{pmatrix} 1 \\ 2 \\ -1 \end{pmatrix}\right\}$. Is this correct?     Part (iv): Solve the initial value problem $\vec{y'}=B\vec{y}$ where $\ B=\begin{pmatrix}     1 &amp; -1 &amp; 4 \\     6 &amp; -7 &amp; 2 \\     -3 &amp; 1 &amp; -6       \end{pmatrix}\ $ and $\vec{y}(0)=\begin{pmatrix} 1 \\ 1 \\ -1 \end{pmatrix}$.   Well, the solution to this IVP will take the form $\vec{y}=e^{tB}\begin{pmatrix} 1 \\ 1 \\ -1 \end{pmatrix}$. I noticed that $\begin{pmatrix} 1 \\ 1 \\ -1 \end{pmatrix}$ was a generalised eigenvector and hence we can write $\vec{y}=e^{-5t}\begin{pmatrix} 1 \\ 1 \\ -1 \end{pmatrix}+e^{-5t}\begin{pmatrix} 1 \\ 2 \\ -1 \end{pmatrix}t$. Thus $\vec{y}=e^{-5t}\begin{pmatrix} 1+t \\ 1+2t \\ -1-t \end{pmatrix}$ Exact probability of random graph being connected The problem: I'm trying to find the probability of a random undirected graph being connected. I'm using the model $G(n,p)$, where there are at most $n(n-1) \over 2$ edges (no self-loops or duplicate edges) and each edge has a probability $p$ of existing. I found a simple formula online  where $f(n)$ is the probability of $G(n,p)$ being connected. But apparently it's too trivial for the writer to explain the formula (it was just stated briefly).  The desired formula: $f(n) = 1-\sum\limits_{i=1}^{n-1}f(i){n-1 \choose i-1}(1-p)^{i(n-i)}$  My method is: Consider any vertex $v$. Then there's a probability ${n-1 \choose i}p^i(1-p)^{n-1-i}$ that it will have $i$ neighbours. After connecting $v$ to these $i$ neighbours, we contract them ($v$ and its neighbours) into a single connected component, so we are left with the problem of $n-i$ vertices (the connected component plus $n-i-1$ other "normal" vertices.   Except that now the probability of the vertex representing connected component being connected to any other vertex is $1-(1-p)^i$. So I introduced another parameter $s$ into the formula, giving us:  $g(n,s)=\sum\limits_{i=1}^{n-1}g(n-i,i){n-1 \choose i}q^i(1-q)^{n-1-i}$,  where $q=1-(1-p)^s$. Then $f(n)=g(n,1)$. But this is nowhere as simple as the mentioned formula, as it has an additional parameter...  Can someone explain how the formula $f(n)$ is obtained? Thanks!