Installing Google Maps without an Apple ID?
How can I download free apps without registering an Apple ID?
When using a new Windows 8 search bar:    What is the syntax of the search expression? Is it possible to use wildcards like "*", "?" or any other special symbol?  For example, when searching with Google i can use:   '-' (minus) for excluding certain words; "quoted phrase" for exact phrase matching. Does the PS-Vita support PSP games Is the PS-Vita backwards compatible with PSP games?  Some games I would like to play include Final Fantasy 7: Crisis core, Jak and Daxter: The Lost Frontier, Coded Arms, Tekken: Dark Resurrection, and Secret Agent Clank. What is the best way to clean the sensor on a interchangeable lens camera (mirrorless or digital SLR)? Concurrent updates to GDAL (to 2.1.3) and QGIS (to 2.18.5) on Linux Mint 18.1 from the Ubuntugis repos breaks QGIS, with a noted dependency for the virtual package gdal-abi-2-1-2 being uninstallable.    The stable Ubuntugis ppa currently supplies GDAL 2.1.0 (gdal-abi-2-1-0) while the Ubuntugis-unstable ppa has been updated to GDAL 2.1.3 (gdal-abi-2-1-3).  Has anyone found a way around this?    Update:  QGIS bug report for those interested is here:     UPDATE 2  The ticket has been closed as fixed. Everything should be back to normal now. Do I use ext4 for all partitions (such as / and /boot)? What are the other formats used for? I'm installing ubuntu onto a new laptop with 24gb SSD and a 500gb HDD. I wanted to put / and swap onto the SSD and /home onto the HDD. Is there anything I shouldn't use ext4 for?  I do not ever intend to dual boot. Ubuntu only. The number of permutations of $\{1,2,\ldots,n\}$ that have exactly one ascent (rise). Sloane's  counts the number of $n$-permutations with exactly one ascent.  For example $a(3)=4$ because we have: $1\wedge32$, $21\wedge3$, $2\wedge31$, $31\wedge2$ where I have marked the unique ascent with $\wedge$.  The same sequence also counts the number of length $n$ binary words that contain at least two $1$'s. For example $a(3)=4$ because we have: $011, 101, 110, 111.$  Is there a simple bijection between these two classes?  The formula for the sequence is $a(n) = 2^n - n - 1$.  I see how this counts the number of such binary words.  Is there a combinatorial derivation of this formula demonstrating that it counts the number of such n-permutations?  Both the exponential and ordinary generating functions of the sequence are given.  Again, I understand their symbolic derivation for enumeration of such binary words but can these functions be derived symbolically by considering the structure of such n-permutations? Replacement for alliums? Is there any way to check whether a file is locked without using a try/catch block?    Right now, the only way I know of is to just open the file and catch any System.IO.IOException. What is the difference between .pem, .csr, .key and .crt and other such file extensions? I'm new to SSL / TLS and I want to work with the OpenSSL toolkit.  I don't know what .pem and .csr stands for?  I do know that .key is the private key and .crt is the public key. What are the effects of exceptions on performance in Java? Clamp velocity along local axis In the attached , I have a representation of a airplane/jet fighter (cube scaled at one end to indicate direction of flight). I am using torque to steer, and adding Linear Velocity along a local axis for thrust/brakes. What I want to know is how to clamp the velocity along the plane's local axis so when the plane steers, it does not simply keep flying in the direction that is was before it turned. I would prefer a solution with logic bricks, but if that is not possible, python would be acceptable. (it just needs to keep a speed relative to how long the thrust/breaks have been held no mater which direction it is pointing.) Is it possible to create a "weak reference" in javascript? Is there any way in javascript to create a "weak reference" to another object?   Can anyone think of a way to implement this  behavior in javascript? I'm wondering if there's any log which stores information about a particular program such as when the program has started and closed manually on Windows such as MS Word, or Chrome. Any ideas? Keying node in compositor. How can I associate the alpha channel so that it works with the Alpha Over Node? (As a follow-up to  question) I'm trying to overlay a a green-screen plate over a 3D background. I create the key with a Keying node and the overlay with an Alpha Over node. I can get a clean key by enabling Convert to Premultiplied.  Whereas if I leave the Convert to Premultiplied off, the key does not work.  The reason for this, as explained on :  The Alpha over node actually assumes associated alpha and performs the correct over operation, which is FG+(1-FG.a)BG.RGB. Unassociated alpha can do none of these things. [...] it is prudent to manually associate your alpha and control the merging to prevent data loss in the RGB channels. I still stand by the advice, however; always try to maintain a consistent state of alpha, and when you deviate, do so under scrutiny.  So the question is: what is the correct way to associate the Alpha Channel crated by the keying node, so that it works with the Alpha over node without resorting to the convert to premultiply option?   green screen element can be downloaded from the mango project Who are the diamond moderators, and what is their role? Some people have a diamond after their username (e.g. )    What special privileges do diamond moderators have? How can I become a diamond moderator? Who are the diamond moderators?  How many are there?      For more information, see  in the .     Note: not to confuse with certain Stack Exchange employees, for example  members or "community managers", who often have diamonds as well, but are not ordinary moderators. Let $(B_t)_{t\geq 0}$ be a standard Brownian motion in $\mathbb{R}^d$. It is intuitive that, for fixed $s&lt;t&lt;u$  $$\mathbb{E}[B_t\mid \sigma(B_s,B_u)]=B_s+\frac{t-s}{u-s}(B_u-B_s).$$  However, I cannot think of a way to show this rigorously.   If first attempted to take $A\in\sigma(B_s,B_u)$ and show that $\mathbb{E}[1_A B_t]=\mathbb{E}[1_A(B_s+\frac{t-s}{u-s}(B_u-B_s))]$. But I cannot manage to show this equality.   I'd be very thankful for any ideas and suggestions on how to tackle this problem. Is "has or will read" grammatical? Sound of a next scene starts one moment earlier than video I saw this several times in different movies, but I don't understand what is this supposed to mean. The main idea is when the scene is about to change, for one second or so we still see the picture from the old scene, but the sound is already coming from from the upcoming scene. Why do they do this? What's the purpose of this technique? Ubuntu installation is slow, why? I am currently installing Ubuntu 12.04.3. Everything was going fine until I came across this...     Installing System   It is sssooooooo close to being finished! Like 1/6 of the way there! I just wanted to know if this is normal or if something is wrong. I'm installing it through a flash drive if that helps   Also,what will happen if I press the skip button that pops up when I click Installing System? I had booked a ticket for travel through Indian Railways using IRCTC and got a confirmed ticket. While booking, I forgot to mention the details of a one year old child who will also be traveling.     Will it create any problem while boarding the train?