When to scale/normalize for supervised learning algorithms?
When conducting multiple regression, when should you center your predictor variables & when should you standardize them?
I use TeX Live 2010 and my editor is Texmaker Bidi. It was working probably good but from 2 months ago I've encountered with the error:   !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! ! ! Fatal fontspec error: "cannot-use-pdftex" !  ! The fontspec package requires either XeTeX or LuaTeX to function. !  ! You must change your typesetting engine to, e.g., "xelatex" or "lualatex" ! instead of plain "latex" or "pdflatex". !  ! See the fontspec documentation for further information. !  ! For immediate help type H &lt;return&gt;. !...............................................   when I'm trying to load xepersian LaTeX.  but I do not know how can I change pdfLaTeX to XeLaTeX.    This is the second edit of my question .   the code is :    ‎\documentclass{article}‎ ‎\usepackage{pstricks}‎ ‎\usepackage{‎pst‎-‎bezier}‎ ‎‎\usepackage{xepersian}‎  ‎\settextfont{XB Zar}‎  ‎\setlatintextfont{Junicode}‎  ‎\setdigitfont{XB Zar}‎  ‎\begin{document}‎  ‎!‎سلام دنیا‎‎ ‎\begin{pspicture}(‎3‎,3)‎ ‎\psbcurve(1,2)(5,7)(2,2)(12,3)‎ ‎\end{pspicture}‎ ‎ ‎\end{document}   but the output does not include the shapes . I have a Python script which takes as input a list of integers, which I need to work with four integers at a time.  Unfortunately, I don't have control of the input, or I'd have it passed in as a list of four-element tuples.  Currently, I'm iterating over it this way: for i in range(0, len(ints), 4):     # dummy op for example code     foo += ints[i] * ints[i + 1] + ints[i + 2] * ints[i + 3]  It looks a lot like &quot;C-think&quot;, though, which makes me suspect there's a more pythonic way of dealing with this situation.  The list is discarded after iterating, so it needn't be preserved.  Perhaps something like this would be better? while ints:     foo += ints[0] * ints[1] + ints[2] * ints[3]     ints[0:4] = []  Still doesn't quite &quot;feel&quot; right, though.  :-/ Related question: Understanding slice notation I need a good explanation (references are a plus) on Python's slice notation.   To me, this notation needs a bit of picking up.   It looks extremely powerful, but I haven't quite got my head around it. Generated Frattini Lemma Let $A$ be a normal subgroup of a group $G$. Let $B$ be a subgroup of   $A$ with the property that whenever $B_1 \leq A$ is conjugate to $B$   in $G$ then it is conjugate to $B$ in $A$. Prove that $G=AN_G(B)$   Help me some hints. Is there a way to save selection by faces I'm trying to find a way to save selection faces, tried Vertex Group, the issue with Vertex Group is that it adds the faces that are marked by 4 vertices that are added to the Vertex Group, there are some cases were this doesn't apply, the image explains what I mean. So is there a way to save my selected faces, so I don't have to go through the whole process of reselecting them each time I need to do so? If you check the image, I didn't assign the hatched faces to the Vertex Group, still when I select the Vertex Group, they get selected, I understand that they got selected because the four boundary vertices are assigned to the Vertex Group, I need to save only face selection, not vertex selection. How do you make USB bootable on chromebook I have a chromebook series 5. I want to install Ubuntu onto a USB stick. When I downloaded Ubuntu onto my USB stick, it won't start up.  Do I first have to download Ubuntu onto my chromebook hard drive, open Ubuntu and then make USB stick bootable? And then return back to chrome?  Or is there a way to download directly onto USB and make the stick bootable?  I appreciate any help. block all but a few ips with firewalld On a linux  networked machine,  i would like to restrict the set of addresses on the "public" zone  (firewalld concept), that are allowed to reach it. So the end result would be no other machine can access  any port or protocol, except those explicitly allowed, sort of a mix of     --add-rich-rule='rule family="ipv4" source not  address="192.168.56.120" drop'    --add-rich-rule='rule family="ipv4" source not  address="192.168.56.105" drop'   The problem above is that  this is not a real list, it will block everything since if its one address its blocked by not being the same as the other, generating an accidental "drop all" effect,  how would i  "unblock" a specific non contiguous set? does source accept a list of addresses? i have not see anything in my look at the docs or google result so far.     EDIT: I  just  created this:  # firewall-cmd  --zone=encrypt --list-all encrypt (active)   interfaces: eth1   sources: 192.168.56.120   services: ssh   ports: 6000/tcp   masquerade: no   forward-ports:    icmp-blocks:    rich rules:    But i can still reach port 6000 from  .123   my intention was that   if a source is not listed, it should not be able to reach any service or port I want to use  to display my CPU-Core temperatures (haswell i7). However the setting:  order += "cpu_temperature 1" #... cpu_temperature 1{         format = "T: %degree °C" } #   doesn't display the correct core temperature. The numbers it shows seem to correspond to the value xsensors shows for temp1, if I change the 1 to 2 above it corresponds to xsensors temp2. Trying 3 or 4 doesn't have any effect. However I want to get the true core temperatures of all 4 cores with i3 status. How can I do this? Suppose $K/F$ is an extension field, and $E_1$ and $E_2$ are two intermediate subfields of finite degree. Let $E$ be the subfields of $K$ generated by $E_1$ and $E_2$. I'm trying to prove that $$ [E:F]\leq[E_1:F][E_2:F].$$  Since $E_1$ and $E_2$ are finite extensions, I suppose they have bases $\{a_1,\dots,a_n\}$ and $\{b_1,\dots,b_m\}$, respectively. If $E_1=F$ or $E_2=F$, then the inequality is actually equality, so I suppose both are proper extension fields. I think $E=F(a_1,\dots,a_n,b_1,\dots,b_m)$. Since $\{a_1,\dots,a_n,b_1,\dots,b_m\}$ is a spanning set for $E$ over $F$,  $$[E:F]\leq n+m\leq nm=[E_1:F][E_2:F]$$ since $m,n&gt;1$.  Is this sufficient? I'm weirded out since the problem did not ask to show $[E:F]\leq [E_1:F]+[E_2:F]$ which I feel will generally be a better upper bound. It seems that in the words Englishman, Frenchman, and Scotsman, the ‑man part is pronounced /mən/ (just like in Roman).  Whereas in snowman, the ‑man part is pronounced /mæn/ (just like in no man).  Why is it that when ‑man is appended to snow‑ to make snowman, the pronunciation of the man part doesn’t change?    Wouldn’t it logically follow for it to be pronounced /ˈsnowmən/ not /ˈsnowˌmæn/? Transit Visa in Hong Kong for 15 hour layover between India and USA? We are (2) Indian nation and travelling from India to USA via Hong Kong airport and about 15 hours layover in Hong Kong airport. Do we need a transit visa even if only changing planes? And can we apply in Hong Kong Airport? Showing that the roots of a polynomial with descending positive coefficients lie in the unit disc. Let $P(z)=a_0+a_1z+\cdots+a_nz^n$ be a polynomial whose coefficients satisfy $$0&lt;a_0&lt;a_1&lt;\cdots&lt;a_n.$$  I want to show that the roots of $P$ live in unit disc. The obvious idea is to use Rouche's theorem, but that doesn't quite work here, at least with the choice $f(z)=a_nz^n, g(z)=$ (the rest).  Any ideas? How do you challenge the closing of one of your questions? As a newcomer to StackOverflow, I recently asked my first . I wanted to start with a fairly safe general question, to get the feel for how the site worked. My question was intended to be programming-related, but my original wording was not clear enough, so another user decided to close it.  I've re-phrased my question, and had received one useful answer before the question was closed, but I'm not sure what the procedure is after your question is closed to allow people to post answers again...  I've checked the FAQ and About pages, searched the SO questions, but have had no luck. Could someone point me in the right direction as to how I get my question re-opened, or if it is possible to do at all? ASP.NET Web Site or ASP.NET Web Application? When I start a new ASP.NET project in Visual Studio, I can create an ASP.NET Web Application or I can create an ASP.NET Web Site.  What is the difference between ASP.NET Web Application and ASP.NET Web Site? Why would I choose one over other?  Is the answer different based on which version of Visual Studio I am using? I am new to dslr's and got a nikon 3000 with 18-55 lens as a gift.  I already see some limitations with the lens for walking about or on trails.  So my question is being new should I go with a 55-200 or 55-300 or is there another step before I go with a telephoto lens. The Pauli group for $n$-qubits is defined as $G_n=\{I,X,Y,Z \}^{\otimes n}$, that is as the group containing all the possible tensor products between $n$ Pauli matrices. It is clear that the Pauli matrices form a basis for the $2\times 2$ complex matrix vector spaces, that is $\mathbb{C}^{2\times 2}$. Apart from it, from the definition of the tensor product, it is known that the $n$-qubit Pauli group will form a basis for the tensor product space $(\mathbb{C}^{2\times 2})^{\otimes n}$.  I am wondering if the Pauli group in $n$-qubits forms a basis for the complex vector space where the elements of this tensor product space act, that is $\mathbb{C}^{2^n\times 2^n}$. Summarizing, the question would be, is $(\mathbb{C}^{2\times 2})^{\otimes n}=\mathbb{C}^{2^n\times 2^n}$ true?  I have been trying to prove it using arguments about the dimensions of both spaces, but I have not been able to get anything yet. Any subgroup of index $p$ in a $p$-group is normal. How do I restrict my kids' computing time? Which Stack Exchange site is best for AutoCAD questions? Lie Algebra of U(N) and SO(N) U(N) and SO(N) are quite important groups in physics. I thought I would find this with an easy google search. Apparently NOT! What is the Lie algebra and Lie bracket of the two groups?