If a creature's size suddenly increases while it is inside a very small Sphere of Force (from Wall of Force) what happens?
What happens when Wild Shape/Polymorph runs out in a space that's too small?
Adding an [AuthorYear] block at the beginning of bibliography entries I want to add a block at the beginning of my bib entries of the form      [Lastnameauthor(s) Year]   When the shortauthor field is defined it should use this field +Year instead. The following example is fairly minimal:  \begin{filecontents*}{test.bbx} \ProvidesFile{test.bbx}  [\abx@bbxid $Id: test.bbx,v 0.9d 2010/09/03 20:11:58 lehman beta $]  \RequireBibliographyStyle{authoryear}  \DeclareBibliographyDriver{article}{%   \usebibmacro{bibindex}%   \usebibmacro{begentry}%   %---add something here---   \usebibmacro{author/translator+others}%   \setunit{\labelnamepunct}\newblock   \usebibmacro{title}%   \newunit   \printlist{language}%   \newunit\newblock   \usebibmacro{byauthor}%   \newunit\newblock   \usebibmacro{bytranslator+others}%   \newunit\newblock   \printfield{version}%   \newunit\newblock   \usebibmacro{in:}%   \usebibmacro{journal+issuetitle}%   \newunit   \usebibmacro{byeditor+others}%   \newunit   \usebibmacro{note+pages}%   \newunit\newblock   \iftoggle{bbx:isbn}     {\printfield{issn}}     {}%   \newunit\newblock   \usebibmacro{doi+eprint+url}%   \newunit\newblock   \usebibmacro{addendum+pubstate}%   \setunit{\bibpagerefpunct}\newblock   \usebibmacro{pageref}%   \usebibmacro{finentry}}  \endinput  \end{filecontents*} \begin{filecontents*}{MeineBib.bib}   @article{example,  author={Firstname Lastname and First Last},   title={Title},  journal={Journal},  year={Year},   pages={Pages}, }    \end{filecontents*}  \documentclass[12pt,ngerman,    ]{scrartcl} \usepackage[ngerman]{babel} \usepackage{filecontents} \usepackage[babel,german=quotes]{csquotes} \usepackage [bibstyle=test]{biblatex} \bibliography{MeineBib}  \begin{document} \tableofcontents \cite{example} \printbibliography\end{document}   I'm guessing the solution lies here  DeclareBibliographyDriver{article}{%       \usebibmacro{bibindex}%       \usebibmacro{begentry}%       %---add something here---       \usebibmacro{author/translator+others}%   but I can't find out how. It should look like this  which is an existing style (natdin) in BibTeX, but not in biblatex. Is it possible to set DNS for mobile network How do I speed up my design work? I've been a designer for 6 months, having previously had a 1st class honours degree in Graphic Communication. My issue is that I am a Very good designer, but I work too slow. It's beginning to drive a rift between myself and the creative director who desperately wants me to work quicker. I've always been a workaholic even in university, I put in 110% all the time, really work my ass off, but I'm still not fast enough to complete projects quickly, my work is good, but it's not efficient.  Do you guys have any tips to help me speed up? How to go with proving this : Let $R$ be a ring and let $I$ be an Ideal of $R$.  Prove that the factor ring $R/I$ is commutative iff $rs-sr \in I$ $\forall r$ and $s$ in $R$  any hint how to go with this... How to "pretty" format JSON output in Ruby on Rails I would like my JSON output in Ruby on Rails to be "pretty" or nicely formatted.   Right now, I call to_json and my JSON is all on one line.  At times this can be difficult to see if there is a problem in the JSON output stream.  Is there way to configure to make my JSON "pretty" or nicely formatted in Rails? How can I add a newline in the text of a label in WPF such as the following?  &lt;Label&gt;Lorem    ipsum&lt;/Label&gt; This post is an expansion of  For many graduated sites (eg Physics), moderators do not want to apply the unilateral close vote in all cases--it is better to let some community votes pile on first.  We only use the unilateral in obvious cases then. This renders the CV queue useless to us. If we &quot;skip&quot; something, we can't get back to it. If we say &quot;do not close&quot;, it's removed from the queue and our community can't see it. If we use &quot;close&quot;, we are using a unilateral mod vote--we don't want to do that. What I propose is a set of &quot;next/previous&quot; buttons, that let us navigate the queues, looking for closeable questions, and coming back to the others later. Thoughts? Update and bounty reason Due to the recent Great Flag Overhaul, mods no longer see close flags in the flag queue. Which means that the only way to get to them is via the review queue 1 Shog's solution is ideal in this case; let mods view the close queue as a list. (In fact, a list similar to the old flag queue -- which shows a list of mods who have seen the post and what mod actions have already been taken -- would be great) On Physics, the majority of the flags that we get are VTC flags. And the community isn't always able to close things on their own, so we have to step in. However, powering through the close queue isn't an option; because &quot;skip&quot;ing a post2 leads to it being dumped into the void (I can't get back to it unless I have a link). Extremely inconvenient. Could the workflow here be improved? 1. The /tools listing for posts with outstanding close votes doesn't work because it doesn't list posts which have been flagged but not VTCd 2. which I may want to take a closer look at later; gotta be careful with the binding votes. I want to select the value from the dropdown I am testing www.paytm.com  In that I have filled in the mobile number but I am not able to focus and select the mobile operator which is present in the dropdown just after the phone number section.  I want to select 'vodafone' as the value from the dropdown.  How to do that using webdriver  Code I have written till now  `  public class MMT {   public static void main (String[] args)  {  System.setProperty("webdriver.chrome.driver","E:/som/chromedriver/chromedriver.exe");  WebDriver driver = new ChromeDriver();  driver.get("http://paytm.com");  driver.findElement(By.id("mobile-number")).sendKeys("9876543212");`   What should be my next steps? mysql database no space available How do I unit test (using xUnit) a class that has internal private methods, fields or nested classes? Or a function that is made private by having  (static in C/C++) or is in a private () namespace?  It seems bad to change the access modifier for a method or function just to be able to run a test. I am new to QGIS. I am looking for any plugin or any manual method in QGIS for finding minimum distance (perpendicular distance) from a point which is part of one shapefile to nearest line among many lines which is part of another shapefile.   MMQGIS is not useful for this purpose. Movie where a guy is sent to a sandy planet where time moves really fast but slow to the outside observer All I remember is the guy was sent to a planet to test something or he did something illegal, and time moved really fast on the planet but slow to the outside world. He had to fix something to leave the planet I think. His dad was also dying and he checked how many days he had left every day, but in the end his dad didn't actually die as time was fast. It took place on a sandy planet. Dynamic Symlinks I have built my app for different architectures and would like to create a "dynamic symlink" which takes me to the right version based on a variable.   If the machine I am currently logged in to, is x86, then the symlink should take me to that build.  A mocked example of what I want to do:  $ uname -i x86_64  $ ls -ltr  lrwxr-xr-x  1 dogbane gg     4 Feb 16 15:40 mylink -&gt; @sys/ drwxrwxr-x  2 dogbane gg  2048 Feb 16 15:40 x86_64/ drwxrwxr-x  2 dogbane gg  2048 Feb 16 15:40 i386/  $ cd mylink  $ pwd -P ~/x86_64   Is this possible?   I know I can use cd $(uname -i), but want something simpler. Calculation of limit without stirling approximation $\lim n^n/(e^nn!)=0$ using Stirling approximation it is obvious. But can we do it without using Stirling approximation.  Now series with terms $x^n n^n/n!$ has ROC $1/e$. What we can say about behaviour of power series at endpoints? I am trying to proof the following algorithm to see if a there exists a path from u to v in a graph G = (V,E).   Reach := {u} LastCardinality := 0 while LastCardinality &lt; |Reach| do   LastCardinality := |Reach|   Next := null   foreach i &lt;- Reach do     foreach j &lt;- V do       if(i,j) exists in E then         Next := Next + {j}   Reach := Reach + Next return Reach   So far I have got that the output needs to be Reach = Goal where Goal = {r | r exists V, there is a path from u to r}. I also have three invariants that I am pretty sure will help prove this.   Reach is always a subset of Goal and Next is always a subset of Goal. After an arbitrary K times through the while loop, for every t that exsits in V, if t has a path of length k+1 from u, then t exists in Reach If Reach is a subset of Goal before the while loop then LastCardinality &lt; |Reach|   I know that to finish up the proof, I need to prove termination, the invariants, and correctness but I have no idea how. I think I need to use induction on the while loop but I am not exactly sure how.   How do I proof those three characteristics about an algorithm? Is there any difference between like best and like the best? Is there a difference between these two sentences? Are they the same?   What color do you like the best? What color do you like best?   Is there a difference in their meaning? Number of solutions of $x_1+2x_2+\cdots+kx_k=n$? New question asking form sometimes leads to accidental double posts of questions I've noticed that with the new question asking form, sometimes, attempting to submit a question will post two identical copies of the same question.  I've  (), but at the time, I assumed it was just a temporary fluke. As far as I remember, I just reviewed the question, saw no errors, and submitted it. (That's all the info I have.)  However, I just saw this happen to someone else, so it can't just be a fluke on my end. , and . The author claims there that they did indeed double click the "Review" button, but their question didn't go through since it didn't have a required tag, but when they tried to submit the question with the required tag, they only clicked it once.  Also, now that I think about it, it could not have been just a temporary client-side issue on both our ends. The system is supposed to  if one tries to post more than one question in 30 seconds. Neither of us got a CAPTCHA. This means that the server accepted the double post, and so it's a server issue.  This has the effect of denying users badges that they would have otherwise qualified for, since a single negatively-received, closed, or deleted question . This means that even if the double post is deleted and the original is upvoted, the user won't qualify for that day since they've made a "bad" question on that day. (While they may be able to later reverse this 60 days later by undeleting and re-deleting their question - questions deleted more than 60 days later aren't considered "deleted" for the check - they often won't be able to, since most of the time, users will have downvoted the double post, which also disqualifies one from the badges.)  Can an employee go through server logs to see what happened in both these cases, and add some safeguards to prevent accidental double submissions of questions? This seems to have come up when the new asking form was deployed.  Update: There was another case just now:  was . As both have the exact same time of submission, this is an instance of this bug, since as I said above, this thing is ordinarily prevented by a CAPTCHA. Option to contact moderators Due to some "recent issues", I think the following is necessary:  Users need a way to contact moderators through the StackOverflow website.  This is especially important for suspensions, where there is no way to appeal or discuss the suspension from within SO itself.  Basically, there would be some kind of a box on the user's page that allows them to mention something to the moderators and some way to read the replies. (Or they could just go to the user's email.) For $x$ and $\lambda$ complex, if $|x| \gt \frac{1}{2} + \sqrt{\frac{5}{4} + |\lambda|}$ then $|x^2+\lambda| \gt |x| +1$ Define $f(z) = z \ ^ 2 + \lambda$ and $V = \left\{x \in \Bbb C : |x| \gt \frac{1}{2} + \sqrt{\frac{5}{4} + |\lambda|} \right\}$, for some $\lambda \in \Bbb C$.   Then, if $x \in V$ then $|f(x)| \gt |x| +1$.   I tried the following :   Let $x\in V$ then $|f(x)| = |x \  ^ 2 +\lambda | \ge |x |  \ ^ 2 - | \lambda| \gt (\frac{1}{2} + \sqrt{\frac{5}{4} + |\lambda|}) \  ^ 2 - |\lambda| = 1.5 + \sqrt{\frac{5}{4} + |\lambda|} $.  But this doesn't get me anywhere.