I'm a Developer Programs Engineer at Google, which means my job is to help software developers get the most out of Google products. My specific areas of concentration are:
Google Compute Engine - http://developers.google.com/compute/ (tag: google-compute-engine)
Google Cloud Storage - http://developers.google.com/storage/ (tag: google-cloud-storage)
You can find my Google Plus page here: http://gplus.to/marcacohen.
|
Apr
17 |
|
comment |
Should I use Google Cloud for my PHP web sites Google Compute Engine is openly available now for customers who purchase a gold support agreement. See googledevelopers.blogspot.com/2013/04/… for more details. |
|
Mar
22 |
|
answered | gsutil setwebcfg weird sub folder behavior |
|
Mar
5 |
|
answered | A way round the need to verify domain before creating a bucket in google cloud storage? |
|
Jan
13 |
|
comment |
AppEngine Datastore Admin: cannot backup to cloudstore Thanks for confirming. I just wrote a bug report. |
|
Jan
13 |
|
answered | AppEngine Datastore Admin: cannot backup to cloudstore |
|
Jan
5 |
|
revised |
Amazon Web Services/Google Cloud for iOS application added 642 characters in body |
|
Jan
5 |
|
answered | Amazon Web Services/Google Cloud for iOS application |
|
Dec
20 |
|
awarded | Revival |
|
Dec
12 |
|
comment |
Google Cloud Storage Share Publicly Can you share the output from gsutil getacl on the object and also the URL you are using to access the object? |
|
Dec
9 |
|
awarded | Yearling |
|
Dec
7 |
|
comment |
Alternative implementation of Ackermann function in C Two problems: 1) If you are storing your register state in global variables, those variables will suffer from the same fate as the original register definitions. You need to store that state on the stack. Try defining a-f as local variables. 2) The POP function you've described is the same as your PUSH function -- it should be the inverse, i.e. instead of a = R4, you want to pop by doing R4 = a. |
|
Dec
7 |
|
comment |
Alternative implementation of Ackermann function in C The safe, naive solution would be to save (restore) all registers at entry (all exit points). A more efficient approach would be to save only the registers that are modified anywhere in the recursive function and then restore those same registers on exit. Most efficient would be to save on demand before writing, which saves only those registers that actually change. The disadvantage of the latter option is you have to keep track of which registers you modified (so you know which ones to restore), which requires another data structure and some additional logic. |
|
Dec
7 |
|
answered | Alternative implementation of Ackermann function in C |
|
Dec
7 |
|
revised |
Trouble Importing Module added 4 characters in body |
|
Dec
7 |
|
answered | Trouble Importing Module |
|
Dec
7 |
|
revised |
how do i use a line from a text file as a function input in python? added 4 characters in body |
|
Dec
7 |
|
answered | how do i use a line from a text file as a function input in python? |
|
Dec
6 |
|
answered | Transferring large files from S3 to Google Cloud Storage in App Engine |
|
Dec
6 |
|
comment |
Manipulate data for scaling Not sure what you mean by "controlled". If you are referring to the huge result for game 3, that's a reflection of the fact that it's been reviewed extremely frequently (50x more than the next most reviewed game and has a very high average score). Of course, you could scale the result by any factor you like (e.g. multiply by .01) but that will skew your results -- it's really a question of how much you want to weigh frequency vs. average score. My proposal puts a high weight on frequency but I'd suggest playing with some alternatives and see what works best for you. |
|
Dec
6 |
|
answered | Remove sequential characters from the start of a string |
