How can time dilation occur for one person but not another?
What is the proper way to explain the twin paradox?
Prove that $ S=\{0\}\cup\left(\bigcup_{n=0}^{\infty} \{\frac{1}{n}\}\right)$ is a compact set in $\mathbb{R}$, but $\bigcup_{n=0}^{\infty} \{\frac{1}{n}\}$ is not a compact set.   (Can we use definition of compact set for this problem? ) Encrypting as3 flash .swf Accumulation Points for $S = \{(-1)^n + \frac1n \mid n \in \mathbb{N}\}$ I was recently asked to find the accumulation points of the set $$S = \{(-1)^n + \frac{1}{n} \mid n \in \mathbb{N}\}$$  I answered that the accumulation points are $\{-1,1\}$, because despite the fact that $\frac{1}{n}$ diverges, we can still use $\frac{1}{n}$ to find an element arbitrarily close to either $1$ or $-1$, i.e. to show that there is an element in an arbitrarily small neighborhood of $1$ or $-1$. (No proof was required for this question --- this is my intuition.)  Am I right at all? I want to prove that: $\ln(x+1)&lt; x$.  My idea is to define:  $f(x) = \ln(x+1) - x$, so:  $f'(x) = \dfrac1{1+x} - 1  = \dfrac{-x}{1+x} &lt; 0, \text{ for }x &gt;0$.  Which leads to $f(x)&lt;f(0)$, so $\ln (x+1)-x&lt;0$.  Is that a valid proof? Any other ideas?  Thanks. Comparison theorem for ODE Here is something I'm trying to prove:     Conjecture: Suppose $f'(x) \leq \phi(f(x), x)$ and $f(a)=\alpha$. Suppose $g'(x)=\phi(g(x),x)$ and $g(a)\geq \alpha$. Then $f(x)\leq  g(x)\,\,\forall x$.   It definitely seems like it should be true, and I don't think we even need continuity of $\phi$.  (Edit: a user has correctly pointed out that we should require $\phi$ be locally Lipshitz in the first variable, uniformly with respect to the second variable. Let's add that assumption.)   I can prove it in the case that the inequality is strict. I'll place my proof below the fold. How can I extend it to weak inequality?  If it's wrong, I'd love to see a counterexample. A reference is fine; I have the book by Teschl, for example.  A similar question with stronger assumptions was asked .     Proposition: Suppose Suppose $f'(x) &lt; \phi(f(x), x)$ and $f(a)=\alpha$. Suppose $g'(x)=\phi(g(x),x)$ and $g(a)\geq \alpha$. Then $f(x)\leq  g(x)\,\,\forall x$.  Proof: Suppose not. Suppose WLOG there is a $b&gt;a$ such that $f(b)&gt;g(b)$. Let $c:=\inf \{x&gt;a:f(x)&gt;g(x)\}$. By definition of the derivative we have $f'(c)\geq g'(c)$, a contradiction, since $f'(c)&lt;\phi(f(c),c)=\phi(g(c),c))=g'(c)$. How and why do normalization and feature scaling work? I see that lots of machine learning algorithms work better with mean cancellation and covariance equalization. For example, Neural Networks tend to converge faster, and K-Means generally gives better clustering with pre-processed features. I do not see the intuition behind these pre-processing steps lead to improved performance. Can someone explain this me? Block network access of a process? Is it possible to block the (outgoing) network access of a single process? What is the distribution of the sum of non i.i.d. gaussian variates? LaTeX figures side by side Ideals in valuation rings How do I prove the fact that for any valuation ring $V$ the ideals are totally ordered under inclusion? No, actually I didn't, but that was a close call and I'm really curious how would one go about that one.  On my third or fourth visit to the Nether, I still didn't realize the risk, and didn't place marks that would help me get back to the origin (currently I like to use flint and iron to create big flaming arrows towards the exit, visible from afar.) I wandered past one hill, and then I couldn't locate the place I came from. I wisened up and started placing marks in form of torches, towers of netherrack with glowstones on top etc. The bunch of wood I had in my stash has proven invaluable as I ran out of steaks, and had to craft a bowl and start making mushroom soup. I realized the fastest way back would be to simply die, but since I had no clue where I was, that would mean losing my quite precious equipment, which cost me a lot of time and effort to gather and enchant, for that trip specifically. I also knew I had traveled rather far from the portal before starting placing marks, so the chances of finding it again by going in any random direction were rather slim.  By sheer luck I found one of the caverns I had explored before, and found my way back, but that was really a close call and I'd prefer to know any hints what to do in Nether if you're already lost (no Obsidian to build a new portal, not willing to die and forgot the direction to the exit.) I develop a windows application and am curious whether it works via Wine. The application runs fine with Wine but I get no sound. In fact, I'm not sure whether my ubuntu installation has MIDI capabilities. The sound output settings shows "LFE on Separate Mono Output" one with "no amplifier" and another with "amplifier". They both function. I am using Ubuntu 12.04 as a client on virtualbox that runs on windows 7.  Thanks for any suggestion!  EDIT: virtual box hosted by windows 7, ubuntu running as a client in virtualbox. Does something like  exist for topological (eg. braided) circuits?   Alternatively, any ideas on how @ is getting  (or something similar)? How to set security options for a PDF using pdflatex My questions is very simple. How can I set security setting for a PDF file created with PDFLatex?  I should set some password or print permissions, etc. Why did sampling boost the performance of my model? I have an imbalanced dataset with 88 positive samples and 128575 negative samples. I was reluctant to over/undersample the data since it's a biological dataset and I didn't want to introduce synthetic data. I built a Random Forest Classifier with this original dataset. I got an F1 score of 0 for the positive class. Zero precision. Zero recall. I cross-checked the predictions and test data. The model predicts some positives none of which are actually positive. Worst performance.  So, I tried to oversample the positive class. I upsampled the positives to 1000 samples. To my surprise, the F1 score for this dataset was 0.97, for the positive class. Then I tried lesser samples. I was able to achieve an F1 score of 0.83 with 200 positive samples, which is just 2.25 times of the original positive samples.  I would like to know why this occurs. For 88 samples, F1 score is 0.00 (rounded off to two digits). For 200 samples it's 0.83. There is no data leakage. All the features are engineered. I used imbalanced-learn module for oversampling. Can someone explain why is this difference in performance? How can momentum but not energy be conserved in an inelastic collision? In inelastic collisions, kinetic energy changes, so the velocities of the objects also change.  So how is momentum conserved in inelastic collisions? hello everyone I have a little problem, how do I bring up the menu in the circle? when I select another object the menu becomes non-existent How can I form a word like "quadruple" for any number I want? I'm not sure what these are called, but how can I form a word like "quadruple" for any number I want? Like 5× as much is quintuple, what is 31× as much or 147× as much? I want to know how they are formed so I can make my own.  Similarly, how do I construct the prefixes, such as unicycle, bicycle, tricycle, quadricycle? I figured out 12 is duodeci-, but how can I form any prefix like this? What happens to the energy when waves perfectly cancel each other? What happens to the energy when waves perfectly cancel each other (destructive interference)? It appears that the energy "disappear" but the law of conservation of energy states that it can't be destructed. My guess is that the kinetic energy is transformed into potential energy. Or maybe it depends on the context of the waves where do the energy goes? Can someone elaborate on that or correct me if I'm wrong? Is there any way other than instanceof operator for object type comparison in java?