Apache + External IP from LAN + random image = nothing
How to connect to my web server?
How to lead a moving target from a moving shooter I saw this question: .  My situation is a little different though.   My target moves, and the shooter moves.  Also, the shooter's velocity is added to the bullets' velocities, i.e. bullets fired while sliding to the right will have a greater velocity toward the right.   What I'm trying to do is to get the enemy to be able to determine where they need to shoot in order to hit the player.  Using the linked SO solution, unless the player and enemy are stationary, the velocity difference will cause a miss.  How can I prevent that?      Here is the solution presented from the stack overflow answer.  It boils down to solving a quadratic equation of the form:  a * sqr(x) + b * x + c == 0   Note that by sqr I mean square, as opposed to square root. Use the following values:  a := sqr(target.velocityX) + sqr(target.velocityY) - sqr(projectile_speed) b := 2 * (target.velocityX * (target.startX - cannon.X)       + target.velocityY * (target.startY - cannon.Y)) c := sqr(target.startX - cannon.X) + sqr(target.startY - cannon.Y)   Now we can look at the discriminant to determine if we have a possible solution.  disc := sqr(b) - 4 * a * c   If the discriminant is less than 0, forget about hitting your target -- your projectile can never get there in time. Otherwise, look at two candidate solutions:  t1 := (-b + sqrt(disc)) / (2 * a) t2 := (-b - sqrt(disc)) / (2 * a)   Note that if disc == 0 then t1 and t2 are equal. how to get the original entity on hook_entity_presave? i actually need it for the content_moderation_state entity   function hook_entity_presave(Drupal\Core\Entity\EntityInterface $entity) { if ($entity-&gt;getEntityTypeId() !== 'content_moderation_state' ) {     return; }     $moderation_state = $entity-&gt;get('moderation_state')-&gt;getString();   //code to get the original entity moderation state I would like to typeset the top part of Pascal's triangle. To get the triangle with the names of the binomial coefficients, i.e., {n \choose k}, I used the following code  \begin{tikzpicture} \foreach \n in {0,...,4} {   \foreach \k in {0,...,\n} {     \node at (\k-\n/2,-\n) {${\n \choose \k}$};   } } \end{tikzpicture}   The result is this   Now I want to be equally lazy and do something like this for the values of the binomial coefficients, i.e., replace {\n \choose \k} in the node label with \CalculateBinomialCoefficient{\n}{\k} where \CalculateBinomialCoefficient is a hypothetical macro that calculates the binomial coefficient. Has anyone done something like that?  The result should look like this: Lagrange Multipler KKT condition I am looking at SVM, and reviewing Lagrange multiplier. Let's say with the constraint function $$g(x,y) = x^2 + y^2 -1 &gt; 0, $$ I am maximizing $$f(x,y) = x + y -1 .$$ Intuitively, since the constraint function does not provide a finite constrained region, there is no solution, and $f(x,y)$ can infinitely increase.  However, if I just plainly proceed with Lagrange multiplier calculation,  $$L(x,\lambda) = (x + y -1) +\lambda(x^2 + y^2 -1)$$ I get the solution: $$y,x = -\sqrt{2}/2, \lambda = 1/\sqrt{2}$$ And this still satisfies KKT conditions although the solution is wrong.  $$g(x) =&gt; 0 , \lambda =&gt;      0, \lambda g(x) = 0.$$  I expected that I would have some result that conflicted KKT conditions, but nothing was violated.   Does this mean that Lagrange multiplier under KKT conditions can produce a solution that cannot be solved, without giving any indication of intractability?  If functions are complicated, what's the systematic way to confirm that the optimization with inequality constraint functions is solvable using Lagrange multiplier? How frequently can you ask for a personal reference without being disrespectful? Turn off automatic preview in apple mail Is it possible to turn off automatic preview of attachments when composing an e-mail?  NOTE: Yes I know that I can manually ctr+select the attachment and disable preview, but I want this done automatically What is the variance of the weighted mixture of two gaussians? Say I have two normal distributions A and B with means $\mu_A$ and $\mu_B$ and variances $\sigma_A$ and $\sigma_B$. I want to take a weighted mixture of these two distributions using weights $p$ and $q$ where $0\le p \le 1$ and $q = 1-p$. I know that the mean of this mixture would be $\mu_{AB} = (p\times\mu_A) + (q\times\mu_B)$.  What would the variance be?    A concrete example would be if I knew the parameters for the distribution of male and female height. If I had a room of people that was 60% male, I could produce the expected mean height for the whole room, but what about the variance? Why is 8 so special? I have been reading about multi-dimensional numbers, and found out that it's been proven that the Octonions are the composition algebra of the largest dimension. I was wondering why, despite having infinitely many different dimensions of numbers, the only composition algebras are of 1, 2, 4, and 8 dimensions. What's so special about 8? Novel about alien conquerers who conduct games to select servants I read this maybe 10-15 years ago.   Aliens have conquered earth. Possibly quite some time before the time then novel is set in. They have built their own cities. They conduct periodic athletic competitions for humans similar to the current olympics. The winners are take into the city to act as servants to the masters. The protagonist is part of a human resistance movement who is competing in the games. The plan is to infiltrate the city, gather intel and escape. He wins, get in, finally has to kill his master and escape down a waste disposal system which ends up outside the city.   Anybody knows which one I am talking about? LED light needs replacing every few weeks I have two GU5.3 bulbs in my bathroom - one of them went off a month or so ago so I bought the following 3 pack:   I've gone through 2 of the new bulbs in the space of weeks. I have never seen the bulbs fade out while being on, it's only when we turn the light switch on that they don't come back on (like this morning, I was first in the bathroom and the bulb was off again). No fuses blown or any indication of tripping.  How should I approach this? SQL query to convert columns into rows How to create immutable objects in Java? Dynamically set value of a file input General solution of expected value of E(f(X))? This is maybe a trivial question I came up while solving a few examples and understanding Markov/Chebyshev inequalities and subsequently in evaluating Chernoff bounds. Suppose $X$ is a random variable with some distribution $p$ and we need to evaluate $\mathbb{E}[f(X)]$. Here, $f(X)$ may or may not have the same distribution as $X$. In my case, if $f(X) = e^{sX}$, where $s&gt;0$. I would work out this problem by letting $Z = e^{sX}$ and   $\mathbb{E}[f(X)] = \mathbb{E}[Z] = \int_{\infty}^{\infty}z \hspace{0.2em}p(z)dz$.   Now I find the distribution of $Z$ as: $P\{ Z \leq z \} \implies P\{ e^{sX} \leq z \} \implies P\{ X \leq \frac{\log(z)}{s}\} = \int_{-\infty}^{\frac{\log(z)}{s}}x.p(x)dx $  thereby substituting this into the expectation one gets $\mathbb{E}[Z] = \int_{\infty}^{\infty}z\hspace{0.2em} \left(\int_{-\infty}^{\frac{\log(z)}{s}}x\hspace{0.2em}p(x)dx\right)^{\prime} dz$  According to the Law of Unconscious Statistician , this approximates distribution of $Z$ as $p$. I understand the backward proof through calculus, I don't follow the measure theory approach. For example I don't follow how this works if say $X \sim Gamma$. Is there a source I can read through for someone with no measure theory background? How do I prevent Apache from answering requests for domains I don't host? The reference to entity "foo" must end with the ';' delimiter In the paper "Beautiful Code Compelling Evidence", by J.R. Heard -- Code is formated in a particular way which includes margin comments. I am looking for a way to do this as I think it is a very clear way to comment comment code in a literate programming style. What is the memory layout of a .NET array?  Take for instance this array:  Int32[] x = new Int32[10];   I understand that the bulk of the array is like this:  0000111122223333444455556666777788889999   Where each character is one byte, and the digits corresponds to indices into the array.  Additionally, I know that there is a type reference, and a syncblock-index for all objects, so the above can be adjusted to this:  ttttssss0000111122223333444455556666777788889999         ^         +- object reference points here   Additionally, the length of the array needs to be stored, so perhaps this is more correct:  ttttssssllll0000111122223333444455556666777788889999         ^         +- object reference points here   Is this complete? Are there more data in an array?  The reason I'm asking is that we're trying to estimate how much memory a couple of different in-memory representations of a rather large data corpus will take and the size of the arrays varies quite a bit, so the overhead might have a large impact in one solution, but perhaps not so much in the other.  So basically, for an array, how much overhead is there, that is basically my question.  And before the arrays are bad squad wakes up, this part of the solution is a static build-once-reference-often type of thing so using growable lists is not necessary here. It's using Euclidian inverse. Can you show it step by step?   $$N=7, q=11, a = 3+2X^2 -3X^4 +X^6$$  the inverse of $a \pmod {11}$ is  $$A=-2+4X+2X^2 +4X^3 -4X^4 +2X^5 -2X^6$$  How do we compute $A$? Select from list of reasons when performing downvotes