Some academic achievements were done during my stay in Hawaii. Huh, I shall show how hard working I’m, or others will said I spend the money payed by their taxes! (Although it’s undeniable.)
IEEE CISched 2007 is part of the 2007 IEEE Symposium Series in Computational Intelligence, it means there are 12 conferences held in the same time at the same place (Hilton Hawaiian Village). In my opinion of this multi-conference, it servers a variety of research topics and we can access all symposia through only one registration. It sounds quite nice, doesn’t it? A better factor is they provided several tutorials gave by some masters. I felt you water mouse that is running now.
I joined the tutorial almost all day long on 4/1 while my lab mates and friends went to Waikkiki beach to enjoy sunshine and water activities. There are two tutorials which attract my attention. One is Multi-Objective lectured by Dr. Piero and the other is Dr. Coello which gave the speech of MO algorithms. Originally, the first tutorial is supposed to be introduced by Dr. Jin; however, when I went to there, Dr. Piero came in and it made me felt surprised. I think I may run into the wrong ballroom! However, he told us Dr. Jin was stuck in San Fransisco because there is no seat available for him. Dr. Piero further said Dr. Jin goes to the conference on 4/2; so I can’t see him in this conference. huhu, I want to greet Dr. Jin since he will visit our school in May. So I felt it’s really pity about that. (But I met Dr. Jin on 4/2 night! I’m very excited to see him. I explain it latter.)
Well, since Dr. Jin can’t present the Multi-Criteria on time, Dr. Piero applied his research topic in MO problems and corresponding approaches which is from easy to difficult ones. He convinced the trend of research topic will move from easy to difficult ones soon. Haha, maybe the easier topics are solved well now. Poor you and poor me. From his speech, this part is most useful from his tutorial. In addition, he also discussed how to construct a surface by Fuzzy algorithm. It means when we obtain a possible consequence from this surface, we are able to reduce the computational efforts. There is no doubt that we can use it in continuous problem. However, I think it is not applicable in combinatorial problem. So I raised my hand to ask him this question.
When he saw me I raised my hand, he returned back a mouse to me quickly because I helped him to borrow a mouse for him. Haha, I told him I raised my hand is not only to get the mouse back but also have one question. He said "Of course" and I heard some people laughed. Hmmm, according to his reply, I evaluate this method that may not be ok in combinatorial problem. But it is a good start to ask a question without feeling stressful.
After the session of Dr. Piero, I participated in the tutorial of Dr. Coello. Wow, there are so many people crowded in the ballroom! I seat at the 2nd row so that I can see him clearly. (Maybe my shortsightedness is too server.) He mentioned so many MO algorithms in the same time. Besides, he also had such works in these algorithms. For example, he had proposed a microGA in solving the multi-objective problem that competes with some benchmark algorithms such as NSGA II and SPEA 2. He joked reviewers or researchers don’t like his idea. Thus, there are few people who developed microGA. I shall know even for a well-known master, it is still hard to attract others attentions.
Before I joined his tutorial, I knew I should ask him a question since he reviewed so many papers in MO area. It’s what is the "3rd generation" MO algorithms nowadays. Haha, because he is so considerate of his speech, he told us there is no such definition now. Thus, it means after year 2001 to 2002, the MO algorithms are not improved anymore! Hmmm, of course, maybe there is no such trend he discovered as well. However, he said his student fall in love with Particle Swarm Intelligence. Consequently, it stimuated me to request his opinion about which method is the best among all the algorithms. I’m surprised that he treats the Tabu search is the best and GA goes to the 2nd place. I thought ACO may go to the 1st place... But anyway, it reminds me what should I do the comparisons in experimental results ^^Y
The day I listened the tutorial that was on 4/1. Yeah, it’s the foolish day but the descriptions above are true. Huh, so I work hard very much in joinning the conference without wasting your taxes. I will post my two presentations and my trip experience soon.
沒有留言:
張貼留言