Is there a way to convert string to json object in javascript
Safely turning a JSON string into an object
Give a combinatorial proof: $ n(n+1)2^{n-2} = \sum_{k=1}^{n}k^2\binom{n}{k} $ 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  . QR Codes generation from MySQL rows List or IList Can anyone explain to me why I would want to use IList over List in C#?  Related question: How to install software provided in software-center via terminal? Zombie process using 100% CPU A zombie process, which should not be using any resources (RAM and CPU), is hogging up an entire core on my 8-core 64-bit Ubuntu 11.10 Desktop installation.  This is the output of ps -el|grep Z:  F S   UID   PID  PPID  C PRI  NI ADDR SZ WCHAN  TTY          TIME CMD 0 Z  1000 10317     1 99  80   0 -     0 exit   ?        19:27:15 java &lt;defunct&gt;   ... and here is an excerpt from top:    PID USER      PR  NI  VIRT  RES  SHR S %CPU %MEM    TIME+  COMMAND                                                                                                                                                 10317 deltik    20   0     0    0    0 Z  100  0.0   1170:17 java &lt;defunct&gt;  1424 root      20   0  612m 193m 158m S   14  2.4 287:17.11 Xorg 12580 deltik    20   0  710m 135m  46m S    5  1.7  27:31.07 compiz   This is how the zombie process came to existence:   I opened a Java JAR called . This launcher downloads another JAR file to ~/.minecraft/bin/minecraft.jar That JAR was executing when I locked my computer with xscreensaver. Then, I entered my password to unlock the computer, and I saw that the Minecraft window was frozen. I tried killing it (PID 10317) with gnome-system-monitor. It became a zombie. kill -9 10317 was ineffective. xkill only closed the window titled "Minecraft"; it didn't close the underlying java process.   Relevant information:   The graphics driver is FGLRX, and it has caused notorious issues with  of  and , including sometimes high CPU usage of Xorg and compiz.   I want to know:   What way is there to destroy this process of java without restarting, if any? Why is this issue happening? What can I do to prevent this issue from happening again? Feature request - links underlined Sam developed an annual sweepstakes promotion entitled “The Free Gas Punt Return Game”.    Do I need a comma after entitled or not? "every" vs "each"? Remove "Category:", "Tag:", "Author:" from the_archive_title I have the following code in my theme's archive.php:  &lt;?php the_archive_title( '&lt;h1 class="page-title"&gt;', '&lt;/h1&gt;' ); ?&gt;   This gives me titles like "Category: Russia", "Tag: America", "Author: John".  I would like to remove the "Category:", "Tag:" and "Author:" part and just display the category, tag and author names.  Does anyone know how to accomplish this?  Thank you. I am trying to solve a variation on the .  In this scenario, someone is selecting coupons at random with replacement from n different possible coupons. However, the person is not selecting coupons one at a time, but instead, in batches.  Here's an example problem formulation: There are 100 distinct coupons. A person makes selections in 10-coupon batches at random (each coupon with replacement). What is the expected number of batches necessary to have selected 80 unique coupons?  I have been able to determine the expected number of selections necessary to have selected k unique coupons when selecting one at a time (much like Henry's ), but I'm a bit stumped as to how to go about solving it with this particular wrinkle.  Any tips/guidance would be greatly appreciated. Right-click on Touchpad not working after update to 18.04 LTS Proof of inequality using AM-GM inequality prove that $x^2 + y^2 + z^2 \ge xy + xz + yz$  I tried proving it the way I prove $x^2 + y^2 \ge 2xy$. But it just doesn't seem to work. I tried using AM-GM. Should I be using GM-HM or AM-HM? I really don't know what the problem is and I'd appreciate any help and a full proof explanation. Thanks. How to Make Multi User Objects Single User? The choice field adds a blank option in all my sharepoint lists. How do I remove this? the column settings does not have a blank option. I can't retag or otherwise edit a question while waiting for an edit I reviewed from queue to be approved or rejected Proving that: $\lim\limits_{n\to\infty} \left(\frac{a^{\frac{1}{n}}+b^{\frac{1}{n}}}{2}\right)^n =\sqrt{ab}$ Let $a$ and $b$ be positive reals. Show that $$\lim\limits_{n\to\infty} \left(\frac{a^{\frac{1}{n}}+b^{\frac{1}{n}}}{2}\right)^n =\sqrt{ab}$$ How to run both Intel and Nvidia graphics card driver on dual monitor setup? I'm trying to get Intel and Nvidia graphics card working together with two monitors. One monitor should use the Intel card and the other the Nvidia card. Of course, I want to use only one keyboard and one mouse to switch between both screens. Bumblebee didn't work for me.  I don't want to use the xserver-xorg-video-all package because I need the Nvidia card for gaming and I can't use only one graphics card because I need one for KVM virtualisation and the other one for my Linux desktop  So I tried to install the drivers and to configure the Xserver manually. The Nvidia driver is working and I get a video output. But I don't get a video output with the Intel card.  I followed   The config files: Give an example of three positive integers m, n, and r Can this intuition give a proof that an isometry $f:X \to X$ is surjective for compact metric space $X$? A prelim problem asked to prove that if $X$ is a compact metric space, and $f:X \to X$ is an isometry (distance-preserving map) then $f$ is surjective. The official proof given used sequences/convergent subsequences and didn't appeal to my intuition. When I saw the problem, my immediate instinct was that an isometry should be "volume-preserving" as well, so the volume of $f(X)$ should be equal to the volume of $X$, which should mean surjectivity if $X$ is compact. The notion of "volume" I came up with was the minimum number of $\epsilon$-balls needed to cover $X$ for given $\epsilon &gt; 0$. If $f$ were not surjective, then because $f$ is continuous this means there must be a point $y \in X$ and $\delta &gt; 0$ so that the ball $B_\delta(y)$ is disjoint from $f(X)$. I wanted to choose $\epsilon$ in terms of $\delta$ and use the fact that an isometry carries $\epsilon$-balls to $\epsilon$-balls, and show that given a minimum-size cover of $X$ with $\epsilon$ balls, that a cover of $X$ with $\epsilon$-balls could be found with one fewer ball if $f(X) \cap B_\delta(y) = \emptyset$, giving a contradiction. Can someone see a way to make this intuition work? Does anyone know of any good tools (I'm looking for IDEs) to write assembly on the Mac. Xcode is a little cumbersome to me.  Also, on the Intel Macs, can I use generic x86 asm?  Or is there a modified instruction set? Any information about post Intel.  Also: I know that on windows, asm can run in an emulated environment created by the OS to let the code think it's running on its own dedicated machine. Does OS X provide the same thing?