Is there a way to quickly write and run Java code from the command line on Mac?
Is there something like python's interactive REPL mode, but for Java?
What is the term when a word is used consecutively twice, with intentional stress placed on the first word, as a means to alter the severity of the word's meaning?  I am not referring to a  (had had) or a  (that that), but to the slightly sarcastic use as demonstrated in shows like Seinfeld. Sample sentences, with emphasis:  I know we're going out to eat, but I am only going to pick at an appetizer because I'm not hungry hungry. Don't wear something so formal to the party; I don't think you need to be dressed dressed.  Of personal note, some of my relatives decided a few years ago to nick-name the term a &quot;Celaine&quot; (a combination of their names) due to their own frequent use of it. Note: This question explicitly requests the term of art used by linguists and English scholars when discussing this phenomenon. This question is different from a  which requests a historical explanation for the phenomenon described by this term. None of the answers to the suggested duplicate provide the term.  The author of the similar question requests the term for the pattern in a comment, but does not receive an acceptable answer. The only mention of an acceptable term is in a comment made by the author of this question, in response to the author of the similar question, directing back to this very question. I just purchased an unlocked iPhone 5 from the Apple store today, and I can't activate it to use it because it says "please" insert a valid SIM card to use it. I'm not using this phone as a "phone" to make calls. I'm a developer and am just looking to use it for development purposes. How can I go about using the iOS 5? EncFs insecure, what to use now I love encfs as it provides file-based encrypting which is quite useful when it comes to cloud storage. But it looks like that especially for this use case, . I'm aware that  but how to deal with it in the meantime? Are there any alternatives that integrate well in ubuntu?  Edit: The security issue I mostly refer to is . It is still present in version 1.8 and makes your files vulnerable if someone get's multiple versions of your encrypted files. If one is worried about services like Dropbox are not that thrustworthy and encrypts folders uploaded into the cloud because of that, the opportunity that the attacker (the service) gets more than one copy of the cyphertext is absolutely given. How does Newtonian mechanics explain why orbiting objects do not fall to the object they are orbiting? Problem: Let $X$ and $Y$ be independent and suppose that each has a $\text{Uniform}(0,1)$ distribution. Let $Z = \min\{X, Y\}$. Find the density $f_Z(z)$ for $Z$. Hint: It might be easier to first find $\mathbb{P}(Z &gt; z)$.  Attempted Solution:  Given that $X, Y \sim \text{Uniform}(0,1)$, how do we not just have the following?  $$ f_Z(t) = f_X(t) = f_Y(t) = \begin{cases} 1 &amp; \text{if } 0 \le t \le 1 \\                                           0 &amp; \text{otherwise}                             \end{cases} $$  Of course I'm highly suspicious of this answer because it's not making use of the fact that $X$ and $Y$ are independent, nor is it making use of the provided hint. Removing small spaces (slivers) between polygons? I'm entering the world of Linux and at work I'm using grep more and more.  By doing that I'm figuring out that sometimes it's not adequate for what I want.  I was struggling with grep a few days ago and a colleague of mine who is a senior Linux admin, told me to use awk. I was stunned by how fast I got a result.  So my question is when do you choose to use one over the other? What questions can I ask myself before going to work with grep and spending a lot of time, when I could have done it with awk and saved time? Position of "only" in “We 𝒐𝒏𝒍𝒚 have two possibilities” Is there any difference in meaning between the three following sentences?   We only have two possibilities. We have only two possibilities. We have two possibilities only.   I have already read  and I know that the position of only and the emphasis (written or oral) may change the meaning of some sentences, but I am not sure if it does here.  Note: It is clear that “only we have two possibilities” has a different meaning. My question is restricted to the sentences I’ve listed above. Let $P$ denote the quotient space obtained by the action of $\mathbb{Z}\backslash2\mathbb{Z}$ by the antipodal map $z\mapsto\frac{1}{z}$ on the riemann sphere $\hat{\mathbb{C}}$ (identified here with $\mathbb{C}\cup\left\{\infty\right\}$). I identify $P$ with the set:  $\left\{ z\in\mathbb{C}:\left|z\right|&lt;1\right\} \cup\left\{ e^{it}:0\leq t\leq\pi\right\} $   that is to say, I use elements of the above set as the representatives for the equivalence classes in $P$. I am looking for formula for a function $f:P\times P\rightarrow[0,\infty)$ such that $f$ is a metric on $P$. Specifically, I would like a formula for $f$ that I can evaluate by plugging in representative elements in the above set (or something like that, more or less).  Thanks in advance.  Edit: forgive me for sounding desperate, but I cannot make due with an explanation of how to obtain such a formula. I want the formula.   An analogy for you if I have yet to make myself clear: suppose I was asking for the area of a square with side length $s$. The answers I have received so far for my question are akin to saying "multiply $s$ by itself" or "use the area formula for a square". The answer I am looking for is akin to saying "$s^{2}$". I need the formula. And please, no expressions with differentials, nor matrices, or any of that. I need to know how to compute the metric by using the complex numbers in the indicated set that I have identified with $P$. Photoelectric Effect - Dependence of current on frequency I am just starting out learning mathematical induction and I got this homework question to prove with induction but I am not managing.  $$\sum\limits_{k=1}^{n}{\frac{1}{\sqrt{k}}\ge\sqrt{n}}$$  Perhaps someone can help me out I don't understand how to move forward from here: $$\sum\limits_{k=1}^{n+1}{\frac{1}{\sqrt{k}}+\frac{1}{\sqrt{n+1}}\ge \sqrt{n+1}}$$ proof and explanation would greatly be appreciated :) Thanks :)  EDIT sorry meant GE not = fixed :) How do I create a public view from a private view It seems like I can't modify a private view to be public, or duplicate a private view to be public.  Am I restricted to copying by hand all the settings of my private view, then creating a fresh public view and selecting all the right columns in the same order with all the sort and filter options? I have an Object[] array, and I am trying to find the ones that are primitives. I've tried to use Class.isPrimitive(), but it seems I'm doing something wrong:  int i = 3; Object o = i;  System.out.println(o.getClass().getName() + ", " +                    o.getClass().isPrimitive());   prints java.lang.Integer, false.  Is there a right way or some alternative? sum of noncentral Chi-square random variables I need to find the distribution of the random variable  $$Y=\sum_{i=1}^{n}(X_i)^2$$ where $X_i\sim{\cal{N}}(\mu_i,\sigma^2_i)$ and all $X_i$s are independent. I know that it is possible to first find the product of all moment generating functions for $X_i$s, and then transform back to obtain $Y$'s distribution. However, I wonder whether there is a general form for $Y$ like the Gaussian case: we know the sum of independent Gaussian is still a Gaussian, and thus we only need to know the summed mean and summed variance.   How about all $\sigma^2_i=\sigma^2$? Will this condition make a general solution? Keyboard Glyphs How are people showing keyboard &quot;glyphs&quot; on Super User? I looked at the Markdown help page and it didn't show anything regarding this. Here is  (question has been deleted since this was asked, so an archive link is provided instead): A coin with heads probability $p$ is flipped $n$ times. A "run" is a maximal sequence of consecutive flips that are all the same. For example, the sequence HTHHHTTH with $n=8$ has five runs, namely H, T, HHH, TT,H. Show that the expected number of runs is  $$1+2(n-1)p(1-p).$$  I have tried to use some generating function on this but calculus got pretty messy and didn't work. Interpreting spline results Matrix exponential for Jordan canonical form Let $X$ be a real $n \times n$ matrix, then there is a Jordan decomposition such that $X = D+N$ where $D$ is diagonalisable and $N$ is nilpotent.  Then, I was wondering whether the following is correct.  $e^{tX}(x) = \sum_{k=0}^{m} \frac{t^k N^k}{k!} \left(e^{t \lambda_1} \alpha_1 v_1+..+e^{t \lambda_n} \alpha_n v_n \right).$  Here $x = \sum_{i=1}^{n } \alpha_i v_i$ and $v_i$ are the eigenvectors of the diagonalisable matrix, $\lambda_i$ are the eigenvalues of $D$ and $m$ is the degree up to which $N^k$ is still non-zero.  Is this correct or am I doing something wrong? Cause I could not find a general equation for this matrix exponential, so I tried my best. (Thus, I am only asking for a verification or correction of this answer.)  If anything is unclear, please let me know. Give $\ker(\phi)$  for $\phi: \mathbb{Z} \to \mathbb{Z_7}$ such that $\phi(1) = 4$  So the generator of $\mathbb{Z}$ maps to $4$ and $\langle 4 \rangle = \{0,1,2,3,4,5,6\}$ so it has order seven.  so $\ker(\phi) = 7\mathbb{Z}$ because every seventh element will map to the identity under the given map. Is that the correct reasoning? Can I configure bash to execute "clear" before every command typed in the console? I would like to configure bash to execute clear command every time I type some command in the terminal (before executing my command). How can I do that?  I'm using Debian Linux.