I am new to QGIS. I am looking for any plugin or any manual method in QGIS for finding minimum distance (perpendicular distance) from a point which is part of one shapefile to nearest line among many lines which is part of another shapefile. MMQGIS is not useful for this purpose.   I used v.net.connect command.  I am getting minimum distance (perpendicular distance) from points which are part of one shapefile to nearest line among many lines which is part of another shapefile, but there is one problem. I am not identifying from the attribute table which distance belongs to which line.   In the attribute table, there 32 distance values for 32 points w.r.t nearest line. Is there any method to identify which distance value is belong to which nearest line? I want to identify the line identity in attribute table w.r.t distance value
I am new to QGIS. I am looking for any plugin or any manual method in QGIS for finding minimum distance (perpendicular distance) from a point which is part of one shapefile to nearest line among many lines which is part of another shapefile.   MMQGIS is not useful for this purpose.
How to secure recommendations and apply for PhD after having worked outside of academia for two years? How do I use Linq to obtain a unique list of properties from a list of objects? I'm trying to use Linq to return a list of ids given a list of objects where the id is a property. I'd like to be able to do this without looping through each object and pulling out the unique ids that I find.  I have a list of objects of type MyClass and one of the properties of this class is an ID.  public class MyClass {   public int ID { get; set; } }   What I want to do is write a Linq query to return me a list of those Ids  How do I do that given an IList&lt;MyClass&gt; such that it returns an IEnumerable&lt;int&gt; of the ids?  I'm sure it must be possible to do it in one or two lines using Linq rather than looping through each item in the MyClass list and adding the unique values into a list.  Any help in creating an elegant solution would be much appreciated! How are the AES S-Boxes calculated? I'm trying to understand how the AES S-Boxes are calculated. I understand how the multiplicative inverse is calculated over $GF(2^8)$, but I'm confused by the description of the affine transformation. I haven't been able to Google a good explanation of how the S-Box values are calculated. Can someone explain how this works, starting after the calculation of the multiplicative inverse? Should I use 'was' or 'were' in this example?     I was always delighted when my brother or one of my sisters was/were asked to do them. I'll be at my uncle's house just in case you need to reach me.      I'll be at my uncle's house should you need to reach me.   Could you tell me what is the difference between those? Determine the number of functions $f: \{1,2,3....,1999\}\to \{2000,2001,2002,2003\}$satisfying the condition that $f(1)+f(2)+...f(1999)$ is odd. Problems:Determine the number of functions $$f: \{1,2,3....,1999\}\to \{2000,2001,2002,2003\}$$ satisfying the condition that $f(1)+f(2)+...f(1999)$ is odd.   My Attempt: Each integer in domain has $4$ choices and therefore the total number of functions is $f$ is $4^{1999}.$ Since there are an equal number of functions that yield odd or even result, we can directly write that the number of functions satisfying the above condition to be $2*4^{1998}.$ I am unsure about this last claim and would like to prove it (if it is true.)Also is the answer to this problem correct?  Edit $1$: I tried to proceed further in the following manner:   For a given mapping $f$ let the number of integers assigned to $2000,2001,2002$ amd $2003$ be $p,q,r$ and $s$ respectively, where $p,q,r,s\in \mathbb{Z}^+$. Therefore the sum in question can be written as $f(1)+f(2)+...+f(1999)=2000p+2001q+2002r+2003s.$ Clearly the sum will be odd iff $q+s$  is odd. Also note that $p+q+r+s=1999\Rightarrow p+r$ is even. On the other hand if we let $q+s$ as even then $p+r$ must be even. Now the number of values of $p,q,r$ and $s$ for which the above two lemmas hold is the same and therefore if we let $f$ to be the function which maps elements form $\{1,2,3,...,1999\}$ to $\{2000,2001,2002,2003\}$ such that $q+s$ is even and $g$ to be the function  hich maps elements form $\{1,2,3,...,1999\}$ to $\{2000,2001,2002,2003\}$ such that $p+q$ is even we will get a bijection.(Maybe!) Nonlinear function continuous but not bounded I would like an example of a map $f:H\rightarrow R$, where $H$ is a (infinite dimensional) Hilbert space, and $R$ is the real numbers, such that $f$ is continuous, but $f$ is not bounded on the close unit ball $\{ x\in H : \|x\| \leq 1\}$.  Actually, $H$ could be replaced by any Banach space (but not just a normed space-- that's too easy).  My motivation is that if $f$ is linear, this is impossible; but I have next to no intuition about non-linear functions.  Edit: Here's an example for $c_0$ which is even differentiable (disclaimer: I found it here: ).  Define $f:c_0\rightarrow F$ (where F is your field, real or complex) by $$ f(x) = \sum_{n=1}^\infty x_n^n \qquad (x=(x_n)). $$  You can estimate the sum by a geometric progression, so it does converge.  A bit of checking shows that f is Frechet differentible (so certainly continuous).  But $f(1,1,\cdots,1,0,\cdots)=n$ (if there are $n$ ones) so $f$ is not bounded on the closed unit ball.  What I don't immediately see is how to adapt this to $\ell^2$, say. how to crop image in to pieces programmatically Why does the flash freeze a picture? Why does a flash freeze a picture even if I use a shutter speed like 1/10 sec?  I don't understand it, because the light will hit the sensor the whole time, not just when the flash is fired. I saw this in the end of an awesome shell script but I can't understand the login here because I think it's being short-handed for a longer command.  spark ${@:-`cat`}   This apears at the end of . Any ideas?  + Marks for some one who extends it into a full segment of code, even if its slower (Better for explanation) Fontspec causes long underscores My collaborator added \usepackage[no-math]{fontspec} to a document we're working on. The result is that \_ underscores become v. long: cf. pictures below.   \documentclass{article} \usepackage[no-math]{fontspec} \pagestyle{empty}  \begin{document} \textrm{metric\_space} \end{document}   With fontspec:    Without fontspec:   The underscores are about twice as long with fontspec, and also much thinner. My question is, how do I get back to the original width? (Ideally I would like to preserve the thinness -- it looks much nicer than the original.)  In case someone asks, "why are you using \_?", the short answer is that I need to typeset identifiers involving an underscore. See  for an example in context. I'd be happy with using something other than \textrm, if it looks decent in the context of that example. What is the opposite of postpone? Is there a difference in meaning among 'should', 'happens to', or 'should happen to'? How can I calculate the age of a person in year, month, days? I'm trying to setup a image decal in cycles, and I can't figure how to setup the nodes to work fine. Does anyone know the solution? In Windows XP we can search for files that contain a defined keyword (inside all files types).  Windows 7 can look inside files for a keyword, but only for text files. (*.doc, *.txt, *.inf, ...), not (*.conf, *.dat, *.*, ...).   don't contain any filter I can use for this.  How is this possible? Prove that if $p$ and $p^2+2$ are prime then $p^3+2$ is prime too Can Kingsoft Office be installed? Can Kingsoft Office be installed in Ubuntu? Integral of $\sqrt{1-x^2}$ using integration by parts How to automatically install entire Google Web Fonts collection?