centos patch heartbleed bug
How do I recover from the Heartbleed bug in OpenSSL?
Modify TikZ coil decoration Can I modify the existing tikz coil decoration, so that the downstrokes are not drawn in a certain interval, to produce a picture like this?    Edit: Previous attempts, code and MWE has been moved to or superseded by my own answer. There is a way to add custom split normal use Python API? I can't find a way to achieve custom split normal effect. I want to use python (mesh normal/hard edge or soft edge) data collected from Maya then write to Blender mesh.    How to do it using the following Python API and how?  bpy.data.meshes[objName].normals_split_custom_set_from_vertices  bmesh module How is hotness score calculated at larger sites? To start with, I am aware that hot questions from larger sites are somehow "penalized" and :     This is designed to ensure that a single site doesn't dominate the list, and that users see a good sampling of questions that are likely to interest them throughout the network...   I would like to understand how is hotness score really calculated at these sites. The reason why I ask is that per my observations, this seems to be quite different than is documented in the . Specifically, I would like to understand the difference in the impact of answer(s) score and aging factor.  Regarding impact of answers score, my observations of hot questions from smaller sites appear to be in agreement with known formula: (MIN(AnswerCount, 10) * QScore) / 5 + AnswerScore. For example, a question with low score (+1, +2) can get into hot list if it has got answer(s) with sufficiently high score.  At larger sites, this doesn't seem to be the case. Say, it looks like Stack Overflow questions just don't enter hot list until they reach certain score (+6,+7), no matter how many answers are there and how high is their score.  Does system simply totally ignore answers until question reaches certain score?  Another thing I noticed is that questions seem to age away from the hot list 2-3 times faster than ones from smaller sites (having comparable question and answers scores). Granted, this is harder to track and I am not yet sure if I figured that correctly. Do larger sites questions age away faster than those from smaller sites?    For those interested, here is a (partial) list of example questions I studied before asking this: , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , .  Although above examples are only from Stack Overflow, my question isn't (I only used it as an example of a large site in my studies). I would like to understand if hot questions from other larger sites are handled in a similar way. $T$ self-adjoint on Hilbert space $H$, $T^n=T^{n+1}$ will $T$ be an orthogonal projection operator? I have seen several answers and proofs here at MSE that a self-adjoint operator $T$ on a Hilbert space $H$ where $T^2=T$, implies $T$ being an orthogonal projection operator.   The thought struck me; what would happen if the condition $T^2=T$ is replaced by $T^3=T^2$ or instead by $T^4=T^3$ or why not more generally by $T^n=T^{n+1}$ for some $n\in\mathbb{N}$? Would this still imply $T$ to be an orthogonal projection operator?  I guess someone must have thought of this before me? In that case perhaps there is a reference in the literature for this or perhaps the proof is way simpler than I might expect? I know that SZ0 makes vertices straightened on the z-axis, but I'm wondering if there's a way to make vertices into a complete circle on the z-axis with a hotkey? Zip all files in directory? Geometric solution to find a Set of totally ordered Subsets of $ \mathbb{N} $ is uncountable My question is, does there exist a set of subsets of the naturals, $S$, such that $S$ is uncountable, where for any two subsets $A,B \in S$ we have either $A \subset B $ or $B \subset A $?  Initially my thoughts were that we could construct a chain $A_{1} \subset A_{2} \subset \cdots $ and find a bijection by picking out one element which is 'new' to each set by axiom of choice and so we have bijected to a subset of naturals, however I'm not convinced this fully works.  Furthermore, I was thinking there may be a nice elegant solution by looking for such a set in either $ \mathbb{Q}^2 $ or $ \mathbb{Z}^2 $ for example, but any attempt seems to fail due to the 'ordering' part of the question. I need to generate random numbers within a specified interval, [max;min].  Also, the random numbers should be uniformly distributed over the interval, not located to a particular point.  Currenly I am generating as:  for(int i=0; i&lt;6; i++) {     DWORD random = rand()%(max-min+1) + min; }   From my tests, random numbers are generated around one point only.  Example min = 3604607; max = 7654607;   Random numbers generated:  3631594 3609293 3630000 3628441 3636376 3621404   From answers below: OK, RAND_MAX is 32767. I am on C++ Windows platform. Is there any other method to generate random numbers with a uniform distribution? Proving that if $|f''(x)| \le A$ then $|f'(x)| \le A/2$ Suppose that $f(x)$ is differentiable on $[0,1]$ and $f(0) = f(1) = 0$. It is also   known that $|f''(x)| \le A$ for every $x \in (0,1)$. Prove that   $|f'(x)| \le A/2$ for every $x \in [0,1]$.   I'll explain what I did so far. First using Rolle's theorem, there is some point $c \in [0,1]$ so $f'(c) = 0$.  EDIT: My first preliminary solution was wrong so I tried something else. EDIT2: Another revision :\  I define a Taylor series of a second order around the point $1$: $$ f(x) = f(1) + f'(1)(x-1) + \frac12 f''(d_1)(x-1)^2 $$ $$ f(0) = f(1) + f'(1)(-1) + \frac12 f''(d_1)(-1)^2 $$ $$ |f'(1)| = \frac12 |f''(d_1)| &lt;= \frac12 A $$  Now I develop a Taylor series of a first order for $f'(x)$ around $1$: $$ f'(x) = f'(1) + f''(d_2)(x-1) $$ $$ |f'(x)| = |f'(1)| + x*|f''(d_2)|-|f''(d_2)| \leq \frac{A}{2} + A - A = \frac{A}{2} $$  It looks correct to me, what do you guys think?  Note: I cannot use integrals, because we have not covered them yet. AppFabric / WF 4.0 instances stuck despite no bookmark and pending timer How do the definitions of "irreducible" and "prime" elements differ? Difference between focusin/focusout and focus/blur, with example I downloaded the iso file for XUbuntu. I created a live usb using Pen Drive Linux. I turned on my computer, booted to the XUbuntu installation screen, and selected "check disk for defects".  A minute later, it says that it found one defect. How do I figure out what this defect is? Prove $\sum_{k = 0}^{n}(-1)^{n - k} \binom{n}{k} \cdot k^n = n!$ and $\sum_{k = 0}^{n}(-1)^{n - k} \binom{n}{k} \cdot k^m = 0$ Prove $$\sum_{k = 0}^{n}(-1)^{n - k} \binom{n}{k} \cdot k^n = n! \qquad\text{and}\qquad \sum_{k = 0}^{n}(-1)^{n - k} \binom{n}{k} \cdot k^m = 0,$$ where $m \in \{0, 1, 2, \cdots, n - 1\}$.  To be honest, I tried to use some combinatorial ideas but was not able to see interconnections. Also, I had an idea to prove it using induction but failed to do that either. Help will be much appreciated! I just got stuck and don't see any continuation of solution for this problem Let's say a 10N cube (in air, on Earth) rests flat on a scale at the bottom of a tank of water, and the scale reads 8N, so there is 2N of buoyant force on the cube.  How does the buoyant force manifest itself on the cube?  I assume the force is normal to the surface of the scale, but if there isn't any water under the cube, how does the water push up on the cube? I am studying elementary Algebraic Topology recently. I have seen that a topological space is identified with a group. We are telling the group as Fundamental Group. So every topological space $X$ and for any $x \epsilon X$ there is a fundamental group $\pi_1 (X,x)$. I have a question about the converse. If we consider any arbitrary group $G$, then does there exist a topological space $X$ and an element $x\epsilon X$ such that $\pi_1 (X,x)=G$? I did not create a swap partition during Ubuntu installation.  Later, I freed up some space and made a swap partition.  Now after each boot up, I am manually opening gparted to right-click the swap partition to turn on the 'swapon' option.  How can I automatically enable the swap partition at boot?  Also, if I had not created the swap partition, what are my other options? Why is the Star Trek 2009 reboot called a reboot? It is common for public Wi-Fi access points to include login pages, even at times, when they’re free (i.e. Starbucks, many airports, hotels, etc).  I’m often in a situation where I’ll open up Chrome/Firefox, with and all my previously open tabs will start to reload.  If there is a wireless login redirection page, however, every tab is redirected and reloaded and the previous page is lost from history (and the back button won't return to it).  Is there any way to avoid or circumvent this behavior? Learn Bayesian inference applied to astronomy / astrophysics? I'm looking for resources (books, articles, sites, etc.) to learn about Bayesian inference, but specifically applied to astronomy and astrophysics.