Is there a way to transfer Jetpack joyride profiles from iphone to android? I had a pretty solid profile with a few purchases on my ipod. have since upgraded to android. anyway to transfer my profile?
Is there a way to transfer money and items from iOS to Android? I've been playing Jetpack Joyride on iOS, and I just got an Android device. Can I move my things, such as money and unlocks, from my iOS device to Android?
As a non-native speaker, I cannot grasp any difference between the expressions "here we go" and "there we go": both expressions seem to underline an event that is going to happen immediately.  Is there any subtle usage detail that I am missing? The "I Get It" Reputation Problem What is the most efficient way to write the old-school:  StringBuilder sb = new StringBuilder(); if (strings.Count &gt; 0) {     foreach (string s in strings)     {         sb.Append(s + ", ");     }     sb.Remove(sb.Length - 2, 2); } return sb.ToString();   ...in LINQ? "Heard me [infinitive]" vs. "heard me [present participle]" "Heard me [infinitive]" vs. "heard me [present participle]"             At that time, you wouldn't have heard me talk about it.   At that time, you wouldn't have heard me talking about it.         At that time, you wouldn't have heard me condemn it.   At that time, you wouldn't have heard me condemning it.         Which one of the above sentences are incorrect and why? How do I compare 2 rows from the same table (SQL Server)? I need to create a background job that processes a table looking for rows matching on a particular id with different statuses. It will store the row data in a string to compare the data against a row with a matching id. I know the syntax to get the row data, but I have never tried comparing 2 rows from the same table before. How is it done? Would I need to use variables to store the data from each? Or some other way? (Using SQL Server 2008) Reputation displaying incorrectly on Careers (for some accounts) When I go to , go to the "Stack Exchange" section, and click on "edit" under "Accounts", I see the following at the bottom of the account list (partially truncated for reasons of space):    Now, as you can see from my reputation here on MSO, I should have the association bonus on all sites where I have an account. Yet, for some reason, my accounts on Android, Italian, Sound Design, and Windows Phone are listed as having just 1 reputation. However, if you look at my account on each of these sites (, , , and ), you will see that I do, indeed, have 101 reputation from the association bonus.   At first, I thought the commonality among those four sites was that I hadn't performed any actions on them (not even voting), but it turns out that I have actually cast a vote on Android, so I don't really know what's up.   Note also that all of these accounts are at least a few weeks old (and my association bonus is even older than that), so this doesn't seem like it would be a caching issue or anything. As a programmer, I have no problem with seeing or using "and/or" in technical documentation. For example,     I can upvote an answer that satisfies me and/or mark it as accepted.   That's perfectly good English to me. However, if I were writing a novel, or even just an essay, or — heaven forbid — a poem, "and/or" would seem extremely out of place.  My question is, what should I be using instead? (I solemnly swear I will not use that knowledge to actually write a poem.) Gambler's ruin and coin toss Similar to my old question about  are there any limits to the animal forms an Animagus can be?     We know that the animal form can be much smaller than human (cat, rat, beetle) so I don't think size is a factor.   I'm not aware of any Animagus who transforms into a magical creature (e.g. unicorn or phoenix) so maybe those aren't possible.   Ultimately, what I'd like to know is whether there could be a T-Rex Animagus... (prompted by ) Show that the set of all finite subsets of $\mathbb{N}$ is countable. Show that the set of all finite subsets of $\mathbb{N}$ is countable.   I'm not sure how to do this problem. I keep trying to think of an explicit formula for 1-1 correspondence like adding all the elements in each subset and sending that sum to itself in the natural numbers, but that wouldn't be 1-1 because, for example, the set {1,2,3} would send to 6 and so would the set {2,4}.  Multiplying all the elements in each subset and sending that product to itself in the natural numbers wouldn't work either since, for example, {2,3} would send to 5 and so would the set {1,5}. Any ideas? Glassware with scratched/etched surfaces generate more bubbles (, ). Why these rough surfaces allow easier heterogeneous nucleation? In the simple linear regression case $y=\beta_0+\beta_1x$, you can derive the least square estimator $\hat\beta_1=\frac{\sum(x_i-\bar x)(y_i-\bar y)}{\sum(x_i-\bar x)^2}$ such that you don't have to know $\hat\beta_0$ to estimate $\hat\beta_1$  Suppose I have $y=\beta_1x_1+\beta_2x_2$, how do I derive $\hat\beta_1$ without estimating $\hat\beta_2$? or is this not possible? Is it possible to get a list of most recently installed packages? Handling circular entity references with Migrate I am using  on a Drupal 6 to Drupal 7 migration right now.  I have three types: type1, type2, type3.  Each of the three types has a entityreference field on it, which is configured to be able to point to all three types.  This means that there can be circular references, and when a particular node is being migrated, the destination node may not exist yet and could potentially be any of the three types.  My migration class looks like this:  class MyNodeMigration extends DrupalNode6Migration {   public function __construct(array $arguments) {     parent::__construct($arguments);      $this-&gt;addFieldMapping('field_legacy_nid', 'nid');      $this-&gt;addFieldMapping('field_the_reference', 'field_the_reference')       -&gt;sourceMigration(array('type1', 'type2', 'type3');   } }  $node_arguments = array(   array(     'class_name' =&gt; 'MyNodeMigration',     'description' =&gt; 'type1',     'machine_name' =&gt; 'type1',     'source_type' =&gt; 'type1',     'destination_type' =&gt; 'type1',     'dependencies' =&gt; array('roles', 'users'),   ),    array(     'class_name' =&gt; 'MyNodeMigration',     'description' =&gt; 'type2',     'machine_name' =&gt; 'type2',     'source_type' =&gt; 'type2',     'destination_type' =&gt; 'type2',     'dependencies' =&gt; array('roles', 'users'),   ),    array(     'class_name' =&gt; 'MyNodeMigration',     'description' =&gt; 'type3',     'machine_name' =&gt; 'type3',     'source_type' =&gt; 'type3',     'destination_type' =&gt; 'type3',     'dependencies' =&gt; array('roles', 'users'),   ), );  $common_node_arguments = $common_arguments + array(   'user_migration' =&gt; 'users', );  foreach ($node_arguments as $arguments) {   $arguments = array_merge_recursive($arguments, $common_node_arguments);    Migration::registerMigration($arguments['class_name'], $arguments['machine_name'], $arguments); }   When I run the migrations, most nodes are fine, but I get a decent amount of Stubs (*) created.  Some of the destination nodes have the entityreference pointing to these Stub nodes.  The source nodes are fine.  What I have uncovered is that the bundle on the destination nodes that are being made as stubs are incorrect, and look like they are all type1.  A node of the proper type does end up being created, but it never gets set as the entityreference target.  Another way to explain this is that I end up with   node: nid=123, type=type1 node: nid=234, type=type1, field_the_reference=123 node: nid=345, type=type2   where it should be   node: nid=234, type=type1, field_the_reference=345 node: nid=345, type=type2   How do I handle this situation?  (*): a "Stub" in the context of this question here refers to a node which is created for the purpose of being a reference target, but does not get its data initially. The term is used throughout the Migrate documentation and source code. 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. Before proposing reviewers, should I notify them? Some journals require the author to propose potential reviewers. Should I just propose reviewers and let the editor contact them? Or should I first contact the potential reviewers myself and ask if they agree? Wireless connection fails every few minutes If the plural of ‘man’ is ‘men,’ shouldn’t the plural of ‘German’ be ‘Germen’? What makes these two words so different that 'man' is changed to 'men', but 'German' is changed to 'Germans'? How can I test the quality of a RNG? On electronics.stackexchange we had  about constructing a True Random Number Generator. Since the method relies on noise, which isn't deterministic, the only way to test the quality of the RNG seems to be empirical. Not being a statistician I suggested to test a long bit sequence for normality, but I have no idea what outcome is acceptable and what isn't. For instance counting single bits I guess we have a thumbs-up for a 499500/500500 distribution, but when is the ratio too much skewed to be acceptable? Same for 2-bit and longer sequences. Of course, if testing for normality is a Bad Idea™, I'd like to hear it, including better alternatives.    edit Diehard was mentioned a few times, but I'm not sure this answers my question. The normality test should give a normal distribution, with better bell curve approximations for longer sequences. Diehard seems also to have tests which either should result in normal or exponential distributions. But my question remains: how do I judge the results? Just by looking at the curve and discern a bell curve in it? To get back at my first example, a 499500/500500 distribution is definitely OK, and a 950000/50000 distribution definitely is a no-no, so where does the switch-over happen? Is there a Linux equivalent of Windows' "resource files"?