Download presentation
Presentation is loading. Please wait.
Published byThomas Price Modified over 9 years ago
1
Research in Computing: from curiosity to new theory and applications Prabhas Chongstitvatana Faculty of Engineering Chulalongkorn University
2
Outline Research career Research dimensions Research examples Research in computing Research for Thais
3
Research career Beginning: curiosity Midterm: experiment Maturity: new theory and applications
4
Research dimensions near-term long-term internal external narrow broad
5
Research Examples Learning finite state machine Genetic algorithm in hardware Building Blocks Scheduling in manufacturing Search for Lead-free Solder Alloys
6
1998 Synthesis of Synchronous Sequential Logic Circuits from Partial Input/Output Sequences. Two-Horn Chameleon (Bradypodion fischeri ssp.) in the Usambara mountains, Tanzania
8
2001 A Hardware Implementation of the Compact Genetic Algorithm Fabricate on FPGA, runs about 1,000 times faster than the software executing on a workstation.
9
Pseudocode of Compact GA
10
Hardware organization (population size = 256, chromosome length = 32)
12
2004 Building block identification by simulateneity matrix Building Blocks concept Identify Building Blocks Improve performance of GA
13
x = 11100f(x) = 28 x = 11011f(x) = 27 x = 10111f(x) = 23 x = 10100f(x) = 20 --------------------------- x = 01011f(x) = 11 x = 01010f(x) = 10 x = 00111f(x) = 7 x = 00000f(x) = 0 Induction 1 * * * * (Building Block)
14
x = 11111f(x) = 31 x = 11110f(x) = 30 x = 11101f(x) = 29 x = 10110f(x) = 22 --------------------------- x = 10101f(x) = 21 x = 10100f(x) = 20 x = 10010f(x) = 18 x = 01101f(x) = 13 1 * * * * (Building Block) Reproduction
15
x = 11111f(x) = 31 x = 11110f(x) = 30 x = 11101f(x) = 29 x = 10110f(x) = 22 --------------------------- x = 10101f(x) = 21 x = 10100f(x) = 20 x = 10010f(x) = 18 x = 01101f(x) = 13 Induction 1 * 1 * * (Building Blocks) 1 1 * * *
17
{{0,1,2},{3,4,5},{6,7,8},{9,10,11},{12,13,14}}
19
2009 Combinatorial Optimization with Coincidence (COIN) Use both good and not-good solutions. A Generator represents a probabilistic model of the required solution. Reward and punishment schemes are incorporated in updating the generator.
20
Pseudo code for COIN 1.Initialize the generator. 2.Generate the population using the generator. 3.Evaluate the population. 4.Select the candidates. Adaptive selection: select the above and below the average ±2σ 5.For each joint probability h(xi|xj), update the generator according to the reward and punishment 6.Repeat Step 2. Until the terminate condition is met.
21
Complete line assignment for straight assembly line. Complete line assignment for U-shaped assembly line
23
Research in Computing Current exciting topics –brain science research –graphics processing unit –low power computing –social network –Google traffic report
24
Future Trends DuPont budget US$ 1.4 BN for R&D –Increase food production 50% –Reduce dependence on fossil fuel 15% –Life protection 12% –Emerging markets 23%
25
Research for Thais Agriculture: Improving agricultural product Healthcare: Thai digital medical record Politics: Vote through mobile phone
26
David Patterson's Six Steps Selecting a problem Picking a solution Running a project Finishing a project Quantitative evaluation Transferrring technology
27
let Beauty leads Science let Science leads Education
28
Eamsiri, J., Malasit, P., Songsivilai, S., Chongstitvatana, P., "Intelligent tutor program in medical teaching", Proc. of the regional symp on computer science and its applications, Bangkok, 1987. Wongsamethin, O., Kienprasit, R. and Chongstitvatana, P., "Fast Fourier Transform by a Digital Signal Processor", 10 th Electrical Engineering Conference, Thailand, 1987. Chongstitvatana, P., "Vision-based behavioural modules for robotic assembly system", IEEE Inter. Conf. on Tools with Artificial Intelligence, New Orleans, 1994, pp.312-316. Manovit, C., Aporntewan, C., and Chongstitvatana, P., "Synthesis of Synchronous Sequential Logic Circuits from Partial Input/Output Sequences", Proc. of 2nd Int. Conf. on Evolvable Systems (ICES98), Lausanne, Switzerland, 1998, pp. 98-105. Aporntewan, C. and Chongstitvatana, P., "A Hardware Implementation of the Compact Genetic Algorithm", IEEE Congress on Evolutionary Computation, Seoul, Korea, May 27-30, 2001, pp.624-629. Aporntewan, C. and Chongstitvatana, P., "Building block identification by simulateneity matrix for hierarchical problems", Genetic and Evolutionary Computation Conference, Seattle, USA, 26-30 June 2004, Proc. part 1, pp.877-888. Aporntewan, C., Chongstitvatana, P., "Building-block identification by simultaneity matrix". Soft Computing, Vol.11, No.6, 2007, pp.541-548. Rimcharoen, S., Sutivong, D., Chongstitvatana, P., "Real options approach to evaluating genetic algorithms," Applied Soft Computing, Vol 9, Issue 3, June 2009, Pages 896-905. Wattanapornprom, W. and Chongstitvatana, P., "Multi-objective Combinatorial Optimisation with Coincidence Algorithm," IEEE Congress on Evolutionary Computation, Norway, May 18-21, 2009. Chedtha Puncreobutr, Gobboon Lohthongkum, Prabhas Chongstitvattana, Boonrat Lohwongwatana,"Modeling of Reflow Temperatures and Wettability in Lead-free Solder Alloys using Hybrid Evolutionary Algorithms," Symp of Pb-Free Solders and Emerging Interconnect and Packaging Technologies (TMS 2010), February 14-18, 2010, Seattle, USA.
29
Teamwork
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.