sorting instance of dict_items/sorting dictionary by value
How do I sort a dictionary by value?
Read echo'ed output from another PHP file Mcrypt extension is missing in 14.04 server for mysql The php mcrypt extension on ubuntu 14.04 shows that it is installed properly, but phpmyadmin says:   The mcrypt extension is missing. Please check your PHP configuration.   My current php config is . If you need anymore information, please contact me through the comments.  $ sudo apt-get install php5-mcrypt     Reading package lists... Done     Building dependency tree            Reading state information... Done     php5-mcrypt is already the newest version.     0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded. Wild Magic Surge - What does "You cast ..." mean for your spell slots? In response to  question, I started to think about what it means when a Wild Magic Surge results in a "You cast spell-X".  So, "specific beats general" gives:   You can cast a second spell when you would not normally be allowed to You can cast a spell you don't know If the surge forces you to cast a concentration spell you would lose any concentration spell that you currently had active Subject to what the specific entry says you can target it how you like Unless the specific entry prohibits it you could use metamagic on the spell   I am pretty confident in all of the above but if anyone disagrees please address in an answer.  Here comes the question.  How does this impact on your available spell slots?  "You cast ..." to me suggests that if you have an applicable slot available then you have to use it to cast the spell because that is the general rule for casting spells but if you don't then "specific beats general" and it is cast anyway.  Specific examples:     You cast fireball as a 3rd-level spell centered on   yourself   This must be a 3rd level spell:   if you have a 3rd level slot available you have to use it? if you don't, if you have 5 sorcery points and a bonus action available must you use these to get that slot? if you don't have any of that then the spell goes off anyway?      You cast confusion centered on yourself.   No level specified and confusion is a 4th level spell:   if you have a 4th level slot available you have to use it? if you have a 4th, a 6th and an 8th level slot you can choose which one to use? if you have only a 5th level slot but also 6 sorcery points and a bonus action, you could choose to use the 5th level slot or use the points to create a 4th level slot? if you don't have any 4th level or higher slots but you have 6 sorcery points and a bonus action available must you use these to get that slot? if you don't have any of that then the spell goes off anyway?   And so on ... I'd like to prove a nice property of a stochastic integral with respect to Brownian motion.   Let $(H_t)_{t\geq0}$ be a progressive and bounded process that is continuous at $0$ and $B$ a standard Brownian motion. Then  $\frac{1}{B_{\varepsilon}}\int_{0}^{\varepsilon}H_s\mathbb{d}B_s\rightarrow H_0$ as $\varepsilon\rightarrow0$ in probability.   Anyone got some hints ? I'm really puzzled and I don't know where to start.   EDIT_2.0. Applying Ito-Isometry might be a bit tricky. This Brownian Motion in the denominator kinda troubles me :/ opengl storing multiple indices into indices buffer After parsing collada files I found out that we have to load two(or more) indices each pointing to say a vertex or normal etc. like this (&lt;p>3 0 2 0 0 0&lt;/p>)  Is there a way to load (and use)these indices to indices buffer(ELEMENT_ARRAY_BUFFER) like this (vnvnvn...) ; where v is vertex pointer, n is normal pointer from the above. with vertices loaded to VBO1 like (vvvv...) and in VBO2 like (nnnn...). So that we dont have to repeat the normals in VBO2.  VBO like (vnvnvn...) is also ok. (and not something like this ), I'm not trying to use multiple indices buffer. I'm trying to put all the given indices into one index buffer and use them alternately.  (If I wasnt clear i will try for more clarification.) How to design partitions for SSHD? I'm going to install Linux on Lenovo B5400, which contains:   500GB Hybrid SSHD with a 8 GB SSD and 500 GB HDD   Designing partitions for my 2 Linux distros was quite easy before, when I had only HDD. I always had:   10GB for Linux distro (mounted as "/") 10GB for another distro (again "/"; for another distro; for testing purposes or to assure continuity when switching distros) 2GB for swap (used for both distros; no need to separate) 300GB+ for "/home" (used for both distros; different usernames eliminates possible conflicts)   It's simple, isn't it? I would like to keep this approach, but I know that SSD has its own specificity - it prefers to be read, continuous writing may affect its life span. I don't want to kill SSD in a year, so I would like to move some system partitions to HDD in order to protect SSD. As far as I know /tmp is one of often read&amp;written locations. How much space it needs? What else should be placed on HDD?  Or: how to design partitions to achieve exactly the same effect and to keep SSD as safe as possible?  I'd be grateful for your help. Let $G$ be a locally compact Hausdorff Abelian topological group.  Let $\mu$ be a Haar measure on $G$, i.e. a regular translation invariant measure.  Let $f$ be fixed in $\mathcal{L}^1(G, \mu)$.  Define the function from $G$ to $\mathcal{L}^1(G)$ that assigns to each $y$ in $G$ the function that takes $x$ in $G$ to $f(xy^{-1})$.  I.e. it assigns the $y$-translate of $f$.  Is this a continuous function of $y$ into $\mathcal{L}^1$?      On p.94 3.10 of  it is asserted that it is.  The usual proof of this sort of thing in cases where $G=\mathbb{R}$, say, is you use density of compactly supported continuous functions, and then dominated convergence.  The former survives, but dominated convergence does not work on nets.  In fact, a limit of a net of measurable functions need not be measurable. The ability to undo reviews I'm trying to install  in VirtualBox but the installation get stuck at Do you want to install boot loader GRUB    Some background:   The VM was created from the Ubuntu 32-bit (x86) VirtualBox template The VM has 1 core + 3096 MB RAM Video memory: 32 MB PAE/NX enabled Hardware virtualization: both VTx and nested pagination enabled Graphics acceleration: disabled (both 2D and 3D) Storage: 64 GB attached to IDE virtual controller (was SATA before: makes no difference)   I've already tried all the "standard" VirtualBox procedure (PAE yes/no; SATA/IDE; no soundcard; no USB; graphics accel. yes/no).  I also tried run the Live CD in VESA mode: like this it starts, but I'd still prefer to install it. Nautilus not opening up, showing GLib error Difference between might and could Prove using natural deduction $((P \land Q) \rightarrow R) \vdash (P \rightarrow R) \lor (Q\rightarrow R)$ How do I prove the following using Natural Deduction?  $$((P \land Q) \rightarrow R) \vdash (P \rightarrow R) \lor (Q\rightarrow R)$$   My current approach:  So instead of proving $(P \rightarrow R) \lor (Q\rightarrow R)$, I figure I just need to prove $(P \rightarrow R)$ and use disjunction introduction.  The problem is my hypothesis requires $P$ and $Q$. How do I "create" this Q? I tried using the Law of the Excluded middle, but it does not seem to work.  Any help or insights is deeply appreciated. Often (via Google Now, or when searching for a solution to some problem), I'll open a question from a non-favourite site in the app. Sometimes, I'd like to see what else is going on in the site where the question was posted. Currently, I have one of two ways:   Via tag icon:   Click one of the tag icons beneath the title Delete the [tag] text (at which point, thankfully, the sorting changes to Active from Votes).  Via manually searching for the site, which is more cumbersome. I type in hard and Hardware Recommendations is the fourth entry (below Ask Different, Raspberry Pi and Arduino)! This more annoying for meta sites, where I have to pick Meta from the dropdown menu.   Can I pretty please have a way to head to the site directly from the question? Maybe:   the site name in the top bar could become clickable and lead to the site, or an option in the More menu?     This would be especially useful for Meta sites, where questions posted around the same time could be related. Interestingly enough, most questions that Google Now are for metas of sites I visit on occasion, but haven't pinned to the list. As , the retag privilege serves a lot more confusion and a lot less of its benefit due to the suggested edit system. It must be done away with. It will be done away with. ♪  In light of this decided course of action, we're going to need a new snack for the road between "Create Tags" at 300 reputation and "Established User" at 1000 reputation. We'd like your help in thinking about some ideas on what would be a nice privilege to sit at this level. Since we're... a bit dry on our end.  The primary guideline in deciding what kind of privilege to put here is acknowledging its position in the overall hierarchy of privileges. 500 reputation is an early-intermediate user, one who has started to really get the hang of the site and its function. It can be something that provides convenience in how they currently can act on the site, or it could be some new functionality that fits as an early ability (especially considering there's no new abilities until 2000 reputation's "Edit Everywhat" ability).  I look forward to hearing what creative ideas y'all can provide. Does everything with mass or energy have a gravitational pull? Proving $\, a^b = (a\bmod n)^b\, \pmod{\!n}\ $ [Congruence Power Rule] I am working on a problem I am pretty close to solving but I can't figure out the last part. I used some algebraic manipluation to break the problem down. The problem is:     Show that the following congruence is true      a^b = ((a mod n)^b) (mod n)      for any positive integers a, b, and n.      Hint: Number a can be written as a = q*n + r, where q = floor brackets a/n, and r = a mod n.   My attempt it:     (q*n +r)^b = ((a mod n)^b) * (mod n)      (q*n)^b + (a mod n)^b = ((a mod n) ^b) * (mod n)      (a)^b -(r)^b = ((a mod n) ^b) * (mod n)      (a)^b = modn  ----> divided by ((a mod n)^b)   Am I doing this correctly and if so how can I prove this is true? Is there a trick I am missing? I think that by simplifying it further I would just keep going in a loop.  Thanks! This question is pretty simple: I'd like to have the possibility to get the exact size of a picture in LaTeX with, for example, the macro \the.  In fact, I've founded the way \settoheight{} and so on, but it didn't work at all. What I've got doesn't match with what I can see in the image properties (I suppose that's the name in English). The result: 8pt versus 1300 pixels. It's may be a mis-use...  Edit: In the end, my aim was to find a way to fit the picture in LaTeX. If width and height were both less than the dimensions of the body, then it should just be centred. It look like this :     Require:   \usepackage{graphicx} \usepackage{xifthen} \usepackage{calc}   Code (pretty ugly, I agree):   % Centrering+fitting for image, with captation and label (not auto) \newlength\imageheight \newlength\imagewidth \newcommand{\pic}[3]{% \settoheight\imageheight{\includegraphics{pictures/#1.png}}% \settowidth\imagewidth{\includegraphics{pictures/#1.png}}% \ifthenelse{\lengthtest{\imagewidth &gt; \textwidth}}{\ifthenelse{\lengthtest{\imageheight &gt; \imagewidth}}{\par\vspace{0.95em}% \begin{figure}     \centering\includegraphics[height=0.85\textheight]{pictures/#1.png}     \caption{#2}     \label{#3} \end{figure}% \par\vspace{0.95em}}{\par\vspace{0.95em}% \begin{figure}     \centering\includegraphics[width=0.95\textwidth]{pictures/#1.png}     \caption{#2}     \label{#3} \end{figure}% \par\vspace{0.95em}}}{\ifthenelse{\lengthtest{\imageheight &gt; \textheight}}{\par\vspace{0.95em}% \begin{figure}     \centering\includegraphics[height=0.85\textheight]{pictures/#1.png}     \caption{#2}     \label{#3} \end{figure}% \par\vspace{0.95em}}{\par\vspace{0.95em}% \begin{figure}     \centering\includegraphics{pictures/#1.png}     \caption{#2}     \label{#3} \end{figure}% \par\vspace{0.95em}}}} %   To use it : put your png files in a "pictures" directory, then, just simply call the picture like this : \pic{name_whitout_extension}{Captation_if_needed}{Label_if_needed}.    Edit 2 :   Thanks to Martin Scharrer's easyfig package, I've got a more or less 1,6 times faster solution to put my pictures, centred, with the perfect size.  CTAN:   VC:   Version v1.2 – 2012/05/15    This could be useful for some others, I hope. I have been playing around with Ubuntu installing new themes and and docks. Sometimes during the installation, whole screen just hangs. What is the best way in Ubuntu to Kill a process/application? Anything similar to Ctrl + Alt + Del of windows? Let $H$ be a subgroup of $G$ with $[G:H]=n$ and $G$ finite.  Let $G$ act on left cosets of $H$ by left multiplication.  Let $N$ be the kernel of the action.  Show that $[G:N]$ divides $n!$.  Ok so I have a theorem that says that if $G$ is simple then it embeds into $S_n$.  So if $G$ is simple than I'm done because $G$ divides $n!$ and thus $N$ divides $n!$ and hence $[G:N]$ divides $n!$.  Now I also know that $N$ is the largest normal subgroup of $G$ contained in $H$.  Thus if $G$ isn't simple then it contains some non-trivial normal subgroup $K$ and thus $K\cap H$ is normal in $H$ and by the 2nd Iso Theorem $H/K\cap H\cong KH/H$...    As you can see I'm not sure where to go from here. I was hoping to prove that $K\cap H$ wasn't trivial and thus that $N$ couldn't be trivial since it must contain $K\cap H$, but I'm not sure I can, and even if I could I'm not sure that would help me in showing that $[G:N]$ is small enough to divide $n!$.  Can anyone give some guidance?  Thanks. Minimum Length Regular Expression