Ah, lots had happen around weekends. New idea came, and gone. Some interesting got proven, and later disproved. Work of ICRA still not completely done. Even right now, some theories still need rechecking. The implementation still not complete, Fu and Peam still working on the implementation. I, myself, do not finish the paper yet, even the draft one. There is a little hope for ICRA right now. But, as our teacher said, it is not the deadline yet, we have to keep working. Of course, gunbound took some time away from us, as usual, but we managed to play less of it. A little bit of victory?

Today, someone set up a dhcp and it starts to leasing out some, definitely unusable, IPs. Most machines in our lab got that wrong IPs. We can not find the source of that DHCP message, we just know the MAC address of that devil dhcp server. Anyhow, the most dirty way to solve this problem is to fix my IP to the old one before I got that malicious IP. Hope that that machine be found very soon.

Today and yesterday are days for proving. I and N~ Peam trying to proof the necessary and sufficient condition for regraspable between two parallel grasps. The process is quite fun, working with Peam and Fu on this subject really make research much more fun. Maybe that is what they called "atmosphere of research". However, if a proof does not come out, the world much be worse.

Fun thing is that, the proof is quite tricky. We get confused very very time and , yes, GunBound really took time away from us. Many pitfall awaited us and, sometime, got us. luckily we managed to escape.

Aj. Attawith has lots of idea about "dual representation" of our problem. Many new horizons seems available to us. Dark shroud still remain but some light does shed upon. Man, what the hell I am talking about.

Just talk with Ai kong (burin) about staying at his apartment, my dear fat ขี้งอน old friend. I will stay with him on sat. 2/9 to wed. 6/9. Ai Kong, of course, request a sweet from sendai. Here is the page ขนม. Click on 萩の月 (hagi no tsuki) and that's it. The pictures look very delicious. Ah, my mind already fixed on eating at Japan, what a nice place for eating.

Today, found some interesting idea about parallel grasp of Fu's work. Trying to eliminate the need of calculating a feasible region. Hope that will work. Discussed with Peam about the theory and we already have some draft (but almost complete) of our proof. In the evening, Fu's program return something that seems to contradict with the theory but we use Mathematica to re-check the code and we found some bug in Fu's code. Trying to solve it, maybe tomorrow.

NOTE: Use mathematica to check feasible region of a linear programming. 1: set the objective by

objA[x_, y_, z_] := x + y + z

2: input constraint by

constraintsA = {-x ≤ 0, x ≤ 312.27, -y ≤ 0, y ≤ 506.085, -z ≤ 0, z ≤ 260, etc, etc, etc....}

3: solve the linear programming by

constrainedMax[objA[x, y, z], constraintsA, {x, y, z}]