Nice troll, but one Marine in a large force committing a horrible crime and then being punished isn't really indicative of a national policy. If it were, the US would also be supporting killing US soldiers on military bases in Texas due to MAJ Hasan's spree shooting a couple years ago.
OTOH, it's crazy that that guy got only 4 years. 10-20 would be more appropriate. Hopefully being convicted under Japanese law doesn't prevent additional action under UCMJ to run consecutively.
I went as a Monbusho scholar in the period 2004 - 2009 and this is not the case anymore. Nowadays you spend a lot of time filling forms and getting access to basic services like cellphones or Internet. They do give you around ¥160K these days...
A few years back, I was to go to Brazil on scholarship. Last minute, the US university mentioned they paid the money one month in...yet one has to pay at the start and Brazilian uni starts one month earlier than in US. Catch-22. Four months of prep, crossing T's and dotting I's and it all went down the drain.
My startup has a fast nearest neighbor engine that allows to have far matches: http://simmachines.com/Products/r01.html
We hope to be the "berkeley DB" of the big data era.
Feedback would be greatly appreciated!
My main piece of feedback is that explicitly comparing your product to a database engine that people love to hate is probably not a great way to market it. Lots of us have horrible memories of badly-corrupted Berkeley DB databases.
This is a very important data structure from a historical point of view, but unfortunately it doesn't work well when you are dealing with complex spaces. Try LSH as mentioned before or something that is 10X faster: http://simmachines.com
You can solve complex things with k-nearest neighbor as long as you use an appropriate distance function. This is the beauty, a distance function abstracts the complexity. I tackled a tricky biology problem by applying a cascade of similarity filters. Check the presentation I gave at the Clojure/conj 2011:
My startup provides a very fast similarity engine (in a DB of 100 million objects I can find similar objects in under 20 millisec. with one CPU) in case you worry about scalability. URL: http://simmachines.com
The SISAP metric spaces library comes with an implementation: http://sisap.org/Metric_Space_Library.html
You can also compare BK-trees with other methods and you may encounter that their performance is not so great, specially for high dimensional spaces.