displaying number of search results on google results page
Is there a kind of microdata or markup that creates "results x of y" in search results
Idiom that means trying to save something that is beyond saving It's on the tip of my tongue.  Example: "Replacing the hard drive of this computer would be [idiom]. It's going to fail completely soon enough." Unit testing a method that calls another method I know that it can be done with graphics packages like TikZ, but it seems to be a bit of an overkill. And for those not already familiar with the TikZ system, learning it can be a bit of a barrier. So my question is     Assuming the advanced graphics capabilities are not necessary, and I just need a bare-bones flow chart (which should be implementable just using the picture environment), is there a LaTeX package for simply making a flow chart? Why aren't orbitals symmetric? App crashes, dock icon remains, can't reboot, yet no process in ps aux to kill Good reasons to prohibit inheritance in Java? Restrict the scope of a command to the execution of another command In Interstellar, what do Murph and NASA do to save humanity after solving Brand's equation? Do they get the entire human race on giant space ships and transport them to a habitable planet? (How exactly do they do  this?)  If yes, is this habitable planet Edmunds' (the one that Amelia lands on)? How to normalize my db schema for a quiz application? I am putting together a quiz application.   (I'm calling each quiz a "challenge")  I have a "challenge" table and a "challenge_question" table which is pretty straightforward.  challenge table: id name num_questions (I want to randomize and only display a certain number of Qs per each challenge)  challenge_question table: id challenge_id question (text of the question) required (some questions will be required to be displayed per each challenge) question_type (here I indicate what type of question: Mult. choice, T/F, Ordering, or Fill-in-the-blank)   Where I'm having trouble in normalization is with the types of question options:  Multiple choice, true/false, ordering, and fill-in-the-blank. I wonder, should I have a separate table for each type of challenge-question-option? Or is it possible to combine these into one somehow..  If I combined all possible options into a single table, it might look be something like this  challenge_options table: id challenge_question_id option (text field, can be used for both multiple choice and for fill-in-the-blank style questions) is_true (boolean field for true/false questions) is_correct (boolean, used to determine multiple choice answer) ordering_option_1  ordering_option_2 ordering_option_3 ordering_option_4 (these ordering fields would store the correct sequence of an ordering style of question)   This really strikes me as less than ideal.  Actually, I don't see how the ordering_options would work out correctly at all.  Wouldn't I need to have each of those be a separate option?  Surely there must be a better way.  Any suggestions/criticisms or alternate approaches? Remove Windows entry in GRUB menu I did a dumb thing... I forgot that Ubuntu 10.04 (Lucid Lynx) switched to &nbsp;2 which puts a ton of *.mod files (kernel modules) in /boot/grub. I thought they were soundtrack files put there erroneously, and I moved them. Needless to say, the next reboot was traumatic. I was presented with something I had no memory of ever seeing... a 'grub rescue>' prompt.  With the help of  however, I was able to recover...   I discovered that GRUB rescue does not have 'cd', 'cp' or any other filesystem commands except its own variation of 'ls'. So first I had to find the partition with the /boot directory containing vmlinuz file and other boot image files... (approximation from memory of failed attempts, as well as blank lines for clarity, added 2014-07-10 by docsalvage)    grub rescue&gt;  ls   (hd0,4) (hd0,3) (hd0,2) (hd0,1)    grub rescue&gt;  ls (hd0,4)/boot ... some kind of 'not found' message  grub rescue&gt;  ls (hd0,3)/boot ... some kind of 'not found' message  grub rescue&gt;  ls (hd0,2)/boot ... grub ... initrd.img-2.6.32-33-generic ... vmlinuz-2.6.32-33-generic   I found a /boot directory containing the vmlinuz file vmlinuz-2.6.32-33-generic on partition (hd0,2). Then I manually booted from the 'grub rescue>' prompt. The following commands will...   Set the root to use the /boot directory on partition (hd0,2). Load kernel module linux. Set that module to use the kernel image vmlinuz-2.6.32-33-generic. Set initrd(initialize RAM disk) to use the image initrd.img-2.6.32-33-generic. Boot Linux.  grub rescue&gt;  set root=(hd0,2)/boot   grub rescue&gt;  insmod linux   grub rescue&gt;  linux (hd0,2)/boot/vmlinuz-2.6.32-33-generic root=/dev/sda2 grub rescue&gt;  initrd (hd0,2)/boot/initrd.img-2.6.32-33-generic   grub rescue&gt;  boot    This boots and crashes to the BusyBox prompt which DOES have some rudimentary filesystem commands. Then I moved the *.mod files back to the /boot/grub directory...  busybox&gt;  cd /boot   busybox&gt;  mv mod/* grub busybox&gt;  reboot  The reboot was successful, but that was a lot of work.   Is there an easier way? Is 2h 45m enough for a layover in Newark Liberty International transferring from an international to a domestic flight (Terminal B → Terminal C)? Proving that $\frac{\phi^{400}+1}{\phi^{200}}$ is an integer. How do we prove that $\dfrac{\phi^{400}+1}{\phi^{200}}$ is an integer, where $\phi$ is the golden ratio?  This appeared in an answer to a  I asked previously, but I do not see how to prove this.. Avoiding jumping frames in beamer given a polynomial $p(x,y)$ from $\mathbb Z[x,y]$. I want to substitute $x=1$ leaving $y$ as it is. The command Value(p,[1,y]) does not work. Can you give me a hint?  After that it gets a little more complicated. Let  $$p(x,y)=x^6+y^6$$ After substituting $x=1$ we have $p(1,y)=1+y^6$. Given a natural number $j$. I want to find all expressions $y^j$ in $p$ and substitute these $y^j$ by $1$ and the others by $0$. In this case (and for $j=6$) we would get $1+1=2$. If $$p(x,y)=x^4y^2+x^2y^6$$ we should get $0+1=1$. Is there any way to do this?  Thanks for reading! edit: Well, it turns out I used the function Value wrong. The right code for my problem would be Value(p,[x,y],[1,y]). So my first question is solved. Rendering smoke in Cycles? How to delete a file from Time Machine backups in Big Sur? Apparently ;-) the standard containers provide some form of guarantees.  What type of guarantees and what exactly are the differences between the different types of container?  Working from  (about ) I have come up with this:  Container Types: ================ Container:     Forward Container         Reverse Container             Random Access Container     Sequence         Front Insert Sequence         Back  Insert Sequence     Associative Container         Simple   Associative Container         Pair     Associative Container         Sorted   Associative Container         Multiple Associative Container  Container Types mapped to Standard Containers =============================================  std::vector:    Sequence    Back        Sequence                    Forward/Reverse/Random Container std::deque:     Sequence    Front/Back  Sequence                    Forward/Reverse/Random Container std::list:      Sequence    Front/Back  Sequence                    Forward/Reverse Container std::set:       Sorted/Simple/Unique    Associative Container       Forward Container std::map:       Sorted/Pair/Unique      Associative Container       Forward Container std::multiset:  Sorted/Simple/Multiple  Associative Container       Forward Container std::multimap:  Sorted/Pair/Multiple    Associative Container       Forward Container   Container Guarantees: =====================                                                                                    Simp                                                                                   or                           For   Rev  Rand        Front  Back  Assoc        Sort   Mult                     Cont: Cont: Cont Cont: Sequ: Sequ:  Sequ: Cont:        Cont:  Cont: Copy    Const:      O(n) Fill    Const:                             O(n) begin()             O(1) end()               O(1) rbegin()                        O(1) rend()                          O(1) front()                                    O(1) push_front()                                     O(1) pop_front()                                      O(1) push_back()                                             O(1) pop_back()                                              O(1) Insert()                                                                          O(ln(n)) Insert: fill                               O(n) Insert: range                              O(n)                                   O(kln(n)+n) size()              O(n) swap()              O(1) erase key                                                     O(ln(n)) erase element                                                 O(1) erase range                                                   O(ln(n)+S) count()                                                       O(log(n)+k) find()                                                        O(ln(n)) equal range                                                   O(ln(n)) Lower Bound/Upper Bound                                                    O(ln(n)) Equality                  O(n) InEquality                O(n) Element Access                       O(1) Accelerating electrons via microwaves In Synchrotrons I think they use microwaves to accelerate the electrons bundles that fly through-how does putting a microwave through a cavity accelerate an electron? I know that the Electric and Magnetic fields could and do have an effect on the electron, but if the radiation is moving parallel to the electron, wouldn't the force be perpendicular? Also, how exactly does the microwave radiation look in the vacuum chamber? Are the two ends constant nodes? What is $dx$ in integration?