I have some points (population) and using function Kernel Density i have calculated population density, then i reclassified the information. Now i would like to use the population density data in "union"function but the problem is that the input data has to be polygons! How can I solve this problem? I'm using ArcGIS10.
I have a population density raster and would like to create 5 polygons from the 5 natural break (jenks) classification ranges. 1 polygon for each classification range. I'm using ArcMap10 and have all of the Extensions enabled in the ToolBox to my disposal.   Thanks!
How to reload a gem on every request in Development mode? bash: ./program: cannot execute binary file: Exec format error I'm trying to run a program, but an error happens like this:  bash: ./program: cannot execute binary file: Exec format error   The result of file program was:  program: ELF-32-bit LSB executable, ARM, EABI4 version 1 (SYSV), dynamically linked(uses share libs), for GNU/LINUX 2.6.16, not stripped   How can I fix this error?  I'm using Ubuntu 14.04.2 (amd64) with VMware. I also tried with Ubuntu i386, but result was same. Support for N-Gons (polygons consisting of more than 4 vertices) has been in Blender for a while now, but many of us still may not know when to use them, and how to do so effectively.  In what situations do N-Gons really come in handy? When should they be just plain left out? Do they have any place in finished models? Prove $\gcd(a+b, a-b) = 1$ or $2\,$ if $\,\gcd(a,b) = 1$ I want to show that for $\gcd(a,b) = 1$ $a,b \in Z$   $\gcd(a+b, a-b) = 1$ or $\gcd(a+b, a-b) = 2$ holds.      I think the first step should look something like this:      $d = \gcd(a+b, a-b) = \gcd(2a, a-b)$   From here I tried to proceed with two cases. 1: $a-b$ is even, which leads to $\gcd(a+b, a-b) = 2$ 2: $a-b$ is odd, which leads to $\gcd(a+b, a-b) = 1$  My main problem I think is, that I do not know how I should include $\gcd(a,b) = 1$ in the proof.  Any help is appreciated. Thx in advance. Cherio Woltan On machine A I have the folder /home/a/  On machine B I have the folder /home/b/  I wish transfer all files, directories and sub-directories of /home/a in /home/b with sftp On machine A I tried the commands: sftp fibon82@machineB.com put /home/a/* /home/b/  but it doesn't work, i get the error message: &quot;skipping non-regular file /home/a/a1&quot;... [a1 is a sub-directory of a] How could I modify the put instruction? Thanks! :) EDIT: I solved using scp: scp -r /home/a/ fibon82@machineB.com:/home/b/ how to fill intersection of 2 shapes in latex tikz package I have to fill a specific region as given in the following figure.  The code I have written is   \begin{tikzpicture}  \draw (0,0) rectangle (10,10);  \draw (3.5,3.5) circle (5) node {A};  \end{tikzpicture}   Now, how to fill the intersecting area (area of circle overlapping the square) It is known that all $B$, $C$ and $D$ are $3 \times 3$ matrices. And the eigenvalues of $B$ are $1, 2, 3$; $C$ are $4, 5, 6$; and $D$ are $7, 8, 9$. What are the eigenvalues of the $6 \times 6$ matrix  $$\begin{pmatrix} B &amp; C\\0 &amp; D \end{pmatrix}$$ where $0$ is the $3 \times 3$ matrix whose entries are all $0$.  From my intuition, I think the eigenvalues of the new $6 \times 6$ matrix are the eigenvalues of $B$ and $D$. But how can I show that? For which $n≥2$ does there exist $\sigma\in A_n$ with $|\sigma| &gt; n$? I have a proof that I'd like to be verified. My proof that there exists $\sigma\in A_n$ with $|\sigma| &gt; n$ if and only if $n\geq 8$: For $n&lt;8$, one can manually verify for each $n$ that there is no $\sigma\in A_n$ with order greater than $n$. Suppose $n\geq 8$. Case 1: $n$ is even and $3\not\mid n$. Then the permutation $(1,2,3)(4,\dots,n)$ is even and has order $\operatorname{lcm}(3,n-3)=3n-9\geq n+16-9\geq n + 7$. Case 2: $n$ is even and $3\mid n$. Then $n\geq 12$, so $n-2\geq 8$ is even and is not divisible by 3. Applying Case 1, we see that $(1,2,3)(4,\dots,n-2)\in A_n$ has order at least $n+5$. Case 3: $n$ is odd. Then apply one of the previous two cases with $n-1$ to get an even permutation with order at least $n+4$. $\blacksquare$ Is my proof correct? It doesn't seem very elegant. Is there some slicker proof? variable-sized "such that" pipe Question of remainder on dividing by 7 Question :  What is the remainder when   $$ 10^{10} + 10^{10^2} +10^{10^3} + \ldots + 10^{10^{100}} $$  is divided by $7$? finite and infinite product of discrete space I have binary data in an unsigned char variable. I need to convert them to PEM base64 in c. I looked in openssl library but i could not find any function. Does any body have any idea? Possible Duplicate:          There are several tarballs (e.g. Firefox, Eclipse, Zend Studio and ...) that have executable files in them, that we can extract and run. but this executable will be available only for the user that extracts it.  If we want to make it available for all users we should move it to some location like /usr/share, /usr/local/share/, /opt/, ... and give appropriate permissions, make an executable file in /usr/bin/ and so on...  I want to make a deb installer file that does them all! How to do it? Out of Bag Error makes CV unnecessary in Random Forests? Let, $D=\{z\in \mathbb C:|z|&lt;1\}$. Which are correct?   there exists a holomorphic function $f:D \to D$ with $f(0)=0$ &amp; $f'(0)=2$. there exists a holomorphic function $f:D \to D$ with $f\left(\dfrac{3}{4}\right)=\dfrac{3}{4}$ &amp; $f'\left(\dfrac{2}{3}\right)=\dfrac{3}{4}$. there exists a holomorphic function $f:D \to D$ with $f\left(\dfrac{3}{4}\right)=-\dfrac{3}{4}$ &amp; $f'\left(\dfrac{3}{4}\right)=-\dfrac{3}{4}$ there exists a holomorphic function $f:D \to D$ with $f\left(\dfrac{1}{2}\right)=-\dfrac{1}{2}$ &amp; $f'\left(\dfrac{1}{4}\right)=1$.   With the help of Schwarz lemma &amp; its applications, we find that $(1)$ is false &amp; $(3)$ is true.  But, I can not think about options $(2)$ &amp; $(4)$. In Ubuntu 20.04, on the desktop, there is a number of actions I wish I could do, such as, by order of importance :  use keyboard shortcuts such as select all, copy / paste. use drag &amp; drop with icons deactivate the &quot;mouse over&quot; highlight, and restrict the clicking area to only the icon, not the surrounding square  To put it simply, I'd like to have the exact same features as offered by the desktop of Ubuntu 18.04 (probably related to a specific version of GNOME, and not Ubuntu itself). Am I missing something obvious here? I actually see no reason why those actions are removed or deactivated on the desktop, since they all work in any Nautilus window. XeLaTeX update [20201004] and item ball in Beamer I'm stuck with an uninstallable module. Drupal insists that there are Fields pending deletion and that the module can not be uninstalled. I've run cron zillion times already as advised for such situations but without success. Cron runs fine, but drupal insists that still, Fields pending deletion.  Visiting /admin/reports/fields gives no clues - the fields provided by that module are not listed. I even tried using drupal console to uninstall module with --force switch, but also without success.  I also tried drush field-info in hope to get some clues, but that's apparently not yet implemented as drush 8.1.2 gives fatal error:     Call to undefined function field_info_fields().   How do I make drupal delete those fields that pending deletion? Do I have to do this manually in database?  I've seen few tables like field_deleted_data_f5e7b87e32 or field_deleted_revision_be01eddd10 but they are all empty. Is that even relevant? PCA and the train/test split I have a dataset for which I have multiple sets of binary labels. For each set of labels, I train a classifier, evaluating it by cross-validation. I want to reduce dimensionality using principal component analysis (PCA). My question is:  Is it possible to do the PCA once for the whole dataset and then use the new dataset of lower dimensionality for cross-validation as described above? Or do I need to do a separate PCA for every training set (which would mean doing a separate PCA for every classifier and for every cross-validation fold)?  On one hand, the PCA does not make any use of the labels. On the other hand, it does use the test data to do the transformation, so I am afraid it could bias the results.  I should mention that in addition to saving me some work, doing the PCA once on the whole dataset would allow me to visualize the dataset for all label sets at once. If I have a different PCA for each label set, I would need to visualize each label set separately. How find this sum $\sum\limits_{n=0}^{\infty}\frac{1}{(3n+1)(3n+2)(3n+3)}$ Find this sum     $$I=\sum_{n=0}^{\infty}\dfrac{1}{(3n+1)(3n+2)(3n+3)}$$   My try: let     $$f(x)=\sum_{n=0}^{\infty}\dfrac{x^{3n+3}}{(3n+1)(3n+2)(3n+3)},|x|\le 1$$   then we have $$f^{(3)}(x)=\sum_{n=0}^{\infty}x^{3n}=\dfrac{1}{1-x^3}$$ then we find the $f(x)$,Following is very ugly(can you someone can post your follow solution,) have other simple methods? Thank you very much.