I have two sets of count data, one with the application of drug and another without applying the drug. Let's assume the data at condition $1$ are $X_i^1$ and $X_j^1$. Similarly for condition $2$, the data is $X_i^2$ and $X_j^2$. Moreover we assume that the individual count data comes from a poisson distribution. So $X_i^1 \sim \lambda_i^1$, $X_j^1 \sim \lambda_j^1$, $X_i^2 \sim \lambda_i^2$, $X_j^2 \sim \lambda_j^2$. Now I frame my hypothesis as follows,  \begin{align} H_0 : \frac{\lambda_i^1}{\lambda_j^1} &amp;= \frac{\lambda_i^2}{\lambda_j^2}  &amp; H_1 : \frac{\lambda_i^1}{\lambda_j^1} &amp; \neq \frac{\lambda_i^2}{\lambda_j^2} \end{align}  So the intuition is if the ratio of rates does not change across conditions then we accept the null hypothesis, otherwise we reject it. I am searching for a mathematical analysis on this framework, that is, what should be the estimates for $\lambda$ in this situation. Please let me know if there is any paper that explained it.
So, for fun, I am taking some of the data of calls from the call center I work at and trying to do some hypothesis testing on them, specifically the number of calls received in a week, and using a Poisson distribution to fit it. Due to the subject matter of my job, there are two types of weeks, let's call one of them on-weeks where I hypothesize there are more calls, and off-weeks where I hypothesize there are fewer.  I have a theory that the $\lambda$ from on-weeks (let's call it $\lambda_1$) is larger than that of the one from off-weeks (let's call it $\lambda_2$)  So the hypothesis I want to test is $H_0: \lambda_1 &gt; \lambda_2, H_1: \lambda_1 \leq \lambda_2 $  I know how to test for one parameter (say  $H_0: \lambda_1 &gt; 1, H_1: \lambda_1 \leq 1 $) but not so sure how to go about doing 2 given a data set. Let's say I take two week's worth of data from each one $X_1 = 2$ and $X_2 = 3$ for the off-week and $Y_1 = 2$ and $Y_2=6$ for the on-week. Can someone help walk me though this simpler version such that I can apply it to a larger data set? Any help is appreciated, thank you.
Given two date ranges, what is the simplest or most efficient way to determine whether the two date ranges overlap?  As an example, suppose we have ranges denoted by DateTime variables StartDate1 to EndDate1 and StartDate2 to EndDate2. How can swapoff be that slow? Somehow I happened to swap out 14 GB of memory. After having killed the culprit, I have tons of free memory again, so I thought I could  again. So with 5 GB out of 32 GB used and 14 GB of swap space used, I ran swapoff -a.... and 4 hours later about half of the work was finished.  This means less that 1 MB/s, while I can easily copy 200 MB/s. My swap is encrypted but so are all normal partitions and with  it leads to no noticeable CPU load (and filling the swap space took only a few minutes). I see that there's no special reason to optimize swapoff, however I wonder how it could get that slow?    Just adding some more data: My main memory is 32 GB and I have 32 GB swap space on each of 4 harddisks (surely an overkill, but who cares?). The whole swap space can be  (decrypted and) read in less than 5 minutes:  time -p sudo sh -c 'for i in /dev/mapper/cryptswap?; do md5sum $i &amp; done; wait' 014a2b7ef300e11094134785e1d882af  /dev/mapper/cryptswap1 a6d8ef09203c1d8d459109ff93b6627c  /dev/mapper/cryptswap4 05aff81f8d276ddf07cf26619726a405  /dev/mapper/cryptswap3 e7f606449327b9a016e88d46049c0c9a  /dev/mapper/cryptswap2 real 264.27   Reading a part of a partition can't be slower than reading it all. Yet reading about 1/10th of it takes about 100 times longer.  I observed that during swapoff both the CPU was mostly idle (maybe 10% of one core) and so were the disks ("measured" by the LEDs). I also saw that the swap spaces were turned off one after the other. Why do people risk death by joining Starfleet if not for money or preservation of their homes? Watching Star Trek made me think of a few "deeper" questions about Starfleet, which are all related to the Star Trek TV series.  So, let's take for example the Dominion War: people are dying every second, ships get destroyed and cadets are still joining although they know they are probably going to die unless they are with Picard or Sisko.  As I read and got to understand, money has no value anymore, latinum is the general trading currency in the universe. But people on Earth don't trade and don't earn their paychecks. Earth is a much better place than today and yet young boys and girls from every culture/civilization are joining Starfleet as they are willingly signing their death note.  Why are they joining, what motivates them? They might know that they're probably going to die.  They don’t earn paychecks. They could be doing any other job, yet they choose this. And what's more interesting how many died on battlefields must be lined up in front of StarFleet every day?  What do they receive after service? Why are they doing it other than preserving their homes? Non in front of hyphenated adjective Weird future tense usage I am now reading  book and have noticed a couple of cases of weird (for non-native speaker) future tense usages.   The point of the kata is to train your fingers and your brain. I'll do a kata or two every day, often as part of settling to work. I might do it in Java, or in Ruby, or in Clojure, or in some other language for which I want to maintain my skills.`   The phrase about doing a kata or two every day looks perfect for Present Simple. Why does the authoer use Future Simple instead?   However, a professional also knows that there will be times when he will fail, his risk calculations will be wrong, his abilities will fall short; he'll look in the mirror and see an arrogant fool smiling back at him.   Shouldn't we use Present Simple after when/if in this kind of cases? I am especially curious about this case as sometimes I forget to switch to Present Simple after if/when and I thought it is a critical error (which I didn't expect to see in a book). How can I get the values of the parameters of a calling method? Question  I'm writing some code that needs to be able to get the values of the parameters from the method that called into the class. I know how to get all the way to the ParameterInfo[] array, but I don't know how to then get the values. Is this even possible?  If it is, I think it has something to do with using the MethodBody property from the MethodInfo object, which allows you to inspect the IL stream, including properties, but I don't know how to do it, and I haven't found applicable code on Google.  Code  // Finds calling method from class that called into this one public class SomeClass {     public static void FindMethod()     {         for (int i = 1; i &lt; frameCount; i++)         {             var frame = new StackFrame(i);             var methodInfo = frame.GetMethod();             if (methodInfo.DeclaringType != this.GetType())             {                 string methodName = frame.GetMethod().Name;                 var paramInfos = methodInfo.GetParameters();                  // Now what?? How do I get the values from the paramInfos                  break;             }             else if (i == frameCount - 1)             {                 throw new TransportException("Couldn't find method name");             }         }     } } A person who speaks kindly. Sometimes she might be hard, but fair.   What is an adjective to describe such person? Where can I ask a question about finding general software that meets certain requirements? What is the difference between a field and a property? In C#, what makes a field different from a property, and when should a field be used instead of a property? Open a window on a remote X display (why "Cannot open display")? show that $\sum_{i=0}^l \dfrac{{l\choose i}}{{n\choose k + i}} = \dfrac{n+1}{(n-l+1) {n-l\choose k}}$ Show that $\displaystyle\sum_{i=0}^l \dfrac{{l\choose i}}{{n\choose k + i}} = \dfrac{n+1}{(n-l+1) {n-l\choose k}}$ for all $k,l, n\geq 0$ with $k+l \leq n.$  The $k+l\leq n$ part doesn't seem that important. The claim clearly holds for $n=0,$ and in that case $k$ and $l$ must both be zero. I think the claim can be shown by induction, but I'm not sure how to do so; I'm not sure how to use the inductive hypothesis to prove the inductive step. The sum on the LHS is not always an integer, so finding a combinatorial argument doesn't seem very feasible. For $n = 1,$ we can have $(k,l) = (0,0), (1,0), (0,1),$ and in each case the sum holds. Perhaps multiplying both sides by a number (idk ${n-l\choose k}$) might be useful? On my system (Windows Vista Home Premium 64bit) Python files are associated with Python interpreter:  C:\Users\Piotr&gt;assoc .py .py=Python.File C:\Users\Piotr&gt;ftype Python.File Python.File=c:\python\2.7\python.exe "%1" %*   Nevertheless when I run any Python script from command line a window titled Open With pops up asking me to Choose the program you want to use to open this file. Will I be demoted to a lower league in Starcraft 2 if I don't play? I've just been promoted from platinum league to diamond and master pretty fast (in 4 vs 4). This was totally amazing for me but I'm afraid I will be demoted again to a lower league as fast as I came higher.   If I don't play any 4 vs 4 anymore, will they demote me to a lower league automatically or do they only do so, if I play? Why is the voltage across a capacitor and the current across an inductor continuous? Why is the voltage across a capacitor (as a function of time) continuous? Why is the current across an inductor (as a function of time) continuous? Use column alias in GROUP BY I have a query where I chain two columns. Why does the alias not work in the GROUP BY clause but in ORDER BY clause, it does work? How can I write the select correctly?  SELECT   KOS_VER_ID        AS "Vertrag"   , WHR_ISO_3_CODE  AS "Waehrung"   , KOS_KOA_ST_KZN || '  -  ' || ST_LANGBEZ_EN as "Kostenart"   , SUM (KOS_BETRAG) AS "Summe pro KOA" FROM   KOSTEN   , WAEHRUNG   , SCHLUESSELTABELLE WHERE    KOSTEN.KOS_VERHI_WHR_ID = WAEHRUNG.WHR_ISO_ID   AND KOSTEN.KOS_KOA_ST_KZN = SCHLUESSELTABELLE.ST_ID   AND KOS_VER_ID in (2509, 2510, 2511) GROUP BY   KOS_VER_ID   , WHR_ISO_3_CODE   , KOS_KOA_ST_KZN || '  -  ' || ST_LANGBEZ_EN ORDER BY   "Vertrag"   , "Kostenart" ; Determine all $f: \mathbb{R} \rightarrow \mathbb{R}$ such that, for all $x, y \in \mathbb{R}$, $$f((x + 1) f(y)) = y (f(x) + 1).$$    Source: Vuong Lam Huy, on a Facebook group. How do I increase the render distance? Tags are not showing up on the right side of the screen This is on Stack Overflow. On Meta I'm able to see what the tags are on the right side of the screen. In fact, I think yesterday or some point earlier today I saw tags on the right side of the screen (I can't screenshot or remember correctly).  It's right above the asked and active heading.  I know this is minor but what happened to it? It might be useful for browsing instead of having to look at the bottom of the question post.    Found an image on Google and it shows the tags on the right side of the screen: "X Department" versus "Department of X" I would like to know whether these phrases "English Department" and "Department of English" have the same meaning. Thanks! Today while troubleshooting a service broker problem, I discovered that the database owner was the Windows login of an employee who had left the company. His login had been removed and thus the query notifications were failing.   Supposedly the best practice for dealing with this is to make 'sa' the database owner. We changed it and that cleared out the queue.   My (very elementary) question: what is the database owner and what is its purpose?