I have a WORKORDER points FC that has a CLASSIFICATION field (Oracle 18c/10.7.1 GDB). I want to automatically/programmatically create a dynamic layer in ArcGIS Desktop 10.7.1 for each unique value in the CLASSIFICATION field in the FC. In other words, if there are values like POTHOLE, SIDEWALK GRIND, STM POND CLEANING in the CLASSIFICATION field, then I want to create separate layers that only include features where the CLASSIFICATION is:  POTHOLE (layer name is POTHOLE) SIDEWALK GRIND (layer name is SIDEWALK GRID) TREE PRUNING (layer name is TREE PRUNING)  And I want to make the symbols for each layer to be the same—a simple point that is a specific colour.  What would it take to automatically generate the layers from a field in ArcGIS Desktop?
I am trying to set multiple definition queries for one layer based on one field using python.  ie.  I have a City layer with a field that holds the city name.  I want a copy of the layer in an MXD with the Definition query set for each value in the City field.  So essentially, I have one source layer, with a copy of the layer as many times as there are values in the City field.  The query would look like this: CITY = 'Atlanta'
Linux determines the type of a file via a code in the file-header. It doesn't depend on file-extensions for to know which software is to use for opening the file.  That's what I remember from my education. Please correct me in case I'm wrong!  Working a bit with Ubuntu systems recently: I see a lot of files on the systems which have extensions like .sh, .txt, .o, .c  Now I'm wondering: Are these extensions are meant only for humans? So that one should get an idea what kind of file it is?  Or does they have some purpose for the operating-system too? Why does printf not flush after the call unless a newline is in the format string? What's the most efficient way to concatenate strings? Working with a huge file. Illustrator is super slow. What can I do to ease the load? What is vertex and edge shading? Why do I get "Required key not available" when install 3rd party kernel modules or after a kernel upgrade? This issue happens only on UEFI systems with enabled Secure Boot.  When I try to install DKMS modules like VirtualBox, Nvidia, or Broadcom drivers, they do not install and I get Required key not available when I try to modprobe them.  VirtualBox complains that vboxdrv is not loaded.  Broadcom wl driver is shown in lspci -k as a kernel module but is not in use. sudo modprobe wl throws Required key not available.  Also this issue may happen when I install some kernel modules from git sources.  This issue may appear after a kernel update as disabled wireless adapter, black screen after a reboot, etc.   How can I fix it? How do I use a C# keyword as a property name? Using asp.net MVC I'd like to do this inside a view:  &lt;%= Html.TextBox("textbox1", null, new { class="class1" }) %&gt;   This statement does not compile because class is keyword in C#. I'd like to know how I can escape the property names such that this compiles.  It is possible to get this to compile if I change the "class" property to "Class" (uppercase C). But this is not suitable because strict xhtml says that all attributes (and element) names must be lowercase. multiple regression and multiple comparisons Say I fit a multiple regression of p explanatory variables. The t-test will allow me to check if any single one of those is significant ($H_0: \beta_i = 0$). I can do a partial F-test to check if some subset of them is significant ($H_0: \beta_i=\beta_j=...=\beta_k=0$).  What I often see though is that someone gets 5 p-values from 5 t-tests (assuming they had 5 covariates) and only keeps the ones with a p-value &lt; 0.05. That seems a bit incorrect as there really should be a multiple comparison check no? Is it really fair to say something like $\beta_1$ and $\beta_2$ are significant but $\beta_3$, $\beta_4$ and $\beta_5$ are not?   On a related note, say I run 2 regressions on 2 separate models (different outcome). Does there need to be a multiple comparison check for significant parameters between the two outcomes?  Edit: To differentiate from the similar question, is there any other interpretation to the p-values besides: "B_i is (in)significant, when adjusting for all the other covariates"? It doesn't seem that this interpretation allows me to look at every B_i and drop those less than 0.5 (which is similar to the other post).   It seems to me that a sure fire way to test whether B_i and Y have an a relationship would be to get a correlation coefficient p-value  for each covariate and then do a multcomp (although that would definitely lose signal).  Finally, say I computed the correlation between B1/Y1, B2/Y1 and B3/Y1  (thus three p-values). Unrelatedly, I also did a correlation between T1/Y2, T2/Y2, T3/Y2. I'm assuming the correct Bonferroni adjustment would be 6 for all 6 tests together (rather than 3 for the first group and 3 for the second group - and thus getting 2 "semi"-adjusted p-values). Shapefile Naming conventions in ArcPy? I have shapefile named `band-tailed_pigeon.shp which is fine and no problem on displaying or geoprocessing on Desktop but in ArcPy when I try to merge some layes to it I am getting this error   ExecuteError: ERROR 000354: The name contains invalid characters Failed to execute (Merge).  I tried to do the proccess with a simple name like sample.shp which it works but I HAVE TO keep the same name as we are using them in several projects. Here is the code which I have FinaloutLocation = &quot;E:\\GIS\\Data\\Final\\band-tailed_pigeon.shp&quot; inFeaturesToMerge = [dissolve_1, dissolve_2, dissolve_3, dissolve_4, dissolve_5] arcpy.Merge_management(inFeaturesToMerge, FinaloutLocation) How does Java's PreparedStatement work? As in the title, I must prove that: If a complex function $f$ is Entire, and there exist $k,R &gt; 0$, $n \in N$ such that $|f(z)| &gt; k|z|^n$ for all $|z| &gt; R$: Then f is a polynomial.  We've already had a similar question with the inequality reversed, and found that it had to be a polynomial with degree less than n. I was able to show that if it was a polynomial, then it had to have degree less than n, but not that it had to be a polynomial in the first place.  Once again, I'm face with the same problem. I assume this time, the degree of the polynomial will have degree greater than or equal to n, but how do I show that such $f$ must be a polynomial?  It's not like I can go through every other possible function there is, can I? I can show it doesn't work for exponentials, for example, but I just can't think of how to show that this ONLY works for a polynomial... Show that when $BA = I$, the solution of $Ax=b$ is unique I'm just getting back into having to do linear algebra and I am having some trouble with some elementary questions, any help is much appreciated.  Suppose that $A = [a_{ij}]$ is an $m\times n$ matrix and $B = [b_{ij}]$ and is an $n\times m$ matrix and $BA = I$ the identity matrix that is $n \times n$.  Show that if for some $b \in \Bbb{R}^m$ the equation $Ax = b$ has a solution, then the solution is unique. How do I color intersection of two ellipses in different color. For instances, the ellipses should themselves be colored as yellow and their intersection as red. My code for drawing ellipses is given below  \draw (-4,0) ellipse (8 and 3); \draw (8,0) ellipse (8 and 3);   UPDATE: In the comments to individual answers, I have requested to show it for three ellipses. I'm trying to split a string up into words and punctuation, adding the punctuation to the list produced by the split.  For instance:  &gt;&gt;&gt; c = "help, me" &gt;&gt;&gt; print c.split() ['help,', 'me']   What I really want the list to look like is:  ['help', ',', 'me']   So, I want the string split at whitespace with the punctuation split from the words.  I've tried to parse the string first and then run the split:  &gt;&gt;&gt; for character in c: ...     if character in ".,;!?": ...             outputCharacter = " %s" % character ...     else: ...             outputCharacter = character ...     separatedPunctuation += outputCharacter &gt;&gt;&gt; print separatedPunctuation help , me &gt;&gt;&gt; print separatedPunctuation.split() ['help', ',', 'me']   This produces the result I want, but is painfully slow on large files.  Is there a way to do this more efficiently? Allow HTML in excerpt Here is my excerpt code.  // Generate custom excerpt length function wpbx_excerpt_length($length) {     return 300; } add_filter('excerpt_length', 'wpbx_excerpt_length');   How do I allow html like &lt;a&gt; &lt;b&gt; &lt;i&gt; &lt;br&gt; Automate on-site plagiarism detection There have been many cases where on-site plagiarism has been coincidentally discovered by  good citizens either while looking for , or while answering questions merely to find out one of their  etc.   Most of the cases have been identified as verbatim copy-paste of the original answer.  I understand plagiarism is considered very offensive and can't be tolerated. It is very unprofessional and unfair. So here are my questions (and possibly a feature request):   Could verbatim plagiarized content be automatically detected?  Should it be pushed into a review queue similar to low quality posts for other users to confirm? Biblatex: nested citations with the \textcites command I'd like to type a citation within the text and another citation inside the parenthesis for the year, something like this:     The work of Author 1 (year; cited by Author 2, year)   For this, I've tried different options of the \textcite command but without results. Also I saw the solution posted , which works for multiple citations within parenthesis but not for in-text citations.  Any suggestion? Does $E = mc^2$ apply to photons? I have read several introductory texts about LSTM online, but none of them give a rigorously mathematical explanation of what the model actually does. For instance, why does the forget gate forget any more than any of the other gates in the LSTM unit?  Which papers and/or books should I read if I want to get a deeper understanding of LSTM? What is the number of strings at size $n$ that is constructed from ${a,b,c,d}$ and there is an even num of $a$ What is the number of strings at size $n$ that is constructed from ${a,b,c,d}$ and there is an even num of $a$?  I have tried to answer it as recursion formula in the following logic:  In order to build $ A(n) $, I will split into several cases:   if the string starts with $a$, then I will need another $a$ to make an even number of $a's$. so we get $aa[A(n-2)]$ meaning 2 $a's$ at the start + a valid string at the size of $n-2$. if it starts with $b,c,d$ we get $b[A(n-1)]$ + $c[A(n-1)]$ +$d[A(n-1)]$, meaning a one of the letters + a valid string at the size of $n-1$.   So we will get a recursion formula that looks like that:  $A(n) = A(n-2) + 3A(n-1)$  I'm not 100% on my answer, am I right to approach it in that direction?