Wake On LAN (WOL) through router?
WOL - Wake On Lan over internet
Does potential energy in gravitationall field increase mass? Someone has asked for answer to these topics. However, I still want someone to provide me with simple and universal answers. I recently read a sentence from the English-speaking person. It is in an article. It is, ' The available options for mitigating pad cratering are not universally effective (see link below), but they may be helpful on a case by case basis until more crack resistant laminates are developed and become available.  '  If I am to write this, I will use 'a case-by-case basis until more crack-resistant laminates'   Can anyone tell me when to use a hyphen to coin a new word? Prove $(a+b)^\frac{1}{n} \le a^\frac{1}{n} + b^\frac{1}{n}$ Prove: $$ (a+b)^\frac{1}{n} \le a^\frac{1}{n} + b^\frac{1}{n}, \qquad \forall n \in \mathbb{N} $$ I have have tried using the triangle inequlity $ |a + b| \le |a| + |b| $,  without any success. I opened Cairo-dock in my terminal with: open cairo-dock and that worked but if I close the terminal it goes with it. How can I keep it open regardless of the terminal? Title says it all I looked for a proof on this site but couldn't find one.  Prove if $f$ is analytic on $D$ and $g$ is analytic on $\Omega$ containing the range of $f$ show $g(f(z))$ is analytic.  The statement seems obvious but I can't seem to be able to prove it. Can I run an HTTP GET directly in SQL under MySQL? I'd love to do this:  UPDATE table SET blobCol = HTTPGET(urlCol) WHERE whatever LIMIT n;   Is there code available to do this? I known this should be possible as the  include an example of adding a function that does a DNS lookup.  MySQL / windows / Preferably without having to compile stuff, but I can.  (If you haven't heard of anything like this but you would expect that you would have if it did exist, A "proly not" would be nice.)  EDIT: I known this would open a whole can-o-worms re security, however in my cases, the only access to the DB is via the mysql console app. Its is not a world accessible system. It is not a web back end. It is only a local data logging system Mean and variance of inverse of a normal RV My random variable $X$ is normally distributed with mean $b$ and variance $p$. I defined a new RV, $Y$, such that $Y=1/X$. Does anyone know how to find the mean of $Y$ and $Y^2$? Why is $A^TA$ invertible if $A$ has independent columns? How can I understand that $A^TA$ is invertible if $A$ has independent columns? I found a similar , phrased the other way around, so I tried to use the theorem  $$ rank(A^TA) \le min(rank(A^T),rank(A)) $$  Given $rank(A) = rank(A^T) = n$ and $A^TA$ produces an $n\times n$ matrix, I can't seem to prove that $rank(A^TA)$ is actually $n$.  I also tried to look at the question another way with the matrices  $$ A^TA = \begin{bmatrix}a_1^T \\ a_2^T \\ \ldots \\ a_n^T \end{bmatrix}   \begin{bmatrix}a_1 a_2 \ldots a_n \end{bmatrix} = \begin{bmatrix}A^Ta_1 A^Ta^2 \ldots A^Ta_n\end{bmatrix} $$  But I still can't seem to show that $A^TA$ is invertible. So, how should I get a better understanding of why $A^TA$ is invertible if $A$ has independent columns? Difference between logit and probit models 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) Tried to install both Windows and Ubuntu, now neither will boot Hardware:  I've got an SSD (c),an internal HDD (d), an external HDD (e) and a USB flash drive (f).   How this all went down:   I downloaded Ubuntu and used a program to install it on my (F) drive. I reset my computer, ran the (F) drive for boot, and installed Ubuntu. I reset my computer, and it forcibly automatically booted into Windows 10 instead of Ubuntu. I went into Windows 10, and used a program called Easy BCD, by NeoSmart. I followed their guide, but after step 6, it wasn't the same for me. Their guide said that upon rebooting, I should see a grub screen that lets me choose between Windows/Linux and a few other options, however my computer would only boot into Windows 10.  I decided to follow the rest of the guide regardless, however by the end it would let me boot 'windows' or 'linux', but the linux option would always break. It went to a screen with lots of commands, that I thought -may- be a barebones Linux or something, but it definitely wasn't Ubuntu.  I decided to reinstall Ubuntu using the USB flash drive. Upon resetting, no matter what hard drive or format I select for booting (besides the F drive), it says An operating system wasn't found. Try disconnecting any drives that don't contain an operating system. I can boot the F drive and run Ubuntu, but it's a one time version that doesn't save any of my data. When I went into the installation, it still says that I already have Ubuntu installed on the 4TB HDD and that I have Windows 10 installed on the SSD, however I cannot seem to boot into either of them.   TLDR: Windows 10/Ubuntu are both installed, Windows on the internal SSD and Ubuntu on the external HDD. Ubuntu's installation program on the (F) drive recognizes them, however, when I try to boot anything it says An operating system wasn't found.   When I press F11 and force it to boot from the SSD it says:  error: no such device: 83b6c64d-9a2c0467b-a02c-6374ee6ac3dc.  error: unknown filesystem. Entering rescue mode. . .  grub rescue&gt; _   and it will allow me to type some commands. I've known that one can arrange all the numbers from $1$ to $\color{red}{15}$ in a row such that the sum of every two adjacent numbers is a perfect square. $$8,1,15,10,6,3,13,12,4,5,11,14,2,7,9$$ Also, a few days ago, a friend of mine taught me that one can arrange all the numbers from $1$ to $\color{red}{305}$ in a row such that the sum of every two adjacent numbers is a perfect cube. $$256,87,129, 214, 298, 45, 171, 172, 44, 299, 213, 130, 86, 257, 255,$$ $$88, 128, 215, 297, 46, 170, 173, 43, 300, 212, 131, 85, 258, 254, 89, 127, 216, 296,$$ $$ 47, 169, 174, 42, 301, 211, 132, 84, 259, 253, 90, 126, 217, 295, 48, 168, 175, 41, 302, $$ $$210, 133, 83, 260, 252, 91, 125, 218, 294, 49, 167, 176, 40, 303, 209, 134, 82, 261, 251,$$ $$ 92, 33, 183, 160, 56, 287, 225, 118, 98, 245, 267, 76, 140, 203, 13, 14, 202, 141, 75, 268,$$ $$ 244, 99, 26, 190, 153, 63, 280, 232, 111, 105, 238, 274, 69, 147, 196, 20, 7, 1, 124, 219,$$ $$ 293, 50, 166, 177, 39, 304, 208, 135, 81, 262, 250, 93, 32, 184, 159, 57, 286, 226, 117, 8,$$ $$ 19, 197, 146, 70, 273, 239, 104, 112, 231, 281, 62, 154, 189, 27, 37, 179, 164, 52, 291, 221,$$ $$ 122, 3, 5, 22, 194, 149, 67, 276, 236, 107, 109, 234, 278, 65, 151, 192, 24, 101, 242, 270,$$ $$ 73, 143, 200, 16, 11, 205, 138, 78, 265, 247, 96, 120, 223, 289, 54, 162, 181, 35, 29, 187,$$ $$156, 60, 283, 229, 114, 102, 241, 271, 72, 144, 199, 17, 108, 235, 277, 66, 150, 193, 23,$$ $$ 4, 121, 222, 290, 53, 163, 180, 36, 28, 188, 155, 61, 282, 230, 113, 103, 240, 272, 71, 145,$$ $$ 198, 18, 9, 116, 227, 285, 58, 158, 185, 31, 94, 249, 263, 80, 136, 207, 305, 38, 178, 165,$$ $$ 51, 292, 220, 123, 2, 6, 21, 195, 148, 68, 275, 237, 106, 110, 233, 279, 64, 152, 191, 25,$$ $$100, 243, 269, 74, 142, 201, 15, 12, 204, 139, 77, 266, 246, 97, 119, 224, 288, 55, 161,$$ $$ 182, 34, 30, 186, 157, 59, 284, 228, 115, 10, 206, 137, 79, 264, 248, 95$$ Here, I have a question.  Question : Does there exist at least one positive integer $n\ge 2$ satisfying the following condition for each $N\ge 2\in\mathbb N$? Condition : One can arrange all the numbers from $1$ to $n$ in a row such that the sum of every two adjacent numbers is of the form $m^N$ for some $m\in\mathbb N$.  Added : I crossposted to . How to prevent the paragraphs to spread out over the page? I have a problem. I have several large equations within the text. And when LaTeX does not manage to put the equation on the same page and moves it to the next one, he spreads the paragraphs of the text in the first page. How could I prevent this? I know about \pagebreak and \newpage, but I do not want to force the \newpage, as the text may move (if I add something later or so on) and the pagebreaks may not be valid. I would like to make LaTeX not to spread the paragraphs over a page automatically. Is it possible?  I tried to make an example:  \documentclass[a4paper,12pt,twoside]{book} \usepackage{amsmath} \begin{document}  LaLaLa\\\  LaLaLa\\\  LaLaLa\\\  LaLaLa\\\  \begin{eqnarray} 123&amp;+&amp;123 \\\ 123&amp;+&amp;123 \nonumber\\\ 123&amp;+&amp;123 \nonumber\\\ 123&amp;+&amp;123 \nonumber\\\ 123&amp;+&amp;123 \nonumber\\\ \end{eqnarray}  LaLaLa\\\  LaLaLa\\\  \begin{eqnarray} 123&amp;+&amp;123 \\\ 123&amp;+&amp;123 \nonumber\\\ 123&amp;+&amp;123 \nonumber\\\ 123&amp;+&amp;123 \nonumber\\\ 123&amp;+&amp;123 \nonumber\\\ 123&amp;+&amp;123 \nonumber\\\ 123&amp;+&amp;123 \nonumber\\\ 123&amp;+&amp;123 \nonumber\\\ 123&amp;+&amp;123 \nonumber\\\ 123&amp;+&amp;123 \nonumber\\\ 123&amp;+&amp;123 \nonumber\\\ 123&amp;+&amp;123 \nonumber\\\ 123&amp;+&amp;123 \nonumber\\\ 123&amp;+&amp;123 \nonumber\\\ 123&amp;+&amp;123 \nonumber\\\ \end{eqnarray}  \end{document} The  (ESC), states that for every natural number $n \geq 2$, there exists a set of natural numbers $a, b, c$ , such that the following equation is satisfied:  $$\frac{4}{n}=\frac{1}{a}+\frac{1}{b}+\frac{1}{c}\tag{1}$$  The basic approach to solving this problem outlined by Mordell [Ref1] is described below  By defining $t$ and $m$ as positive integers greater than zero and $q$ a positive integer greater than one we can observe that  a) There is always a solution for even $n$, since if $n=2^qt$ we have the trivial solution $$\frac{4}{4t}=\frac{1}{t}$$  In the remaining case $n=2(2t+1)$, a solution in the form of two Egyptian fractions can always be found  e.g. $$\frac{4}{2(2t+1)}=\frac{2}{2t+1}=\frac{1}{t+1}+\frac{1}{(t+1)(2t+1)}$$  b) If $(1)$ is a solution for some particular prime $n$ then all composite numbers $mn$ divisible by $n$ are also solutions, thus  $$\frac{4}{mn}=\frac{1}{ma}+\frac{1}{mb}+\frac{1}{mc}$$  will also be a solution. This means that we can simplify the analysis to the cases where $n$ is a prime greater than 2.  Using Mordell's approach we have just shown that we only need to consider the cases where $n$ is prime and where $n \equiv 1 \pmod{2} \;\;[meaning \;\;n=2t+1]$  The argument continues...  Mordell goes on to show in turn that the search can be reduced further to the cases when $$n \equiv 1 \pmod{4} \;\;[meaning \;numbers \;\;n=4t+1]$$ $$n \equiv 1 \pmod{8} \;\;[meaning \;numbers \;\;n=8t+1]$$ $$n \equiv 1 \pmod{3} \;\;[meaning \;numbers \;\;n=3t+1]$$ $$n \equiv 1,2,4 \pmod{7} \;\;[meaning \;numbers \;\;n=7t+1,n=7t+2 \;or\;n=7t+4 ]$$ $$n \equiv 1,4 \pmod{5}  \;\;[meaning \;numbers \;\; n=5t+1 \;or\;n=5t+4]$$  Assembling these results together, Mordell showed that the conjecture can be proved in this context except for the cases when $$n \equiv 1,11^2,13^2,17^2,19^2,23^2 \pmod{840}$$  Mordell stated that since the first prime meeting this condition is 1009, this is proof that the conjecture holds for $n&lt;1009$.  This basic approach can be pursued further. Other workers have shown that the conjecture holds for much higher values of $n$ using similar methods as can be seen on the above Wikipedia page.   Note that other intermediate results can be constructed from the above congruence's, e.g. $n \equiv 1 \pmod{24}$.  The question is:  Are there any other elementary approaches to solving this problem than the one outlined by Mordell (and described above)?  [Ref1] Louis J. Mordell (1969) Diophantine Equations, Academic Press, London, pp. 287-290. I have an older iPod touch which which supports up to iOS 6.1.6 and nothing newer.  This device is equipped with a Linea Pro barcode scanner and previously had an application called "" installed.  Recently I was attempting to do some work on a web application I wrote and realized that I needed to update to a newer version of Web Barcode - but unfortunately the Apple ID saved on my device was deactivated a few years ago.  So I went to settings and updated it with my current Apple ID.  Then again tried to update the App from the Apple store.  Still no dice - it was asking me for the password on the old account.  So then I figured I'd just remove it and reinstall from scratch.  Deleted the app and went to the store but now I am met with a message that the new version requires at least iOS 8.0.  I feel I followed a very logical series of steps to update this application and while I can understand that I won't be able to install the newest version, how can I get the old version back?  The device is completely useless without the barcode scanning application and the Apple store is now refusing to install any version at all on my device.  What can I do to get the original version of this application reinstalled? I bought my kids a PC and installed 12.04 (Unity) on it.  The bottom line is, I want my children to use the computer unsupervised while I have confidence they cannot access anything inappropriate.  What I have looked at:  I was looking at Scrubit a tool which allows me configure my wifi router to block content and this solution would also protect my other PC and mobile devices.  This may be overkill as I just want the solution to work on one PC.    I also did some Google searches and came across the application called .  My experience of OSS is that the best solutions frequently never appear first on a Google search list and in this case I need to trust the methods therefore my question is very specific.   I want to leverage your knowledge and experience to understand What is the best way to restrict adult content on 12.04 LTS as this is important to me.  It maybe a combination of things so please don't answer this question "try this or that", then give me some PPA unless you can share your experience of how good it is and of course if there are any constraints. Altium - create a mirror image of a board I want to create an identical motor drive board in the right and left sides.  I just finished layout for the right side and I am wondering what is the easiest way to create the mirror image of this board for the left side?  For example: the connectors on the "top" side would now be on the bottom of the other board.  All components and tracks will also switch sides, layer stack will be inverted, etc.  Is there any command sequence in Altium that will do this without me having to manually re-assign everything to the other layer? Create a local texmf tree in MiKTeX In TeX Live there are TEXMFLOCAL for admin and TEXMFHOME for user pre-defined, but in MiKTeX there’s by default no local texmf tree installed, though it is useful, cf. . Therefore my question:  How do I create a local texmf tree in MiKTeX? What does 'synchronized' mean? Waiting for a file to be created in C#