Page 46 - profile2014.indd

特聘研究員
李德財 Der-Tsai Lee

Distinguished Research Fellow
Ph.D., Computer Science, University of Illinois at Urbana-Champaign
Tel: +886-2-2788-3799 ext. 2209 Fax: +886-2-2782-4814
Email: dtlee@iis.sinica.edu.tw
http://www.iis.sinica.edu.tw/pages/dtlee

● President & Computer Science Research Description
Chair Professor, National Chung
Hsing University, Taichung, Tai-
wan (2011-) Our research is concerned with the design and analysis of algorithms, geometric comput-
ing, cloud computing, software security and vulnerability detection, and digital library
● Distinguished Alumni Educator
Award, Dept. of CS, University of technologies. In graph algorithms and geometric computing, we consider geometric net-

Illinois at Urbana-Champaign, work design problems; such problems arise in many elds, including VLSI design, wireless
(2014). sensor network, and communication networks, and are concerned with the network con-

● Humboldt Research Award struction of a collection of sites, subject to various requirements, e.g., energy-e ciency. We

(2007), Ambassador Scientist, Al- consider the construction and evaluation of networks under one or more objective func-
exander von Humboldt Founda-
tion, Germany (2010-) tions, so-called multi-criteria network optimization. We focus on several important meas-
ures to evaluate the quality of network design, including weight (total length of all edges),
● Member, The Academy of Sci-
ences for the Developing World diameter (longest path between any two nodes), dilation (largest ratio of network distance
(TWAS) (2008) to Euclidean distance), routing cost (total sum over the network distances between all ver-
● Academician, Academia Sinica tex pairs), bottleneck bandwidth, and capacity. We also address issues concerning energy-

(2004) e ciency of computing systems, and other discrete optimization problems, such as ca-
● Distinguished Research Fellow pacitated domination, solid moulding, and others. Most of these problems are known to be
(1998- ) & Director, Institute of computationally intractable. Thus, we explore the underlying structures or properties, and
Information Science, Academia attempt to obtain heuristics or suitable approximation solutions. In the area of information
Sinica (1998 - 2008)
security, we consider secure message delivery problems. We propose a secure message
● Assistant Professor (1978), Associ- delivery scheme for email delivery, dubbed NapaMail, which aims to extend and improve
ate Professor (1981), Professor
(1986-99), EECS, Northwestern granular control for delivering sensitive email messages. In particular, we have adopted an
University. approach that replaces the traditional push-by-default email delivery model, e.g. SMTP. The
● Program Director, Div. of Com- user’s data will not be ‘pushed’ automatically, but will instead be `pulled´ with the recipient’s
puter and Computation Research, consent. At present, once an SMTP email is sent, it is not retractable in most cases. We would
National Science Foundation like to provide a more ne-grained mechanism to better control the delivery of important

(1989 - 90)
data or sensitive emails, in the hope of mitigating the hazard of data leakage and infectious
● Fellow, Association for Comput- propagation of user’s data. For delivery of messages containing sensitive personal informa-
ing Machinery (1997), Institute
of Electrical and Electronic Engi- tion in a mobile environment, we propose Pandora Messaging, an enhanced secure instant
neers (1992) messaging architecture, equipped with a self-message-destructing feature. We have de-
● Editor, Algoritmica, Int’l J. of signed both the Pandora Message Encryption and Exchange Scheme and the format of a
Computational Geometry & Ap- self-destructible message to demonstrate how to exchange these messages atop the exist-
plications, Int’l J. of Information ing instant messaging service architecture, e.g., XMPP, EXtensible Messaging and Presence
and Computer Security; Series Protocol. The Pandora Messaging-based system enables senders to set time, frequency,
Editor, Lecture Notes Series on
Computing, World Scientific and location constraints. These conditions determine when the transmitted messages can
Publishing Co., Inc. be accessed and destroyed, making them unreadable for receivers. A simple messenger ap-
● Ph.D. (1978), M.S. (1976), CS, plication on the Android platform has been implemented, and its performance evaluated
University of Illinois at Urbana- for its practicality and feasibility. We are also interested in application software develop-
Champaign, B.S., EE, National ment. Expanding on OpenCPS, a collaborative problem-solving environment (PSE) (http://
Taiwan University (1971)
www.opencps.org), we have built a geometric algorithm development environment (Geo-
ADE) to better support the implementation and visualization of algorithms for geometric

46 特聘講座/特聘研究員 Distinguished Chair and Distinguished Research Fellows