How to put this movie (.mp4) in my slide
Beamer: PDF presentation viewer to play embedded videos and show elapsed time
Blender is rendering an older version my project Difference between inline view and WITH clause? How do I select elements of an array given condition? Inform new users if they can upvote an answer they accepted I surprisingly often stumble upon answers which were accepted but clearly not upvoted by the asker. For example, the answer has not received any upvotes at all or the asker’s vote count is zero. While I acknowledge that , most such cases happen with new users, who have only recently received the privilege to vote and who upvote after a friendly reminder.  Given the anonymity of votes and that I do not check the asker’s profile for every question with an accepted answer I stumbled upon, I assume that there is a huge dark figure for this phenomenon. Also, I naturally most often spot this on my own answers, which makes reminding the asker of their privileges somewhat awkward.  I thus propose that users which accept an answer are reminded by a pop-up that they can upvote it, if:   They haven’t already upvoted it. They have the reputation required for voting. They have cast less than a handful of votes.   I consider the latter criterion to be better than an upper reputation for which the message is displayed, since I know at least one user with several thousand reputation points, who has cast much less upvotes or votes on answers than he has accepted answers on some sites (not that his acceptance rate or general feedback on answers is spectacular). EDIT:  My question was poorly worded.   I wasn't asking about showing $\ln(1+x) &gt; \frac{2x}{2+x}$ for $x&gt;0$.   What I wanted to know is why the lower bound provided by $ \frac{2x}{2+x}$ was so tight for small positive values of $x$. This is addressed in robjohn's answer. Is there a list of Ubuntu versions with default corresponding Linux kernel versions somewhere?  I would specifically like to know the most recent version of Ubuntu that still used Linux Kernel 2.x. Restoring open software after a restart event in windows I find that at the end of a long day, I sometimes have a large number of programs running. All which I will need to use tomorrow. Normally, this isn't an issue, I can simply lock the machine and come back tomorrow. My problem arrises when windows update launches in the middle of the night and force restarts my computer. That in turns closes all my open software. I of course save everything regularly so I don't loose anything, but I waste time reopening all of those resources whenever there is a restart.   [EDIT]  I should clarify that I still want to be able to restart my computer when an update comes down. Preventing the restart only delays the problem until later. I should have been more specific in that I want to be able to recover my working environment after a restart for any reason. Things like scheduled maintence, power loss, updates, and software installs.  [EDIT]  I can't simply have them setup to launch at startup becasuse those files change from week to week. So I need something that monitors what I have open, and gives me the option to "recover" those software sessions when I log back in.  Anyone have any suggestions on what I can do? I'd even be willing to purchase software to do this for me if that is the only option.  Thanks I am trying to find all directories in a folder recursively while exclude all git submodules  by excluding all path containing .git file. How could I do it?     Explanation:  .git file exists at the root of every submodules folder. This submodule folder could be included anywhere.    Test Case  $ mkdir Test $ cd Test $ mkdir a $ mkdir b $ mkdir c $ cd a $ mkdir .git $ cd .. $ cd b $ touch .git $ cd .. $ cd c $ mkdir c1 $ mkdir c2 $ cd.. $ find . -type d \( \( ! -name . -exec [ -e {}/.git ] \; -prune \) -o \( \( \  -name .git\  -o -name .vscode\  -o -name node_modules\  -o -name Image\  -o -name Rendered\  -o -name iNotebook\  -o -name GeneratedTest\  -o -name GeneratedOutput\   \) -prune \) -o -print \) | sort    Expected Results  . ./a ./c ./c/c1 ./c/c2 Why is it "description" but "describe" (b and p)? I've just wondered by it is "description", but "to describe". It looks as if "to descripe" would be a more consistant choice. Is there any other explanation besides "this is how it is written for years"?  edit: Or alternatively "to describe" and "describtion". Will Windows 10 Technical Preview be upgradable to final release? Is there any information about if Windows 10 Technical Preview will then be upgradable to the final release ?  I'm asking that because I would like to use it on my primary PC (I'm aware of the risks but I accept them), in place of Windows 8.1 But I'd like to avoid to reinstall all after the release of the final version. Why doesn't Java allow generic subclasses of Throwable? According to the , 3rd edition:        I wish to understand why this decision has been made. What's wrong with generic exceptions?  (As far as I know, generics are simply compile-time syntactic sugar, and they will be translated to Object anyway in the .class files, so effectively declaring a generic class is as if everything in it was an Object. Please correct me if I'm wrong.) The question is raised from the viewpoint of a foreign language learner.  -ed is known to be added to a verb to mean past tense or past participle, but some phrases like four-legged animals, winged birds, are in the form of noun+-ed, why is it so? What is the logic behind such a structure? How can I change the colors of lightning-button?  I tried doing this in my css:  .my-button {     background-color: #14a6bc;     color: #ffffff; }   and applying that class to my &lt;lightning-button&gt; and removing the variant but I still get the base colors? I am trying to use these examples: Books for starting with analysis I am interested in self-studying real analysis, and I was wondering which textbook I should pick up. I know all high school mathematics, I have read  (I did most of the exercises).  I have completed a computational calculus course which covered everything up to and including integration by parts (including the substitution method and Riemann sums) I am currently considering:    From what I have heard this is not very well suited for self-study and that while the exercises are extremely difficult, if you take the time they are worth the effort.    I have heard that while Spivak explains proofs in much more detail than Principles, it doesn't cover all of the material in the latter.    I don't know much about this. I have only seen some comments saying that it is an excellent introduction to analysis.    Extra clarification edit: I would prefer a book not to ''dumb down'' the material, something that would not hold my hand through every step, something that would force me to fill in the gaps myself instead of explaining every single step. That is why I am currently leaning towards Rudin, but before I decide I would still like some information on the book by Apostol. Change date format [YYYYMMDD] to [MM/DD/YYYY] dpkg-divert: error: rename involves overwriting `/usr/lib/xorg/protocol.txt' with different file `/usr/lib/xorg/protocol-precise.txt', not allowed I'm trying to find out what modules  in cpan. So I've used  to mirror it. My problem is that I need to iterate through the archives that are downloaded, and grep the files that are in the archives. Can anyone tell me how I might do this? preferably in a way that tells me which file in the archive and what line it's on.  (note: they aren't all tarballs some are zip files) How do you get a submit button in the Windows Phone keyboard? I feel intimidated in learning TikZ. I was wondering if there are some nice materials (or just your replies) at different level:   for providing big picture, which is important to beginners to not lose direction during learning. for comprehensive reference.   Examples are important, but only examples are not always clear for understanding the big picture and organization. Why does the series $\sum_{n=1}^\infty\frac1n$ not converge? Can someone give a simple explanation as to why the       $$\sum_{n=1}^\infty\frac1n=\frac 1 1 + \frac 12 + \frac 13 + \cdots $$   doesn't converge, on the other hand it grows very slowly?   I'd prefer an easily comprehensible explanation rather than a rigorous proof regularly found in undergraduate textbooks.