I use the following package:  \usepackage[backend=bibtex,style=author year,natbib=true]{biblatex}
I cite elements from my bibfile using \citet{key}. The reference appears as "Name1, and Name2 (year)" in text where year is a link leading to the bibliography. Now, I want to cite two papers from the same authors from different years. Instead of     Model XYZ is analyzed by Name1, and Name2 (2019) and Name1, and Name2 (2020).   I'd prefer to have something like     Model XYZ is analyzed by Name1, and Name2 (2019, 2020).   Of course, now 2019 should be a link to the 2019 paper in the bibliography and 2020 a link to the 2020 paper in the bibliography. Any ideas of I could adjust the \citet command?    I use biblatex as follows.  \usepackage[style=ext-authoryear,              sorting=nyt,             backend=biber,              natbib=true,                          uniquename = false,              uniquelist = false,             firstinits=false,              hyperref=true,             dashed=false,             backref=false,              maxbibnames=99,              maxcitenames=3,             isbn=false,              doi=false]{biblatex}
Why is my "Committed" memory so much higher than my actual RAM space? I have run two virus scans and neither of them have found anything so far (Malware Bytes and Avira Rescue). During gaming I will get Windows popups saying that my system is low of memory and recommends closing the game. This can also happen while browsing. My computer seems to become sluggish a lot and will hang up often, such as when clicking a link from a messenger program to open in my browser.   I am unsure what is causing this. My memory usage on the processes tab doesn't add up to such a high percentage of my actual memory.    As a side note, is my Disk Usage supposed to spike up to 100% sometimes? Research seems to say so. Evaluate $$ 1 + \frac{1}{3}\frac{1}{4}+\frac{1}{5}\frac{1}{4^2}+\frac{1}{7}\frac{1}{4^3}+\dots$$  All i could do was to see that $$\frac{1}{3}=\frac{1}{2.1+1},\frac{1}{5}=\frac{1}{2.2+1},\frac{1}{7}=\frac{1}{2.3+1},\dots$$  SO, we should be able to write   $$ 1 + \frac{1}{3}\frac{1}{4}+\frac{1}{5}\frac{1}{4^2}+\frac{1}{7}\frac{1}{4^3}+\dots=1+\sum_{n=1}^{\infty}\frac{1}{2n+1}.\frac{1}{4^n}$$  This is what i could simplify the given question to...   But, this is doing me no good.. I could not go any further..  I would be thankful if some one can help me to clear this.  I would request users who are trying to help me to just give necessary hints but not post it as answer.  Thank You. How can I make a special file that executes code when read from Most files on a Linux system are normal files, i.e. they are saved on disk and reading from them just reads from a specified chunk of memory on the disk.  How can I make something that behaves like a file in terms of being able to read from it as one would a normal file, but is actually returning programmatically generated data instead?  As a concrete example, a file that downloads the current google.com and returns it, such that cat ~/myspecialfile would output the contents of google.com to stdout? A lot of people will probably gloss over this fact, but it looks like C-3PO meets BB-8 for the first time in this scene 0:20:                                But how does C-3PO know BB-8's name? Is there a time where C-3PO meets BB-8 before this and knows his name? If $(X, \mathcal{T})$ has a countable subbasis, then it has a countable basis Why do we multiply the magnetic flux by the winding number? Continuous function positive at a point is positive in a neighborhood of that point Pretty much the problem asks if a function is continuous at the point $c$ and $f(c) &gt; 0$ then there exists a $d &gt; 0$ such that $\forall x$, $f(x) &gt; 0$ with $|x-c| &lt; d$.   I can understand what the problem means. That if a function is positive at a point then there is another point that's really close that'll also be positive. I can not prove this in a formal way though. I've tried using the intermediate value theorem and I do not know hot to implement it. Any ideas? Any examples of life forms on Earth that could have survived on Mars or Moon? Do we know of any living forms on Earth that could continue to live on Mars? In the PGF/TikZ manual, sometimes I see the option right of=somenode instead of right=of somenode. They look very similar, but the effects are different.  The distance between nodes positioned with the latter option is boundary-to-boundary, as stated in the manual. However, with the first option, it seems that the distance is shorter. I couldn't find any explanation of the first option in the manual.  My question is: what is the difference between the two options? Is there any explanation in the manual that I missed? How to prove Euler's formula: $e^{i\varphi}=\cos(\varphi) +i\sin(\varphi)$? Is there a C pre-processor which eliminates #ifdef blocks based on values defined/undefined? Is there a way to block access to or wipe my Google data for a lost/stolen phone How to interpret regression coefficients in logistic regression? “Screen overlay detected” dialog? Turned off everything, doesn't work I started receiving the “Screen overlay detected” dialog when trying to change apps settings.  Tried to turn off all "draw over other apps" as it says here - , first without system and then with, but it still doesn't work.  Then, I restored apps to original settings and it just made a bigger mess, dialog continue appearing. Any way to go back to previous settings???  Thanks! "INSERT IGNORE" vs "INSERT ... ON DUPLICATE KEY UPDATE" While executing an INSERT statement with many rows, I want to skip duplicate entries that would otherwise cause failure. After some research, my options appear to be the use of either:  ON DUPLICATE KEY UPDATE which implies an unnecessary update at some cost, or INSERT IGNORE implies an invitation for other kinds of failure to slip in unannounced.  Am I right in these assumptions? What's the best way to simply skip the rows that might cause duplicates and just continue on to the other rows? "24 hours' notice" or "24 hours notice"? Which one is correct?  1: Well, you canceled on Tuesday and our policy is 24 hours' notice for all cancellations. 2: Well, you canceled on Tuesday and our policy is 24 hours notice for all cancellations.  To me personally, the first one makes more sense grammatically. But I've also heard that the second version is how they typically write it on paper forms at hospitals (that's what native speakers say). Could you please clarify my confusion? So I watched the following .  In the clip, using what seems to be the recording from a standard bank camera, they zoom in at least 100, and see the image of the culprit in the reflection of the eye of the girl.  Now, I thought this was completely ridiculous, so much so that I thought it was actually really funny.    However, my friend argued that there are very good tricks for image enhancement, such as "super resolution" a procedure where multiple frames of a video to produce a much higher single resolution image.   He did think the show bends the truth quite a bit, but how much?  Honestly, I don't actually know anything about these things, so my question is:     How good is modern image resolution enhancement?  Also, how far off are the CSI television programs?    Thank you,  Remark: This is  on the Skeptics site.  I was told I might receive better answers here. What does really attracts a water stream to a charged object? I saw  by  and I was not 100% sure about the third phenomena, a statically charged object attracting a stream of water, especially because he explicitly mentioned that it is not due to the  of the water. A week later he uploaded an  all five phenomena and he says it is because of repelled equally charged ions, back up the water flow, such that the water actually falling along the charged object would be oppositely charged and therefore attracted. Here is a still image from the video illustrating this:    However this explanation seems strange to me, since this would mean that this way you could build up a charge in the water which has exited the tap (as well as in the water inside the tap as well). Therefore it should get harder to push those ions back over time, and therefore there also would be a decrease in the attraction of the water (assuming there is no other way to discharge it). I have tried a simple similar experiment, where I catched the water leaving the tap in an insulated bowl, but I did not notice a decrease in attraction.  There a couple of reasons why my experiment does not rule out his theory:   I was holding the charged (plastic) object by hand, which caused that its distance to the water stream varied, making it difficult to observe a decrease in attraction. I only conducted my experiment for roughly 30 seconds, which might be enough time for a opposite charge to build up.   The reason that he mentioned why permittivity can't cause this phenomena is because the electric field would be homogeneous and therefore the attractive and repulsive force of both dipoles of a water molecule would cancel out. However the electric field would only be homogeneous if the charged object would be an infinitely large plate, which it isn't. Thus water molecules would be attracted to the charged object. In order to make the permittivity theory more plausible I thought of maybe doing a order of magnitude calculation to see if it could generate a large enough force would be able the water stream by the observed amount. However I do not know what a good guess would be for variables such as the amount charge on the charged object and how the electric field would fall off over distance.   So, my question is whether his theory is really correct, or if the permittivity of the water can cause it. How many connected graphs over V vertices and E edges? Is there a way to calculate the number of simple connected graphs possible over given edges and vertices?   Eg: 3 vertices and 2 edges will have 3 connected graphs But 3 vertices and 3 edges will have 1 connected graph  Then 4 edges and 3 will have 4 connected graphs  Till such values...it is easy to see its  V choose E  But what about when the number of vertices are less than number of edges...how to calculate then?  I am not able to visualize that  Can it be a variation of the Stars and Bars problem  Like...number of ways 7 edges(balls) can be connected to (kept in) 5 vertices(bags) such that no vertex(bag) is isolated (is empty)  Here maybe we might have to consider the number of edges twice as each edge needs two vertices... sir, problem about a host file sir, over department created a host file to run over office program in windows, but they give us dell system having operating system ubuntu 16.4 now my question is that how this add file in ubuntu to run the program. the windows command is given below  TO ACCESS FIORI - Please Follow the Instructions in this Video  Path:- C:\Windows\System32\drivers\etc  Copy attached Hosts File in the above path.  Fiori Link to access SAP in Google Chrome: