時間: Fri Aug 11 23:32:16 2006 高銘揚教授是美國西北大學電腦科學系系主任, 也是 「隨機客」數篇論文的co-author, 在過去多年合作 過程當中, 「隨機客」獲益良多, 高教授實在是「隨 機客」在學術研究這條路上沒有正式拜師卻幸運得以 學藝的導師, 這次很榮幸可以邀請到高教授來系上演 講. 高教授的網頁在 http://www.cs.northwestern.edu/~kao/ 高教授一年可以寫出七八篇SIAM Journal期刊論文的 功力, 實在讓「隨機客」佩服得五體投地. 演講的時間在下週二(2006/8/15) 下午兩點半，地點 在台大資訊館一樓教室, 確切的教室號碼容後公布。 高教授演講的題目是演算法近幾年引起廣泛研究興趣 的DNA self-assembly,精采可期, 歡迎版上好友一起 捧場, 隨機弟子則務必參加. 演講的資料如下： Algorithmic DNA Self-Assembly Ming-Yang Kao Department of Electrical Engineering and Computer Science Northwestern University Evanston, IL 60208, USA Abstract Self-assembly is the ubiquitous process by which objects autonomously assemble into complexes. This phenomenon is common in nature and yet is poorly understood from mathematical and programming perspectives. It is believed that self-assembly technology will ultimately permit the precise fabrication of complex nanostructures. Of particular interest is DNA self-assembly. Double and triple crossover DNA molecules have been designed that can act as four-sided building blocks for DNA self-assembly. Experimental work has been done to show the effectiveness of using these building blocks to assemble DNA crystals and perform DNA computation. With these building blocks (called tiles) in mind, researchers have considered the power of the tile self-assembly model. The tile assembly model extends the theory of Wang tilings of the plane by adding a natural mechanism for growth. Informally, the model consists of a set of four sided Wang tiles whose sides are each associated with a type of glue. The bonding strength between any two glues is determined by a glue function. A special tile in the tile set is denoted as the seed tile. Assembly takes place by starting with the seed tile and attaching copies of tiles from the tile set one by one to the growing seed whenever the total strength of attraction from the glue function meets or exceeds a fixed parameter called the temperature. Algorithmic DNA self-assembly is both a form of nanotechnology and a model of DNA computing. As a computational model, algorithmic DNA self-assembly encodes the input of a computational problem into DNA patterns and then manipulates these patterns to produce new DNA patterns that encode the desired output of the computational problem. As a nanotechnology, algorithmic DNA self-assembly aims to design tiles with carefully chosen glue types on their four sides. Two tiles are said to be of different types if their sides have different glue types. Useful tile types are nontrivial to design but relatively easy to duplicate in large quantity. A key design challenge for algorithmic DNA self-assembly is to use only a small number of different tile types to assemble a target nanostructure. This talk will survey recent results in algorithmic DNA self-assembly and discuss future research directions. --

※ 發信站: 批踢踢實業坊(ptt.cc) ◆ From: 140.112.249.157 ※ 編輯: kingjason 來自: 140.112.249.157 (08/12 00:02)