From      SIGQUIT is the dump core signal. The terminal sends it to the   foreground process when the user presses ctrl-\. The default behavior   is to terminate the process and dump core, but it can be caught or   ignored. The intention is to provide a mechanism for the user to abort   the process. You can look at SIGINT as "user-initiated happy   termination" and SIGQUIT as "user-initiated unhappy termination."   $ sleep 100 ^\[1]+  Done                    nohup sleep 100 Quit (core dumped)   But I can't find the dump file in the current directory. Where is it? Thanks.
Scenario (Ubuntu 16.04):  I compile and run a C program (with -g, I get the traditional Segmentation Fault (core dumped), and then (of course) there is no mythical "core" file to be found. Some digging says to modify /proc/sys/kernel/core_pattern with a command to the effect of: echo '|tee /home/me/my_core_folder/my_core_file' | sudo tee /proc/sys/kernel/core_pattern, and after doing this, I stop getting (core dumped) and start only getting the plain Segmentation Fault. I try things like gdb ./program_object_file.out core.pid which obviously doesn't exist (I was getting desperate), and of course try the plain gdb ./a.out followed by (gdb) core core.pid and variants of the commands where I spam the tab key desperately trying to get auto-completion to get me to where I need to be.  Question:  Is there a generalized way I can get to core dumps? I recognize that every machine that I touch seems to have a Michael Bay's Transformers-esque ability to reconfigure hardware and software such that no device I own can be expected to work normally out-of-the-box. Is there a simple algorithm/recipe I can follow to locate core dumps on my own machine as well as on other peoples' machines? I always find myself tutoring friends on stuff like this after no small amount of  work to get things working for myself and it would be nice to be able to run a command or something to get core files dumped to the directory which the executable was run from... is there any way to do this that should work on most (I would settle for "some") Linux/Unix machines?
I’m looking for an adjective/ noun that describes a person who loves life, traveling, great food, always doing things which gets adrenaline kicking and is a always ready for attempting things for pleasure only Is denying "Paradoxical Partitioning" equivalent to accepting the Axiom of Choice? In  (to ) it has been noted:     One more point to make about the paradoxical decomposition to more parts than elements [...]   currently we do not know of any model of +$\lnot$ where such decomposition does not exist.    Namely, as far as we know, in all models where choice fails there is some set which can be partitioned into more parts than elements.   (Just for clarification: From the context of the above references the comparison "more parts than" is obviously meant in terms of the  of the suitable  being strictly larger than the cardinality of the suitable initial set itself.)  Now, I find the negation or denial of such "paradoxial partitioning" interesting; i.e. the statement (proposition, "$\lnot$PP"):  "Each partition of each given set has cardinality less than, or at most equal to, the cardinality of the given set."  And I like to further explore how this suggested "proposition $\lnot$PP" (being considered along with ZF, of course) relates to "the standard set theory including Axiom of Choice", . Therefore  My questions:      Are there any models of ZFC known (or could there be any such models, in principle) in which there is some set which can be partitioned into more parts than elements ?  And:  Are there any models of ZF known (or could there be any such models, in principle) in which there is no set which can be partitioned into more parts than elements, and which is not also a model of ZFC ?  (And just for reference: Is there a conventional or concise way of expressing the suggested "proposition $\lnot$PP" in terms of standard notation, such as used in the sources linked above? Has it perhaps been discussed already, by some other name? ...) Problem with IMPORTRANGE function in Google Sheets I’m trying to get IMPORTRANGE to work for me with no success. I made two simple spreadsheets:  and . In the destination sheet I’m using the import range function:  =importrange(“1-5F1_zz0ZpGj7SfeQhewsCe0CsrA0eyPbjfmUrLBsyk”,”Sheet1!a1:a1”)   I tried already:   Replacing the , with ; Referencing just the key as well as the full URL in the first argument Switching from “ to ‘ With the sheet name and without it   Not sure what else to do.  Any ideas? What does the term "86'd" relate to? What does it mean when someone or something is referred to as being "86'd"? back-up: which patitions to back-up before upgrading/reinstalling I have Ubuntu13.04 on my laptop. I have to upgrade it to the next release or else I would install a fresh release after deleting my current system.  I have already installed and configured my current system a lot and I can't take the burden of doing it all over again if I install the next release. Now I would like to know that what all back-ups are required to be taken beforehand so that I would recover all my files/installations/configurations etc. In other words I should have everything on my new system (simply by restoring from back-ups) that I possess currently.  My current system has /, /boot, /home &amp; swap partitions which were created by me when I had freshly installed the O.S. Filter questions with no accepted answer I have some questions with answers, but none of the answers are acceptable (just wrong).  I'm sure there are a lot more people with the same problem.  Can you add a button to filter questions with answers but no accepted answer?  This way, people will see those questions and maybe try to offer a new perspective. Any way to sync directory structure when the files are already on both sides? I have two drives with the same files, but the directory structure is totally different.  Is there any way to 'move' all the files on the destination side so that they match the structure of the source side? With a script perhaps?    For example, drive A has:    /foo/bar/123.txt /foo/bar/234.txt /foo/bar/dir/567.txt   Whereas drive B has:  /some/other/path/123.txt /bar/doo2/wow/234.txt /bar/doo/567.txt   The files in question are huge (800GB), so I don't want to re-copy them; I just want to sync the structure by creating the necessary directories and moving the files.  I was thinking of a recursive script that would find each source file on the destination, then move it to a matching directory, creating it if necessary. But -- that's beyond my abilities!  Another elegant solution was given here: Why are mutable structs “evil”? Following the discussions here on SO I already read several times the remark that mutable structs are “evil” (like in the answer to this ).  What's the actual problem with mutability and structs in C#? Usage of dash (-) in place of a filename For a command, if using - as an argument in place of a file name will mean STDIN or STDOUT.   But in this example, it creates a file with the name -:  echo hello &gt; -   How can I make - in this example mean STDOUT? Conversely, how can I make - mean a file named - in examples such as:  cat - Enable External Sharing Programmatically We have a scenario on which we are creating site collections from a provider-hosted app. Some of these site collections will be used by external users. Is there a way from CSOM (server-side) to enable external sharing on the site collection? I haven't found any resources stating whether this is or not doable.  I'm trying to replicate the settings you can specify at the site collections page on the tenant admin site:    Thanks! Find children of the process How to get a list of current open windows/process with Java? Does any one know how do I get the current open windows or process of a local machine using Java?    What I'm trying to do is: list the current open task, windows or process open, like in  Windows Taskmanager, but using a multi-platform approach - using only Java if it's possible. The question is, what elements on a DM screen are essential? I'm new at playing and DMing, altough a lot of experience watching games, just got a group to play with now. Started with the starter set in 5E and the Lost Mine of Phandelver adventure, however I've noticed the game can come to a stop when checking the rules or how to do something, while getting the books and stuff like that. So I thought to make a DM screen with some cheat sheets, of the most usual things new players, and new DM's have doubts on, and how to make the game flow well without long rule-checking breaks. What are the essential things to have on that screen? So far this is what I found  but not sure if it has all I need or so much stuff that'll also make the game stop a lot while cheking it out. Resistors in series vs parallel There is a restriction on setting your birthday:     Oops! There was a problem updating your profile:   - Birthday must be after 1920/01/01   I realize the number of 90 year old users is small, but shouldn't the restriction be a bit more relaxed, such as larger than any ?  Either 120 or 150 seems appropriate.  For example, my grandfather turns 90 next year (and just barely misses the current cutoff), but I can't imagine he's the only one around that age who is computer literate and still active enough to be interested in (the increasingly broad range of) SE sites.  I don't think he has contributed yet (mostly because of the comment restriction, I'd see him commenting before asking or answering), but I have emailed him with links that I know he's read.  Incidentally, the error message is wrong: birthday must be after 1919/12/31 and using the next day is accepted. Limit of function of hyperbolic How can I - without using derivatives - find the limit of the function  $f(x)=\frac{1}{\cosh(x)}+\log \left(\frac{\cosh(x)}{1+\cosh(x)} \right)$  as $x \to \infty$ and as $x \to -\infty$?  We know that $\cosh(x) \to \infty$ as $x \to \pm \infty$ thus $\frac{1}{\cosh(x)} \to 0$ as $x \to \pm \infty$.  And I imagine that $\frac{\cosh(x)}{1+\cosh(x)} \to 1$ as $x \to \pm \infty$ thus $\log\left(\frac{\cosh(x)}{1+\cosh(x)}\right) \to 0$ as $x \to \pm \infty$.  Is this approach sufficiently formal?  Any help is appreciated. How to make itemize/enumerate/description environment robust to missing \item elements? Is there any way to make LaTeX tolerate empty itemize/enumerate (i.e. no \item)?  Specifically, I would welcome any package/elegant hack that would gracefully "cancel" a list if no elements are found (instead of firing up a Latex Error).  Before jumping to the obvious answer (which I expect would be something along the lines of "don't use itemize if you don't have items to put in" ;)) please consider my use-case:   I want to format remotely stored elements (say, bibliographic items), which I can only access as an XML file.  &lt;elems&gt;   &lt;bibelem&gt;&lt;title&gt;Cool result 1&lt;/title&gt;&lt;author&gt;joe&lt;/author&gt;&lt;/bibelem&gt;   &lt;bibelem&gt;&lt;title&gt;Cool result 2&lt;/title&gt;&lt;author&gt;jim&lt;/author&gt;&lt;/bibelem&gt; &lt;/elems&gt;  I have a python script that downloads/parses the XML and outputs its content in a file bib.tex as a list of Latex macros-decorated data  \BibElem{Cool result 1}{joe} \BibElem{Cool result 2}{jim}  Now, I want to grant the end-user complete control over the styling of her/his produced document, so the intended usage within Latex is something like  \documentclass{article} \begin{document}   \newcommand{\BibElem}[2]{\item {\em #1} by {#2}}   \begin{itemize}     \input{bib.tex}   \end{itemize} \end{document}    The rationale behind this design choice is that the user should be restricted as little as possible in her/his styling choices. For instance, the user may either want to display the bibelems within a list as shown in the example, or may prefer a fancy-formatted tabular. On the other hand, the user should design the latex document once, and should be able to run it regardless of the amount of data produced by the source.  Therefore, the python script cannot make any assumption regarding the context in which its latex product will be included, and it should be up to the user to deal with empty bibliographies, i.e. with empty lists. How could one possibly do that?  Update: Werner proposed a nice solution that redefines the list environment to make Latex oblivious of the fact he is currently in a list. However, this only seems to work if the empty list is the last list in the document, as revealed by the following mwa:    \documentclass{article} \makeatletter \newenvironment{myitemize}   {\itemize}   {\@newlistfalse\enditemize} \makeatother \begin{document}   % Empty Itemize   \begin{myitemize}   \end{myitemize}   % Next non-nested itemize environment (can be itemize/enumerate/description)    \begin{myitemize}     \item Arghh!   \end{myitemize} \end{document} How to create bootable ISO from an installed OS? Say I have two systems A and B.  I have installed Ubuntu 12.04 on system A and need same set of settings in system B, for which I am thinking to make a bootable iso from System A(creating as a backup). so that I can make Live USB from the generated iso and boot the System B which will be now the replica of System A.  Could you please tell is there any method or tool in doing this process? Duplicate questions that use different words to describe the same problem are important for people to find the content via search engines. But the user experience when an anonymous user arrives at a duplicate is less than ideal.  They have to notice the duplicate link and understand that the answer they are looking for is likely behind that link. I don't think this is all that obvious to someone without experience with an SE site.  I propose to just redirect users to the duplicate automatically if the closed duplicate has zero answers. In that case they need to follow the link to the duplicate in any case, so we might as well redirect them to it in the first place.  I could imagine this being problematic with search engines, as we would be displaying different content than what the search engines see. If that is too problematic I would suggest to show a very obvious link to the duplicate in the answers section for anonymous users. Questions can be closed or marked as duplicates.  What does it mean for a question to be &quot;closed&quot;? What does it mean for a question to be marked as a &quot;duplicate&quot;? Who can close a question? What are the reasons for closing a question ? Is closure the end of the road for a question? When are closed questions eligible for deletion?   Related        For more information, see &quot;&quot; in the .