Professor Matt Bishop’s research area is computer security, in which he has been active since 1979. He is especially interested in vulnerability analysis and denial of service problems, but maintains a healthy concern for formal modeling (especially of access controls and the Take-Grant Protection Model) and intrusion detection and response. He has also worked extensively on the security of various forms of the UNIX operating system. He is involved in efforts to improve education in information assurance, and is a charter member of the Colloquium for Information Systems Security Education. His textbook, Computer Security: Art and Science, was published by Addison-Wesley in December 2002.
Scientific visualization and computer graphics.
My laboratory develops novel computational methods for extracting meaningful structural and functional properties from brain magnetic resonance images. We then use the techniques to describe the natural history of brain aging and age-related neurodegenerative diseases such as Alzheimer’s disease.
Professor Chen’s research interests focus on significant and difficult problems of computer security and software verification. These two topics relate to each other, in that it is crucial to verify that computer programs do not have bugs that may result in security vulnerabilities. By combining theoretical insights with detailed knowledge of real computer systems, Mr. Chen’s work results in practical, usable security verification systems. Mr. Chen is best known for his tool MOPS, which finds security vulnerabilities in C programs.
Machine learning and data mining algorithm development with a focus on human in the loop style learning.
We work on a variety of different learning settings such as learning to rank, clustering, transduction as well as data simplification. Most of our formulations are in typical mathematical programming frameworks but a growing interest is in formulations in constraint programming frameworks.
With collaborators I work on applications of my work to areas of social importance such as Neuroscience as well as demonstrative applications in text, social networks and images.
Premkumar T. Devanbu
Matthew K. Farrens
Professor Farrens is interested in all aspects of computer architecture, but primarily in the architecture and design of high-performance single-chip processors with an emphasis on the interconnection/communication layer. Professor Farrens is also interested in high-speed scientific processing, in particular in exploring issues related to the memory system, and in Instruction Level Parallelism.
Professor Franklin’s research interests include cryptography, security, and distributed computing. He is particularly interested these days in protocols for dynamic coalition management and electronic commerce scenarios. Professor Franklin is a member of ACM and IACR (International Association for Cryptologic Research).
High-speed Networks, Wireless Networks, Vehicular Ad-hoc Networks, Parallel and Distributed Systems, Timing Channels, Performance Evaluation of Computer and Communication Systems.
Daniel M. Gusfield
Efficiency of algorithms, particularly for problems in combinatorial optimization and graph theory. These algorithms have been applied to study data and computer security, stable matching, network flow, matroid optimization, and string/pattern matching problems. Currently, Professor Gusfield is focused on string and combinatorial problems that arise in computational biology, particularly involving bioinformatics and genomics.
Development of accurate numerical simulation methods for applications in computational materials science, as well as computational physics and chemistry. He is involved in the development of algorithms for First-Principles Molecular Dynamics, a simulation method that combines a calculation of atomic trajectories with a quantum mechanical description of electronic properties. This method is widely used to explore the properties of solids, liquids, nanoparticles and biomolecules. First-principles simulations are computationally expensive and require the use of large parallel computers. The integration of efficient parallel numerical algorithms in simulation codes is an important part of his research.
Visualization, geometric design and modeling, and computer graphics. Data analysis, image processing, and data approximation are additional research areas he is pursuing.
Kenneth I. Joy
Ken Joy is a Professor in the Computer Science Department at the University of California at Davis. He came to UC Davis in 1980 in the Department of Mathematics and was a founding member of the Computer Science Department in 1983. Professor Joy’s research and teaching interests are in the area of visualization, geometric modeling, and computer graphics.
Research program focuses on understanding protein structures. He is interested in characterizing their shapes, and uses this information to improve our understanding of their stability (ProShape). He is also interested in characterizing the subset of sequence space compatible with a protein structure: this is an indirect approach to understanding protein sequence evolution (ProDesign) . In parallel, he is involved in the development of new algorithms for predicting the structure of a protein, based on its sequence (ProModel). Dr. Koehl will also have a research appointment with the Genome Center.