This is the link to my zipped dump file, any help would be greatly appreciated.
I see you have succussfully answered this question previously but it is not specific to my system.  I have downloaded your file and created the relevant dump file but I don't know how to analyse it. Can I upload it to you for some advice please?
Force MacBook to drain the battery while connected to charger I leave my MacBook Pro on my desk nearly all the time, connected to the charger with the lid closed, connected to an external display.  I've heard this is bad for the battery health, and everyone in my office have to replace swollen batteries every couple of years. I want to regularly discharge the battery, per , but I don't want to physically unplug it because that temporarily turns off the external monitor, and then I have to reconnect the monitor.  So I am looking for a software method of disabling the power input, to force the laptop to discharge its battery to 20% and then re-enable the power input. In a letter-class document that had no previous errors I am suddenly getting the error message:  "There's no line here to end" \opening{text}   I've used this file many times and today it starts giving this error. How do I troubleshoot this? I am working on a few examples where my author said this is true if $h$ is continuous. Can someone explain why? Just because the integral is $0$ doesn't mean the integrand is zero as well.   $\int_{a}^b h^2=0\implies h=0$? Editing network interfaces without system rebooting I'd like to make some changes to my networking configuration by editing my /etc/network/interfaces file. What's the cleanest way to make changes to this file and have them take effect, without having to reboot? Typically, I've been doing:   Edit the file service networking restart   But I have the impression that this isn't the "right" way to make these kinds of changes. Difference between Hashing a Password and Encrypting it The current top-voted to  states:     Another one that's not so much a security issue, although it is security-related, is complete and abject failure to grok the difference between hashing a password and encrypting it. Most commonly found in code where the programmer is trying to provide unsafe "Remind me of my password" functionality.   What exactly is this difference? I was always under the impression that hashing was a form of encryption. What is the unsafe functionality the poster is referring to? Thought Experiment - Poking a stick across a Black Hole's Event Horizon The classical explanation of a black hole says that if you get to close, you reach a point - the event horizon radius - from which you cannot escape even travelling at the speed of light. Then they normally talk about spaghetti.  But here's a thought experiment. What if I have a BH with event horizon radius R such that the gravitational gradient at the event horizon is far too weak for creating pasta. I build a Ring with radius R+x around the BH. Then I lower a pole of length x+d from my ring towards the BH, so that the tip passes beyond the event horizon.  Now what happens when I try to pull the pole back? How do I mount a qcow2 disk image? What do the E and R prefixes stand for in the names of Intel 32-bit and 64-bit registers? The problem is to prove that every Hilbert space has a orthonormal basis. We are given Zorn's Lemma, which is taken as an axiom of set theory:  Lemma If X is a nonempty  with the property that every  of X has an upper bound in X, then X has a maximal element.   Given a orthonormal set $E$ in a Hilbert space $H$, it is apparently possible to show that $H$ has an orthonormal basis containing $E$.   I tried to reason as follows: Suppose $E$ is a finite set of $n$ elements. Then one can number the elements of $E$ to create a totally ordered set of orthonormal elements. Then the span $&lt;E&gt;$ can be identified with $R^n$, where each element $v = v_1 e_1 + v_2 e_2 + ... + v_n e_n$ is identified with the vector $(v_1, v_2, ..., v_n)$. On $R^n$ we have a total order, namely the "lexigraphical order" $(x_1,x_2,...,x_n) \leq (y_1,y_2,...,y_n)$ if $x_1 &lt; y_1$ or if $x_1 = y_1$ and $x_2 &lt; y_2$ or if $x_1 = y_1$, $x_2 = y_2$ and $x_3 &lt; y_3$ and so on. Hence $E$ is a totally ordered subset of $H$ and $H$ is a partially ordered set. However, this set doesn't seem to have an upper bound. The set $E$ does have an upper bound. If we define a total order on $E$ only, then X is a partially ordered set satisfying the criteria so X has a maximal element?   This is as far as I got, and I am not sure the entire argument is correct. I don't see how what kind of maximal element I am seeking, since the orthonormal basis of a Hilbert space can have countably infinity number of elements. href to an image label - how to jump to the image instead of the caption below the image? How can I search for special characters? Situation: It started out as me  for the literal string C-c in  but it ended up omitting the - sign and showing results which contained the strings C/C++ and C &amp; C++.  is an example of a post which contains that string of characters (yet fails to show up in the results).  Things I've tried:   post suggests that I can use the undocumented code: operator, but when I do that, it just wraps the whole term in double quotes like .  As @terdon in Unix &amp; Linux chat has , using this  does yield some relevant results, but it doesn't show me  that is supposed to be there. edit: It appears that the Symbolhound query no longer returns that result.  Finally,  says that you can search for literal characters, but as you can see:    Quoted phrases are exact matches except for case-sensitivity, for example, you can search  or .  The second example (symbols) leads to 0 results.  So by now I assume that the search engine has changed (but the old documentation still lingers on this site). Is there a method for me to search for strings that include special (or is it literal?) characters? Deleting missing data with CountryData Is it possible to experimentally show that observable universe is much larger than ~93B ly? Thought experiment:   Entangle a pair of particles.  Package one half of each pair in a special package, and send it out in a nano-spaceship keep the other half of the pair of entangled particles here on earth accelerate nano-spaceship to 99.99999999999999% of the speed of light using a number of    Due to Lorentz ,  $$ L = L _\text{0} \sqrt {1 - \frac {v^{2}}{c^{2}}} $$  In one years time, the spaceship would have traveled 93B ly away from us (in the spaceships relative frame)  After one year of travel, the spaceship could be preconfigured to detect the CMB in the direction of travel, and then trigger their quantum entangled particle to send a '0' or a '1' depending on whether the CMB was detected.  Repeat this process using any number of spaceships in any number of directions, and soon you would experimentally show how big the universe really is.  Any problems? Word order: "10 minutes more" or "10 more minutes"? If A and B are symmetric is AB=BA true? Question  if we have matrices $A$ and $B$ which are symmetric. Both of these satisfy: $$  A=A^T$$ Is $AB=BA$ true ?  Attempt to solve  Now if $A$ and $B$ are symmetric then $AB$ most be symmetric too.  $$ AB=(AB)^T=B^TA^T=BA $$  problem is how do you proof that if $A$ and $B$ are symmetric also $AB$ is symmetric ?  If somone could provide some insight on this that would ge highly appreciated.  Thanks,  Tuki "Planar" graphs on Möbius strips When I am at my desk and my laptop is in its docking station I want to ensure that it uses its wired connection and not my wireless network. I am hoping/guessing that the preference in connection is based on the order of the listed connections in the Network and Sharing Center. I could just switch the wireless off but I'd prefer to not have to go through the trouble. Cauchy-Schwarz inequality proof (but not the usual one) Before you downvote/vote-to-close, I am not asking for a proof of: $$\sum^n_{i=1}a_ib_i\le\sqrt{\sum_{i=1}^na_i^2}\sqrt{\sum^n_{i=1}b_i^2 } $$ Which is what EVERY link I've found assumes is the inequality (for a proof of that see:  )    I am reading a book that claims the Cauchy-Schwarz inequality is actually: $$\vert\langle x,y\rangle\vert\le\Vert x\Vert\Vert y\Vert$$ where $\Vert x\Vert :=\sqrt{\langle x,x\rangle}$  with the additional claim: equality holds $\iff\ x,y$ are linearly dependent  I cannot find a proof of this claim (only proofs for the dot product inner product). My question is: what is the simplest way to prove this (I define simplest to mean "using as few definitions outside of the inner product itself as possible" - so that's not including Gramm-Schmitt orthonormalisation, for example.)  I've just found some possible answers in the links on the right (annoyingly) but fortunately I have a second, albeit softer, question:  What inequalities that are common for say $\mathbb{R}^n$ are actually based on the inner product?   (In future I will check this site first, I was targeting lecture notes and such in my search)  Addendum: I want to use this on not-finite dimensional vector spaces. I've found one proof that relies on finite-ness. Test model coefficient (regression slope) against some value In R, when I have a (generalized) linear model (lm, glm, gls, glmm, ...), how can I test the coefficient (regression slope) against any other value than 0? In the summary of the model, t-test results of the coefficient are automatically reported, but only for comparison with 0. I want to compare it with another value.  I know I can use a trick with reparametrizing y ~ x as y - T*x ~ x, where T is the tested value, and run this reparametrized model, but I seek simpler solution, that would possibly work on the original model. How do I share a folder on SAMBA?