The architecture of networks: Characterisation and visualisation of complex systems as fluctuating networks. Complex systems comprise many mutually interacting components, characterised by a range of different interactions over time and space. They are dynamical systems, whose features are reminiscent of a web, with fluctuating links of varying strengths. The natural paradigm for such systems is a generic network, or a graph. A suite of novel measures from statistical physics, graph theory, top ....The architecture of networks: Characterisation and visualisation of complex systems as fluctuating networks. Complex systems comprise many mutually interacting components, characterised by a range of different interactions over time and space. They are dynamical systems, whose features are reminiscent of a web, with fluctuating links of varying strengths. The natural paradigm for such systems is a generic network, or a graph. A suite of novel measures from statistical physics, graph theory, topology, geometry, and computer graphics will be developed to characterise system/graph growth and stability. The aim is two-fold: first to reduce real complex systems (mainly financial systems) to computationally manageable structures (including direct visualisation) and second to construct realistic models of the evolution of such 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
Design Efficient Routing Protocols For WDM Optical Networks. The optical network technique plays a key role to the next-generation networks. In particular, wavelength-division-multiplexing (WDM) optical networks have emerged as a promising candidate for next-generation networks in providing huge available bandwidth and connectivity.
Routing and wavelength assignment problem is one of the fundamental problems in WDM optical networks. In this project we primarily focus on devising and analyzing ....Design Efficient Routing Protocols For WDM Optical Networks. The optical network technique plays a key role to the next-generation networks. In particular, wavelength-division-multiplexing (WDM) optical networks have emerged as a promising candidate for next-generation networks in providing huge available bandwidth and connectivity.
Routing and wavelength assignment problem is one of the fundamental problems in WDM optical networks. In this project we primarily focus on devising and analyzing efficient routing algorithms for all-to-all routing and robust routing in the WDM networks. Incorporated with various known techniques, practical algorithms will be developed. The algorithms and techniques developed in this project will be through simulation, testing, and implementation.Read moreRead less
Practical and theoretical aspects of structure enumeration. Many areas of study involve processing of large numbers of
objects in some class. These are countless examples in
chemistry, physics, mathematics, and other disciplines.
Structure Enumeration is the study of methods for efficient
generation and analysis of such objects. The project will
involve exploitation and extension of recent advances, many
due to the CI, which have added orders of magnitude to what
was possible only a few ....Practical and theoretical aspects of structure enumeration. Many areas of study involve processing of large numbers of
objects in some class. These are countless examples in
chemistry, physics, mathematics, and other disciplines.
Structure Enumeration is the study of methods for efficient
generation and analysis of such objects. The project will
involve exploitation and extension of recent advances, many
due to the CI, which have added orders of magnitude to what
was possible only a few years ago. The outcome will be a
combination of theoretical results and practical achievements,
whose usefulness will be demonstrated with some serious
applications in physics and mathematics.
Read moreRead less
Structure enumeration, applications and analysis. Structure enumeration and analysis is at the heart of finite mathematics and its many fields of application in diverse scientific disciplines. Australia has a substantial status in this field both in mathematics and physics. This project will enhance that status and develop greater ties with the centres of structure research in other parts of the world.
Proof Theoretical Methods for Reasoning about Process Equivalence. The emergence of internet commerce has made the issue of secure computing more urgent than ever. A substantial part of the security issues with today's computer applications are due to design problems.
The principles of secure computation have not been fully understood and adequate tools for the construction of secure applications are still lacking. The understanding of the foundations of secure computation is essential in bu ....Proof Theoretical Methods for Reasoning about Process Equivalence. The emergence of internet commerce has made the issue of secure computing more urgent than ever. A substantial part of the security issues with today's computer applications are due to design problems.
The principles of secure computation have not been fully understood and adequate tools for the construction of secure applications are still lacking. The understanding of the foundations of secure computation is essential in building trusted computer applications. Process calculi and logic represent two promising disciplines in which the principles of analysis and design of secure systems can be studied systematically, out of which formal verification tools can be constructed.Read moreRead less
Expressive power and complexity of temporal logics for model-checking. Hardware verification based upon mathematical logic is now routinely
used in industry to verify the correctness of large digital circuits
using a technique called model-checking. Such discrete systems move
from one state to another according to the regular ticks of a clock.
The challenge now is to find tractable methods for reasoning about
real-time systems and hybrid systems that move in a continuous manner
with respec ....Expressive power and complexity of temporal logics for model-checking. Hardware verification based upon mathematical logic is now routinely
used in industry to verify the correctness of large digital circuits
using a technique called model-checking. Such discrete systems move
from one state to another according to the regular ticks of a clock.
The challenge now is to find tractable methods for reasoning about
real-time systems and hybrid systems that move in a continuous manner
with respect to time: examples include aeroplanes flying according to
the laws of physics and a moving robot arm. We shall invent new logics
which are specifically tailored for tractable reasoning about
real-time and hybrid systems.Read moreRead less