I have some address points selected for which that I want to update the address field based upon the row in the selection. How do I figure out the name of the selection taable to pass to arcpy.UpdateCursor()?
I have a question regarding selections in ArcGIS for Desktop. Assumed I have one layer in ArcMap and I have selected two of five features.   Is it possible to get a list of all selected features by using Python?   It would be fine if there is a way to get one special (or all) attribute(s) of the selected features stored in a list that can be written into a txt file.  Is it possible to do this in ArcGIS for Desktop?
When I am in texture mode one of my objects looks like it is in solid mode. The model is textured like all other models in the scene, but it doesn't look like it is in texture mode.  Screenshot will explain better:      What this model looks like. What all models should look like in texture mode. PSN sharing games I buy &amp; download a game from PSN on my user account on PS3 #1. Then I switch to PS3 #2 and login with the same PSN account. Can I download the same game without paying twice? Indian passport threading coming off My Indian passport threading is coming off i.e. the cover of the passport is coming off, there are only 2 threads remaining.   Will it be a problem at the airport when going abroad ? Also anyone who has experience of getting a replacement passport fairly quick ? Because I need to get a passport in like 15 days. Find and replace text within a file using commands How can I find and replace specific words in a text file using command line? Let $x,y,z>0$ and $x+y+z=1$, then find the least value of ${{x}\over {2-x}}+{{y}\over {2-y}}+{{z}\over {2-z}}$ Let $x,y,z&gt;0$ and $x+y+z=1$, then find the least value of  $${{x}\over {2-x}}+{{y}\over {2-y}}+{{z}\over {2-z}}$$  I tried various ways of rearranging and using AM > GM inequality. But I couldn't get it. I am not good at inequalities. Please help me.  I wrote $x$ as $1-(y+z)$ and I took $x+y$ as $a$ and the others as $b$ and $c$. And I am trying. How does matter know to obey physical laws? First of all, you may say that, this is a "why" question and in physics we don't ask such a question and instead we ask about "how". However, I want to discuss this with you.  We model the behavior of matter by physical laws, for example by quantum mechanics laws. I want to know how the matter, say electron, knows that it must obey such a law. What forces the electron to obey quantum mechanics laws?  If you consider a simulation of the universe in a computer, in the view of someone  simulated in that computer the physical laws are just there. They may not know what keeps  in check the simulated matter to obey physical laws, but in our perspective those simulated physical laws are there because we implemented them as zero and ones in a hard disk. If we wanted, we could change those physical laws and in the eye of the simulated person everything would be still fine.  Is there a scientific attempt to discuss this issue? so that I can read about it. We have $n$ charged and $n$ uncharged batteries and a radio which needs two charged batteries to work. Why is $5^{n+1}+2\cdot 3^n+1$ a multiple of $8$ for every natural number $n$? How do you address unknown peers in email? This is one bit of academic etiquette I'm not sure about. When I write to another researcher, a peer (we're both professors). I've never exchanged with before and never met him but I know of him (and he probably knows of me).  Erring on the side of formality, I write to him “Dear professor Mortimer”. I sign with my first name, because that's how I've always signed my emails (there's a formal signature block below, with full name and contact details) and I think it indicates a willingness to be called by my first name (which I prefer, but I don't want to force people one way or the other).  Is that going to be well received? Will people take the hint? Or should I just start using first names from the start? (it does sound weird to write “dear Philipp” to someone you don't know) It would seem that LIGO measures wibbles in the metric (not manifold) of spacetime:    It would seem that the expansion of the universe is an expansion of the metric of spacetime:    Imagine for a moment that LIGO is not an interferometer. (So, it just plain times speed changes, rather than using phase shift of orthogonal directions.)  If the ends of one of the arms was indeed receding away from each other, at a speed consistent with the expansion of the universe, is the sensitivity of real-world LIGO of the needed sensitivity of a machine which could measure that shift?  On other words: ideally I'd like to know these two meters:  (A) The left arm of LIGO is about 4km. It was stretched/shrunk (a few times) for roughly .01 seconds by the gravitational wave.  How many meters was it stretched/shrunk in .01 seconds?  (B) Assuming the same abstract LIGO arm was affectable and affected by the expansion of the Universe. How many meters is it stretch/shrunk every .01 seconds?    Note - of course, an interferometer is an ingenious device to measure extremely small changes in speed - assuming the changes are orthogonal. Of course, an interferometer, per se, can't at all measure the expansion of the universe since that is uniform in both directions. The sense of my question is, can something that measures distance changes > as accurately as &lt; the LIGO does, measure the expansion of the universe?  How big or small is the ongoing expansion of the universe compared to the wibble from the black hole system in question? How are classical optics phenomena explained in QED (Snell's law)? How is the following classical optics phenomenon explained in quantum electrodynamics?   Reflection and Refraction   Are they simply due to photons being absorbed and re-emitted? How do we get to Snell's law, for example, in that case?  Split by request: See the other part of this question . How can I (algorithmically) count the number of ways n m-sided dice can add up to a given number? I want to determine the set of natural numbers that can be expressed as the sum of some non-negative number of 3s and 5s.  $$S=\{3k+5j∣k,j∈\mathbb{N}∪\{0\}\}$$  I want to check whether that would be: 0,3, 5, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, and so on.  Meaning that it would include 0, 3, 5, 8. Then from 9 and on, every Natural Number. But how would I explain it as a set? or prove that these are the numbers in the set? When a player joins the server, this command block (containing gamemode 2 @a) puts them into gamemode 2/adventure mode. How can I change this so that only non-admin/not "opped" players' gamemode gets changed? Create a virtual file that is actually a command Is there any way to create a virtual file, such that reading from the file actually reads from the stdout of a command; writing to the file is acually writing to the stdin of a command?  So far I have kludged this with an inotifywait on a file, which calls a command when the file is modified, taking it's input from the file and writing back to it.  I don't like that the inotifywait has to be constantly restarted though (and I have to ensure that it is always running). I only use this file perhaps twice a week. Summation of natural number set with power of $m$ Who knows about the summation of this series: $$\sum\limits_{i=1}^{n}i^m $$  where $m$ is constant and $m\in \mathbb{N}$?  thanks Is there a UNIX command to list all recently removed files from a system Accidentally a rm -rf command was launched to my root directory instead of current directory. I stopped file removing by Ctrl+C but some files has already been removed. Is there a LINUX command to list all recently removed files from the system to get the affected applications ?  Operating System: CentOS 6.3 Strange artifacts along window borders after waking computer from sleep mode I'm using Terminator version 0.97. Is there a way that I can scroll unlimited? In the current version I only can scroll back limited history Probability to choose specific item in a "weighted sampling without replacement" experiment Given $n$ items with weight $w_n$ each -- what is the probability that item $i$ is chosen in a $k$-out-of-$n$ "weighted random sampling without replacement" experiment? Can a closed-form solution that depends only on $w_i / w_\cdot$ be derived ($w_\cdot = \sum_j w_j$.)?   EDIT: A solution that depends only on $w_i / w_\cdot$ is impossible. Assume $n=3$, $i=1$, $w_1 = 1$, and two cases: (1) $w_2 = 1, w_3 = 1 + \varepsilon$, (2) $w_2 = 2, w_3 = \varepsilon &gt; 0$. In case (1) the probability is almost $2/3$, in case (2) it is almost $1$, but in both cases $w_1 = 1$ and $w_\cdot = 3 + \varepsilon$.  What I have tried so far to solve the problem:  Let $P^n_k(w, i)$ be the probability that item $i$ is chosen in an $k$-out-of-$n$ experiment with weight vector $w$. In the first draw, the item is chosen with probability $w_i / w_\cdot$. Otherwise, we are looking for the probability to choose this item in a $k-1$-out-of-$n-1$ experiment, with the same weight vector except for the item that has been selected. Hence:  $$ P^n_k(w, i) = w_i / w_\cdot + \sum_{j \neq i} w_j / w_\cdot \cdot P^{n-1}_{k-1}(w - j, i) $$ $$ = w_\cdot^{-1} \left( w_i + \sum_{j \neq i} w_j \cdot P^{n-1}_{k-1}(w - j, i) \right) $$  with $w-j$ being "the vector $w$ without the $j$th element".  How to solve this recurrence relation? (If it is correct at all...)