Today was too, fantastic. I went to the lab and imaged slides with M. Later we talked about life (a good distraction when nobody is around and you don't really want to work).

I asked M, what you want to be in the next 10 years? I heard this question from a friend of mine in class. She heard another professor ask her this type of question. The professor claims the answer will often become true whenever he asked this to another person. M's goal was a little surprised to me. She said that she wants to live in Pankistan and to become a doctor there, by applying what she learns in Canada. It's a very courageous dream yet, not without challenges. I somehow admire her courage and wish her the best.

Today was a very busy day. I got my rejection from UW early in the morning. The first thing I will do usually is to check my phone. Ms. Zhu sent me an E-mail saying that my application is rejected by UW. To be honest I wasn't that surprised, because I knew my application would not be strong enough from the start (they had 751 applicants and only select for 70 of them for interview). Comparing to people who are having stellar GPA and background, my scores are pretty medicore. 

So I was chill. I went to the lab and did some experiments with M, who looks very happy today and she makes me happy too. You always need some reasons to become motivated to work during Christmas. Later on we went to Jack Tan. M ordered Tofu and I got cabbage with broth. A traditional (very health) dish in China. I wasn't very pleasant because I found out that my dish contains lots of bugs. When the vegetable is not fresh or is kept for too long in the fridge, you tend to get those bugs. I felt disgusted but I don't want to ruin the reputation of the restaurant. The waiter was nice, she gave me a free spring roll (I am easily corrupted by a spring roll LOL). I think it's okay, sometimes I got bugs in my veggies too. So I didn't make a big deal with them. I will let them know next time when I have a chance.  

Then I went home and finished all my applications (nearly) for 3 other schools I am applying too. So a total of 15. That's the end of my application season. Now all I need to do is to wait and chill with my friends.

I sent out an E-mail asking Dr. Berg, a POI whose research I am very passionate about, to see if there is any chance I could bring back my application for consideration. I know the opportunity will be extremely low, and I am lucky enough to have her back saying she was familiar with my research (she sounds interested too). Still, I want to try and seize every possible chances (even it's only 0.001%). 

Anyway, I guess my point is that life keeps rolling even though you experienced failure (obviously I will experience a lot more in the future). And keep being happy. Me and M were talking about all the books we really liked during Undergrats. I am surprised to see that my university has completely deprived my leisure time to read and the ability to think (out of context). What a shame, I used to love reading, now I barely have time to read one single page.

So things need to be changed, that's why I am here, early in the morning and try to find a part of me back (through writing). Now it's time for bed, and before that, let me check Gradcafe :p.

legal issues of algorithm.

Ok... What can I say, exam jam is near around, I will be hugely surprised if there some dummies actually come up and write a blog. Unfortunately I am that person and I am writing in journal while doing my volunteer work. I want to wrtite something interesting about the legal issues of algorithm.
Algorithms, by themselves, are not usually patentable. In the United States, a claim consisting solely of simple manipulations of abstract concepts, numbers, or signals does not constitute "processes" (USPTO 2006), and hence algorithms are not patentable. However, practical applications of algorithms are sometimes patentable. For example, in Diamond v. Diehr, the application of a simple feedback algorithm to aid in the curing of synthetic rubber was deemed patentable. The patenting of software is highly controversial, and there are highly criticized patents involving algorithms, especially data compression algorithms, such as Unisys' LZW patent.

Thank you!.

Ok! I guess this is the last journal/assignment I will write regarding to this course... Overall, I had tons of fun learning with Danny and my friend S. I am thrilled by how computers are designed in the a way similar to how our bodies/brain function... In chinese we translate computer as "electric brain". It is such a nice translation! Computer works exactly like brain (only the logic part though), through all these logic and simple algorithm, we are able to communicate and cultivate our imagination on a totally innovative canvas, the realm of internet. This is awesome to see how simple, basic steps gave rise to such complex and thorough system. I did learn many ways of manipulating pictures in this course, most importantly, the basic idea of how computer works, how does it develops and how does it continue to evolve while exerting remarkable influences on our everyday life. This article is kinda emotional and not very related to the course, because i have nothing to write... Anyway! I like this course a lot and I want to thank Danny and You, who is reading my article, for being supportive. I will see you around!.

2nd project, new approach.

What can I say, the second part of project is easier than the first one!!! It was a fun project of producing a picture that can change colors... This time I used less time than the first project. I used to do the project by going through every defination quickly and make minor changes as a whole, and turn back to little details to fix every single defination. As a result, it takes more time for me to fix every single questions. It took me around 4 hours to finish the first project! and I have to consult my friend to fix it sometimes... The second one is a lot better! This time I took a different approach by forcusing on one defination at a time. I will move on to the new defination once I have finished editing the previous one. This turned out to be very efficient since I could concentrate on one defination at a time. As a result, it took me 3 hours to finish the project! Which is a bit less and I figured out everything on my own ! Yay!!!!.

The second test was actually a lot harder than the first one... I did study hard on the second test so I didn't do that bad. I went through all the computer codes and past quizzes, read all the class notes(which are very very helpful). Sometimes my brain gets tired of understanding those asbstract concepts about computers... For example, the time sliding concept. I couldnt understand this material from the class notes. So I brought this question to Danny and he patiently answered me. Guess what, this question is on the test!!! I am glad that I ask him for what I don't understand, and I was being honest to myself that I do need a little more help... Sometimes I gotta lazy for asking questions and most of the time it's because of the ego that stops me. I have to change that way of thinking... Asking question and it definately will be rewarding for the courage to do so!.

long time no see csc.

Hi Long time nooo see my lovely blog. I just want to share some of me thoughts on the idea of recursion... I found it's very very intriguing. Recursion is the process of repeating items in a self-similar way. It's a very useful and common application in computer science. Fibonacci sequence is a classic example of recursion. Fibonaccis sequence first appears in Indian Mathematics. The sequence is defined in the following term:

Fn=Fn-1 + Fn-2.

A Sierpinski trangle is also a classic example for recursion. This special form of triangle can be formed in the following steps:

1. Start with any triganle in a plane. Equilateral triangle can produce the best visual result.
2. Shrink the triangle to 1/2 height and 1/2 width, produce 3 shrunken triangles so that each triangle touches the two other triangles at a corner.
3. Repeat step 2 with each of the smaller trangles...

To understand recursion, I realize that there is a distinction between a procedure and the running of a procedure. Procedure is like a recipe, while running the procedure is actually preparing the meal. Recursion is part of algorithm, in that sense. One has to grasp the fundamental rule in one problem to solve or create a complex recursion system.