I'm making a model in Blender and then I think I pressed something on my keyboard and then my hierarchy went missing! How can I bring it back again?  Thanks!
I'm stuck in full screen in the node editor. Escape isn't working, and I have no menus and no idea how to leave except to quit Blender and reopen the program.
I've installed reCAPTCHA module but spam still bypass my security and leave nasty comments. What should I do? How to block them? How are Dementors created/born? This is inspired by some discussions in .  In the Harry Potter universe, how are Dementors born?  Or are they artificially created by some magical means? If a group satisfies $x^3=1$ for all $x$, is it necessarily abelian? I know that any group satisfying $x^2=1$ for all $x$ is abelian. Is the same true if $x^3=1$? I don't think it is, but I can't find a basic counterexample. Add/Show comments focuses text box by default If I open a post using the mobile theme, which has many comments, there is a link at the footer "add/show n more comments". If this link is clicked, the comments are loaded and displayed.   At the moment the text area is automatically focused which is not a great experience (in my opinion), as you have to close the editor and scroll back to the top if you just wanted to read the comments, without adding a new one.  Would it be possible to either   not focus the text area by default and to load only the comments add a new link for adding a comment I'm looking for a good way to perform multi-row inserts into an Oracle 9 database.  The following works in MySQL but doesn't seem to be supported in Oracle.  INSERT INTO TMP_DIM_EXCH_RT  (EXCH_WH_KEY,   EXCH_NAT_KEY,   EXCH_DATE, EXCH_RATE,   FROM_CURCY_CD,   TO_CURCY_CD,   EXCH_EFF_DATE,   EXCH_EFF_END_DATE,   EXCH_LAST_UPDATED_DATE)  VALUES     (1, 1, '28-AUG-2008', 109.49, 'USD', 'JPY', '28-AUG-2008', '28-AUG-2008', '28-AUG-2008'),     (2, 1, '28-AUG-2008', .54, 'USD', 'GBP', '28-AUG-2008', '28-AUG-2008', '28-AUG-2008'),     (3, 1, '28-AUG-2008', 1.05, 'USD', 'CAD', '28-AUG-2008', '28-AUG-2008', '28-AUG-2008'),     (4, 1, '28-AUG-2008', .68, 'USD', 'EUR', '28-AUG-2008', '28-AUG-2008', '28-AUG-2008'),     (5, 1, '28-AUG-2008', 1.16, 'USD', 'AUD', '28-AUG-2008', '28-AUG-2008', '28-AUG-2008'),     (6, 1, '28-AUG-2008', 7.81, 'USD', 'HKD', '28-AUG-2008', '28-AUG-2008', '28-AUG-2008'); Write the digits of a number into an array I received a journal paper for a review. The paper suggests a solution to an important problem, but the solution is very complicated and has mediocre performance. While reading the paper, I thought of a different solution, which is much simpler and has better performance (to give some scale: their solution is 1 page to write and 5 pages to prove; my solution is 5 lines to write and half a page to prove).  What should I do now?  A. Write my solution in the review, hoping the authors will remember to "thank the anonymous reviewer"?  B. Recommend that the paper published as is, then write a paper of my own with my improved solution?  C. Something else?  EDIT: Before I found the superior solution, I thought of recommending "resubmit with major revision", with the reasons that I mentioned above: your solution is too complicated and its performance is too weak.  However, now I am not sure it is the good course of action. A major revision may take a long time. The authors might even decide to delay or stop working on the paper without telling the editor (or me). Meanwhile, I will have to postpone the publishing of the superior solution for an indefinite amount of time. What do you think? How to list only JPEG files from root below using the command line? Shortcut for toggling between different windows of same app? I opened two Google Chrome windows (because I am using multiple Gmails) and when I do the Cmd ⌘ Tab ⇥ shortcut it just shows me other applications that I opened but does not show me the other Chrome windows that are already opened.  How to switch to the other Google Chrome window that I opened using keyboard shortcut? Are "pushforward" and "pullback by zero section" of diffrentials isomorphic in elliptic curves? Let S be a scheme, $p:E\rightarrow S$ be an elliptic curve with zero section $e:S\rightarrow E$. My question is: Are $p_*(\Omega_{E/S}^1)$ and $e^*(\Omega_{E/S}^1)$ isomorphic? I think it's right because I saw both definitions in different notes and they seem to represent the same thing. Thank you! Why doesn't the Moon fall onto the Earth? SharePoint People.aspx Page is Visible for All Users The SharePoint People.aspx page is visible for all users by default. Is there any way to restrict this page from certain readers? I tried different options to enable hibernate in Ubuntu 20.04 but nothing is working. How can I enable hibernate option in Ubuntu 20.04? Can SQL Server's Page Life Expectancy be too high? I've read several articles about SQL Server's Page Life Expectancy and what it means and what kind of information you can glean from it. In most of these articles that I've read, a common, healthy PLE value is somewhere around 1000-2000 seconds. I've read that getting down to around 300 seconds can mean you're likely low on RAM.  I recently just upgraded our hardware to have 64GB of RAM, up from 14GB. On the 14GB my PLE was around 300 seconds, and I was having a lot of 5-6 memory grants pending per second. So, that was bad and I increased the RAM. Now, my PLE is much, much higher around 5000 seconds, and no more pending memory grants. I've seen it 7000 seconds, if I recall. This is much higher than anything I've read.  Can a high PLE be a bad thing? Or is it the higher the better?  EDIT: I'm sorry, my PLE wasn't 7000 seconds, it was 70,000 seconds! Although, at the moment it is down to around 7000.     The database size is around 160GB. A few tables have 5+ million rows. max_server_memory is set to 2147483647. how many semantically different boolean functions are there for n boolean variables? In short, this is an assignment question for a course I am taking - the exact wording is this:  "Given n Boolean variables, how many 'semantically' different Boolean functions can you construct?"  Now, I had a crack at this myself - and got pretty stuck. The question doesnt state how many boolean operators there are (and, or, xor, nand, nor, iff, implies, not) nor does it state whether brackets should be used, i.e. a ^ (b v c) is different from (a ^ b) v c.  So, my question for you is - is this question possible given the limited information available?   Is it going to be something like ${n^x}$ where x is the number of boolean operators.  Any direction here would be greatly appreciated. Closures in a for loop What is wrong with code snippets/blocks on Stack Overflow? I wasn't following Meta Stack Overflow too closely so maybe something was changed that I'm not aware of. But each time I paste a snippet from a Python console I'm getting wrong formatting. What I'm doing wrong? It seems that &gt;&gt;&gt; is confusing for Stack Overflow. I've tried to escape it with backslashes, and it was working fine in preview but doesn't work after the question is rendered.  I was able to observe that problem on: recent Chrome (Windows, Mac), Safari 4 (Mac).  Here is  I wasn't able to make right.  Funny, I think the snippets are rendered just fine on Meta Stack Overflow. Here is one:  &gt;&gt;&gt; def throw(): raise Exception()  ...  &gt;&gt;&gt; a=1 &gt;&gt;&gt; a=throw() Traceback (most recent call last):   File "&lt;stdin&gt;", line 1, in &lt;module&gt;   File "&lt;stdin&gt;", line 1, in throw Exception &gt;&gt;&gt; a 1 The volume of a cone with height $h$ and radius $r$ is $\frac{1}{3} \pi r^2 h$, which is exactly one third the volume of the smallest cylinder that it fits inside.  This can be proved easily by considering a cone as a , but I would like to know if it can be proved or at least visual demonstrated without using calculus. Consider a complete metric space $(X,d)$ and $T\colon X\to X$. Suppose there exists $n\in\mathbb{N}$ such that the n-th power of $T$ is $q$-contractive. Show that then $T$ has exactly one fixed point $\overline{x}\in X$.      The n-th power is defined inductively: $$ T^{n+1}(x):=T(T^{n}(x)), n\in\mathbb{N}. $$ And for a function $T\colon X\to X$, $q$-contractive means  $$ \exists 0\leq q&lt;1~\forall~x,y\in X: d(T(x),T(y))\leq q d(x,y). $$    Now to the proof.  I think I have to show, that $T$ is q-contractive, because then it follows with Banach, that $T$ does have exactly one fixed point. So I have to show, that there exists a $0\leq q&lt;1$ so that for all $x,y\in X$ it is $$ d(T(x),T(y))\leq q\cdot d(x,y). $$ And most likely I have to use the q-contractivity of $T^n$, i.e. that there exists a $0\leq q &lt;1$ so that for all $x,y\in X$ it is $$ d(T^n(x),T^n(y))\leq q\cdot d(x,y). $$  Can you help me? I sometimes browse erotic media files but I would like to avoid having them appear in files &amp; folders / recent. How can I do that?  The old "making .recently-used.xbel a folder" trick from 10.10 and older doesn't work any more.   Plus I'd prefer to turn off tracking only temporarily.  I also prefer not to use a separate user for this, as switching users sometimes isn't fast enough.