I frequently use the water displacement method to seal ziploc freezer bags when I sous vide. I can get maybe 99% of the air out, but technically the bag is not under vacuum. If I clip the top of the bag to the side of my container, any air pockets that emerge collects at the top, and the meat is entirely in contact with the bag and immersion bath. Alternatively, if I seal the bag with a marinade, there are no pockets of air between the meat and the immersion bath.   I can't imagine that the temperature transfer can be any more effective when vacuum sealed. So why does a site like SeriousEats still suggest that a vacuum sealer is needed for best results with longer cooking times?    update from   In the context of food storage in plastic bags, SeriousEats claims, "excess air causes oxidation that can develop into off flavors or promote spoilage." But I never sous vide for the freezer, it gets served when done.   There was a comment that asked if food contamination might occur for cooking times longer than 48 hours, but it was never answered.   What is the science behind this statement? How much residual air is "too much"?   If the bag remains submerged, does not leak, and the food in full contact with the water bath, is that enough to duplicate the benefits of a true vacuum seal?  update 2  Also, what is the scientific impact of trapping small amounts of residual air in a pocket above the water bath?  This assumes that there is still a very strong thermal coupling between the water bath and sous vide item.   In the photo below, you can see at least a 2inch gap between the air pockets above water level and the actual short ribs. From a heat transfer perspective, I can't imagine that a vacuum sealed bag can perform significantly better—certainly not relative to a 48hr cook time. Is there a possibility of bacterial contamination?
Modernist Cuisine recommends that for longer sous vide cooking (times greater than 36 hours) that bags are vacuum sealed rather than just using the water displacement method to remove the air from a ziploc bag.  What is the reason for this? Will I be losing something essential if I just use a regular ziploc bag without vacuum sealing?
How do we know photons have spin 1? Can a multiclass sorcerer/cleric use the Metamagic class ability with non-sorcerer spells? For example, using Twinned Spell when casting cure wounds to heal two creatures instead of just one? how can i show site logo, name and slogan Separately in custom area in my site theme, I now use this code to display theme, buts this code don't allow me to edit each of them Separately.  {{ page.header }} I have binary data in an unsigned char variable. I need to convert them to PEM base64 in c. I looked in openssl library but i could not find any function. Does any body have any idea? When the loop is the figure shown below will be rotated in clockwise direction the the slip ring connected to the red segment of the loop will give us the positive voltage and the slip ring connected to the black segment of the loop will give us negative voltage according to the Flemings right hand rule.  What if the loop is rotated in counter clockwise direction ? Will the slip rings provide us the same polarities which they were giving when the loop was moving clockwise ?  Plus  The voltage from the loop is given by the equation.  V(t) = Vmaximum * sin (theta)  Where theta is the positive angle the red segment makes in the clockwise direction or in counter clockwise direction from this position ? Passing world as parameter results nullpointer How to make a blank page in Google Chrome at start-up? Does Google Chrome has anything similar to about:blank page in IE and Firefox? I did not find any suitable page mentioning this? PS: I tried about:blank but it looked like Chrome is trying to load something before showing blank page... $a _{1} = \frac{1}{2}, a _{2} = 1, a _{n}= \frac{1}{2} a_{n-1} + \sqrt{a _{n-2} }$  Show by the induction that it's $\le 4$ and also by the induction that $a_{n+1}-a_n \ge 0$  If it comes to first I don't know what to do and if it comes to second I tried many different ways but I couldn't prove it. Decision Tree in LaTeX with TikZ Grid line doesn't have to be included     \documentclass[10pt]{beamer}  \usetheme{default}  \usepackage{graphicx}  \usepackage{amssymb,amsmath}  \usepackage{tikz}  \usetikzlibrary{matrix}  \usepackage{adjustbox}  \usepackage{caption} \ usepackage{subcaption}   \setbeamercolor{title}{fg=black}  \setbeamercolor{subtitle}{fg=gray}  \setbeamercolor{footlinecolor}{fg=white,bg=green}  \setbeamertemplate{footline}[text line]{% \parbox{\linewidth}{\vspace*{-10pt} \textit{Where Wall Street Goes to School} \hfill \insertpagenumber} } \setbeamertemplate{navigation symbols}{} –  \begin{tikzpicture}[&gt;=stealth,sloped][scale=0.8]  \matrix (tree) [matrix of nodes, minimum size=0.25cm, column sep=2cm, row sep=1cm, ]  { &amp; $C_{i+1,j+1}$ \\ $C_{i,j}$ &amp;$C_{i+1,j}$ \\  &amp; $C_{i+1,j-1}$ \\   };  \draw[-&gt;] (tree-3-1) -- (tree-1-3) node [midway,above] {};  \draw[-&gt;] (tree-3-1) -- (tree-3-3) node [midway,above] {};  \draw[-&gt;] (tree-3-1) -- (tree-5-3) node [midway,below] {};  \end{tikzpicture}  \end{adjustbox} – Reverse Cauchy Schwarz for integrals Let $f,g$ be two continuous positive functions over $[a,b]$ Let $m_1$ and $M_1$ be the minimum and maximum of $f$ Let $m_2$ and $M_2$ be the minimum and maximum of $g$ Prove that $$\sqrt{\int_a^bf^2 \int_a^b g^2}\leq \frac{1}{2}\left(\sqrt{\frac{M_1M_2}{m_1m_2}}+\sqrt{\frac{m_1m_2}{M_1M_2}}\right)\int_a^bfg$$  I can't make any significant progress on this one... Thanks for any hint. Uninstall a program installed with Wine I am using Ubuntu 11.10. By using wine software i installed some software like nimbuzz and ibibo messenger. Both the programs are not working and showing the bug as We're sorry, but an unknown error has caused ibibo Messenger to close.  So I wanna uninstall those.   How to uninstall those type of programs which I installed through Wine? How do I find a command if I don't know its name? Assume that $f$ be continuous on $\mathbb{R}$, $f'(x)$ exists for all $x\neq 0$, and $\lim_{x\rightarrow 0} f'(x)=1$. We need to show $f'(0)$ exist and is equal to $1$.  $f'(0)=\lim_{x\rightarrow 0}\frac{f(x)-f(0)}{x}$, $\lim_{x\rightarrow 0}f'(x)=1\Rightarrow\lim_{x\rightarrow 0}\lim_{h\rightarrow 0}\frac{f(x+h)-f(x)}{h}=1$...am I going in the right direction? Please help. Unique pair of positive integers $(p,n)$ satisfying $p^3-p=n^7-n^3$ where $p$ is prime Q. Find all pairs $(p,n)$ of positive integers where $p$ is prime and $p^3-p=n^7-n^3$.   Rewriting the given equation as $p(p+1)(p-1)=n^3(n^2+1)(n+1)(n-1)$, we see that $p$ must divide one of the factors $n,n+1,n-1,n^2+1$ on the $\text{r.h.s}$.   Now, the $\text{l.h.s}$ is an increasing function of $p$ for $p\ge1$. This implies that for any given $n\ge1$, there is exactly one real $p$ for which $\text{l.h.s}=\text{r.h.s}$. For $p=n^2$, we get $\text{l.h.s}=n^6-n^2&lt;n^7-n^3=\text{r.h.s}.$ This means that either $p&gt;n^2$ or $p&lt;n^2$ must hold.  Assuming $p&gt;n^2$, it follows that the prime $p$ cannot divide any of $n,n+1,n-1$. So $p$ must divide $n^2+1$ and hence $p=n^2+1\quad (\because p&gt;n^2)$.  Substituting the value of $p$ in the given equation we get, $n^2+2=n^3-n\implies n^3-n^2-n=2$. As the factor $n$ on the $\text{l.h.s}$ must divide $2$, the above equation has a unique integer solution $n=2$.  Finally, we get $(5,2)$ as the solution to the given equation.      But how do I conclude this is the only solution possible? Also, why does'nt $p&lt;n^2$ (the case which I ignored) hold? As a bonus question, I would like to ask for any alternative/elegant solution (possibly using congruence relations) to the problem. Exact relationship between electric field and intensity I often see $I(t)\propto |E(t)|^2$. What is the exact form ? Which constants are missing to make this an equality and why are they so often omitted ? Precision of Coulomb's law Up to which precision has the coulomb law proven to be true? I.e.  if you have two electrons in a vacuum chamber, 5 meters appart, have the third order terms been ruled out? Are there any theoretical limits to measure the precision ( Planck's constant?). Obviously there are practical limitations ( imperfect vacuum, cosmic rays, vacuum fluctuation). Still, does anyone know what was the smallest amount ever correctly predicted by that law?    Edit : Summary  On the high end of the energy spectrum a precision of 10^-16 has been shown ( 42 years ago )  For electron point charges at large distances the law might brake down due to practical reasons.  For moving particles QED gives a correction to the law: /usr/sbin/grub never finishes I did apt-get upgrade it never finishes at this point:  Searching for GRUB installation directory ... found: /boot/grub Searching for default file ... found: /boot/grub/default Testing for an existing GRUB menu.lst file ... found: /boot/grub/menu.lst Searching for splash image ... none found, skipping ... Found kernel: /boot/vmlinuz-3.2.0-24-virtual Updating /boot/grub/menu.lst ... done  You already have a NoLOADER configuration in /etc/grub.conf Running boot loader as requested Running /usr/sbin/grub  ...    The system does not freeze (Ctrl-Z works, I get my console back) just that that /usr/sbin/grub seems to never complete.  What should I do? What is Quantization? How do I efficiently get "the most recent corresponding row"? I have a query pattern that must be very common, but I don't know how to write an efficient query for it.  I want to look up the rows of a table that correspond to "the most recent date not after" the rows of another table.  I have a table, inventory say, which represents the inventory I hold on a certain day.  date       | good | quantity ------------------------------ 2013-08-09 | egg  | 5 2013-08-09 | pear | 7 2013-08-02 | egg  | 1 2013-08-02 | pear | 2   and a table, "price" say, which holds the price of a good on a given day  date       | good | price -------------------------- 2013-08-07 | egg  | 120 2013-08-06 | pear | 200 2013-08-01 | egg  | 110 2013-07-30 | pear | 220   How can I efficiently get the "most recent" price for each row of the inventory table, i.e.  date       | pricing date | good | quantity | price ---------------------------------------------------- 2013-08-09 | 2013-08-07   | egg  | 5        | 120 2013-08-09 | 2013-08-06   | pear | 7        | 200 2013-08-02 | 2013-08-01   | egg  | 1        | 110 2013-08-02 | 2013-07-30   | pear | 2        | 220   I know one way of doing this:  select inventory.date, max(price.date) as pricing_date, good from inventory, price where inventory.date &gt;= price.date and inventory.good = price.good group by inventory.date, good   and then join this query again to inventory. For large tables even doing the first query (without joining again to inventory) is very slow.  However, the same problem is quickly solved if I simply use my programming language to issue one max(price.date) ... where price.date &lt;= date_of_interest ... order by price.date desc limit 1 query for each date_of_interest from the inventory table, so I know there is no computational impediment.  I would, however, prefer to solve the whole problem with a single SQL query, because it would allow me to do further SQL processing on the result of the query.  Is there a standard way to do this efficiently? It feels like it must come up often and that there should be a way to write a fast query for it.  I'm using Postgres, but an SQL-generic answer would be appreciated. I have multiple cameras in a scene. What I want to do is to change which one is active. This way I can view the scene from different angles. How would I do this?