I've been creating a project for managing my complete terminal environment. One of the things I manage are the dotFiles. So I have separate dotfiles for e.g.   ivonet-alias.sh ivonet-docker.sh ivonet-functions.sh etc.   When I run setup.sh from my project I install symlinks (ln) to my ivonet-*.sh files in my HOME folder. Now to activate them I do the following (once):  prefix="ivonet" resource="${HOME}/.zshrc" echo "" &gt;&gt;${resource} echo "# Personal dotFile resources:" &gt;&gt;${resource} echo "for f in \${HOME}/.${prefix}-*.sh; do source \${f}; done" &gt;&gt;${resource}   On my own machine I use oh-my-zsh shell and I make it so that that file is changed so that when I open a new terminal session all my dotfiles are sourced in. This works fine but now a couple of colleagues asked to use my setup for dotfiles too and I gave them my repo and it didn't work as I had hoped. The were not using zsh but bash, but even that was not uniform.  When I changed the setup to write to .bashrc it worked for one colleague but not for the other. So in the end I had to do it multiple ways.    once in .profile twice in .bash_profile once in .bashrc   Can anyone help me on how I can determine where to make the changes?  I would like to be able to check this from a script something like:  check=$(which bash) if [[ -z "${check}" ]]; then    #do stuff here fi   but I have no idea how to do this. I know it looks like this  but I'm more interested on how I can automatically determine which file is loaded.
I've used a number of different *nix-based systems of the years, and it seems like every flavor of Bash I use has a different algorithm for deciding which startup scripts to run.  For the purposes of tasks like setting up environment variables and aliases and printing startup messages (e.g. MOTDs), which startup script is the appropriate place to do these?  What's the difference between putting things in .bashrc, .bash_profile, and .environment?  I've also seen other files such as .login, .bash_login, and .profile; are these ever relevant?  What are the differences in which ones get run when logging in physically, logging in remotely via ssh, and opening a new terminal window?  Are there any significant differences across platforms (including Mac OS X (and its Terminal.app) and Cygwin Bash)?
How do you teleport a certain player to spawn after they win a 1v1 I managed a KitPvP server in Minecraft and everything works fine except when players wants to duel each other. They get sent to a room where they will be dueling. The main problem is when the winner wins, I have no idea how to teleport them back to spawn. Find the value of $\int_{-\infty}^{\infty} \frac{e^{-x^2}}{1+x^2} dx$ . Find the value of $\int_{-\infty}^{\infty} \frac{e^{-x^2}}{1+x^2} dx$     My attempt  First, I know the existence of this integral since $$ \mid \int_{-a}^{a} \frac{e^{-x^2}}{1+x^2} dx \mid \;\; \leq\;\;  \mid \int_{-a}^{a} \frac{1}{1+x^2} dx \mid$$  Next, let $R &gt;0 $ be an arbitrary and $\gamma_1(t) = -R(1-t) + Rt , \;\; 0 \leq t \leq1$ and $\gamma_2(t)= Re^{i\pi (t-1)}, \;\; 1 \leq t \leq 2 $.  So, take $f(z) = \frac{e^{-z^2}}{1+z^2}$.   I tried to find the value or upper bound of norm of $$\int_{\gamma_2} \frac{e^{-z^2}}{1+z^2} dz$$.  However, $$ \lvert\int_{\gamma_2} \frac{e^{-z^2}}{1+z^2} dz\rvert \leq  \frac{\text{max}\lvert e^{-z^2}\rvert}{R^2-1}\pi R = \frac{e^{R^2}}{R^2-1}\pi R $$ So, I can't proceed this.  May I ask you how to solve this? I'm looking into developing an ordering app for a potential client. The main part that I'm concerned about in this question is the payment mechanism. I would assume that there are already multiple plugins or similar programs out there, but I'm not sure where (or if) I should be asking for recommendations. On page 19 of the textbook  (by James, Witten, Hastie and Tibshirani--it is freely downloadable on the web, and very good), the following is stated:  Consider a given estimate $$\hat{Y} = \hat{f}(x)$$ Assume for a moment that both $$\hat{f}, X$$ are fixed. Then, it is easy to show that: $$\mathrm{E}(Y - \hat{Y})^2 = \mathrm{E}[f(X) + \epsilon - \hat{f}(X)]^2$$ $$ = [f(X) - \hat{f}(X)]^2 + \mathrm{Var}(\epsilon)$$  It is further explained that the first term represents the reducible error, and the second term represents the irreducible error. I am not fully understanding how the authors arrive at this answer. I worked through the calculations as follows: $$\mathrm{E}(Y - \hat{Y})^2 = \mathrm{E}[f(X) + \epsilon - \hat{f}(X)]^2$$ This simplifies to $[f(X) - \hat{f}(X) + \mathrm{E}[\epsilon]]^2 = [f(X) - \hat{f}(X)]^2$ assuming that $\mathrm{E}[\epsilon] = 0$. Where is the $\mathrm{Var}(x)$ indicated in the text coming from? Any suggestions would be greatly appreciated. I am looking for the stuff above, so I can make non-duplicate proposals on area 51. How to increase the width and height of the Rich Text area field in Visual force Page? Prove $\alpha \in R[[x]]$ is a unit iff $a_0 \in R$ is a unit Supersymmetry in Quantum Field Theory bst file not found I updated a virtual machine running Ubuntu server 15.04 to the just released new stable 15.10.  There were no apparent problems, but after reboot the machine lost its network connection. lspci showed the correct card and lsmod proved that the driver had been loaded.  Hints about editing or removing /etc/udev/rules.d/70-persistent-net.rules did not succeed (still no network, no new file), the famous /lib/udev/write_net_rules did not even exist.  I don't have much clue regarding udev and systemd, so it took me some time to find in /sys/class/net that the network interface name changed. It became ens32, which was renamed from eth0. After I changed /etc/network/interfaces network communication was enabled again.  But - why does this happen at all? And if it happens, shouldn't the interfaces file be updated automatically?  Now that I deleted the virtual network card and created another one, eth0 becomes eno16777728, which is not so, uhm, nice.  Should this behaviour (at least that of the upgrade procedure) be reported as a bug?  Furthermore, is /etc/udev/rules.d/70-persistent-net.rules obsolete now? And (although only partly related) what about /etc/udev/rules.d/70-persistent-cd.rules?)  Edit - additional question (after accepted answer) The dependency of /etc/network/interfaces from the actual interface name bothered me. I tried a new installation of *ubuntu in another virtual machine. To my surprise, /etc/network/interfaces contained a reference to the loopback device only. However, with my original VM this change prevented the network to come up. So what else do I need to change?  Edit Well, from another test I found that a new Ubuntu Server has the network interface card in /etc/network/interfaces, while XUbuntu has not. Maybe it is using network-manager or something else. My 1.12 solution can be found . When trying to update command blocks to 1.13, I have the following:  scoreboard objectives add invert dummy   (run at start) then:  scoreboard players set FakePlayer invert 1   (impulse unconditional repeat) chained into:  execute at @e[tag=summoned] run scoreboard players reset FakePlayer invert   (chain unconditional repeat) chained into:  execute if score FakePlayer invert = 1 invert run say "All summoned animals are dead!"   This should reset FakePlayers score continuously until all entities with tag "summoned" are dead, then it should run the final condition. This does not happen, and I can't see why. What is an "AppImage"? How do I install it? I just read . It talks about downloading an AppImage.     Yes, Linux; the Linux packages is distributed as an .appimage for 32-bit and 64-bit distributions, and should run across all major Linux distributions without any issues. The team currently have no plan to provide a native .deb (or .rpm) installer.   What are AppImages? How do they differ from snaps? Filtered Review Queue doesn't show any audits Does anyone know the (specific) reasons that it is recommended that old LTS server users wait until the point release to upgrade?  Is it just a matter of bug fixes and waiting for improved stability for production servers, or is there something more fundamental than that? I want to write a function that returns the nearest next power of 2 number. For example if my input is 789, the output should be 1024. Is there any way of achieving this without using any loops but just using some bitwise operators? Random matrix theory impact on covariance matrix analysis If $\sqrt[3]{a} + \sqrt[3]{b}$ is rational then prove $\sqrt[3]{a}$ and $\sqrt[3]{b}$ are rational Assume there exist some rationals $a, b$ such that $\sqrt[3]{a}, \sqrt[3]{b}$ are irrationals, but:  $$\sqrt[3]{a} + \sqrt[3]{b} = \frac{m}{n}$$  for some integers $m, n$  $$\implies \left(\sqrt[3]{a} + \sqrt[3]{b}\right)^3 = \frac{m^3}{n^3}$$  $$\implies a + b + 3 \cdot \sqrt[3]{ab}\left(\sqrt[3]{a} + \sqrt[3]{b}\right) = \frac{m^3}{n^3}$$  Since $a +b$, $\sqrt[3]{a} + \sqrt[3]{b}$ are rational, $\sqrt[3]{ab}$ must be rational as well.   For convenience let us say $\sqrt[3]{a} = p, \sqrt[3]{b} = q \implies pq$ is rational. This means, for all $i$, $p^iq^i$ is rational.  $$\implies (p + q)^2 = \frac{m^2}{n^2}$$  $$ = p^2 + q^2 + 2pq = \frac{m^2}{n^2}$$  Since $pq$ is rational, $2pq$ is rational and so is $p^2 + q^2$.  Assume, for some $i$ that $p^i + q^i$ and $p^{i-1} + q^{i-1}$ is rational.   $$\implies (p^i + q^i)(p + q) - pq(p^{i - 1} + q^{i - 1}) = p^{i+1} + q^{i+1}$$  is rational as well.  So for all $i$,  $$a^{\frac{i}{3}} + b^{\frac{i}{3}}$$  and   $$a^{\frac{i}{3}}b^{\frac{i}{3}}$$  are rational.  I know I'm really close to the answer, but it somehow just keeps slipping through my fingers. Rights if we possess Carta di Soggiorno? I have searched the internet but could not find specific information so if we have got the following document "Carta di Soggiorno di Familiare di Un Cittadino Dell'Unione" (Residence Card of a family member of a Union Citizen, Italy) issued by the Italian authority, what rights do we possess of working inside Italy and EU? What about travelling? Will we be requiring visas for the states which are are not in Schengen? How to read a text file reversely with iterator in C# I need to process a large file, around 400K lines and 200 M. But sometimes I have to process from bottom up. How can I use iterator (yield return) here? Basically I don't like to load everything in memory. I know it is more efficient to use iterator in .NET. (complex measures) $d\nu=d\lambda +f\,dm \Rightarrow d|\nu|=d|\lambda| +|f|\,dm$ and $f\in L^1(\nu)\Rightarrow f\in L^1(|\nu|)$ Two simple exercises on complex measures I don't know how to solve, from Folland's Real Analysis. I find it difficult to manipulate the definitions in computations. For context, if $\nu$ is a complex measure on $(X,\mathcal{M})$ then $|\nu|$ is defined as $d|\nu|=|g|\,d\mu$ where positive measure $\mu$ and $g\in L^1(\mu)$ are such that $\nu \ll \mu$ and $\nu = g\,d\mu$ (and in the textbook it's shown that this definition does not depend on the choice of $\mu$).     1) Let $\nu$ be a reguar complex Borel measure on $\mathbb{R}^n$, $m$ denote   Lebesgue measure, and   let $d\nu = d\lambda + f\,dm$ be its Lebesgue-Radon-Nikodym   representation. Then ("it is easily verified")   $d|\nu|=d|\lambda|+|f|\,dm$.      2) If $f\in L^1(\nu)$ then $f\in L^1(|\nu|)$. I was able to prove the   reverse implication, but not this one.   The definition of $|\nu|$ in the case of real signed measures (as $|\nu|=\nu^+ + \nu^-$) makes sense to me but I can't see intuitively into the definion of $|\nu|$ for complex measures as given in the textbook. Do you have any advice on this?  Thank you!