Geoserver web admin page language
The answer from lhf has already dealt with the second question posed here. Here is a Wikipedia article about it.
Here's a probabilistic approach to the first question. When you toss a coin $n$ times, the probability that a "head" appears exactly $k$ times is $\dbinom n k (1/2)^n$. The average number of times a "head" appears is therefore $$ \left( \binom n 0 \cdot 0 + \binom n 1 \cdot 1 + \binom n 2 \cdot 2 + \cdots + \binom n k \cdot k + \cdots + \binom n n \cdot n \right) \left(\frac 1 2 \right)^n. $$ But the average number of times a "head" appears is obviously $n/2$. Therefore $$ \left( \binom n 0 \cdot 0 + \binom n 1 \cdot 1 + \binom n 2 \cdot 2 + \cdots + \binom n k \cdot k + \cdots + \binom n n \cdot n \right) \left(\frac 1 2 \right)^n = \frac n 2. $$ Consequently $$ \binom n 0 \cdot 0 + \binom n 1 \cdot 1 + \binom n 2 \cdot 2 + \cdots + \binom n k \cdot k + \cdots + \binom n n \cdot n = n 2^{n-1} . $$
ADDENDUM: I looked at Masser's 1989 article, and a quick back-of-the-envelope calculation seems to give the result, at least for two points. Thus if $P$ and $Q$ are independent points generating a field of degree $d$, then $$ \hat h(P)\hat h (Q) \ge \frac{C(E)}{d^3(\log d)^2}. $$ The idea is to apply the main theorem in Masser's paper to the set of points $$ \{ mP + nQ : 0\le m\lt M~\text{and}~0\le n\lt N \}. $$ Then choose the optimal values for $M$ and $N$, much as one does in proving the Cauchy-Schwarz inequality. Presumably one can do something similar with more points.
@Jamie: This is not Lang's height conjecture, which fixes a field (or degree of the field) and lets the elliptic curve vary. This is, as to OP indicates, a generalization of the elliptic version of Lehmer's conjecture.
@Vessilin: I remember corresponding with someone (maybe Cam Stewart) at one point about whether one could get a better bound for $\max \hat h(P_i)$, but we never got an interesting result. And I don't know anything about the problem of minimizing a product. Looks like an interesting problem. There are, as far as I know, three basic approaches that have been used for the $r=1$ case.
(1) For the CM case, Michel Laurent's estimate that mirrors Dobrowolski's.
(2) Use of Diophantine approximation / transcendence theory methods (i.e., auxiliary polynomials that become so small, they must vanish). The best estimate (up to improving the constant) is still Masser's and gives something like $\hat h(P) \ge C(E)/d^3(\log d)^2$.
(3) Use of Fourier averaging (which is the same idea that Hindry and I used for Lang's height conjecture). Hindry and I could only make this work if the $j$-invariant of $E$ is non-integral, but with this added hypothesis, we knocked one off of Masser's exponent and got $\hat h(P) \ge C(E)/d^2(\log d)^2$.
The reason I mention these is that it seems reasonable (to me) that each method has at least the possibility of being used to obtain a result for $\hat h(P_1)\hat h(P_2)\cdots\hat h(P_r)$.
There is also the following slightly different result: If you only look at points defined over the maximal abelian extension $K^{ab}$ of $K$, then there is an absolute upper bound $\hat h(P)\ge C(E)$. This was proven by combining two article, one by Matt Baker and one of mine, and then we have a joint paper that generalized it to abelian varieties. It is based on the ideas of Amoroso and Dvornicich, who proved the analogous result for the multiplicative group. The method can be roughly described as a careful use of ramification. Of course, in this case a product would have the obvious lower bound $C(E)^r$, so not very interesting. But I mention it since there are so few known methods that are potentially useful.
The SSMS November 2015 preview works against the SQL Server 2016 CTP versions. I actually use this version of SSMS (November 2015 preview) against my local 2012 and 2008 R2 instances and don't have any problems.