I would like to calculate Cohen's d for 2x2 ANOVA interaction (nationality: Germany, France; gender: male, female).   Someone asked similar question earlier (), and got an advise to calculate Cohen's d using (a1 - b1) - (a2 - b2) as a numerator and the square root of the MSE from the ANOVA as a denominator.  Could someone please tell me a reference, where I could find more information how to calculate Cohen's d using this formula? I really cannot find any. What would a1, a2, b1 and b2 be in my case?
I have a significant 2x2 interaction in a between-subjects design.  I would normally report omega-squared as my effect-size measure, but I've been asked to provide Cohen's d instead?  Can Cohen's d be computed for an interaction?  If so, how?
How can I update my OpenGL to 3.0 or higher Microdisplacements with adaptive subdivision turning black evaluate $\int_{0}^{\infty}\cos(t) t^{z-1}dt=\Gamma(z)\cos(\frac{\pi z}{2})$ Generalized mean value theorem I know and understand the mean value theorem. But at the moment I don't have the intuition to understand the generalized mean value theorem     If $f$ and $g$ are continuous on the closed interval $[a,b]$ and differentiable on the open interval $(a,b)$, then there exists a point $c\in(a,b)$ where$$[f(b)-f(a)]g'(c)=[g(b)-g(a)]f'(c).$$If $g'$ is never zero on $(a,b)$, then the conclusion can be stated as$$\frac{f'(c)}{g'(c)}=\frac{f(b)-f(a)}{g(b)-g(a)}.$$   What is the intuition? And how can you prove this (generally) ? Issue with 'StringVar' in Python Program How to properly install Java in OS X Allow new users to comment for X times in a day While reviewing "First Posts" on Stack Overflow, I often come across new users posting comments as answers. It seems (at least to me) they are not doing this because they are unaware of how Stack Overflow works but because they can't comment on any question they are forced to put it as answer.  I have found duplicate questions for my request like:   ,  and    but the best explanation I have found is an  to .     I think the main reason this isn't supported is there's no way to   downvote comments, which would make them attractive to spammers. If   somebody comments on the top answer in a question the only way to get   rid of it is for six people to flag it. Comment flags don't show up on   10k tools, so it needs to be six people that happen to stumble across   the spam comment, or a moderator that checks the list manually. People   can comment every 15 seconds, so that can get out of hand pretty   quickly. Comments also aren't listed on the user's profile page, so   it's hard to see at a glance if a user has been spamming   So I am suggesting allowing new users (with less than 50 reputation points) to comment only 5 times every day or only 25 times times until they reach 50 reputation points or any other variation of it. My computer only has one USB-C port and I want to connect multiple USB-C devices to it.  I have trawled through Amazon but am amazed that I cannot find a single one. There are many hubs that have USB 3.1 USB-A ports but not USB-C ones.  Is there a limitation in the spec that prevents this being possible? Do professors care about their rating on websites such as RateMyProfessor or Koofers? I am wondering if a professor is already an Associate Professor, do they still care about their reputation in the eyes of the department considering tenureship is already granted? Remove category & tag base from WordPress url - without a plugin Why is the gravitational force always attractive? I have a class like this:  public class myClass {   public List&lt;myOtherClass&gt; anewlist = new List&lt;myOtherClass&gt;;    public void addToList(myOtherClass tmp)   {     anewList.Add(tmp);   }  }   So I call "addToList" a hundred times, each adding a unique item to the list.  I've tested my items to show that before I run the "addToList" method, they are unique.  I even put a line in to test "tmp" to make sure it was what I was expecting.  However, when I do this (lets say myClass object is called tmpClass):  int i = tmpClass.anewList.Count(); for (int j = 0; j&lt;i; j++) {    //write out each member of the list based on index j... }   I get the same exact item, and it's the last one that was written into my list.  It's as if when I add, I'm overwriting the entire list with the last item I've added.    Help?  This makes no sense. I've also tried List.Insert, where I'm always inserting at the end or at index 0.  Still no dice.  Yes, I'm doubly source my indexing is correct and when I do my test I'm indexing through each of the elements.  :)  UPDATE: Okay, I tried this and still had the same problem:  foreach(myOtherClass tmpC in tmpClass.anewList) {         Console.WriteLine(tmpC.theStringInMyClass.ToString()); }   and still for each of the 100 items, I got the same string output... I'm sure I'm doing something completely stupid, but I don't know what yet. I'm still 100% sure that the right string is getting passed in to begin with.  -Adeena    Okay, I tried this and still had the same problem:  foreach(myOtherClass tmpC in tmpClass.anewList) {     Console.WriteLine(tmpC.theStringInMyClass.ToString()); }   and still for each of the 100 items, I got the same string output...  I'm sure I'm doing something completely stupid, but I don't know what yet. I'm still 100% sure that the right string is getting passed in to begin with.  -Adeena When asking about , people sometimes refer to the strict aliasing rule. What are they talking about? How can I compile this successfully? I have to use algpseudocode package to improve my paper look like more professional   But I can't compile successfully.  \usepackage{amsmath} \usepackage{algorithm} \usepackage[noend]{algpseudocode}  \makeatletter \def\BState{\State\hskip-\ALG@thistlm} \makeatother  \begin{document} \begin{algorithm} \caption{AIP}\label{euclid} \begin{algorithmic}[1] \Procedure{MyProcedure}{} \State $\textit{locationAgent} \gets \text{position of }\textit{{agent}}$ \State $\textit{locationMD} \gets \text{position of }\textit{{MD}}$ \If {\textit{distance(eNB,$agent_i$)}}&gt;$\delta$ \BState \emph{loop}: \State $j \gets \textit{patlen}$ \If {$\textit{string}(i) = \textit{path}(j)$}\Return TURE \State $j \gets j-1$. \State $i \gets i-1$. \State \textbf{goto} \emph{loop}. \State \textbf{close}; \EndIf \State $i \gets i+\max(\textit{delta}_1(\textit{string}(i)),\textit{delta}_2(j))$. \State \textbf{goto} loop \EndProcedure What happened to Charles Xavier after X-Men 3? I remember watching X-Men 3 and seeing Charles Xavier get disintegrated by Phoenix, however the post-credits scene and his appearance in later movies indicate that he actually survived. How is that possible? Explain why $E(X) = \int_0^\infty (1-F_X (t)) \, dt$ for every nonnegative random variable $X$ I work with QGIS 2.10.1 on Windows 7 (x64). I have dissolved polygons from an attribute value and the polygons geometries being not perfectly joined together, I get some 'garbage' nodes I need to delete. I have tried to edit the layer and using nodes tool, selecting and deleting the nodes, but it seems impossible to do (nodes are not deleted at all!). Any idea on how to process this kind of clean-up?  EDIT : you can  for testing. How to implement uniform grids Up until now, I implemented all-against-all collision detection in my games. It worked fine.  But I reached a point where implementing this kind of collision detection, makes the game run poorly, because there are two many objects to iterate through and check for collision.  I have searched this site and found something about 'uniform grids'. But I didn't completely understand what it is and how to implement it. Tried to Google it but nothing easy enough to understand came up.  I am a beginner to 2D-game programming. Do you mind trying to explain to uniform-grids, or link me to some good tutorial?  Thanks a lot Convert generic List/Enumerable to DataTable? I have few methods that returns different Generic Lists.   Exists in .net any class static method or whatever to convert any list into a datatable? The only thing that i can imagine is use Reflection to do this.  IF i have this:  List&lt;Whatever&gt; whatever = new List&lt;Whatever&gt;();   (This next code doesn't work of course, but i would like to have the possibility of:  DataTable dt = (DataTable) whatever; I thought that there was no need to scan for viruses either in Ubuntu or any Linux distros until I found virus scanner packages clamtk and klamav in Ubuntu software center yesterday.  This leads to the following questions:   How do viruses differ between Linux and Windows? How do the strategies for protection differ between Linux and Windows? Should a virus scanner package be installed on my system? If so, which would be a better option?