Skip to main content

Yilin Guo, the coolest girl on the planet

The biggest project that I ever do, for now and ever, just started on September 22nd 13:00 EST 2009, in Memorial Hospital in South Bend, Indiana. This project will take 18 years of development and my lifetime to support. She is my daughter, Yilin Guo.

There are way too many reasons why Yilin is the coolest girl on the planet. I can't explain them quickly in a simple article, therefore I created blog THE COOLEST GIRL ON THE PLANET to post these reasons whenever I find one.

The following photo starts the argument with the fact that, Yilin is a better performer than Steven Seagal.

Yilin's emotion chart
Steven Seagal emotion chart

Comments

Post a Comment

Popular posts from this blog

Publish Maven site with Amazon S3 and CloudFront

Amazon S3 now supports static website hosting . As a 10 years Maven user, I wonder how easy it is to deploy Maven generated site to Amazon S3 and let the rock-solid storage provider to host my project websites. There are several existing s3 wagon providers , which all seem to have the same problem, not supporting directory copy. This is understandable since before S3 new website hosting feature, I guess people mostly expect to deploy artifacts rather than website to S3. So my first task is to write an AWS S3 wagon that supports directory copy. With AWS Java SDK , task becomes as simple as one single class . I made my S3 wagon available in Maven central repository at org.cyclopsgroup:awss3-maven-wagon:0.1 . The source code is hosted in github:jiaqi/cym2/awss3 . The next thing is to create an S3 bucket in console . To avoid trouble, bucket name is set to the future website domain name according to this discussion . Website feature needs to be explicitly enabled. I also created an...
5 comments
Read more

Project Euler 359 - Hilbert's New Hotel

Problem 359, Hilbert's new Hotel Had no idea where to start at all, the only thing I could was to write a small program to print out first hundred numbers in naive way. [ 1 , 3, 6, 10, 15, 21, 28, 36, 45, 55, 66, 78, 91] [ 2 , 7, 9, 16, 20, 29, 35, 46, 54, 67, 77, 92] [ 4 , 5, 11, 14, 22, 27, 37, 44, 56, 65, 79, 90] [ 8 , 17, 19, 30, 34, 47, 53, 68, 76, 93] [ 12 , 13, 23, 26, 38, 43, 57, 64, 80, 89] [ 18 , 31, 33, 48, 52, 69, 75, 94] [ 24 , 25, 39, 42, 58, 63, 81, 88] [ 32 , 49, 51, 70, 74, 95] [ 40 , 41, 59, 62, 82, 87] [ 50 , 71, 73, 96, 100] [ 60 , 61, 83, 86] [ 72 , 97, 99] [ 84 , 85] [ 98 ] As you may see, the result is very interesting. The numbers on the first column seems to be ( row + 1 ) / 2 * ( row / 2 ) * 2. Note that row/2*2 != row since all operations are integer operations. If we calculate the delta values between consecutive numbers in each row, we got 2, 3, 4, 5, 6, 7, 8, 9,10, 11, 12, 13, 5 , 2 , 7, 4 , 9, 6 ,11, 8 ,13, 10 , 15, ...
Post a Comment
Read more

23 prisoners problem, brutal solution and analysis

Problem abstract 23 prisoners are going to be sent to isolated 23 cells and in each day, the guard will randomly pick one of them and have him change the status(either on or off) of one of two switches(switch A and B). The guard promises that if one day the prisoner he picks looks at the two switch, confidently tells that all 23 prisoners have been picked in past and it's truth, then all prisoners are set free. If the prisoner is wrong, game is over and they stay in prison for ever. Before the game begins, 23 prisoners have one chance to sit together and figure out a strategy to go free. ( Detailed version ) Quick analysis Since each prison HAS TO change one of the switch, his decision is not "which combination to change to", but "which switch to turn". Therefore his decision is only one out of two: changing switch A vs. changing switch B. The information that two switches can contribute is 2 bit a time. At any given moment, for a prisoner to tell if everyone ha...
4 comments
Read more