How is arterial blood spray filmed?
How do they film continuous blood pooling?
I know you can select a tag and then click on unanswered to view the unanswered questions for that tag.  But is there a way to view questions only for a certain set of tags > 1 tag?  Mainly I'd like the union of tag1 with tag2 with tag3 with tag4. But also the intersection of tags would be nice as well. Ruby -- capitalize first letter of every sentence in a paragraph Acne underneath skin Introduction  Okay, I've almost won my war. The battle, its almost won... However, I must still claim victory in my final battle. The battle against the little enemies, the ones that have fought with my blade of benzoyl peroxide every single day.  Problem  Through spot treatments I have been able to fell every single one of these spots, but only the ones on my face. I've been using a spot treatment with benzoyl peroxide in, which has worked really well for me. However, my issue comes here:     There are spots underneath my skin, I think. The areas where they come through are a bit red.   So, because there is still slightly red skin on my face, and I think this is causing my acne to constantly return. I need to stop this, and end my war once and for all.  What I've tried   Washing my face with a rag and sponge every day, three times a day Changing my pillow case every day Using a benzoyl peroxide spot treatment Minimizing how much I touch my face Not interfering with the spots with my fingers, not picking at them, not playing with them. Just letting spot creams eradicate them.   Conclusion  Seriously, this driving me up the wall. I spot cream in the evening, by the time tomorrow has ended and its time for a shower, they've all come back. Its like they're coming in waves, damn waves! I must put an end to this.  So, how can I prevent acne from coming back within the space of a single school day? How can I get rid of these once and for all? What types of measures could I try? I have no reason to visit my doctor, its only acne, but I have no idea what I can try now.  Is there even a point in me trying? I acknowledge that I am a teenager, but no others that I know seem to have acne/spots like I do. Examples of patterns that eventually fail Often, when I try to describe mathematics to the layman, I find myself struggling to convince them of the importance and consequence of "proof". I receive responses like: "surely if Collatz is true up to $20×2^{58}$, then it must always be true?"; and "the sequence of number of edges on a complete graph starts $0,1,3,6,10$, so the next term must be 15 etc."  Granted, this second statement is less logically unsound than the first since it's not difficult to see the reason why the sequence must continue as such; nevertheless, the statement was made on a premise that boils down to "interesting patterns must always continue".  I try to counter this logic by creating a ridiculous argument like "the numbers $1,2,3,4,5$ are less than $100$, so surely all numbers are", but this usually fails to be convincing.  So, are there any examples of non-trivial patterns that appear to be true for a large number of small cases, but then fail for some larger case? A good answer to this question should:   be one which could be explained to the layman without having to subject them to a 24 lecture course of background material, and have as a minimal counterexample a case which cannot (feasibly) be checked without the use of a computer.   I believe conditions 1. and 2. make my question specific enough to have in some sense a "right" (or at least a "not wrong") answer; but I'd be happy to clarify if this is not the case. I suppose I'm expecting an answer to come from number theory, but can see that areas like graph theory, combinatorics more generally and set theory could potentially offer suitable answers. 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 / How to run updmap-sys after installing cm-super? My original question was:   The answer that seems suitable to my cause is to install cm-super. I did that (using package manager [winxp 32 bit, MikTex installation 2.9 recently updated]). But still the command  \usepackage{cm-super}    yields an error.  User H Cavendish suggested to run updmap-sys, but I am not sure about how to do that on WinXP.   2011 November 04 edit: I made it sure that I have installed 'cm-super' - but still get the same error:   I have also tried updating the file name databases - but no avail. Let's say it again, we all make mistakes, and I have just made one.  A brief history: I was doing some stuff on a VPS (Debian) I'm renting, when I noticed some strange behaviour. Using the netstat command I saw an non-authorized connection through SSH. I didn't know what to do, so I decided to close his connection using iptables:  iptables -A INPUT -p tcp --dport ssh -s IP -j DROP   But I am tired, and I wrote  iptables -A INPUT -p tcp --dport ssh -j DROP   and I kicked myself (and everyone else) out...  How do I fix this? Why $\sqrt{-1 \cdot {-1}} \neq \sqrt{-1}^2$? Proof that a sequence of continuous functions $(f_n)$ cannot converge pointwise to $1_\mathbb{Q}$ on $[0,1]$ How do you validate that two math expressions are equal? Let's say you have a few expressions like the following:  $$\begin{array}((x+17)^2 \\ x^2 + 34x + 289 \end{array} \\ 288 + \frac{x^2}{2} + \frac{x^2}{2} + 34x + 1 \\ [...] $$  You get the idea: there's an infinite number of ways of representing the same expression. The challenge is that my application is validating answers to math problems, input by math students practicing a certain concept. I'd like to make sure that whenever they submit an answer, the checker is completely insensitive to the issues of ordering, simplification, formatting etc. which would be plain frustrating. I'd also ideally like to support more than one variable such as x, y, z in the same expression.  What's a reliable way to check that two expressions are the same? The most brute force way I can think of would be to just plug a number into each variable of each expression and see what the result is.  I have a hunch however that there might be ways of getting false positives this way. That, and I might be either missing something really obvious about this, or there might be a better way of doing the comparison.  Would love to hear what you think. Schengen Visa Refusal: Justification for the purpose and conditions of the intended stay was not reliable "strlen(s1) - strlen(s2)" is never less than zero What is the formula for percent of frame filled at a specific distance and focal length? How do I create a 50x3 cell array from a 50x3 matrix. Keep just getting a 1x1 cell array with a 50x3 submatrix? Second law of Newton for variable mass systems Frequently I see the expression  $$F = \frac{dp}{dt} = \frac{d}{dt}(mv) = \frac{dm}{dt}v + ma,$$ which can be applied to variable mass systems.  But I'm wondering if this derivation is correct, because the second law of Newton is formulated for point masses.   Furthermore if i change the inertial frame of reference, only $v$ on the right side of the formula $F = \frac{dm}{dt}v+ma$ will change, meaning that $F$ would be dependent of the frame of reference, which (according to me) can't be true.   I realize there exists a formula for varying mass systems, that looks quite familiar to this one, but isn't exactly the same, because the $v$ on the right side is there the relative velocity of mass expulsed/accreted. The derivation of that formula is also rather different from this one.   So my question is: is this formula, that I frequently encounter in syllabi and books, correct? Where lies my mistake. How has the age of the Universe been derived from the observations made by the Planck mission? Incorrectly answered 'No' to "Any previous visa refusals..." on a UK Standard Visitor visa application. How can I fix my mistake? How to generate a random alpha-numeric string I've been looking for a simple Java algorithm to generate a pseudo-random alpha-numeric string.  In my situation it would be used as a unique session/key identifier that would "likely" be unique over 500K+ generation (my needs don't really require anything much more sophisticated).    Ideally, I would be able to specify a length depending on my uniqueness needs. For example, a generated string of length 12 might look something like "AEYGF7K0DM1X". Upgrade OpenSSH 7.4 to later on RHEL I have a Red Hat Enterprise Linux server (7.5 x86_64). I have OpenSSH version 7.4. I was asked to upgrade it to a later version for security reasons: Nessus states that . However the Red Hat software and downloads does not have the latest package RPM.  I found some clues on where to get the latest package for OpenSSH. I found , however, I do not know on how to upgrade it and trust this website. I do not want the SSH and other configuration to be modified by the ugrade.  I did find links but however they are not useful, for example .  I would like to know how to upgrade OpenSSH without using yum. Why aren't we sterilizing N95 masks?