What is less bad for SEO: to have a  with no heading, or to hide the heading with CSS?
How important are headings in SEO
ProcessStartInfo hanging on "WaitForExit"? Why? I have the following code: info = new System.Diagnostics.ProcessStartInfo(&quot;TheProgram.exe&quot;, String.Join(&quot; &quot;, args)); info.CreateNoWindow = true; info.WindowStyle = System.Diagnostics.ProcessWindowStyle.Hidden; info.RedirectStandardOutput = true; info.UseShellExecute = false; System.Diagnostics.Process p = System.Diagnostics.Process.Start(info); p.WaitForExit(); Console.WriteLine(p.StandardOutput.ReadToEnd()); //need the StandardOutput contents  I know that the output from the process I am starting is around 7MB long. Running it in the Windows console works fine. Unfortunately programmatically this hangs indefinitely at WaitForExit. Note also this code does NOT hang for smaller outputs (like 3KB). Is it possible that the internal StandardOutput in ProcessStartInfo can't buffer 7MB? If so, what should I do instead? If not, what am I doing wrong? In Interstellar, what do Murph and NASA do to save humanity after solving Brand's equation? Do they get the entire human race on giant space ships and transport them to a habitable planet? (How exactly do they do  this?)  If yes, is this habitable planet Edmunds' (the one that Amelia lands on)? SUB-TREE WITHIN A TREE in MySQL  In my MYSQL Database COMPANY, I have a Table: Employee with recursive association, an employee can be boss of other employee. A self relationship of kind (SuperVisor (1)- SuperVisee (∞) ).     Query to Create Table:    CREATE TABLE IF NOT EXISTS `Employee` (   `SSN` varchar(64) NOT NULL,   `Name` varchar(64) DEFAULT NULL,   `Designation` varchar(128) NOT NULL,   `MSSN` varchar(64) NOT NULL,    PRIMARY KEY (`SSN`),   CONSTRAINT `FK_Manager_Employee`                 FOREIGN KEY (`MSSN`) REFERENCES Employee(SSN) ) ENGINE=InnoDB DEFAULT CHARSET=latin1;   I have inserted a set of tuples (Query):    INSERT INTO Employee VALUES   ("1", "A", "OWNER",  "1"),     ("2", "B", "BOSS",   "1"), # Employees under OWNER   ("3", "F", "BOSS",   "1"),   ("4", "C", "BOSS",   "2"), # Employees under B  ("5", "H", "BOSS",   "2"),   ("6", "L", "WORKER", "2"),   ("7", "I", "BOSS",   "2"),   # Remaining Leaf nodes     ("8", "K", "WORKER", "3"), # Employee under F        ("9", "J", "WORKER", "7"), # Employee under I        ("10","G", "WORKER", "5"), # Employee under H   ("11","D", "WORKER", "4"), # Employee under C  ("12","E", "WORKER", "4")     The inserted rows has following Tree-Hierarchical-Relationship:                A     &lt;---ROOT-OWNER         /|\                     / A \               B     F      //| \    \              // |  \    K        / | |   \                       I  L H    C         /     |   / \  J     G  D   E   I written a query to find relationship:    SELECT  SUPERVISOR.name AS SuperVisor,          GROUP_CONCAT(SUPERVISEE.name  ORDER BY SUPERVISEE.name ) AS SuperVisee,          COUNT(*)   FROM Employee AS SUPERVISOR    INNER JOIN Employee SUPERVISEE ON  SUPERVISOR.SSN = SUPERVISEE.MSSN  GROUP BY SuperVisor;   And output is:    +------------+------------+----------+ | SuperVisor | SuperVisee | COUNT(*) | +------------+------------+----------+ | A          | A,B,F      |        3 | | B          | C,H,I,L    |        4 | | C          | D,E        |        2 | | F          | K          |        1 | | H          | G          |        1 | | I          | J          |        1 | +------------+------------+----------+ 6 rows in set (0.00 sec)   [QUESTION] Instead of complete Hierarchical Tree, I need a SUB-TREE from a point (selective) e.g.: If input argument is B then output should be as below...  +------------+------------+----------+ | SuperVisor | SuperVisee | COUNT(*) | +------------+------------+----------+ | B          | C,H,I,L    |        4 | | C          | D,E        |        2 | | H          | G          |        1 | | I          | J          |        1 | +------------+------------+----------+      Please help me on this. If not query, a stored-procedure can be helpful. I tried, but all efforts were useless! How do I select all but two types of entities in Minecraft with the type selector? I've asked this question towards a developer for Minecraft and I thought I'd ask here too since they might not see the question.  How do I select all but two types of entities in Minecraft?  For example, something like: /say @e[type=![Player,Item],r=50] (to clarify I also tried type=Item,Player, type=Item,type=Player etc)  Should select any entity that does not match players or items, so things like Creepers, Ghasts, XPOrbs, PrimedTNT and so on within a radius of 50 blocks and print them to the chat.  Instead it ignores one of the flags, and works with the other instead. Adding Favorites to the Stack Exchange global inbox We're considering adding favorite notifications to the global inbox, and are looking for feedback on the idea (as we're not completely sold on it).  But first, some history.  Favorites are kind of like bookmarks, in that they're kept in a handy centralized place.  They also follow you across browsers.  Ok, ok... "bookmarks, on the internet" is not the most compelling feature, but Favorites also opted you into notices for those questions as if you were the owner (edits and new answers, at least).  This was probably the most confusing part (though a  feature) of the old envelope behavior judging by erroneous bug reports, so a way to opt out of this .  Now, favorite updates go nowhere.  But we could* put them into the inbox.  Here's how we envision this feature working:   Every current user has their "notify me on favorite changes" preference cleared (new users start with it cleared). The first time someone favorites a question, they're prompted to opt-in to favorite notices. Whenever a question is commented on or answered (or, possibly, edited) a new notice is pushed into the inbox of users who have favorited it, and have opted in.   Opt-in would be per-site, and it would remain possible to opt-out from your profile page.   This is not a final design, but the basic idea is correct  As I mentioned above, we're not 100% sold on this idea.  We've had a policy to date that nothing goes into the inbox that isn't specifically targeted at a user; this would be tweaking that policy.  *We could also put changes into their tab on the user page, but that reduces their visibility. mysql_fetch_array does not retrieve all rows Create an instance of a class from a string Prove by mathematical induction that: $\forall n \in \mathbb{N}: 3^{n} > n^{3}$ Prove by mathematical  induction that:   $$\forall n \in \mathbb{N}: 3^{n} &gt; n^{3}$$  Step 1: Show that the statement is true for $n = 1$:  $$3^{1} &gt; 1^{3} \Rightarrow 3 &gt; 1$$  Step 2: Show that if the statement is true for $n = p$, it is true for $n = p + 1$  The general idea I had was to start with $(p+1)^{3}$ and during the process substitute in $3^{p}$ for $p^{3}$ as an inequality.  $$(p+1)^{3} = p^{3} + 3p^{2} + 3p + 1 &lt; 3^{p} + 3p^{2} + 3p + 1$$  Now, if it can be shown that:  $$\forall p \in \mathbb{N}: 3p^{2} + 3p + 1 \leq 2 \cdot 3^{p}$$  ...the proof is complete. This is because $3^{p+1} = 3 \cdot 3^{p}$ and one of those three have already been used.   We do this by mathematical induction. First, the base case of $n = 1$:  $$3\cdot 1^{2} + 3 \cdot 1 + 1 \not \leq 2 \cdot 3^{1}$$  ..which turns out to be false.  What are some more productive approaches to this step? How can I test if a RegEx matches a string exactly?  var r = /a/; r.test("a"); // returns true r.test("ba"); // returns true testExact(r, "ba"); // should return false testExact(r, "a"); // should return true I'd like to see the full How-To on how to use manual partitioning during Ubuntu installation. The existing guides (at least those I found here) cover only automatic part and leave untouched the manual part (or extremely short and contain no pictures).  I'd like to cover such situations:     If your disk contains other systems: Voting on Meta sites generally express agreement and disagreement with a proposal, unlike on the Q&amp;A sites where they indicate useful/good vs. non-useful/bad content.  It seems to me that a down-vote on Meta Stack Exchange should not carry a -1 rep penalty, which only discourages down-voting. With this discouragement, questions on Meta SE will be biased towards agreement, since for every up-voter, there may be several in disagreement who don't want to lose the rep for down-voting.  Can the penalty for down-voting on Meta SE be removed? Is it possible to train a neural network without backpropagation? Many neural network books and tutorials spend a lot of time on the backpropagation algorithm, which is essentially a tool to compute the gradient.  Let's assume we are building a model with ~10K parameters / weights. Is it possible to run the optimization using some gradient free optimization algorithms?   I think computing the numerical gradient would be too slow, but how about other methods such as Nelder-Mead, Simulated Annealing or a Genetic Algorithm?  All the algorithms would suffer from local minima, why obsessed with gradient? Are the various "Zelda" games supposed to take place in a common universe? Finishing a proof: $f$ is injective if and only if it has a left inverse I've already done a lot of searching (in particular: ) to try to prove this statement:      $f: A \to B$ is injective if and only if it has a left inverse. [I'm going to also assume $A$ and $B$ are nonempty.]   My attempt so far:     $\Leftarrow$ Suppose $f$ has a left inverse and $f(a_1) = f(a_2)$ for    $a_1, a_2 \in A$. Then there is a function $g: B \to A$ such that   $g\left(f(a_1)\right) = a_1$ and $g\left(f(a_2)\right) = a_2$. Since   $g$ is well-defined, it follows that $g\left(f(a_1)\right) =  g\left(f(a_2)\right)$, and hence $a_1 = a_2$.         $\Rightarrow$Now   suppose $f$ is injective. Then $f(a_1) = f(a_2) \implies a_1 = a_2$.   Furthermore, since $A$ is nonempty, there is an element $x \in A$.   Define $g: B \to A$ by  \begin{equation*} g(b) = \begin{cases}  f^{-1}(b), &amp; b \in \text{Im}(f) \\ x, &amp; b \in A \setminus  \text{Im}(f)\text{.} \end{cases} \end{equation*} This mapping is   well-defined, since if $f$ is injective, $f^{-1}(b)$ is unique.   My main question: does this imply that if $f: A \to B$ is injective that any mapping $g: \text{Im}(f) \to A$ is bijective? Otherwise, I don't understand why we can even use $f^{-1}$ on an element. [Please read the link above for more details - in proof 1.] I thought I'd post this as it illustrates a problem often encountered on ELU.     In structures such as 'football manager', is 'football' a modifier or   a complement of the head noun?   I've seen both terms used as if there were only one possible correct answer. However, I've come across widely differing definitions of both 'modify' and 'complement' as used in grammar. I believe that people stating baldly that this is either one or the other are assuming a grammar that they prefer, rather than giving a balanced overview.  Notice that I intend this question to explore the usage/s of the term 'modify' and of the term 'complement' in this context. There may be overlap with the question of which word-class 'football' fits into, but that decision hardly answers the question. I'm curious whether I can find the overlap $\langle q | p \rangle$ knowing only the following:   $|q\rangle$ is an eigenvector of an operator $Q$ with eigenvalue $q$. $|p\rangle$ is an eigenvector of an operator $P$ with eigenvalue $p$. $Q$ and $P$ are Hermitian. $[Q,P] = i \hbar$.   I'm asking because books and references I've looked in tend to assume that $Q$ is a differential operator when viewed in the $P$-basis, then show that it satisfies the commutation relation. (I haven't read one yet that proves that the form given for $Q$ is the only possible one.) I've heard, though, that we can work purely from the hypothesis of the commutation relation and prove the properties of $Q$ and $P$ from it. My question is in the title. I'm a little lost in how to solve this problem. There is a hint associated with the problem that states the following:   Use a line integral to show that $ |f(z)| \leq A + |z| $ where A = $\max\{1, |f(0)|\}$  Thanks for the help. In Xubuntu 16.04.3 (and several previous versions aswell) it is not possible to have no power icon in the notification area.  A power icon is displayed even though 'Show system tray icon' is unchecked in Xfce Power Manager.  When 'Show system tray icon' is checked, there are two power icons displayed.  (See screenshots)  I've searched and I can't find any information related to this in Xubuntu/Xfce.  Is there a way to fix or work around this bug? I have installed a package using snap and I need to modify one of the files but when I try to change its ownership or permissions, I always get the following message:  sudo chmod +x ./my_file.js chmod: changing permissions of '/snap/my_app/my_file.js': Read-only file system   How can I modify files that are installed via snap? Should Stack Exchange have a spam filter? (Does it already and I’m not aware?) Of course spam posts should be flagged, and if they come up in review, rejected.  Over on Mi Yodeya during the past 24 hours I’ve helped delete and reject four spam posts through the review queue, and I can only imagine that others were posted over the course of the night. To clarify, I’m referring to edits and answers that were about 99.274% words that I don’t think any decent person would use in everyday discussions, even if someone got them really angry.   Thing is, if the only thing we can do as a community is delete his posts/reject his edits, and as moderators to ban his account, can’t he just create a new account? Further, some of these posts . Maybe the mods can ban his IP address? I’m not one, so I have no idea what kind of power they wield in that respect. But he can always just get a new computer.   I don’t have the numbers to see what this is like on other sites, but I know this doesn’t happen often on Mi Yodeya. I wonder, then, whether this is the optimal solution, or whether an automatic spam filter be put into place - say, a new review queue that automatically deletes posts or rejects edits that can then be voted on whether to be reposted if it’s a false alarm. Perhaps it can be automatically triggered by certain keywords (like ****, %$#^, or @$+^).   Now, all of these posts that I voted to delete/reject came up in Suggested Edits and First Posts. Maybe such edits would show up in Low Quality in general, and that just wasn’t the case here because of precedence rules. I don’t know. But perhaps the above would be a better solution, if this is even as big of a problem as I’m making it out to be.