I sent a manuscript for publication last month and I just got it back with major revision. There were two reviewers who peer-reviewed the manuscript and both seem to have different opinions regarding the content. One reviewer asked me to omit a graph as he/she deemed it to be useless and didn't add to study narrative while another one commented on improving the graph. They also have different views on sample size of my experiment. One of them though our sample size was small while another one agreed on sample size with only improvement on statistical analysis conducted. They also had divided views on study design. One of them thought our study design was flawed and we should go back to the lab to perform additional tests while another reviewer thought our study design was okay with only missing statistical analysis.  How should I approach this?
A bit of background, I am doing research in atmospheric physics and detection systems  Recently, I received a paper submission back with revisions suggested by a couple of reviewers.  For the most part, the revisions were definitely constructive, justified and most importantly, helpful.    That is, except on one particular crucial aspect of the paper where both reviewers made suggestions, that they labelled as critical for the paper's success.  However, the suggestions were directly opposite.  i.e. Both suggestions are mutually exclusive, but equally feasible.    What is an effective means to address this conflict?  I have spoken to my academic supervisor and he is not sure how to proceed either and we have double checked and both suggested paths are feasible.
Assumptions of linear regression I am able to use the split command successfully to split large file into multiple smaller files. This is being achieved by following command  split -b 1G $temp_path $final_filepath   But only caveat is that these files many times contain last line which is split across 2 files. Is there any way to avoid that using split or any other command ? The indefinite article applied to a group of things Fixed buffers and interior buffers are not working for a polygon that contains a hole I'm using the alpha version of the android app on the first generation nexus 7 tablet.  The font size is a little bit small for my liking and I'm not able to pinch zoom to increase the font size.  Is this a feature that is planned in the release? An inequality for arctan$x$ Why it is true that $|\arctan x-\arctan y|\leq |x-y|$? I have tried to use $\tan x$ but I didn't conclude to something. In the following sentence:     The city is populated by many people.   "many" can be replaced by something like "a great number of" (let us leave the perceived differences between the meanings of these two modifiers out of discussion):     The city is populated by a great number of people.   I understand that this replacement does not change the object "populating the city" from the original "people" to a "number", but rather shows the ability of expressions in the form "[numeral] of" to provide information about the quantity of nouns they modify.  Is this ability due to some special qualities of nouns such as "number", "quantity", "fraction", &amp;c., or is it just one usage of the preposition "of"? Has confinement been experimentally observed? So, confinement has obviously been shown by lattice gauge theory to be a predicted aspect of QCD. However, to what extent has it been observed in experimental physics? This might seem like a very simple question, but what is the easiest way to turn a normal vertical list into a horizontal one? Check for internet connection with Swift Story about protagonist finding a world that has died with a museum of a monic polynomial $f \in \mathbb F\left[x\right]$ in $1$ variable $x$ over a field $\mathbb F$ plays an important role in understanding the structure of finite dimensional $\mathbb F[x]$-modules.  It is an important fact that the characteristic polynomial and the minimal polynomial of $C(f)$ are both equal to $f$. This can be seen quite easily by induction on the degree of $f$.  Does anyone know a different proof of this fact? I would love to see a graph theoretic proof or a non inductive algebraic proof, but I would be happy with anything that makes it seem like more than a coincidence! How can I prove that if $G$ is an Abelian group with elements $a$ and $b$ with orders $m$ and $n$, respectively, then $G$ contains an element whose order is the least common multiple of $m$ and $n$?  It's an exercise from Hungerford's book, but it's not homework. I could not solve it when I take the course on groups and I think it should be easy. There is a hint that says to first prove when $m$ and $n$ are coprimes. I did this part. But I have no idea how to solve the general case.  Thanks. Please excuse the selfishness of the following question:     Let $G$ be a group and $H \le G$ such that $|G:H|=2$. Show that $H$ is normal.   Proof:  Because $|G:H|=2$, $G = H \cup aH$ for some $a \in G \setminus H$.   Let $x\in G$. Then $x \in H$ or $x \in aH$.  Suppose $x \in H$. Then $xhx^{-1} \in H$ because $H$ is a group.  Suppose $x \in aH$. Then $ahH(ah)^{-1} = ahHh^{-1}a^{-1} = a(hHh^{-1})a^{-1}$ ***1  ***1: Can I say now that $x \in H$, based on the that $hHh^{-1} \in H$ and that $aa^{-1} = e$ ?  Thank you for the time you spent reading my doubts. Let $C_k$ be the set obtained in the $k-$th stage of building the Cantor set, where  $$C_1=[0,\frac{1}{3}]\cup[\frac{1}{3},\frac{2}{3}]$$  $$C_2=[0,\frac{1}{9}]\cup[\frac{2}{9},\frac{1}{3}]\cup[\frac{2}{3},\frac{7}{9}]\cup[\frac{8}{9},1]$$  $$\dots$$  So we have   $$C_k=\bigcup_{j=1}^{2^k}I_{k,j}$$  where $I_{k,j}$ are pairwise disjoint closed intervals of length $3^{-k}$ in $[0,1]$, let  $$[0,1]\setminus C_k=\bigcup_{j=1}^{2^k-1}J_{k,j}$$  where $J_{k,j}$ are pairwise disjoint open intervals and each $J_{k,j}$ are located between intervals $I_{k,j},I_{k,j+1}$  define  $$F_k:[0,1]\to[0,1]$$  where  $$F_k(0)=0,F_k(1)=1,F_k(x)=\frac{j}{2^k}\quad x\in J_{k,j}$$  and $F_k$ is linear on each subinterval of $C_k$. We can show that $F_k$ converges to the Cantor function $F:[0,1]\to[0,1]$. Moreover, it can be shown that  $$|F_k(x)-F_k(y)|\leq\frac{3^k}{2^k}|x-y|$$  How can we show that $F$ is Hölder continuous of order $\log_32$ ? Restoring backups failing Ubuntu 16.04 Copying applications from applications folder to external and reinstalling osx Is it possible to copy all my applications from the applications folder onto an external, format my mac, reinstall OS X and finally copy the applications back into the applications folder for installing them?  Will that work? I am asking because my macbook seems to be behaving in a very odd manner, has become excessively sluggish and is preventing me from recording anything in logic.. I have tried the usual freeing up space, clean desktop, fixing permissions, verifying and repairing disk as well as resetting pram and making sure I have all the latest software and firmware updates. The macbook is only 8 months old and is running Lion with 8gb of ram, I really cannot understand what is wrong with it. Even when trying to watch a movie, the player will get serious audio/video synchronisation issues and I noticed that every time my wifi is on the fans speed up like a plane taking off. I even checked and it is clean from any dust. I am perplexed :(   If anyone could help me please, I would greatly appreciate it.  Thanks in advance! Give an example of a relation R on $A^2$ which is reflexive, symmetric, and not transitive I am just looking for some clarification on this exercise:  Let $A = \{a,b,c,d\}$. Give an example of a relation $R$ on $A^2$ which is reflexive, symmetric, and not transitive.  I understand that if I was only dealing with $A$ and and not $A^2$ I could give an answer similar to:  $R = \{(a,a),(a,b),(a,d),(b,a),(b,b),(c,c),(d,a),(d,d)\}$  Here $R$ is reflexive, symmetric, and not transitive.  What is confusing me is the fact that we have $A^2$. I am not sure what I am missing here. I am looking through my book to see if I can figure this out, but if someone could help shed some light on this it would be appreciated.  Thanks,  Tony Cartesian Product of Two Countable Sets is Countable How can I prove that the Cartesian product of two countable sets is also countable? Can anyone explain why following code won't compile? At least on g++ 4.2.4.  And more interesting, why it will compile when I cast MEMBER to int?  #include &lt;vector&gt;  class Foo {   public:       static const int MEMBER = 1;   };  int main(){       vector&lt;int&gt; v;       v.push_back( Foo::MEMBER );       // undefined reference to `Foo::MEMBER'     v.push_back( (int) Foo::MEMBER ); // OK       return 0; }