"Shot" vs "shot at" In The Cambridge Grammar of The English Language (Huddleston &amp; Pullum, 2002), "shoot" belongs a special category of verb, conative verbs: that is, verbs that may be used intransitively to express an unsuccessful attempt. Consider:  [i.] I shot the bird.  [ii.] I shot at the bird.  The version with "at" implies that I may have missed: cf. [iii.] "I shot at the bird but it flew away".   My question is: can I say [iii.] to imply that I did hit the bird, but it didn't actually die and managed to fly away?
Shoot, Shoot At I have a question about the difference between the verb "shoot" and "shoot at":          Police shot the suspect.     Police shot at the suspect.        Are they just the same?
I read this book in Middle School and I can't for the life of me remember the title, but I can remember what it was about for the most part:  Takes place in the future, the government imposes laws that outlaw people from being different in appearance and skill level. For example, if you are fast or strong or tall, they will put weights on you to weigh you down so that you'll be more slower/shorter and more like the average. Another example, if you are pretty the government issues you "ugly glasses" etc.  Basically, it's all about making sure everyone is equal and punishing the extraordinary.  One of the main characters (a man) decides to literally loose himself of his shackles and weights, breaking them to display his power (if I'm remembering correctly).   Any ideas folks? How do I change login screen theme or background in Ubuntu 20.04? How can I change the Ubuntu 20.04 login screen theme or background?  In the previous version 19.10, I can change it from the CSS file under Yaru theme but now there is no CSS file. Is there a program to mount all of my drives automatically? Well, may be this is not really useful, but I've thought if it was possible to put all the document in one long page. I mean, if your document is going to be read in a computer, mix all the pages in a continuous page. If your document has 90 pages (A4), where each one is 21cm by 29.7cm the continuous document should be (more or less) one page which is 21cm by 90 · 29.7 = 2673cm. Is this possible? EDIT: Some things I would like to achieve:  The \newpage, \chapter{}, \part{}, etc. shouldn't go to a new page, they should only add more vertical space. The package pdfpages should add the pages continuously with almost no space between them. The titlepage, in this case, has a different color, so it could go alone in a basic A4 page (just to make things easier).  Question Is this possible? Teleporting a player from the overworld to the end When to use the double not (!!) operator in JavaScript Top-bar hat misplaced In my profile my hat is on the correct position, but not in the top-bar. This is new. It worked until now.    Works neither in Chrome nor in Firefox. I several days ago somewhere read that category and tag pages should be noindexed. But later on somewhere else, I read that, they only increase rank for search term, but overall traffic decreases- said one from his experience.  So, if I just concern about traffic, not about individual search term that much, should I make those category and tag pages as indexed to google? I am confused which is the best to do.  Thanks in advance.  Regards Rana FME - Calculate distance of point along a line I have created an FME workspace which inputs a pipeline as well as other linear features which cross it (waterways, roads, railways, fences, other pipelines, etc).  The output is a point file which contains the crossing type.  What I would like to do is calculate the distance along the pipe from the start of the pipeline for each intersection.  So, as you travel along the pipeline, the distance attribute will increase.   I'm thinking that I'll need to use some of the linear referencing tools like MeasureGenerator, MeasureExtractor, or something like that, but I'm not sure how to do so.  Does anyone have an idea of how to do this? PrintWriter append method not appending In Bash, suppose I visit a directory, and then another directory. I would like to copy a file from the first directory to the second directory, but without specifying the long pathnames of them. Is it possible?   My temporary solution is to use /tmp as a temporary place to store a copy of the file. cp myfile /tmp when I am in the first directory, and then cp /tmp/myfile . when I am in the second directory. But I may check if the file will overwrite anything in /tmp.  Is there something similar to a clipboard for copying and pasting a file? Remote Linux server to remote linux server dir copy. How? What is the best way to copy a directory (with sub-dirs and files) from one remote Linux server to another remote Linux server? I have connected to both using SSH client (like Putty). I have root access to both. ViewPager as a circular queue / wrapping While rendering a mesh with smooth shading on, I get a dark region/shadow on certain faces. The effect is more evident when smooth shading is applied to a mesh containing ngons, with the ngons turning black when rendered.   The blackening effect is visible in the viewport too.  How can I solve this problem? Suppose that, for a real application, I have ended up with a sorted list A = {$a_1, a_2, ..., a_{|A|}$} of elements of a certain kind (say, Type-A), and another sorted list B = {$b_1, b_2, ..., b_{|B|}$} of elements of a different kind (Type-B), such that Type-A elements are only comparable with Type-A elements, and likewise for Type-B.  At this point I seek to count the following: in how many ways can I merge both lists together, in such a way that the relative ordering of Type-A and Type-B elements, respectively, is preserved? (i.e. that if $P_M(x)$ represents the position of an element of A or B in the merged list, then $P_M(a_i)&lt;P_M(a_j)$ and $P_M(b_i)&lt;P_M(b_j)$ for all $i&lt;j$)  I've tried to figure this out constructively by starting with an empty merged list and inserting elements of A or B one at a time, counting in how many ways each insertion can be done, but since this depends on the placement of previous elements of the same type, I've had little luck so far. I also tried explicitly counting all possibilities for different (small) lengths of A and B, but I've been unable to extract any potential general principle in this way. When using Spring Security, what is the proper way to obtain current username (i.e. SecurityContext) information in a bean? I have a Spring MVC web app which uses Spring Security.  I want to know the username of the currently logged in user.  I'm using the code snippet given below .  Is this the accepted way?    I don't like having a call to a static method inside this controller - that defeats the whole purpose of Spring, IMHO.  Is there a way to configure the app to have the current SecurityContext, or current Authentication, injected instead?      @RequestMapping(method = RequestMethod.GET)   public ModelAndView showResults(final HttpServletRequest request...) {     final String currentUser = SecurityContextHolder.getContext().getAuthentication().getName();     ...   } How can I depict vehicle traffic during daytime in a long exposure without washing out the vehicles? I met an interesting issue about C#. I have code like below.  List&lt;Func&lt;int&gt;&gt; actions = new List&lt;Func&lt;int&gt;&gt;();  int variable = 0; while (variable &lt; 5) {     actions.Add(() =&gt; variable * 2);     ++ variable; }  foreach (var act in actions) {     Console.WriteLine(act.Invoke()); }   I expect it to output 0, 2, 4, 6, 8. However, it actually outputs five 10s.  It seems that it is due to all actions referring to one captured variable. As a result, when they get invoked, they all have same output.  Is there a way to work round this limit to have each action instance have its own captured variable? Baker-Hausdorff Lemma from Sakurai's book I'd like to show that, given to hermitian operators $A,G$ on a Hilbert space $\mathscr{H}$, the following identity holds: $$ e^{iG\lambda}A e^{-iG\lambda} = A + i\lambda [G,A] + \frac{\left(i\lambda\right)^2}{2!}[G,[G,A]]+\ldots+\frac{(i\lambda)^n}{n!}\underbrace{[G,[G,[G,\ldots[G}_{n\ times},A]]]\ldots]+\ldots $$ where $\lambda$ denotes a real parameter and $[\ \!,]$ indicates the commutator.  This is a proof left to the reader by Sakurai in his books on Modern Quantum Mechanics. Function returns None without return statement