Exponentials inequality: $|e^x + e^y| \leq |x - y|$ for $x,y<0$.
$|e^a-e^b| \leq |a-b|$ for complex numbers with non-positive real parts
Difference in System. exit(0) , System.exit(-1), System.exit(1 ) in Java Why is BigDecimal returning a weird value? Padding trailing whitespaces in a string with another character I'd like to output hello world over 20 characters.  printf "%-20s :\n\n" 'hello world!!'  # Actual output hello world!!        :  # Wanted output hello world!!========:   However, I don't want to complete with spaces but with "=" instead. How do I do that? How many times can I benefit from Advantage if I attack multiple times while not seen? A hidden ranger with Extra Attack attacks a surprised creature. Do both attacks benefit from Advantage, or just the first one?  If the ranger used Horde Breaker on another creature, would this attack benefit from Advantage? I am technically knowledgeable enough to know that this most likely isn't possible, BUT, I am curious just the same (it must be put to rest). Is there anything preventing us from creating a means to use two different internet connections, like two different ethernet cards or an ethernet card and a wireless card, and using the two IP addresses at once for more internet speed?  My specific situation is that I would like to use both a wireless card and my wired connection on my machine running Kubuntu 13.10. Using two internet connections would allow me to do things like:   Torrent and browse simultaneously without lag Open Firefox with multiple tabs faster (?) Download a couple or a few large files at once double time Increase overall internet connection speed (?) Should we sign-then-encrypt, or encrypt-then-sign? How can I create a product key for my C# application? How can I create a product key for my C# Application? I need to create a product (or license) key that I update annually.  Additionally I need to create one for trial versions.  Related: Can a level 1 Warlock Cast a 4th level spell from 8th level Sorcerer with their warlock pact magic spell slots? Can my player’s multiclass Warlock 1/Sorcerer 8 cast the higher level sorcerer spells from with their warlock pact magic spell slots?  My player argued that he could now cast his 4th level sorcerer spells with his level 1 warlock  spells slots. I think he interpreted pact magic as "highest spell slot possible",  so he figures that since he has 4th level spell slots, he interprets that the warlock spell slots are 4th level slots now too. Since I upgraded to Windows 10, my system has been consuming RAM excessively    I've been reading a bit and determined it's likely a driver leaking memory. So I got myself the Windows Driver Kit and tracked memory usage with poolmon:    However, I don't really know how to proceed from here. Is the item tagged "smNp" the culprit in this issue? How do I go from there to actually identifying the driver?  I tried some stuff like "C:\Windows\System32\drivers>findstr /s smnp ." but it returned no results. I also took a look at the pooltag.txt file and this is the description I found for it:      So yeah, any help would be appreciated. Thanks in advance. Show that any set of 7 distinct integers includes two integers $x$ and $y$, such that either $x-y$ or $x+y$ is divisible by 10 Show that any set of 7 distinct integers includes two integers $x$ and $y$, such that either $x-y$ or $x+y$ is divisible by 10. I'm trying to apply the pigeonhole principle, but haven't been able to come up with a convincing argument.   Though similar to , I think the difference between the two is enough to warrant a second post. $|p(z)| \leq M$ for $|z| \leq 1$ Show that $|p(z)| \leq M|z|^n$ for $|z| \geq 1$ Let $p(z)= \sum_{k=0}^n a_k z^k$ ,  $a_n \neq 0$ , be a polynomial of degree $n$ such that $|p(z)| \leq M$ for $|z| \leq 1$.  Show that $|p(z)| \leq M|z|^n$ for $|z| \geq 1$  This was an exam question. Part (a) of this question asked the converse: if $|p(z)| \leq M|z|^n$ and $|z|$ is sufficiently large, then $p(z)$ is a polynomial. This question came straight out of Ahlfors' Complex Analysis, which I solved by showing, using the Cauchy Estimate,  $|p^n (z)|  \leq \frac{n!M|z|^k}{R^n} = 0$ as $R \to \infty$.   I would like to work backwards with this.   May I do this, or similar:   $p(z) = \frac{1}{2\pi i} \int_{c} \frac{f(\zeta)d\zeta}{\zeta-z}$  $\Rightarrow  |p(z)| \leq \frac{2\pi M|z|^n}{1(2\pi)}= M|z|^n$ Uxie and Azelf Are Not Appearing in Nameless Cavern ubi-partman failed with exit code 10 - ubuntu 18.04 I'm trying to install Ubuntu 18.04 on my laptop. After choosing the partitionn i have the following error message: grub-efi-amd64-signed package failed to install into / target/.    Then I tried to install via "try ubuntu" and i get:  ubi-partman failed with exit code 10     What should I do? How can I hide username and computer in terminal command prompt?   In Terminal it says  Last login: Mon Jan 13 00:00:14 on ttys000 Whatever:~ UserName$    Is it possible to show just the current folder and $ sign? What happens if 2 separate abilities require you to sacrifice a creature? Confused AUC ROC score 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) I used to be able to color code each folder in Finder.   I know I can use tags in Mavericks, but is there a way to restore the ability to actually color code folders?  Thanks. Square root of Positive Definite Matrix How did Harry remove the Philosopher's Stone from the Mirror of Erised? ‘How did I get the Stone out of the Mirror?’   ‘Ah, now, I’m glad you asked me that. It was one of my more brilliant ideas, and between you and me, that’s saying something. You see, only one who wanted to find the Stone – find it, but not use it – would be able to get it, otherwise they’d just see themselves making gold or drinking Elixir of Life.’   Philosopher's Stone - page 217 - Bloomsbury - chapter seventeen, The Man With Two Faces - Harry talking with Dumbledore   Dumbledore doesn't directly answer Harry's question, but rather describes under what circumstances a person could collect the Philosopher's Stone from the mirror. Did Harry have to do anything to retrieve the stone, such as reach into the mirror and take it? If not, what kind of magic could have removed the stone from the mirror and put it into Harry's possession?  A canon-based answer is preferred, such as the books, interviews with J.K. Rowling, or info from Pottermore, but subjective answers within the spirit of canon are welcome. Is there a way to log all Microsoft SQL Server queries executed on a certain server, with their respective durations?  I'd like to be able to analyze all queries will a tool like what  does for PostgreSQL. While we're at it: do you know of any such tools?