Currently, the mobile version of the site has no link to the review system, is it possible to have that available? I often use Biology SE on my phone and perform a fair amount of review tasks, but to get to the review system I have to use the desktop version of the site. It would make it easier for users to keep on top of the review tasks if this facility was more accessible.    Could stack exchange add the review queue to the top bar in the mobile site?  E.g.
The other day I was looking at Stack Overflow on my Android phone. All is made very nice and all, but I could not find the Review button/link. Is it being implemented, did I miss it, or it is not available?
We've had a number of instances over on Stack Overflow involving users who get to the reputation level where they can comment, then spam comments across the site. Due to the lack of community review around comments, these spammed comments can remain on the site for months before someone notices and flags one. Moderators then have to go and manually remove each of these comments. In the last few months, I've personally had to deal with two users who spammed their website across 200+ questions each.  This isn't just limited to people spamming comments with a URL in them. We've had a number of users spray the same nonsense comment or insult across tons of posts and have no one seem to notice for months.  What I'd like is some kind of system-generated notification when a user has posted a barrage of copied-and-pasted comments. This could possibly be triggered when a user has posted a set number of identical comments in a row (4 of them, maybe) or maybe even if they've posted the same comment multiple times. We receive similar system-generated flags when users post duplicate answers, edit many of their posts in a row, or delete many of their own posts at a time.  This system-generated flag should ignore comments generated by review (which have the same text in them). I'm thinking that it shouldn't ignore comments generated by custom off-topic reasons, because someone using the exact same close reason over and over again might be something we want to look into.  The flag itself won't do anything to a user, and would only appear to moderators. I imagine there will be a number of false positives, but it should be easy for us to check these and identify the well-intentioned stock comments from the problematic ones.   We currently have no means of detecting comment spam, so even if this didn't have a great hit rate it would still be beneficial on the balance. Running sample queries for this seems to indicate that it wouldn't have that much noise.  This would allow us to catch comment spam early, and prevent it from living on the site or developing into a more serious problem. How TDD-oriented is the SE team? Stack Exchange is my role-model for application development.  I've tried to learn as much as possible from the blog and podcasts, from thought process to design, architecture, convention, etc etc.  I'm just about to wrap my head around TDD and am curious about how the SE team approaches it.  Is there a methodology that all team members follow, or is it more developer-driven testing where you pick complex bits to unit test as needed, or is it more about catch-all integration testing once a piece of functionality is done, or... ?  Any input would be fantastic. I'm trying to prove that the converse of Lagrange's theorem is true for finite abelian groups (i.e. "given an abelian group $G$ of order $m$, for all positive divisors $n$ of $m$, $G$ has a subgroup of order $n$"). This is an exercise from a book, and it is in the section on finite abelian groups, so I know I have to use the fundamental theorem of finite abelian groups. I have come up with a proof, but it seems a bit messy, and I'm not entirely sure if it's correct. It is given below.     Let the order of $G$ be $m$ = $p_1^{\alpha_1} \ldots p_k^{\alpha_k}$. It is known that $G$ is a direct product of $p$-groups, say:      $$G = G_1 \times \ldots \times G_k$$      where each $G_i$ is a $p_i$-group. By the fundamental theorem of finite abelian groups, each $G_i$ is isomorphic to a direct product of cyclic groups of the form      $$\mathbb{Z}_{{p_i}^{\beta_1}} \times \ldots \times \mathbb{Z}_{{p_i}^{\beta_l}},$$      where $\beta_1, \ldots, \beta_l$ are positive integers such that $\sum_{j=1}^l \beta_j = \alpha_i$. Now if $n$ divides $m$, then we must have      $$n = p_1^{\gamma_1} \ldots p_k^{\gamma_k}$$      for some $\gamma_1, \ldots, \gamma_k$ with $0 \leq \gamma_i \leq \alpha_i$.      Claim: Each $G_i$ has a subgroup of order $p_i^{\gamma_i}$      Proof: As above, we have that       $$ G_i \cong \mathbb{Z}_{{p_i}^{\beta_1}} \times \ldots \times \mathbb{Z}_{{p_i}^{\beta_l}} $$      where $\beta_1, \ldots, \beta_l$ are positive integers such that $\sum_{j=1}^l \beta_j = \alpha_i$.      Now since $0 \leq \gamma_i \leq \alpha_i$, we can find   $l$ numbers $\delta_1, \ldots , \delta_l$ such that $\gamma_i = \sum_{j=1}^l \delta_j$, and $0 \leq \delta_j \leq \beta_j$. (This choice of numbers is not necessarily unique).      Then $p_i^{\delta_j} | p_i^{\beta_j}$ for each $j = 1, \ldots , l$. Hence, for each factor $\mathbb{Z}_{{p_i}^{\beta_j}}$, there exists a subgroup of order $p_i^{\delta_j}$, namely $\mathbb{Z}_{{p_i}^{\delta_j}}$ (using the fact that the converse of Lagrange's theorem is true for finite cyclic groups). Taking the direct product of each of these subgroups, we get a new subgroup $G_i'$ of $G_i$:      $$G_i' \cong \mathbb{Z}_{{p_i}^{\delta_1}} \times \ldots \times \mathbb{Z}_{{p_i}^{\delta_l}}$$      The order of this subgroup is $p_i^{\delta_1} \times \ldots \times p_i^{\delta_l} = p_i^{\delta_1 + \ldots + \delta_l} = p_i^{\gamma_i} $. So we have found a subgroup of $G_i$ of order $p_i^{\gamma_i}$, as required.      So each factor $G_i$ in the product $G = G_1 \times \ldots \times G_k$ has a subgroup $G_i'$ of order $p_i^{\gamma_i}$.       Therefore, $G$ has a subgroup   $$G_1' \times G_2' \times \ldots \times G_k'$$       of order $p_1^{\gamma_i}...p_k^{\gamma_k} = n$, which completes the proof.   I have two questions about this: firstly, does this proof seem to work? Secondly, is there a way to make the proof more concise (e.g. a way to prove the statement without using all these indices)? Finding Stack Overflow/Exchange users based on geographic area? Dell Inspiron 3551 Unresponsive Touchpad I just got my laptop in the mail and I installed Ubuntu 14.04 LTS. It all went smooth until it booted up and I noticed my touch pad doesn’t work at all. It works perfectly on Windows and when I use a wireless mouse it works as well.  Here's my xinput:  ⎡ Virtual core pointer                          id=2    [master pointer  (3)]   ⎜   ↳ Virtual core XTEST pointer                    id=4    [slave  pointer  (2)]   ⎜   ↳ 2.4GHz RF  KEYBOARD  AND  MOUSE               id=11   [slave  pointer  (2)]   ⎜   ↳ DLL06AB:00 06CB:78F1                          id=13   [slave  pointer  (2)]   ⎜   ↳ SynPS/2 Synaptics TouchPad                    id=15   [slave  pointer  (2)]   ⎣ Virtual core keyboard                         id=3    [master keyboard (2)]       ↳ Virtual core XTEST keyboard                   id=5    [slave  keyboard (3)]       ↳ Power Button                                  id=6    [slave  keyboard (3)]       ↳ Video Bus                                     id=7    [slave  keyboard (3)]       ↳ Power Button                                  id=8    [slave  keyboard (3)]       ↳ Sleep Button                                  id=9    [slave  keyboard (3)]       ↳ 2.4GHz RF  KEYBOARD  AND  MOUSE               id=10   [slave  keyboard (3)]       ↳ Integrated_Webcam_HD                          id=12   [slave  keyboard (3)]       ↳ AT Translated Set 2 keyboard                  id=14   [slave  keyboard (3)]       ↳ Dell WMI hotkeys                              id=16   [slave  keyboard (3)]     I would love to have my track pad working and I've done some googling and browsing of this site and nothing I've tried has worked. Any input would be great. Let me know if there’s any other information that can help remedy this. I'm pretty new to Linux. Thank you very much.  Edit: I've updated the kernel to 3.19 and checked my Additional Drivers which had nothing for me. Neither of which worked. Distribution of orbital velocities in a disk galaxy for N-body simulation? I'd like to write an N-body simulation in which I collide two disk galaxies. To give you an idea of the accuracy I'm trying to achieve, I'm aiming to make this my screensaver at 30fps on my work desktop. Think Euler's method, large epsilons in denominators to prevent blow up, all that lazy stuff.   One place I don't want to be lazy, however, is in the initial construction of the galaxies I'm trying to collide. I want to design a galaxy that will at least sort of hold together by its own gravity until it smash it into another one.   How might I go about selecting the orbital velocities for each of the bodies composing the galaxy? use EntityFieldQuery to find user based on profile field value Finding the Transform matrix from 4 projected points (with Javascript) Which meta am I supposed to post on? I'm mostly active on  and we have a separate . Most of my questions on IT Security meta have answers with links here. So my question is, where am I supposed to post what i.e. feature request, bug report, behavior questions? Why or how did Agen Kolar and Saesee Tiin seem to die so easily without any resistance? I am currently undergoing a full Apostol Calculus I reading, and with few chapters left I've began planning what other books to read. I was thinking about finishing both Apostol Calculus l and ll, and then read Apostol mathematical analysis. I'm not pretty sure whether these are the best books or if they will provide me with a strong math basis. I've already taken calculus i, ii, iii and linear algebra. The reason I've chosen Aapostol volume 1 and 2 is that I've heard they cover almost all the topics I've seen and will see in the next semester/s. I would appreciate if somebody could give me some advice about this. I really like to have a book that really gives me hard and challenging problems. I don't know whether to read Spivak Calculus book or not. Significant figures vs. absolute error On , $N_A = 6.022\;141\;29 \times 10^{23} \text{ mol}^{-1}$ has 9 significant figures and a standard uncertainty of $0.000\;000\;27 \times 10^{23} \text{ mol}^{-1}$.  First, can it be written as the following?  $$ N_A = 6.022\;141\;29 \times 10^{23} \pm 0.000\;000\;27 \times 10^{23} \text{ mol}^{-1} $$ If yes, consider the following quote from  (emphasis added):     Whenever you make a measurement, the number of meaningful digits that you write down implies the error in the measurement. For example if you say that the length of an object is 0.428 m, you imply an uncertainty of about 0.001 m. To record this measurement as either 0.4 or 0.42819667 would imply that you only know it to 0.1 m in the first case or to 0.00000001 m in the second. You should only report as many significant figures as are consistent with the estimated error. The quantity 0.428 m is said to have three significant figures, that is, three digits that make sense in terms of the measurement. Notice that this has nothing to do with the "number of decimal places". The same measurement in centimeters would be 42.8 cm and still be a three significant figure number. The accepted convention is that only one uncertain digit is to be reported for a measurement. In the example if the estimated error is 0.02 m you would report a result of 0.43 ± 0.02 m, not 0.428 ± 0.02 m.   and the following quote from  (emphasis added):     The absolute error places bounds telling you that the actual value is expected to fall between x - D x and x + D x. The absolute error is an easy way to report the error and makes it easy to check that you are not reporting too many significant figures. For example, suppose you had a measurement that was reported to be 10.02 ± 0.3 m. Because the reported value is uncertain in the tenths place, it is wrong to report it to the hundredths place. It should be reported to the same decimal place as the absolute error: 10.0 ± 0.3 m. Another point is that the absolute error and the reported value must have the same units.   If there is such a convention (cf. Rice's lab guide) and it is wrong to report more significant figures than is warranted by the absolute error (cf. the joint project's guidelines), and NIST should have adhered to such convention and striven to be correct, is it true that NIST adheres and is correct because the standard uncertainty has two least significant digits (i.e., $27$)?  Had the standard uncertainty been $0.000\;000\;2\text{ mol}^{-1}$, would NIST have reported Avogadro's Number as $N_A = 6.022\;141\;3\times 10^{23}$ with 8 significant figures? How to move boot and root partitions to another drive How to prove that minimum of two exponential random variables is another exponential random variable? How can I prove that the minimum of two exponential random variables is another exponential random variable, i.e. Z = min(X,Y) How to fix gaps between flooring planks in mid-1800s house? I live in a mid-1800s house, which I plan to sell this Spring. The original (I think) wood flooring has gaps between the planks, some pretty sizable (photos follow).  Is there any good fix for this? I've seen people use wood filler/epoxy, and it didn't seem to turn out well. Perhaps doing that and painting/dying it black might work better.  I've heard the "old" solution was to pack those spaces with rope, but I don't think that would look better than the status quo.  Any suggestions?  Photos, big gap:    Medium gap:    Small gap: I'm kind of stuck in Terraria. I have full silver armor and 12 hearts (gold/silver gear).  I have just killed the Eye of Cthulhu.  I was thinking about gathering gold armor, but gold is damn scarce. I have tried searching for floating islands (at 406 altitude) but if I go to far I get attacked by Harpies, and I can't build a sky bridge and fight them at the same time.  My meteorite landed in corruption and it's impossible to collect it (I get swarmed by meteor heads with no way to run).  So what is the most natural progression? Should I try and find gold (where?), try to kill the Eater of Worlds, try to mine meteorite or try to fight off imps and collect some hellstone? I've asked this question towards a developer for Minecraft and I thought I'd ask here too since they might not see the question.  How do I select all but two types of entities in Minecraft?  For example, something like: /say @e[type=![Player,Item],r=50] (to clarify I also tried type=Item,Player, type=Item,type=Player etc)  Should select any entity that does not match players or items, so things like Creepers, Ghasts, XPOrbs, PrimedTNT and so on within a radius of 50 blocks and print them to the chat.  Instead it ignores one of the flags, and works with the other instead. How can I prepend a tag to the beginning of several files? What is the volatile keyword useful for? At work today, I came across the volatile keyword in Java. Not being very familiar with it, I found . Given the detail in which that article explains the keyword in question, do you ever use it or could you ever see a case in which you could use this keyword in the correct manner? Estimating Spline curve by OLS. Is a good idea to fix the knots at Chebyshev sites? I am writing my master's degree thesis on a novel method for fixing knots in an adaptive way and while reading the literature I've found many references to the so-called Chebyshev sites. This sites or points are basically the roots of the Chebyshev polynomials, and there's a proof showing that the Lebesgue constant (a measure that allows us to see how good is a polynomial interpolation) is very close to its lower bound if we put our knots in those sites. A practical guide to splines (De Boor, 1972) for example provides such a proof.  Anyway I am not interested in polynomial interpolation with splines, but in regression using LASSO on a set of B-splines . On Numerical methods in economics (Judd, 1998) it's stated that the results regarding the 'optimality' of the Chebyshev sites hold also for the regression case, but there is no proof showing that the latter is true.  I would like to know if it's a good idea to estimate the regression using B-splines constructed over a knot sequence given by the Chebyshev sites, since in the OLS framework I am not interested on minimising the Lebesgue constant but rather I want to minimise the $\| \cdot \|_2^2$. In many articles I've found phrases like "we will set the knots at the Chebyshev sites, that are well known to be good..." making allusion to the results presented in De Boor, but ignoring that those refer to the interpolation case.  If your could put some light on the problem I will be very grateful.