Did the Trade Federation know Darth Sidious was Senator Palpatine? If so, why didn't they rat him out when they were apprehended by the Republic?
How much did the Trade Federation know about their 'lord' at time of blockade?
I have a Linux instance that I set up some time ago.  When I fire it up and log in as root there are some environment variables that I set up but I can't remember or find where they came from.     I've checked ~/.bash_profile, /etc/.bash_rc, and all the startup scripts.  I've run find and grep to no avail.   I feel like I must be forgetting to look in some place obvious. Is there a trick for figuring this out? How to register domain for 15 years? I have heard that Google trust that website which has long expiry date. that want to know how can I register my domain for a long period. swap x and y axis on data generated plot Determining if a game is CPU- or GPU-limited What is a reliable, but not too time-consuming way to determine if a certain game is limited by the graphics card or by the processor speed?  I have some preconceptions about whether I'm mostly GPU or CPU limited, but I'd like to verify if I'm right about that. I have some ideas how I would go around and test that but performing accurate benchmarks is notoriously tricky and I don't have much experience with it.   So I'm wondering what would be an easy way to determine the bottleneck, having only one computer with a certain configuration available? What tools would I use for that purpose?  It would also be interesting to determine if the amount of VRAM on my graphics card is a limiting factor. How to get object size in memory? I need to know how much bytes my object consumes in memory (in C#). for example how much my Hashtable, or SortedList, or List&lt;String&gt;. Can a child enter the UK on an accompanied visa and then leave the country alone? My daughter who is just under 18 has a child accompanied visa to the UK. I am traveling with her to the UK for a few days. We return from UK on the same day except that she returns to India and I am heading to San Francisco an hour later on the same day.   Is that okay or will we have an issue at immigration into the United Kingdom? Python: List vs Dict for look up table I have about 10million values that I need to put in some type of look up table, so I was wondering which would be more efficient a list or dict?  I know you can do something like this for both:  if something in dict_of_stuff:     pass   and  if something in list_of_stuff:     pass   My thought is the dict will be faster and more efficient.  Thanks for your help.  EDIT 1  Little more info on what I'm trying to do.  .  I'm making a look up table to see if a value calculated has all ready been calculated.   EDIT 2  Efficiency for look up.  EDIT 3  There are no values assosiated with the value...so would a set be better? Good 1st PDE book for self study What is a good PDE book suitable for self study?   I'm looking for a book that doesn't require much prerequisite knowledge beyond undergraduate-level analysis.  My goal is to understand basic solutions techniques as well as some basic theory. Execute a program at login I'm running Arch-Linux ARM on a Raspberry Pi.  My project goal is to have a barcode scanner attached to the Pi that forwards the scanned messages to a server in a LAN.  To harden the system against power outages etc. and minimize required user interaction, I wish to set it up so that a certain user is logged in automatically at startup (done and works) and a specific program is to be run at startup (done and works but not as intended).  I've done this so far by adding  exec mono scannerSoftware.exe 127.0.0.1 1234 randomString   to /home/certainUser/.bash_profile so it gets executed only once even when I'm switching back and forth to root (in contrast to bashrc).    The particular problem I am having: When I launch the system, it works as intended (login as certainUser, starting scannerSoftware.exe); BUT if I want to switch users and hit Ctrl+C, it restarts the login process, logging certainUser in again and running the program again => back to where I came from.  My guess as to why this happens is that the sys detects "login not complete, better start it again".  I could circumvent this by spamming Ctrl+C right around the login so that I practically interrupted it. Of course, this is not good practice. Suffice it to say it is not practical at all.  My question: How can I set it up so the program gets executed AFTER login is complete so that Ctrl+C'ing out brings me to a normal bash prompt as certainUser instead of beginning the endless login-cycle?  EDIT: I'm not using any graphical interface or such, only commandline (bash on tty), because when done the system won't even have a display. Which computer science / programming Stack Exchange sites do I post on? Choosing between $z$-test and $t$-test Background: I'm giving a presentation to colleagues at work on hypothesis testing, and understand most of it fine but there's one aspect that I'm tying myself up in knots trying to understand as well as explain it to others.  This is what I think I know (please correct if wrong!)   Statistics that would be normal if variance was known, follow a $t$-distribution if the variance is unknown CLT (Central Limit Theorem): The sampling distribution of the sample mean is approximately normal for sufficiently large $n$ (could be $30$, could be up to $300$ for highly skewed distributions) The $t$-distribution can be considered Normal for degrees of freedom $&gt; 30$   You use the $z$-test if:   Population normal and variance known (for any sample size) Population normal, variance unknown and $n&gt;30$ (due to CLT) Population binomial, $np&gt;10$, $nq&gt;10$   You use the $t$-test if:   Population normal, variance unknown and $n&lt;30$ No knowledge about population or variance and $n&lt;30$, but sample data looks normal / passes tests etc so population can be assumed normal   So I'm left with:    For samples $&gt;30$ and $&lt;\approx 300$(?), no knowledge about population and variance known / unknown.   So my questions are:   At what sample size can you assume (where no knowledge about population distribution or variance) that the sampling distribution of the mean is normal (i.e. CLT has kicked in) when the sampling distribution looks non-normal? I know that some distributions need $n&gt;300$, but some resources seem to say use the $z$-test whenever $n&gt;30$... For the cases I'm unsure about, I presume I look at the data for normality. Now, if the sample data does looks normal do I use the $z$-test (since assume population normal, and since $n&gt;30$)? What about where the sample data for cases I'm uncertain about don't look normal? Are there any circumstances where you'd still use a $t$-test or $z$-test or do you always look to transform / use non-parametric tests? I know that, due to CLT, at some value of $n$ the sampling distribution of the mean will approximate to normal but the sample data won't tell me what that value of $n$ is; the sample data could be non-normal whilst the sample mean follows a normal / $t$.  Are there cases where you'd be transforming / using a non-parametric test when in fact the sampling distribution of the mean was normal / $t$ but you couldn't tell? My /boot partition is nearly full and I get a warning every time I reboot my system. I already deleted old kernel packages (linux-headers...), actually I did that to install a newer kernel version that came with the automatic updates.  After installing that new version, the partition is nearly full again. So what else can I delete? Are there some other files associated to the old kernel images?  Here is a list of files that are on my /boot partition:  :~$ ls /boot/ abi-2.6.31-21-generic         lost+found abi-2.6.32-25-generic         memtest86+.bin abi-2.6.38-10-generic         memtest86+_multiboot.bin abi-2.6.38-11-generic         System.map-2.6.31-21-generic abi-2.6.38-12-generic         System.map-2.6.32-25-generic abi-2.6.38-8-generic          System.map-2.6.38-10-generic abi-3.0.0-12-generic          System.map-2.6.38-11-generic abi-3.0.0-13-generic          System.map-2.6.38-12-generic abi-3.0.0-14-generic          System.map-2.6.38-8-generic boot                          System.map-3.0.0-12-generic config-2.6.31-21-generic      System.map-3.0.0-13-generic config-2.6.32-25-generic      System.map-3.0.0-14-generic config-2.6.38-10-generic      vmcoreinfo-2.6.31-21-generic config-2.6.38-11-generic      vmcoreinfo-2.6.32-25-generic config-2.6.38-12-generic      vmcoreinfo-2.6.38-10-generic config-2.6.38-8-generic       vmcoreinfo-2.6.38-11-generic config-3.0.0-12-generic       vmcoreinfo-2.6.38-12-generic config-3.0.0-13-generic       vmcoreinfo-2.6.38-8-generic config-3.0.0-14-generic       vmcoreinfo-3.0.0-12-generic extlinux                      vmcoreinfo-3.0.0-13-generic grub                          vmcoreinfo-3.0.0-14-generic initrd.img-2.6.31-21-generic  vmlinuz-2.6.31-21-generic initrd.img-2.6.32-25-generic  vmlinuz-2.6.32-25-generic initrd.img-2.6.38-10-generic  vmlinuz-2.6.38-10-generic initrd.img-2.6.38-11-generic  vmlinuz-2.6.38-11-generic initrd.img-2.6.38-12-generic  vmlinuz-2.6.38-12-generic initrd.img-2.6.38-8-generic   vmlinuz-2.6.38-8-generic initrd.img-3.0.0-12-generic   vmlinuz-3.0.0-12-generic initrd.img-3.0.0-13-generic   vmlinuz-3.0.0-13-generic initrd.img-3.0.0-14-generic   vmlinuz-3.0.0-14-generic   Currently, I'm using the 3.0.0-14-generic kernel. Short story identification: society partitioned off by high wall Reading another question today reminded me of a short story I read in the early 90s (probably written in 60s or 70s though). A society is blocked off by a really high wall; the story follows a girl who tries to get over the wall. I think she manages it with a hot air balloon. When she reaches the other side she meets an older man who had managed to scale the wall in his youth - his solution had been to use a flock of birds to carry him.  UPDATE  I seem to recall that it splits off an elite group of people - getting over the wall is like a rite of passage. Most people don't even bother to get over it (or even be concerned by its existence at all), but a few try. There might be some magic involved (on the other / better side), or they might just be more advanced technologically.  FINAL UPDATE  As pointed out in the answer, and confirmed by me re-reading the story, I was mistaken in a few details. The main protagonist is not a girl, it's a boy called Porgie. He doesn't use a balloon, it's a glider he made, assisted with a broom. Magic is involved, but it's on the inside, with technology on the outside. I'm using a class I've derived from DocumentPaginator (see below) to print simple (text only) reports from a WPF application. I've got it so that everything prints correctly, But how do I get it to do a print preview before printing? I have a feeling I need to use a DocumentViewer but I can't figure out how.  Here's my Paginator Class:  public class RowPaginator : DocumentPaginator {     private int rows;     private Size pageSize;     private int rowsPerPage;      public RowPaginator(int rows)     {         this.rows = rows;     }      public override DocumentPage GetPage(int pageNumber)     {         int currentRow = rowsPerPage * pageNumber;         int rowsToPrint = Math.Min(rowsPerPage, rows - (rowsPerPage * pageNumber - 1));         var page = new PageElementRenderer(pageNumber + 1, PageCount, currentRow, rowsToPrint)                        {                            Width = PageSize.Width,                            Height = PageSize.Height                        };         page.Measure(PageSize);         page.Arrange(new Rect(new Point(0, 0), PageSize));         return new DocumentPage(page);     }      public override bool IsPageCountValid { get { return true; } }      public override int PageCount { get { return (int)Math.Ceiling(this.rows / (double)this.rowsPerPage); } }      public override Size PageSize     {         get { return this.pageSize; }         set         {             this.pageSize = value;             this.rowsPerPage = PageElementRenderer.RowsPerPage(this.pageSize.Height);             if (rowsPerPage &lt;= 0)                 throw new InvalidOperationException("Page can't fit any rows!");         }     }      public override IDocumentPaginatorSource Source { get { return null; } } }   The PageElementRenderer is just a simple UserControl that displays the data (at the moment just a list of rows).  Here's how I use my Row Paginator  PrintDialog dialog = new PrintDialog(); if (dialog.ShowDialog() == true) {     var paginator = new RowPaginator(rowsToPrint) { PageSize = new Size(dialog.PrintableAreaWidth, dialog.PrintableAreaHeight) };      dialog.PrintDocument(paginator, "Rows Document"); }   Sorry for the code dump, but I didn't want to miss something relevant. Reading from text file until EOF repeats last line Class of sets of a given infinite cardinality This question was inspired by the question on .  From the discussion in the comments there, it seems there does not exist a set of all sets of a given cardinality.  To me, it seems easy to see that this is true for any nonzero finite cardinality $n$. Given any set $x$, you can always make a set of size $n$ by adding $n-1$ other sets to $x$ to make a set of size $n$, which exists by repeated use of the pairing axiom.   But how would you do this for infinite cardinalities? For suppose $\kappa$ is some given infinite cardinality. To show that the set of all sets of cardinality $\kappa$ does not exist, it seems you would have to show that for any set $x$, there exists a set of that size with $x$ as an element, and then you could take the union of that set to find the set of all sets, and thus a contradiction. But it doesn't seem reasonable to simply say, for a given set of size $\kappa$ if $x$ is in the set, we have no problem. If not, just take an element out of the set and put $x$ in. Something about that seems like it would not be allowed.  So how would you do this for infinite cardinalities? I get it after updating in Synaptic Manager  I recently did a clean install of Ubuntu 17.04 from 16.10.  error message:-  W: Download is performed unsandboxed as root as file '/var/cache/apt/archives/partial/samba-libs_2%3a4.5.8+dfsg-0ubuntu0.17.04.1_i386.deb' couldn't be accessed by user '_apt'. - pkgAcquire::Run (13: Permission denied) how to display the actual network traffic (wireless) in a terminal?  Additionally: Is it possible to add this info to the chart of top? Is there an AmpScript function that can be used in an equivalent manner to sql left, right and mid functions?   Thanks, Mark How to compute $\lim\limits_{n\rightarrow \infty} \{(2+\sqrt{3})^{n}\}$, where $\{x\}$ is the fractional part of $x$? I've stumbled upon the following problem:  $$\lim_{n\rightarrow \infty} \{(2+\sqrt{3})^{n}\}$$  where "{}" notates the fractional part.  I've never studied this kind of problem, there exists any reference that I could read about this type of problem?