I know how to disable ctrl-D by set -o ignoreeof, which applies when logged in over ssh as well.. But I only want to disable it when it is about to quit a local shell. How can I then?  In interactive bash shell, ctrl-d is used to delete characters in front, and to indicate the end of stdin input, and also makes bash quit.  Sometimes when I delete characters in front by ctrl-d, I hold the keys too long, and accidentally make bash quit. How can I prevent accidentally making bash quit?
I am often logged in several SSH sessions at once. To logout from several sessions, I press CTRL+d, until I am back on my local machine. However, I occasionally press it once too many, and my terminal exits. Is there a way to make CTRL+d unable to close my terminal ? I am using terminator as my terminal emulator.
My desktop look is empty so all I have is a nice wallpaper. My Windows taskbar has the "Taskbar Appearance" setting to "Auto-hide the taskbar". Although hidden, it leaves a thin top layer so you can still see it a bit, and where the pinned shortcuts are. Is it possible to totally have it hidden without a trace? This is a serious question. It really bugs m. Prevent questions with movie/tv shows/game spoilers from appearing in the hot questions list I've noticed that occasionally "hot questions" from SciFi and the Movies &amp; TV network contain major spoilers about the movie/show discussed.  The Matrix spoilers:      (just now there's something about Cypher betraying Morpheus in the Matrix, which is a big deal for people who haven't seen the movie).   I like browsing through those but fear that one day one of these questions will spoil a show I'm excited about and yet to finish   Breaking Bad spoilers:      (like the finale of Breaking Bad, imagine a question asking why did one character betray another at the end or something).   Can users posting such questions be asked to label those with a tag (such as 'spoilers') and then somehow have the network hide those from the "hot questions" list? Or possibly format them differently?  Similarly, this could apply to the Arcade network too.  P.S. Love how this question spikes in popularity around the time GoT starts running again. I swear it should be fairly simple technically to ban questions that have a tag that says 'spoilers' from appearing in the Hot Network Questions.  P.P.S. Oh, and with every fresh release of Star Wars (The Last Jedi being the most recent one)!  P.P.P.S. Another year, another Game of Thrones, another spike in popularity! Minimize the sum of distances between two point and a circle Let's $A$,$B$ and $O$ be random point in a plane, such that they are not colinear. Let's $c$ be a circle centered on $O$, such that points $A$ and $B$ are outside of it. Find a point $X$ that lies on the circle $c$ and the sum $AX + BX$ is minimal.  First I tried to minimize the function:  $$f(x,y) = \sqrt{(A.x - x)^2 + (A.y - y)^2} + \sqrt{(B.x - x)^2 + (B.y - y)^2}$$ with  constraint $$g(x,y) = x^2 + y^2 - r^2 = 0$$  By moving $O$ to $(0,0)$ and do the same with $A$,$B$ so the relative distance will not change.  But these works when we know the coordinates of $A$,$B$ and the radius of the circle. Yet this isn't the right way because the problem is to construct that point.  Later I tried to approach using geometry.  The smallest distance from the point $A$ to the circle is the intersection of the circle $c$ and the ray $OA$, this is the same for $B$. Then we construct circles centered on $A$ and $B$ that are tangent to $c$. If the two circle intersect we'll get a common point for the both $A$ and $B$ and the distance will be minimal. Using computer I find the point X should be somewhere around the intercetion of the circle $c$ and the ray from $O$ to the new point.   Sometimes the optimal point differs just a bit and also this method fails when the two circles do not intersect each other This is kind of a weird request. For some reason whoever owns safeandbuy.com has pointed their domain at my IP address. The reason it's a problem is that I'm having all kinds of crawlers that are trying to crawl my site with that domain name.   Is there anything I can do about this? Why doesn't saturation current in the photoelectric effect depend on the frequency of light absorbed ny the metal emitter? For any triangle with sides $a$, $b$, $c$, show that $a^2b(a-b)+b^2c(b-c)+c^2a(c-a)\ge 0$ I am trying to run a function from  in ArcMap 10.1; Sink evaluation. But before it can finish it returns an error message, that, frankly, I don't understand at all.  It goes System.runtime.interopservices.comexception (0x80004005): error hresult e_fail .  Can anyone help me solve this? I have tried all I can think of. Run the function from the toolbox instead of dropdown menus, shorten paths, restart ArcMap, reinstall AHT, open new map documents, restart my computer, wait till next day and see if it automagically have fixed itself...   After searching this forum I found a , although it's got no answers. Now I'm all out of ideas, can anyone please help me?!    I'm using ArcMap 10.1 SP1 basic license and Windows 7.    I think I have narrowed it down a bit, still not clear what's wrong though. Sink evaluation uses a series of functions in Arcmap, of which one is Zonal statistics as table. That's the one it gets stuck on. The input raster somehow does not exist, path unknown. I guess this is some intermediary raster.       After consulting the Arc Hydro team, I got the advice not to use grids stored in a gdb (which I didn't). I have also tried to change target locations, thanks to @G.Oxsen. Unfortunately neither of those solved the issue. According to the Arc Hydro team, GPL0 that I asked about earlier is an in-memory grid, so probably no problem there.   I am currently pursuing that it is related to the installation of SP1. Anyone out there using AHT with SP1 and got Sink evaluation working?    Uninstalling SP1 did not change anything, unfortunately. Still working on this, but with less intensity. Seems like I'll have to find workarounds...    By reducing the number of sinks in need of processing I managed to get Sink evaluation running. Having the files not stored in a gdb seem to help as well, as mentioned earlier, and using integer grids.  Changing the "Maximum number of unique values to render" in ArcMap Options (Customize menu), tab Raster --> Raster dataset is another tip that I got (from the Arc Hydro Team). Restarting ArcMap after running every one or two functions also helps keeping things stable. How to solve missing libmng.so.1 in Trusty (14.04) Package is no more available I would like to run SoulseekQT. However unfortunately one of the dependencies is libmng1, which is no more included in Trusty. sudo apt-get install libmng.so.1 or libmng1 or libmng1:i386 in Trusty (14.04) no more available. Do you have any idea how to solve this conflict? I mean is it really sure that libmng1 is excluded? Could I use libmng2 somehow instead? If not, could I somehow rebuild libmng1 for Trusty? Or do I have to downgrade back to Saucy (13.10)? UISearchDisplayController - how to preload searchResultTableView Will my checked luggage freeze in the airplane? I'm taking some freeze-sensitive items in a checked luggage for a short flight. It's cheese, chocolate, toothpaste and wine. I would like to know whether the luggage can get "frozen" in the aircraft. Sometimes it happened to me that my stuff actually was quite cold after the flight, so I'd like to be quite sure. Especially the cheese was really expensive and freezing it would very likely demage it.  Usually I pack everything well in clothes, but this time the things are just too many so it's tough to do more than just protect the wine from breaking.  Some details: It's an A320 flight taking 1.5 hours, with Czech Airlines, from Paris CDG to Prague PRG. Changing my Apple ID's email: address is not available An awful lot of people seem to use the phrase "substitute X for Y" to mean "replace X with Y", while I've always used and understood it as "replace Y with X". This makes sense to me, given that a substitute is the replacement, not the thing which has been replaced.  I thought I might be able to figure things out from a dictionary, but now after seeing two sorts of definitions, I'm even more confused:   to put or use in the place of another to take the place of; replace   The first one suggests that the object will be the substitute (replacement), the thing put into place, while the second suggests that the object will be the thing which has been replaced.  Is one of these usages more correct in any sense? (I know this is probably a pointless question, since people will continue to speak the way they speak.) Is there perhaps a difference between American and British English?   And most importantly, is there any reliable way to tell what someone means when they ask how to substitute honey for sugar, or is the verb simply guaranteed to cause confusion? Here is a sentence excerpted from ,     Teen suicide is a growing health concern. It is the third-leading cause of death for young people ages 15 to 24, surpassed only by homicide and accidents, according to the U.S. Center for Disease Control and Prevention.   I've heard people use both "people aged from X to Y" and "people ages from X to Y" quite often, but I've always been believing that only the former is grammatically correct, whereas in the latter the "ages" doesn't seem to serve as any grammatical component of this sentence. So when I see an APA paper use "ages" in that way, I am just quite surprised: I just can't believe such an authoritative and rigourous academic institution will let such an explicit (and indeed naive, even to a non-native speaker's eyes) grammatical mistake survive in their publications. I'm aware that in daily language usage one ought not to become so fussy over insignificant matters like this, but I do wonder whether it should be paid attention to in academic writings.  OR, using "ages" in that way is no longer considered a grammatical mistake? Honestly I don't think this'd be true, but if it really is, I'd be grateful to be informed. Thanks! why are the best questions the ones which have been closed? I frequently come across a really useful answer on StackOverflow which has been closed because it doesn't match the Q&amp;A format.  Examples include  ,  ,   ,  and there are others.  Where should this information be exchanged if it's not on stackoverflow?  It seems the moderators are often somewhat overzealous...  ---edit  When I say best, I mean they are informative and useful for someone who's looking for an answer to them.  Even if they do become a bit of a discussion, I value other people's opinions on the relative merits of the different JPA frameworks.  I come here looking to choose one and the answer helps me.  So what if it's not a definitive answer?  ---edit  I don't care how popular a question is, nor how interesting it is.  Users are interested in stuff that's useful to them.  Plenty of those were useful (as judged by the upvotes on the answers: 'This answer is useful'), but closed because they didn't have a definitive answer, as far as I can tell.  ---edit  Seems I'm not the first person to think this: there are various similar questions to mine like this one:   In it the user lists lots of other useful questions which have been closed:                    So isn't there a place on stackoverflow for these questions?  A discussion section, maybe? How often do you have to roll a 6-sided die to obtain every number at least once? I've just played a game with my kids that basically boils down to: whoever rolls every number at least once on a 6-sided die wins.  I won, eventually, and the others finished 1-2 turns later. Now I'm wondering: what is the expectation of the length of the game?  I know that the expectation of the number of rolls till you hit a specific number is  $\sum_{n=1}^\infty n\frac{1}{6}(\frac{5}{6})^{n-1}=6$.  However, I have two questions:   How many times to you have to roll a six-sided die until you get every number at least once?  Among four independent trials (i.e. with four players), what is the expectation of the maximum number of rolls needed? [note: it's maximum, not minimum, because at their age, it's more about finishing than about getting there first for my kids]   I can simulate the result, but I wonder how I would go about calculating it analytically.    Here's a Monte Carlo simulation in Matlab  mx=zeros(1000000,1); for i=1:1000000,    %# assume it's never going to take us &gt;100 rolls    r=randi(6,100,1);    %# since R2013a, unique returns the first occurrence    %# for earlier versions, take the minimum of x    %# and subtract it from the total array length    [~,x]=unique(r);     mx(i,1)=max(x); end  %# make sure we haven't violated an assumption assert(numel(x)==6)  %# find the expected value for the coupon collector problem expectationForOneRun = mean(mx)  %# find the expected number of rolls as a maximum of four independent players maxExpectationForFourRuns = mean( max( reshape( mx, 4, []), [], 1) )  expectationForOneRun =    14.7014 (SEM 0.006)  maxExpectationForFourRuns =    21.4815 (SEM 0.01) Origin of the Mustache Twirling Villain Whenever someone thinks about silent cinema the image of the laughing villain, twirling his mustache, and tying the hapless blonde beauty to the railroad, pops up in our collective memory. But in which movie (or movies) did that particular image first appear? What USB drive filesystem works out of the box on Windows, Linux, and OS X? Infinite distinct factorizations into irreducibles for an element Consider the factorization into irreducibles of $6$ in $\mathbb{Z}[\sqrt{-5}]$. We have $6=2 \times 3$ and  $6=(1+\sqrt{-5}) \times (1-\sqrt{-5})$, i.e. $2$ distinct factorizations. And,  $$6^2=3 \times 3\times2\times2$$ $$=(1+\sqrt{-5}) \times (1-\sqrt{-5}) \times (1+\sqrt{-5}) \times (1-\sqrt{-5})$$ $$=(1+\sqrt{-5}) \times (1-\sqrt{-5})\times3\times2.$$ More generally, $6^n$ will have $n+1$ distinct factorizations into irreducibles in $\mathbb{Z}[\sqrt{-5}]$ by a simple combinatorial argument. But, can we construct a ring in which there exists an element that has an infinite number of distinct factorizations into irreducibles? To make life harder, can we construct an extension of $\mathbb{Z}$ in which this happens? I have been thinking about this for a while and have managed to find no foothold.. Any help is appreciated. I'm a fourth year undergraduate student in a university in the U.S., and this is my last semester. I have already applied to graduate schools, and I'm currently awaiting responses. Since I have already finished all my requirements and am ready to graduate, I wanted to go part time this semester. I am aware of how it affects my financial aid; however, I do not know if it has an effect on my admittance to graduate school. I do not mean whether or not I get accepted (the decisions will happen without knowledge of my current semester), but whether I am eligible to attend graduate school if I have been part time for a semester. That is, will there be any potential issues when the schools that have accepted me see my final transcript and see I was part time? Is there a universal answer to this? Or should I contact each school individually and ask about their policy?   Also, are there any other potential issues with going part time that I haven't mentioned? Anything noteworthy I might have missed? If you create a scene for the Video Sequence Editor and start working on a project Blender will render the output from the VSE. But if you want to later switch it to render your 3D scene again (the camera output) where is the setting to select the source?  Usually I keep a separate .blend for VSE edits so I don't need to switch, but I feel like I ought to learn how to do this as it's pretty basic. I would expect to find this in the Render context but I see no place to specify the source.  Thanks.