I having trouble inserting a gif file into my overleaf latex document. Here is the code I used:  \documentclass[conference,10pt]{IEEEtran}  \usepackage{graphicx}  \usepackage[utf8]{inputenc}  \usepackage{epstopdf}    \usepackage{psfrag}      \usepackage{subfigure}   \usepackage{url}         \usepackage{stfloats}    \usepackage{amsmath}      \interdisplaylinepenalty=2500                      \usepackage{balance}   \DeclareGraphicsRule{.gif}{png}{.png}{%       \noexpand\epstopdfcall{convert #1 \noexpand\OutputFile}%  }  \AppendGraphicsExtensions{.gif}   \begin{figure}[h!]     \includegraphics[width=\linewidth, angle = 0] {images/Climate_Simulation_of_Surface_Air_Temperature.gif}     \caption{NASA's Map of Antarctic Ice Flow}     \label{fig:SSBlock}  \end{figure}  This did not work so I replaced the    \begin section with this line of code:       \includegraphics[width=\linewidth, angle = 0 {images/Climate_Simulation_of_Surface_Air_Temperature.gif}  Still nothing worked. Please let me know how I can insert my .gif file.
Is there any way to include an animated GIF directly in either PDFLaTeX or XeLaTeX? I realize the animate package can include animations in a PDF, but it doesn't support animated GIFs and you have to split them up manually into EPS or PNG files as far as I can tell.
change folder icons in ubuntu-mono-dark theme How to pass an ArrayList to a varargs method parameter? proof relating to limit definition of e I'm studying the book A Primer for the Mathematics of FinancialEngineering, along with it's solution guide. I've ran into trouble with the solution to question 7 in chapter 1.    The problem is:  Show that $(1+\frac{1}{x})^x &lt; e &lt; (1+\frac{1}{x})^{x+1}$ .   Specifically, I'm having trouble with one step in the solution.    It says that  $$x\ln\left(1+\frac{1}{x}\right)&lt;1&lt;(x+1)\ln\left(1+\frac{1}{x}\right)$$  can be written as   $$\frac{1}{x+1} &lt;\ln\left(1+\frac{1}{x}\right)&lt;\frac{1}{x}, \forall \ge 1.$$  How can the first equality (or is it inequality?) be written as the second? I have seen the following methods of putting JavaScript code in an &lt;a&gt; tag:  function DoSomething() { ... return false; }    &lt;a href="javascript:;" onClick="return DoSomething();"&gt;link&lt;/a&gt; &lt;a href="javascript:DoSomething();"&gt;link&lt;/a&gt; &lt;a href="javascript:void(0);" onClick="return DoSomething();"&gt;link&lt;/a&gt; &lt;a href="#" onClick="return DoSomething();"&gt;link&lt;/a&gt;   I understand the idea of trying to put a valid URL instead of just JavaScript code, just in case the user doesn't have JavaScript enabled. But for the purpose of this discussion, I need to assume JavaScript is enabled (they can't login without it).  I personally like option 2 as it allows you to see what's going to be run&ndash;especially useful when debuging where there are parameters being passed to the function. I have used it quite a bit and haven't found browser issues.  I have read that people recommend 4, because it gives the user a real link to follow, but really, # isn't "real". It will go absolutely no where.  Is there one that isn't support or is really bad, when you know the user has JavaScript enabled?  Related question: . Error in fontspec (my first question here) I'm using xelatex to compile this code:  \documentclass{book} \usepackage{fontspec}  \begin{document}  %This is a Greek text ``Ελλάδα'' text  \end{document}   and receive this error :  ("C:\Program Files\MiKTeX 2.9\tex\latex\fontspec\fontspec.cfg") ! Undefined control sequence. &lt;argument&gt; \LaTeX3 error:                             Erroneous variable \c__fontspec_shape_n_n_tl used! l.3806 \emfontdeclare{ \emshape, \eminnershape }   My aim is to make LaTeX compile greek letters properly in my pdf, but that's a different issue. Convergence of the series $\sum a_n$ implies the convergence of $\sum \frac{\sqrt a_n}{n}$, if $a_n>0$ I need help to solve following problem from Rudin's Mathematical analysis book:    Convergence of the series $\sum a_n$  implies the convergence of $\sum \dfrac{\sqrt {a_n}}{n}$, if $a_n&gt;0$  I tried to construct a suitable convergence sequence $b_n$ such that $\sum b_n$ converges and $a_n \leq b_n$ but, I am not able to find such sequence $b_n$ .  Thanks for the help and sugestions. How can I draw a tangent ending smoothly in a circle? I'm trying to draw a tanget on a circle, but I'm not happy with the result I get from the tangent option.    particularly, I'd like to have the lines ending smoothly in the circle. The problem is shown enlarged here:      Here is the code for this mininmal example  \documentclass{standalone} \usepackage{tikz} \usetikzlibrary{calc}  \begin{document}   \begin{tikzpicture}[thick]     \node[draw,circle,xshift=2.2cm] (big) [minimum size=25mm] {};     \node[draw,circle] (small) [minimum size=2mm] {};     \draw (small.south) -- (tangent cs:node=big,point={(small.south)});     \draw (small.north) -- (tangent cs:node=big,point={(small.north)},solution=2);    \end{tikzpicture} \end{document}   I'd greatly appreciate any advice allowing me to do this! Stealing and reattaching a running process It's sunday and I left an instance of R running in the office. The script finished running, and I would like to save my workspace without going to the office. I can ssh to the computer, but I have not run the program into screen.  Is there a way, over ssh, to disown the process (I don't have access to jobsid of the terminal the program is running on!) and reattach it with say, reptyr? Reptyr and reptyr -T don't work without previously disowning the process  28845 3diag       20   0  139.3m  10.4m   0.0  0.1   0:12.06 S  `- urxvtd                                                                                        5327 3diag       20   0   16.4m   4.6m   0.0  0.1   0:00.02 S      `- bash                                                                                      5335 3diag       20   0 3499.3m 3.244g   0.0 43.3 171:57.89 S          `- R    The unique part of my question is that I explicitly require to detach a program without having access to the terminal in which it was created. Why doesn't the mirror modifier work with object groups? Why doesn't the mirror modifier work with object groups? I have a group made of four objects to which I want to apply a mirror modifier. For me, it's not working. What are the steps to make apply a mirror modifier to a group of objects? Sort an Array by keys based on another Array? Is it possible in PHP to do something like this? How would you go about writing a function? Here is an example. The order is the most important thing.  $customer['address'] = '123 fake st'; $customer['name'] = 'Tim'; $customer['dob'] = '12/08/1986'; $customer['dontSortMe'] = 'this value doesnt need to be sorted';   And I'd like to do something like   $properOrderedArray = sortArrayByArray($customer, array('name', 'dob', 'address'));   Because at the end I use a foreach() and they're not in the right order (because I append the values to a string which needs to be in the correct order and I don't know in advance all of the array keys/values).  I've looked through PHP's internal array functions but it seems you can only sort alphabetically or numerically. What is the standard solution in JavaScript for handling big numbers (BigNum)? I'm looking to simultaneously send the same email to multiple recipients.  Let's say I want to email John and Bill the same email, I want them to be in the "To:" field, but I don't want them to see each other in the address list.  I don't want to bcc them both because then they see they are bcc'd.  I want them to each get their own copy of the identical email and to have 2 emails in my sent folder - one for each of them.  Essentially I want the same result as if I separately sent them each the identical email, but I'd like to do it in fewer steps.  Can I accomplish this either natively or with a plug-in, or some pre-existing code?  NOTE: I am looking to do this interactively (in real time), not in batch. What is the value of lim$_{n\to \infty} a_n$ if $\lim_{n \to \infty}\left|a_n+ 3\left(\frac{n-2}{n}\right)^n \right|^{\frac{1}{n}}=\frac{3}{5}$? Let $\{a_n\}$ be a sequence of real numbers such that $$\lim_{n \to \infty}\left|a_n+ 3\left(\frac{n-2}{n}\right)^n \right|^{\frac{1}{n}}=\frac{3}{5}.$$  What is the value of $\lim_{n\to \infty} a_n$? If $(X, \mathcal{T})$ has a countable subbasis, then it has a countable basis Why isn't an infinite direct product of copies of $\Bbb Z$ a free module?   Actually I was asked to show that it's not projective, but as $\Bbb{Z}$ is a PID, so it suffices to show it's not free.   I am stuck here. I saw some questions in SE, but there is no satisfactory answer at all. I'm very new to GIS concepts. Is there a way or procedure of finding out whether the co-ordinate system is in UTM, latitude/longitude or in stateplane using .prj file?   My .prj file contains the following text:      GEOGCS["WGS 84",DATUM["WGS_1984",SPHEROID["WGS   84",6378137,298.257223563,AUTHORITY["EPSG","7030"]],AUTHORITY["EPSG","6326"]],PRIMEM["Greenwich",0,AUTHORITY["EPSG","8901"]],UNIT["degree",0.01745329251994328,AUTHORITY["EPSG","9122"]],AUTHORITY["EPSG","4326"]] I've found a nasty VBS way to do this, but I'm looking for a native PoSh procedure to edit the properties of a .LNK file.  The goal is to reach out to remote machines, duplicate an existing shortcut with most of the correct properties, and edit a couple of them.  If it would just be easier to write a new shortcut file, that would work too. "I cannot seem to find it" I'm using the Apache Commons EqualsBuilder to build the equals method for a non-static Java inner class. For example:  import org.apache.commons.lang.builder.EqualsBuilder;  public class Foo {     public class Bar {         private Bar() {}          public Foo getMyFoo() {             return Foo.this         }          private int myInt = 0;          public boolean equals(Object o) {             if (o == null || o.getClass() != getClass) return false;              Bar other = (Bar) o;             return new EqualsBuilder()                 .append(getMyFoo(), other.getMyFoo())                 .append(myInt, other.myInt)                 .isEquals();         }     }      public Bar createBar(...) {         //sensible implementation     }      public Bar createOtherBar(...) {         //another implementation     }      public boolean equals(Object o) {         //sensible equals implementation     } }   Is there syntax by which I can refer to other's Foo reference apart from declaring the getMyFoo() method? Something like other.Foo.this (which doesn't work)? How is the system call in Linux implemented? When I invoke a system call in user mode,how did the call get processed in OS?  Does it invoke some some executable binary or some standard library?  If yes,what kind of thing it needs to complete the call?