What book will teach the most rigorous way the regression analysis? I read as a mathematician myself, and now I have to improve my statistical skills to get a job. I would like to learn what kind of methods there are to measure how to fit model to data and why those methods work. I'm not afraid to work through proofs. Is, for example, "Applied Regression Analysis and Other Multivariable Methods" written by David G. Kleinbaum, Lawrence L. Kupper, Azhar Nizam and Keith E. Muller good for learning the subject rigorously? Are there books similar to "Statistical inference" written by Casella and Berger, but concentrated on regression analysis?
What is a good introduction to statistics for a mathematician who is already well-versed in probability?  I have two distinct motivations for asking, which may well lead to different suggestions:   I'd like to better understand the statistics motivation behind many problems considered by probabilists. I'd like to know how to better interpret the results of Monte Carlo simulations which I sometimes do to form mathematical conjectures.   I'm open to the possibility that the best way to go is not to look for something like "Statistics for Probabilists" and just go to a more introductory source.
Backup whole OS Without appealing to the axiom of choice, it can be shown that (Proposition:) if $X$ is well-orderable, then $2^X$ is totally-orderable.  Question: can we show the stronger result that if $X$ is well-orderable, then so too is $2^X$?  Proof of Proposition. Pick any well-ordering of $X$. Then the lexicographic order totally orders $2^X$.  More explicitly: for any two $f,g \in 2^X$, define $f &lt; g$ iff   there exists $x \in X$ such that $f(x) \neq g(x)$, and if $x \in X$ is minimal such that $f(x) \neq g(x)$, then $f(x)=0$ and $g(x)=1$.   It can be shown that $&lt;$ totally-orders $2^X$. How can I run blender from command line or a python script without opening a GUI? I'm interested in using Blender for producing images, 3d files, or calculating geometry on a server.  Can I make blender run a python script without opening a GUI?  If not, can I incorporate Blender's python API into my own python script without running a GUI? Counting in a rectangular grid with obstacles I was asked to find the no. of ways to get from (0,0) to (8,8) with the 4 points of the shaded box unpassable, aka I can't use the 4 points namely (3,3)(4,4)(3,4)(4,3) while on my way to (8,8). Right and up movements.  I know it is something like a pascal triangle and worked out the solution of 4050 ways.  May I know if there are any faster means using permutation formula?  Thank you in advance. A positional number system for enumerating fixed-size subsets? Many combinatorial objects have some associated positional number system.  For example, the subsets of a (finite) set S can be listed off by observing the bits of all $|S|$-bit numbers, treating the 1s and 0s as indicators for whether to pick a particular element or not.  Permutations of a finite set S can be found by examining the  representations of the first $|S|!$ natural numbers.  Is there an analogous positional number system for encoding k-element subsets of an n-element set?  Thanks! Suppose $n$ is an even positive integer and $H$ is a subgroup of $\mathbb Z/n \mathbb Z$. Prove that either every element of $H$ is... How can I speed up data transfer between local computers on a WiFi network? I have a router with ADSL Pentagram Cerberus 6331-42. Is it normal to have transfer speeds between two computers of max 1MB/s (not 1 Mbit)? How can I set my router up to make it faster at transferring data in my local WiFi network?  I have a PC and a laptop. Both are running Windows 7. I don't use a firewall. I've set the network area up correctly; I can see other computers.  Is it possible to make the router faster by changing its values? I don't use secure encryption such as WPA or WEP; only MAC filtering.  My values in Interface Setup > Wireless are:       Here are my thoughts after few years I've published this topic:    use 5Ghz bandwidth if possible  use range extender if Your router is too far  try wifi analyzer app for mobile phone to check what channel is the less used How can I discover any USB storage devices and/or CD/DVD writers available at a given time (using C# .Net2.0).  I would like to present users with a choice of devices onto which a file can be stored for physically removal - i.e. not the hard drive. What Did Lyanna Stark Say to Ned Stark? In the final episode of season 6 we see that Lyanna Stark is whispering something to Ned. What is she saying? Restore console session after remote desktop disconnects? Hi! I'm a beginner learner and I'd like to know how to snap these three objects. I'd like to snap the two cylinders with the different faces of the cube. The short one on the left and the highest cylinder on the top of the cube. I'd like to have the center of the cylinder aligned with the center of the cube (the base of the cylinder inscribed into the face of the cube)  I'm sorry for bad explanation I hope someone can help me  Thanks!   I add a screenshoot in which you can see what I have to do   Thanks again if someone can help me with this! Source Code Margin Comments In the paper "Beautiful Code Compelling Evidence", by J.R. Heard -- Code is formated in a particular way which includes margin comments. I am looking for a way to do this as I think it is a very clear way to comment comment code in a literate programming style. Why Was It 'Essential' That Voldemort Kill Harry Potter? Subgradients of non-convex functions In  (section 2.3), it is stated that:     A point $x^*$ is a minimizer of a function $f$ (not necessarily convex) if and only if $f$ is subdifferentiable at $x^*$ and $0 \in\partial f(x^*).$   Could anybody provide me with references for a proof of the above statement?   Is there a reference where we can learn more about subgradients of non-convex functions?  In Section 3. Calculus of subgradients of the above notes,many properties of subgradients are presented for convex functions. I would like to know which ones among these properties still hold for non-convex functions.  Thank you in advance! Delete all files to which no corresponding file with another extension exists My goal is to find a Linux command sequence, which deletes some files if a special condition is fulfilled:  All files with the extensions .cut or .cut.bak in the current directory shall be removed, IF there is no file having the same name, but extension .rec or .mpg in the current directory.  Background: I am developing a tool for a Linux-based PVR, that allows cutting of recorded programs. For each recording (extension .rec or .mpg) the segment markers are stored in a .cut-file with the same name. When some recording gets moved/renamed/deleted, then the corresponding cut-file remains orphaned and shall be deleted. I already have implemented the removing of those useless cut-files in C. But I am wondering, whether there may be a (simple) system based solution. In this case it could be run via 'system' and &amp; in the background, which would make my application more responsive...  I already asked a similar question for the recursive case (browsing also into subdirectories), . There has been a (nearly) perfect answer by kos - but unfortunately it removes too many files, so it is not usable, and I was not able to figure it out... But the same idea can be used here, IF it is possible to parse and pipe the result of 'ls' linewise... Evaluate trigonometric function Switch statement fallthrough in C#? Switch statement fallthrough is one of my personal major reasons for loving switch vs. if/else if constructs. An example is in order here:  static string NumberToWords(int number) {     string[] numbers = new string[]          { "", "one", "two", "three", "four", "five",            "six", "seven", "eight", "nine" };     string[] tens = new string[]          { "", "", "twenty", "thirty", "forty", "fifty",            "sixty", "seventy", "eighty", "ninety" };     string[] teens = new string[]         { "ten", "eleven", "twelve", "thirteen", "fourteen", "fifteen",           "sixteen", "seventeen", "eighteen", "nineteen" };      string ans = "";     switch (number.ToString().Length)     {         case 3:             ans += string.Format("{0} hundred and ", numbers[number / 100]);         case 2:             int t = (number / 10) % 10;             if (t == 1)             {                 ans += teens[number % 10];                 break;             }             else if (t &gt; 1)                 ans += string.Format("{0}-", tens[t]);         case 1:             int o = number % 10;             ans += numbers[o];              break;         default:             throw new ArgumentException("number");     }     return ans; }   The smart people are cringing because the string[]s should be declared outside the function: well, they are, this is just an example.  The compiler fails with the following error:   Control cannot fall through from one case label ('case 3:') to another Control cannot fall through from one case label ('case 2:') to another   Why? And is there any way to get this sort of behaviour without having three ifs? I am using a linux server which has 128GB of memory and 24 cores. I use top to see how much it is used. Its output is pasted at the end of the post. Here are two questions:  (1) I see that each of the running processes occupies a very small percentage of memory (%MEM no more than 0.2%, and most just 0.0%), but how the total memory is almost used as in the fourth line of output ("Mem:  130766620k total, 130161072k used,   605548k free,   919300k buffers")? The sum of used percentage of memory over all processes seems unlikely to achieve almost 100%, doesn't it?  (2) how to understand the load average on the first line ("load average: 14.04, 14.02, 14.00")?   Thanks and regards!  Edit:  Thanks!  I also really like to hear some rough numbers based on used percentage of memory to determine if a server is heavily loaded, since I once became the one who cramed the server without understanding the current load.  Is swap regarded as almost the same as memory? For example, when memory and swap are almost of same size, if the memory is almost running out but the swap is still largely free, may I just view it as if the used percentage of memory + swap is still not high and run other new processes?  How would you consider together CPU or memory (or memory + swap) usage? Do you become worried if either of them reaches too high or both?  Output of top：  $ top    top - 12:45:33 up 19 days, 23:11, 18 users,  load average: 14.04, 14.02, 14.00 Tasks: 484 total,  12 running, 472 sleeping,   0 stopped,   0 zombie Cpu(s): 36.7%us, 19.7%sy,  0.0%ni, 43.6%id,  0.0%wa,  0.0%hi,  0.0%si,  0.0%st Mem:  130766620k total, 130161072k used,   605548k free,   919300k buffers Swap: 63111312k total,   500556k used, 62610756k free, 124437752k cached    PID USER      PR  NI  VIRT  RES  SHR S %CPU %MEM    TIME+  COMMAND  6529 sanchez   18  -2 1075m 219m  13m S  100  0.2  13760:23 MATLAB 13210 timothy   18  -2 48336  37m 1216 R  100  0.0   3:56.75 absurdity 13888 timothy   18  -2 48336  37m 1204 R  100  0.0   2:04.89 absurdity 14542 timothy   18  -2 48336  37m 1196 R  100  0.0   1:08.34 absurdity 14544 timothy   18  -2  2888 2076  400 R  100  0.0   1:06.14 gatherData  6183 sanchez   18  -2 1133m 195m  13m S  100  0.2  13676:04 MATLAB  6795 sanchez   18  -2 1079m 210m  13m S  100  0.2  13734:26 MATLAB 10178 timothy   18  -2 48336  37m 1204 R  100  0.0  11:33.93 absurdity  12438 timothy   18  -2 48336  37m 1216 R  100  0.0   5:38.17 absurdity 13661 timothy   18  -2 48336  37m 1216 R  100  0.0   2:44.13 absurdity 14098 timothy   18  -2 48336  37m 1204 R  100  0.0   1:58.31 absurdity 14335 timothy   18  -2 48336  37m 1196 R  100  0.0   1:08.93 absurdity 14765 timothy   18  -2 48336  37m 1196 R   99  0.0   0:32.57 absurdity 13445 timothy   18  -2 48336  37m 1216 R   99  0.0   3:01.37 absurdity 28990 root      20   0     0    0    0 S    2  0.0  65:50.21 pdflush 12141 tim       18  -2 19380 1660 1024 R    1  0.0   0:04.04 top  1240 root      15  -5     0    0    0 S    0  0.0  16:07.11 kjournald  9019 root      20   0  296m 4460 2616 S    0  0.0  82:19.51 kdm_greet     1 root      20   0  4028  728  592 S    0  0.0   0:03.11 init     2 root      15  -5     0    0    0 S    0  0.0   0:00.00 kthreadd     3 root      RT  -5     0    0    0 S    0  0.0   0:01.01 migration/0     4 root      15  -5     0    0    0 S    0  0.0   0:08.13 ksoftirqd/0     5 root      RT  -5     0    0    0 S    0  0.0   0:00.00 watchdog/0     6 root      RT  -5     0    0    0 S    0  0.0  17:27.31 migration/1     7 root      15  -5     0    0    0 S    0  0.0   0:01.21 ksoftirqd/1     8 root      RT  -5     0    0    0 S    0  0.0   0:00.00 watchdog/1     9 root      RT  -5     0    0    0 S    0  0.0  10:02.56 migration/2    10 root      15  -5     0    0    0 S    0  0.0   0:00.34 ksoftirqd/2    11 root      RT  -5     0    0    0 S    0  0.0   0:00.00 watchdog/2    12 root      RT  -5     0    0    0 S    0  0.0   4:29.53 migration/3    13 root      15  -5     0    0    0 S    0  0.0   0:00.34 ksoftirqd/3 There have been a number of cases where I would like to thank someone for providing me with a thorough response and give them feedback beyond the vote up. Often I wish people would tell me why they voted me up. Not that the thank you part is necessary but it sets it apart from the other comments related to answering the question itself.  In this type of situation is a "Thank you" acceptable in a comment?     For more information, see  in the . Are there any journals that pay reviewers? Being a young researcher myself I received a comment from my colleague that some of the journals are paying reviewers for the reviewing process.  When I gave it a thought, it started to make more sense. In case of high quality, respected journal, an institution may consider itself privileged to have a reviewer of such journal and allow the reviewer to dedicate small proportion of his/her daily activities just on the reviewing process.  The reviewer being paid, has more obligations to provide thorough in depth review.  Does that hold true for some journals or is it just a myth?