How to i Combine Front and back leaf Textures that is not alpha From Cgbookcase.com with Maps. on a Leaf plane front and back with two uv Map?
How can I make a material only apply to a side of a plane?
My understanding of the Stern–Gerlach experiment is that neutral (0 total charge) particles are sent through a non-homogeneous magnetic field, with the expectation that the field will push that particle's path higher or lower on a detector because of the collective spin of that particle. While the detector can detect particles in a two-dimensional surface, the results of the experiment are that particles appear in only two localized areas directly above the path of the particle stream, or directly below the path of the particle stream - spin up or spin down. The conclusions from these measurements are that the particle, when measured, will always have about the same magnitude.  Why does this not follow from classical mechanical theory related to magnetism? If you shot a magnet through a similar apparatus, I would expect the magnet to be rotated to align with the magnetic field in some way which, at high enough field strengths relative to the mass of the magnet, would cause us to measure basically the same magnitude as if the magnet entered the apparatus pre-aligned with the field.  How is my explanation incorrect? Temperature in space Temperature is a measure of kinetic energy transferred to particles, henceforth,  being vacuum, temperature cannot be measured. But then, there is cosmic background radiation. It is the leftover heat from the Big Bang, but then heat in space doesn't make sense, how does this radiation, heat up space time when it technically cannot be heated up? Moreover why is it referred to as heat when it is approximately just $2.5$ Kelvin, which is just above absolute zero? Remove a child with a specific attribute, in SimpleXML for PHP I had a problem with disappearing marker as the data sum up to more than 100 while xmax was set to 100. See .  As written in the answer to the cited question I tried to avoid the problem by normalizing the value to 100. But this lead to (much smaller) rounding errors in previously correct rows and now the marker disappear there. See the following example. Before the normalisation the column F ist affected, after the column B.   How can I in a reliable way avoid this rounding problem? Or at least get a clear error message. I have quite a number of this plots and I don't want to have to check them all the time for missing markers.    \documentclass{scrreprt} \usepackage{pgfplots} \pgfplotsset{compat=1.13} \usepackage{pgfplotstable} \pgfplotsset{  my stackbar plot/.style={              xbar stacked,              xmin=0,xmax=100,              symbolic y coords={A,B,C,D,E,F,G},              ytick=data,              nodes near coords={xxx},}}  \begin{document}  \pgfplotstableread[col sep=space]{  text   --  -    +       ++  A      0.0 1.7 13.8    84.5  B      0.0 0.6 20.1    79.3  C      0.0 1.9 13.2    84.9  D      0.0 1.6 27.9    70.5  E      1.3 3.9 19.5    75.3  F      0.0 1.4 15.0    83.7  G      0.3 1.7 24.8    73.2  }\data   \pgfplotstablecreatecol[create col/expr={\thisrow{--}+\thisrow{-}+\thisrow{+}+\thisrow{++}}]{sum}\data %  \pgfplotstablecreatecol[create col/copy=--]{--o}\data  \pgfplotstablecreatecol[create col/copy=-]{-o}\data  \pgfplotstablecreatecol[create col/copy=+]{+o}\data  \pgfplotstablecreatecol[create col/copy=++]{++o}\data  \pgfplotstablecreatecol[create col/expr={100/\thisrow{sum}*\thisrow{--o}}]{--}\data  \pgfplotstablecreatecol[create col/expr={100/\thisrow{sum}*\thisrow{-o}}]{-}\data  \pgfplotstablecreatecol[create col/expr={100/\thisrow{sum}*\thisrow{+o}}]{+}\data  \pgfplotstablecreatecol[create col/expr={100/\thisrow{sum}*\thisrow{++o}}]{++}\data  \pgfplotstablecreatecol[create col/expr={\thisrow{--}+\thisrow{-}+\thisrow{+}+\thisrow{++}}]{sumnew}\data  \pgfplotstabletypeset[columns={text,sum}   ,precision=10,columns/text/.style={string type}]\data \quad \pgfplotstabletypeset[columns={text,sumnew},precision=10,columns/text/.style={string type}]\data   %\pgfplotstablesave{\data}{pgfplotstempout.dat} \begin{tikzpicture} \begin{axis}[my stackbar plot]  \addplot table [x expr = \thisrow{--o},y=text] {\data};  \addplot table [x expr = \thisrow{-o}, y=text] {\data};  \addplot table [x expr = \thisrow{+o}, y=text] {\data};  \addplot table [x expr = \thisrow{++o}, y=text] {\data}; \end{axis} \end{tikzpicture} \quad \begin{tikzpicture} \begin{axis}[my stackbar plot]  \addplot table [x expr = \thisrow{--},y=text] {\data};  \addplot table [x expr = \thisrow{-}, y=text] {\data};  \addplot table [x expr = \thisrow{+}, y=text] {\data};  \addplot table [x expr = \thisrow{++}, y=text] {\data}; \end{axis} \end{tikzpicture}  \end{document} Regex for quoted string with escaping quotes How do I get the substring " It's big \"problem  " using a regular expression?  s = ' function(){  return " It\'s big \"problem  ";  }'; Proof of a formula for the power set of a union of two sets I need to prove that:  $2^{A\cup B} =\left \{ X\cup Y \mid X\in 2^{A}, Y\in2^{B} \right \}$  Note that $2^{A} = P(A)$ (The power set of A).  While I can prove the Right - Left direction fairly easily, It seems very hard for me to prove the Left - Right direction. Can I get some help with that?  How do I prove that $t\in2^{A\cup B}$ makes $t\in \left \{ X\cup Y \mid X\in 2^{A}, Y\in2^{B} \right \}$? Turn off automatic preview in apple mail What is the speed of time? Combining style numeric with style authoryear in BibLaTeX I haven't had a lot of experience with biblatex so far and I decided to use the numeric style for citations in the text. However, the authoryear style for the bibliography is much nicer. I know, I can't actually combine numeric citestyle with authoryear bibstyle.  That brings me to my question: How can I achieve using the numeric citestyle and the formatting of authoryear in the bibliography? Convolution operator has norm 1 with respect to $L^2$ norm Let $C_c(\mathbb{R})$ be the following:  $$C_c = \{ f \in C(\mathbb{R}) \mid \exists \text{ } T &gt; 0 \text{ s.t. } f(t) = 0  \text{ for } |t| \geq T\}$$  Let $T_n \in L(C_c(\mathbb{R}))$ be a linear operator such that:  $$T_n u = \delta_n *u, \forall u \in C_c(\mathbb{R}),$$  where  $$ \delta_n(t)= \begin{cases}        n^2(t+1/n) &amp; -1/n \leq t \leq 0 \\       -n^2(t-1/n) &amp; 0 &lt; t \leq 1/n \\       0 &amp; \text{elsewhere}     \end{cases} $$  I have to prove that with respect to the 2-norm, the operator $T_n$ has $\|T_n\| = 1$ and I have succeeded in proving that $\|T_nu\|_2 \leq \|u\|_2, \forall u \in C_c(\mathbb{R}).$  Now, I remained  to prove that $\exists \text{ } u \in C_c(\mathbb{R}) \text{ s.t. } \|T_nu\|_2 = \|u\|_2$, but I really don't get how $u$ should be shaped in order to satisfy it. Can we simulate the whole universe in computer? Here is an idea: As human kind we discovered many laws, formulas, events, etc. in our surrounding environment.here is a way to discover the unknowns :   Now if we simulate a virtual world with our knowledge in computers we expect it to work, because we guess that we know all of it. If a bug occurs in the simulation or something acts differently from the expected in the real world, that may tell us that there is something new; a thing (law, formula, ...) that we didn't know, which causes that bug or that anomaly.  For examples imagine that we created a virtual simulation for motion dynamics and we didn't add the friction to our simulation. Everything in the simulation will work fine but in a different manner. So if we hadn't discovered friction yet, would it help us to think about if there is something we didn't add? Or if there is something we don't know?       But can we simulate the whole universe, everything we know, in one simulation? I know it will require a deadly high computational power. Something like what they did for DNA; two years of computation to analyse their pattern. can we simulate everything we know to create a virtual universe to compare it to our real universe? Is there an easy way to add a hole into an object? If I wanted to add a hole into an object e.g. Create a tube  Is there an easy way to do that?  I haven't seen anything regarding negative space so far in Blender, and it would be really helpful for my project  Thanks in advance! PDF editing within Apex/Visualforce How to reinstall many removed packages at once? I used sudo apt-get remove python command and accidently removed a bunch of packages that were required. I logged in via command line and installed ubuntu-desktop again but there are other packages that are missing, and I'm looking for a way to easily reinstall those removed packages. Since there's the log at software-center I wanted to ask what the easiest way might be to roll back changes or extract the removed packages list from the software center...  note: I typed sudo apt-get install .... .... ... ... for about two dozen of those removed programs in that list, but when I pressed enter it didn't install any of them because some package names couldn't be found.  The programs were removed at the same date. releasing a second question concerning ordered stuff and set theory, which is very similar to my first question () which I'm putting here for reference.  The next problem that I'm stuck at in my book is this: we have an ordered triple $(a,b,c)$ and we want to define it using set theory. Why would $\{\{ a\} ,\{ a,b\} ,\{ a,b,c\}\}$ not work? The book requires from me to prove why it is not valid.  Additional info: I don't know how this matters but I'm gonna put it up anyhow. It is written within the book that the correct way to show it is $\{\{ a\} ,\{\{ a\} ,\{\{ b\} ,\{ b,c\}\}\}\}$  EDIT: Now, I consider that the correct case should matter. Besides pointing out why the first case is wrong I'm curious as to why the second one is correct char!=(signed char), char!=(unsigned char) The code below compiles, but has different behavior for the char type than for the int types.  In particular     cout &lt;&lt; getIsTrue&lt; isX&lt;int8&gt;::ikIsX  &gt;() &lt;&lt; endl;    cout &lt;&lt; getIsTrue&lt; isX&lt;uint8&gt;::ikIsX  &gt;() &lt;&lt; endl;    cout &lt;&lt; getIsTrue&lt; isX&lt;char&gt;::ikIsX  &gt;() &lt;&lt; endl;   result in 3 instantiations of templates for three types: int8, uint8 and char. What gives?  The same is not true for ints: int and uint32 which result in the same template instantiation, and signed int another.  The reason seems to be that C++ sees char, signed char and unsigned char as three different types. Whereas int is the same as a signed int. Is this right or am I missing something?  #include &lt;iostream&gt;  using namespace std;  typedef   signed char       int8; typedef unsigned char      uint8; typedef   signed short      int16; typedef unsigned short     uint16; typedef   signed int        int32; typedef unsigned int       uint32; typedef   signed long long  int64; typedef unsigned long long uint64;  struct TrueType {}; struct FalseType {};  template &lt;typename T&gt; struct isX {    typedef typename T::ikIsX ikIsX; };   // This  int==int32 is ambiguous //template &lt;&gt;            struct isX&lt;int  &gt;    { typedef FalseType ikIsX; };  // Fails template &lt;&gt;            struct isX&lt;int32  &gt;  { typedef FalseType ikIsX; }; template &lt;&gt;            struct isX&lt;uint32 &gt;  { typedef FalseType ikIsX; };   // Whay isn't this ambiguous? char==int8 template &lt;&gt;            struct isX&lt;char  &gt;  { typedef FalseType ikIsX; }; template &lt;&gt;            struct isX&lt;int8  &gt;  { typedef FalseType ikIsX; }; template &lt;&gt;            struct isX&lt;uint8 &gt;  { typedef FalseType ikIsX; };   template &lt;typename T&gt; bool getIsTrue(); template &lt;&gt;           bool getIsTrue&lt;TrueType&gt;() { return true; } template &lt;&gt;           bool getIsTrue&lt;FalseType&gt;() { return false; }  int main(int, char **t ) {    cout &lt;&lt; sizeof(int8) &lt;&lt; endl;  // 1    cout &lt;&lt; sizeof(uint8) &lt;&lt; endl; // 1    cout &lt;&lt; sizeof(char) &lt;&lt; endl;  // 1     cout &lt;&lt; getIsTrue&lt; isX&lt;int8&gt;::ikIsX  &gt;() &lt;&lt; endl;    cout &lt;&lt; getIsTrue&lt; isX&lt;uint8&gt;::ikIsX  &gt;() &lt;&lt; endl;    cout &lt;&lt; getIsTrue&lt; isX&lt;char&gt;::ikIsX  &gt;() &lt;&lt; endl;     cout &lt;&lt; getIsTrue&lt; isX&lt;int32&gt;::ikIsX  &gt;() &lt;&lt; endl;    cout &lt;&lt; getIsTrue&lt; isX&lt;uint32&gt;::ikIsX  &gt;() &lt;&lt; endl;    cout &lt;&lt; getIsTrue&lt; isX&lt;int&gt;::ikIsX  &gt;() &lt;&lt; endl;  }   I'm using g++ 4.something How is well-ordering in real line possible?  I know that the axiom of choice provides possible well-ordering, but intuitively, this does not seem to make sense.  How can you compare 1.111111.... and 1.111111... when we can never know the full digits of each number? Im new to Illustrator and have found the clipping mask is not so easy compared to Phtoshop. Could any one tell me how i can make this line texture a clipping mask over the circle? What is the right way to get the current users profile in an apex class?  When I tried to print the following in visualforce page,  i am able to get the profile name  &lt;apex:outputText value="{!$Profile.Name}"/&gt;    But when i tried to print in the Apex class using System.debug(Profile.Name), I couldn't. How do I delete data for one game in the iPad Game Center?