The Community user has badges on  and  .  While they are partially hidden, they are still visible, and they are also visible in the .  I guess this is partly because these sites have been imported in the SE network, not been created through the Area 51 process.
Apparently, .  How the heck did that happen?
Is there a software in Ubuntu that can analyse the cross references (theorems, lemmas, equations, etc.) in a tex project? There are some software to analyse the cross references among codes (Java or C++). I used to use a software for code analysis under Windows many years before. But I can't remember the name. On linux, an example might be LXR Cross Referencer.   Is there a similar tool that can analyse the latex files to find out the cross references of theorems, lemmas, propositions and equations? -ing vs -in' ending I wonder if the &quot;g&quot; in the -ing forms is pronounced. When I hear it it seems as if it's not pronounced sometimes or just slightly, though sometimes I've been told that I should pronounce &quot;g&quot; for example in &quot;meeting&quot; just to avoid saying &quot;mitten&quot;. So how should I pronounce &quot;-ing&quot;? Sometimes -ing is written in an informal way as -in' such as:  taking takin'  Is the letter &quot;g&quot; in each case pronounced differently? Why are the United States often referred to as America? What is the right way to apply an image texture over a glass or plastic material? I am trying to put a label over the transparent plastic bottle, but i was unable to do so, because when i build the bottle material(plastic) and mix it with the diffuse shader(using the label texture), the label gets faded. So the solution i found was to duplicate the bottle and scale a little bit and apply the label material on it. So it looks its the same material, but in reality its one material over the other. How can I make my plastic material be under my label material(image)? Here's how it looks:   Here's my material setting for the plastic bottle:   Thanks in advance. $C_c^{\infty}(\mathbb R^n)$ is dense in $W^{k,p}(\mathbb R^n)$ Where [if anywhere] should the apostrophe go in "three days work"? Which is correct?     1 Three day's work      2 Three days' work      3 Three days work   I would probably guess (2) is right, since the work belongs to the three days ("three days of work"). But I'm not sure. Would it be different if it was only one day? How to instruct Windows 8 NOT to perform a fast shutdown? I have enabled fast boot in my copy of Windows 8 but I would like to be able to specifically instruct Windows not to perform a "fast shutdown" whenever I want (without disabling fast boot altogether).  I need to be able to do this because I dual-boot Ubuntu and therefore can't mount an NTFS partition as read/write if Windows has performed a "fast shutdown". (Well okay, I can force the partition to be mounted read/write, but then I could run into data loss/corruption problems.) While all the Hobbits I can think of have a combination of first- and lastname (e.g., Bilbo Baggins, Peregrin Took, the Sackville-Baggins's,...), I can't think of any character* of another race that has a lastname:   Men seem to like to add a reference to their ancestors (e.g., Aragorn, Arathorn's son or Isildur's heir) Dwarves seem to like descriptive or honorary names (e.g., Thorin Oakenshield, Dain Ironfoot). They are not lastnames though, since they do not get passed on to descendants. Elves don't have a need for lastnames, since elvish names are unique. Some nevertheless seem to have an additive (e.g., Legolas Greenleaf). Likewise, I can't find any usage of lastnames among Ents, Eagles, Istari, Orcs, trolls,...   But why would a society that is quite rural and not a leader of modernization be the only one to use a modern naming system with first- and lastnames?  *Except for Tom Bombandil. But he is, well, "special". Virtualbox Windows 10 Guest installation is freezing up in 14.04 I've installed VirtualBox using the Software Centre and I'm running a system on Ubuntu 14.04 with 8gb RAM, 64-bit dual core processor.  I want to run Windows 10, I've tried both 64 and 32 bit versions, in virtualbox. However, every time I start up windows 10 it gets to the point where the dots go round in a circle, then it freezes up and crashes back to the virtualbox manager. The only information it gives me is that the virtual machine was aborted.  I've changed the settings around a lot and nothing is working.  Any help would be appreciated.  Oh, and I've run Windows 10 technical preview on this machine before, a while ago  Thanks for any help in advance. Get rows with most recent date for each different item How can I convert timestamps in a column to a date? I have a file containing this:  1415602803,LOGIN SUCCESS,AUTH,user2,192.168.203.63,10.146.124.73,59996,22 1415602807,LOGIN SUCCESS,AUTH,user1,172.24.31.10,172.32.1.1,48191,22 1415602811,LOGIN FAILED,AUTH,root,172.24.166.153,10.146.124.73,52506,22 1415602815,LOGIN FAILED,AUTH,user3,192.168.123.55,10.146.32.99,55750,22   I want to convert the timestamp to a date in this format:  2014-11-10 02:00:03,LOGIN SUCCESS,AUTH,user2,192.168.203.63,10.146.124.73,59996,22 2014-11-10 02:00:07,LOGIN SUCCESS,AUTH,user1,172.24.31.10,172.32.1.1,48191,22 2014-11-10 02:00:11,LOGIN FAILED,AUTH,root,172.24.166.153,10.146.124.73,52506,22 2014-11-10 02:00:15,LOGIN FAILED,AUTH,user3,192.168.123.55,10.146.32.99,55750,22   How can I do that?  I know this works: perl -pe 's/(\d+)/localtime($1)/e' (from ) but the output format is Mon Nov 10 02:00:03 2014.  I know this command can convert timestamps into my desired output: date -d@1415602803 +"%F %H:%M:%S", but I couldn't make it work with awk using system("cmd") because of all the quotations and whatnot. #include&lt;iostream&gt; using namespace std;  class A  {    int a;    int b;    public:    void eat()    {       cout&lt;&lt;"A::eat()"&lt;&lt;endl;    } };  class B: public A {    public:    void eat()    {        cout&lt;&lt;"B::eat()"&lt;&lt;endl;     }  };  class C: public A {     public:    void eat()     {        cout&lt;&lt;"C::eat()"&lt;&lt;endl;     }  };  class D: public B, C {  };  int foo(A *ptr) {  ptr-&gt;eat();  } main() {  D obj; foo(&amp;(obj.B)); //error. How do i call with D's B part.  }   The above foo call is a compile time error.  I want to call foo with obj's B part without using virtual inheritance. How do i do that.   Also, in case of virtual inheritance, why the offset information need to be stored in the vtable. This can be determined at the compile time itself. In the above case, if we pass foo with D's object, at compile time only we can calculate the offset of D's A part. $(z_{2n})_{n\in \mathbb{N}}$ and $(z_{2n+1})_{n\in \mathbb{N}}$ converges to same limit. Show $(z_n)_{n\in \mathbb{N}}$ converges to the same limit. $(z_n)_{n\in \mathbb{N}}$ is a complex valued sequence such that subsequences $(z_{2n})_{n\in \mathbb{N}}$ and $(z_{2n+1})_{n\in \mathbb{N}}$ converges to same limit.  How could I show that the sequence $(z_n)_{n\in \mathbb{N}}$ converges to the same limit using $\epsilon$, $N$ definition?    For every $\epsilon &gt;0$,  $|z_{2n}-l|&lt;\epsilon$ whenever $n&gt;N_1$, and   $|z_{2n+1}-l|&lt;\epsilon$ whenever $n&gt;N_2$.  We want to show that for every $\epsilon &gt;0$, there exists $N$ such that $|z_{n}-l|&lt;\epsilon$ whenever $n&gt;N$. I tried something like  $|z_{n}-l|\le|z_n-z_{2n}|+|z_{2n}-l|$ but wasn't sure what to do next How to make a table from two lists? Consider a common proof of the uncountability of $(0,1]$, as presented  for example:  We assume that the reals can be arranged in a sequence $x_k$, represent every number in $x_k$ by its nonterminating decimal expansion, use the diagonal argument to create a sequence of decimal digits that differs from the nonterminating decimal expansion of each number in $x_k$ and then claim that this sequence of digits so generated must be the decimal expansion of some number not in $x_k$.  My problem is with this last step. Could it not be the case that the new sequence of digits is just the terminating decimal expansion of some number already in $x_k$?  Would it not be more correct to use the sequence $x_k$ to generate a sequence of all (both terminating and non-terminating) decimal expansion of all numbers in $[0,1)$ and then apply the diagonal argument? Calling sleep(5); and updating text field not working Determine number of real roots of $f(x)=x^{5}+x^{3}-2x+1$.   I used Descartes's rule of sign to determine the number of positive and negative roots; there is only 1 negative (hence minimum 1 real root) and two positive roots. These 2 positive roots can be anything- a complex pair, or two real roots- but what about the other 2 roots? Is there any flaw in my understanding of rule of signs? How can I find the exact number of real roots?  Thanks in advance. Are neutrinos affected by electromagnetic forces? I know they don't interact with matter nor any electromagnetic forces, but I know they have mass, very little mass but they have. When something has mass it must be attracted by gravity and other objects (electromagnetic) right? What is the problem that gets worse after you try to solve it? Prove that every Lebesgue measurable function is equal almost everywhere to a Borel measurable function Suppose $(\mathbb{R},\Sigma(m),m)$ is our measure space, where $m$ is Lebesgue measure.  Also, suppose $f : \mathbb{R} \to [-\infty, \infty]$ is a Lebesgue measurable function.  The problem:     Prove that $f$ is equal almost everywhere to a Borel measurable function.   My attempt:  We only have to prove this assertion for a non-negative Lebesgue measurable function $f$ because the result will follow for all Lebesgue measurable functions.  Furthermore, since any Lebesgue measurable function can be approximated by a sequence of non-negative, monotonically increasing, Lebesgue measurable simple functions $s_{n}$, we only need to prove the claim for an arbitrary Lebesgue measurable simple function.  So, let $s: \mathbb{R} \to [-\infty, \infty] $ be a Lebesgue measurable simple function.  We can write $s$ canonically as $$ s(x) = \sum \limits_{i = 1}^{n} \alpha_{i} \chi_{A_{i}}(x)$$ where $\alpha_{i} \in [-\infty, \infty]$, $\bigcup \limits_{i = 1}^{n} A_{i} = \mathbb{R}$, and $A_{i} \cap A_{j} = \emptyset$ if $i \neq j$.  For each $i$, since $A_{i}$ is Lebesgue measurable, we can find a Borel set $B_{i}$ such that $A_{i} \subseteq B_{i}$ and $m(B_{i} \setminus A_{i}) = 0$.  Clearly, this implies that $\bigcup \limits_{i = 1}^{n} B_{i} = \mathbb{R}$.  Now we just need the $B_{i}$'s to be pairwise disjoint, with each $B_{i}$ still retaining $A_{i}$.  To make them pairwise disjoint, I constructed the following sets:  $\tilde{B_{i}} = [B_{i} \setminus (\bigcup \limits_{j \neq i} B_{j})] \cup A_{i}$.  This construction gives us that the $\tilde{B_{i}}$'s are pairwise disjoint (I think....) and $A_{i} \subseteq \tilde{B_{i}}$.  But I don't know that $\tilde{B_{i}}$ is necessarily still a Borel set. :( :(  Am I approaching this problem all wrong?