Minecraft Bukkit Server - Only spawn zombies
How do you spawn ONLY zombies in Singleplayer?
I need to process a large file, around 400K lines and 200 M. But sometimes I have to process from bottom up. How can I use iterator (yield return) here? Basically I don't like to load everything in memory. I know it is more efficient to use iterator in .NET. All-in-One Event Calendar: Custom Query - Getting each event Instance Is it possible to browse the internet from a laptop so that the web sites you visit think you are browsing from a mobile device?  Say I need to connect via a very low bandwidth connection and just using the mobile version of the site is sufficient?  Currently I'm using Vista and Firefox 3.5 Installing MinionPro fonts on Ubuntu 10.04 running TexLive 2012 I followed the instructions to install MinionPro fonts from this website.   However, when I tried to run the tex file at the bottom, I have this error message:  ! LaTeX Error: File `MinionPro.sty' not found.   Running the command kpsewhich MinionPro.sty gives the following output:  /usr/local/share/texmf/tex/latex/MinionPro/MinionPro.sty   So the system knows where MinionPro.sty is, so why can't the file compile? $ d = \gcd(a,b)\Rightarrow\ \gcd(a/d,b/d) = 1$ Could someone please help me with this proof?     Suppose that $a, b \in N$, and $d = \gcd(a, b)$. Since $d$ divides $a$, we have $a = de$ for some integer $e,$ and similarly $b = df$ for some integer $f$. Prove that $\gcd(e, f) = 1$.   I understand why it works. Since d is all the common factors of $a$ and $b, e$ and $f$ had no common factors, therefore the $\gcd(e,f) = 1$. But how do I prove this?  Thanks in advance. If $n$ is a natural number $\ge 2$ how do I prove that any graph with $n$ vertices has at least two vertices of the same degree? Any help would be appreciated.  If $n$ is a natural number $\ge 2$ how do I prove that any graph with $n$ vertices has at least two vertices of the same degree? I have a generic method with this (dummy) code (yes I'm aware IList has predicates, but my code is not using IList but some other collection, anyway this is irrelevant for the question...)  static T FindThing&lt;T&gt;(IList collection, int id) where T : IThing, new() {     foreach T thing in collecion     {         if (thing.Id == id)             return thing;     }     return null;  // ERROR: Cannot convert null to type parameter 'T' because it could be a value type. Consider using 'default(T)' instead. }   This gives me a build error      "Cannot convert null to type parameter   'T' because it could be a value type.   Consider using 'default(T)' instead."   Can I avoid this error? How can I perform a t-test (or another hypothesis test) on NPS (Net Promoter Score) results? Here is an explanation of how NPS is calculated:    I'm interested in testing two net promoter scores to determine if they are statistically different. I read a great answer to calculating margin of error for NPS (see link below), but I'm really interested in testing to see if there is a difference between two scores, because I suspect that our results aren't as "different" from year to year as they appear to be.    Is this at all possible? I understand t-tests are typically used to test whether two different record sets are statistically different. But is it possible to test Net Promoter Scores, either with a t-test or some other hypothesis test?  Any ideas you have would be a great help. Thank you! Found a similar question , but with some minor differences. Is it archaic to use have you in sentences such as this:     John : I think we can see it with a specially crafted telescope.   Mary : Have you such a telescope?   instead of     Mary : Do you have such a telescope?   Is it still used in official and casual conversations? How can I get a brace on the right, not the left, to group cases, using cases? (I know actual cases look better with the brace on the left, but the items I need to group are not literally cases. They are a set of steps in an algorithm which I want to consider as an item.)  The following puts the brace on the left. All I need to do is to flip it to the right.  \begin{align} \begin{cases} a&amp;=bbb\\ c&amp;=ddddddd\\ e&amp;=ffffffffff \end{cases} \end{align}   Thanks for any help with this! Interesting property of finite integer sequence with sum 1 Can a magnetic field be induced without an electric field? Because, as far as I know, a time varying electric field induces a magnetic field an vice versa.  But in the case of conductors carrying currennt, it doesn't seem that electric field varies with time, then how is a magnetic field induced? Past participle form of "exit"? I have noticed this on many different Windows machine, on many different occasions: the RAM usage reported by Task Manager or Resource Monitor often seems to add up to an amount which is significantly lower than the actual amount in use.  For example, many times on my laptop or my desktop, I have seen something like 7GB in use, and yet the total of the Working RAM Set is more like 3GB. I just can't figure out where it's being used!  Here's an extreme example I noticed today in Resource Monitor on a server:    If you right-click the image and open in a new tab, and view the numbers, you'll notice that the Working Set (which doesn't include nonphysical virtual memory) add up to about 1.7GB. I get similar numbers by adding up RAM usage in Task Manager when "Show processes from all users" is enabled.  Now here's a screenshot of task manager's Performance tab:    This says 7.6GB of physical memory is in use.  I see this all the time, on personal computers, laptops, and now servers: the total RAM usage reported by system tools only accounts for about 1/4 of the RAM usage I observe. WTF is going on???  Is there any satisfying explanation of where all my RAM is? What is gobbling it up, and why is it leaving no trace?  EDIT: Here's a picture of the graphical RAM use, as user whs asked for:    EDIT 2: In response to James' response, here's a picture of the nonpaged processes in poolmon.exe, sorted by size:    These results confuse me. poolmon correctly states that I have 6GB of nonpaged pool in use, but all the nonpaged pool processes are less than 8MB in size.  What could this mean? Is poolmon failing to detect some of the processes using the nonpaged pool? Extension fields isomorphic to fields of matrices Suppose $K \subset L$ is a finite field extension of degree $m$. Is it true that there exists some natural $n$ such that $L$ is isomorphic to a subfield of $M^{n\times n}(K)$, the ring of $n\times n$ matrices with entries in $K$? What is the smallest dimension (as a function of $m$) for which an isomorphism exists?  The example I had in mind was the 2-dimensional extension $\mathbb{R} \subset \mathbb{C}$ with $\mathbb{C}$ being isomorphic to $\{ \begin{pmatrix}a&amp;-b\\b&amp;a\end{pmatrix} : a, b \in \mathbb{R}\}$. Fan is always on, CPU usage is rather low and can't find the fan or thermal_zone proc files I have an Asus N76VB notebook with Ubuntu 14.04 and TLP for power managment. However, the fan is always on. It's not really loud, but it's annoying. My CPU usage is around 1-2%. It's clocked at 1.20 GHz.  I've added acpi=force to my boot parameters but it doesn't change anything.  /proc/acpi/fan: No such file or directory /proc/acpi/thermal_zone: No such file or directory   I've loaded all Asus ACPI modules.  lsmod | grep asus:  asus_nb_wmi            16990  0  asus_wmi               24191  1 asus_nb_wmi sparse_keymap          13948  1 asus_wmi video                  19476  2 i915,asus_wmi wmi                    19177  2 mxm_wmi,asus_wmi   Somehow, it can read the temperatures.  sensors:  acpitz-virtual-0 Adapter: Virtual device temp1:        +43.0°C  (crit = +108.0°C)  coretemp-isa-0000 Adapter: ISA adapter Physical id 0:  +44.0°C  (high = +87.0°C, crit = +105.0°C) Core 0:         +44.0°C  (high = +87.0°C, crit = +105.0°C) Core 1:         +42.0°C  (high = +87.0°C, crit = +105.0°C) Core 2:         +39.0°C  (high = +87.0°C, crit = +105.0°C) Core 3:         +39.0°C  (high = +87.0°C, crit = +105.0°C)  asus-isa-0000 Adapter: ISA adapter temp1:        +43.0°C     I really hope someone knows how to solve this. Almost all information I could find was about saving power to create less heat.    I got Intel and NVIDIA (GeForce 740M) graphics but I'm almost anytime on Intel.  $ sudo lshw -c display   *-display                       description: VGA compatible controller        product: 3rd Gen Core processor Graphics Controller        vendor: Intel Corporation        physical id: 2        bus info: pci@0000:00:02.0        version: 09        width: 64 bits        clock: 33MHz        capabilities: msi pm vga_controller bus_master cap_list rom        configuration: driver=i915 latency=0        resources: irq:43 memory:f7400000-f77fffff memory:d0000000-dfffffff ioport:f000(size=64)     fwts fan: "An error occurred when reviewing this item" On approving an edit, I just get this pop up since morning. At first I thought there might be some internet connection issue, but this is now the 3rd to 4th time I got the same error; also, the review is accepted because on refresh I can see my name with approved text beside, but it still throws this error.    I am on a Windows 7 machine, running Firefox 24 (Icognito/Private Mode)    Also, this happens only when edit(1) is written on an question/answer, I don't go to review queue and approve, these reviews were directly loaded from the notification beneath the question/answer.  Martijn Pieters reproduced the problem from the review queue three times; each time the improve option was picked, accepting the suggested edit but editing the post some more. The network console shows that posting to https://stackoverflow.com/review/task-reviewed fails, the server responds with a 404 error:  Request headers: POST /review/task-reviewed HTTP/1.1 Host: stackoverflow.com Connection: keep-alive Content-Length: 137 Accept: application/json, text/javascript, */*; q=0.01 Origin: http://stackoverflow.com X-Requested-With: XMLHttpRequest User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10_7_5) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/31.0.1650.63 Safari/537.36 Content-Type: application/x-www-form-urlencoded DNT: 1 Referer: https://stackoverflow.com/review/suggested-edits/3575396 Accept-Encoding: gzip,deflate,sdch Accept-Language: en,en-US;q=0.8,nl;q=0.6,nb;q=0.4,no;q=0.2,de;q=0.2,fr;q=0.2 Cookie: &lt;redacted&gt;  POST data: taskTypeId=1&amp;reviewTaskId=3575396&amp;taskResultTypeId=5&amp;fkey=f8791a329b445b658876f4d3afe7961e&amp;postCommentId=null&amp;taskResultSubtypeFlags=null  Response headers: HTTP/1.1 404 Not Found Cache-Control: private Pragma: no-cache Content-Type: application/json X-Frame-Options: SAMEORIGIN Date: Fri, 13 Dec 2013 12:04:53 GMT Content-Length: 0   On the  itself, no record is made of the accept; instead the suggested edit is recorded as approved by 3 people not including Martijn Pieters. In this case the improve review arrived too late.  In , improve again resulted in the error, but the Community account is shown rejecting the edit. I have a proof and need some feedback. It seems really obvious that the statement is true but it is always the obvious ones that are a little trickier to prove. So I would appreciate any feedback. Thank you!  Here is what I am asked to prove:     If $n$ is composite then $(n-1)! \equiv 0 \pmod n$.   Proof:  $n$ is composite $\implies n=ab$ where $a,b \in \mathbb{Z}$ and $0&lt;a,b&lt;n$.  Case 1: If $a=b$ then $n=a^{2}$. Now $n \mid (n-1)! \implies a \mid (n-1)!$, so $$\begin{aligned} (n-1)! &amp;\equiv 1\times 2\times \dotsb \times a \times\dotsb\times (n-a)\times\dotsb\times (n-1) \\ &amp;\equiv 1\times 2\times \dotsb\times a \times\dotsb\times -a\times\dotsb\times -1 \\ &amp;\equiv 0 \pmod n \end{aligned}$$  Case 2: $0&lt;a&lt;b&lt;n$.  Then, since $a \mid n$, $b \mid n$ and $n \mid (n-1)!$ we have that $a \mid (n-1)!$ and $b \mid (n-1)!$.  So this implies $(n-1)! \equiv 1\times 2\times \dotsb\times a \times\dotsb\times b\times\dotsb\times (n-1) \equiv 0 \pmod n$, Q.E.D. Are there tips and tricks for people with fear of flying that can makes them have a more pleasant experience when flying? I know drugs can do magic, and . I'm ideally after official advice and recommendations, but other tips and tricks would be nice as well. How to get GNOME Shell "Applications overview" to show the full name of applications