Is restricting access to controversial information beneficial to both the community and company?
Why was the previous Code of Conduct FAQ (and all answers) removed?
Which types of particles are affected by the wave-particle duality? If we take the double slit experiment as a way of demonstrating the wave-particle duality, which types of particles would show an interference pattern?  For example, I know that electrons show such a pattern. But do protons, too? What about atoms? Where is the boundary between "wavey particles" and "classical particles"? How to edit files in a terminal with nano? For creating the graphics for my thesis (function graphs, flow charts, line art sketches) I've chosen to use the sans serif font by  \renewcommand\familydefault{\sfdefault}    However when I use mathematical symbols like $p_{s}$, they are still typeset in roman font and that looks weird:    So I wonder:   how could I force mathematical expressions also be typeset in \sfdefault if I do, are there any negative sideeffects to expect (with greek signs or other special symbols?) OR should I typeset all "mathematical" graphs (axis labels etc.) in roman font, and only make the other graphics like flow charts and sketches with sans serif font? What is the order when doing $x^{y^z}$ and why? Does $x^{y^z}$ equal $x^{(y^z)}$? If so, why?   Why not simply apply the order of the operation from left to right? Meaning $x^{y^z}$ equals $(x^y)^z$?  I always get confused with this and I don't understand the underlying rule. Any help would be appreciated! Wrapper for package managers There are a lot of language-specific package managers like cpan for perl, cabal for haskell etc. When we want to install some software, it can sometimes be installed from a corresponding repo, with installation instruction just like (say, ) npm install yaxy or cpan something or cabal install something.   These package managers have slightly different syntaxes, they all need root privileges and/or custom setup, or (in case of Yaxy) just a newer version of interpreter (nodejs packaged by Ubuntu was too old to run it).  Is there a wrapper for different package managers that unifies/automates setup for different package managers?  Edit: what I want is a way to execute installation command like that npm install yaxy and make it working without manual installing system npm+nodejs, getting non-functional executable, finding the simplest way to install fresher nodejs on my system, reinstalling... How to select polygons facing camera instead of polygons located in the opposite side I want to select marked face:    however back face gets selected:    Is there an option in blender to only select facing polygons camera ? I just wanted to know how to add "create node form" in a block  when i  copy the source code and make a block out of that code, only public could post from that. when i am posting as a user it says timeout and tells us to refresh the page. plz someone give me solution.  SO i tried to add the following code in page.tpl.php  $form = node_add('nodetype'); print drupal_render($form); Problem about a process with bins of balls Copying files from command line to clipboard I am trying to find the largest file in a directory recursively. If there is a subdirectory inside of that directory the function needs to go inside that directory and check to see if the largest file is there. Once the largest file is found the output is displayed with the relative path name and the name and size of the largest file.  EX:  dude@shell2 (~...assignment/solutions) % bash maxfile.sh ~/test class/asn dude.h.gch: 9481628   This is what I have:  #!/bin/sh clear  recursiveS() {     for d in *; do         if [ -d $d ]; then             (cd $d; echo $(pwd)/$line; du -a; recursiveS;)         fi     done } recursiveS   I have been stuck for a while now. I cannot implement this by pipelining a number of existing Unix tools. Any ideas would be nice! Product and sum of positive operators is positive I want to show that for $S,T\in B(H)$ bounded operators on Hilbertspace with $S\geq 0,T\geq 0$ and $ST=TS$,  we have $S+T\geq 0$, and $ST\geq 0$.  $T\geq 0$ means $(Tx,x)\geq 0$.    To me it seems that $((S+T)x,x) = (Sx,x)+(Tx,x)\geq 0$. But for $ST$ i like some help.   There is a theorem in Rudin (12.32) that says that for every $T\in B(H)$ we have an equivalence:   $T$ is positive $\Leftrightarrow$ $T$ is self adjoint, i.e. $T=T^*$ and $\sigma(T)\subset [0,\infty)$.   Since $S, T$ are self adjoint we know that $ST=TS = S^*T^* = T^*S^*$ ($ST$ is selfadjoint since $S,T$ commute). Also I read somewhere that if $S,T $ commute then $\sigma(ST)\subset \sigma(S)\sigma(T)$, but I am not sure if this is true. Clearly I cant prove it, but if it were true by this ''Theorem'' it would follow that $ST \geq 0$.   Is there a more straightforward way? How to favorite a question from Android app? I've found an interesting question when browsing Freelancers.SE. I've tried to star (favorite) the question but I couldn't find the option...  How to star a question from the Android app? There's something funky about some titles in revision histories here on Meta Stack Exchange Why are some applications so hard to find in the Ubuntu Software Centre? Some applications don't pop up in the search even when you type in their name. Take for instance Sushi. When you type in "sushi" into the search box, it fails to throw up the application. Only when you type in "gnome-sushi" does it appear. This is despite the fact that the application has "sushi" by itself in the application description. There are other applications which don't spring to mind right now, but I've discovered before. Java Generics: List, List, List Can someone explained, as detailed as possible, the differences between the following types?  List List&lt;Object&gt; List&lt;?&gt;   Let me make this more specific. When would I want to use  // 1  public void CanYouGiveMeAnAnswer(List l) { }  // 2 public void CanYouGiveMeAnAnswer(List&lt;Object&gt; l) { }  // 3 public void CanYouGiveMeAnAnswer(List&lt;?&gt; l) { } biblatex: How to omit "p." at \cite? Reference request: convergence for periodic Markov chains Consider an irreducible but possibly periodic Markov chain on a finite state space with transition matrix $P$. We know there exists a unique stationary distribution $\pi$. If the Markov chain were aperiodic, we would have $P^n_{ij} \to \pi(j)$ as $n \to \infty$. This fails if the chain is periodic, but we have convergence of the Cesaro averages: $$\frac{1}{n}\sum_{k=1}^n P^k_{ij} \to \pi(j) \text{ as } n \to \infty.$$ Can anyone point me to a reference that states this fact? Every reference I've seen only considers convergence for aperiodic chains, or "fixes" periodicity by considering a lazy version of the chain. Alternatively, is there a simple way to obtain this result using the result for aperiodic chains? How do I connect to a MySQL Database in Python? How do I connect to a MySQL database using a python program? Intuition for groups This is quite a non-standard question, certainly for mathematics, though I believe it is no less important (for me and my peers, i.e. grads).  The course I am reading so far introduced us to Groups, rings, fields, etc. in the first year, progressing to characters, reps etc in the latter years.  However, even with representation theory I still don't feel like I have a good intuition.  How do you gain intuition in such an area. I know there will be a response of doing examples, but this doesn't really help - I've done lots already.  Am I doomed. How Many Genius Mixes Are There in iTunes?