I want to overlap both LiDAR data and SRTM data but they use different vertical coordinate systems.  I am using ArcMap 10.2 and I firstly created a LAS dataset and original vertical coordinate system of LAS dataset was Unknown VCS from ArcInfo Workstation (I didn't choose any vertical coordinate system. And this one appeared). And then, I created a new LAS dataset and chose vertical coordinate system as EGM96 which SRTM data and Google Earth have. But elevation values of LiDAR points did not change. Still have different values from Google Earth and SRTM data. I need LiDAR to have same elevation values with SRTM for the same region.  Is there a way to make LiDAR and SRTM data the same vertical values for the same point on the map?
How can one change a coordinate system for a .lasd (Lidar) dataset?  The file is currently in UTM_Zone_15N and I am trying to convert it to IL_East.
Intersection of powers of an ideal in a Noetherian ring Given a Noetherian ring $R$ and a proper ideal $I$ of it.  Is it true that $$\bigcap_{n\ge 1} I^n=0$$ as $n$ varies over all natural numbers? If not, is it true if $I$ is a maximal ideal? If not, is it true if $I$ is the maximal ideal of a local ring $R$? If not, is it true under additional assumptions on $R$ (like $R$ is regular)? Prove that $Ax=0$ has infinite solutions if and only if $ \text{rank}(A)&lt;n$   Here is one way of my if proof, but I don't know how to proof the other part.  Let $r$ be the rank of $A$. Then $ r\leq  n$. If $ r&lt;n$, then there are $n-r$ linearly independent solutions. Furthermore any linear combination of these solutions will also be a solution of $Ax=0$. Hence, in this case, the equation $Ax=0$ has infinite number of solutions Continuously copy all file changes from one folder to another on change (Windows) I'm working on a massive Java web application which is kept under centralized version control, but the source files are used to build and run the actual server, which then copies all the files I work on into a random temporary directory while it's running.  My problem is that I need to either rebuild this huge application to see any changes to my files, or keep track of all my changes and copy over the files I've changed back to their source location before committing them back to source control.  My question is: is there a command line script I can run that will monitor any changes in the source folder and automatically copy changed files across to temporary folder X?  The idea is to remove the human point of failure in having to manually mitigate the two-locations problem. Usage and example of the word “litotes” I've come across the word litotes, which means a rhetorical understatement. However, I’m having trouble understanding how to use it in colloquial English. Could someone please give an example? boolean[] vs. BitSet: Which is more efficient? What is more efficient in terms of memory and CPU usage — an array of booleans or a BitSet? Specific BitSet methods are not used, only get/set/clear (==, =, Arrays.fill respectively for an array). How to test if a string is basically an integer in quotes using Ruby Uncountable subset with uncountable complement, without the Axiom of Choice Let $X$ be a set and consider the collection $\mathcal{A}(X)$ of countable or cocountable subsets of $X$, that is, $E \in \mathcal{A}(X)$ if $E$ is countable or $X-E$ is countable. If $X$ is countable, then $\mathcal{A}(X)$ coincides with the power set $\mathcal{P}(X)$ of $X$. Now suppose that $X$ is uncountable. Assuming the axiom of choice, we can conclude that $\mathcal{A}(X) \ne \mathcal{P}(X)$, since $|X| = |X| + |X|$. So the question is:     Can we prove in ZF that $\mathcal{A}(X) \ne \mathcal{P}(X)$ for every uncountable set $X$?   I'm assuming that a set $X$ is uncountable if there is no injective function $f : X \rightarrow \mathbb{N}$. Probability that two random numbers are coprime is $\frac{6}{\pi^2}$ This is a really natural question for which I know a stunning solution. So I admit I have a solution, however I would like to see if anybody will come up with something different. The question is     What is the probability that two numbers randomly chosen are coprime?   More formally, calculate the limit as $n\to\infty$ of the probability that two randomly chosen numbers, both less than $n$ are coprime. Creating all possible line segments between all points using QGIS I want to connect all points in a point feature with every possible line segment using QGIS. For example, how a pentagon has five points with ten line segments connecting them all to form a pentagram inside. Alternatively phrased: How do I make spokes when all the points are hubs? I don't care about the order, I just want every connection between two points as one line each. Is there a tool or script that can do this in QGIS? This topic () is the closest to what I want but the plugins are no longer supported. Let the search find questions by ID I am unable to understand what exactly is critical value.My question here is why do we fail to reject a null hypothesis when the test statistic is within the range of critical value.  What i am trying to ask is what is the property of the critical value that makes the hypothesized value to fall within the range implied by the critical value.  Thanks in advance In PostgreSQL, what is the difference between a "Stored Procedure" and other types of functions? I understand the distinction between:   Scalar functions Set-Returning-Functions (SRF)s Internal functions Window functions Aggregate functions of all sorts User-Implemented functions (which in PostgreSQL can be implement in any language) Etc.   In SQL Server "Stored Procedures" are permitted through EXEC. What does that provide over any other function executed with SELECT that returns NULL?  When PostgreSQL gets Stored Procedures what will they bring me, and what is the formal distinction if any between a function and a stored procedure in the spec?  I read Can I cast a spell while another spell or ability is resolving? My opponent has a  with scads of loyalty. I've got a  and a  on the battlefield.  He activates Sorin's "ultimate" ability, targeting Gideon.     -6: Destroy up to three target creatures and/or other planeswalkers. Return each card put into a graveyard this way to the battlefield under your control.   Is there any way I can use the Spellbomb to prevent my opponent from stealing Gideon after he is sent to my graveyard? Is there such a thing as a European SIM card? This summer I will go on a road trip from West to East Europe and back. Being able to call and especially access the internet is useful on the road, so it made me wonder whether I could buy a European SIM card or something that would let me access the web or make calls regardless of the country I was in.  I know of the provider Mobile Vikings that offers a . Are there any other alternatives? Data is the main priority because calling or texting within Europe isn't that expensive to begin with, with recent regulations. Also I could use the data to call using VOIP anyway, which is even cheaper. Why is removing instationarities a good thing when trying to forecast a time series? Query for list of attribute instead of tuples in SQLAlchemy This was Problem 3 (first day) of the 1990 IMO. A full solution can be found      How many rationals of the form $\large \frac{2^n+1}{n^2},$ $(n \in \mathbb{N} )$ are integers?   The possible values of $n$ that i am able to  find is $n=1$ and $n=3$, so there are two solutions and this seems to be the answer to this problem.  But now we have to prove that no more of such $n$ exists, and thus the proof reduces to: Proving that $n^2$ does not divides $2^n+1$ for any $n \gt 3$.  Does anybody know how to prove this? How can I obtain an 'unbalanced' grid of ggplots? There is a bar of chocolate of size $N$ x $M$. Little square $(x, y)$ is poisoned. There are 2 players taking turns. In each move they can cut the bar along any of the horizontal or vertical lines, then the part which does not contain $(x, y)$ is being eaten. The player who is left only with square $(x, y)$ loses (beacause it is poisoned). Which player has the winning strategy? I guess that this game is equivalent to game of Nim due to Sprauge-Grundy theorem, but I don't know how. I am looking for easy(!) counterexamples that the product of two quotient maps is not necessarily a quotient map and that the quotient space of a Hausdorff space is not necessarily Hausdorff.