There was a boy and a girl, and they had a small puppet creature with the name of Prism, and at the end it turned into an actual prism of crystal on a necklace, I think. Near the end, it might be that their ship was being eaten by multiplying slug puppets?
I'm looking for a 90s (or early 2000s) scifi (mini)series where a boy and old man chase a black guy in metal suit. I think they were going through different dimensions. I remember part of it, but I don't think I ever saw how it ended. I remember my friend telling me there was a twist at the end. I think they were trying to find something and he was always ahead of them..
Is there a word for capitalizing in the middle of a word, as in "eBay"? Usually this sort of word is a trademarked name, such as eBay or BlackBerry.  Is there a word that describes capitalization mid-word? How extended must my extended paper be? Changing unusual foreign currencies in London I've just returned from several unusual countries in Asia, and annoyingly despite being told I'd have no problem, I'm unable to find anyone in London to change back to pounds.  I've tried Travelex in Heathrow, a currency exchange place, and the post office.  The currencies include cash from: Mongolia, Kyrgyzstan, Kazakhstan and Uzbekistan.  Most of the responses when shown the money is to the tone of "What the hell currency is this?" which doesn't fill me with confidence.  Any suggestions welcomed for places that may change this. Otherwise I may need to go back next year ;) Show (within ZF Set Theory without choice) that for any sets $A,B,C:$   If $|A|^{|B|} = |B|$, then $|A| = 1 = |B|.$   That is, if there is a bijection from $|A|^{|B|}$ to $|B|$, then  $|A| = 1 = |B|.$  Please help me.. Footnote in tabular environment Coffeescript existential operator sometimes checks against undefined, but not always Identification of particles and anti-particles The identification of an electron as a particle and the positron as an antiparticle is a matter of convention. We see lots of electrons around us so they become the normal particle and the rare and unusual positrons become the .  My question is, when you have made the choice of the electron and positron as particle and anti-particle does this automatically identify every other particle (every other fermion?) as normal or anti?  For example the proton is a particle, or rather the quarks inside are. By considering the interactions of an electron with a quark inside a proton can we find something, e.g. a conserved quantity, that naturally identifies that quark as a particle rather than an antiparticle? Or do we also just have to extend our convention so say that a proton is a particle rather than an antiparticle? To complete the family I guess the same question would apply to the neutrinos. Definition of $\mathbb{R}^\infty$ Question: Why is the topological space $\mathbb{R}^\infty$ defined to be the subset of $\prod_{i=1}^\infty \mathbb{R}_i$ consisting of sequences $(a_i)_{i=1} ^{\infty}$ such at most finitely many $a_i\neq 0$? Why does one insist on the condition that $a_i\neq0$ for at most finitely many $i$? Difference between ulimit, lsof, cat /proc/sys/fs/file-max I've been getting java.io.IOException: Too many open files while running a Kafka instance and using one topic with 1000 partitions so I started investigating the file descriptors limits in my ec2 vm. I cannot understand which is exactly the limit for open files on a Centos 7 machine since all the following commands produce different results. The commands are:   ulimit -a: open files 1024 lsof | wc -l: 298280 cat /proc/sys/fs/file-max: 758881 (which is consistent with /proc/sys/fs/file-nr)   If the actual limit is the one the last command produces then I am well below it (lsof | wc -l: 298280). But if this is the case, the output of the ulimit command is quite unclear to me since I am well above the 1024 open files.   but are there all these seemingly "inconsistencies" between these commands? Why the definition of limit have a strict inequality rather than not? My question is why the definition of limit of sequence is for $\epsilon &gt;0$, there exist $N$ st for $n\ge N$ that $|x_n-L|&lt;\epsilon$ instead of $|x_n-L|\le \epsilon$ This is a doubt from Milnor's "Topology from a Differentiable Viewpoint".     For a smooth $f:M\to N$, with $M$ compact, and a regular value $y\in N$, we define $n(f^{-1}(y))$ to be the number of points in $f^{-1}(y)$. It is easy to see that $n(f^{-1}(y))$ is finite. It can also be seen that $n(f^{-1}(y))$ is locally constant; i.e. there is a neighbourhood of $y$ such that for every point $y'$ in that neighbourhood, $n(f^{-1}(y'))=n(f^{-1}(y))$.   The proof for the statement in bold is the following:     Let $x_1,x_2,\dots,x_n$ be the points of $f^{-1}(y)$, and choose disjoint neighbourhoods $U_1,U_2,\dots,U_n$ of these points, which are mapped diffeomorphically into neighbourhoods $V_1,V_2,\dots,V_n$ of $y$. The required neighbourhood is $(V_1\cap V_2\cap\dots V_n)-f(M-U_1-U_2-\dots U_n)$.   I don't understand how $(V_1\cap V_2\cap\dots V_n)-f(M-U_1-U_2-\dots U_n)$ is open. I know that $(V_1\cap V_2\cap\dots V_n)$ is open. However, how can one prove that $f(M-U_1-U_2-\dots U_n)$ is closed? I can see this working if $f$ is surjective, but not otherwise. My new laptop came preinstalled with Windows 8. Naively, as I am, I just formatted the harddrive and installed fine old Ubuntu. Now I want to install Windows 8 for dual boot again, but I have no DVD and do download the ISO one needs a product key. That key is not on the back of the laptop anymore but somewhere on the mainboard.  Is there any way to recover the product key from the mainboard using Ubuntu? How do users navigate to Meta? How do you expect users to:   Know that a site's meta-site exists (and what it's for)? Find the hyperlink to the meta-site?   I know it exists, of course, and how to get there; I'm wondering how (or even whether) you expect new or naive users to do that.  I think there isn't a link to Meta from the main site, am I right (except one link in the "list of all 171 Stack Exchange sites" drop-down menu on the toolbar)?  Sometimes I tell people to post a question on Meta instead of on the main site -- I don't realise that they may not know that Meta exists, and that if they do (because they've been there before) they don't know how to get there (because they haven't yet investigated everything on the toolbar). Colorizing your terminal and shell environment? I spend most of my time working in Unix environments and using terminal emulators. I try to use color on the command line, because color makes the output more useful and intuitive.  What options exist to add color to my terminal environment? What tricks do you use? What pitfalls have you encountered?  Unfortunately, support for color varies depending on terminal type, OS, TERM setting, utility, buggy implementations, etc.  Here are some tips from my setup, after a lot of experimentation:   I tend to set TERM=xterm-color, which is supported on most hosts (but not all). I work on a number of different hosts, different OS versions, etc. I use everything from macOS X, Ubuntu Linux, RHEL/CentOS/Scientific Linux and FreeBSD. I'm trying to keep things simple and generic, if possible. I do a bunch of work using GNU screen, which adds another layer of fun. Many OSs set things like dircolors and by default, and I don't want to modify this on a hundred different hosts. So I try to stick with the defaults. Instead, I tweak my terminal's color configuration. Use color for some  (ls, grep, less, vim) and the . These commands seem to use the standard "". For example:  alias less='less --RAW-CONTROL-CHARS' export LS_OPTS='--color=auto' alias ls='ls ${LS_OPTS}'    I'll post my .bashrc and answer my own question Jeopardy Style. Bidirectional 1 to 1 Dictionary in C# I am looking for a generic, bidirectional 1 to 1 Dictionary class in C# (2), ie. a BiDictionaryOneToOne&lt;T, S&gt; which is guaranteed to only contain one of each value and key (up to RefEquals anyway), and which can be searched using either key or value. Anyone know of one, or should I just implement it myself? I can't believe that I'm the first person to need this...  There is a BiDictionary in the answers to , but it is not for unique elements (and also does not implement RemoveByFirst(T t) or RemoveBySecond(S s)).   Thanks! Why can I modify a read-only file? Short Question:  Why can we manipulate a read-only file in Vim using : + w + q + ! even without being an administrator?  Long Question:  I have a text file (myFile.txt) which is read-only for everyone:  navid@navid-ThinkPad-T530:~/ubuntuTest$ ls -l myFile.txt  -r--r--r-- 1 navid navid 26 Aug 22 21:21 myFile.txt   I can open it with Vim without having admin privileges:  navid@navid-ThinkPad-T530:~/ubuntuTest$ vi myFile.txt    I modify it and press: Esc + : + w + q + Enter and I see this error message:  E45: 'readonly' option is set (add ! to override)   So far, everything makes sense.  But when I press: Esc + : + w + q + ! + Enter, Vim saves the changes.  I'm using Ubuntu 16.04 and VIM 7.4. Most efficient way to see if an ArrayList contains an object in Java I have an ArrayList of objects in Java.  The objects have four fields, two of which I'd use to consider the object equal to another.  I'm looking for the most efficient way, given those two fields, to see if the array contains that object.  The wrench is that these classes are generated based on XSD objects, so I can't modify the classes themselves to overwrite the .equals.    Is there any better way than just looping through and manually comparing the two fields for each object and then breaking when found?  That just seems so messy, looking for a better way.  Edit: the ArrayList comes from a SOAP response that is unmarshalled into objects. An alternative to translation for non-English speakers? Removing nodes from graphs such that one is dependent on other - ZIO $2010$, P$1$ Greetings Community! The above problem you see is a combinatorics problem I could not solve. :( This problem is from ZIO $2010$, P$1$.     Here is what I did: Observe that every graph can be divided into "sub-groups" which may help in solving. We first remove the empty set. Then the singleton set. Consider the bigger but smaller than the sub-parts example:    The singleton sets are $\{4,5,6\}$ which are at the least position in the graph.   The dual sets are $\{2,4\}, \{3,5\}, \{3,6\}$, the bottom - two portions in the graph. The triplet sets are $\{2,4,5\}, \{4,5,6\}$ which we may manually count but for the bigger graphs in the sub-part, this may prove to be difficult and this is where I am stuck.   Any help would be appreciated. Thanks. Create JSON using apex