This anime movie was released late 90s up until 2004.  All I remember of the movie is that the scientists are at a research facility in a snowy and ice covered place, when a band of Americans shows up and starts killing everyone and one of the mercenaries uses a minigun.
This is one of the few movies I saw on one of my relative's computer screen when I was little. As I was too young to understand anything, it was approximately 15 to 20 years ago (I believe the movie couldn't have come out after 2000, but the quality of the pictures looked good enough that I have my doubts).   The movie I am looking for was fully animated. Potentially a Japanese animated movie, but I can't tell for sure, as I was too young to tell the difference between Japanese, English or any language. There may be blood in the movie, but I can't tell for sure. However, now that I'm looking back, the drawing style looked slightly Japanese, although it was more of the bloody kind (I could slightly compare its style to "Blood: The Last Vampire" (2000)). Maybe it had an Asian tone to it (e.g. it could be a Korean animated movie too).   One of the "bad guys" was a tall, heavy guy, in a very armoured suit. I can't tell whether he was wearing a suit, or if his body was enhanced because he survived an accident (although I have some form of memory about the latter). Most of his body was covered, but I remember his face not being covered. The most distinctive feature he had was the fact that he had a Minigun where one of his arm should be (a bit like Barret in Final Fantasy 7). I think the first time we see him, he's seen crushing a metallic ashtray with his other hand.   A battle scene in the movie includes the heavy guy having a shoot-out against a relatively thin guy (or should I say "normal-sized man"), fighting him with a machine-gun mounted vehicle (he wasn't the one driving; he was shooting from the back of the vehicle). While they were shooting at each others, I remember the heavy guy screaming (nothing in particular, he was just shouting continuous "AAAHH~!!" in pure rage). The fight didn't seem to happen in a city. It slightly looked like a battlefield. The fight ended with some form of explosion, probably killing off the heavy armoured guy.   The other noticable character was a young boy. He looked... pale, almost weird. His skin was almost green, otherwise he looked like a regular child. He seemed to have some psychic powers too: at some point, when he was feeling uneasy and sweating, a man picked a sample of blood from the back of his neck, using a portable device. But when the man was... either incapacitated or down, that boy broke the device containing his blood simply by looking at it.   At some point near the end of the movie, the pale looking boy and some people (with scientists among them) seemed to be inside a huge facility or underground hangar. There was a lot of space, although I can't remember if it was a factory, or if it was an underground weapon storage. The child was also giving some form of speech too, as all the lights turned on suddenly. The others were possibly surprised by what they were seeing.   One last detail I remember about that child is his smile. While it wasn't as scary as the Joker's, his grin was... kind of creepy, because of how he looked at the others with his small round eyes. He was oftenly grinning.   Overall, most of the scenes I remember were quite dark (mostly because there was little light, or it was night time). The two exception being the battle scene (although it was dark, there was a lot of muzzle fire), and the last underground scene with the boy.   When I asked my relative about the movie, all they could tell me was: "The coloured word 'Aiko' was written on the cover of the CD".
There are several Q&amp;A threads that explain how to download youtube videos using the terminal.  However, I would also like to learn how to extract the video's soundtracks as MP3 files--also using only the terminal.  Answers briefly explaining how to use youtube-dl or other similar utilities before explaining how to extract the MP3 would be ideal for the sake of having all the information in one place--even though this aspect has been covered in other posts. How do I view the SQL generated by the Entity Framework? Storage for Eldritch Horror Is there an optimal strategy for storing Eldritch Horror cards and tokens so that game play is facilitated.   I am not looking for answers that including "zip bags" and other things to keep the game element safer while is storage. Although, a strategy that works well for both cases will clearly be superior to one that only works for game play.  I am not limiting this to commercial solutions. I am quiet happy to build your custom made solution if you release the specification/plans of course!  Although, it it requires a 3D printer, more power to you. Random integer in VB.NET I need to generate a random integer between 1 and n (where n is a positive whole number) to use for a unit test. I don't need something overly complicated to ensure true randomness - just an old-fashioned random number.  How would I do that? How to show that $C=C[0,1]$ is a Banach space Let $C=C[0,1]$ be the space of all continuous functions on $[0,1]$. Define $\|f \|=\max \ |f(x)|$. I want to show that $C$ is a Banach space.     Below is my attempt and I was wondering if it's ok.    I know I have to show that $C$ is a complete normed space. Clearly, $\|f\| \geqslant 0$ and $\|f\|=0 \Leftrightarrow f=0$. $\|cf \|=\max~|cf(x)|=|c|\max |f(x)|=|c| \cdot \|f\|$. $\|f+g\|=\max~|f(x)+g(x)|\leq \max~|f(x)|+\max~|g(x)|=\|f\|+ \|g\|$. So $C$ is a normed space.   Next, I show that every Cauchy sequence in $C$ is convergent. Let $\{f_n\}$ be a Cauchy sequence in $C$. Let $\varepsilon \gt 0.$ Then $\exists$ an $N_1$ such that $$ \max~|f_n(x)-f_m(x)| \lt \frac{\varepsilon}{2}$$ for $n, m \gt N_1$ and $x\in[0,1]$.  But there is a subsequence $f_{k_n} $, which converges to $f$. So $\exists$ an $N_2$ such that $$ \max~\left|f_{k_n} - f\right|\lt \frac{\varepsilon}{2}$$ for each $n\gt N_2$.  Now Let $N = \max\{N_1, N_2\}$, if $n \gt N$ then $k_n \geqslant n\gt N$. So we have $$ \max~\left|f_n(x) - f(x)\right| \leqslant \max~\left|f_n - f_{k_n}\right| + \max~\left| f_{k_n} - f\right| \lt\frac{\varepsilon}{2} + \frac{\varepsilon}{2} = \varepsilon.$$  Thus, $\|f_n-f\| \to 0$ as $n\to \infty$. $\quad \square$  Thanks. I came across following problem     Evaluate $$\int\frac{1}{1+x^6} \,dx$$   When I asked my teacher for hint he said first evaluate     $$\int\frac{1}{1+x^4} \,dx$$   I've tried to factorize $1+x^6$ as  $$1+x^6=(x^2 + 1)(x^4 - x^2 + 1)$$ and then writing  $$I=\int\frac{1}{1+x^6} \,dx=\int\frac{1}{(x^2 + 1)(x^4 - x^2 + 1)} \,dx=\int\frac{1+x^2-x^2}{(x^2 + 1)(x^4 - x^2 + 1)} \,dx$$ $$I=\int\frac{1}{x^4 - x^2 + 1} \,dx-\int\frac{x^2}{(x^2 + 1)(x^4 - x^2 + 1)} \,dx$$  However $$x^4-x^2+1=\left(x^2-\frac12\right)^2+\frac{3}{4}$$ But I can't see how it helps  I've also tried to reverse engineer the   And I need to have terms similar to $$\frac{x^2-1}{x^4-x^2+1} \quad , \quad \frac{1}{1+x^2} \quad , \quad \frac{1}{(x+c)^2+1}\quad , \quad \frac{1}{(x+c)^2+1}$$ in integrand, How can I transform my cute looking integrand into these huge terms?  Since in exams I will neither have access to WA nor time to reverse engineer the solution moreover it does not seem intuitive,is there any way to solve this problem with some nice tricks or maybe substitutions? How to use WiFi and Ethernet at the same time Brief Description:  I need my Ethernet card (en0) to see all traffic under 192.168.2.xxx.  However I also need to use WiFi card (en1) for all other traffic.  OS: OS X Lion    I am using a separate network location to deal with this specific use (since this is a for a robotics project that communicates via Ethernet). Ethernet (en0) had to be set up as a static IP (192.168.2.10) per the requirements for the device I am connecting to. All connections on the Ethernet card (en0) should be 192.168.2.xxx as specified above. WiFi (en1) is set up as DHCP to a router since their is no point in assigning it as a static for general purpose traffic. Ethernet (en0) is set up as priority over WiFi (en1).  I would also like to keep this under the network location preferences if at all possible since I do not require this feature to be on all the time.  I would really appreciate your help on this. No one I have talked to knows how to solve this. Why can rm remove read-only files? If I create a file and then change its permissions to 444 (read-only), how come rm can remove it?  If I do this:  echo test &gt; test.txt chmod 444 test.txt rm test.txt   ...rm will ask if I want to remove the write-protected file test.txt. I would have expected that rm can not remove such a file and that I would have to do a chmod +w test.txt first. If I do rm -f test.txt then rm will remove the file without even asking, even though it's read-only.   Can anyone clarify? I'm using Ubuntu 12.04/bash. Trig integral $\int ( \cos{x} + \sin{x}\cos{x}) \, dx $ Assume we have:  $$ \int (\cos{x} + \sin{x}\cos{x}) \, dx$$  Two ways to do it:  Use $$\sin{x}\cos{x} = \frac{ \sin{2x} }{2} $$ Then $$ \int \left(\cos{x} + \frac{\sin{2x}}{2} \right) \, dx = \sin{x} - \frac{ \cos{2x} }{ 4 } + C. $$ The other way, just see that $ u = \sin(x), du = \cos(x)dx $, $$ \int ( \cos{x} + \sin{x}\cos{x}) \, dx = \sin{x} + \frac{\sin^2{x}}{2} + C. $$  Now the part I don't see fully is, why aren't these results completely equal?  Taking the 2nd result, \begin{align} \sin{x} + \frac{\sin^2{x}}{2} &amp;= \sin{x} + \frac{1}{2} \, \left( \frac{1 - \cos{2x}}{2} \right) \\ &amp;= \sin{x} + \frac{1}{4} - \frac{\cos{2x}}{4}. \end{align}  So you have to absorb $\frac{1}{4}$ into $C$ for them to be equal.  Shouldn't they be equal straight away? Which is the best way to install new hplip versions? Hplip is the software that drives most hp printers. Usually new printers are only supported in newer versions of the software. Canonical doesn't backport new versions packages to older Ubuntu versions, that means that newer drivers are not going to be available in the Software Center of older Ubuntu versions.  As an example yesterday I needed to hook a hp 1005p to a computer running 8.04. I was forced to install a newer hplip than the version available in the repositories. I installed it using the script from the hp page, but I'd like to know other alternatives.  Which is the best (technically, not the easiest) way to install it and why?. Simpler proof - Non atomic measures Suppose that $(X,\mathcal{E},\mu)$ is a non-atomic finite measure space (i.e. for every $E \in \mathcal{E}$ with $\mu(E)&gt;0$ there exists $F \subset E$ measurable such that $0&lt;\mu(F) &lt;\mu(E)$.)  a) Prove that for every $ \varepsilon &gt;0$ there is a finite partition of $X$ in measurable subsets $X_1,..,X_n$ such that $\mu(X_i)\leq \varepsilon$.  b) Prove that for every $\alpha \in [0,\mu(X)]$ there exists $E \in \mathcal{E}$ with $\mu(E)=\alpha$.    I guess that a) is given to prove b) more easily. I have the following idea of solution for a) (inspired from , which proves b)  )  Denote  $$ \Gamma = \{ (X_1,..,X_n) : n &gt;&gt; \mu(X)/\varepsilon, X_i \text{ are disjoint }, \mu(X_i)\leq \varepsilon \}$$ ordered by componentwise inclusion. Totally ordered parts $(Y_\alpha)$ of $\Gamma$ have an upper bound element $(\bigcup Y_\alpha^i)_{i=1}^n$ which is still in $\Gamma$.   By Zorn's lemma $\Gamma$ has maximal elements. If a maximal $(X_1..X_n)$ element is not a partition, then we can replace it with something better, of the form $(X_1,..,X_n\cup A)$ where $A \subset X \setminus (X_1 \cup..\cup X_n)$ and $\mu(A)&gt;0$.     My questions are:  1) Is my solution of a) correct? I feel that the part with the upper bound element may not work, since there might be noncountable unions.  2) What is a simpler solution of a)? Trying to overwrite ... which is different from other instances of package I tried to upgrade Intel graphics in ubuntu 16.10 using the official installer. The last stage of unpacking libcairo2 produces an error (see figure).  When I do upgrade I get the same error also:   Preparing to unpack .../0-libcairo2_1.15.2-0intel1_amd64.deb ... Unpacking libcairo2:amd64 (1.15.2-0intel1) over (1.15.2-0intel1) ... dpkg: error processing archive /tmp/apt-dpkg-install-aYhdFd/0 libcairo2_1.15.2-0intel1_amd64.deb (--unpack): trying to overwrite shared '/usr/share/doc/libcairo2/changelog.Debian.gz', which is different from other instances of package libcairo2:amd64 Preparing to unpack .../1-libcairo2_1.15.2-0intel1_i386.deb ... Unpacking libcairo2:i386 (1.15.2-0intel1) over (1.15.2-0intel1) ... dpkg: error processing archive /tmp/apt-dpkg-install-aYhdFd/1-libcairo2_1.15.2-0intel1_i386.deb (--unpack): trying to overwrite shared '/usr/share/doc/libcairo2/changelog.Debian.gz', which is different from other instances of package libcairo2:i386 Errors were encountered while processing: /tmp/apt-dpkg-install-aYhdFd/0-libcairo2_1.15.2-0intel1_amd64.deb /tmp/apt-dpkg-install-aYhdFd/1-libcairo2_1.15.2-0intel1_i386.deb E: Sub-process /usr/bin/dpkg returned an error code (1)   It seems that there is a conflict in thelibcairo releases; if yes, how to resolve it ? When I am using Tor, and not using the Tor bundle there is a possibility of DNS leaks in certain situations.   What can be done to minimize it? Is it possible to resolve DNS via Tor? How to check if a 2D point is in a polygon? How do I scan for Wireless Access Points? Let $p$ be prime and $(\frac{-3}p)=1$. Prove that $p$ is of the form $p=a^2+3b^2$ Let $p$ be prime and $(\frac{-3}p)=1$, where $(\frac{-3}p)$ is Legendre symbol. Prove that $p$ is of the form $p=a^2+3b^2$.   My progress:  $(\frac{-3}p)=1 \Rightarrow$ $(\frac{-3}p)=(\frac{-1}p)(\frac{3}p)=(-1)^{\frac{p-1}2}(-1)^{\lfloor\frac{p+1}6\rfloor}=1 \Rightarrow$ $\frac{p-1}2+\lfloor\frac{p+1}6\rfloor=2k$  I'm stuck here. This is probably not the way to prove that.  Also tried this way:  $(\frac{-3}p)=1$, thus $-3\equiv x^2\pmod{p} \Rightarrow$ $p|x^2+3 \Rightarrow$ $x^2+3=p\cdot k$ stuck here too.  Any help would be appreciated. Is there any advantage in marketing my product for £99.99 instead of £100? In the movies, the Death Eaters leave a smoky trail behind them as they fly. As the Order arrive in the Ministry of Magic in Order of the Phoenix, they leave a silvery trail behind them. In the books, there’s no mention of how they’re doing this. And J.K. Rowling said in the books that only Voldemort and Snape could fly like this; first seen in the Battle of the Seven Potters.  Please can somebody explain how the Death Eaters are able to fly like this? Review option on mobile phone not available? The other day I was looking at Stack Overflow on my Android phone. All is made very nice and all, but I could not find the Review button/link. Is it being implemented, did I miss it, or it is not available? When to use static methods