I've been trying to find the name of a movie.  It was a horror from the 80's most likely.  There was a bad guy that would transform into a werewolf like creature.  The protagonist was a young male about 18 years old.  I only caught the last 20-30 minutes of the movie.  The boy and his family (no dad that I remember) were hiding out in a cabin in the woods.  He was preparing for the bad guy to arrive by making molotov cocktails and other homemade weapons.  He also wields a lever action rifle.  Eventually, the bad guy shows up in his car, transforms, some molotov cocktails were thrown, the werewolf is injured, and the kid tracks him into the woods and kills him.  Anyone have any idea what movie this is?
For years I've been trying to find this movie I saw on TV once.  I only saw the end.  It featured a teenage boy (about 18 years old) and his family hiding out in a cabin.  The kid is making molotov cocktails and preparing for something.  Sure enough two bad guys show up and I think one of them had a golden pistol.  They start fighting and one of the guys turns into a werewolf type creature.  The kid wounds it and tracks it through the woods to finish it off with his lever action rifle.  Anyone know the name of this movie?  I saw this probably mid to late 90s.  I'm guessing it was an 80's American film. It was live action.
Moving a doorbell transformer Can a doorbell transformer that is on the outside of a wall be place inside the wall behind the drywall. I’m concerned about it getting too hot. Mine is in the kitchen by the ceiling lights Restrictive vs Non-restrictive Relative Clause Can you tell me the difference in the meaning of the two sentences below?  As a defining relative clause.     The location which was called Central Park was a park in New York.    As a non-defining relative clause.     The location, which was called Central Park, was a park in New York. multisite: allow only specific users to update sites Selecting the size of a System.Drawing.Icon? Compilers and argument order of evaluation in C++ Equation of a line maintaining equal ratio distance between two points. Say I have two points. One at $A = (0, 0)$ and another at $B = (0, 10)$. I wish to derive an equation for a line that, for any point $P$ on the line, would equal a set ratio for the distance $P$ to $A$ and $P$ to $B$.  This is easy if the predetermined ratio for $A:B$ is $1:1$. I would create a line from $A$ to $B$, find its midpoint, then create an orthogonal line at the midpoint. Then at any $P$ on the line I know that the ratio distances from $P$ to $A$ and $B$ will be $1:1$.  But what if the ratio for $A:B$ is something like $11:18$?  This is for a positioning algorithm I am implementing - not for homework :)  EDIT: Note - If an exact formula is not possible, an approximation of the line out to $\pm 200$ from $A$ or $B$ is acceptable as values further from $A$ and $B$ will not be utilized anyway. A linear equation for the final result/approximation is ideal for speed in running multiple computations. Suppressing addition of blank page before figure when wrapping long JPEG image I have the following LaTeX file, whose sole purpose is to wrap a JPEG file. This file does not convert well to PDF, so I'm using this unorthodox technique to convert it.  \documentclass{article} \usepackage[pdftex]{graphicx} \pagenumbering{gobble} \begin{document}  \centering\includegraphics[height=650pt]{foo.jpg} \end{document}   This produces a PDF file including the document, but it first includes a blank page, and thus produces a 2 page document, rather than a 1 page document. How do I get rid of this blank page? Using \textheight instead of 650pt as an argument to \includegraphicsmakes the  problem go away, but I'd prefer the larger size I get from using 650pt.  Here is the relevant information from the log file.  &lt;foo.jpg, id=1, 162.6075pt x 1165.35374pt&gt; File: foo.jpg Graphic file (type jpg)  &lt;use foo.jpg&gt; Package pdftex.def Info: foo.jpg used on input line 14. (pdftex.def)             Requested size: 90.6998pt x 650.0pt.  [1  ] Overfull \vbox (100.0pt too high) has occurred while \output is active []   [2 &lt;./foo.jpg&gt;] (./foo.aux) )    I'd prefer to not make the actual document public. Therefore the code above is not a MWE. However, if anyone has tips on how to create a dummy JPEG of the same size, let me know. I am trying to remove all files and subdirectories in a directory. I used rm -r to remove all files, but I want to remove all files and subdirectories, excluding the top directory itself.  For example, I have a top directory like images. It contains the files header.png, footer.png and a subdirectory.  Now I want to delete header.png, footer.png and the subdirectory, but not images.  How can I do this in linux? Linux kernel update stuck I just installed a new kernel on Ubuntu GNOME 17.04 that came in through the normal updates. However, it is now stuck for a while on the following line:  Setting up linux-headers-4.10.0-20-generic (4.10.0-20.22) ... Examining /etc/kernel/header_postinst.d. run-parts: executing /etc/kernel/header_postinst.d/dkms 4.10.0-20-generic /boot/vmlinuz-4.10.0-20-generic   Something seems to hang the process. Does someone know what could cause this?  EDIT: This is the content of /boot as requested:  abi-4.10.0-19-generic     grub                          System.map-4.10.0-19-generic abi-4.10.0-20-generic     initrd.img-4.10.0-19-generic  System.map-4.10.0-20-generic config-4.10.0-19-generic  memtest86+.bin                vmlinuz-4.10.0-19-generic config-4.10.0-20-generic  memtest86+.elf                vmlinuz-4.10.0-19-generic.efi.signed efi                       memtest86+_multiboot.bin      vmlinuz-4.10.0-20-generic   EDIT 2: Just tried purging the new kernel but got this:  E: dpkg was interrupted, you must manually run 'sudo dpkg --configure -a' to correct the problem.   Using that command returns me to the original problem. I am stuck now :( Why is the set of commutators not a subgroup? Disk space full but logical space available in database We have a fairly big MS SQL 2008R2 database that resides on a SSD drive. The drive itself only has ~110Gb of space, and the database files are the only files on the drive.  The database is in "Simple" recovery mode, and only has two files, .MDF and .LDF.   The disk is now nearly full: the MDF is currently 109Gb in size. However, SSMS tells me there's nearly 18Gb of "Space Available" (in the 'General' properties page), and if I go through the motions of Shrinking the file it also tells me there's 18Gb of space free. SSMS also tells me the database size is around 132Gb, which surprises me - that wouldn't fit on the drive!  From what I've read, shrink is a really bad idea. However, I'm starting to see replication errors (could not allocate space for object). We've previously tried shrinking the database, but within a few hours the file was back to it's original size.  How should we proceed - given there's apparently 18Gb of free space, should SQL automatically use that free space? Or is it as simple as: we really need more disk space? Why did R.A.B. put the locket back in the basin? led me to asking this one. R.A.B. takes the "real" locket out and asks Kreacher to destroy it, then puts the "fake" locket back in the basin. Why would he feel the need to do this? He knows already that Voldemort has used someone else to drink the potion (Kreacher). In fact Kreacher's story to him about his mistreatment on the island seems to push him over the edge to act.   Instead of assuring that someone else (most likely innocent like Kreacher) would have to drink from the basin, why not just leave the note outside the basin for someone to find? If Voldemort finds it then so be it, at least then no presumably innocent person would have to drink again. Fields finitely generated as $\mathbb Z$-algebras are finite? Suppose $k$ is a field that is finitely generated as a ${\mathbb Z}$-algebra.  (That is, $k$ is a quotient of ${\mathbb Z}[X_1,\dots,X_n]$ for some $n$). Does it follow that $k$ is finite? Rerouting stdin and stdout from C Show that $xy=0$ is a variety but not a manifold How to prove $\int_{-\infty}^{+\infty} f(x)dx = \int_{-\infty}^{+\infty} f\left(x - \frac{1}{x}\right)dx?$ If $f(x)$ is a continuous function on $(-\infty, +\infty)$ and $\int_{-\infty}^{+\infty} f(x) \, dx$ exists. How can I prove that $$\int_{-\infty}^{+\infty} f(x) \, dx = \int_{-\infty}^{+\infty} f\left( x - \frac{1}{x} \right) \, dx\text{ ?}$$ The  contains a link to the new code of conduct,  . As of 2018-08-07T05:27:38+00, . Also, I cannot find any other link to the conduct yet, neither in the help center, nor in the site navigation, which is a bummer, given that we're invited to read the new CoC:     Really, please, take a moment to read the new Code of Conduct now. It’s not long, it’s not wordy-and-legalese-y and in our long held tradition, we feel that it does a good job of assuming that the vast majority of folks that use our sites always have the best intentions at heart.    Is the code of conduct not yet published?  Edit: As mentioned in the comments,  announces the conduct and links to , so maybe it's not public yet? Can we move "Start a bounty" to a more intuitive location? A 64-bit double can represent integer +/- 253 exactly. Given this fact, I choose to use a double type as a single type for all my types, since my largest integer is an unsigned 32-bit number. But now I have to print these pseudo integers, but the problem is they are also mixed in with actual doubles. So how do I print these doubles nicely in Java? I have tried String.format(&quot;%f&quot;, value), which is close, except I get a lot of trailing zeros for small values. Here's an example output of of %f  232.00000000 0.18000000000 1237875192.0 4.5800000000 0.00000000 1.23450000  What I want is:  232 0.18 1237875192 4.58 0 1.2345  Sure I can write a function to trim those zeros, but that's lot of performance loss due to string manipulation. Can I do better with other format code?  The answers by Tom E. and Jeremy S. are unacceptable as they both arbitrarily rounds to two decimal places. Please understand the problem before answering.  Please note that String.format(format, args...) is locale-dependent (see answers below). I am a newbie in combinatorics and still don't have enough tools to handle this kind of problems.  Assuming I have a set of integers: $ \{1,2,3,4,\dots,n\} $  In how many ways, can I choose $k$ numbers out of those $n$, such that none of them are consecutive?  For instance, for the following set $ \{1,2,3,4,5\} $  For $ k=3 $ I have only 1 option: $\{1,3,5\}$  My purpose is first of all to understand the way you would think about this  problem, not necessarily the solution itself (I have the final answer for it).  Thanks.