Command to yield just the linux distribution name only
How can I get distribution name and version number in a simple shell script?
GBM vs XGBOOST? Key differences? I am trying to understand the key differences between GBM and XGBOOST. I tried to google it, but could not find any good answers explaining the differences between the two algorithms and why xgboost almost always performs better than GBM. What makes XGBOOST so fast? Port error while changing chrome extension from manifest v1 to v2 Azure DNS does not lookup SPF policies for certain domains Determine device (iPhone, iPod Touch) with iOS Is there a way to determine the device running an application. I want to distinguish between iPhone and iPod Touch, if possible. How to run find -exec? I'd like to find the files in the current directory that contain the text "chrome".  $ find . -exec grep chrome find: missing argument to `-exec'   What am I doing wrong? Why does bright pure red/green/blue light look white if bright enough? I believe that white light is white because it contains every wavelength, as white by itself has no frequency by itself.  Can somebody explain why really bright pure red, green, or blue LEDs seem white to us and to cameras?  Also, can a bright light ever be pure(eg is it possible to emit a pure red/pure blue/pure green bright light only with wavelengths in the range of that light), or will the inherent brightness of a light force other wavelengths into the light? Let , $\Delta = B(0,1)$.  If $f:\Delta \rightarrow \Delta$ is holomorphic, and $f(0)=0$, prove that $|f(z)+f(-z)| \leq 2|z|^2$.  My attempt so far:  $\displaystyle f(z) = \sum_{n=0}^{+\infty} a_n z^n = \sum_{n=0}^{+\infty} a_{2n} z^{2n} + \sum_{n=0}^{+\infty} a_{2n+1} z^{2n+1}$  $\displaystyle f(-z) = \sum_{n=0}^{+\infty} a_n (-z)^n = \sum_{n=0}^{+\infty} a_{2n} z^{2n} - \sum_{n=0}^{+\infty} a_{2n+1} z^{2n+1}$  Then, $\displaystyle f(z)+f(-z) = 2  \sum_{n=0}^{+\infty} a_{2n} (z^2)^n =: 2 g(z^2)$  If $g(\Delta) \subset \Delta$, as $g(0) = 0$, I can invoke Schwarz Lemma and I win. However, I don't know how to prove this. Could anyone help me? Thanks! Automatically open ICS files in Google Calendar Homotopy functions I'm new here. Can anyone give me a hint in this problem? Please.  Let $X$ be a topological space. If $f,g$ are continuous function of $f,g\colon X\to S^n$  which $f(x)\neq -g(x)$ for all $x$ in $X$, show $f$ and $g$ are homotopics. I try to show a homotopy using $$q(x) = \frac{f(x)+g(x)}{\|f(x)+g(x)\|}$$ it's well defined, but i'm stuck. is that function must be constant under the following conditions I'm talking about complex function   $f$ is analytic function on a region $D$ that include the point $z=0$. for every $n\in N$ such $\frac{1}{n}$ is in $D$ , the function follows this condition $|f(\frac{1}{n})| \leq \dfrac{1}{2^n}$   is that function must be constant ? GNOME 3.26 - Clicking one window brings another in the foreground (Ubuntu 17.10) I'm on Ubuntu 17.10 with GNOME 3.26.  Often I have windows tiled on the left and right side of the screen. A typical setup is to have a browser and text editor on the left, a PDF reader and terminal on the right.  Something I've seen happen very often: I'm reading the PDF on the right, having the window in focus. The text editor on the left. When I click on the text editor to write something, it brings forward another window on the right (say the file browser), covering the PDF reader.  This seems to have something to do with the Alt-Tab view history.  My question is: Is it possible to remove the automatic bring-to-front of windows? I don't understand why unrelated windows are brought to the front when I click on another application. Prove $\sum\limits_{i=2}^{n}\frac{1}{(i-1)i}$ = $\frac{(n-1)}{n}$ using induction. I need to prove $\sum\limits_{i=2}^{n}\frac{1}{(i-1)i}$ = $\frac{(n-1)}{n}$ using induction. I am getting stuck midway through the inductive step.   Here is what I have:  $\forall n\geq 2$, where $n\in\mathbb{N}, P(n)$ is the statement "$\sum\limits_{i=2}^{n}\frac{1}{(i-1)i}$ = $\frac{(n-1)}{n}$".  Base case:  $\sum\limits_{i=2}^{2}\frac{1}{(i-1)i}$ = $\frac{1}{2}$ = $\frac{(2-1)}{2}$ so $P(2)$ is true.  Inductive assumption: Assume $P(n)$ is true. Need to show $\sum\limits_{i=2}^{n+1}\frac{1}{(i-1)i}$ = $\frac{((n+1)-1)}{(n+1)}$.  $\sum\limits_{i=2}^{n}\frac{1}{(i-1)i}$ + $\frac{1}{n^{2}}$ = $\frac{(n-1)}{n}$ + $\frac{1}{n^{2}}$  = $\frac{n(n-1) + 1}{n^{2}}$ = $\frac{n^{2}-n+1}{n^{2}}$  I got stuck here and tried working backward from $\frac{((n+1)-1)}{(n+1)}$, which gives me:  $\frac{((n+1)-1)}{(n+1)}$ = $\frac{n}{(n+1)}$   Any suggestions on what to do next or where I may be going wrong? book recommendation on functional analysis Can I use my Schengen visa for multiple purposes I was issued a Schengen visa for 90 days validity with multiple entry. Initially I planned for tourism to France and Switzerland and accordingly I have written the purpose as tourism only and I will be travelling as well for a week and coming back to India. First I am using for tourism for one week and travelling back to India.  Now, I also need to travel again to Schengen area to the same countries for business purpose for one week again. Can I use the same visa or do I need to get a new one? Having trouble finding Plantera's Bulb I have been playing on hardmode for a while and have beaten the three  a couple of times. But I have yet to find a . It's getting really frustrating.  Does anyone have any methods to finding a Plantera Bulb? Top angular speed of electric motor I recently came across a question asking the following:     If a motor is switched on, it quickly reaches a top speed. Why does it not just go faster and faster and faster?   I thought it might be related to the fact that the electrical power is constant, so I tried approaching with $P=\tau \cdot \omega$. However I still do not have any clue to reaching the conclusion.  Is it somehow related to the energy loss (due to friction)? Like the terminal speed of a parachute or something? But I was thinking that friction should be constant ($f=\mu \cdot N$) while air drag is related to the speed, so this may not be the answer.  Thank you. This may sound like a 'first world problem', but I am quite easily distracted by the 'Hot Network Questions' sidebar, as I find them quite amusing and some of them quite intellectual  But where the problem lies is that, even at work, if I google something up and find a solution on Stack Overflow, to some random problem I am working at, I (always) get distracted towards them (Hot Network Questions), and end up reading the whole Qs as well as As of that respective question, and this is adversely affecting my productivity.  Any suggestion would greatly help. Nominate for Reopening Shows Duplicate Message Boxes Sum of nth roots of unity Question: If $c\neq 1$ is an $n^{th}$ root of unity then, $1+c+...+c^{n-1} = 0$  Attempt: So I have established that I need to show that $$\sum^{n-1}_{k=0} e^{\frac{i2k\pi}{n}}=\frac{1-e^{\frac{ik2\pi}{n}}}{1-e^{\frac{i2\pi}{n}}} =0$$ by use of the sum of geometric series'. My issue is proceeding further to show that this is indeed true. I would like to determine the operating system of the host that my Java program is running programmatically (for example: I would like to be able to load different properties based on whether I am on a Windows or Unix platform). What is the safest way to do this with 100% reliability?