Can reviewers have reserved time when they're reviewing a post? We've been . Some of us were getting frustrated that some users were smashing through 20 reviews in a minute so I decided to lay down the law.  Aaaanyway, as part of this  brought up the problem that if they take too long being diligent (looking into duplicates properly, checking rules, etc) there's a very good chance that somebody else will have reviewed that post and their decision (and the time that went into it) is wasted. That doesn't seem like a fair reward for what is an otherwise thankless task.  So I'm suggesting the a review "reservation" system so only one person can review something at once:   Once something is opened in review, it becomes unavailable to other users to review. That includes other queues. A reservation or lock should be against a post, not a post in a queue. The reviewer should get, for example, two minutes of alone-time with a post. If they review before their time is up, the lock goes away. If they're still reviewing when their time runs out, a notification should pop up (audio too?) and allow them to request an extension... Perhaps with 10 seconds grace to stop somebody else being allocated something. Questions are simply allocated on a first-unlocked-post basis. There should be a safety-limit on the number of times something can be review-locked or extended so that somebody can't wrongfully extend the life of a bad post (offensive/spam/etc) by gumming up review.   It sounds messy (and there's certainly some concurrency issues if you've split the servers out horizontally) but data-wise, it's actually not too hard to implement (speaking as somebody who has implemented an edit-lock system before).  Above all else, it shows reviewers the respect they deserve for a job that few of us really want to do.
Lock questions in the review queue while being reviewed More and more frequently in the review queues, I am spending time either fixing a post or considering whether an edit is valid, etc, only to make changes and have them denied/not count because someone else has blindly hit the approve button in the meantime.  My proposal is for the system to "lock" a post in the review queue once it has been presented to someone for review.  Do not let anyone else (in the review queue) do anything with it until it is released by the last user it was presented to (or a certain amount of time has elapsed).    By "lock" I mean that it won't show up in anyone elses list until released.  I did NOT mean that it would be in multiple queues and be unactionable in some of them.  This would fit well as the queues only present one at a time anyway.  This will allow people trying to make good decisions the time to do it and prevent someone else from making that effort a waste of time.  As support, look to some of the published reasoning behind the auto-question ban.  A large portion of it is that bad questions waste the time of the community.  Taking the time to ensure you are making a good decision in the /review queue only to have it not count because someone was badge-whoring and clicking the approve button as fast as they could also wastes the users time... arguably the more (for lack of a better way to put it) valuable user who is willing to invest some time and thought into making the site better.
How do I programmatically get the field type of a specific field? How to make UV loft like 3ds Max in Blender using curves? I am try to make a car Body using the technique like UV loft in 3ds Max.  How to apply this technique in  Blender using curves or closer to this technique? I have seen this technique in a Blender tutorial, but I forgot about it. Identify this YA book series about dragons, acid blood, and dangerously cold nights I'm trying to remember the name of a series of books about a boy who works with dragons.  Dragon's blood (or maybe it was slobber?) is acidic, and the children who wrangle these dragons often end up with deep pock marks.  On this world, days are like ours but nights get very cold, requiring anyone stuck outside to find a shelter until dawn (not the false dawn)  The other thing I remember is that in one of the books by slicing open a dragon and spending the night, the character emerged with special dragon powers. How do I add swap after system installation? I did not create a swap partition during Ubuntu installation.  Later, I freed up some space and made a swap partition.  Now after each boot up, I am manually opening gparted to right-click the swap partition to turn on the 'swapon' option.  How can I automatically enable the swap partition at boot?  Also, if I had not created the swap partition, what are my other options? is incompatible with the enumerate and itemize environments. Is there a typographical reason not to wrap a list around a figure or is it a technical limitation of LaTeX? If it is a technical limitation, is there any work (new packages or changes to LaTeX) currently being done to eliminate the limitation in the future?  Edit: To respond to some of the comments: I realize that there are "gymnastics" which can make this work. I do not have an example of the problem. Whenever I run into a problem with wrapfig because it is near an enumerate or itemize environment, I search for an easy solution, find none, and move the figure elsewhere. In the vast majority of cases, the cost of learning the complex solutions isn't worth the benefit of keeping the figure where I want it. What are acceptable reasons for flagging as "Requires Moderator attention"? After reading , I feel I don't quite understand this function. What are the guidelines for flagging a question as &quot;Requires Moderator attention&quot;? Subgroups of Symmetric groups isomorphic to dihedral group Is $D_n$, the dihedral group of order $2n$, isomorphic to a subgroup of $S_n$ ( symmetric group of $n$ letters) for all $n&gt;2$? TeXstudio does a pretty good job with autocompletion. For example, when I type \eqref{, it already comes with suggestions, see the example below.    However, suppose that I don't want to use \eqref but a customized command using newcommand (I do this so that I can quickly switch to different styles, e.g., some for journals/conferences "Eq. (1)" is needed, whereas sometimes "(1)" suffices). In this case, TeXstudio does not do the auto-completion, see the example below.    Is it possible to configure TeXstudio such that it does the auto-completion for custom commands that require a reference?  Note that one option is to redefine \eqref using \renewcommand, but I'm looking for another way so that I can use if for many more commands, not just for \eqref.   Here is my MWE:  \documentclass{article} \usepackage{amsmath}  \newcommand{\alternative}[1]{Eq.~(\ref{#1})}  \begin{document}     \begin{equation}         \label{eq:emc2}         E = mc^2     \end{equation}     I can refer to the equation using \eqref{eq:emc2} and using \alternative{eq:emc2}. \end{document} I know that $re^{i\theta} = x + iy$ for any complex number $x + iy$ by Euler's formula. How do you calculate relative and global phase? How to remove a USB drive without worry if its been unmounted? "'void' type not allowed here" error (Java) How do you integrate $\int \frac{1}{a + \cos x} dx$? How do you integrate $\int \frac{1}{a + \cos x} dx$?  Is it solvable by elementary methods?  I was trying to do it while incorrectly solving a homework problem but I couldn't find the answer.  Thanks! Integrable - martingale Suppose $X_{n}^{(1)}$ and $X_{n}^{(2)}$ are martingales w.r.t. a filtration $F_{n}$. I have do determine whether $Z_{n}=e^{X_{n}^{1}+X_{n}^{2}}$ is a martingale, submartingale or supermartingale. I thought that because $X_{n}^{1}+X_{n}^{2}$ is a martingale I can use Jensen to say that $E[Z_{n}|F_{n-1}]\geq e^{E(X_{n}^{(1)}+X_{n}^{(2)}|F_{n-1})}=Z_{n-1}$. But I have to check whether $Z_{n}$ is integrable and I don't know how. Rsync, include only certain files types excluding some directories How does Java Garbage Collection work with Circular References? More than 9 hundred as hundreds? In German, we often use "Elfhundert" (literally, "eleven hundred") for 1100 or "neunzehnhundert" ("nineteen hundred") for 1900; but is this correct in English? Show that the conditional statement is a tautology without using a truth table I have been attempting to use identities to get to the answer but I am unable to get anywhere. Here is the equation I am trying to prove tautological without using truth tables:  $[(p\rightarrow q) \land (q \rightarrow r)] \rightarrow (p \rightarrow r )$  And here is my attempt at using identities to work my way up. (a link to a page with a table of logical equivalence identities: )  $\lnot [(p \rightarrow q) \land (q \rightarrow r)] \lor (p \rightarrow r)$  $\lnot [(\lnot p \lor q) \land (q \rightarrow r)] \lor (p \rightarrow r)$  $[\lnot (\lnot p \lor q) \land \lnot (q \rightarrow r)] \lor (p \rightarrow r)$  $[(p\land \lnot q) \land (q \land \lnot r)] \lor (p \rightarrow r)$  I don't know where to go from there. Help me understand the oddity of percentage gains and losses? If you start with $100K, and you get a 50% gain, it's $150K.  Then, you get a 50% loss: now it's $75K. Reverse the order (i.e. lose 50%, gain 50%), it's the same thing (a 25% loss).  So, 50% up then 50% down, or 20% up then 20% down, you don't get back to "even"; it's a loss.  My question is: how can one make this notion work to their advantage, instead of to their disadvantage?  I'm wondering if you have any strategies/thoughts/ideas on how to make this effect work for you, instead of against you. Or is my thinking on this as a strategy somehow incorrect?  The effect seems to diminish with lower swings in returns.  E.g. the +20% / -20% case, results in a 4% loss.  I.e. 100K -> 120K -> 96K.  Not clear what the formula for it is, but it's not linear. Are repository updates secure?  As a bear of little brain from the developer side, I cannot understand why the repository list is http://security.ubuntu.com and the other http(unsecured) sites listed in /etc/apt/sources.list.  Without a certificate chain match this appears as "ask any responder for a list of packages to update" instead of "ask the ubuntu.com site..."  Can any network choose to spoof the update sites, and is this a common practice to provide a locally cached and vetted copy? How to derive variance-covariance matrix of coefficients in linear regression