时间: 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)