I am looking for a quicker way to add points. I am mapping the buildings on a satellite imagery, but every time I add a point, I need to press enter to close the action menu.  Is there a way to add points without going through the action menu?
Any time I am inserting new point feature in QGIS, the Feature Attribute dialog box is popping up. Is there a way to prevent it? (I am willing to insert many points at once and this pop up box slows down the process).
What is the purpose of tape when finishing drywall? Sorry if this is a stupid question, but it doesn't seem immediately obvious how a thin strip of paper tape actually helps the taping process in drywall installation except for perhaps reducing the amount of mud needed between panels. This, from eHow:  Embedded in a layer of drywall joint compound, drywall tape creates a physical bond between adjacent sheets of drywall. Although the bond does not significantly contribute to the structural support of the drywall sheets, the bond reduces the movement and cracking of the sheets.  Wouldn't simply mudding between the joints have the same strength without the tape, albeit requiring more mud? How can I install Windows after I've installed Ubuntu? Two monitors when only having one in 13.10 I just did a fresh install of Ubuntu 13.10 64bit, and it says that I have 2 monitors, when I actually only have one    I have a Dell XPS 15 with Nvidia graphics card if that helps in anyway The page I'm trying to fetch is public.  The server logs show no request.  Google reports that any page on my site is "Temporarily unreachable". It won't even fetch the verification file, a static HTML file that was successfully used to verify with the webmaster tool application itself.   My site is running on the .  What is causing this? How many physical degrees of freedom does the $\mathrm{SU(N)}$ Yang-Mills theory have? Android SQLite database: slow insertion From the movies we know that Obi-Wan Kenobi delivered Luke Skywalker to Owen and Beru Lars to raise on Tatooine shortly after Luke was born at the end of RotS (Episode 3).   The next think we know is Luke running into Ben Kenobi during A New Hope.   There seems to be a hint that there was at least SOME communication between Kenobi and Lars family based on him telling Luke:     Your father wanted you to have this when you were old enough, but your uncle wouldn't allow it.   (though it's possible that was referring to Kenobi offering to leave the lightsaber to Larses at the same time he dropped off Luke)  I was wondering if any details of what transpired between Kenobi and Larses in the years between RotS and ANH were noted in any canonical works (of any canon, including EU books/games/comics/etc...)? Is it possible to construct an (asymmetric) encryption scheme from a signature scheme?  If the signature scheme is deterministic and allows  (e.g. ), then the answer is yes (create a forgery (m, sig); encrypt plaintexts using  with sig as the key; send m in clear to the signer along with ciphertexts, who can then compute sig and decrypt these ciphertexts) .  I am interested in similar reductions for probabilistic signature schemes.  What should the properties of a probabilistic signature scheme be so that it can be used for encryption? Lost my old passport for Schengen visa application What's the difference between denizen, resident, inhabitant? What's the difference between , , and ?  Even if their ODO definitions suggest they are interchangeable most of the time, are there fine differences in meaning between them? Why do this() and super() have to be the first statement in a constructor? Chrome and IE 11 are fine, I'm only able to reproduce this in Firefox. Using version 27.0.1 on Windows 7. Meta as well as all the other sites are affected.        I can still see the hover effect, but the image is gone. I see this in Firebug:        The image doesn't show up in the Network tab. I am able to see the image by visiting  which goes to   I've done Ctrl-F5, I've cleared the cache and I've tried Private Browsing. Possibly related to  ? Do I need a bus/train/plane ticket out of Thailand in order to get a Visa-on-Arrival? Someone told me I need a ticket out of Thailand in order to enter.  I am traveling to Thailand, on March 18th. I have a Ticket from Bangkok to Sweden booked for June 4th.   I will be staying in Thailand for 2 weeks when I arrive there, then traveling around Cambodia, Laos and Vietnam until June 4th when I leave.   With that ticket out of Thailand, will I be able to get in and get a (30 day) Visa-On-Arrival (or not because the ticket out is not within the first 30 days). Or do I need to show proof that I am leaving within 2 weeks of being there at first? How to prove $\vdash\neg P\to (P\to Q)$? I am trying to prove,  $$\vdash\neg P\to (P\to Q)$$  where $P$ and $Q$ are arbitrary but otherwise fixed formulas. The only axioms and rule of inference that I can use are,  $\color{crimson}{\text{Axiom 1.}}\  P\to (Q\to P)$ $\color{crimson}{\text{Axiom 2.}}\  (S\to (P\to Q))\to((S\to P)\to (S\to Q))$ $\color{crimson}{\text{Axiom 3.}}\  (\neg Q\to\neg P)\to(P\to Q)$ $\color{crimson}{\text{Rule of Inference.}}$ .  I know that in Angelo Margaris's book First Order Mathematical Logic there is a proof (page 53) but as I have mentioned , the dot notation seems very confusing and translating them to the nested parentheses notation seems very difficult to me. So, I am trying on my own to prove the result. Can anyone help? Determining if trees within forest gaps are clustered using R? The attached dataset shows approximately 6000 saplings in approximately 50 variable sized forest gaps.  I am interested in learning how these saplings are growing within their respective gaps (i.e. clustered, random, dispersed).  As you know, a traditional approach would be to run Global Moran's I.  However, aggregations of trees within aggregations of gaps seems to be an inappropriate use of Moran's I.  I ran some test statistics with Moran's I using a threshold distance of 50 meters, which produced nonsensical results (i.e. p-value = 0.0000000...).  The interaction among the gap aggregations are likely producing these results.  I have considered creating a script to loop through individual canopy gaps and determine the clustering within each gap, although displaying these results to the public would be problematic.    What is the best approach to quantify clustering within clusters? The question is to calculate the radius of convergence of $\sum\limits_{n=0}^\infty n!x^{n^2}$.  I dont know how to calculate R.O.C for such type of questions involving $n^2$ as power of x. How do we do this? Any help appreciated. Escape Key in the Chat There are no book recommendations for Astrophysics here. I will write my own answer, but I am also interested in what are others' views on the question (I will NOT mark my own answer as the best one). How do I move child windows without moving or minimizing parent in GNOME 3? I am having the same trouble as others getting my Atheros AR8131 Ethernet card recognised by Ubuntu 12.10 on my new HP Pavillion P7-1449 PC. I found the same question where the answer suggested the following:   Download Tarball compact-wireless-3.6.8-1-snpc Run  ./scripts/driver-select alx make sudo make install    The problem is when I run the make command I get the following:  make -C /lib/modules/3.5.0-21-generic/build M=/home/chris/Downloads/compat-wireless-3.6.8-1-snpc modules make: *** /lib/modules/3.5.0-21-generic/build: No such file or directory.  Stop. make: *** [modules] Error 2   Found a link to an alternative patch file (compat-wireless-2012-09-25-pc) but then I get the similar error:  make -C /lib/modules/3.5.0-21-generic/build M=/home/chris/Desktop/compat-wireless-2012-09-25-pc modules make: *** /lib/modules/3.5.0-21-generic/build: No such file or directory.  Stop. make: *** [modules] Error 2   Any help you could provide would be greatly appreciated.