After doing a t-test that showed a significant difference, I did an ANCOVA with 3 covariates. The ANCOVA showed no significant effect of the variable that did show a significant difference in the t-test. However, one covariate showed a significant effect. This confused me a bit, so I have a few questions:     What does it mean dat the significant difference found in the t-test is no longer significant when doing an ANCOVA? How to interpret the significant covariate in my ANCOVA?
The coefficient of an explanatory variable in a multiple regression tells us the relationship of that explanatory variable with the dependent variable. All this, while 'controlling' for the other explanatory variables.  How I have viewed it so far:  While each coefficient is being calculated, the other variables are not taken into account, so I consider them to be ignored.   So am I right when I think that the terms 'controlled' and 'ignored' can be used interchangeably?
How can I disable the "no backup in x days" from TimeMachine? (Updated answer choice for High Sierra. See the old answer if you are still on Yosemite)  I'm running OS X Yosemite, and I want to disable the notifications from Time Machine. I rarely do a hard-drive backup because all of my essential files are in the cloud. I don't need to run timemachine as often as it suggests/warns/annoys me about.  How do I disable the notifications? Time Machine is not in the Notifications preferences, and I don't want to stop using it entirely. I use the highlight mode in vim to copy a few characters.  I then want to paste more than once.  My current technique does not work well.  Sample text: Linux Solaris Irix HP-UX  Suppose I want to copy the word Linux, then paste over Solaris and Irix.   Place cursor at L in Linux Command v (for visual hilite), then e (for end-of-word), then y (for yank/copy) Now Linux is on my "vim clipboard" Move cursor to S in Solaris (first instance) Command v (for visual hilite), then e (for end-of-word), then p (for paste) Text is now: Linux Linux Irix HP-UX, but now Solaris is on my "vim clipboard" Move cursor to I in Irix (second instance) Command v (for visual hilite), then e (for end-of-word), then p (for paste) Text is now: Linux Linux Solaris HP-UX which is not what I expected.   I resort to using highlite/paste with the mouse (via X Terminal).  Surely, I can do this better.  How? What is the difference between convolutional neural networks and deep learning? What makes induction (over natural numbers) a valid proof technique? Is $$ \dfrac{ P(0) \quad \forall i \in \mathbb{N}. P(i) \Rightarrow P(i+1) }{ \forall n \in \mathbb{N}.  P(n)} $$ just taken for granted as a proof rule, or can it be derived from more foundational axioms?  Similarly, can the principle of induction over well-founded sets be derived from something more foundational, or does it have to be assumed to be a valid inference rule? For example:  me$ FOO="BAR * BAR" me$ echo $FOO BAR file1 file2 file3 file4 BAR   and using the \ escape character:  me$ FOO="BAR \* BAR" me$ echo $FOO BAR \* BAR   I'm obviously doing something stupid.  How do I get the output BAR * BAR? Is there a difference between "think of something" and "think about something"? I've also met "have heard of/about something". Can I use Wubi for manual installation? Is it possible to use Wubi for Ubuntu 13.04? I read that it will not be supported in the official release due to some problems. Is this going to change in the future, and can we expect to see a future release with support for 13.04? What is the white smoke-like fog called? Need to proof by induction (calculus1 n and n+1) Limit of Multivariate Probability Density Function as one or more or all variables approach positive or negative infinity Could someone point out a good source or provide justification as to whether the limit of a multivariate probability density function, as one or more or all variables tends to positive or negative infinity, goes to zero.  $$\lim_{x_{1}\to\pm\infty}f(x_{1},x_{2},...,x_{n})=0$$  $$\lim_{x_{1},x_{2}\to\pm\infty}f(x_{1},x_{2},...,x_{n})=0$$  $$\lim_{x_{1},x_{2},...,x_{n}\to\pm\infty}f(x_{1},x_{2},...,x_{n})=0$$  I have found this related question for the univariate case: Javascript remoting: to invokeAction or not to invokeAction Digging in deeper to Javascript Remoting and I'm a bit confused.  The  starts off by showing how to set up everything and uses code like the following:  function getRemoteAccount() {     var accountName = document.getElementById('acctSearch').value;      // This remoting call will use the page's timeout value     Visualforce.remoting.Manager.invokeAction(         '{!$RemoteAction.AccountRemoter.getAccount}',         accountName,          handleResult     ); }   However, I've also seen examples where Visualforce.remoting.Manager.invokeAction is never called.  They end up looking something like the following:  function getText() {   var text = "";   JSRemotingBasicsController.doGetText(     function(result, event) {       // do something here     }   ); }   I'm wondering what is the point to using Visualforce.remoting.Manager.invokeAction when you can just reference the RemoteAction directly like the second example?  Is there something I'm missing?  Is there a time where the second example doesn't work? How to evaluate this infinite sum?  $$\sum_{n=1}^{\infty}\frac{1}{2^n-1}$$ How many combinations of groups are there where no member of a group has been with another member before? I found this hard to word in the title, so let me give an example. I have 16 students, and I want to split them up into 4 groups of 4. However, I want to make sure that every time I have a new combination of groups, that a student has never been with any of their new groupmates before. I found info on how to separate objects into groups, but not in only unique ways as I've described above. I think I figured this out the rote way, by assigning each student a number and then finding the unique combinations, and got 3. But I'd like to know the math behind it, and how it could be applied to other configurations (20 students w/ 4 groups of 5?). Thanks for any help you can give! How to make an embedded question from "What time is it?" If the original question is "What time is it?" and I want to communicate it to another person, are these Embedded Questions OK?        I don't know what time is it.       or        I didn't know what time was it. (if communicated later) He is loved.   This is something that I've always kind of wondered.  In a sentence like this, is loved a verb or an adjective? Can it be considered either? Is it wrong to ask the same question elsewhere? I just posted a question to  and afterward realized that it might not be answered very quickly due to how specific it was. So I also posted it on the   I plan to update both the SU and Ubuntu posts with the final answer I end up using, but I can't help but feel users from both places might not like that I've posted to both.  So my question is: Is it frowned upon to post the same question elsewhere and link to it? What are the primary differences between the rules of D&D 3.5 and Pathfinder? What are some of the rule changes that Pathfinder brings in comparison to D&amp;D 3.5?  I am curious what changes were made so I can explain to my group what it has to offer. How do you mock a Sealed class? can be quite a pain.  I currently favor an  to handle this, but something about just keeps feels weird.    So, What is the best way you mock sealed classes?  Java answers are more than welcome.  In fact, I would anticipate that the Java community has been dealing with this longer and has a great deal to offer.  But here are some of the .NET opinions: $\DeclareMathOperator{\Char}{char}$$\DeclareMathOperator{\Aut}{Aut}$ Let $G$ be a finite group, $H$ a subgroup, such that $H \Char G$. If $\phi \in \Aut(H)$ is there an automorphism $\widehat{\phi} \in \Aut(G)$ such that $\widehat{\phi}|_H$ = $\phi$?  In words, if $\phi$ is an automorphism of $H$, is there necessarily an automorphism $\widehat{\phi}$ of $G$ where $\widehat{\phi}$ maps the elements in $H$ to $H$ in exactly the same way?  I am thinking this is false (consider the non-finite example of $\bar{Q}$ and $\mathbb{C}$), but would like a counter example (for the finite case). How to make Blender use Python2.x?