Bootstrapping the sample range - When the bootstrap fails
What are examples where a "naive bootstrap" fails?
Why does jQuery or a DOM method such as getElementById not find the element? Ralink MT7601U (148f:7601) Wi-Fi adapter installation I am trying to install a Ralink wifi adapter in Ubuntu Desktop 14.04.  The system is not detecting the wifi.   lsusb lists the device as:  Bus 002 Device 004: ID 148f:7601 Ralink Technology, Corp.  I have the rt2800 USB driver listed in "/etc/modules"; Following some instructions on the web, I tried this command:  echo 148F 7601 | sudo tee /sys/bus/usb/drivers/rt2800usb/new_i  lsmod | grep rt2800 returns the following:  rt2800usb              26581  0  rt2x00usb              20041  1 rt2800usb rt2800lib              83150  1 rt2800usb rt2x00lib              48886  3 rt2x00usb,rt2800lib,rt2800usb mac80211              545990  3 rt2x00lib,rt2x00usb,rt2800lib crc_ccitt              12627  1 rt2800lib Reverse (parse the output) of Arrays.toString(int[]) How do you add a timer to a C# console application Just this - How do you add a timer to a C# console application? It would be great if you could supply some example coding. The following will cause infinite recursion on the == operator overload method      Foo foo1 = null;     Foo foo2 = new Foo();     Assert.IsFalse(foo1 == foo2);      public static bool operator ==(Foo foo1, Foo foo2) {         if (foo1 == null) return foo2 == null;         return foo1.Equals(foo2);     }   How do I check for nulls? Show that an algebraically closed field must be infinite.    Answer  If F is a finite field with elements $a_1, ... , a_n$ the polynomial $f(X)=1 + \prod_{i=1}^n (X - a_i)$ has no root in F, so F cannot be algebraically closed.  My Question  Could we not use the same argument if F was countably infinite? Couldn't we say that if F was a field with elements $a_1, a_2, ... $ then the polynomial $f(X) = 1 + \prod_{i=1}^{\infty} (X - a_i)$ does not split over F?  Thank you in advance Is there a systematic way to obtain all conserved quantities of a system? How to make a circular array using offset object as center? How to show that $C=C[0,1]$ is a Banach space Let $C=C[0,1]$ be the space of all continuous functions on $[0,1]$. Define $\|f \|=\max \ |f(x)|$. I want to show that $C$ is a Banach space.     Below is my attempt and I was wondering if it's ok.    I know I have to show that $C$ is a complete normed space. Clearly, $\|f\| \geqslant 0$ and $\|f\|=0 \Leftrightarrow f=0$. $\|cf \|=\max~|cf(x)|=|c|\max |f(x)|=|c| \cdot \|f\|$. $\|f+g\|=\max~|f(x)+g(x)|\leq \max~|f(x)|+\max~|g(x)|=\|f\|+ \|g\|$. So $C$ is a normed space.   Next, I show that every Cauchy sequence in $C$ is convergent. Let $\{f_n\}$ be a Cauchy sequence in $C$. Let $\varepsilon \gt 0.$ Then $\exists$ an $N_1$ such that $$ \max~|f_n(x)-f_m(x)| \lt \frac{\varepsilon}{2}$$ for $n, m \gt N_1$ and $x\in[0,1]$.  But there is a subsequence $f_{k_n} $, which converges to $f$. So $\exists$ an $N_2$ such that $$ \max~\left|f_{k_n} - f\right|\lt \frac{\varepsilon}{2}$$ for each $n\gt N_2$.  Now Let $N = \max\{N_1, N_2\}$, if $n \gt N$ then $k_n \geqslant n\gt N$. So we have $$ \max~\left|f_n(x) - f(x)\right| \leqslant \max~\left|f_n - f_{k_n}\right| + \max~\left| f_{k_n} - f\right| \lt\frac{\varepsilon}{2} + \frac{\varepsilon}{2} = \varepsilon.$$  Thus, $\|f_n-f\| \to 0$ as $n\to \infty$. $\quad \square$  Thanks. Is there a place on the internet where I could find actual Star Trek episode scripts? Through the years I have purchased a few Star Trek scripts. I even have a DS9 script a buddy of mine mistakenly took off set and dazzled me with at Christmas years ago. As neat as those are to own, they are impossible to search. Is there a place on the internet where the Star Trek show or movie scripts can be obtained in digital format?  (Sometimes I remember a quote and would love to find it. From time to time the internet delivers. Occasionally it does not. I want to have a resource to find quotes as I think of them.) Compare double in VBA precision problem I have trouble comparing 2 double in Excel VBA  suppose that I have the following code  Dim a as double Dim b as double a = 0.15 b = 0.01   After a few manipulations on b, b is now equal to 0.6  however the imprecision related to the double data type gives me headache because  if a = b then  //this will never trigger end if   Do you know how I can remove the trailing imprecision on the double type? This works as expected:  $ echo a b c | xargs --replace="{}" echo x "{}" y x a b c y   This does too:  $ echo a b c | xargs --max-args=1 echo x x a x b x c   But this doesn't work as expected:  $ echo a b c | xargs --max-args=1 --replace="{}" echo x "{}" y x a b c y   And neither does this:  $ echo a b c | xargs --delimiter=' ' --max-args=1 --replace="{}" echo x "{}" y x a y x b y x c  y   I expected this output:  x a y x b y x c y   As a workaround, I am using printf and two xargs, but that is ugly:  $ echo a b c | xargs printf '%s\0' | \ &gt; xargs --null --max-args=1 --replace="{}" echo x "{}" y x a y x b y x c y   Any idea why this is happening? Why is $H(k\mathbin\Vert x)$ not a secure MAC construction? If $H(m)$ is a secure hash function, can't we implement a MAC using $H(k\mathbin\Vert m)$?  However, it seems the more widely used MACs, such as NMAC and  (both originally defined in ) use a much more complicated scheme. Why is this concatenation scheme insecure? Can anyone please give an example of why the following definition of $\displaystyle{\lim_{x \to a} f(x) =L}$ is NOT correct?:  $\forall$ $\delta &gt;0$ $\exists$ $\epsilon&gt;0$ such that if $0&lt;|x-a|&lt;\delta$ then $|f(x)-L|&lt;\epsilon$  I've been trying to solve this for a while, and I think it would give me a greater understanding of why the limit definition is what it is, because this alternative definition seems quite logical and similar to the real one, yet it supposedly shouldn't work. How do I convert my PhD dissertation so that it can be published as a book? I have just completed a PhD by research, which I think has some merits in being available as a book (This is, of course, my personal opinion). The research cuts across several fields (e.g. sociology, public policy).  I am wondering what I need to do to take the next step.  In particular:   How do you turn an academic piece like the dissertation (which is written for the examiners) into a book (which is for the general public)? How do I find publishers who specialise in my field? Are there any valid reasons to not rollover a former 401(k) when changing jobs?  I have several little ones that I never quite got around to rolling together - with an upcoming job change, should they all be combined into my new employer's retirement plan?  If not, what else might be considered? What are the eigenvalues of $\operatorname{ad}x$? Let $x\in \operatorname{gl}(n,F)$ have $n$ distinct eigenvalues $a_1,\ldots,a_n$ in $F$. Prove that the eigenvalues of $\text{ad }x$ are precisely the $n^2$ scalars $a_i-a_j$ ($1\leq i,j\leq n$), which of course need not be distinct.   So we can represent $x$ by an $n\times n$ matrix $X$. We have $Xv_1=a_1v_1,\ldots, Xv_n=a_nv_n$ for eigenvectors $v_1,\ldots,v_n$.   Now, $\operatorname{ad}x$ takes $y\in \operatorname{gl}(n,F)$ to $xy-yx$. I need to show that some $y$ is taken to a scalar multiple of itself, where that scalar is $a_i-a_j$. What could be that $y$? xticks steps using Pgfplots / dateplot How are cellphone IP addresses assigned? Well structured URLs vs. URLs optimized for SEO Let’s take an example of a movie site. So a well structured set of URLs for this site can be:     Movie page - example.com/movies/the-matrix Review for movie - example.com/movies/the-matrix/reviews Trailers for movie - example.com/movies/the-matrix/trailers Specific trailer for movie - example.com/movies/the-matrix/trailers/trailer1   where it’s possible to navigate the resource even by directly deleting/appending resource name seamlessly.  For SEO purpose I read somewhere that for two given pages, Google will prefer the page which have search query up in the URL hierarchy among other things. So for the given 2 URLs and the query "the matrix trailer"    example.com/movies/the-matrix/trailers example.org/trailers/the-matrix/    `     Google might prefer the second URL as it has the keyword "trailer" at first level comparing to first URL which has "trailer" at 3rd level (a resource deeper in URL hierarchy may be less important).    If it is correct, one may be tempted to create URL hierarchy somewhat like      Movie page - example.com/movies/the-matrix Review for movie - example.com/reviews/the-matrix/ Trailers for movie - example.com/trailers/the-matrix/ Specific trailer for movie - example.com/trailers/the-matrix/trailer1     which will break the seamless hierarchy.    My questions are:   Is it true that resource deeper in URL hierarchy is tend to be less important when comparing to URLs of other site?   Is sacrificing meaningful, seamless hierarchy worth for this SEO optimization?