I've found  how to write author's names in latex bib. However, the first author name is always separated in two with a comma. Here is an example:   @conference{ASoDToED, title = {A Study on Deduplication Techniques over Encrypted Data}, author ={Ganesh,Amal and Sunitha,C. and Akhila,K.}, year = {2016}, booktitle = {procedia Computer Science}, volume = {87}, pages = {38 to 43} }   As output i will have:   Ganesh, Amal, C.Sunita and K.Akhila   And it's the same for ALL my bibliography: the first author name is splitted with a comma. I've tried many other ways, like writing:   Ganesh,A. and... Ganesh Amal and ...    It doesn't change anything.   However, the reference is good. For the example i gave here, the reference is [GSA16], which is the good one. So it didn't consider "Amal" as a name, but it still write it separately with a comma... How can i get rid of this comma? It feels weird that the first name is not written as the other ones.  EDIT: Here is a minimal example. The documentclass wissdoc can be found on GIT.  \documentclass{wissdoc}  \usepackage[utf8]{inputenc} \usepackage[T1]{fontenc} \usepackage[english]{babel} \usepackage{bibgerm} \usepackage[     numbers,     sort&amp;compress ]{natbib} \usepackage[protrusion=true,expansion,babel=true]{microtype}  \usepackage{amsmath} \usepackage{amsthm} \usepackage{amsfonts} \usepackage{dsfont} \usepackage{moreverb} \usepackage{subcaption}  \begin{document}  \graphicspath{{images/}}  \selectlanguage{english} \chapter{first Chapter} let me introduce the chapter ~\cite{ASoDToED} \section{first section of chapter 1} this is my text ~\cite{SDoED} \section{second section of chapter 1} i have a lot of sections   \bibliographystyle{geralpha} \bibliography{textest} \end{document}   The bib file:   @conference{ASoDToED, title = {A Study on Deduplication Techniques over Encrypted Data}, author ={Ganesh,Amal and Sunitha,C. and Akhila,K.}, year = {2016}, booktitle = {Procedia Computer Science}, volume = {87}, pages = {38 to 43} } @article{SDoED, title={Secure Deduplication of Encrypted Data: Refined Model and New Constructions}, author={Jian, Liu and Li, Duan and Yong, Li and N., Asokan}, year={2017}, }
I use babelbib and I have a source with two authors. Contrarily to when using the plain bib style, as soon as I switch to babplain, the author names are formatted like this:  [1] Müller, Jan und Eva Schulze: Name of the book, 2015.   While I would like both author names to be formatted the same way, that is one of these:  [1] Müller, Jan und Schulze, Eva: Name of the book, 2015. [1] Jan Müller und Eva Schulze: Name of the book, 2015.   sources:  % test.tex \usepackage[ngerman]{babel} \usepackage[fixlanguage]{babelbib} \selectbiblanguage{ngerman} \bibliographystyle{babplain} \bibliography{test}  % test.bib @manual{foo,     author = "Müller, Jan and Schulze, Eva",     title = "Name of the book",     year = "2015", }   I can fix it by specifying and {Schulze, Eva}, but that way all is treated as the last name, that cannot be the solution, can it?
How do I reset a lost administrative password? I'm working on a Ubuntu system, and my client has completely forgotten his administrative password. He doesn't even remember entering one; however it is there.  I've tried the suggestions on the website, and I have been unsuccessful in deleting the password so that I can download applets required for running some files. Is there a solution? Can anyone explain to me why I would want to use IList over List in C#?  Related question: $.ajax call working fine in IE8 and Doesn't work in firefox and chrome browsers did + present tense (or ) Past tense of the verb What did you say?   What you said.         How did you and mum guess I wanted Agnes?   how you and Mum guessed I wanted Agnes   What is the meaning of above two sentences? When should I use "did + present tense" and the past tense of a verb? Full file date (without GNU utilities) I am trying to obtain the full date (created or modified) of a particular file for passing to another program. I have tried variations of options with the ls command but none provide a full date for files less than 6 months old and I have limit usage of the options. When I try certain options I have seen trying to research this I get the following message:  usage: ls [-1ACFHLNRabcdefgilmnopqrstuxEUX] [File...]   None of which seems to provide what I needs as far as I can tell so I tried to use the stat command but it is not available to me.  I am using the Korn shell on AIX 5.3 which has limited commands available, can anyone suggest another way that I might be able to obtain a file's created or modified date as a full date (either dd/mm/yyyy or yyyy/mm/dd). I read somewhere that companies are not required to pay dividends to shareholders (this is correct, yes?).   If so, then if company A never pays dividends to its shareholders, then what is the point of owning company A's stock? Surely the right to one vote for company A's Board can't be that valuable.   What is it that I'm missing? Why isn't there a continuously differentiable surjection from $I \to I \times I$? I was asked this question recently in an interview. Why can't there be a a continuously differentiable map $f \colon I \to I \times I$, which is also surjective? In contrast to just continuous, where we have examples of space filling curves.  I have one proof which is direct via Sard's theorem. But the statement seems simple enough to have a proof using at most implicit (and inverse) function theorem. I have 16GB RAM. Do I need 32GB swap? If user input is inserted without modification into an SQL query, then the application becomes vulnerable to , like in the following example:  $unsafe_variable = $_POST['user_input'];   mysql_query("INSERT INTO `table` (`column`) VALUES ('$unsafe_variable')");   That's because the user can input something like value'); DROP TABLE table;--, and the query becomes:  INSERT INTO `table` (`column`) VALUES('value'); DROP TABLE table;--')   What can be done to prevent this from happening? Is the following statement provable? I've been wondering, what is the difference between seek and search? When should one be preferred over the other? How to compute the marginal likelihood given two multivariate Normal distribution? Given that $a$~$\mathcal{N}(\mu, \Sigma)$ and $\mu$~$\mathcal{N}(0, \sigma^2 I)$, Is $p(a|\Sigma, \sigma)=\int p(a|\mu, \Sigma)p(\mu|\sigma)d\mu$ again a Normal distribution? And how to estimate the mean and variance respectively? Thanks a lot! A question here on meta for instance may stick around for quite a while. A feature-request  maybe even for months. Then the status (tags) gets changed to  or  or whatever and the OP does not get notified.  On a normal post-edit we get a notification but retagging does not count for that. Please add retagging to the edit notifications. I'm getting into English recently and I'm a little confused by the way people pronounce a word that starts in a vowel right after a word ending in -ing.  For example:      You have to bring it up now?   I don't know if I should pronounce it as:   bring /ŋit/ brin' /nit/ bring /git/   Another example would be "I'm coming out".  Likewise, what about the ending -ang? For example:      We can just hang out and have a good time.    And to round it all up, what about a combination of the two? For example,      He got sick of hanging around waiting for you and went home.   I've been asking myself these questions for weeks. With biblatex, the author can be replaced by a dash (or “idem”) in the bibliography. Is it possible to have this replacement also if there are multiple authors, and the first of these multiple authors is the same as the author of the book listed before? (It is somewhat difficult to describe, see the attached example instead, where “Buchautor, Hans-Wilhelm” should be replaced in book3 as well.)   I assume that it should be possible by customising \DeclareNameFormat, but I don’t know how.  Minimal example:  \documentclass{scrartcl} \usepackage[T1]{fontenc} \usepackage[latin1]{inputenc} \usepackage[english]{babel} \usepackage{csquotes} \usepackage{filecontents} \begin{filecontents}{\jobname.bib} @BOOK{book1,   author = {Buchautor, Hans-Wilhelm},   title = {Irgendein Buch},   location = {Buch am Wald},   date = {2000} } @BOOK{book2,   author = {Buchautor, Hans-Wilhelm},   title = {Ein anderes Buch},   location = {Berlin},   date = {2001} } @BOOK{book3,   author = {Buchautor, Hans-Wilhelm and Zweitautor, Zoran},   title = {Noch ein Buch},   location = {London and New York},   date = {2010} } \end{filecontents}  \usepackage[ style=authortitle, backend=bibtex8 ]{biblatex} \bibliography{\jobname}  \renewcommand*{\bibnamedash}{%   \bibstring[\mkbibbold]{idem\thefield{gender}}}  \begin{document} \nocite{*}  \printbibliography \end{document}   Edit 15/02/2011 17:14   I should have added that there was a feature request for biber which pointed back to biblatex. See .  Edit 21/06/2011 9:26  Is this somehow possible now with biblatex 1.4/1.5? I played a bit with uniquename/uniquelist, but I could not get it to work. Gamma Distribution out of sum of exponential random variables I have a sequence $T_1,T_2,\ldots$ of independent exponential random variables with paramter $\lambda$. I take the sum $S=\sum_{i=1}^n T_i$ and now I would like to calculate the probability density function.  Well, I know that $P(T_i&gt;t)=e^{-\lambda t}$ and therefore $f_{T_i}(t)=\lambda e^{-\lambda t}$ so I need to find $P(T_1+\cdots+T_n&gt;t)$ and take the derivative. But I cannot expand the probability term, you have any ideas? Given a random square matrix of size $n\times n$ in the field $\mathbb F_2$, what is the probability that its determinant is $1$? (This is also the probability that the matrix is non-singular, since $\mathbb F_2$ only has the elements $0$ and $1$.) Is there a 'rule of thumb' on the upper limit of how many related records in related objects an object should have to avoid slow page loading? Typically, each record in Salesforce will be 2kb large: .   However, let's say in an extreme example, the Opportunity object is related to 40 custom objects, each which has 100,000 records. The page would load much slower, especially in an older browser version.   1) Is there a 'rule of thumb' as to what the upper limit of how many related records an object should have?   2) Also, , there's an indication that there's some sort of tier-tuning per org based on the volume of data it has. Is that correct? And if so, are the volume ranges and respective tier-tuning capacity available? Alice has a secp256k1 key pair that she used some time ago when she communicated with Bob. Bob can no longer user secp256k1 but he only uses ed25519 instead.  Is there a secure algorithm that Bob can use to derive an ed25519 pubkey from original Alice's secp256k1 pub key and also Alice can derive the matching ed25519 private key from her original secp256k1 private key such that they can communicate securely via ed25519 encrypted messages?  Thanks! Show that $E(X)=\int_{0}^{\infty}P(X\ge x)\,dx$ for non-negative random variable $X$