My guestion is since we have now detected gravitational waves can gravitational waves go through interference (ie destructive or constructive interference) with each other like other waves?
If two gravitational waves came in contact with each other what would happen? In another question entirely, what happens when a higher gravitational field interacts with a weaker one.
All of a sudden, without any change in the index.html, our site is showing up in Google search results (on multiple browsers and devices) with Google Preview text that, instead of giving a summary of our site, now says:     Your browser does not currently recognize any of the video formats available. Click here to visit our frequently asked questions about HTML5 video.     We have a YouTube embed on our homepage that does include an html5 parameter in the media URL link in the embed, but there are no issues playing the video with any browser and device we can find.  What would suddenly cause this text to appear in Google search results?   We are using the  tags as the metatags in the &lt;head&gt; of our webpage and do indeed have title and description tags.    To mimic the behavior of Googlebot, I installed Windows on a VM and got Chromium 41 running. I get the same Google Preview text with the html5 video message when the site comes up in Google search results using this browser.    When I view the site in Chromium 41, I see the YouTube embed and it renders on the page and plays with no issue, just as with all other browser and devices we've tested on. The only time we see this message is in the Google search results, not on our actual site. Can't run "dpkg --add-architecture i386" on 12.04 64-bit to run eclipse ADT How to share variable between two c# projects How can I define a mathematical function as a LaTeX macro? How to test for equality of means for proportions? And two-sided or one-sided? I have the following problem: two groups A and B.  The proportions of married and single are ($p_1$) and ($p_2$) respectively, and the standard deviations ($s_1$) and ($s_2$). The sample consists of  ($n_1$) A and  ($n_2$) B observations.  Now I want to test whether the proportions are equal. I use the following formula to compute the z-statistic:  z = $abs(p_1 - p_2) / \sqrt{ \frac{p_1(1-p_1)}{n_1} + \frac{p_2(1-p_2)}{n_2} }$  and test the hypothesis: h0: $p_1 \neq p_2$  An alternative approach I tried is to estimate the t-value based on the standard deviations (hence just comparing means), that is by the formula (assuming unequal variances):  t = $abs(p_1-p_2)/\sqrt{ s_1^2/n_1 + s_2^2/n_2 }$  My question are:    do you agree with my approach or; should it be two-sided or one-sided?   Thank you. How to cheat and avoid cheating in Flash games? How do I make the Unity Launcher background transparent? I found a way to make the icon backgrounds transparent for the Unity Launcher by changing the files under /usr/share/unity/4.  Does anyone know how to make the background transparent for the launcher itself? I already made it transparent under Compiz, but I want to remove the line that separates the launcher from the desktop. If anything, I just want to make it look like the icons are floating. Why should the interface for a Java class be preferred? Passing list to viewparams variables in GeoServer SQL views? If I want to shoot darker shots, is it better to increase the lighting and then darken in post to retain clarity? I'm just getting started - in my last shoot, I was using a 6D with a 50mm/1.4.  In low light, the pictures looked fantastic on the viewfinder but on the computer screen, appeared extremely grainy.  For future shoots, if I want to achieve something like this:     Should I shoot with way more light / lower ISO to retain clarity, and then just darken in post?  What kind of setup would be needed to achieve the above?    With my setup -   Camera Canon EOS 6D  Lens EF50mm f/1.4 USM  Focal Length 50mm  Shutter Speed 1/40 s  Aperture f/1.8  ISO/Film 6400  I was getting very grainy results that I had to soften in post (in case you want to see my attempts):      Any tips would be much appreciated. lib32bz2-1.0 missing on 16.04 I have tried installing this package (needed for android studio).  This is the error i'm getting  E: Unable to locate package lib32bz2-1.0 E: Couldn't find any package by glob 'lib32bz2-1.0' E: Couldn't find any package by regex 'lib32bz2-1.0'   I have already tried:  sudo dpkg --add-architecture i386 sudo apt-get update sudo apt-get install lib32bz2-1.0   &amp;  sudo dpkg --add-architecture i386 sudo apt-get update sudo apt-get install lib32bz2-1.0:i386   I also searched on  and did not find lib32bz2-1.0 for Ubuntu 16.04. So how do i get this package which is available for trusty and precise? Using the same secret key for encryption and authentication in a Encrypt-then-MAC scheme Is it a weakness to use a single shared secret for protecting messages using a Encrypt-then-MAC scheme?    Assuming a system is using AES-256-CBC and a SHA1-HMAC and the same secret key for both operations.  Upon intercepting one of these messages and attacker could brute force this secret key by trying to solve the HMAC or by successfully decrypting the first block of the ciphertext.  Performing  a decryption on a single block of AES-256 should be a lighter operation than performing a SHA1-HMAC on a potentially large message.  Therefore AES-256 is ideal for a massively parallel brute-force attack and the use of the SHA1-HMAC doesn't hurt the system.  Is this approach sound, or is there an attack that has not been taken into consideration? Rails: Could not find bcrypt-ruby-3.0.1 in any of the sources Force applied off center on an object How to ignore certain files in Git Are any fictional worlds available in some GIS format? Is there any fictional world (e.g. ,  etc.) which could be used in a GIS context?  For example, an MBTiles archive and a shapefile or any other format usable with OpenLayers / Polymaps / Leaflet? Flair: 500 Internal Server Error - http://stackexchange.com/error?aspxerrorpath=/users/flair/378431.png I need help with a specific command that I am using in a new game that I am creating inside of Minecraft. The command is:  /give @p sign 1 0 {BlockEntityTag:{Text1:"{"text":" [MF2]","color":"gold","clickEvent": {"action":"run_command","value":"tellraw @a [""{"text":"[MF2]  ","color":"gold"},{"selector":"@p","color":"dark_aqua"},{"text":" is now an admin of the server!","color":"white"}]"}}",Text3:"{"text":"Click to join Admin","color":"dark_aqua","clickEvent": {"action":"run_command","value":"scoreboard teams join admin @p"}}"},display: {Name:"Custom Sign"}}   If I take out the /tellraw command then the command works fine, but I need the command in there to announce to the game that a new admin has joined.  With the tellraw command, the error message is the following:  Data tag parsing failed: Unexpected token 't' at: text":" [MF2]","color":"gold","clickEvent":{"action":"run_command","value":"tellraw @a [""{"text":"[MF2] ","color":"gold"}, {"selector":"@p","color":"dark_aqua"},{"text":" is now an admin  of the server!","color":"white"}]"}}",Text3:"{"text":"Click to join Admin","color":"dark_aqua","clickEvent": {"action":"run_command","value":"scoreboard teams join admin @p"}}"   If anyone knows how to fix this, please let me know. The security guard problem There was a security guard in a bank. In front of him were 100 lockers in rows of 10. He thought of something as he saw all the lockers were closed. He started opening all the lockers whose lock numbers were multiples of 1, then closed all lockers whose number was a multiple of 2,and did the same for 3 and so on. If the locker was open, he closed it, if closed, opened it. He went to open multiples of 1 (all),then 2,4,6,8...and then 3,6,9.. And then finally reached 100.  After all the opening and closing,in the end, how many lockers are open and how many closed? Public-key cryptographic systems are often implemented on top of an existing problem. For example, RSA is built on top of integers and the difficulty of factoring. ECDSA/ECIES are built on top of elliptic curves and the difficulty of the discrete logarithm.  My question is, what are, mathematically speaking, the exact primitives needed to implement public-key based signature and encryption cryptography in a generic way?