Algorithms for geometric Turán-type problems and network visualization. Recent technological advances have large data sets, in a data deluge. Some of the most critical data sets are networks; examples abound in Systems Biology, Social Network Analysis, and Software Engineering. This project aims for algorithms to construct readable pictures of these networks, and thus make the data easier for humans to understand.
Visual interaction methods for clustered graphs. This project aims to improve human understanding of huge network data sets, such as those arising in social networks, biological networks, and very large software structures. The project will enable analysts to explore and interact with such data sets, leading to better understanding.
Scalable Visual Analytics for Uncertain Dynamic Networks. Technological advances have provided a data deluge over the past few years, and have led to many large uncertain and dynamic network models. This includes terrorist networks, marketing networks, facebook networks, various biological networks, and software engineering structures. Human understanding of such networks is difficult. This project aims to provide new methods for visual analysis of large uncertain dynamic networks such as these. ....Scalable Visual Analytics for Uncertain Dynamic Networks. Technological advances have provided a data deluge over the past few years, and have led to many large uncertain and dynamic network models. This includes terrorist networks, marketing networks, facebook networks, various biological networks, and software engineering structures. Human understanding of such networks is difficult. This project aims to provide new methods for visual analysis of large uncertain dynamic networks such as these. The algorithms developed in the project will help security analysts to monitor illegal behaviour such as money laundering and terrorist activities, help biologists understand key biological systems, and help engineers to understand large software systems.Read moreRead less
Exploring the Frontiers of Feasible Computation. The project aims to delineate the boundary between feasible and infeasible computational problems. A problem is considered feasible if there is an algorithm to solve it in worst-case time bounded by a polynomial in the input size. This is probably impossible for the important class of NP-complete problems. However, typical examples of NP-complete problems can often be solved in polynomial time, because worst-case problems are rare. The project is ....Exploring the Frontiers of Feasible Computation. The project aims to delineate the boundary between feasible and infeasible computational problems. A problem is considered feasible if there is an algorithm to solve it in worst-case time bounded by a polynomial in the input size. This is probably impossible for the important class of NP-complete problems. However, typical examples of NP-complete problems can often be solved in polynomial time, because worst-case problems are rare. The project is relevant to public-key cryptography, where breaking an encryption scheme should be infeasible, and to many real-life situations where NP-complete problems need to be solved, either exactly or approximately.Read moreRead less
Multicast in Single-Hop and Multi-Hop WDM Optical Networks. The emerging Wavelength-Division-Multiplexing (WDM) optical network is a promising candidate for next-generation Internet, which provides enormous bandwidth and fast connectivity. Multicast in WDM networks is a fundamental problem which has wide applications including teleconferencing, entertainment distribution, etc. In this project we investigate the multicast and constraint multicast problems in both single-hop and multi-hop WDM netw ....Multicast in Single-Hop and Multi-Hop WDM Optical Networks. The emerging Wavelength-Division-Multiplexing (WDM) optical network is a promising candidate for next-generation Internet, which provides enormous bandwidth and fast connectivity. Multicast in WDM networks is a fundamental problem which has wide applications including teleconferencing, entertainment distribution, etc. In this project we investigate the multicast and constraint multicast problems in both single-hop and multi-hop WDM networks by studying their computational complexities and devising scalable, high-quality approximation algorithms for them. The developed algorithms significantly improve the network performance and scalability, and the innovative approaches and algorithm techniques developed in this project are also applicable to other routing problems.Read moreRead less
Coarse Grained Parallel Algorithms. Various fields of research face barriers created by problems that are computationally hard and/or require processing of large amounts of data. For example, some computational biochemistry methods on protein or gene sequences can not be scaled up to data sets required for human health research because of performance problems. Parallel computing enables new research by increasing the size of solvable problems. In addition to fundamental parallel computing resear ....Coarse Grained Parallel Algorithms. Various fields of research face barriers created by problems that are computationally hard and/or require processing of large amounts of data. For example, some computational biochemistry methods on protein or gene sequences can not be scaled up to data sets required for human health research because of performance problems. Parallel computing enables new research by increasing the size of solvable problems. In addition to fundamental parallel computing research, this project studies parallel algorithms for structure-based drug design and protein-protein interaction prediction that will enable new biochemistry research, as well as parallel algorithms for data cubes that will help enable the next generation of very large data warehouses.Read moreRead less
Automation of metric temporal reasoning. A major contemporary engineering concern is to ensure the predictable and robust operation of computer systems involving software, hardware, and human users. The need for systematic and careful construction of such systems requires the development of formal methods based on a dense view of time rather than the traditional step-by-step models.
automated strategic reasoning. Formal methods are used to ensure robust correct behaviour in design and implementation of computer systems. Traditional models of computer operation involve a linear sequence of behaviour but today’s systems are complex interactions between many components including the environment of the system and human users. Thus analysis is done via a logical game between components where each is trying to meet its specified requirements regardless of what others do: formalis ....automated strategic reasoning. Formal methods are used to ensure robust correct behaviour in design and implementation of computer systems. Traditional models of computer operation involve a linear sequence of behaviour but today’s systems are complex interactions between many components including the environment of the system and human users. Thus analysis is done via a logical game between components where each is trying to meet its specified requirements regardless of what others do: formalisms include branching time and competing coalitions of agents. This project is to take early advantage of recent breakthroughs in automated logical reasoning with such models by the investigator to deliver general practical techniques of system development and verification.Read moreRead less
Algorithmics for Interactive 2.5D Graph Drawing. Technological advances have provided a data deluge over the past few years, and consequently have led to many large and complex network models in many domains. This includes terrorrist networks and biological networks, software engineering structures, and webgraphs. Visualisation is an effective tool in helping humans to understand such networks. This project aims to provide a new direction in network visualisation, using 2.5 dimensions. The algor ....Algorithmics for Interactive 2.5D Graph Drawing. Technological advances have provided a data deluge over the past few years, and consequently have led to many large and complex network models in many domains. This includes terrorrist networks and biological networks, software engineering structures, and webgraphs. Visualisation is an effective tool in helping humans to understand such networks. This project aims to provide a new direction in network visualisation, using 2.5 dimensions. The algorithms developed in the project will help security analysts to detect abnormal behavious such as money laundering, help biologists understand protein-protein interaction networks, and help engineers to understand large software systems.Read moreRead less
Efficient Pre-Processing of Hard Problems: New Approaches, Basic Theory and Applications. Computers store even larger amounts of data about all aspects of human and industrial activity. However, they have not become significantly better at solving common problems in optimization and search. Traditional complexity theory indicates many of these problems require algorithms that are very unlikely to exist. The Parameterized Complexity approach allows us to obtain very efficient algorithms for a lar ....Efficient Pre-Processing of Hard Problems: New Approaches, Basic Theory and Applications. Computers store even larger amounts of data about all aspects of human and industrial activity. However, they have not become significantly better at solving common problems in optimization and search. Traditional complexity theory indicates many of these problems require algorithms that are very unlikely to exist. The Parameterized Complexity approach allows us to obtain very efficient algorithms for a large variety of problems, but the machinery required was diverse and complicated. This research will organize the machinery into a new approach that systematically finds good algorithms by applying simplifications around a parameter of the domain of the problem. As a result, efficient algorithms are obtained for many diverse areas.Read moreRead less