When you create an circle or ellipse in a GDB it is rendered as a parametric geometry storing x, y, radius, etc. and not as a polygon with nodes.    I have a layer with both polygons and parametric geometries (circles/ellipses). How do I make a query in ArcGIS 10.3 that returns only the parametric geometries and not the 'normal' node based polygons?
The only good way of creating circles in ArcMap is using true arc, (compound curves) but I need to convert those to vertex (densifying) because of a compatibility problem. I need info for geodatabase and SDO_geometry (arcsde)  and yes there is a way. I use:  UPDATE layer1 a SET arctype = 'compound' WHERE has_compound_curves(a.shape) &lt;&gt; 0;   and then using ET Geotools to densify  layer by layer.  But there should be easier way of doing this straightforward in Oracle or ArcMap, and I just want to densify the features that have true arc. I don't want any unnecessary vertices on straight lines and so on.  How can I identify true arcs in ArcMap, and how can I densify them as fast and easy as possible?  Same for Oracle SQL.
How do I do Combinatorics / Counting? If someone could give answers and explain, it would be greatly appreciated. Help required studying for a final.  One hundred tickets, numbered 1,2,3,…,100, are sold to 100 different people for a drawing. Four different prizes are awarded, including a grand prize (a trip to Tahiti).   A) How many ways are there to award the prizes?  B) How many ways are there to award the prizes if the person holding ticket 47 wins the grand prize?  C) How many ways are there to award the prizes if the person holding ticket 47 wins one of the prizes?  D) How many ways are there to award the prizes if the person holding ticket 47 does not win a prize?  E) How many ways are there to award the prizes if the people holding tickets 19 and 47 both win prizes?  F) How many ways are there to award the prizes if the people holding tickets 19, 47, 73, and 97 all win prizes?  G) How many ways are there to award the prizes if none of the people holding tickets 19, 47, 73, and 97 wins a prize?  H) How many ways are there to award the prizes if the grand prize winner is a person holding ticket 18, 47, 73, or 97?  I) How many ways are there to award the prizes if the people holding tickets 19 and 47 win prizes, but the people holding tickets 73 and 97 do not win prizes? Can the Hubble constant be measured locally? Accented letters with IM FELL fonts Objective-C Blocks and variable scope (Revised) Prove that $\phi$ is a group homomorphism and find the kernel. Quoting " Let $\phi : \Bbb Z \rightarrow \Bbb Z$ be given by $\phi(n) = 7n$. Prove that $\phi$ is a group homomorphism. Find the kernel, and the image of $\phi$."   My understanding:  Part 1:   Given $n,m \in \Bbb Z$, let's check that $\phi(n+m) =\phi(n)+\phi(m)$  $$\phi(n+m) = 7(n+m) = 7n + 7m = \phi(n)+\phi(m)$$  Therefore as the group operation in $\phi$ is preserved, $\phi$ is a group homomorphism.  Part 2 (revised):   $\phi$ is one-to-one as:  $\space \space \phi (n) = \phi(m) \Rightarrow 7n =7m \Rightarrow n=m  $. We also know that $\phi(e)=e$ by the property of homomorphism. Therefore, no other object than $0$ in the domain can map to $0$ in the codomain. It follows that: $$\ker(\phi)=\{ x \in \Bbb Z : \phi(x)=e\}=\{e\}$$   Part 3 (revised):  I claim that the only possible image-elements of $\phi$ are the multiples of $7$ in $\mathbb Z$ denoted $7\mathbb Z$.   To prove this I have to show that Im$(\phi) \subset 7 \Bbb Z$ and that $ 7 \Bbb Z \subset $ Im$(\phi)$.  Proving Im$(\phi) \subset 7 \Bbb Z$ :      $\forall y \in $ Im$(\phi)$ such that $  y =\phi(x)$ where $x \in 7 \Bbb Z$. It follows that $y \in 7 \Bbb Z$, therefore Im$(\phi) \subset 7 \Bbb Z$   Proving $ 7 \Bbb Z \subset $ Im$(\phi)$:   $\forall y \in  7\Bbb Z$ such that $  y =7x$ where $x \in \phi(x)$. It follows that $y \in \phi(x)$, therefore $ 7 \Bbb Z \subset $ Im$(\phi)$.   Any input to my understanding is much appreciated. Rotating hatch labels based on orientation changes in Data Driven Pages Strip maps? I've created a strip map for a linear feature and have it loaded as a data driven page.  I want to show stationing for the line.  The stationing displays properly on the first data driven page but on each subsequent page the stationing labels get messed up as the map orientation changes. I want the stationing labels perpendicular to the linear feature as shown in the first image.  The tick marks seem to rotate and stay perpendicular to the line but the labels won't.  How can I fix this? I don't understand the fact that let's say hypothetically I was pushing a block on a frictionless surface, and I kept applying the same force on the object how it would keep accelerating! Wouldn't there have to be a certain velocity where it would stop getting faster? If not then what is actually acting on the object to cause it to accelerate infinitely? Understanding the definition of the order of an entire function in Ahlfors's Complex Analysis Let $f: \mathbb C \to \mathbb C$ be an entire function. The order of $f$ is defined by $$\lambda=\limsup_{r \to \infty} \frac{\log \log M(r)}{\log r}, $$ where $$M(r)=\max_{|z|=r} |f(z)| .$$  Ahlfors in his Complex Analysis claims that     "According to this definition $\lambda$ is the smallest number such that       $$M(r)\leq e^{r^{\lambda+\varepsilon}} $$ for any given $\varepsilon &gt; 0$ as soon as $r$ is sufficiently large."   Why is this true?  My attempt:  We know that $$\lambda=\lim_{\rho \to \infty} \sup_{r \geq \rho} \frac{\log \log M(r)}{\log r}. $$  From the definition of the limit we have that for any $\varepsilon&gt;0$, there exists some $\rho_0&gt;0$, such that $$\left\lvert \sup_{r \geq \rho} \frac{\log \log M(r)}{\log r}-\lambda \right\rvert \leq \varepsilon ,$$ for every $\rho \geq \rho_0$. In other words $$\frac{\log \log M(r)}{\log r} \leq \lambda+\varepsilon $$ for every $r \geq \rho_0$. From here it is easy to see that $$M(r)\leq e^{r^{\lambda+\varepsilon}}, $$ for all $r \geq \rho_0$. I cannot see why $\lambda$ is the smallest number with this property.  Thanks in advance. I am working on binary classification problem, I try to evaluate the performance of some classification algorithms (LR,Decission Tree , Random forest ...). I am using  a cross validation technique (to avoid over-fitting) with AUC ROC as scoring function to compare the performance of the algorithms, but I am getting a weird results with Random forest and AdbBoost, I have a perfect AUC_ROC score (i.e. =1) despite the fact that the recall(TPR) and FPR of this algorithms are different from 1 and 0 respectively .  def FPR(y_true, y_pred):     tn, fp, fn, tp = confusion_matrix(y_true, y_pred).ravel()     result = fp / (fp+tn)     return result def FNR(y_true, y_pred):     tn, fp, fn, tp = confusion_matrix(y_true, y_pred).ravel()     result = fn / (tp+fn)     return result FPR_scorer = make_scorer(FPR) FNR_scorer = make_scorer(FNR)     def get_CrossValResults2(model,cv_rst,bestIndx):     best=pd.DataFrame.from_dict(cv_rst).iloc[bestIndx]     roc=&quot;{:.12f}&quot;.format(best['mean_test_roc_auc'])     acc =&quot;{:.0%}&quot;.format(best['mean_test_accuracy'])     prec =&quot;{:.0%}&quot;.format(best['mean_test_precision'])     rec =&quot;{:.0%}&quot;.format( best['mean_test_recall'])     f1 =&quot;{:.0%}&quot;.format(best['mean_test_f1'])     r2=&quot;{:.2f}&quot;.format(best['mean_test_r2'])     g_mean=&quot;{:.2f}&quot;.format(best['mean_test_gmean'])     pr_auc=&quot;{:.8f}&quot;.format(best['mean_test_pr'])     fnr=&quot;{:.0%}&quot;.format(best['mean_test_fnr'])     fpr=&quot;{:.0%}&quot;.format(best['mean_test_fpr'])     rst = pd.DataFrame([[ model, acc,prec,rec,fpr,fnr,f1,roc,pr_auc,g_mean,r2]],columns = ['Model', 'Accuracy', 'Precision', 'Recall','FPR','FNR', 'F1-Score','ROC_auc','PR_auc','gmean','r2'])     return rst        cross_val_rst = pd.DataFrame(columns = ['Model', 'Accuracy', 'Precision', 'Recall','FPR','FNR', 'F1-Score','ROC_auc','PR_auc','gmean','r2'])              scoring = {'accuracy':'accuracy','recall':'recall','precision':'precision','fpr':FPR_scorer,'fnr':FNR_scorer,'f1':'f1' ,'roc_auc':'roc_auc','pr':'average_precision','gmean':Gmean_scorer,'r2':'r2'}     param_grid = {'n_estimators': [200],               'max_depth': [80,90],               'min_samples_leaf': [2,3, 4],             'min_samples_split': [2,5,12],             'criterion': [ 'gini'],              'class_weight' : [class_weights], 'n_jobs' : [-1]}  clf = GridSearchCV(RandomForestClassifier(class_weight=class_weights), param_grid, cv=kfold,scoring=scoring,refit=refit)#Fit the model bestmodel = clf.fit(X,Y)       cross_val_rst = cross_val_rst.append(get_CrossValResults2(model='Random Forrest',bestIndx=bestmodel.best_index_,cv_rst=bestmodel.cv_results_),ignore_index=True) Does a size large or larger creature killed by Negative Energy Flood rise as a medium sized zombie? Does the command pwd in a shell script output the directory the shell script is in? Transforming Differential Equation to a Kummer's Equation I'm trying to transform an equation of the form $$ yw^{\prime\prime}(y) - [b - ay] w^\prime(y) - [d + ey]w(y) = 0 $$ into the form of a Kummer's or confluent hypergeometric differential equation: $$ y w^{\prime\prime}(y) + [f - y] w^\prime(y) + g w(y)  = 0 $$ I know it may have something to do with merging two of the singularities of the original equation, and maybe doing something with $y$, making it $\frac{y}{b}$ and taking b to infinity, but I don't know and can't find the details for this process, and for my equation specifically. There's not too much difference between the two but just enough so that I can't get it. Thanks in advance for any help! Word for someone that always has to be right Is there a word for someone that always has to be right? The person gets angry if they are not. I have a directory where daily subdirectories are created, literally named according to $date. How can I delete folders and their contents that are older than 7 days according to the YYYYMMDD in the file name and not the metadata date? Say I have (skipped some for brevity):  20170817 20170823 20170828 20170901   I would end up with the following folders (which those should keep):  20170828 20170901   I created a variable that holds the date 7 days ago: dt_prev=$(date -d "`date`-7days" +%Y%m%d)  My thought was to ls -l a list of these folder names and compare row by row, but this involves cleaning that list, etc., and I figure there has to be an easier way. Is there a way to substitute aliases such that it is appended or prepended to an existing command in the shell?   For example, defining the alias:  alias execloc='/home/user/'   Prepending this to a command in the bash terminal:  cd exeloc/temp/somefolder   Can something like this be done, or is there a way to do it? Saving high-quality graphics through commands Is it possible to get a list of most recently installed packages? Escape velocity from long ladder Let's consider it case by case:  Case 1: Charged particle is at rest. It has an electric field around it. No problem. That is its property.  Case 2: Charged particle started moving (it's accelerating). We were told that it starts radiating EM radiation. Why? What happened to it? What made it do this?  Follow up question: Suppose a charged particle is placed in uniform electric field. It accelerates because of electric force it experiences. Then work done by the electric field should not be equal to change in its kinetic energy, right? It should be equal to change in K.E + energy it has radiated in the form of EM Waves. But then, why don't we take energy radiated into consideration when solving problems? (I'm tutoring grade 12 students. I never encountered a problem in which energy radiated is considered.) I'm working with jQuery and looking to see if there is an easy way to determine if the element has a specific CSS class associated with it.  I have the id of the element, and the CSS class that I'm looking for.  I just need to be able to, in an if statement, do a comparison based on the existence of that class on the element.