Possibly a simple / daft question so apologies in advance...  Suppose I have several independent observations of a continuous variable, like height. The observations are grouped, and I would like to test whether the groups have significantly different distributions. If the groups are nominal I would use a one-way ANOVA, if continuous I would use a mixed-model, but what should I use if the groups are ordinal but not at regular intervals?  For example, for the continuous variable "height", nominal groups might be English people vs Swedish people vs French people --> ANOVA, if the 'groups' are Age --> Mixed model, but if the groups are, say, "Self-reported weekly exercise", or "eating your greens", where ordinal categories might be: not at all, mild, moderate, lots, what would people suggest?
I am trying to analyze data based on a sample size of around 50 and would appreciate advice on which statistical test would be most appropriate. Participants, on a single questionnaire, were asked to complete two different sections. Variable 1: rating Likert items on a scale from 1-5 (strongly agree to disagree). Variable 2: rating Likert items of a validated tool on a scale of 1-9, which is averaged to obtain a single number.  My research question is: Do those who 'agree' with the statement in the first section significantly differ in terms of their scores on the variable 2, compared to those who 'disagree'? (ex. Do participants tend to 'agree' with "I like to read books for pleasure." have higher IQs (variable 2) than those who 'disagree'?)  I was advised by a colleague to run a one-way ANOVA with variable 1 (categorical) as IV and variable 2 (continuous) as DV.   Question 1: My independent variable is the three groups: 'agree', 'neutral', and 'disagree.' (I combined strongly agree with agree because of low frequencies and likewise for strongly disagree and disagree.) However, there are many more participants in the 'agree' category than in the 'disagree' category. The distribution is, on average, around 44 agrees, 3 neutrals, and 3 disagrees. Do the (very) unequal sample sizes prevent me from performing ANOVA, or any other tests? Which test would be most appropriate for this analysis?  Question 2: I would like to run analyses on all of the Likert items, which is more than 10 statements. (ex. Seeing how IQs correlate with agreement to many statements including “I like to read books for pleasure,” “I watch a lot of TV,” “I exercise more than 30 minutes each week,” etc.) I was planning to do a Bonferroni correction to adjust for the multiple tests. Would this be correct, and help make my analyses more robust? Note: The continuous data are not normally distributed (there is negative skewness), but I seem to be able to correct the skewness using logarithmic transformation.  Any advice or suggestions for papers to read would be appreciated. Thank you!
How many constructor arguments is too many? Let's say you have a class called Customer, which contains the following fields:   UserName Email First Name Last Name   Let's also say that according to your business logic, all Customer objects must have these four properties defined.  Now, we can do this pretty easily by forcing the constructor to specify each of these properties.  But it's pretty easy to see how this can spiral out of control when you are forced to add more required fields to the Customer object.    I've seen classes that take in 20+ arguments into their constructor and it's just a pain to use them.  But, alternatively, if you don't require these fields you run into the risk of having undefined information, or worse, object referencing errors if you rely on the calling code to specify these properties.  Are there any alternatives to this or do you you just have to decide whether X amount of constructor arguments is too many for you to live with? Am I being scammed by a sugar daddy? Why not group search results by thread? I like the new search, but the listing can become quite verbose. That is generally excellent because Stack Exchange is searching in more places. But now that you  to the original question, it becomes quite difficult to remember "that's not the question(s) I want &hellip; that's not the question(s) I want" when the questions' answers appear dozens of times scattered throughout the listings.  Why not group same-question entries together in the search results?  I realize that each individual post wont be sorted strictly "by relevance", but the most relevant question threads will be listed first&hellip; making it easier to skip over those entries once you decide that's not the question you're looking for.  Consider what we have now &mdash;  Apple SE > Search "Exchange contacts"   A: Exchange contacts do not appear in iCloud A: Exchange contacts do not appear in iCloud Q: iPhone Contact Sync A: How to use Gmail contacts on an iPod Touch A: Exchange contacts do not appear in iCloud A: Exchange contacts do not appear in iCloud A: How to use Gmail contacts on an iPod Touch A: Exchange contacts do not appear in iCloud A: Exchange contacts do not appear in iCloud A: iPhone Contacts Sync Q: Best way to transfer iphone contacts away from Exchange server Q: Can I use Google's new CardDAV-based contacts sync to sync between my Exchange contacts and … A: How to delete contacts from iPhone? A: Can I use Google's new CardDAV-based contacts sync to sync between my Exchange contacts and … : etc, etc. :   Once I realize I don't want that iCloud question&hellip; or that iPod Touch question&hellip; or that sync question &mdash; or a dozen others &mdash; it becomes extremely cumbersome to remember and search the listings for questions I didn't eliminate yet.  I'm not suggesting rolling up the results back to the original question&hellip; just grouping these posts together (I like seeing each answer-match with the text excerpt underneath). But once I eliminate the question entirely, it would be nice to scroll past those entries to continue my search&hellip; without all the noise of those entries reappearing over and over again in the search results. Sed -- Replace first k instances of a word in the file I want to replace only the first k instances of a word.  How can I do this?  Eg. Say file foo.txt contains 100 instances occurrences of word 'linux' .  I need to replace first 50 occurrences only. I'm looking into developing an ordering app for a potential client. The main part that I'm concerned about in this question is the payment mechanism. I would assume that there are already multiple plugins or similar programs out there, but I'm not sure where (or if) I should be asking for recommendations. I am trying to use netcat to send a simple message over TCP, e.g. I want to send the digit 1.  So I understood that I write the following in the terminal, after installing netcat  netcat [ip-address] [port]  But how do I specify the message to be sent? i.e. where to I write "1" ? Potential energy of an infinitesimal length of elastic rod I am comfortable with the different sizes of infinities and Cantor's "diagonal argument" to prove that the set of all subsets of an infinite set has cardinality strictly greater than the set itself. So if we have a set $\Omega$ and $|\Omega| = \aleph_i$, then (assuming continuum hypothesis) the cardinality of $2^{\Omega}$ is $|2^{\Omega}| = \aleph_{i+1} &gt; \aleph_i$ and we have $\aleph_{i+1} = 2^{\aleph_i}$.  I am fine with these argument.  What I don't understand is why should there be a smallest $\infty$? Is there a proof (or) an axiom that there exists a smallest $\infty$ and that this is what we address as "countably infinite"? or to rephrase the question "why can't I find a set whose power set gives us $\mathbb{N}$"?  The reason why I am asking this question is in "some sense" $\aleph_i = \log_2(\aleph_{i+1})$. I do not completely understand why this process should stop when $\aleph_i = \aleph_0$.  (Though coming to think about it I can feel that if I take an infinite set with $\log_2 \aleph_0$ elements I can still put it in one-to-one correspondence with the Natural number set. So Is $\log_2 \aleph_0 = \aleph_0$ (or) am I just confused? If $n \rightarrow \infty$, then $2^n \rightarrow \infty$ faster while $\log (n) \rightarrow \infty$ slower and $\log (\log (n)) \rightarrow \infty$ even slower and $\log(\log(\log (n))) \rightarrow \infty$ even "more" slower and so on).  Is there a clean (and relatively elementary) way to explain this to me?  (I am totally fine if you direct me to some paper (or) webpage. I tried googling but could not find an answer to my question) What is the best file extension for an SEO friendly URL? I'm working for a website to convert the website URL to an SEO friendly URL. I plan to use this:  example.com/category-name/pageid-123-page-name  I looked at some similarly categorized, highly ranked websites. They have the same structure, except for one thing. In one case, the URL format was  example.com/category-name/pageid-123-page-name.html  Another was   example.com/category-name/pageid-123-page-name.php  Now I know the text in URLs help with SEO. Is it more helpful to have a file extension? If yes, which one is better?  Or if my current plan is okay, will it be better with a / at the end? What are the main differences between undergraduate, master's, and doctoral theses? When I did my undergraduate thesis, my adviser was expected big on students expecting them working really hard, so it ended up as a reduced master's thesis (most of the reviewers said that it was an overkill for a B.E).  So because of this, I did my master's thesis pretty much in the same way I did my bachelor's thesis; the PhD dissertation was a different story.  What are the principal differences between these three pieces of research? Cardinality of a totally ordered union How can a particle's position be random and uncertain in quantum mechanics if it is already pre-determined in relativity? Set the maximum character length of a UITextField Setting up LVM Snapshot as a backup/restore point in ubuntu Setting up LVM Snapshot as a backup/restore point in ubuntu. Why? Well, as I see it, with all the great usefulness of Linux, its biggest drawback is with its mixed up way of installing apps. All the dlls go to one directory. All the configuration files to another. And the binaries are also put in a bunch. Yes, Windows works the same way more or less, but with the nature of system/server software installed on Linux, being that most of the software installed is only about 95% mature at any given time, messing up your system twice a month is very probable.. Of course, we can backup the system before and after each installation, but that takes a million years. System backups (as oppose to just data/files backup) requires you to turn off you computer and use some form of bootable live CD and a backup media. And, if the drive is more than 15% full, it might take a long time to do the backup, even with modern hardware. So, how can this be done? PostgreSQL Shapefile import failed I am very new to PostGIS/PostgreSQL. In fact, I downloaded it because of the answers I got to this question:   I installed both PostgreSQL and PostGIS. But I am not able to import a shapefile to the database? It gives an error, "Shapefile import failed". What am I doing wrong? If $z$ lies on the circle $|z-1|=1,$ then the value of $\frac{z-2}{z}$ is If $z$ lies on the circle $|z-1|=1, $ then the what is the value of $\frac{z-2}{z}$ ($z\ne 0 \ \text{and} \ 2$ ) is?  What I am aware of : the equation $|z-1|=1$ represent a circle with  centre $(1,0)$ and radius $1$. Also $$|z-1|=1 \implies (z-1)^2=1 \\ \implies  z^2-2z+1=1 \implies z(z-2) =0$$ $\implies z = 0; z =2 $ I think this is wrong.. please suggest thanks.. When a 0-1-matrix with exactly two 1’s on each column and on each row is non-degenerated? [1] Let $A$ be an $n\times n$ matrix with entries in the set $\{0,1\}$ which has exactly two ones in each column and two ones in each row.  Give necessary and sufficient conditions for the rank of $A$ to be $n$. Calculating Statistics Based on Expression in QGIS? Is it possible to calculate the sum of polygon areas based on whether or not it has a value in another column?   For example:  In column 2 I have the area of polygons. I want to calculate the area of all polygons that contain 'AG' in column 1 or all polygons that are IN column 1. But calculate them separately so I can get the total area of each type in column 1. Show that $a(-1) = (-1)a = -a $. In a ring $R$ with identity 1, show that $$a(-1) = (-1)a = -a \qquad\forall\, a \in R$$ I have started with $a + (-a) = 0$ but cant proceed from here. $\text{Let }y=\sqrt{5+\sqrt{5-\sqrt{5+\sqrt{5-...}}}} $, what is the nearest value of $y^2 - y$? I found this question somewhere and have been unable to solve it. It is a modification of a very common algebra question.          $\text{Let }y=\sqrt{5+\sqrt{5-\sqrt{5+\sqrt{5-...}}}} $,  what is the     nearest value of $y^2 - y$?          $\textbf {(1) } 1 \qquad \textbf {(2) } \sqrt5 \qquad \textbf {(3) } 4 \qquad \textbf {(4) } 2\sqrt5$      I worked the problem and got $$y^2 - y = 5+ \sqrt{5-\sqrt{5+\sqrt{5-...}}} -\sqrt{5+\sqrt{5-\sqrt{5+\sqrt{5-...}}}} \\ = 5+ \sqrt{5-y} - y = 5-y + \sqrt{5-y}$$ What do I do next?