I've noticed that whenever I gain or lose reputation on Area&nbsp;51, it does not show up on the global reputation tab.   Reputation changes are showing up for every other site, but not for Area&nbsp;51. Is this intentional, or is it a bug?
The new Top-Bar does not show reputation changes from Area 51.
Recently I have updated my postgresql version. I have also upgraded pgAdmin from 3 to 4. But I was unable to load shapefile. I didn't find any plugin called shapefile loader. How can I get the shapefile loader plugin in pgAdmin 4? My furnace pilot light keeps going out so I changed the thermocouple. Now the furnace will come on and heat up to the degree set on my thermostat, then the pilot light will go out and the furnace will not come back on.    Could the thermostat be bad and cause the pilot light to go out? Given a Java InputStream, how can I determine the current offset in the stream? JSF doesn't support cross-field validation, is there a workaround? $\aleph_1$ is the cardinality of the countable ordinals. It is the least cardinal number greater than $\aleph_0$, and assuming the continuum hypothesis it's equal to $\mathfrak{c}$, the cardinality of the the real numbers.    My question is, is it possible for all $\aleph_1$ subsets of $\Bbb{R}$ to have Lebesgue measure $0$?  This is, of course, impossible assuming the continuum hypothesis, because then all sets of real numbers would have measure $0$, which is absurd.  But is $\mathsf{ZFC}$ + $\lnot\mathsf{CH}$ + "all subset of $\Bbb{R}$ of cardinality $\aleph_1$ have Lebesgue measure $0$" consistent?  If not, what if we replaced Lebesgue measure with some other measure?  It may be worth noting that, although there may be subsets of $\Bbb{R}$ with cardinality $\aleph_1$, there are no subsets of $\Bbb{R}$ which have the order-type $\omega_1$ (the order-type of the countable ordinals) under the usual ordering on $\Bbb{R}$.  Any help would be greatly appreciated.  Thank you in Advance. How do I uninstall Ubuntu Wubi? How do I send a file as an email attachment using Linux command line? What color would you see if you place 2 mirrors in opposit when one is a one way mirror How to prove $ \prod_{d|n} d= n^{\frac{\tau (n)}{2}}$ how to prove:   $$ \prod_{d|n} d= n^{\frac{\tau (n)}{2}}$$   $\prod_{d|n} d$ is product of all of distinct positive divisor of $n$,  $\tau (n)$ is number (count)of all of positive divisor of $n$ If we have an implicit surface $g(x, y, z)=...$, the gradient is a normal vector. But why? Do I have to start with tangent vectors and then show the gradient is perpendicular? Not sure how to approach this. How do I assign a value to a whole array of integers? I have two directories that should contain the same files and have the same directory structure.  I think that something is missing in one of these directories.  Using the bash shell, is there a way to compare my directories and see if one of them is missing files that are present in the other? Why doesn't the "zig-zag" comb deformation retract onto a point, even though it's contractible? I am starting to read Hatcher's book on Algebraic Topology, and I am a little stuck with exercise 6(c) in Chapter $0$. Unfortunately a picture is involved so it doesn't quite make sense for me to repeat it here - but I'll do it anyways (maybe it helps)     Let $Z$ be the zigzag subspace of $Y$ homeomorphic to $\mathbb{R}$ indicated by the heavier line in the picture:       Show there is a deformation retraction in the weak sense of $Y$ onto $Z$, but no true deformation retraction."   Now the definition for deformation retraction and weak deformation retraction as as follows:  We say that $f: X \to X$ is a deformation retraction of a space $X$ onto a subspace $A \subset X$ if there exists a family of maps $f_t : X \to X$ with $t \in [0,1]$ such that $f_0 = \mathbb{1}$ (the identity) and $f_1 (X) = A$ and also $f_t$ restricts to the identity on $A$ for each $t$.   A weak deformation retraction is almost the same, only that we now relax the conditions $f_1(X) = A$ to $f_1 \subset A$ and, for each $t \in [0,1]$ we require that $f_t(A) \subset A$.  Hence, as far as I understand the question and the concepts involved, I need to show that basically no map can be constructed such that the bold zigzag - line stays put while the thin lines retract to the bold line over a finite time interval $0 \leq t \leq 1$. However, I should be able to show that I can pull the thin lines continously onto the thick line, provided I am allowed to move points on the zigzag line .. is that correct ?  Now, the problem is I can't see why I shouldn't be able to do the former, given that I could find a weak deformation retract. Any help would be great! I am able to solve simple differential equations like :  $$\dfrac{dy}{dx} = 3x^2 + 2x$$  We simply bring $dx$ to other site and integrate.  But how do we find solutions of differential equations like :  $$\frac{d^2x}{dt^2} + \dfrac{kx}{m} = 0$$  ?  We have been told the solution is $x(t) = A\cos ( \omega t + \phi_o)$ where $\omega\ =\sqrt{\dfrac{k}{m}}$  but how do we actually find it? Number of total possibilities for an equation I need to find the number of possibilities for which the following equation exists:  $$x_1 + x_2 + x_3 + \cdots + x_{10} \leq 70$$  Each variable is a non-negative integer.  I tried simplifying the question to the point of finding the number of possible solutions to each equation seperatly:  $$x_1 + x_2 + x_3 + \cdots + x_{10} = 70,$$ which is ${79}\choose{10}$.  $$x_1 + x_2 + x_3 \cdots + x_{10} = 69,$$ which is ${78}\choose{10}$.  $$x_1 + x_2 + x_3 + \cdots + x_{10} = 68,$$ which is ${77}\choose{10}$, and so forth.  Then I thought about adding all of these together. This seems a bit too much work considering that the textbook solution is: ${80}\choose{10}$, and I can't seem to figure out the idiomatic way of approaching these kind of questions.   Any help is greatly appreciated. How do I watch a file for changes? Central limit theorem and the law of large numbers I have a very beginner's question regarding the Central Limit Theorem (CLT):  I am aware that the CLT states that a mean of i.i.d. random variables is approximately normal distributed (for $n \to \infty$, where $n$ is the index of the summands) or the standardized random variable would have a standard normal distribution.  Now the Law of Large Number states roughly speaking that the mean of i.i.d random variables converges (in probability or almost surely) to their expected value.  What I don't understand is: If, as the CLT states, the mean is approximately normally distributed, how then can it also converge to the expected value at the same time?   Convergence would imply for me that with time the probability that the mean takes a value which is not the expected value is almost zero, hence the distribution would not really be a normal but almost zero everywhere except at the expected value.  Any explanation is welcome. Is it possible to write a template that changes behavior depending on if a certain member function is defined on a class?  Here's a simple example of what I would want to write:  template&lt;class T&gt; std::string optionalToString(T* obj) {     if (FUNCTION_EXISTS(T-&gt;toString))         return obj-&gt;toString();     else         return "toString not defined"; }   So, if class T has toString() defined, then it uses it; otherwise, it doesn't. The magical part that I don't know how to do is the "FUNCTION_EXISTS" part. From a collection of short stories I read at least 30 years ago. :/  This is going to be incredibly vague, so apologies in advance.  A human and alien (blob/octopus-like...I think) from warring races are captured by an unidentified higher intelligence and put in an enclosure (more like a zoo habitat rather than a prison cell). They are separated by an invisible barrier and can see each other.  I think they were both trying to escape or trying to figure out how they could kill the other first. There was a bulldozer/loader type vehicle they could use at one point to build a shelter (or something).  I believe they were crafting makeshift weapons as well. There was no communication between the two as far as I remember.  The main tension in the story seemed to be was the race to get to the other first.  This has been stuck in my head forever. I know its a very common theme.  The short stories may have included Asimov. I'm building a Core  system which supports dual-channel memory (up to 16&nbsp;GB in four DIMMs), my target is 8&nbsp;GB. From the performance perspective, is it better to have two times 4&nbsp;GB or four times 2&nbsp;GB?