1980 — 1982 
Lee, D. 
N/AActivity Code Description: No activity code was retrieved: click on the grant title for more information 
Concrete Computational Complexity @ Northwestern University 
0.942 
1982 — 1985 
Lee, D. 
N/AActivity Code Description: No activity code was retrieved: click on the grant title for more information 
Concrete Computational Complexity (Computer Research) @ Northwestern University 
0.942 
1989 — 1994 
Lee, D. 
N/AActivity Code Description: No activity code was retrieved: click on the grant title for more information 
Studies in Geometric Optimization and Related Problems @ Northwestern University
This is work on optimization problems that arise in computational geometry and related areas. Problems are being studied in four areas: covering and approximation; minimum diameter spanning trees; via minimization; and, proximity and visibility. These problems have applications in areas such as computeraided design, computer graphics, operations research, and robotics. The emphasis in this project is on the design of efficient algorithms for the problems under consideration.

0.942 
1992 — 1994 
Lee, D. 
N/AActivity Code Description: No activity code was retrieved: click on the grant title for more information 
Ait (U.S.)  Ccnaa (Taiwan) Cooperative Research: Studies of Geometric Optimization and Related Problems @ Northwestern University
This is an 18 month cooperative research project proposed by Dr. DerTsai Lee, Northwestern University and Professor R.C.T. Lee, Taiwan Tsing Hua University, supported by the AIT (U.S.)  CCNAA (Taiwan) Cooperative Science Program. This project plans to study ways to minimize the paths between the points in one segment of a computer disk and those in another segment. This is an important problem in geometric optimization and computer computation. Professor Lee of Tsing Hua University is an expert in this area with the additional human and funding resources needed to carry out computer simulations. This is a mutually beneficial study of a set of problems for which there are currently no solutions. Advances in this area can benefit computing and automation industries.

0.942 
1993 — 1997 
Lee, D. 
N/AActivity Code Description: No activity code was retrieved: click on the grant title for more information 
BiCriteria Optimization, Geometric Location & Related Problems @ Northwestern University
Optimization problems that arise in computational and other related areas are investigated in this project. Special emphasis is placed on bicriteria optimization problems and geometric problems. In a communication network, the two important criteria that are of great practical implications are the communication delay and total cost. In path planning routing, the two important criteria are the total length and the number of bends. Optimization problems concerning two criteria either simultaneously or in lexicographical order are studied. Among those to be studied are weighted farthest neighbor Voronoi diagram construction for a set of point sites, a new class of geometric problems, called the capacitated path problem, in which the obstacles have capacities and the cost of a path avoiding these obstacles is a function of the length of the path and the capacities of the obstacles visited by the path, and routing problems with multiple sourcedestination pairs such that these paths do not cross and yet their total length is to be minimized. The goals of this research are to apply geometric techniques to tackle these new classes of optimization problems, and to identify problems that can (or cannot) benefit from the geometric properties.

0.942 
1997 — 2003 
Scheuermann, Peter (coPI) [⬀] Lee, D. Banerjee, Prithviraj [⬀] Sarrafzadeh, Majid (coPI) [⬀] Choudhary, Alok (coPI) [⬀] Taylor, Valerie Hauck, Scott (coPI) [⬀] 
N/AActivity Code Description: No activity code was retrieved: click on the grant title for more information 
Cise Research Infrastructure: a Distributed HighPerformance Computing Infrastructure @ Northwestern University
CDA9703228 Prithviraj Banerjee Northwestern University A Distributed HighPerformance Computing Infrastructure This award is for the acquisition of 20 highend UNIX workstations, 50 lowend UNIX workstations, three UNIX fileservers, an 8processor distributed shared memory multiprocessor, and a 64ported ATM switching hub. The machines would be networked together using highspeed OC3 ATM networks with bandwidths of 155 Mbps. As the use of highspeed networking moves from the laboratory to the workplace, new opportunities arise for the design and implementation of a highspeed distributed computing environment. The goals of this project are: (1) to explore the use of highspeed networking and computing to investigate file systems and data management issues for highperformance distributed computing, (2) to investigate the parallel programming support of networks of highspeed workstations and personal computers as an alternative to standalone parallel computers, (3) to study highperformance computeraided design of electronic systems in a heterogeneous environment, and to develop a Webbased CAD computing center, that takes advantage of highspeed networking, (4) to explore new instructional techniques that take advantage of the high bandwidth and high speed.

0.942 
1998 — 2002 
Lee, D. 
N/AActivity Code Description: No activity code was retrieved: click on the grant title for more information 
Geometric Algorithm Design and Visualization 
0.964 