How can I import an HTML table into LaTeX? I have many files  imported, so I can't convert each file to LaTeX.
I would like a way to convert a document from HTML to LaTeX on a Windows platform. What is my best option?
How to clear the BIOS security password on this notebook? I recently got an Acer Aspire E11 (E3-112m) and in order to install another OS I had to set a Supervisor password, so I used a well known password to me, the problem is that such password contains a special character ! which the password prompt won't let me input, though it let me when I had to set the password (buggy prompt I believe). Now everytime I need to change something in the BIOS I have to fail 3 times and go to  to generate a master key.  I have already tried several different methods to clear it:   Removing the CMOS battery Looking for the reset jumper (which doesn't even exist).   I also noticed there were 2 weird buttons on the front and back sides of the motherboard, I don't know what they are for but I also pressed them (while both the CMOS and the regular battery were disconnected). All of this without luck, the password just won't reset (though the RTC did).  Are there other ways to reset the Supervisor/Admin password on this model? On my Windows 7 system I installed via  from Fonts.com:   The font does not appear in C:\Windows\Fonts. However, it shows up in certain desktop applications, for example  as: Sabon Next Com Display  My intention was to use the font in a LaTeX document test.tex:  \documentclass{article} \usepackage{polyglossia} \setromanfont{Sabon Next Com Display}  \begin{document} Hello World! \end{document}   Unfortunately, xelatex test.tex fails:  […] Couldn't find `Sabon Next Com Displ.cfg' miktex-maketfm: No creation rule for font "Sabon Next Com Display".   !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! ! ! fontspec error: "font-not-found" !  ! The font "Sabon Next Com Display" cannot be found. !  ! See the fontspec documentation for further information. !  ! For immediate help type H &lt;return&gt;. !...............................................    l.4 \setromanfont{Sabon Next Com Display}                                            % Sabon Next Com Display, SabonNex...  ?    Can XeLaTeX even work with fonts installed via SkyFonts? If not, what could be a workaround? Compress a directory using tar/gz over SSH to local computer? I'd like to essentially tar/gz a directory on a remote machine and save the file to my local computer without having to connect back into my local machine from the remote one. Is there a way to do this over SSH? The tar file doesn't need to be stored on the remote machine, only on the local machine. Is this possible? Capturing Blue Screen of Death (BSOD) screen Possible Duplicate:          Sometimes I get a BSOD screen for a split second and I have no chance to see the cause of it. It also happens when I am not at the computer. The event log doesn't have enough information. Is there a way or tool that captures the screen when it happens so I can look at the cause later.  I already did a memory diagnostics test so that's not the problem. Cleric build to maximize melee damage and spell healing Is it legal to dribble above shoulder height? I heard that while dribbling the ball, if the ball rises above shoulder level then it is a turnover. I don't have any idea about this rule. Any $B \subset \{10,11,...,99\}$, with $|B| =10$ has two subsets such that $\sum_{a \in B_1} a = \sum_{b \in B_2} b$ Let there be $B \subset \{10,11,...,99\}$, with $|B| =10$. I need to prove, using the pigeonhole principle, that there are at least two disjoint subsets of $B$ (and none empty) where the sums of their elements are identical. I.e. $\exists B_1 \ne \varnothing, B_2 \ne \varnothing$ such that $B_1 \bigcup B_2 = B$, $B_1 \bigcap B_2 =\varnothing$ and $$\sum_{a \in B_1} a = \sum_{b \in B_2} b$$ Prove $f=1+x+x^2+x^3+\cdots+x^n$ has no multiple roots. Prove $f=1+x+x^2+x^3+\cdots+x^n$ has no multiple roots.  My attempt:  Consider the polynomial $g=(x-1)(1+x+x^2+x^3+\cdots+x^n)$  As $f\mid g, g$ all the roots of $f$ are roots of $g$.  This means I have to prove the statement:  If $c$ is a multiple root of $f \Longrightarrow c$ is multiple a root of $g$.  Equivalently:  If $c$ is not a multiple root of $g \Longrightarrow c$ is not a multiple root of $f$.  I'll try to prove this last statement:  Suppose $\exists c$ such that $c$ is a multiple root of $g$, then   $$g(c)=0 \implies g'(c)=0$$  $$ g=(x-1)(1+x+\cdots+x^n) \implies  g'=nx^n $$ $$ g'(c)=nc^n=0 \implies c=0 $$ But  $$ g(0)\neq 0 $$ And we've found the contradiction: $\not \exists c: g(c)=g'(c)=0$. Then $f$ has no multiple roots.  Is this correct?   Also: Assuming this is correct, is it possible to prove $\sum_{k=0}^n \frac {x^n}{n!} $ has no multiple roots in a similar manner? Which Pokémon can speak with humans? Inspired by Detective Pikachu, I was wondering which Pokémon can "speak" with humans.  I would like to include  Pokémon like Meowth in the anime that speak English/Japanese with their mouths, Pokémon like Mewtwo in the anime/movies that speak telepathically, or other Pokémon we've seen like Lugia/Entei that seem to speak without moving their mouths but still out loud for all to hear (presumably).  The format doesn't matter (manga, anime, video games). And while this is inspired by Detective Pikachu, it's not about it, as the movie is not out yet      And it seems like the human character has the special ability, not the Pikachu A Riemann integrable function must have infinitely many points of continuity In class we've seen that $a$ (the weights) must satisfy $$X^T (y-Xa) =0$$  Here $X$ is a $(n\times d)$ matrix (so we have $n$ samples in $\mathbb R^d$)  let's denote the residuals $r = y-Xa$. In our class notes, it is written that     The normal equations require the residuals to be orthogonal to each of the columns of $X$.   Why?     Therefore, the solution of the linear regression is a projection of $y$ onto the subspace spanned by $v_1 , \ldots , v_d$ (the columns of $X$)   Can you please explain this? How to define a bijection between $(0,1)$ and $(0,1]$? How to define a bijection between $(0,1)$ and $(0,1]$?   Or any other open and closed intervals?   If the intervals are both open like $(-1,2)\text{ and }(-5,4)$ I do a cheap trick (don't know if that's how you're supposed to do it): I make a function $f : (-1, 2)\rightarrow (-5, 4)$ of the form $f(x)=mx+b$ by \begin{align*} -5 = f(-1) &amp;= m(-1)+b \\ 4 = f(2) &amp;= m(2) + b \end{align*} Solving for $m$ and $b$ I find $m=3\text{ and }b=-2$ so then $f(x)=3x-2.$  Then I show that $f$ is a bijection by showing that it is injective and surjective. How to change the "User License" type for customer portal users using a script? Can I have a mathematical equation within a caption? I'd like to have an eqnarray environment (or equivalent) within a table caption. If I do this naively,  \begin{table*}   % table stuff   \caption{\label{tab:my_tab}     \begin{eqnarray}       a &amp;=&amp; b \\ c &amp;=&amp; d     \end{eqnarray}   } \end{table*}   LaTeX falls over with LaTeX Error: \begin{table*} ended by \end{eqnarray}. How can I get what I want (I don't mind no equation numbers)? What is the best way to identify outliers in multivariate data? Suppose I have a large set of multivariate data with at least three variables. How can I find the outliers? Pairwise scatterplots won't work as it is possible for an outlier to exist in 3 dimensions that is not an outlier in any of the 2 dimensional subspaces.  I am not thinking of a regression problem, but of true multivariate data. So answers involving robust regression or computing leverage are not helpful.  One possibility would be to compute the principal component scores and look for an outlier in the bivariate scatterplot of the first two scores. Would that be guaranteed to work? Are there better approaches? Why are we still using CPUs instead of GPUs? It seems to me that these days lots of calculations are done on the GPU. Obviously graphics are done there, but using CUDA and the like, AI, hashing algorithms (think bitcoins) and others are also done on the GPU. Why can't we just get rid of the CPU and use the GPU on its own? What makes the GPU so much faster than the CPU? Can I change a user's keyboard input? How can I find the value of the sum $\sum_{k=1}^{\infty}\frac{k^n}{k!}$? for example for $n=6$, we have $$\sum_{k=1}^{\infty}\frac{k^6}{k!}=203e.$$ Programmatically Create X509 Certificate using OpenSSL I have a C/C++ application and I need to create a X509 pem certificate containing both a public and private key.  The certificate can be self signed, or unsigned, doesn't matter.  I want to do this inside an app, not from command line.  What OpenSSL functions will do this for me?  Any sample code is a bonus! A mathematically mature introduction to Turing Machines and Computability [reference-request] In the computer science course for mathematicians held at my university Turing Machines have been presented very briefly. So much so that I didn't quite get why they are relevant to mathematics. I did understand what a Turing Machine is, but I feel that the presentation given was (for schedule reasons) quite naive and simplified. So I would like to ask if you can point out a good reference for a mathematically mature introduction to turing machines and computability.