I use \usepackage[backend=biber, style=authoryear-comp, maxcitenames=2]{biblatex} for my bibliography, which works perfectly fine. However, when an author appears multiple times biblatex also shows the name of the second author before printing the year. This even happens in cases of different year entries. How is it possible to suppress the printing of the second author and to label the citation with the year 2015a, 2015b instead?  Here is my bibfile:   @article{first,   title={Paper 1},   author={Ambigous, Alan and John Doe and others},    year={2015}, }  @article{second,   title={Paper 2},   author={Ambigous, Alan and Richard Roe and others},    year={2015}, }  @article{third,   title={Paper 3},   author={Miles, Juliane and Paul Waterman and others},    year={2000}, }  @article{fourth,   title={Paper 4},   author={Miles, Juliane and John Smith and others},    year={1999}, }
In the header of my document I set the maximal author names to 2:  \usepackage[style=authoryear-icomp, maxbibnames=9, maxcitenames=2, backend=biber]{biblatex}   Now, when I cite texts with two authors, LaTeX gives me the following:     (Author_A/ Author_B 2012: 232)   When I have three authors or more, LaTeX makes it:     (Author_A/ Author_B et al. 2012: 232)   But I want LaTeX to just name the first author if there are more than two authors ... like this:     (Author_A et al. 2012: 232)   Any tips on how to achieve this ?
I recently changed my username to Undo. I was amazed when I pressed Submit and saw that it actually went through - surely someone somewhere was using this same username.  Out of curiosity, I then search the SO user list for Undo - and found  with Undo as thier name. They have 50 rep. I have around 1,500.   Is there some kind of pecking order, I.e. a high-rep user can 'steal' a low-rep user's name? Or is this a bug?  Or can two users have the same username without causing the SO servers to go down in a burning ring of fire? New global preferences: keyboard shortcuts and sticky topbar Following a global preference for , as of now, the preferences for enabling keyboard shortcuts and disabling the fixed topbar are network-wide* as well.  If you had either checked off on any site in the network, that setting has been preserved and applied to the whole network for your account already. Future changes will also apply to all* Q&amp;A sites.  Find them in their usual spot as previously on the  pages.    * With the exception of , which will support the fixed topbar after the . Elsarticle - Abstract two columns wide I am currently trying to create an article in elsarticle style, twocolumn. The title and text end up in two columns, the abstract however is made two columns wide. Any ideas what I am doing wrong? Obviously I want my abstract to also be only in the first column.  \documentclass[a4paper,10pt,twocolumn,preprint]{elsarticle}  \usepackage{lipsum}  \journal{TexExchange}   \begin{document}     \begin{frontmatter}       \title{Two-column abstract}       \begin{abstract}         \lipsum[1]      \end{abstract}       \begin{keyword}        abstract      \end{keyword}    \end{frontmatter}   \section{Outline}    \lipsum[2-3]  \end{document} How can I download an entire website? How can I download all pages from a website?  Any platform is fine. Careers tag search should only search tags I am a third year (starting fourth year in the fall) PhD student in mathematics. I've passed all qualifying exams and am currently doing research. As far as I can tell, I am not doing poorly. I have the good fortune of having a great advisor, being in a very supportive department, and having friends and family who genuinely care about my success.   The fact is research is hard. It appears to consist primarily of staring at a problem for days and days and days without getting anywhere. Sometimes, rarely, I do figure something out and that feels wonderful, but the overwhelming majority of my time appears to be spent banging my head against a mostly figurative wall. I am not complaining about the material being hard, and I am not averse to putting in hard work, but I get frequently discouraged when I realize the vast volumes of mathematics that I yet know nothing about (and probably never will). It's very hard to quantify progress - in particular, there are too few tangible returns after too many hours worked. I find myself thinking along the lines of "Oh, if only someone actually smart were thinking about this problem they would have solved it in moments" and so on.   I've talked about this to some number of people; here is some advice I have received:   Take a day off. Putting in hours upon hours of trying things doesn't magically lead to a solution, particularly if the brain is tired and just wants to sleep. Have a hobby. Since math research doesn't exactly provide instant gratification, a hobby might provide some instead.  Talk to other graduate students. Realize that many graduate students go through this.   I'm interested to know how other folks have dealt with being discouraged as a graduate student. Does it get better with time and experience? Is this a sign that research is not for me and that I should seriously consider a life outside academia? I opened terminal windows and I got a message   your screen size %d%d is bogus. Expect trouble   I closed the terminal and the next time I opened terminal, the message didn't show up.   What is this message and why did I receive it? I have to admit, I didn't even know spoilers were supported until today, but really bugs me that spoilers just look like empty block quotes before you mouse over them.   Is this a spoiler or just a long empty block quote? I can't tell right away, so it would be really nice if there was some indication of which one it was so I didn't have to push my mouse all the way over to it. What can I say, I'm incredibly lazy.  vs.         I suppose the author should include something that says 'Spoilers below:', but it would be nice if there was some other indication of what it was. Why is dark matter the best theory available to explain missing mass problems? Why is dark matter the best theory to explain the missing mass problem?    Why is dark matter mathematically necessary to explain the missing mass problem?    On a side not I believe dark matter is definately intuitive the next logical step in physics is to accept the fact the direct observations can not always be the determining factor in the acceptance of a theory.  Positivism is not going to be the only driving force in physics forevermore.    One theory that seems almost as good is the supersymmetric particle. What determination which are actually detectible and how would we distinguish the differences between the two?    References:   . jQuery Validate Plugin - How to create a simple custom rule? How do you create a simple, custom rule using the jQuery Validate plugin (using ) that doesn't use a regex?  For example, what function would create a rule that validates only if at least one of a group of checkboxes is checked? Does GCM (or GHASH) only provide 64-bit security against forgeries? In a  a doubt was voiced about my answer, which claims GCM to requires $2^{128}$ for a successful forgery. The doubt was that the square root needs to be taken meaning the security would be $2^{64}$.  So of course I immediately checked the relevant security theorem ():  $$\mathbf{Adv}^{\text{auth}}_{\operatorname{GCM}[\operatorname{Perm}(n),\tau]}(\mathcal A)\leq \frac{0.5(\sigma+q+q'+1)^2}{2^n}+\frac{q'(\ell_A+1)}{2^\tau}$$  with $\sigma$ being the total plaintext size in blocks, $q$ being the total number of encryption queries, $q'$ being the total number of decryption queries, $n$ being the size in bits of the underlying permutation, $\ell_A$ being maximum authenticated input length in blocks and $\tau$ being the tag size in bits.  Now clearly from this we can see that performing $2^{n/2}=2^{64}$ queries yields a strong enough advantage for a break.  Now my question is: When talking about "n-bits of security" or "needs $2^n$ operations to break", do we usually talk about "online" security, ie queries to an oracle can be done and cost $1$ or "offline" security where no oracles are available or do we need to make this decision depending on the situation?  TL;DR: Does GCM offer 64 or 128 bit security? Do rainbows have ultraviolet bands and infrared bands? We have seen that rainbows looks so colorful as we are only able to see only the visible light. But Do they also have ultraviolet bands and infra-red bands, that we are unable to see? I know someone has already asked the same question but I am concern about the specific ultraviolet and infrared bands only rather than any other wavelength. I tried this:  find . -type f -size 128 -exec mv {} new_dir/  \;   Which didn't work, and it didn't give me an error. Here is an example of what the file looks like, when using stat -x  $ stat -x ./testfile | grep Size    Size: 128          FileType: Regular File I'm trying to go through and provide answers to every unanswered question (search &quot;closed:0 answers:0&quot;), somewhat following the spirit that was blogged about at  .  However, I'm finding this much more difficult than it needs to be, as many of the questions have already been answered without the use of an &quot;answer&quot; - but instead, in the form of a comment by either the OP or another poster. I wouldn't mind reading through and skipping these, as long as there was some appropriate action I could take to at least assist with preventing these questions from being seen again from the same query - either by myself or another SO member.  Is there such an appropriate action?  Should we vote to close?  If so, using what reason? Even if I vote to close, what are the chances that 4 other users will also view the question and also vote to close?  (i.e., will my individual vote even do any good?  Is there any report to show recent close votes, so that others may also review and contribute supporting close votes?) Should we post some sort of an answer - even just something to the effect of &quot;this was already answered by the OP's own comment to his answer (above)&quot;? Would something like this be appropriate to flag for moderator attention, and let the moderators deal with it?  (Or would this be considered too trivial?) Should we rename the question title to something standard that can be used in a search exclusion?  (Maybe &quot;SOLVED:&quot;?)  Basically, how can I help to denote questions as &quot;This question is no longer in active search of an answer - though better answers may still be appreciated.&quot;? I've already reviewed , which was closed as a duplicate of  - but this requires effort on part of a user who may very likely no longer be active. Otherwise, is there something I should be doing to improve my search to filter out these types of questions? I've run across this many times, so I don't consider it to be a rare issue.  However, the last question like this I just ran across, prompting this question, was .  In this case, the question was self-answered by the OP in the form of a comment, this question is the OP's only question, the OP has no other visible activity on SO, and the OP hasn't been seen on SO since he registered and posted the question 5 months ago. Another one I just ran across is .  However, here the &quot;answer&quot; comment was posted by a reputable and recently active SO member.  Should I leave a comment directed at him, asking him to re-post his comment as an answer, or should I post my own answer echoing his comment?  (Or something else?) Yet another is .  Interestingly, the OP actually self-edited the question to include the &quot;SOLVED:&quot; prefix on to the question, instead of posting his resolving comment as an answer (and ideally accepting it) as he was asked to do by another comment.  This brings up another good idea - is there a &quot;standard&quot; we should use to rename the titles on these &quot;resolved but unanswered&quot; posts that could be used as a search exclusion?  (Also added to the above list.) Is there an IDictionary implementation that, on missing key, returns the default value instead of throwing? The indexer into Dictionary throws an exception if the key is missing.  Is there an implementation of IDictionary that instead will return default(T)? I know about the TryGetValue() method, but that's impossible to use with LINQ. Would this efficiently do what I need?: myDict.FirstOrDefault(a =&gt; a.Key == someKeyKalue);  I don't think it will as I think it will iterate the keys instead of using a Hash lookup. extract string between double quotes I have requirement that i need to extract string using quotes. My string as follows.  "abcd efgh" "ijkl mnop" "qrst uvwxyz"   can you help me to get the string between second double quotes(ijkl mnop) using sed or grep command.  In other words if I say give me the string in first quotes I want the  first string; if I say second string it should give me string between second double quotes and similarly third one also. Help finding this set Lets define the following:  Let A be a set. A is innumerable if and only if there exists a bijective function from A to $\mathbb{N}$  Proof that there exists an innumerable set $B \subseteq \mathcal P \left({\mathbb{N}}\right)$ such that it has the following properties:  1) $X\cap Y =\emptyset$ for all $X,Y \in B$ such that $X \neq Y$  2) $\mathbb{N}= \bigcup B$  3) All elements of B are innumerable.  Any help is appreciated. I don´t know how to find this set ... How many people can the TARDIS transport? The interior of a TARDIS is much larger than its exterior, but how many occupants can it transport? How to clear Chocolatey cache in the free version? Installation-file-cleaning is currently only available in  () and .  The package installation files can easily take gigabytes of storage space and to my knowledge they only increase in size as the user updates packages and installs new software, with only your hard drive capacity as the upper limit.   I don't know if Chocolatey stores cache in one central location — something is saved to ~\AppData\Local\Temp but the majority is located in the lib* folders in ~\ProgramData\chocolatey. Also the log files in the logs folder total to over 100 MB on my system. Is there any way to fully clear Chocolatey cache without manually deleting directories? Prove that , any primitive root $r$ of $p^n$ is also a primitive root of $p$