Add Contents, List of Figures into TOC
Insert list of figures in the table of contents
I'm using Ubuntu Maverick and Virtual Box 3+. I have Windows 7 Ultimate. The problem is that it doesn't detect USB drives in Windows 7, but USB peripherals (mouse + keybord) are working.  I followed , but I can't find the user group vboxusers. How can I continue? I would also like to upgrade to the latest version without any risk (without losing my virtual hard disk drive). How do I recover my accidentally lost Windows partitions after installing Ubuntu? I have a Toshiba satellite A-200 laptop with a Vista OS on it with 4 NTFS partitions  (C:) Vista  (D:) Entertainment  (E:) Work  (F:) Sources   and I wanted to start using Ubuntu instead. So I tried it first from the live CD and everything was OK and all the partitions were shown and working and so I decided to install Ubuntu to replace Vista on the (C:) drive. After I did that I can no longer find my folders and files on the (D:), (E:), (F:) partitions and the only file system that is shown is one 198 GB although my HDD is 320 GB.  I can't access the lost data on the remaining 120 GB which I hope is still there and not totally lost  I am now working from the live CD but I am unable to install testdisk. Can I recover the Vista partitions by the product recovery CD to get my laptop back to the factory settings? Can I recover the NTFS partitions using a recovery program for Windows or will that make the problem worse?   I need these data badly as I don't have a backup for them. Supremum and Infimum Let $A$ be a nonempty set of real numbers which is bounded below. Let $-A$ be the set of all numbers $-x$, where $x \in A$. Prove that $\inf A = -\sup(-A)$.   We know that $-A$ is bounded above. Hence $\sup(-A)$ exists. So to proceed, one would show that $\inf A \leq -\sup(-A)$ and $\inf A \geq -\sup(-A)$? Or $-\inf A &gt; \sup(-A)$ and $-\inf A &lt; \sup(-A)$.  I get the sense that one can use the following fact as well: (i) Let $\alpha = \sup S$. If $\beta &lt; \alpha$ then $\beta$ is not an upper bound for $S$. How to enforce sender address to be "logged-in-user@example.org" in Postfix? I have set up a Postfix server with SMTP AUTH (STARTTLS on port 587). All my users are in the domain "example.org". I want to enforce the sender address to be "logged-in-user@example.org".  I learned that this can be achieved with the main.cf options  smtpd_sender_restrictions = reject_sender_login_mismatch, ... smtpd_sender_login_maps = hash:/etc/postfix/smtpd_sender_login_maps   with a login_maps file like:  a@example.org a b@example.org b c@example.org c ...   (see also ), but this would mean I'll have to edit the login_maps file every time I have a new user. I don't need such a flexible mapping: It should always be "logged-in-user@example.org". Is there an easier option? Programmatically get own phone number in iOS Is there any way to get own phone number by standard APIs from iPhone SDK? SPSite.Exists returning true for a just deleted site collection Short story - I have a process that creates some sitecollection, so to test it I keep deleting and recreating the same site over and over. The process includes a check with the istruction SPSite.Exits, done to check if the sitecollection is present or should be created.  Sometime, soon after I delete the site collection, SPSite.Exists will report it as still available. Is this a cache related problem? How do I recover files from an USB flash drive? Possible Duplicate:          I have a USB flash drive that claims it needs to be formatted every time I put it into my computer (Windows).  Yesterday the drive was healthy and had data on it.  The data is probalby still there.  Are there any free tools to restore the drive?  If not free, what tools are known to work in this situation? Prove there is an increasing sequence ($s_n$) of points in $S$ such that $\lim s_n = \sup S$. Let $S$ be a bounded set. Prove there is an increasing sequence ($s_n$) of points in $S$ such that $\lim s_n = \sup S$. Note: If $\sup S$ is in $S$, it’s sufficient to define $s_n = \sup S$ for all $n$.  What I have tried so far:  Let $M=\sup S, L = \lim\, s_n,\,|s_n-L|&lt;\epsilon/2$, then $M-\epsilon &lt; L- \epsilon/2 &lt; s_n &lt; M &lt; M+\epsilon$. But I get this based on $M &lt;= \epsilon+L$, because $\epsilon+L$ is an upper bound for $s_n$.   However, as $s_n$ are just points in $S$, so I don't know if it's sufficient to say $M$, which is the $\sup$ of $S$, is smaller than $L+\epsilon$. \overbrace and \underbrace with square bracket Problem:  Start page numbers from chapter one and also reflect this in the TOC.  Currently the code for TOC is:  \renewcommand{\contentsname}{Table of contents}  \setcounter{secnumdepth}{2} \setcounter{tocdepth}{2} \tableofcontents   I would appreciate if I can be pointed in the right direction. So far I have understood that you can use \chapter* in order not to include a chapter in the TOC.  Questions:  1) How would you force Latex to start numbering from chapter 1 and forward?  2) How can you start page numbering from the first chapter? Is it safe to cancel CHKDSK when it has been started without any parameters? I know that it is not a good idea to forcibly stop a chkdsk process that has been executed with parameters like /f and /r.   But is it safe to stop the process when it has been started simply by the chkdskcommand? Chkdsk prints out a lot of errors and is continuing very slowly.  I suppose it to should be safe to cancel the process since there should be only in read mode, correct? Since humans are not large in mass, do we exert enough gravitational force for a small object to orbit around us? (Assuming that the only gravitational force acting on the object is from the human). Using Newton's law of gravity and using myself as the human mass, I exert a 10^-8 force on a 1 kg object .5 meter away, but I am not sure if even this small of a force will be acceptable. What is the baseline "force" between two objects for 1 to orbit another?  Edit: I am not sure if this is a SpaceExchange question. When trying to add a bit more detail to a related , I realized I don't know how to specify which one of the available Bash word types to execute. According to help type there are five word types:   alias keyword function builtin file   It's possible for a word to have several types (true is just an example; a more commonly overridden word would be cd):  $ type -a true true is a shell builtin true is /bin/true   How do you force the execution of a specific synonym? So far, in order of precedence:   alias: This is a special case since it has precedence over all the other synonyms. Forcing this would only be useful when the command should fail if the alias is not defined.  $   keyword:  $   function:  $   builtin:  $ builtin true  file:  $ command true $ $(which true) $ /bin/true    :   Quoting a word excludes aliases and keywords. That is,  $ 'true'   will run only the function, builtin or file. Keras CNN with low/constant accuracies How can I log into a different Google account? It only shows one of my Google accounts. I want to log into a different one but I don't want them connected in any way. What do I do? Why do we use "dried up" instead of just "dried"? The creek has dried up.   In this example sentence, you should say "dried up." If you say just "dried," it sounds incomplete. Is this an example of an idiom or is there a grammatical rule governing this instance? If so, what is it? What levels-up Psi-abilities? How long do seasons last? In the Kittens Game, how long (in real life minutes) do seasons last? Let $\omega := dx \wedge dy$ denote the standard area form on $\mathbb{R}^2$. As the question title suggests, does there exist a $1$-form $\alpha$ with $d\alpha = \omega$? Why does Axii sign not work?