I know that the Jedi are not supposed to have attachments with others (so it doesn't interfere with their work) and that would effect romantic relationships.  However Force sensitivity is, at least sometimes, able to be passed on genetically.    Why hasn't there been some kind of breeding program to encourage more people with a higher level of Force sensitivity from the offspring such a program would create?
I can't seem to find a satisfactory answer to this anywhere on the web. While  poses a related question, I don't think it sufficiently answers mine...  During the opening chapters of Jedi Search, Luke addresses the new Senate on the need to find new Jedi talent, or Force sensitive individuals. During this proposal, he cites that the most fruitful leads of Jedi potential are in the descendants of Jedi Knights: as Force sensitivity is hereditary. The book even discusses the notion that Leia should be comparatively well attuned to the Force, due to her being the child of Anakin Skywalker.  I understand that the concept of the Jedi as a totally celibate and monastic order was something that was retconned into the lore after Episode II: Attack of the Clones, and that there are examples of entire nuclear Jedi families exist (such as Andur Sunrider and Plo Koon)...  But if Force-manipulative ability is passed down genetically (as a potentially mutative property of their genetic makeup), why would the Jedi order be so numerous if they practice Chastity?  Even if procreation is not expressly forbidden (as in the pre-retcon Expanded Universe): why would Jedi need special permission to produce more Jedi potential children?  How are more Jedi created, if not through procreation? Has their profusion been deliberately retarded, and if so why? is there another explanation for their (pre-empirical) plenitude?
What is a "Nested Quantifier" and why is it causing my regex to fail? I have this regex I built and tested in regex buddy.  "_ [ 0-9]{10}+ {1}+[ 0-9]{10}+ {2}+[ 0-9]{6}+ {2}[ 0-9]{2}"   When I use this in .Net C#   I receive the exception  "parsing \"_ [ 0-9]{10}+ +[ 0-9]{10}+  +[ 0-9]{6}+  [ 0-9]{2}\" - Nested quantifier +."   What does this error mean? Apparently .net doesn't like the expression.  Here is the regex buddy so u can understand my intention with the regex...  _ [ 0-9]{10}+ {1}+[ 0-9]{10}+ {2}+[ 0-9]{6}+ {2}[ 0-9]{2}  Match the characters "_ " literally «_ » Match a single character present in the list below «[ 0-9]{10}+»    Exactly 10 times «{10}+»    The character " " « »    A character in the range between "0" and "9" «0-9» Match the character " " literally « {1}+»    Exactly 1 times «{1}+» Match a single character present in the list below «[ 0-9]{10}+»    Exactly 10 times «{10}+»    The character " " « »    A character in the range between "0" and "9" «0-9» Match the character " " literally « {2}+»    Exactly 2 times «{2}+» Match a single character present in the list below «[ 0-9]{6}+»    Exactly 6 times «{6}+»    The character " " « »    A character in the range between "0" and "9" «0-9» Match the character " " literally « {2}»    Exactly 2 times «{2}» Match a single character present in the list below «[ 0-9]{2}»    Exactly 2 times «{2}»    The character " " « »    A character in the range between "0" and "9" «0-9»   In short...  What is a Nested quantifier? How to adjust the size and placement of chapter heading in report class How could I adjust the size and placement of chapter heading in my custom class? I am using report class as my base. When I used titlesec package inside my custom class, it threw error     ! Package titlesec Error: Not allowed in `easy'   settings. I've used "//" and "\" to create this "W", and have made them into outlines, as I'm trying to give the different layers a colour, as well as having a white space where the lines touch and I would like to remove the top of the second "\".   I'm struggling with the white space at the moment and now I've added a stroke, the fill has decreased. Is there another way I could do this?   I've also tried to use my pen tool to remove the top of the "\" but when using "Path Finder" I cannot find an option to "Minus Forward". I'm a newbie so any advice would be lovely :) When hyperref is loaded I receive the following error:     TeX capacity exceeded, sorry [input stack size=5000].   However, when I remove hyperref package it compiles successfully. I traced it back and found that \maketitle causes the error but don't know how to fix it. Is there any way to use hyperref in my setup.   Code:       %!TEX TS-program = xelatex     \documentclass[journal,transmag,]{IEEEtran}      \usepackage[hyphens]{url}     \usepackage{hyperref}      \usepackage{xunicode}      \usepackage{fontspec}      \usepackage{polyglossia}     \setmainlanguage{english}     \setotherlanguage{arabic}     \newfontfamily\arabicfont[Script = Arabic]{Amiri} % Replace 'Simplified Arabic' with a font from your system       \begin{document}     \title{A Very Nice Title}      \author{\IEEEauthorblockN{             John Doe\IEEEauthorrefmark{1}}%,~\IEEEmembership{Member,~IEEE}         \IEEEauthorblockA{\IEEEauthorrefmark{1}My address}         % &lt;-this % stops an unwanted space         \thanks{Manuscript received mm dd, 20xx; revised mm dd, 20xx.               }     }      % The paper headers     \markboth{headers...}%     {Shell \MakeLowercase{\textit{et al.}}: Bare Demo of IEEEtran.cls for IEEE Transactions on Magnetics Journals}      \IEEEtitleabstractindextext{%         \begin{abstract}My Abstract.\end{abstract}          % Note that keywords are not normally used for peerreview papers.         \begin{IEEEkeywords}             Key 1, Key 2     \end{IEEEkeywords}}      \maketitle       \IEEEdisplaynontitleabstractindextext     % \IEEEdisplaynontitleabstractindextext has no effect when using     \IEEEpeerreviewmaketitle       \section{Introduction}     English Text      \begin{Arabic}      السَلَامُ عَلَيكُمْ     \end{Arabic}       \end{document} Multi-partition multi OS bootable USB I want to create a recovery flash drive. I have my 8 gb flash drive[Kingston data traveller] with me. I also have the required .iso files for a>Ubuntu 13.10 b>Boot-repair disk c>AVG Rescue CD  I Wish to create 4 partitions(3 for each bootable .iso and one for data storage. Also, I want a way in which I can select which OS to boot each time I boot from USB.   So, is there a way to install GRUB on USB as well as the three other live distros? And how to create such a setup? Theory behind partial least squares regression Can anyone recommend a good exposition of the theory behind partial least squares regression (available online) for someone who understands SVD and PCA?  I have looked at many sources online and have not found anything that had the right combination of rigor and accessibility.    I have looked into The Elements of Statistical Learning, which was suggested in a comment on a question asked on Cross Validated, , but I don't think that this reference does the topic justice (it's too brief to do so, and doesn't provide much theory on the subject).  From what I've read, PLS exploits linear combinations of the predictor variables, $z_i=X \varphi_i$ that maximize the covariance $ y^Tz_i $ subject to the constraints $\|\varphi_i\|=1$ and $z_i^Tz_j=0$ if $i \neq j$, where the $\varphi_i$ are chosen iteratively, in the order in which they maximize the covariance.  But even after all I've read, I'm still uncertain whether that is true, and if so, how the method is executed. I want to construct a field with $125$ elements. My idea is to consider the polynomial ring $\Bbb F_5[x]$. It is enough to find an irreducible polynomial $f\in \Bbb F_5[x]$ of degree $3$ because then $\Bbb F_5[x]/(f)$ is a field with exactly $5^3=125$ elements.  How do I find an irreducible polynomial of degree $3$ in $\Bbb F_5[x]$? I'm fairly new to bicycling; apologies if this is a standard question but I couldn't figure out how to phrase it to search for it elsewhere.  I ride a KHS Urban-X with Kenda Kwest tires (just what it came with). I've gotten barely any use out of it since owning it, and it's been resting comfortably in the living room through the winter, so I decided today was a great day to get back on.   So I unscrewed the back tire cap, and began to hand-pump air into the tire. All seemed to go well, and the tire held pressure fine, but when I removed the tire pump, the pin appeared to remain pushed down slightly, and air flowed back out of the tire. I looked, and this is what I saw:    Several narrow gashes that appear as if the rubbed was ripped, cut, or separated somehow.  Questions   Is this a common occurrence? Again, I've ridden on this bike very little and thus filled up the tires even less. We have no animals and no bugs around that I know of that would gnaw or chew on such material. Is this fixable, or is my tube completely shot? It would seem to me that the latter is the case. Is there anything I can do to prevent this in the future? I use a hand pump but am gentle; would a stand-up pump be a better choice?  Do bike tires come with a standard warranty for cases like this, or do you know of any brands that do? If I have to purchase new tires, I'm going to purchase Is there any kind of "off-season" maintenance that I should be performing on my bike that could prevent things like this?   Thanks in advance for any help you can give! This is a  about hostname-awareness and proxying.   I know that some protocols are hostname-aware; that is, when I connect to the HTTP server at www.example.com it knows I want www.example.com's HTTP service, not www.example.net's, even though they are on the same IP address.  How can I do this for protocol foo?  (Temporary note: this question appears pursuant to .) Create line heatmap with QGIS I have loaded my bike tours as .gpx files into QGIS.    It already looks quite nice but I was wondering if it might be possible to create something similar to the strava heatmap with tools of QGIS.     I have tried to generate points along the lines and use kernel density but it just does not look nice as a raster layer.  Any suggestions? Looking for a short story about an artist and a forger Back in the late 1970s to early 1980s, I read a short story about an artist and a forger.  Between the two of them, they managed to start a revolution that brought down a corrupt dictatorship.  It was science fiction:   The dictatorship was interplanetary, maybe interstellar.   The artist used some kind of advanced technology to make his art works.   Plot:  The artist is one of the best (if not the best) at what he does.  The dictator wants the artist to make what amounts to a family portrait in whatever medium it is he works in.  Think of it like painting - you create the image manually (not a photograph) but it is much more than just a flat image.    The artist doesn't like the dictator - maybe on general principles, maybe because he knows the dictator personally - and refuses to make the "portrait."  The dictator has the artist arrested, and will only let the artist free again if he makes the portrait.  The artists makes the portrait.  He does the work while in the prison or jail.  That's where the forger comes into things. The forger is also in jail for something or other.  The forger makes copies of art works.  He of course recognizes the artist, and knows what the artist works with.  The forger can somehow see what the artist is working on.  The artist finishes the portrait.  At first the dictator is thrilled.  It looks exactly the way he wanted it.  As time goes by, though, the people looking at the picture see that it represents the vileness and corruption of the dictator.  The more you look at it, the more of the evilness of the dictator you see in it.  That is the genius of the artist, and whatever medium he is using.  Once you notice the hidden levels of the portrait, you can't unsee them and you see more and more of it as you look.  I think the effect carries over into reality as well.  Once you've seen the dictator's corruption in the portrait you also begin to see it in the dictator and his works as well.  This of course seriously pisses off the dictator, who has the artist killed and the portrait destroyed.  While in prison, the forger watched as the artist created his masterpiece, and recognized it for the subversive thing it is.  He also recognized it as the ultimate rebellion from the artist - the artist knows what will be seen, and that he will be killed for it.  All of that inspires the forger to do something more meaningful with his life than make forgeries for the money.  The forger is released from prison.  He saw the completed portrait, and knows how it was made.  He begins making forgeries of the portrait - like, hundreds if not thousands of them.  These are distrubuted throughout the nation/empire.  The people realize what evil is controlling them once they see it in the copies of the portrait, and eventually a revolution rises and brings down the dictatorship.  It was probably older than the 1970s.  I expect earlier than 1960.  Any ideas? What are the system requirements for each flavour of Ubuntu Desktop? Counting the number of propagating degrees of freedom in Lorenz Gauge Electrodynamics 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? Is $\lim\limits_{n\rightarrow\infty} n$ comparable to $\aleph_0$? For example, can we say: $\infty=\lim\limits_{n\rightarrow\infty} n &lt; \aleph_0$?  These are two different types of structures. The limit being like the length, extension, or just generic magnitude and the other being cardinality of a set. Can we compare magnitude to cardinality?  Intuitively, we can reach $\aleph_0$ by counting the natural numbers on the number line and in the process will be approaching $\infty$. Which leads me to believe $\infty\leq\aleph_0$. But I can't see why it should be a strict inequality. I feel like they should be of equal magnitude.  I saw on a recent comment that $2^\infty=\infty$, but are those infinities really the same? It seems not to me. Of course we (usually) have that  $2^{\aleph_0}=\aleph_1$ where ${\aleph_0}$ and $\aleph_1$ are clearly two very distinct infinities, countable vs uncountable at least. Maybe one might argue that as far as the concept of magnitude is concerned, all infinities are "equal". Are PS+ free games region-locked? I have a PSN account that belongs to region X. It has a PS+ subscription. I have acquired many games throughout the years; some are PS+ free games, some are digital medias bought from PS Store. I'm moving to region Y.   Question: will I be able to play all of them normally on while I'm in region Y, specially those free PS+?  In other words, will I be able to keep using the same PSN and PS+ accounts and get access to my games in the library?  PS: I believe it is not possible to change country of a PSN account, isn't that so? How do I list all of the files in a commit? I am looking for a simple Git command that provides a nicely formatted list of all files that were part of the commit given by a hash (SHA-1), with no extraneous information. I have tried: git show a303aa90779efdd2f6b9d90693e2cbbbe4613c1d  Although it lists the files, it also includes unwanted diff information for each. Is there another git command that will provide just the list I want, so that I can avoid parsing it from the git show output? Let $H$ be a subgroup of $G$ with $[G:H]=n$. Let $N$ be the kernel of the left-multiplication action on the cosets of $H$. Show $[G:N]$ divides $n!$ Let $H$ be a subgroup of $G$ with $[G:H]=n$ and $G$ finite.  Let $G$ act on left cosets of $H$ by left multiplication.  Let $N$ be the kernel of the action.  Show that $[G:N]$ divides $n!$.  Ok so I have a theorem that says that if $G$ is simple then it embeds into $S_n$.  So if $G$ is simple than I'm done because $G$ divides $n!$ and thus $N$ divides $n!$ and hence $[G:N]$ divides $n!$.  Now I also know that $N$ is the largest normal subgroup of $G$ contained in $H$.  Thus if $G$ isn't simple then it contains some non-trivial normal subgroup $K$ and thus $K\cap H$ is normal in $H$ and by the 2nd Iso Theorem $H/K\cap H\cong KH/H$...    As you can see I'm not sure where to go from here. I was hoping to prove that $K\cap H$ wasn't trivial and thus that $N$ couldn't be trivial since it must contain $K\cap H$, but I'm not sure I can, and even if I could I'm not sure that would help me in showing that $[G:N]$ is small enough to divide $n!$.  Can anyone give some guidance?  Thanks. Does Change Data Capture (CDC) work in a SQL Server 2012 AlwaysOn Failover Cluster Instances setup? Does  work in a  setup?  There would be two nodes in the AlwaysOn Failover Cluster Instances setup and two Domain Controllers.  We are not using AlwaysOn Availability Groups.  Will CDC work? and will it failover? Search for text files where two different words exist (any order, any line) I'm looking for a way to search files where two word instances exist in the same file.  I've been using the following to perform my searches up to this point:  find . -exec grep -l "FIND ME" {} \;   The problem I'm running into is that if there isn't exactly one space that between "FIND" and "ME", the search result does not yield the file.  How do I adapt the former search string where both words "FIND" and "ME exist in a file as opposed to "FIND ME"?  I'm using AIX.