Getting JSON data from Google Maps
Getting polygon boundaries of City in JSON from Google Maps API?
What is the most secure hand cipher? By "hand cipher", I mean a symmetric cipher for which encryption and decryption can can both be performed with a pencil on graph paper, consuming about 10-20 seconds per character by a proficient user. Additional simple tools, e.g. a deck of cards or a multiplication table, may be used to expedite the process. No mathematical proficiency is required other than mental addition, subtraction, and maybe multiplication.  Basically, it should be a cipher that someone of average mathematical abilities can master, and it should require no digital technology or cryptographic tools that cannot be constructed out of paper.  For example, four-square in CBC mode seems secure to me because CBC is a well established mode of operation and four-square seems to be a good block cipher as it accommodates large keys and seems to produce a random-looking output. However, the fact that four-square in CBC was never widely adopted before digital encryption became a consumer technology leads me to believe that someone broke the cipher and thus discouraged people from using it.  So is there any hand cipher that the best supercomputers would take years to cryptanalyze? If not, then for which hand cipher is the best known attack the most complex? Title of short story: God granting immortality to others to find a way to kill himself Canonical vs. non-canonical terminal input Integrating Factor Method. Why Can We Set the Constant of Integration to Zero? My textbook gives a demonstration of the use of the integrating factor method for solving first order ordinary differential equations:  $\dfrac{dx}{dt} + p(t)x = r(t)$  $\implies g(t)\dfrac{dx}{dt} + g(t)p(t)x = g(t)r(t)$  $\dfrac{d}{dt}[g(t)x]$  We use the product rule and compare the expression to the left-hand side of the above equation:  $g(t)\dfrac{dx}{dt} + \dfrac{dg}{dt}x = g(t)\dfrac{dx}{dt}+g(t)p(t)x$  $\therefore \dfrac{dg}{dt} = g(t)p(t)$  The above equation is separable.  $\therefore \int\dfrac{dg}{g(t)} = \int p(t) dt$  $\implies ln[g(t)] = \int p(t)dt$  My textbook then says that, "We can set the constant of integration to zero -- any function that satisfies $\dfrac{dg}{dt} = g(t)p(t)$ will do for our purposes". However, it gives no explanation as to why this is the case. Why can we set the constant of integration to zero? Why is any function that satisfied $\dfrac{dg}{dt} = g(t)p(t)$ appropriate for our purposes?  I would greatly appreciate it if people could please take the time to elaborate on this. High CPU usage by "System" and "System interrupts" (caused by ACPI.sys) I have a laptop, which was running Windows 8.1 x64 without any problems. Now with Windows 10 x64 installed, Task Manager constantly shows unusual CPU usage by "System" and "System interrupts". To solve this, I already tried the following, without success:   Disabling and uninstalling all non-essential drivers. Installing newer drivers than the ones that were automagically installed (if available). Disabling/enabling fast boot option. Disabling all of the non-essential services. Sysprep. Resetting BIOS to defaults and various combinations of settings. Flashing BIOS to the latest available version. Clean install from the same media that I use for other PCs. Installing all of the updates offered in Windows Update to this day. Windows Performance Recorder / Analyzer.   I'm not very familiar with Windows Performance Analyzer, so I'm hoping someone here can point me in the right direction - what exactly should I look for, to figure out which device/driver is the culprit. Or, if there's any other approach to figuring out this problem?  For the brave souls, here's my  and a screenshot of the problem: Examples of Bayesian and frequentist approach giving different answers Note: I am aware of  differences between Bayesian and frequentist statistics. For example &quot;what is the probability that the coin on the table is heads&quot; doesn't make sense in frequentist statistics, since it has either already landed heads or tails -- there is nothing probabilistic about it. So the question has no answer in frequentist terms. But such a difference is specifically not the kind of difference I'm asking about. Rather, I would like to know how their predictions for well-formed questions actually differ in the real world, excluding any theoretical/philosophical differences such as the example I mentioned above. So in other words: What's an example of a question, answerable in both frequentist and Bayesian statistics, whose answer is different between the two? (e.g. Perhaps one of them answers &quot;1/2&quot; to a particular question, and the other answers &quot;2/3&quot;.) Are there any such differences?  If so, what are some examples?  If not, then when does it actually ever make a difference whether I use Bayesian or frequentist statistics when solving a particular problem? Why would I avoid one in favor of the other? Every Finite Group is Isomorphic to a Subgroup of $A_n$ Human vs. alien to avoid extinction by omnipotent being Where can I find the teleport? I need to get the chocolate bars in the hole, but I can't get out of there. Where can I find the pogo stick or teleport? Do I have to clear customs when transit via the US on my way to / coming from somewehere else? I shall arrive at Washington Dulles Airport (IAD) by Emirates flight to catch a united airlines flight to Detroit after 3.5 hours. What steps shall I have to go through? Is the connection time enough? I have US F1 visa. get value part of specific word in AIX want to search string and need part of string  file.txt:  CREATE MULTISET TABLE $$ENV$$_TEMP_ESM.EMPASGMTAMPTMPRTRSE, NO FALLBACK ,      NO BEFORE JOURNAL,      NO AFTER JOURNAL,      CHECKSUM = DEFAULT,      DEFAULT MERGEBLOCKADSRATIO   while using below sed command getting extra value  Output:   bash-4.3$ sed -n 's/.*$$ENV$$_//p' file.txt  **TEMP_ESM.EMPASGMTAMPTMPRTRSE** ,NO FALLBACK ,   I need only TEMP_ESM.EMPASGMTAMPTMPRTRSE I am trying to use squared loss to do binary classification on a toy data set. I am using mtcars data set, use mile per gallon and weight to predict transmission type. The plot below shows the two types of transmission type data in different colors, and decision boundary generated by different loss function. The squared loss is $\sum_i (y_i-p_i)^2$ where $y_i$ is the ground truth label (0 or 1) and $p_i$ is the predicted probability $p_i=\text{Logit}^{-1}(\beta^Tx_i)$. In other words, I am replace logistic loss with squared loss in classification setting, other parts are the same. For a toy example with mtcars data, in many cases, I got a model &quot;similar&quot; to logistic regression (see following figure, with random seed 0).  But in somethings (if we do set.seed(1)), squared loss seems not working well.  What is happening here? The optimization does not converge? Logistic loss is easier to optimize comparing to squared loss? Any help would be appreciated.  Code d=mtcars[,c(&quot;am&quot;,&quot;mpg&quot;,&quot;wt&quot;)] plot(d$mpg,d$wt,col=factor(d$am)) lg_fit=glm(am~.,d, family = binomial()) abline(-lg_fit$coefficients[1]/lg_fit$coefficients[3],        -lg_fit$coefficients[2]/lg_fit$coefficients[3]) grid()  # sq loss lossSqOnBinary&lt;-function(x,y,w){   p=plogis(x %*% w)   return(sum((y-p)^2)) }  # this random seed is important for reproducing the problem set.seed(0)  x0=runif(3) x=as.matrix(cbind(1,d[,2:3])) y=d$am opt=optim(x0, lossSqOnBinary, method=&quot;BFGS&quot;, x=x,y=y)  abline(-opt$par[1]/opt$par[3],        -opt$par[2]/opt$par[3], lty=2) legend(25,5,c(&quot;logisitc loss&quot;,&quot;squared loss&quot;), lty=c(1,2)) How can I acknowledge, thank, or otherwise approve of an edit? Possible Duplicate:    Sometimes I get an edit that greatly improves a question or answer I have submitted.  I'd like to acknowledge an edit like this, so that readers can know that the revision was approved of by the OP (me!). I was thinking of comments on edit, or a checkbox noting that OP vouches for the edit.  Sometimes I would like to add a comment to the question or answer, but those don't make a lot of sense in that context. Any suggestions about the best way to do this?  Consider this a feature request, as it seems useful to know that a particular edit was endorsed/vetted by the OP. How to compile .c file with OpenSSL includes? So assume $Y$ and $X$ are exponentially distributed with parameters $y_1$, and $x_1$ respecitively.  assume c is a constant.  I am having huge trouble to understand the integration of the following expression.  $P(Y&lt;c/u(X))$  $=\int_{t}^{\infty}f_X(x)\int_{0}^{c/u(x)}f_Y(y)dydx +\int_{0}^{t}f_X(x)\int_{c/u(x)}^{\infty}f_Y(y)dydx$  where t is the cross-point that $u(x)$ change sign    here $c/u(x)$ is given by the plot below, t is the point crossing the zero:   Confusion:   I don't understand the second integration of the second term "$\int_{c/u(x)}^{\infty}f_Y(y)dydx$", this isn't right because Y an X only defined for y>0, and x>0. So it's the first quadrant in this plot. After updating MiKTeX graphics package on 10/5/19 to version 1.3b (packaged on 10/4/2019 8:11:27 PM), I am unable to compile LaTex files that contain \includegraphics{}.  My system: Windows 10  with MiKTeX 2.9.7200  A minimum working example:  \documentclass{article} \usepackage{graphics}  \begin{document}  \begin{figure}    \includegraphics{MC_Antenna_Gain} \end{figure}  \end{document}   The error report   This is pdfTeX, Version 3.14159265-2.6-1.40.20 (MiKTeX 2.9.7200) entering extended mode (C:/Users/nicrog/Dropbox/T_P_2/Scholar/Grants/Written/EWU_20/Test.tex LaTeX2e &lt;2018-12-01&gt; ("C:\Program Files (x86)\MiKTeX 2.9\tex/latex/base\article.cls" Document Class: article 2019/08/27 v1.4j Standard LaTeX document class ("C:\Program Files (x86)\MiKTeX 2.9\tex/latex/base\size10.clo")) ("C:\Program Files (x86)\MiKTeX 2.9\tex/latex/graphics\graphics.sty" ("C:\Program Files (x86)\MiKTeX 2.9\tex/latex/graphics\trig.sty") ("C:\Program Files (x86)\MiKTeX 2.9\tex/latex/graphics-cfg\graphics.cfg") ("C:\Program Files (x86)\MiKTeX 2.9\tex/latex/graphics-def\pdftex.def")) No file Test.aux. ("C:\Program Files (x86)\MiKTeX 2.9\tex/context/base/mkii\supp-pdf.mkii" [Loading MPS to PDF converter (version 2006.09.02).] ) ("C:\Program Files (x86)\MiKTeX 2.9\tex/latex/oberdiek\epstopdf-base.sty" ("C:\Program Files (x86)\MiKTeX 2.9\tex/generic/oberdiek\infwarerr.sty") ("C:\Program Files (x86)\MiKTeX 2.9\tex/latex/oberdiek\grfext.sty" ("C:\Program Files (x86)\MiKTeX 2.9\tex/generic/oberdiek\kvdefinekeys.sty" ("C:\Program Files (x86)\MiKTeX 2.9\tex/generic/oberdiek\ltxcmds.sty"))) ("C:\Program Files (x86)\MiKTeX 2.9\tex/latex/oberdiek\kvoptions.sty" ("C:\Program Files (x86)\MiKTeX 2.9\tex/latex/graphics\keyval.sty") ("C:\Program Files (x86)\MiKTeX 2.9\tex/generic/oberdiek\kvsetkeys.sty" ("C:\Program Files (x86)\MiKTeX 2.9\tex/generic/oberdiek\etexcmds.sty" ("C:\Program Files (x86)\MiKTeX 2.9\tex/generic/oberdiek\ifluatex.sty")))) ("C:\Program Files (x86)\MiKTeX 2.9\tex/generic/oberdiek\pdftexcmds.sty" ("C:\Program Files (x86)\MiKTeX 2.9\tex/generic/oberdiek\ifpdf.sty"))) ! Undefined control sequence. \Ginclude@graphics ...\Ginput@path \set@curr@file                                                    {#1}\edef \uq@curr@file {\... l.8    \includegraphics{MC_Antenna_Gain}  ?    I will report this potential bug to  as well. How does a Windows antivirus hook into the file access process? So I can start from len(collection) and end in collection[0].  I also want to be able to access the loop index. I just want to know if my proof to this question is correct. First, I proved it was true for $n = 4$. $$4!&gt;2^4$$ $$24&gt;16$$ Then, I assumed that it was true for $n=k$. $$k!&gt;2^k$$ Afterwards, I tried to prove it for $n=k+1$. $$(k+1)!&gt;2^{k+1}$$ $$(k+1)k!&gt;(2)(2^k)$$ Since $k!&gt;2^k$, am I allowed to simply do $$(k+1)(2^k)&gt;(2)(2^k)$$ $$(k+1)&gt;2$$ and this is true for all $k\geq3$. Would the last two steps be illegal because I only assumed that $k!&gt;2^k$ is true? Using Apex Managed Sharing to share an opportunity Here's the use case. When a lead is converted to an Opportunity, I want to automatically share the opportunity with the previous owner of the lead. This is needed because upon conversion, the opportunity ownership is granted to someone else but the original lead owner needs ongoing access to the opportunity.  So:   A partner submits/creates a lead and is the lead owner Lead is converted to opportunity and internal sales person gains ownership Original partner needs to have view/edit access on this opportunity   I know you can use Apex Managed Sharing to share a custom object, but I'm hitting a wall trying to do this with an opportunity since the fields in OpportunityShare are not writable. The following won't even compile as a result:  List&lt;OpportunityShare&gt; oppShares = new List&lt;OpportunityShare&gt;(); for(Id i : oppIds) {    OpportunityShare os = new OpportunityShare(OpportunityId = i);    os.OpportunityId = i; // *** ERROR - not writable ***    os.OpportunityAccessLevel = 'Read/Write';    os.UserOrGroupId = oppIdToLead.get(i).OwnerId;    os.RowCause = 'Manual Sharing';    oppShares.add(os); }  Database.SaveResult[] result = Database.insert(oppShares, false);