tag:blogger.com,1999:blog-71884519674058922012023-11-16T23:40:45.756+08:00Naimah Blog PortalNaimahhttp://www.blogger.com/profile/12970333781386290368noreply@blogger.comBlogger20125tag:blogger.com,1999:blog-7188451967405892201.post-25487075532739603712011-03-05T10:06:00.001+08:002011-03-05T10:09:42.560+08:009th Metaheuristics International Conference<span class="Apple-style-span" style="border-collapse: collapse; font-family: arial, sans-serif; font-size: 13px; ">9th Metaheuristics International Conference<br /><br /> MIC 2011<br /><br /> 25-28 July, 2011 in Udine, Italy<br /><br />More details and up-to-date information at<br /><br /> <a href="http://mic2011.diegm.uniud.it/" target="_blank" style="color: rgb(42, 93, 176); ">http://mic2011.diegm.uniud.it</a><br /><br /> New submission deadline March 28, 2011 (strict)<br /><br />Scope of the Conference<br />========================<br />The Metaheuristics International Conference (MIC) series was established in 1995 and this is its 9th edition. MIC is the main event focusing on the progress of the area of metaheuristics and their applications. As in previous editions, MIC 2011 will provide an opportunity to the international research community in metaheuristics to discuss recent research results, to develop new ideas and collaborations, and to meet old friends and make new ones in a friendly and relaxed atmosphere.<br /><br />MIC 2011 welcomes presentations that cover any aspects of metaheuristic research such as new algorithmic developments, high-impact applications, new research challenges, theoretical developments, implementation issues, and in-depth experimental studies. MIC 2011 strives for a high-quality program that will be completed by a number of invited talks, tutorials, and special sessions.<br /><br />Relevant Research Areas<br />========================<br /><br />MIC 2011 solicits contributions dealing with any aspect of metaheuristics. Typical, but not exclusive, topics of interest are:<br /><br /> + Metaheuristic techniques such as tabu search, simulated annealing, iterated local search, variable neighborhood search, memory-based optimization, dynamic local search, evolutionary algorithms, memetic algorithms, ant colony optimization, variable neighborhood search, particle swarm optimization, scatter search, path relinking, etc.<br /><br /> + Techniques that enhance the usability and increase the potential of metaheuristic algorithms such as reactive search mechanisms for self-tuning, offline metaheuristic algorithm configuration techniques, algorithm portfolios, parallelization of metaheuristic algorithms, etc.<br /><br /> + Empirical and theoretical research in metaheuristics including large-scale experimental analyses, algorithm comparisons, new experimental methodologies, engineering methodologies for metaheuristic algorithms, search space analysis, theoretical insights into properties of metaheuristic algorithms, etc.<br /><br /> + High-impact applications of metaheuristics in fields such as bioinformatics, electrical and mechanical engineering, telecommunications, sustainability, business, scheduling and timetabling. Particularly welcome are innovative applications of metaheuristic algorithms that have a potential of pushing research frontiers.<br /><br /> + Contributions on the combination of metaheuristic techniques with those from other areas, such as integer programming, constraint programming, machine learning, etc.<br /><br /> + Challenging applications areas such as continuous, mixed discrete-continuous, multi-objective, stochastic, or dynamic problems.<br /><br />Important Dates<br />================<br />NEW SUBMISSION DEADLINE March 28, 2011 (strict)<br />Notification of acceptance May 13, 2011<br />Camera ready copy May 27, 2011<br />Early registration June 6, 2011<br />Conference July 25-28, 2011<br /><br />Submission Details<br />===================<br />We will accept submissions in three different formats.<br /><br />S1) Original research contributions for publication in the conference proceedings of a maximum of 10 pages<br />S2) Extended abstracts of work-in-progress and position papers on an important research aspect of a maximum of 3 pages<br />S3) High-quality manuscripts that have recently, within the last six months, been submitted or accepted for journal publication<br /><br />Accepted contributions of categories S1 and S2 will be published in the MIC 2011 conference proceedings. The proceedings will be assigned the ISBN 978-88-900984-3-7. Accepted contributions of category S3 will be orally presented at the conference, but not be included into the conference proceedings (neither in the post-conference proceedings).<br /><br />The submission server is available at <a href="http://www.conftool.net/mic2011" target="_blank" style="color: rgb(42, 93, 176); ">http://www.conftool.net/<wbr>mic2011</a><br /><br />Post-conference Publication<br />============================<br />It has become a tradition of MIC conferences to publish post-conference proceedings in an edited book. Authors of accepted papers in categories S1 and S2 (see submission details) are invited to submit improved and extended versions of their conference papers for publication in the MIC 2011 post-conference volume. The post-conference volume will appear in the Operations Research / Computer Science Interfaces series of Springer Verlag (confirmation pending).<br /><br />Best Paper Award<br />=================<br />A best paper award will be presented at the conference. Only papers submitted in category S1 will be eligible for the best paper award.<br /><br />Invited Talks<br />===============<br />There will be three invited talks at MIC 2011. The invited speakers are<br /><br />- Holger H. Hoos, <a href="http://www.cs.ubc.ca/~hoos" target="_blank" style="color: rgb(42, 93, 176); ">http://www.cs.ubc.ca/~hoos</a>, University of British Columbia, Canada<br />Programming by Optimisation: Towards a new Paradigm for Developing High-Performance Software<br />- Andrea Lodi, <a href="http://www.or.deis.unibo.it/lodi.html" target="_blank" style="color: rgb(42, 93, 176); ">http://www.or.deis.unibo.it/<wbr>lodi.html</a>, Alma Mater Studiorum - Universita degli Studi di Bologna, Italy<br />The heuristic (dark) side of MIP solvers<br />- Pascal Van Hentenryck, <a href="http://www.cs.brown.edu/~pvh" target="_blank" style="color: rgb(42, 93, 176); ">http://www.cs.brown.edu/~pvh</a>, Brown University, USA<br />Meta-Heuristics for Last-Mile Disaster Preparedness and Recovery<br /><br />Special Sessions<br />=================<br />The conference will integrate a number of special sessions. Currently confirmed are the following.<br /><br />- Dynamic Optimization, organized by Amir Nakib and Patrick Siarry<br />- Hybrid Tree Search and Metaheuristic Algorithms, organized by Zeynep Kiziltan, Andrea Lodi, Michela Milano, Fabio Parisini<br />- Matheuristics, organized by Karl Doerner, Vittorio Maniezzo, Celso Ribeiro, and Stefan Voss<br />- Metaheuristics in Employee Scheduling, organized by Dario Landa-Silva and Nysret Musliu<br />- Metaheuristics for Novel and Emerging Vehicle Routing Problems, organized by Jorge E. Mendoza, Christian Prins, Marc Sevaux<br />- Metaheuristics for Real Production Planning and Scheduling, organized by Ruben Ruiz<br />- Metaheuristics in Health Care Management and Services, organized by Ana Viana and Abdur Rais<br />- Methodologies for Heuristic Multi-Objective Optimization, organized by Walter Gutjahr and Frank Neumann<br />- Metaheuristics for Quadratic Binary Programs, organized by Fred Glover, Jin-Kao Hao, and Gary Kochenberger<br /><br />The submission to the special sessions will be through the same submission site as for the main conference. For submission details and paper categories, we refer to the main submission information.<br /><br />Conference Location<br />====================<br />The conference will be held in Udine, Italy. The conference site is Palazzo Antonini, the main site of the University of Udine. This is a 16th century palace in the city center of Udine.<br /><br />Further Information<br />====================<br />Up-to-date information will be published on the web site <a href="http://mic2011.diegm.uniud.it/" target="_blank" style="color: rgb(42, 93, 176); ">http://mic2011.diegm.uniud.it</a>. For information about local arrangements, registration forms, etc., please refer to the above-mentioned web site or contact the local organizers at the address below.<br /><br />Conference Address<br />===================<br /> MIC 2011 Organization<br />Luca Di Gaspero / Andrea Schaerf<br />DIEGM, University of Udine<br />via delle Scienze 208<br />33100 Udine, Italy<br /><a href="http://mic2011.diegm.uniud.it/" target="_blank" style="color: rgb(42, 93, 176); ">http://mic2011.diegm.uniud.it</a><br /><a href="mailto:mic2011@uniud.it" style="color: rgb(42, 93, 176); ">mic2011@uniud.it</a><br />Fax: +39 0432 55 8251<br /></span>Naimahhttp://www.blogger.com/profile/12970333781386290368noreply@blogger.com0tag:blogger.com,1999:blog-7188451967405892201.post-30897024067186176522010-12-21T13:32:00.010+08:002010-12-22T10:39:35.016+08:00ACM ICPC Asia Regional 2010 - Kuala Lumpur (8th- 9th Dec 2010)<div style="text-align: center;"><br /></div><img src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjIOnVwxwfiPFYz2W4llpc4DAl2RztXQ7Qct-8pgiGWMSB27EyX-Ch9fXOm_5MylDYJ_knC7Abe_bUuC9NhEuI87bubm97B_PmG5E92q0XfCfEZRN6VQ0gSH49cS_rTFvrLqAVOcQmmJa3O/s400/pc090233-qpr.jpg" style="text-align: center;float: left; margin-top: 0px; margin-right: 10px; margin-bottom: 10px; margin-left: 0px; cursor: pointer; width: 400px; height: 300px; " border="0" alt="" id="BLOGGER_PHOTO_ID_5553021159572453714" /><div style="text-align: right;"><br /></div><div style="text-align: center;"><a onblur="try {parent.deselectBloggerImageGracefully();} catch(e) {}" href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEg1aiRYhHpJKS3rMtOjy_gBGfNXvCROMmyowybnszk8Vlp6kvqBddKuD7NHQKFRvBQHucbpSxjeEvcJjhUGCc8iAVuzNeJ1scQSf1Dh2XTBsCEOC6wGbRBGkRWxQc_JX8zUAuNhIOv8eP6x/s1600/dsc00222-qpr.jpg"><br /></a></div><br /><div style="text-align: center;"><span class="Apple-style-span"><u><br /></u></span></div>ACM ICPC (Association for Computing Machinery International Collegiate Programming Competition) Regional 2010 telah berjaya diadakan di Universiti Islam Antarabangsa pada 8 – 9 Disember 2010. Pertandingan Pengaturcaraan peringkat Regional ini adalah pertandingan yang disertai oleh pelajar-pelajar dari beberapa universiti di sekitar Asia. Sebanyak 66 kumpulan telah menyertai pertandingan kali ini dan 37 kumpulan adalah penyertaan dari luar negara Malaysia manakala 29 kumpulan adalah dari Malaysia. UiTM adalah kontinjen yang paling besar dengan 4 kumpulan dari UiTM Malaysia, 3 kumpulan dari UiTM Trengganu dan 2 kumpulan dari UiTM Perlis. Setiap kumpulan terdiri daripada 3 orang pelajar.<br /><span class="Apple-tab-span" style="white-space:pre"> </span><div><span class="Apple-tab-span" style="white-space:pre"></span><span class="Apple-tab-span" style="white-space:pre"> </span>Tujuan UiTM Perlis menyertai pertandingan ini adalah di antaranya untuk menyungkil bakat pengaturcaraan dari kalangan pelajar Sains Komputer dan juga menggalakkan pelajar kita untuk bersaing di peringkat antarabangsa bersama-sama pelajar antarabangsa (‘battle of the brains’). Ternyata bahawa pelajar kita mampu untuk bertanding dan seterusnya mengasah bakat mereka dalam menyelesaikan masaalah dan menulis aturcara dalam bahasa pengaturcaraan pilihan mereka utk meyelesaikan masaalah tersebut. Mereka diberi 10 soalan untuk diselesaikan dalam masa 5 jam.<br /><br /></div><div><span class="Apple-tab-span" style="white-space:pre"> </span>Pada hari pertama di sebelah pagi, pelajar diberi masa untuk membuat ujian percubaan, tetapi disebabkan oleh masaalah rangkaian ujian tersebut tidak berjaya dilaksanakan dan kesemua peserta di beri peluang untuk menguji sistem komputer pada hari kedua. Pada petang hari pertama, pelajar di beri peluang untuk mendengar ceramah mengenai strategi menghadapi pertandingan tersebut yang dipersembahkan oleh Derek Kisman, salah seorang hakim pertandingan. . Pada hari kedua, peserta menguji lari sistem sekali lagi dan setelah beberapa masaalah teknikal dapat di atasi, petandingan dimulakan pada jam 11:25 pagi dan berakahir pada jam 4:25 petang. Mereka diberi pek makanan ringan dan juga makanan tengahari dalam dewan pertandingan. Semua jurulatih (coach) dapat mengikuti keputusan secara langsung dari bilik auditorium. <span class="Apple-style-span" style="font-size: 15.8333px; ">Dr Steven Halim dan Felix Halim (yang penah menyertai pertandingan tersebut di peringkat dunia) berkongsi ide bersama jurulatih yang lain cara untuk membuat persediaan dan bagaimana ianya boleh dijadikan kursus elektif di peringkat pengajian.</span><br /><span class="Apple-tab-span" style="white-space:pre"> </span></div><div><span class="Apple-tab-span" style="white-space:pre"></span><span class="Apple-tab-span" style="white-space:pre"> </span>Keputusan diumumkan pada jam 6 petang seperti berikut:<br /><ol><li><span class="Apple-style-span" style="font-size: 15.8333px; ">Chinese University Hong Kong</span></li><li><span class="Apple-style-span" style="font-size: 15.8333px; ">Nanyang Technological University , Singapore</span></li><li><span class="Apple-style-span" style="font-size: 15.8333px; ">Hong Kong University of Science and Technology</span></li></ol> Kedudukan untuk Universiti Tempatan adalah seperti berikut:<br /><ol><li><span class="Apple-style-span" style="font-size: 15.8333px; ">Universiti Islam Antarabangsa</span></li><li><span class="Apple-style-span" style="font-size: 15.8333px; ">Universiti Islam Antarabangsa</span></li><li><span class="Apple-style-span" style="font-size: 15.8333px; ">Universiti Multimedia</span></li><li><span class="Apple-style-span" style="font-size: 15.8333px; ">Universiti Teknologi MARA Malaysia</span></li><li><span class="Apple-style-span" style="font-size: 15.8333px; ">Universiti Kebangsaan Malaysia</span></li><li><span class="Apple-style-span" style="font-size: 15.8333px; ">Universiti Multimedia</span></li><li><span class="Apple-style-span" style="font-size: 15.8333px; ">Universiti Teknologi Petronas</span></li><li><span class="Apple-style-span" style="font-size: 15.8333px; ">Universiti Teknologi MARA Perlis</span></li></ol><span class="Apple-tab-span" style="white-space:pre"> </span>UiTM Perlis (Tensai Coder 1) telah mendapat kedudukan keseluruhan nombor 44 dan nombor 8 di kalangan universiti tempatan. Kumpulan UiTM Perlis (Tensai Coder II) pula mendpat kedudukan 58 dan nombor 21 di kalangan universiti tempatan.<br /><br /></div><div>Di kalangan kumpulan dari UiTM sahaja, keputusannya adalah seperti berikut:<br /><ol><li><span class="Apple-style-span" style="font-size: 15.8333px; ">UiTM Malaysia (Newbies)</span></li><li><span class="Apple-style-span" style="font-size: 15.8333px; ">UiTM Perlis (Tensai Coder I)</span></li><li><span class="Apple-style-span" style="font-size: 15.8333px; ">UiTM Malaysia</span></li><li><span class="Apple-style-span" style="font-size: 15.8333px; ">UiTM Malaysia</span></li><li><span class="Apple-style-span" style="font-size: 15.8333px; ">UiTM Trengganu</span></li><li><span class="Apple-style-span" style="font-size: 15.8333px; ">UiTM Perlis (Tensai Coder II)</span></li><li><span class="Apple-style-span" style="font-size: 15.8333px; ">UiTM Malaysia</span></li><li><span class="Apple-style-span" style="font-size: 15.8333px; "></span><span class="Apple-style-span" style="font-size: 15.8333px; ">UiTM Trengganu</span></li><li><span class="Apple-style-span" style="font-size: 15.8333px; "></span><span class="Apple-style-span" style="font-size: 15.8333px; ">UiTM Trengganu</span></li></ol></div><div><p class="MsoNormal" style="text-align: justify; "><span class="Apple-style-span" style="font-size: 15.8333px; ">Tensai Coder I dianggotai oleh</span></p><span class="Apple-style-span" style="font-size: 15.8333px; "><ol><li><span class="Apple-style-span" style="font-size: 15.8333px; ">Aizat Bin Idris</span></li><li><span class="Apple-style-span" style="font-size: 15.8333px; ">Azmirul Izzat Bin Zubad</span></li><li><span class="Apple-style-span" style="font-size: 15.8333px; ">Muhammad Hasyimi Bin Zamri</span></li></ol></span></div><div>Tensai Coder II dianggotai oleh<br /><ol><li><span class="Apple-style-span" style="font-size: 15.8333px; ">Dzulhafiz Bin Abdul Rahim</span></li><li><span class="Apple-style-span" style="font-size: 15.8333px; ">Muhammad Zikri Bin Ismail</span></li><li><span class="Apple-style-span" style="font-size: 15.8333px; ">Siti Syakirah Binti Sazali</span></li></ol> Prestasi kumpulan dari UiTM Perlis adalah membanggakan walaupun mereka kurang pendedahan dan tidak mendapat banyak latihan. Dengan prestasi membanggakan ini, kita akan meneruskan usaha untuk memberi lebih banyak latihan kepada pelajar kita untuk menyertai pertandingan pada tahun hadapan pulak.<br /></div><div><br /></div><div>Keseluruhan keputusan di sini: <span class="Apple-style-span" style="font-size: 15.8333px; "><a href="http://www.iium.edu.my/acmicpc/upload/html/">http://www.iium.edu.my/acmicpc/upload/html/</a></span></div>Galeri Gambar di UIA: <a href="http://www.iium.edu.my/acmicpc/upload/ACMICPCRegionalMalaysia2010/index.html">http://www.iium.edu.my/acmicpc/upload/ACMICPCRegionalMalaysia2010/index.html</a><br /><br /><div><br /></div><div>Barisan para hakim<br /><br /><a onblur="try {parent.deselectBloggerImageGracefully();} catch(e) {}" href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgVTRgzvaZMcI9ThuvIDi2eShIg2YjiSVVdY65vEjQENHDwSQTqu3SjZ4NBGA71XHEXzgZCPKkqmZJaFz1v_gvbI8Y1YKeEo2gbKLIFJZLSzsu3N86us79sZ49ZpOn8hJXkDtfazvR0Vf15/s1600/dsc00238-qpr.jpg"><img style="cursor:pointer; cursor:hand;width: 400px; height: 300px;" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgVTRgzvaZMcI9ThuvIDi2eShIg2YjiSVVdY65vEjQENHDwSQTqu3SjZ4NBGA71XHEXzgZCPKkqmZJaFz1v_gvbI8Y1YKeEo2gbKLIFJZLSzsu3N86us79sZ49ZpOn8hJXkDtfazvR0Vf15/s400/dsc00238-qpr.jpg" border="0" alt="" id="BLOGGER_PHOTO_ID_5553022014604501746" /></a><br />Membuat mock questions<br /><a onblur="try {parent.deselectBloggerImageGracefully();} catch(e) {}" href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjKwanNa_dzuo0LDeNGXS0cI_Jjbpt4gfnsa_uPq70tpwYFDdE8qSTc8Qv_UJ0JXKe2cxgEPtiwFAWkvpPj10rxZ4Ex4p2bLxGbIleQkizgybqq_Gf885Y-6X0pOhsJB0QxehARFubVEABR/s1600/p1010227-qpr.jpg"><img style="cursor:pointer; cursor:hand;width: 400px; height: 300px;" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjKwanNa_dzuo0LDeNGXS0cI_Jjbpt4gfnsa_uPq70tpwYFDdE8qSTc8Qv_UJ0JXKe2cxgEPtiwFAWkvpPj10rxZ4Ex4p2bLxGbIleQkizgybqq_Gf885Y-6X0pOhsJB0QxehARFubVEABR/s400/p1010227-qpr.jpg" border="0" alt="" id="BLOGGER_PHOTO_ID_5553022008754243586" /></a><br />Sedang tekun memahami soalan<br /><a onblur="try {parent.deselectBloggerImageGracefully();} catch(e) {}" href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjsDY2eGGSSyLYJUt1OydfOpqqV1ZoS74z2gv3Fgepih1kXWP4Yxhbzj-K3GP0JuRxLOguiuHhRoUHGx6ObLzh8zk6ngIf3WrXK5opvrmgVvKY0Z3GtvD-p0nCI3BV1B0wcHsQxNN_p2PP4/s1600/dsc00226-qpr.jpg"><img style="cursor:pointer; cursor:hand;width: 400px; height: 300px;" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjsDY2eGGSSyLYJUt1OydfOpqqV1ZoS74z2gv3Fgepih1kXWP4Yxhbzj-K3GP0JuRxLOguiuHhRoUHGx6ObLzh8zk6ngIf3WrXK5opvrmgVvKY0Z3GtvD-p0nCI3BV1B0wcHsQxNN_p2PP4/s400/dsc00226-qpr.jpg" border="0" alt="" id="BLOGGER_PHOTO_ID_5553022003761621282" /></a><br />Baru mula pertandingan jadi belum ada belon lagi. Belon diberi bila ada soalan yang telah dapat diselesaikan.<br /><a onblur="try {parent.deselectBloggerImageGracefully();} catch(e) {}" href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiDocDJsxHQcJqrwt6Qxyh7J8OZhtJJSzomur7QssobHBfu75xW0mASEf9OpJ9v_YObOD4AGlNjW_lXT8B_cqEJIrj42coTLOi6csIKnn6euBGnCS5IxJ2tmPDXpORpaYVnELnpG34Z3-13/s1600/dsc00222-qpr.jpg"><img style="cursor:pointer; cursor:hand;width: 400px; height: 300px;" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiDocDJsxHQcJqrwt6Qxyh7J8OZhtJJSzomur7QssobHBfu75xW0mASEf9OpJ9v_YObOD4AGlNjW_lXT8B_cqEJIrj42coTLOi6csIKnn6euBGnCS5IxJ2tmPDXpORpaYVnELnpG34Z3-13/s400/dsc00222-qpr.jpg" border="0" alt="" id="BLOGGER_PHOTO_ID_5553022003115215522" /></a></div>Naimahhttp://www.blogger.com/profile/12970333781386290368noreply@blogger.com1tag:blogger.com,1999:blog-7188451967405892201.post-50258555632794370912010-07-19T13:12:00.004+08:002010-07-20T13:48:41.332+08:00Learning and Intelligent OptimizatioN LION 5, Jan 17-21, 2011, Rome, Italy<a href="http://www.intelligent-optimization.org/LION5/"><br /><img src="http://lion.dit.unitn.it/~battiti/images/lion-small-new.jpg" /><br />LION 5, Learning and Intelligent OptimizatioN,<br />Rome - Italy, Jan 17-21 201</a>0<span class="Apple-style-span" style=" border-collapse: collapse; font-family:Arial, Verdana;font-size:13px;"><p></p></span><span class="Apple-style-span" style=" border-collapse: collapse; font-family:Arial, Verdana;font-size:13px;"><p style="text-align: justify; font-size: 10pt; "><b>Short call for papers: </b></p><p style="text-align: justify; font-size: 10pt; ">The LION conference aims at exploring the intersections between machine learning, artificial intelligence, mathematical programming and algorithms for hard optimization problems. The main purpose of the event is to bring together experts from all these areas to present and discuss new ideas, new methods, general trends, challenges and opportunities in applications as well as in research aiming at algorithmic advances. The conference program will consist of plenary presentations, introductory and advanced tutorials, technical presentations, and it will give ample time for discussions.</p><p style="text-align: justify; font-size: 10pt; "></p><h2 style="color: rgb(166, 36, 36); ">Scope of the conference</h2><p style="text-align: justify; font-size: 10pt; ">The large variety of heuristic algorithms for hard optimization problems raises numerous interesting and challenging issues. Practitioners are confronted with the burden of selecting the most appropriate method, in many cases through an expensive algorithm configuration and parameter tuning process, and subject to a steep learning curve. Scientists seek theoretical insights and demand a sound experimental methodology for evaluating algorithms and assessing strengths and weaknesses. A necessary prerequisite for this effort is a clear separation between the algorithm and the experimenter, who, in too many cases, is "in the loop" as a crucial intelligent learning component. Both issues are related to designing and engineering ways of "learning" about the performance of different techniques, and ways of using past experience about the algorithm behavior to improve performance in the future. Intelligent learning schemes for mining the knowledge obtained from different runs or during a single run can improve the algorithm development and design process and simplify the applications of high-performance optimization methods. Combinations of algorithms can further improve the robustness and performance of the individual components provided that sufficient knowledge of the relationship between problem instance characteristics and algorithm performance is obtained.</p><p></p><h3 style="color: rgb(166, 36, 36); ">Important Dates</h3><table style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; -webkit-border-horizontal-spacing: 0px; -webkit-border-vertical-spacing: 0px; border-collapse: collapse; vertical-align: top; text-align: justify; "><tbody><tr style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; -webkit-border-horizontal-spacing: 0px; -webkit-border-vertical-spacing: 0px; border-collapse: collapse; vertical-align: top; text-align: justify; "><th><span style="color:red;">Submission deadline</span></th><td style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; -webkit-border-horizontal-spacing: 0px; -webkit-border-vertical-spacing: 0px; border-collapse: collapse; vertical-align: top; text-align: justify; "><span style="color:red;">October 16, 2010</span></td></tr><tr style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; -webkit-border-horizontal-spacing: 0px; -webkit-border-vertical-spacing: 0px; border-collapse: collapse; vertical-align: top; text-align: justify; "><th>Notification of acceptance</th><td style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; -webkit-border-horizontal-spacing: 0px; -webkit-border-vertical-spacing: 0px; border-collapse: collapse; vertical-align: top; text-align: justify; ">November 27, 2010</td></tr><tr style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; -webkit-border-horizontal-spacing: 0px; -webkit-border-vertical-spacing: 0px; border-collapse: collapse; vertical-align: top; text-align: justify; "><th>Conference</th><td style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; -webkit-border-horizontal-spacing: 0px; -webkit-border-vertical-spacing: 0px; border-collapse: collapse; vertical-align: top; text-align: justify; ">January 17-21, 2011</td></tr><tr style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; -webkit-border-horizontal-spacing: 0px; -webkit-border-vertical-spacing: 0px; border-collapse: collapse; vertical-align: top; text-align: justify; "><th>Camera ready for post-proceedings </th><td style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; -webkit-border-horizontal-spacing: 0px; -webkit-border-vertical-spacing: 0px; border-collapse: collapse; vertical-align: top; text-align: justify; ">February 18, 2011</td></tr></tbody></table><h3 style="color: rgb(166, 36, 36); ">Relevant Research Areas</h3><p style="text-align: justify; font-size: 10pt; ">LION 5 solicits contributions dealing with all aspects of learning and intelligent optimization. Topics of interest include, but are not limited to:</p><ul><li>Metaheuristics such as tabu search, iterated local search, evolutionary algorithms, memetic algorithms, ant colony optimization, and particle swarm optimization</li><li>Hybridizations of metaheuristics with other techniques for optimization</li><li>Supervised, unsupervised and reinforcement learning applied to heuristic search</li><li>Reactive search optimization</li><li>Self-adaptive algorithms</li><li>Hyperheuristics</li><li>Algorithm portfolios and off-line tuning methods</li><li>Multiscale and multilevel methods</li><li>Algorithms for dynamic, stochastic and multi-objective problems</li><li>Interface(s) between discrete and continuous optimization</li><li>Experimental analysis and modeling of algorithms</li><li>Theoretical foundations</li><li>Parallelization of optimization algorithms</li><li>Memory-based optimization</li><li>Software engineering of learning and intelligent optimization methods.</li></ul></span>Naimahhttp://www.blogger.com/profile/12970333781386290368noreply@blogger.comtag:blogger.com,1999:blog-7188451967405892201.post-70849415016439734992010-07-19T12:57:00.003+08:002010-07-20T13:49:11.460+08:00IJCAI-11 22nd International Joint Conference on Artificial Intelligence<span class="Apple-style-span" style=" color: rgb(51, 51, 51); font-family:Arial;font-size:12px;"><div class="header" style="margin-top: 0px; margin-right: 0px; margin-bottom: 15px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; color: rgb(134, 0, 15); font-size: 15px; line-height: 14px; text-decoration: none; font-weight: bold; ">Call for papers</div><p align="justify" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">The IJCAI-11 Program Committee invites submissions of technical papers for IJCAI-11, to be held in Barcelona, Spain, July 19-22, 2011. Submissions are invited on significant, original, and previously unpublished research on all aspects of artificial intelligence.</p><p align="justify" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">The theme of IJCAI-11 is “Integrated and Embedded Artificial Intelligence” (IEAI) with a focus on artificial intelligence that crosses discipline boundaries within AI, and between AI and other disciplines. Building systems often requires techniques from more than one area (e.g. both machine learning and natural language processing, or both planning and preference representation). In addition, larger systems often have AI components embedded within that provide intelligent functionalities such as learning and reasoning. The conference will include a special track dedicated to such work.</p><p align="justify" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "> </p><div class="tittle" style="margin-top: 10px; margin-right: 0px; margin-bottom: 10px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; color: rgb(0, 0, 0); line-height: 14px; text-decoration: none; font-weight: bold; ">Important dates</div><div align="justify" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><ul style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Abstract submission: Jan 19, 2011 (11:59PM, UTC-12)</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Paper submission: Jan 24, 2011 (11:59PM, UTC-12)</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Author feedback: Feb 28-Mar 3, 2011 (11:59PM, UTC-12).</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Notification of acceptance/rejection: Mar 31, 2011</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Camera-ready copy due: Apr 15, 211</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Technical sessions: Jul 19-22, 2011</li></ul></div><p align="justify" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "> </p><div class="tittle" style="margin-top: 10px; margin-right: 0px; margin-bottom: 10px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; color: rgb(0, 0, 0); line-height: 14px; text-decoration: none; font-weight: bold; ">Details</div><div class="tittle" style="margin-top: 10px; margin-right: 0px; margin-bottom: 10px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; color: rgb(0, 0, 0); line-height: 14px; text-decoration: none; font-weight: bold; "><a href="http://ijcai-11.iiia.csic.es/">http://ijcai-11.iiia.csic.es/</a></div><p align="justify" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "> </p><div class="tittle" style="margin-top: 10px; margin-right: 0px; margin-bottom: 10px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; color: rgb(0, 0, 0); line-height: 14px; text-decoration: none; font-weight: bold; ">List of keywords</div><p align="justify" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><strong style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Agent-based and Multiagent Systems</strong></p><div align="justify" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><ul style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Agent Theories and Architectures</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Agent Communication</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Agreement Technologies Argumentation</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Auctions and Market-Based Systems</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Coordination and Collaboration</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Distributed AI</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">E-Commerce</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Game Theory</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Multiagent Learning</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Multiagent Planning</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Multiagent Systems</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Simulation and Emergent Behavior</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Social Choice</li></ul></div><p align="justify" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "> </p><p align="justify" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><strong style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Constraints, Satisfiability, and Search</strong></p><div align="justify" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><ul style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Applications</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Constraint Optimization</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Constraint Satisfaction</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Distributed Constraints</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Dynamic Programming</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Evaluation and Analysis</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Global Constraints</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Heuristic Search</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Meta-heuristics</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Quantifier Formulations</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Satisfiability</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Modeling</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Search</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Solvers and Tools</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Symmetry</li></ul></div><p align="justify" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "> </p><p align="justify" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><strong style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Knowledge Representation, Reasoning and Logic</strong></p><div align="justify" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><ul style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Action, Change and Causality</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Automated Reasoning and Theorem Proving</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Beliefs and Knowledge</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Common-Sense Reasoning</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Computational Complexity</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Description Logics and Ontologies</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Diagnosis and Abductive Reasoning</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Geometric, Spatial, and Temporal Reasoning</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Knowledge Representation</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Logic Programming</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Many-Valued and Fuzzy Logics</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Nonmonotonic Reasoning</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Preferences</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Qualitative Reasoning</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Reasoning with Beliefs</li></ul></div><p align="justify" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "> </p><p align="justify" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><strong style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Machine Learning</strong></p><div align="justify" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><ul style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Active Learning</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Case-based Reasoning</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Classification</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Cost-Sensitive Learning</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Data Mining</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Deep Learning</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Ensemble Methods</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Evolutionary Computation</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Feature Selection/Construction</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Kernel Methods</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Learning Graphical Models</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Learning Preferences or Rankings</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Learning Theory</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Machine Learning</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Neural Networks</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Online Learning</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Reinforcement Learning</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Relational Learning</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Semi-Supervised/Unsupervised Learning</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Structured Learning</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Time-series/Data Streams</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Transfer, Adaptation, Multi-task Learning</li></ul></div><p align="justify" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "> </p><p align="justify" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><strong style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Multidisciplinary Topics And Applications</strong></p><div align="justify" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><ul style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">AI and Natural Sciences</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">AI and Social Sciences</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Art and Music</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">AI and Ubiquitous Computing Systems</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Autonomic Computing</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Brain Sciences</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Cognitive Modeling</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Computational Biology and e-Health</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Computer Games</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Computer-Aided Education</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Human-Computer Interaction</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Intelligent Database Systems</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Intelligent User Interfaces</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Interactive Entertainment</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Knowledge-based Software Engineering</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Personalization and User Modeling</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Philosophical and Ethical Issues</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Real-Time Systems</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Security and Privacy</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Validation and Verification</li></ul></div><p align="justify" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "> </p><p align="justify" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><strong style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Natural-Language Processing</strong></p><div align="justify" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><ul style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Dialogue</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Discourse</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Information Extraction</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Information Retrieval</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Machine Translation</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Morphology and Phonology</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Natural Language Generation</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Natural Language Semantics</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Natural Language Summarization</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Natural Language Syntax</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Natural Language Processing</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Psycholinguistics</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Question Answering</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Speech Recognition and Understanding</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Text Classification</li></ul></div><p align="justify" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "> </p><p align="justify" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><strong style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Planning and Scheduling</strong></p><div align="justify" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><ul style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Activity and Plan Recognition</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Applications of Planning</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Conformant/Contingent Planning</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Hierarchical Task Networks</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Hybrid Systems</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Markov Decisions Processes</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">POMDPs</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Plan Execution and Monitoring</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Planning Algorithms</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Planning under Uncertainty</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Real-time Planning</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Robot Planning</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Scheduling</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Search in Planning and Scheduling</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Theoretical Foundations of Planning</li></ul></div><p align="justify" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "> </p><p align="justify" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><strong style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Robotics and Vision</strong></p><div align="justify" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><ul style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Behavior and Control</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Cognitive Robotics</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Human Robot Interaction</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Localization, Mapping, State Estimation</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Manipulation</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Motion and Path Planning</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Multi-Robot Systems</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Robotics</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Sensor Networks</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Vision and Perception</li></ul></div><p align="justify" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "> </p><p align="justify" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><strong style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Uncertainty in AI</strong></p><div align="justify" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><ul style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Approximate Probabilistic Inference</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Bayesian Networks</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Decision/Utility Theory</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Exact Probabilistic Inference</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Graphical Models</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Preference Elicitation</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Sequential Decision Making</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Uncertainty</li></ul></div><p align="justify" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "> </p><p align="justify" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><strong style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Web and Knowledge-based Information Systems</strong></p><div align="justify" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><ul style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Information Extraction</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Information Integration</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Information Retrieval</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Knowledge Acquisition</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Knowledge Engineering</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Knowledge-based Systems</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Ontologies</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Recommender Systems</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Semantic Web</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Social Networks</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Source Wrapping</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Web Mining</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Web Search</li><li class="li-good" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 20px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; ">Web Technologies</li></ul></div></span>Naimahhttp://www.blogger.com/profile/12970333781386290368noreply@blogger.comtag:blogger.com,1999:blog-7188451967405892201.post-45026966500122918972010-06-14T12:00:00.000+08:002010-06-14T12:01:22.444+08:00ICEC 2010 - International Conference on Evolutionary Computation<span class="Apple-style-span" style="font-family: arial, sans-serif; font-size: 15px; border-collapse: collapse; ">-- CALL FOR PAPERS--<br /><br />ICEC 2010 - International Conference on Evolutionary Computation<br />website: <a href="http://www.icec.ijcci.org/" target="_blank" style="color: rgb(42, 93, 176); ">http://www.icec.ijcci.org</a><br /><br />24 - 26 October 2010<br />Valencia - Spain<br /><br />Dear Colleague,<br /><br />ICEC welcomes the submission of position papers.<br />A position paper presents an arguable opinion about an issue. The goal of a position paper is to convince the audience that your opinion is valid and worth listening to, without the need to present completed research work and/or validated results. It is, nevertheless, important to support your argument with evidence to ensure the validity of your claims. A position paper may be a short report and discussion of ideas, facts, situations, methods, procedures or results of scientific research (bibliographic, experimental, theoretical, or other) focused on one of the conference topic areas. The acceptance of a position paper is restricted to the categories of "short paper" or "poster", i.e. a position paper is not a candidate to acceptance as "full paper".<br />All accepted papers will be published in the conference proceedings, under an ISBN reference, on paper and on CD-ROM support and will be also available at the SciTePress Digital Library. BNQL<br /><br />Don't hesitate contacting me should you have any questions.<br /><br />Best regards,<br />Vera Coelho<br />ICEC Secretariat<br /><br />Av. D. Manuel I, 27A 2. esq.<br />2910-595 Setubal, Portugal<br />Tel.: +351 265 100 033<br />Fax: +44 203 014 8638<br />e-mail: <a href="mailto:icec.secretariat@insticc.org" style="color: rgb(42, 93, 176); ">icec.secretariat@insticc.org</a><br /><br />IMPORTANT DATES<br />Position Paper Submission: June 25, 2010<br />Authors Notification (position papers): July 14, 2010<br />Final Position Paper Submission and Registration: July 26, 2010<br /><br />CONFERENCE TOPICS<br />> Genetic Algorithms<br />> Representation Techniques<br />> Software Engineering Issues; Metamodelling<br />> Evolutionary Multiobjective Optimization<br />> Evolutionary Art and Design<br />> Game Theory and Applications<br />> Evolution Strategies<br />> Machine Learning<br />> Artificial Life<br />> Cognitive Systems<br />> Evolutionary Robotics and Intelligent Agents<br />> Society and Cultural Aspects of Evolution<br />> Concurrent Co-operation<br />> Co-evolution and Collective Behavior<br />> Swarm/Collective Intelligence<br />> Biocomputing and Complex Adaptive Systems<br />> Bio-inspired Hardware and Networks<br /><br /><br />PROGRAM COMMITTEE:<br />(see list at <a href="http://www.icec.ijcci.org/program_committee.asp" target="_blank" style="color: rgb(42, 93, 176); ">http://www.icec.ijcci.org/<wbr>program_committee.asp</a>)<br />Program Chair: Agostinho Rosa, IST, Technical University of Lisbon, Portugal<br /><br />IJCCI KEYNOTE SPEAKERS<br />James Bezdek, University of Melbourne, Australia<br />Antonio Sala, Technical University Valencia, Spain<br />Simon M. Lucas, University of Essex, U.K.<br />Panos Pardalos, University of Florida, U.S.A.<br /><br /><br />Sponsored by INSTICC<br />In cooperation with AAAI and WfMC<br /><br />Proceedings indexed by INSPEC*, DBLP, Thomson Reuters Conference Proceedings Citation Index* and EI*<br />*awaiting the confirmation of indexation<br /><br />Best papers published by Springer-Verlag in a SCI Series book</span>Naimahhttp://www.blogger.com/profile/12970333781386290368noreply@blogger.com0tag:blogger.com,1999:blog-7188451967405892201.post-24019913821479035102009-12-24T10:30:00.003+08:002010-07-20T13:47:50.629+08:00Parallel Evolutionary Systems (PES) track at GECCO 2010<div><a href="http://www.sigevo.org/gecco-2010/"></a><span class="Apple-style-span" style=" border-collapse: collapse; font-family:arial, sans-serif;font-size:13px;">==============================<wbr>==============================<br /> Call for Papers<br /> Parallel Evolutionary Systems (PES) track<br /> GECCO 2010<br /> Portland, Oregon, USA July 7-10, 2010</span></div><div><span class="Apple-style-span" style=" border-collapse: collapse; font-family:arial, sans-serif;font-size:13px;"> <a href="http://www.sigevo.org/gecco-2010/">http://www.sigevo.org/gecco-2010/</a><br />==============================<wbr>==============================<br /><br /><br />This track in GECCO aims at developing the cross-fertilization of knowledge between evolutionary algorithms (metaheuristics in general) and parallelism. Parallel algorithms represent a very important topic in all international research programs, and virtually any algorithm can profit from parallelism to create efficient optimization and learning tools capable of unseen performance in complex problems.<br /><br />Working in two domains of research is at the same time difficult and fruitful. Knowing on parallelism and networking helps in creating parallel algorithms for clusters or grids of computers. However, it also needs a careful definition of proper benchmarks, software tools, and metrics to measure the behavior of algorithms in a meaningful and standard way. In concrete, a conceptual separation between physical parallelism and decentralized algorithms (whether implemented in parallel or not) is needed to analyze the resulting algorithms.<br /><br />This track is expected to collect a set of high quality contributions to the theory and the application of techniques born from the crossover of traditional parallelism and metaheuristics. Articles are wanted to provide significant results to problem solving (efficiency and also accuracy) and be methodologically well-founded. Also, the hardware used for running parallel algorithms is a target, in order to analyze how it can be used to provide better optimization and learning techniques.<br /><br />This track includes (but not limits) topics concerning the design, implementation, software, hardware, and application of parallel evolutionary algorithms, and also parallel metaheuristics in general: ACO, PSO, VNS, SS, SA, EDAs, TS, ES, GP, GRASP… As a guide, contributions are welcomed in the following areas:<br /><br />• Parallel evolutionary algorithms<br />• Parallel metaheuristics<br />• Master/slave models<br />• Massively parallel algorithms<br />• Parallel algorithms on Graphical Processing Units (GPUs)<br />• SIMD/MIMD and FPGA parallelization<br />• Distributed and shared memory parallel algorithms<br />• Multicore execution of parallel algorithms<br />• Concurrent algorithms with several threads of execution<br />• Algorithms running in clusters of machines<br />• Grid/cloud computing<br />• Peer to peer (P2P) algorithms<br />• Ad-hoc and mobile networks for parallel algorithms<br />• Parallel software frameworks/libraries<br />• Theory on decentralized and parallel algorithms<br />• Parallel test benchmarks<br />• Parallel hybrid/memetic algorithms<br />• Parallel multiobjective algorithms<br />• Self-adaptive parallel algorithms<br />• Parallel algorithms and dynamic optimization problems (DOP)<br />• Algorithms and tools for helping in designing new parallel algorithms<br />• Competitive/cooperative parallel algorithms and agents<br />• Statistical assessment of performance for parallel algorithms<br />• Unified view of parallel approaches and results<br />• Real-world applications in telecoms, bioinformatics, engineering...<br /><br />Accepted papers will appear in the proceedings of GECCO 2010.<br /><br />IMPORTANT DATES:<br />- January 13, 2010 - Article submission deadline<br />- March 10, 2010 - Notification of article acceptance<br />- April 5, 2010 - Camera-ready version of accepted articles<br />- July 7-11, 2010 - GECCO 2010 Conference<br /><br /><br />Enrique Alba (track chair)<br /></span></div>Naimahhttp://www.blogger.com/profile/12970333781386290368noreply@blogger.comtag:blogger.com,1999:blog-7188451967405892201.post-23452736849398721912009-12-23T11:48:00.003+08:002009-12-23T12:06:42.991+08:00WCCI 2010 2010IEEE World Congress on Computational Intelligence<div style="text-align: center;"><span class="Apple-style-span" style="color:#0000EE;"><span class="Apple-style-span" style="text-decoration: underline;"><a href="http://www.wcci2010.org/home">http://www.wcci2010.org/home</a></span></span></div><span class="Apple-style-span" style="font-family: Arial, Helvetica, Tahoma, sans-serif; font-size: 12px; color: rgb(85, 85, 85); line-height: 15px; word-spacing: 1px; "><table class="contentpaneopen" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; width: 510px; font-size: 1.1em; "><tbody style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><tr style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><td class="contentheading" width="100%" style="margin-top: 0px; margin-right: 0px; margin-bottom: 2px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; line-height: 22px; font-size: 16px; height: 22px; background-image: url(http://www.wcci2010.org/templates/jp_business/images/sep.gif); background-repeat: repeat-x; background-attachment: initial; -webkit-background-clip: initial; -webkit-background-origin: initial; background-color: initial; color: rgb(226, 0, 26); font-weight: bold; text-align: left; background-position: 50% 100%; "><span class="Apple-style-span" style="color: rgb(85, 85, 85); font-size: 13px; font-weight: normal; line-height: 16px; -webkit-border-horizontal-spacing: 0px; -webkit-border-vertical-spacing: 0px; "><table class="contentpaneopen" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; width: 510px; font-size: 1.1em; "><tbody style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><tr style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><td class="contentheading" width="100%" style="margin-top: 0px; margin-right: 0px; margin-bottom: 2px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; line-height: 22px; font-size: 16px; height: 22px; background-image: url(http://www.wcci2010.org/templates/jp_business/images/sep.gif); background-repeat: repeat-x; background-attachment: initial; -webkit-background-clip: initial; -webkit-background-origin: initial; background-color: initial; color: rgb(226, 0, 26); font-weight: bold; text-align: left; background-position: 50% 100%; ">Welcome</td></tr></tbody></table><table class="contentpaneopen" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; width: 510px; font-size: 1.1em; "><tbody style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><tr style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><td valign="top" colspan="2" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; line-height: 19px; "><p style="margin-top: 10px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; line-height: 19px; text-align: justify; ">The 2010 IEEE World Congress on Computational Intelligence (IEEE WCCI 2010) is the largest technical event in the field of computational intelligence. It will host three conferences: the 2010 International Joint Conference on Neural Networks (IJCNN 2010), the 2010 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE 2010), and the 2010 IEEE Congress on Evolutionary Computation (IEEE CEC 2010). IEEE WCCI 2010 will be held in Barcelona, a Mediterranean city located in a privileged position on the northeastern coast of Spain. </p></td></tr></tbody></table></span><br />Call For Papers</td></tr></tbody></table><table class="contentpaneopen" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; width: 510px; font-size: 1.1em; "><tbody style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><tr style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; "><td valign="top" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; line-height: 16px; "><p style="margin-top: 10px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; line-height: 16px; ">Prospective authors are invited to contribute high-quality papers to IEEE WCCI 2010. All papers should be submitted electronically through the Congress website (<a href="http://www.wcci2010.org/submission" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; overflow-x: hidden; overflow-y: hidden; text-decoration: none; color: rgb(102, 102, 153); ">http://www.wcci2010.org/submission</a>). Contributed papers will be refereed by experts in the fields based on the criteria of originality, significance, quality and clarity.</p></td></tr></tbody></table><br /></span><div><span class="Apple-style-span" style="font-family:Arial, Helvetica, Tahoma, sans-serif;font-size:100%;color:#555555;"><span class="Apple-style-span" style="font-size: 12px; line-height: 15px; word-spacing: 1px;"><h1 class="contentheading" style="margin-top: 0px; margin-right: 0px; margin-bottom: 2px; margin-left: 0px; padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; font-size: 16px; line-height: 22px; height: 22px; background-image: url(http://www.wcci2010.org/templates/jp_business/images/sep.gif); background-repeat: repeat-x; background-attachment: initial; -webkit-background-clip: initial; -webkit-background-origin: initial; background-color: initial; color: rgb(226, 0, 26); font-weight: bold; text-align: left; background-position: 50% 100%; "><span class="Apple-style-span" style="font-size:100%;color:#555555;"><span class="Apple-style-span" style="font-size: 12px; font-weight: normal; line-height: 15px;"><span class="Apple-style-span" style="font-size:130%;color:#E2001A;"><span class="Apple-style-span" style="font-size: 16px; line-height: 22px;"><b><br /></b></span></span></span></span></h1><div>Paper submission deadline - January 31, 2010</div><div>Conference Date: July 18 - 23, 2010</div></span></span></div>Naimahhttp://www.blogger.com/profile/12970333781386290368noreply@blogger.com1tag:blogger.com,1999:blog-7188451967405892201.post-16071366776062706732009-11-16T23:54:00.008+08:002009-11-26T13:33:10.972+08:00Al-Fatihah untuk Arwah Kak Jamsiah Mohd Hussin (7 Jun 1940 - 15 Nov 2009)<div style="text-align: center;"><br /></div><span class="Apple-style-span" style="font-family:'times new roman';">Al-Fatihah untuk Arwah Kak Jamsiah Mohd Hussin (kakak sulong keluarga kami) yang telah kembali kerahmatullah tepat jam 2:05 pagi 15 November 2009.</span><div><br /></div><div><img src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEidUrqEPDj4iyyJtLYJgZ1sUP1VFcl1_dkZxcMcxuJUUHxW-NBartVcJ8rvzuS1ySQoGIXnpOhwHCzKh_gCDY78sEwFTZxlBwWcNok1RDCfgn9mPv1AOg8xkNZQhjU3_ICZWJnX2gpaJ3fv/s320/01-alfatihah.jpg" style="display:block; margin:0px auto 10px; text-align:center;cursor:pointer; cursor:hand;width: 320px; height: 190px;" border="0" alt="" id="BLOGGER_PHOTO_ID_5404993002317679266" /></div><div style="text-align: left;"><div style="text-align: left;">1<span class="Apple-tab-span" style="white-space:pre"> </span><i> Dengan menyebut nama Allah Yang Maha Pemurah lagi Maha Penyayang.</i><span class="Apple-tab-span" style="white-space:pre"><i> </i></span><i> </i></div><div style="text-align: left;"><i>2</i><span class="Apple-tab-span" style="white-space:pre"><i> </i></span><i> Segala puji bagi Allah, Tuhan semesta alam.</i><span class="Apple-tab-span" style="white-space:pre"><i> </i></span></div><div style="text-align: left;"><i>3</i><span class="Apple-tab-span" style="white-space:pre"><i> </i></span><i> Maha Pemurah lagi Maha Penyayang.</i><span class="Apple-tab-span" style="white-space:pre"><i> </i></span><i> </i></div><div style="text-align: left;"><i>4</i><span class="Apple-tab-span" style="white-space:pre"><i> </i></span><i> Yang menguasai di Hari Pembalasan</i><span class="Apple-tab-span" style="white-space:pre"><i> </i></span></div><div style="text-align: left;"><i>5</i><span class="Apple-tab-span" style="white-space:pre"><i> </i></span><i> Hanya Engkaulah yang kami sembah, dan hanya kepada Engkaulah kami meminta pertolongan.</i><span class="Apple-tab-span" style="white-space:pre"><i> </i></span><i> </i></div><div style="text-align: left;"><i>6</i><span class="Apple-tab-span" style="white-space:pre"><i> </i></span><i> Tunjukilah kami jalan yang lurus,</i><span class="Apple-tab-span" style="white-space:pre"><i> </i></span><i> </i></div><div style="text-align: left;"><i>7</i><span class="Apple-tab-span" style="white-space:pre"><i> </i></span><i> (yaitu) Jalan orang-orang yang telah Engkau beri ni'mat kepada mereka; bukan (jalan) mereka yang dimurkai dan bukan (pula jalan) mereka yang sesat.</i><span class="Apple-tab-span" style="white-space:pre"><i> </i></span><i> </i></div><div style="text-align: left;"><br /></div><span><div style="text-align: left;"><i><span class="Apple-style-span" style="font-style: normal;"><br /></span></i></div></span><div style="text-align: left;"><i><br /></i></div><div style="text-align: left;"> Kak adalah anak kelima dan kakak sulung kami dari 15 adik beradik (5 perempuan dan 10 lelaki). Tiga abang sulong dari mak lain telahpun meninggal. Kami juga telahpun lama kehilangan kedua-dua ayah dan mak, ayah meninggal pada tahun 1973 manakala mak menyusul kemudian pada awal tahun 1976 dan dikebumikan di Mekah sehari sebelum beliau sepatutnya pulang ke Malaysia. Oleh itu kak lah yang jadi pengganti kepada mak dan semasa hayatnya beliau banyak mengasuh adik-adik, anak-anaknya dan juga anak saudara.</div><div style="text-align: left;"><br /></div><div style="text-align: left;"> Pengorbanan kak pada keluarga amat besar kerana memikul tanggungjawab sebagai ibu. Beliau amat setia menghuni rumah pusaka di kampung di mana ianya menjadi tempat kami berkumpul walaupun tanpa mak dan ayah. Alhamdulillah ikatan kekeluargaan tetap akrab dan kerap kali kami dapat berkumpul pada Hari Raya (selalunya pada hari raya ketiga). </div><div style="text-align: left;"><br /></div><div style="text-align: left;"> Selepas suami kak meninggal pada tahun 2001, Kak mula tinggal dengan anak-anaknya di Kangar atau KL. Kak pulak, sejak sebelum berkawin lagi kerap kali diduga dengan penyakit yang kadang-kadang menjadi misteri bagi kami. Semasa hayatnya dia selalu saja pening kepala, ditambah pulak dengan penyakit kencing manis dan arthritis. Selepas pembedahan jantung yang dilaluinya pada penghujung tahun lepas, beliau tidak dapat kembali pulih dengan sepenuhnya. Keadaannya makin merosot dan pada petang Jumaat 13 Nov beliau dimasukkan ke PPUM apabila anaknya mendapati dia sukar bernafas. Paru-parunya didapati berair, jantung lemah, oksigen kurang dari 50% dan tahap karbon dioksid terlampau tinggi. Kami dari Alor Setar mula turun ke KL selepas dimaklumkan bahawa keadannya amat kritikal. Pada petang Sabtu doktor menyatakan bahawa kak sebenarnya dalam keadaan nazak dan keluarga perlu buat keputusan samada untuk meneruskan dengan rawatan atau bawa balik. Kami memutuskan untuk bawa balik supaya dia dapat menghembuskan nafas terakhir di rumah di kelilingi keluarga.</div><div style="text-align: left;"><br /></div><div style="text-align: left;"> Kak dibawa balik ke rumah Kak Arah. Kami tau yang Kak memang nak balik ke Alor Setar tapi keadaannya masa itu memang tak mengizinkan. Selepas sampai di rumah dan selepas bantuan oksigen dihentikan kami dimaklumkan yang selalunya pesakit hanya dapat bertahan selama setengah jam sahaja. Semua adik-adik kak (kecuali Bang Cik yang berada di Alor Setar) dan anak-anaknya ada dan kami sempat memohon ampun dan maaf serta menghalalkan segalanya supaya kak dapat pergi dengan aman. Beliau memang dalam keadaan sedar masa itu sebab apa yang kami nyatakan, dia memberi maklum balas. Masa itu abang sulong sekarang iaitu Bang Pin dari Kuala Kangsar belum sampai. Selepas setengah jam kak masih bertahan dan masih dalam keadaan sedar, dapat bercakap dan membaca ayat-ayat Al-Quran. Tapi kami dapat lihat bahawa kak dalam keadaan sakit dan sukar menarik nafas. Selepas solat Maghrib kami mula beramai-ramai membaca Yasin, solat Isyak dan solat hajat. Bang Pin dan isterinya Kak Timah sampai lebih kurang jam 11mlm. Masa dengan Kak Timah, kak nak sembahyang Isyak katanya dan Kak Timah bantu dia walaupun tak sempurna solatnya. Selepas itu ada yang dah balik dan ada yang dah tidor, saya pulak tak balik ke USJ, duk dalam bilik kak bersama anak-anaknya, Kak Arah, Abang Lah dan Zati. Kak menghembuskan nafasnya yang terakhir pada 2:05 pagi 15 Nov 2009. </div><div style="text-align: left;"><br /></div><div style="text-align: left;"> Oleh kerana banyak kali Kak sebut nak balik Alor Setar maka anak-anak dan adik-adik dah buat keputusan supaya jenazah disemadikan di Alor Setar. Jenazah dimandikan dan dikapan di TTDI, KL. Van jenazah tiba di Alor Setar pada jam 12:30 tgh dan selepas solat Asar, jenazah selamat dikebumikan. Semoga Allah memberi keampunan bagi kak, sesungguhnya kak banyak berjasa kepada keluarga, kami semua sayang pada kak, halalkan makan minum kami, kami mohon ampun dan maaf di atas segala kesalahan dan kekasaran bahasa samada secara sedar atau tidak sedar dan kami juga memaafkan kak dan menghalalkan segalanya, kami redha sebagaimana kakpun redha atas segala-galanya. Ya Allah ya Tuhan ku, anugerahkanlah rahmatMu, ampunkan kakak ku dan tempatkan kak bersama orang-orang yang soleh. Amin.</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;"><div style="text-align: center; "><span class="Apple-style-span" style="line-height: 19px; font-family:sans-serif;"><b><span class="Apple-style-span" style="font-size:medium;"><i>Inna lillahi wa inna ilayhi raji'un</i></span></b><span class="Apple-style-span" style="font-size:medium;"><i> </i>(انّا للہ و انّا الیہ راجعون)<i> </i></span><span class="Apple-style-span" style="line-height: 16px; color: rgb(51, 51, 51); font-family:'Lucida Grande', Verdana, Arial, sans-serif;"><span class="Apple-style-span" style="font-size:medium;"><i>“Sesungguhnya kami adalah kepunyaan Allah dan kepada Allah jualah kami kembali.”</i></span></span></span></div><div style="text-align: left; "><span class="Apple-style-span" style="font-family:'Lucida Grande', Verdana, Arial, sans-serif;font-size:100%;color:#333333;"><span class="Apple-style-span" style="line-height: 16px; font-size:13px;"><i><br /></i></span></span></div><div style="text-align: center; "><span class="Apple-style-span" style="font-size:medium;"></span></div><span><div style="text-align: center; "><span class="Apple-style-span" style="font-style: italic; ">Ya Tuhan kami, berilah kami keampunan dan keampunan bagi saudara-saudara kami yang telah beriman lebih dahulu daripada kami. (al-Hasyr: 10).</span></div><div style="text-align: center; "><i><br /></i></div></span><span></span><span></span></div></div>Naimahhttp://www.blogger.com/profile/12970333781386290368noreply@blogger.com1tag:blogger.com,1999:blog-7188451967405892201.post-23509483332359063882009-11-06T13:48:00.001+08:002009-11-06T13:51:26.264+08:00META 2010<span class="Apple-style-span" style="font-family: Helvetica, Arial, sans-serif; font-size: 12px; color: rgb(51, 51, 51); line-height: 15px; "><h2 style="padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; font-family: Arial, Helvetica, sans-serif; font-size: 2em; font-weight: bold; vertical-align: bottom; color: rgb(51, 51, 51); text-align: left; width: 742px; ">International Conference on Metaheuristics and Nature Inspired Computing</h2><p style="margin-top: 0px; margin-bottom: 0px; ">The 3rd International Conference on Metaheuristics and Nature Inspired Computing, META’10, will held in Djerba Island in Tunisia ().</p><p class="vspace" style="margin-top: 1.33em; margin-bottom: 0px; ">The Conference will be an exchange space thanks to the sessions of the research works presentations and also will integrate tutorials and a vocational training of metaheuristics and nature inspired computing.</p><p class="vspace" style="margin-top: 1.33em; margin-bottom: 0px; ">The scope of the META’2010 conference includes, but is not limited to:</p><ul style="margin-top: 0px; margin-bottom: 0px; "><li>Local search, tabu search, simulated annealing, VNS, ILS, …</li><li>Evolutionary algorithms, swarm optimization, scatter search, …</li><li>Emergent nature inspired algorithms: quantum computing, artificial immune systems, bee colony, DNA computing, …</li><li>Parallel algorithms and hybrid methods with metaheuristics, machine learning, game theory, mathematical programming, constraint programming, co-evolutionary, …</li><li>Application to: logistics and transportation, telecommunications, scheduling, data mining, engineering design, bioinformatics, …</li><li>Theory of metaheuristics, landscape analysis, convergence, problem difficulty, very large neighbourhoods, …</li><li>Application to multi-objective optimization</li><li>Application in dynamic optimization, problems with uncertainty, …</li></ul><div><br /></div><div><h3 style="padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; font-family: Arial, Helvetica, sans-serif; font-size: 1.8em; font-weight: bold; vertical-align: bottom; color: rgb(51, 51, 51); text-align: left; width: 742px; ">Conference</h3><ul style="margin-top: 0px; margin-bottom: 0px; "><li>October 28-30, 2010</li></ul><div class="vspace" style="margin-top: 1.33em; text-align: left; "></div><h3 style="padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; font-family: Arial, Helvetica, sans-serif; font-size: 1.8em; font-weight: bold; vertical-align: bottom; color: rgb(51, 51, 51); text-align: left; width: 742px; ">Paper:</h3><ul style="margin-top: 0px; margin-bottom: 0px; "><li>Submission of a paper: May 15, 2010</li><li>Notification: July 15, 2010</li><li>Final version: September 15, 2010</li></ul><div class="vspace" style="margin-top: 1.33em; text-align: left; "></div><h3 style="padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; font-family: Arial, Helvetica, sans-serif; font-size: 1.8em; font-weight: bold; vertical-align: bottom; color: rgb(51, 51, 51); text-align: left; width: 742px; ">Session:</h3><ul style="margin-top: 0px; margin-bottom: 0px; "><li>Submission of a session: May 15, 2010</li><li>Notification: June 15, 2010</li></ul><div class="vspace" style="margin-top: 1.33em; text-align: left; "></div><h3 style="padding-top: 0px; padding-right: 0px; padding-bottom: 0px; padding-left: 0px; font-family: Arial, Helvetica, sans-serif; font-size: 1.8em; font-weight: bold; vertical-align: bottom; color: rgb(51, 51, 51); text-align: left; width: 742px; ">Tutorial:</h3><ul style="margin-top: 0px; margin-bottom: 0px; "><li>Submission of a session: May 15, 2010</li><li>Notification: June 15, 2010</li></ul><div><br /></div></div><div><a href="http://www2.lifl.fr/META10/index.php?n=Main.HomePage">http://www2.lifl.fr/META10/index.php?n=Main.HomePage</a></div></span>Naimahhttp://www.blogger.com/profile/12970333781386290368noreply@blogger.com0tag:blogger.com,1999:blog-7188451967405892201.post-89570535597552609482009-10-30T13:17:00.000+08:002009-10-30T13:21:06.538+08:00CAMP’10: International Conference on Information Retrieval and Knowledge Management 2010<span class="Apple-style-span" style="font-family: arial, sans-serif; font-size: 13px; border-collapse: collapse; "><p class="MsoNormal" align="center" style="margin-top: 0in; margin-right: 9pt; margin-bottom: 3pt; margin-left: 9pt; text-align: center; "><b><span lang="EN-GB" style="font-size: 14pt; font-family: Arial; color: black; ">Call for Papers </span></b><b><span lang="EN-GB" style="font-family: Arial; color: rgb(51, 204, 51); ">(Extended deadline: 3 November 2009)</span></b><span lang="EN-GB"></span></p><div class="im" style="color: rgb(80, 0, 80); "><p class="MsoNormal" align="center" style="margin-top: 0in; margin-right: 9pt; margin-bottom: 3pt; margin-left: 9pt; text-align: center; "><b><span lang="EN-GB" style="font-family: Arial; color: rgb(0, 0, 204); ">CAMP’10: International Conference on Information Retrieval and Knowledge Management 2010</span></b><span lang="EN-GB"></span></p><p class="MsoNormal" align="center" style="margin-top: 0in; margin-right: 9pt; margin-bottom: 3pt; margin-left: 9pt; text-align: center; "><b><span lang="EN-GB" style="font-family: Arial; ">16–18 March 2010, Shah Alam, Malaysia</span></b><span lang="EN-GB"></span></p><p class="MsoNormal" align="center" style="margin-top: 0in; margin-right: 9pt; margin-bottom: 3pt; margin-left: 9pt; text-align: center; "><b><span lang="EN-GB" style="font-size: 10pt; font-family: 'Courier New'; color: rgb(0, 0, 204); "><a href="http://fskm.uitm.edu.my/camp10" target="_blank" style="color: rgb(42, 93, 176); ">http://fskm.uitm.edu.my/camp10</a></span></b><span lang="EN-GB"></span></p><p class="MsoNormal" align="center" style="margin-top: 0in; margin-right: 9pt; margin-bottom: 3pt; margin-left: 9pt; text-align: center; "><span lang="EN-GB"><br /><br /></span></p><p class="MsoNormal" align="center" style="margin-top: 0in; margin-right: 9pt; margin-bottom: 12pt; margin-left: 9pt; text-align: center; "><span style="font-size: 10pt; font-family: Arial; color: rgb(102, 153, 255); ">[Please excuse us if you are receiving this CFP more than once]</span><span></span></p></div><div align="center"><table width="701" border="0" cellpadding="0" style="background-image: none; background-repeat: repeat; background-attachment: scroll; -webkit-background-clip: initial; -webkit-background-origin: initial; background-color: white; width: 525.7pt; background-position: 0% 0%; "><tbody><tr><td style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font-family: arial, sans-serif; padding-top: 0.75pt; padding-right: 0.75pt; padding-bottom: 0.75pt; padding-left: 0.75pt; "><p class="MsoNormal" style="margin-top: 0in; margin-right: 9pt; margin-bottom: 6pt; margin-left: 9pt; "><span lang="EN-GB" style="font-size: 10pt; font-family: Arial; color: black; ">Dear Colleagues,</span><span lang="EN-GB"></span></p><p class="MsoNormal" style="margin-top: 0in; margin-right: 9pt; margin-bottom: 6pt; margin-left: 9pt; text-align: justify; "><span lang="EN-GB" style="font-size: 10pt; font-family: Arial; color: black; ">It is our pleasure to invite you to CAMP’10 to share your research findings and experience in the field of Information Retrieval in support for Knowledge Management</span><span lang="EN-GB" style="font-size: 10pt; font-family: Arial; ">. This conference is organised by <i>PECAMP</i>, the Malaysian society of Information Retrieval and Knowledge Management together with <i>Universiti Teknologi MARA</i>, <i>Universiti Pertahanan Nasional Malaysia</i> and <i>Universiti Kebangsaan Malaysia</i>, and is supported by the <i>IEEE Malaysian Section</i> and the<i>IEEE Computer Society</i>. </span><span lang="EN-GB"></span></p><div class="im" style="color: rgb(80, 0, 80); "><p class="MsoNormal" align="center" style="margin-top: 0in; margin-right: 9pt; margin-bottom: 6pt; margin-left: 9pt; text-align: center; "><b><span lang="EN-GB" style="font-size: 10pt; font-family: Arial; color: rgb(255, 51, 0); ">The proceedings of CAMP’10 will be included in the IEEE Xplore database</span></b><span lang="EN-GB"></span></p></div><div><div><span id="q_12427322a64e84dc_7" class="h4" style="cursor: pointer; color: rgb(80, 0, 80); font-size: 9px; ">- Show quoted text -</span></div></div><table width="690" border="0" cellpadding="0" cellspacing="0" style="width: 517.4pt; margin-left: 3.8pt; border-collapse: collapse; "><tbody><tr><td colspan="2" valign="top" width="690" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font-family: arial, sans-serif; padding-top: 0in; padding-right: 5.4pt; padding-bottom: 0in; padding-left: 5.4pt; width: 517.4pt; "><p class="MsoNormal" style="margin-top: 6pt; margin-right: 9pt; margin-bottom: 6pt; margin-left: 9pt; "><b><span lang="EN-GB" style="font-size: 11pt; font-family: Arial; color: rgb(51, 204, 51); ">Scope</span></b></p><div><div><span id="q_12427322a64e84dc_5" class="h4" style="cursor: pointer; color: rgb(80, 0, 80); font-size: 9px; ">- Show quoted text -</span></div></div><p></p></td></tr><tr><td valign="top" width="345" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font-family: arial, sans-serif; padding-top: 0in; padding-right: 5.4pt; padding-bottom: 0in; padding-left: 5.4pt; width: 258.65pt; "><p style="margin-top: 0in; margin-right: 9pt; margin-bottom: 6pt; margin-left: 9pt; "><span><b><span style="font-size: 9pt; font-family: Arial; ">Invisible World</span></b></span><span style="font-size: 9pt; font-family: Arial; "><br />• Second Life<br />• Augmented Virtuality<br />• Augmented Reality<br />• Collaborative Workspace<br />• Digital Community<br />• Social Networks<br />• Online Behaviour<br />• Online Gaming<br />• Simulation</span></p><p class="MsoNormal" style="margin-top: 0in; margin-right: 9pt; margin-bottom: 6pt; margin-left: 9pt; "><span><b><span lang="EN-GB" style="font-size: 9pt; font-family: Arial; ">Emerging Computing</span></b></span><span lang="EN-GB" style="font-size: 9pt; font-family: Arial; "><br />• Autonomous Computing<br />• Cloud Computing<br />• Natural Computing<br />• Social Computing<br />• Trust Computing<br />• Contextual Computing<br />• Ubiquitous Computing<br />• Pervasive Computing<br />• Network Computing</span><span lang="EN-GB"></span></p><p class="MsoNormal" style="margin-top: 0in; margin-right: 9pt; margin-bottom: 0.0001pt; margin-left: 9pt; "><span><b><span lang="EN-GB" style="font-size: 9pt; font-family: Arial; ">Network Security</span></b></span><span lang="EN-GB" style="font-size: 9pt; font-family: Arial; "><br />• Network Surveillance<br />• Intrusion Detection<br />• Threat Avoidance<br />• Privacy, Trust and Security Assurance</span><span lang="EN-GB"></span></p></td><td valign="top" width="345" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font-family: arial, sans-serif; padding-top: 0in; padding-right: 5.4pt; padding-bottom: 0in; padding-left: 5.4pt; width: 258.75pt; "><p class="MsoNormal" style="margin-top: 0in; margin-right: 9pt; margin-bottom: 6pt; margin-left: 9pt; "><span><b><span lang="EN-GB" style="font-size: 9pt; font-family: Arial; ">Knowledge Intelligence</span></b></span><span lang="EN-GB" style="font-size: 9pt; font-family: Arial; "><br />• Artificial Intelligence<br />• Social Intelligence<br />• Ambient Intelligence<br />• Emotional Intelligence<br />• Reasoning Strategies</span><span lang="EN-GB"></span></p><p class="MsoNormal" style="margin-top: 0in; margin-right: 9pt; margin-bottom: 6pt; margin-left: 9pt; "><span><b><span lang="EN-GB" style="font-size: 9pt; font-family: Arial; ">Information Storage and Retrieval</span></b></span><span lang="EN-GB" style="font-size: 9pt; font-family: Arial; color: rgb(0, 0, 204); "><br /></span><span lang="EN-GB" style="font-size: 9pt; font-family: Arial; ">• Multimedia Information Retrieval <span><span style="color: rgb(102, 153, 255); ">(Audio, Video, Music, Image, Text)</span></span><span style="color: rgb(102, 153, 255); "><br /></span>• Storage and Indexing Techniques<br />• Semantics and Metadata<br />• Natural Language Processing<br />• Distributed and Parallel Information Retrieval<br />• Information Fusion<br />• Information Recovery<br />• Visualisation</span><span lang="EN-GB"></span></p><p class="MsoNormal" style="margin-top: 0in; margin-right: 9pt; margin-bottom: 6pt; margin-left: 9pt; "><span><b><span lang="EN-GB" style="font-size: 9pt; font-family: Arial; ">Knowledge Management</span></b></span><span lang="EN-GB" style="font-size: 9pt; font-family: Arial; color: rgb(0, 0, 204); "><br /></span><span lang="EN-GB" style="font-size: 9pt; font-family: Arial; ">• Knowledge Management Processes <span><span style="color: rgb(102, 153, 255); ">(Creation, Sharing, Representation and Use of knowledge) </span></span><br />• Knowledge Management Techniques and Tools <span><span style="color: rgb(102, 153, 255); ">(for Acquisition, Learning, Sharing and Processing of knowledge)</span></span><span style="color: green; "><br /></span>• Change Management<br />• Culture of Innovation<br />• Organisational Complexity<b><span style="color: black; "></span></b></span><span lang="EN-GB"></span></p></td></tr></tbody></table><span style="font-size: 10pt; font-family: 'Times New Roman'; "></span><p class="MsoNormal" style="margin-top: 0in; margin-right: 9pt; margin-bottom: 0.0001pt; margin-left: 9pt; "><span style="font-size: 10pt; "></span></p></td></tr><tr><td style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font-family: arial, sans-serif; padding-top: 0.75pt; padding-right: 0.75pt; padding-bottom: 0.75pt; padding-left: 0.75pt; "><div><div><span id="q_12427322a64e84dc_9" class="h4" style="cursor: pointer; color: rgb(80, 0, 80); font-size: 9px; ">- Show quoted text -</span></div></div><p class="MsoNormal" style="margin-top: 0in; margin-right: 9pt; margin-bottom: 0.0001pt; margin-left: 9pt; "><span lang="EN-GB" style="font-size: 9pt; font-family: Arial; ">Deadline for manuscript submission:<b><span style="color: blue; "> </span><span style="color: red; ">3 November 2009<br /></span></b>Notification of acceptance: <b>20 November 2009</b></span><span lang="EN-GB"></span></p><div class="im" style="color: rgb(80, 0, 80); "><p class="MsoNormal" style="margin-top: 0in; margin-right: 9pt; margin-bottom: 0.0001pt; margin-left: 9pt; "><span lang="EN-GB" style="font-size: 9pt; font-family: Arial; ">Camera ready paper due: <b>10 January 2010</b></span><span lang="EN-GB"></span></p><p style="margin-top: 0in; margin-right: 9pt; margin-bottom: 0.0001pt; margin-left: 9pt; "><span style="font-size: 9pt; font-family: Arial; ">Deadline for author’s registration: <b>10 January 2010</b><span style="color: black; "> </span></span></p><p style="margin-top: 0in; margin-right: 9pt; margin-bottom: 0.0001pt; margin-left: 9pt; "><span style="font-size: 8pt; "> </span></p></div></td></tr><tr><td style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font-family: arial, sans-serif; padding-top: 0.75pt; padding-right: 0.75pt; padding-bottom: 0.75pt; padding-left: 0.75pt; "><p class="MsoNormal" style="margin-top: 6pt; margin-right: 9pt; margin-bottom: 0.0001pt; margin-left: 9pt; "><b><span lang="EN-GB" style="font-size: 11pt; font-family: Arial; color: rgb(51, 204, 51); ">More information</span></b><span lang="EN-GB" style="font-size: 11pt; font-family: Arial; color: black; "><br /></span><span lang="EN-GB" style="font-size: 10pt; font-family: Arial; color: black; ">Kindly visit the conference web site at </span><span lang="EN-GB" style="font-size: 10pt; font-family: Arial; color: blue; "><a href="http://fskm.uitm.edu.my/camp10" target="_blank" style="color: rgb(42, 93, 176); ">http://fskm.uitm.edu.my/camp10</a></span><span lang="EN-GB" style="font-size: 10pt; font-family: Arial; "> for further details.</span></p></td></tr></tbody></table></div></span>Naimahhttp://www.blogger.com/profile/12970333781386290368noreply@blogger.com0tag:blogger.com,1999:blog-7188451967405892201.post-16957100933494864182009-10-30T12:29:00.001+08:002009-10-30T12:32:29.514+08:00The 8th International Conference on the Practice and Theory of Automated Timetabling<span class="Apple-style-span" style="font-family: Arial; font-size: 13px; border-collapse: collapse; "><table cellpadding="0" width="100%" border="0" style="width: 626px; "><tbody><tr><td style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font-family: arial, sans-serif; padding-right: 0.75pt; padding-left: 0.75pt; padding-bottom: 0.75pt; padding-top: 0.75pt; "><table cellspacing="0" cellpadding="0" width="620" border="0" style="width: 465pt; "><tbody><tr><td style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font-family: arial, sans-serif; padding-right: 4.5pt; padding-left: 4.5pt; background-image: initial; background-repeat: initial; background-attachment: initial; -webkit-background-clip: initial; -webkit-background-origin: initial; background-color: white; padding-bottom: 4.5pt; padding-top: 4.5pt; background-position: 0% 50%; "><table cellspacing="10" cellpadding="0" width="100%" border="0" style="width: 608px; "><tbody><tr><td style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font-family: arial, sans-serif; padding-right: 0cm; padding-left: 0cm; padding-bottom: 0cm; padding-top: 0cm; "><h1><span style="font-size: 12pt; color: rgb(51, 51, 51); ">PATAT 2010: PRELIMINARY CALL FOR PAPERS & DEMONSTRATIONS</span></h1><p><span style="font-size: 9pt; ">The 8th International Conference on the Practice and Theory of Automated Timetabling<br />10th August - 13th August 2010<br />Belfast, UK</span></p></td></tr></tbody></table><p class="MsoNormal"><span> </span></p><table cellspacing="0" cellpadding="0" width="100%" border="0" style="width: 608px; "><tbody><tr><td valign="top" width="322" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font-family: arial, sans-serif; padding-right: 7.5pt; padding-left: 7.5pt; padding-bottom: 7.5pt; width: 241.5pt; padding-top: 7.5pt; "><p><span style="font-size: 9pt; ">This conference is the eighth in a series of conferences that serve as a forum for an international community of researchers, practitioners and vendors on all aspects of computer-aided timetable generation. For more information about the conferences see</span></p><p><span style="font-size: 8pt; "><a href="http://www.cs.qub.ac.uk/~B.McCollum/patat10/index.html" target="_blank" style="color: rgb(42, 93, 176); ">http://www.cs.qub.ac.uk/~B.<wbr>McCollum/patat10/index.html</a></span></p></td><td valign="top" width="278" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font-family: arial, sans-serif; padding-right: 7.5pt; padding-left: 7.5pt; background-image: initial; background-repeat: initial; background-attachment: initial; -webkit-background-clip: initial; -webkit-background-origin: initial; background-color: rgb(255, 255, 204); padding-bottom: 7.5pt; width: 208.5pt; padding-top: 7.5pt; background-position: 0% 50%; "><p><strong><span style="font-size: 9pt; ">Featured Keynote Speakers </span></strong><span style="font-size: 9pt; "><br />Graham Kendall (University of Nottingham, UK)<br />Jeff Kingston (University of Sydney, Australia)<br />David Ryan (University of Auckland, New Zealand)<br />George White (University of Ottawa, Canada)<br /><!--[if !supportLineBreakNewLine]--><br /><!--[endif]--></span></p></td></tr></tbody></table><p><span style="font-size: 9pt; ">The themes of the conference include (but are not limited to):</span></p><table cellpadding="0" width="100%" border="0" style="width: 608px; "><tbody><tr><td valign="top" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font-family: arial, sans-serif; padding-right: 0.75pt; padding-left: 0.75pt; padding-bottom: 0.75pt; padding-top: 0.75pt; "><ul type="disc"><li class="MsoNormal" style="margin-left: 15px; "><span style="font-size: 9pt; ">Educational Timetabling</span></li><li class="MsoNormal" style="margin-left: 15px; "><span style="font-size: 9pt; ">Transport Timetabling</span></li><li class="MsoNormal" style="margin-left: 15px; "><span style="font-size: 9pt; ">Employee Timetabling and Rostering</span></li><li class="MsoNormal" style="margin-left: 15px; "><span style="font-size: 9pt; ">Sports Timetabling</span></li><li class="MsoNormal" style="margin-left: 15px; "><span style="font-size: 9pt; ">Complexity Issues</span></li><li class="MsoNormal" style="margin-left: 15px; "><span style="font-size: 9pt; ">Distributed Timetabling Systems</span></li></ul><p class="MsoNormal" style="margin-left: 5.2pt; "><span style="font-size: 9pt; "> </span></p><p class="MsoNormal" style="margin-left: 5.2pt; "><span style="font-size: 9pt; ">Research Areas, including;</span></p></td><td valign="top" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font-family: arial, sans-serif; padding-right: 0.75pt; padding-left: 0.75pt; padding-bottom: 0.75pt; padding-top: 0.75pt; "><ul type="disc"><li class="MsoNormal" style="margin-left: 15px; "><span style="font-size: 9pt; ">Implementations</span></li><li class="MsoNormal" style="margin-left: 15px; "><span style="font-size: 9pt; ">Commercial Packages</span></li><li class="MsoNormal" style="margin-left: 15px; "><span style="font-size: 9pt; ">Interactive vs Batch Timetabling</span></li><li class="MsoNormal" style="margin-left: 15px; "><span style="font-size: 9pt; ">Timetable Updating</span></li><li class="MsoNormal" style="margin-left: 15px; "><span style="font-size: 9pt; ">Standard Data Formats</span></li><li class="MsoNormal" style="margin-left: 15px; "><span style="font-size: 9pt; ">Relationship with Other Scheduling Problems</span></li></ul></td></tr></tbody></table><p class="MsoNormal"><span> </span></p><table cellpadding="0" width="100%" border="0" style="background-image: initial; background-repeat: initial; background-attachment: initial; -webkit-background-clip: initial; -webkit-background-origin: initial; background-color: rgb(153, 204, 255); width: 608px; background-position: 0% 50%; "><tbody><tr><td valign="top" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font-family: arial, sans-serif; padding-right: 0.75pt; padding-left: 0.75pt; padding-bottom: 0.75pt; padding-top: 0.75pt; "><ul type="disc"><li class="MsoNormal" style="margin-left: 15px; "><span style="font-size: 7.5pt; ">Constraint-Based Methods</span></li><li class="MsoNormal" style="margin-left: 15px; "><span style="font-size: 7.5pt; ">Evolutionary Computation</span></li><li class="MsoNormal" style="margin-left: 15px; "><span style="font-size: 7.5pt; ">Artificial Intelligence</span></li><li class="MsoNormal" style="margin-left: 15px; "><span style="font-size: 7.5pt; ">Mathematical Programming</span></li><li class="MsoNormal" style="margin-left: 15px; "><span style="font-size: 7.5pt; ">Expert Systems</span></li><li class="MsoNormal" style="margin-left: 15px; "><span style="font-size: 7.5pt; ">Heuristic Search</span></li><li class="MsoNormal" style="margin-left: 15px; "><span style="font-size: 7.5pt; ">Knowledge Based Systems</span></li></ul></td><td valign="top" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font-family: arial, sans-serif; padding-right: 0.75pt; padding-left: 0.75pt; padding-bottom: 0.75pt; padding-top: 0.75pt; "><ul type="disc"><li class="MsoNormal" style="margin-left: 15px; "><span style="font-size: 7.5pt; ">Operational Research</span></li><li class="MsoNormal" style="margin-left: 15px; "><span style="font-size: 7.5pt; ">Simulated Annealing</span></li><li class="MsoNormal" style="margin-left: 15px; "><span style="font-size: 7.5pt; ">Local Search</span></li><li class="MsoNormal" style="margin-left: 15px; "><span style="font-size: 7.5pt; ">Ant Colony Methods</span></li><li class="MsoNormal" style="margin-left: 15px; "><span style="font-size: 7.5pt; ">Soft Computing</span></li><li class="MsoNormal" style="margin-left: 15px; "><span style="font-size: 7.5pt; ">Tabu Search</span></li><li class="MsoNormal" style="margin-left: 15px; "><span style="font-size: 7.5pt; ">Meta-Heuristics</span></li></ul></td><td valign="top" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font-family: arial, sans-serif; padding-right: 0.75pt; padding-left: 0.75pt; padding-bottom: 0.75pt; padding-top: 0.75pt; "><ul type="disc"><li class="MsoNormal" style="margin-left: 15px; "><span style="font-size: 7.5pt; ">Hyper-Heuristics</span></li><li class="MsoNormal" style="margin-left: 15px; "><span style="font-size: 7.5pt; ">Very Large Neighborhood Search</span></li><li class="MsoNormal" style="margin-left: 15px; "><span style="font-size: 7.5pt; ">Graph Colouring</span></li><li class="MsoNormal" style="margin-left: 15px; "><span style="font-size: 7.5pt; ">Hybrid Methods</span></li><li class="MsoNormal" style="margin-left: 15px; "><span style="font-size: 7.5pt; ">Multi-Criteria Decision Making</span></li><li class="MsoNormal" style="margin-left: 15px; "><span style="font-size: 7.5pt; ">Fuzzy Reasoning</span></li><li class="MsoNormal" style="margin-left: 15px; "><span style="font-size: 7.5pt; ">Data Mining</span></li></ul></td></tr></tbody></table><p class="MsoNormal"><span> </span></p><table cellspacing="10" cellpadding="0" width="100%" border="0" style="width: 608px; "><tbody><tr><td style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font-family: arial, sans-serif; padding-right: 0cm; padding-left: 0cm; padding-bottom: 0cm; padding-top: 0cm; "><h2><span style="font-size: 10.5pt; color: rgb(102, 102, 102); ">Submissions</span><span></span></h2><p><span style="font-size: 9pt; ">Authors are invited to submit presentations in one of three categories:</span></p><p><span style="font-size: 9pt; ">(a) <b>Full Papers</b>.<span> </span>Authors should submit papers describing significant, original and unpublished work. Such papers are expected to be approximately 10-20 pages in length but this guideline is not strict. These papers will be fully refereed by the programme committee and the accepted ones will appear in conference proceedings. As in previous years, a selection of the papers will appear in a post conference volume. The second round of refereeing for this volume will take place shortly after the conference.</span></p><p><span style="font-size: 9pt; ">(b) <b>Abstracts</b>. Authors can submit abstracts of up to 1000 words. Abstracts will be fully refereed. The accepted ones will appear in the conference proceedings. Abstracts will not go forward to the second round of refereeing for the post-conference volume. However, authors of accepted abstracts will have the opportunity to write a full paper based on their abstract and submit it for the selected papers volume. People who wish to give a talk (e.g. practitioners, researchers with preliminary or incomplete papers) but do not want to submit a full paper can submit under this category.</span></p><p><span style="font-size: 9pt; ">(c) <b>System Demonstrations</b>. Authors can submit an abstract, describing the major properties and contribution of implemented and/or commercial timetabling systems. Abstracts should not exceed 1000 words (3-4 pages). Authors of accepted submissions in this category would be expected to provide a demonstration of their software during the conference. Demonstration submissions will be evaluated on the basis of their innovation, relevance and scientific contribution. The abstracts will be published in the conference proceedings but they will not be forwarded to the second round of refereeing for the post-conference volume. However, authors of accepted system demonstration abstracts are welcome to submit a full paper to the post-conference volume if they so wish.</span></p><h2><span style="font-size: 10.5pt; color: rgb(102, 102, 102); ">Submission Instructions</span></h2><p><span style="font-size: 9pt; ">Authors of all types of submitted papers are kindly requested to prepare a paper in English and submit it through our online submission system (available by the end of November 2009). The length of the paper should fulfil the requirements given for each category above. All papers must be submitted as a PDF file and authors will be requested to use the templates provided:</span></p><ul type="disc"><li class="MsoNormal" style="margin-left: 15px; "><span style="font-size: 9pt; ">the LaTeX version is preferred,</span></li><li class="MsoNormal" style="margin-left: 15px; "><span style="font-size: 9pt; ">the Microsoft Word version is also acceptable,</span></li><li class="MsoNormal" style="margin-left: 15px; "><span style="font-size: 9pt; ">no other format can be accepted.</span></li></ul><p><span style="font-size: 9pt; ">Please note that all participants will need to register for the conference and pay the registration fee in order for accepted submissions to appear in the conference proceedings.</span></p><h2><span style="font-size: 10.5pt; color: rgb(102, 102, 102); ">Deadlines</span></h2><ul type="disc"><li class="MsoNormal" style="margin-left: 15px; "><span style="font-size: 9pt; ">Paper/abstract/system submissions: January 20th, 2010</span></li><li class="MsoNormal" style="margin-left: 15px; "><span style="font-size: 9pt; ">Notification: April 20th, 2010 (at the latest)</span></li></ul><h2><span style="font-size: 10.5pt; ">Organizing and Programme Committee co-chairs</span></h2><p><span style="font-size: 9pt; ">Barry McCollum<br />School of Electronics, Electrical Engineering and Computer Science Queen's University Belfast<br /><br />and<br /><br />Edmund Burke<br />Automated Scheduling, Optimisation and Planning Research Group, School of Computer Science and Information Technology University of Nottingham Jubilee Campus, Nottingham NG8 1BB United Kingdom</span></p><h2><span style="font-size: 10.5pt; ">PATAT 2010 website:</span></h2><p><span style="font-size: 10.5pt; "><a href="http://www.cs.qub.ac.uk/~B.McCollum/patat10/index.html" target="_blank" style="color: rgb(42, 93, 176); ">http://www.cs.qub.ac.uk/~B.<wbr>McCollum/patat10/index.html</a></span></p></td></tr></tbody></table><p class="MsoNormal"><span style="font-size: 10pt; "></span></p></td></tr><tr><td style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font-family: arial, sans-serif; padding-right: 4.5pt; padding-left: 4.5pt; background-image: initial; background-repeat: initial; background-attachment: initial; -webkit-background-clip: initial; -webkit-background-origin: initial; background-color: rgb(153, 153, 153); padding-bottom: 4.5pt; padding-top: 4.5pt; background-position: 0% 50%; "><p align="center" style="text-align: center; "><span style="font-size: 7.5pt; color: white; ">Copyright © 2009 PATAT 2010</span></p></td></tr></tbody></table></td></tr></tbody></table><p class="MsoNormal"><span> </span></p><div><br /></div></span>Naimahhttp://www.blogger.com/profile/12970333781386290368noreply@blogger.com0tag:blogger.com,1999:blog-7188451967405892201.post-88992510016779285752009-10-30T12:23:00.001+08:002010-01-19T21:15:18.274+08:004th International Symposium on Information Technology ITSim' 10<span class="Apple-style-span" style=" border-collapse: collapse; font-family:arial, sans-serif;font-size:13px;"><p class="MsoNormal" dir="ltr" align="center" style="margin-top: 0cm; margin-right: 0cm; margin-bottom: 10pt; margin-left: 0cm; line-height: normal; ">4th International Symposium on Information Technology<br />ITSim' 10 (<a href="http://www.itsim.org">www.itsim.org</a>)</p><p class="MsoNormal" dir="ltr" align="center" style="margin-top: 0cm; margin-right: 0cm; margin-bottom: 10pt; margin-left: 0cm; line-height: normal; "> June 15 - 17, 2010<br /> <wbr> KUALA LUMPUR, MALAYSIA <wbr> </p><p class="MsoNormal" dir="ltr" align="center" style="margin-top: 0cm; margin-right: 0cm; margin-bottom: 10pt; margin-left: 0cm; line-height: normal; ">------------------------------<wbr>------------------------------<wbr>--------------------<br /><br /><strong> ***</strong> Paper Submission Deadline is extended <strong>--- January 31, 2010 ****</strong><br /></p><p class="MsoNormal" dir="ltr" align="left" style="margin-top: 0cm; margin-right: 0cm; margin-bottom: 10pt; margin-left: 0cm; line-height: normal; "><u></u> </p><p class="MsoNormal" dir="ltr" align="left" style="margin-top: 0cm; margin-right: 0cm; margin-bottom: 10pt; margin-left: 0cm; line-height: normal; "><u>Hosted by :</u></p><p class="MsoNormal" dir="ltr" align="left" style="margin-top: 0cm; margin-right: 0cm; margin-bottom: 10pt; margin-left: 0cm; line-height: normal; "><strong>Universiti Teknologi PETRONAS, IEEE Malaysia Section, Universiti Kebangsaan Malaysia</strong></p><p class="MsoNormal" dir="ltr" align="left" style="margin-top: 0cm; margin-right: 0cm; margin-bottom: 10pt; margin-left: 0cm; line-height: normal; "><u>Co-sponsored by :</u></p><p class="MsoNormal" dir="ltr" align="left" style="margin-top: 0cm; margin-right: 0cm; margin-bottom: 10pt; margin-left: 0cm; line-height: normal; "><strong>IEEE Computer Society, Malaysian Information Technology Society (MITS)</strong></p><p class="MsoNormal" dir="ltr" align="left" style="margin-top: 0cm; margin-right: 0cm; margin-bottom: 10pt; margin-left: 0cm; line-height: normal; "><u>Important Dates:</u></p><p class="MsoNormal" dir="ltr" style="margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; margin-left: 0in; "><span style=" ;font-family:Arial;font-size:10pt;color:black;">31 January 2010<span> </span>: Submission of Full Paper</span></p><p class="MsoNormal" dir="ltr" style="margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; margin-left: 0in; "><span style=" ;font-family:Arial;font-size:10pt;color:black;">15 March 2010<span> </span>: Notification of Papers Acceptance</span></p><p class="MsoNormal" dir="ltr" style="margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; margin-left: 0in; "><span style=" ;font-family:Arial;font-size:10pt;color:black;">30 April 2010<span> </span>: Camera Ready due</span></p><p class="MsoNormal" dir="ltr" style="margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; margin-left: 0in; "><span style=" ;font-family:Arial;font-size:10pt;color:black;">1 – 15 April 2010 <span> </span>: Early Bird Registration</span></p><p class="MsoNormal" dir="ltr" align="left" style="margin-top: 0cm; margin-right: 0cm; margin-bottom: 10pt; margin-left: 0cm; line-height: normal; "></p><p class="MsoNormal" dir="rtl" align="left" style="margin-top: 0cm; margin-right: 0cm; margin-bottom: 10pt; margin-left: 0cm; line-height: normal; "> </p><p class="MsoNormal" dir="ltr" align="left" style="margin-top: 0cm; margin-right: 0cm; margin-bottom: 10pt; margin-left: 0cm; line-height: normal; "><u>Paper submission :</u></p><p class="MsoNormal" dir="ltr" align="left" style="margin-top: 0cm; margin-right: 0cm; margin-bottom: 10pt; margin-left: 0cm; line-height: normal; ">Prospective authors must submit their original papers for review through the EDAS conference management system at <a href="https://pww.centralmail.petronas.com.my/exchweb/bin/redir.asp?URL=http://edas.info/" target="_blank" style="color: rgb(42, 93, 176); ">http://edas.info/</a>. </p><p class="MsoNormal" dir="ltr" align="left" style="margin-top: 0cm; margin-right: 0cm; margin-bottom: 10pt; margin-left: 0cm; line-height: normal; ">The manuscript template is available at: <a href="http://www.itsim.org/instruction.html">http://www.itsim.org/</a><a href="http://www.itsim.org/instruction.html"><wbr>instruction.html</a></p><p class="MsoNormal" dir="ltr" align="left" style="margin-top: 0cm; margin-right: 0cm; margin-bottom: 10pt; margin-left: 0cm; line-height: normal; "><u>Areas :</u></p><p dir="ltr"></p><p class="MsoNormal" dir="ltr" style="margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; margin-left: 0in; "><span style=" ;font-family:Arial;font-size:10pt;">The topics of the conference include, but not limited to, the following:</span><span style=" ;font-family:Arial;"></span></p><p class="MsoNormal" dir="ltr" align="left" style="margin-top: 0cm; margin-right: 0cm; margin-bottom: 10pt; margin-left: 0cm; line-height: normal; "><strong><span style=" ;font-family:Verdana;font-size:10pt;"></span></strong> </p><p class="MsoNormal" dir="ltr" align="left" style="margin-top: 0cm; margin-right: 0cm; margin-bottom: 10pt; margin-left: 0cm; line-height: normal; "><strong><span style=" ;font-family:Verdana;font-size:10pt;">Engineering and Technology</span></strong></p><div dir="ltr"><ul type="disc" style="margin-top: 0in; "><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">GRID and peer-to-peer computing</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Decision Support Systems</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Distributed control systems</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Computer networking</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Data and communications protocol</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Mobile computing</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Signal processing</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Electronics</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Scientific computing</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Computer security</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Biometrics and security</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Knowledge representation</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Artificial intelligence</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Neural networks</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Machine learning</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Fuzzy logic</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Data mining</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Information storage and retrieval</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Cryptography and compression</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Pattern recognition</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Agent technologies</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li></ul></div><p style="margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; margin-left: 0in; "><strong><span style=" ;font-family:Verdana;font-size:10pt;">Green Computing</span></strong></p><ul type="disc" style="margin-top: 0in; "><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Hardware reusability</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Server virtualization</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Thin client solution</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Material recycling</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Power management</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Electronics waste management</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Telecommuting</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Minimalism computing</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Software reusability</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Algorithm efficiency</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Performance per watt</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Hibernation features</span></li></ul><p style="margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; margin-left: 0in; "><strong><span style=" ;font-family:Verdana;font-size:10pt;">Human and Natural Ecosystem</span></strong></p><ul type="disc" style="margin-top: 0in; "><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Biologically-inspired computing</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Bioinformatics</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Cerebral computing</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Genetic computing</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Autonomic computing</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Nature of software</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Natural intelligence</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Natural knowledge</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Human-Computer Interaction</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Neural computation</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Neural informatics</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Quantum processing</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Cognitive linguistic</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Expressive mathematics</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li></ul><p style="margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; margin-left: 0in; "><strong><span style=" ;font-family:Verdana;font-size:10pt;">Energy Informatics</span></strong></p><ul type="disc" style="margin-top: 0in; "><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Data exploration on energy data set</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Energy information system</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Energy analysis</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Energy and ICT</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Renewable energy technology</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Sustainable energy technology</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Energy efficiency</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li></ul><p style="margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; margin-left: 0in; "><strong><span style=" ;font-family:Verdana;font-size:10pt;">Systems Development and Application</span></strong></p><ul type="disc" style="margin-top: 0in; "><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Software engineering</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Knowledge engineering</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Knowledge-based applications</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Web-based information systems</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">E-commerce systems</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">E-learning systems</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Expert systems</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Intelligent systems</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Adaptive systems</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Voice recognition systems</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Haptics systems</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Industrial application systems</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Augmented Reality</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Simulation and visualization</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Comparative programming</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Evaluation of systems</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Technology impact assessment</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Software reusability</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Virtual reality</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li></ul><p style="margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; margin-left: 0in; "><strong><span style=" ;font-family:Verdana;font-size:10pt;">Knowledge Society</span></strong></p><ul type="disc" style="margin-top: 0in; "><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Knowledge society indicators</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Knowledge divide</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Knowledge Management</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">E-community</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Personalized knowledge</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Intellectual capital</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Meta-knowledge</span><span style="font-size:100%;"><span style="font-family:Times New Roman;"></span></span></li><li class="MsoNormal" style="margin-left: 0in; margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; "><span style=" ;font-family:Verdana;font-size:10pt;">Libre knowledge</span><span style=" ;font-size:12pt;"></span></li></ul><p class="MsoNormal" dir="ltr" align="left" style="margin-top: 0cm; margin-right: 0cm; margin-bottom: 10pt; margin-left: 0cm; line-height: normal; "><u>Registration & Fees </u></p><p class="MsoNormal" dir="ltr" align="left" style="margin-top: 0cm; margin-right: 0cm; margin-bottom: 10pt; margin-left: 0cm; line-height: normal; ">Registration must be made via EDAS website <a href="https://pww.centralmail.petronas.com.my/exchweb/bin/redir.asp?URL=http://edas.info/" target="_blank" style="color: rgb(42, 93, 176); ">http://edas.info/</a>. </p><p class="MsoNormal" dir="ltr" align="left" style="margin-top: 0cm; margin-right: 0cm; margin-bottom: 10pt; margin-left: 0cm; line-height: normal; ">Information on fees can be found at <a href="http://www.itsim.org/registration.htm">http://www.itsim.org/</a><a href="http://www.itsim.org/registration.htm"><wbr>registration.htm </a>.</p><p class="MsoNormal" dir="ltr" align="left" style="margin-top: 0cm; margin-right: 0cm; margin-bottom: 10pt; margin-left: 0cm; line-height: normal; "><u>Symposium Partners:</u></p><p class="MsoNormal" dir="ltr" align="left" style="margin-top: 0cm; margin-right: 0cm; margin-bottom: 10pt; margin-left: 0cm; line-height: normal; "><u></u><br />Universiti Malaya(UM), Universiti Sains Malaysia (USM), Universiti Putra Malaysia (UPM), Universiti Teknologi Malaysia (UTM), Universiti Teknologi MARA(UiTM), Universiti Utara Malaysia (UUM), Universiti Islam Antarabangsa (UIA), Universiti Tenaga Nasional, Universiti Malaysia Terengganu (UMT), Universiti Multimedia, Universiti Tunku Abdul Rahman, Universiti Kreatif Lim Kok Wing, Universiti Pertahanan Nasional Malaysia, Universiti Sains Islam Malaysia, Open University Malaysia, Kolej Tunku Abdul Rahman, MIMOS.</p><p class="MsoNormal" dir="ltr" align="left" style="margin-top: 0cm; margin-right: 0cm; margin-bottom: 10pt; margin-left: 0cm; line-height: normal; "><u>Symposium Co-chairs</u></p><p style="margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; margin-left: 0in; "><span lang="SV" style=" ;font-family:Arial;font-size:10pt;">Ahmad Kamil Mahmood, Universiti Teknologi PETRONAS, Malaysia</span><span lang="SV" style=" ;font-family:Arial;"></span></p><p style="margin-top: 0in; margin-right: 0in; margin-bottom: 0pt; margin-left: 0in; "><span style=" ;font-family:Arial;font-size:10pt;">Halimah Badioze Zaman, Universiti Kebangsaan Malaysia, Malaysia<br />Steve Elliot, University of Sydney, Australia<br />Peter Haddawy, Asian Insitute of Technology, Bangkok, Thailand<br />Stephan Olariu, Old Dominion University, Norfolk, USA<br />Timothy Shih, National Taipei University of Education, Taiwan<br />Zaiki Awang , Chairman, IEEE Malaysia Section</span><span style=" ;font-family:Arial;"></span></p><p class="MsoNormal" dir="ltr" align="left" style="margin-top: 0cm; margin-right: 0cm; margin-bottom: 10pt; margin-left: 0cm; line-height: normal; "><br /><u>Contact us:</u></p><p></p><div dir="ltr"><span style="font-family:Arial;font-size:85%;color:#000000;">For further information, visit <a href="http://www.itsim.org/" target="_blank" style="color: rgb(42, 93, 176); ">www.itsim.org</a> or kindly contact us at :</span></div><div dir="ltr"><span style="font-family:Arial;font-size:85%;">Tel: +605-3687475/ +605-3687411<br />or<br />E-mail: <a href="mailto:itsim2010@petronas.com.my" target="_blank" style="color: rgb(42, 93, 176); ">itsim2010@petronas.com.my</a></span></div><div dir="ltr"><span style="font-family:Arial;font-size:85%;"></span> </div></span>Naimahhttp://www.blogger.com/profile/12970333781386290368noreply@blogger.com0tag:blogger.com,1999:blog-7188451967405892201.post-26657524904283432262009-10-30T12:08:00.000+08:002009-10-30T12:11:59.326+08:00International Workshop on Scheduling in Healthcare Systems (SCHEALS'10)International Workshop on Scheduling in Healthcare Systems (SCHEALS'10)<br /><br /> 25-27 August 2010<br /><br /> IAMSR, Åbo Akademi University<br /> Turku, Finland<br /><br />=======================================================================<br /><br />Abstract<br /><br />Many Healthcare providers have suffered a crisis of poor quality and inefficiency with rapidly increasing costs. Healthcare delivery faces complex scheduling needs and stands to gain from advances in scheduling technology and understanding. The SCHEALS 2010 workshop will take place at Åbo Akademi University in the city of Turku, in conjunction with the 2nd International Conference on Applied Operational Research (ICAOR'10). We invite you to join your colleagues for this international forum. Sharing of ideas, knowledge and experience is the primary goal of the workshop. The meeting would be ideal for young researchers to present their work, even at a preliminary stage, for constructive discussion and feedback.<br /><br /><br />Workshop Theme<br /><br />The workshop will cover the general area of scheduling with particular emphasis being placed on healthcare applications, including, but not limited to:<br /><br />* Automation<br />* Exact Methods<br />* Expert Systems<br />* Heuristics<br />* Machine Scheduling<br />* Meta-Heuristics<br />* Optimization<br />* Patient Scheduling<br />* Personnel Scheduling<br />* Queuing<br />* Rescheduling<br />* Shift Timetabling<br />* Simulation<br />* Uncertainty<br /><br /><br />Paper Submission<br /><br />Researchers wishing to contribute to the conference are invited to submit manuscripts of not more than 12 pages either as full papers or extended abstracts. The working language of the conference is English. Authors are encouraged to prepare their manuscripts in LNCS style using the MS Word template provided by the Springer, please see Information for LNCS Authors.<br />Papers should be submitted online through the conference website submission system in MS Word 2003 format (.doc). All submissions will be reviewed by at least two referees, and successful papers will be included in the Conference Proceedings.<br /><br /><br />Special Issue<br /><br />The authors of accepted papers will have the opportunity to submit extended versions of their papers for consideration to post-workshop special issues of the Journal of Applied Operational Research (JAOR) or Lecture Notes in Management Science (LNMS).<br /><br /><br />Important Dates<br /><br />15-Aug-2009 - Submission opens<br />15-Mar-2010 - Paper submission deadline<br />15-May-2010 - Notification of decisions<br />15-Jun-2010 - Registration deadline<br />30-Jun-2010 - Camera-ready deadline<br />25-Aug-2010 – Workshop starts<br /><br /><br />International Scientific Programme Committee<br /><br />Ben Atkinson, London Metropolitan University, UK<br />Sigrid Knust, Clausthal University of Technology, Germany<br />Gilbert Laporte, HEC Montréal, Canada<br />Jesper Larsen, Technical University of Denmark, Denmark<br />Rym Hallah, Kuwait University, Kuwait<br />Margarida Moz, Technical University of Lisbon, Portugal<br />Andrea Schaerf, University of Udine, Italy<br />Kaveh Sheibani, Tadbir Institute, Iran (Chair)<br /><br /><br />Registration<br /><br />All workshop participants are expected to register for the ICAOR 2010 conference. The conference registration fee is €300 per delegate. This includes participation in all conference sessions, the proceedings, coffee breaks, lunches and the conference dinner.<br /><br /><br />Contact Details<br /><br />General information on the conference email to:<br />icaor2010@gmail.com<br /><br />Local Chair<br />Doc. Dr. Mikael Collan<br />Institute for Advanced Management Systems Research<br />Abo Akademi University<br />Joukahaisenkatu 3-5 A 4th floor<br />20520 Turku<br />Finland<br />Tel +358 (0)2 215 4033<br />Fax +358 (0)2 215 4809<br />mcollan@abo.fi<br /><br />ICAOR/SCHEALS General Chair<br />Prof. Dr. Kaveh Sheibani<br />Tadbir Institute for Operational Research,<br />Systems Design and Financial Services Ltd.<br />122 Mahmudi 2ND Street<br />Tehran 19797-13673<br />Iran<br />Tel +98 (0)21 2271 7097<br />Fax +98 (0)21 2271 6816<br />tadbir@tadbirstm.org.ir<br /><br /><br />Please visit ICAOR website at <a href="http://www.tadbirstm.org.ir">http://www.tadbirstm.org.ir</a><br />or ICAOR 2010 conference website at <a href="http://iamsr.abo.fi/icaor2010">http://iamsr.abo.fi/icaor2010</a>Naimahhttp://www.blogger.com/profile/12970333781386290368noreply@blogger.com0tag:blogger.com,1999:blog-7188451967405892201.post-27787417928070791192009-09-17T13:00:00.002+08:002009-09-17T13:26:02.590+08:00Eid MubarakI would like to wish to everybody <div><br /></div><div style="text-align: center;"><b><span class="Apple-style-span" style="font-size: x-large;">"Selamat Hari Raya, Maaf Zahir dan Batin".</span><span class="Apple-style-span" style="font-size: large;"> </span></b> </div><div style="text-align: center;"><br /></div><div style="text-align: justify;">That is the normal phrase when Hari Raya comes again. This year we do not have to join the rush to 'balik kampung' since we are already staying near to my kampung (i.e. Alor Star). Normally my first hari raya I will go back to the house where I have been brought up. I lost both my parents when I was in the secondary school, but I have a very close-knit family with 11 surviving siblings (from 15 siblings) and our nieces, nephews, grand-nieces, grand-nephews and great-grand-nieces and great-grand-nephews. I have been keeping a database of all family members and this remind me that I should update it more often.</div><div style="text-align: justify;"><br /></div><div style="text-align: justify;">Normally the third hari raya, we will have a gathering and most family members will try to come back. Last year was very meaningful to me because that is when everbody celebrate my marriage. I got married in the UK while I was doing my Phd. Eventhough I came back in 2005, last year was the first year that my hubby came back from the UK.</div><div style="text-align: justify;"><br /></div><div style="text-align: justify;">This year we have not made any plan for the third hari raya. We'll see how it goes. </div>Naimahhttp://www.blogger.com/profile/12970333781386290368noreply@blogger.com0tag:blogger.com,1999:blog-7188451967405892201.post-11946409372035238942009-09-17T11:43:00.002+08:002009-09-17T12:54:39.954+08:00Plagiarism AgainIt was just about a month ago that I wrote about plagiarism in this blog. Suddenly on Monday morning, a colleague from Shah Alam SMS me to read a news on plagiarism in Sun newspaper. I found the online version (no Sun paper in Kedah/Perlis) and the headline says "UPM duo in plagiarism scandal" This type of news is not normally publicised but hopefully this will be a lesson to all.<div><br /></div><div>Academics should know that plagiarism is a very serious crime. The excuse given in this case by the senior lecturer was "it looked fine to me" uuuhhhh .... does that mean that he did not even write it, then why is he one of the author??? which part is his contribution??? another case of ghost author, another serious crime in academics.</div><div><br /></div><div>Prof Datuk Dr Nik Mustapha, UPM vice-chancellor, said “The junior author, who recently completed her PhD, said that since the source was from the Internet, she thought the information was in the public domain and as such did not cite the article”. (theStar Sept 15) uuuhhh .... If that is your belief then you have been taught wrong. Don't you know how to do citation and what is meant by copyright? Where did you get your PhD?</div><div><br /></div><div>I once review a paper submitted to a conference and it was taken 100% from a webpage (different owner). It was actually an insult to a reviewer to get such a paper. </div><div><br /></div><div>In one of the course I attended on copyrights, one case study shows a website owner was sued for putting up a picture taken from another website. The materials on a website are actually protected under the copyright law. Whatever materials you used on your website which are taken from other website must be acknowledged and with permission granted.</div><div><br /></div><div>Being a Research University (RU) is a big responsibility. Academics are required to maintain their status by requiring them to publish, publish and publish. "Publish or Perish" - the saying gives the whole picture for some but not all academics. Therefore some people resort to all sort of means to get a certain number of publications a year. </div>Naimahhttp://www.blogger.com/profile/12970333781386290368noreply@blogger.com0tag:blogger.com,1999:blog-7188451967405892201.post-10149151103842829532009-08-18T14:09:00.002+08:002009-08-18T15:07:26.537+08:00Plagiarism<blockquote></blockquote><blockquote></blockquote>Today I had a discussion with my master student. It is interesting to note that he was very concerned about plagiarism and he actually did some readings on plagiarism. He even mentioned that students should know what is plagiarism and how to avoid plagiarism. He also share with me an open source software (<a href="http://www.scanmyessay.com/viper-plagiarism-scanner.php">Viper</a>) which can be used to detect whether your writing contain any plagiarism (Type I only). <div><br /></div><div>In academic, plagiarism is a very serious offence. Base on Academic Policy, students maybe expelled if they are found to submit a plagiarized work as their own. Academics also need to write and publish our research work. There may not be a written rules on publication guidelines but as academics we should have an academic integrity.<br /><div><div><div><br /></div><div>According to Dr Barnbaum, there are five types of plagiarism:</div><div></div><div></div><blockquote><div>Type I: Copy & Paste</div><div>Type II: Word Switch</div><div>Type III: Style</div><div>Type IV: Metaphor</div><div>Type V: Idea</div></blockquote><div></div><div></div></div><div>Most of us are more familiar with Type I: Copy n Paste and are not aware of the other types. For more detail description and examples, refer to Dr Barnbaum page.</div><div><br /></div><div>The following list some references on the different type of plagiarism:</div><div> </div><div> Dr. C. Barnbaum, <a href="http://www.valdosta.edu/~cbarnbau/personal/teaching_MISC/plagiarism.htm">Plagiarism, A Student's Guide to Recognizing It and Avoiding It</a>, Department of Physics and Astronomy, Valdosta State University.</div><div><div>Sue Ann Brainard, <a href="http://library.geneseo.edu/~brainard/plagiarismworkshop.htm">Plagiarism Workshop</a>, Milne Library, SUNY Geneseo</div><div><a href="http://www.yorku.ca/tutorial/academic_integrity/">Academic Integrity Tutorial</a>, New York University</div><div><br /></div></div></div></div>Naimahhttp://www.blogger.com/profile/12970333781386290368noreply@blogger.com0tag:blogger.com,1999:blog-7188451967405892201.post-72588956074181296212009-08-12T13:22:00.003+08:002009-08-12T14:14:58.159+08:00A Trip to Shah AlamOn Monday I drove from Jitra to Shah Alam to attend my student's PhD Defense Proposal. It was a 5-hours drive and it rain half of the way. I planned to meet my student, A before his presentation on Tuesday but unfortunately his handphone was off and only reply my SMS late evening with an excuse that he is not well and was sleeping ..... hhmmm. I also schedule a meeting with my other PhD student, R, again no luck she is also not well. <div><br /></div><div>Anyway, I was there when A presented his proposal and later we went through his proposal again to make the necessary corrections based on the comments made by the panel. I asked him to sent me his corrections in a couple of weeks.</div><div><br /></div><div>It was nice to meet friends in Shah Alam. Almost everybody ask me "Seronok ke kat Perlis" It is a difficult question but my famous answer is "Bolehla". It is just a matter of adjusting to new environment and new friends. One thing is obvious no more traffic jam and toll.</div><div><br /></div><div>I left Shah Alam at about 2 pm and reach Jitra about 7pm </div>Naimahhttp://www.blogger.com/profile/12970333781386290368noreply@blogger.com1tag:blogger.com,1999:blog-7188451967405892201.post-34600648843544294972009-07-28T14:31:00.002+08:002009-07-28T14:36:24.123+08:00Semester BreakUiTM decided to move its semester break to this week. This is as a precaution against the spread of H1N1 virus (A couple of UiTM campuses are closed already). We got the information late Friday afternoon. It was already too late for me to give my students assignment during the semester break. Hopefully they will use this time to revise what had been covered in the first three weeks of classes (I doubt so). Classes will resume on the 2nd of August.Naimahhttp://www.blogger.com/profile/12970333781386290368noreply@blogger.com3tag:blogger.com,1999:blog-7188451967405892201.post-82949880952494992812009-07-07T11:40:00.005+08:002009-07-28T14:30:46.895+08:00First Day of classThis is the first week of class. I started the first day with my first meeting with a newly registered Master of Computer Science research student. I have agreed to be his supervisor and the first discussion is on the topic and a planning on what to be accomplished during the 18 months of research work. He will need to attend the Research Methodology class which began last Saturday. <div><br /></div><div>The following links should be helpful for our research students:</div><div><br /></div><div><a href="http://naimahmh.uitm.edu.my/resources.html">http://naimahmh.uitm.edu.my/resources.html</a></div><div><br /></div><div><div>I do update my resources page (not as frequent as I like to) so if you find any broken link, do let me know.</div><div><br /></div><div>For academic papers search, you can go to the following link:</div><div><br /></div><div><a href="http://www.scopus.com/">http://www.scopus.com</a></div><div><a href="http://citeseer.ist.psu.edu/">http://citeseer.ist.psu.edu/</a></div><div><a href="http://scholar.google.com/">http://scholar.google.com/</a></div><div><br /></div><div><br /></div><div>And of course you can always use the google search engine.</div><div><br /></div><div>As usual, I don't encourage students to use white paper published on the internet. It is best to cite from papers published in well refereed conferences and well established journals or books.</div><div><br /></div></div><div> </div>Naimahhttp://www.blogger.com/profile/12970333781386290368noreply@blogger.com0tag:blogger.com,1999:blog-7188451967405892201.post-66276223525886760332009-07-02T13:17:00.000+08:002009-07-02T13:26:53.090+08:00New at UiTM PerlisIt has been a month since I transfer to UiTM Perlis from Shah Alam. It is a new environment which I need to get adjusted. This blog was set up sometime ago and I have not much idea on what to put here. I already have my academic web page hosted at FSKM web server and a duplicate copy hosted at the UiTM web server. I thought of migrating everything to UiTM web server but something is not right somewhere. I use to be able to search my name using google and the page from FSKM web server will appear but now it is gone ... hhhhmmm ... no clue why??? anyway I will start to build on this blogging thing... till then..Naimahhttp://www.blogger.com/profile/12970333781386290368noreply@blogger.com0