Investigation and Development of Parallel Large Scale Record Linkage Techniques. Record linkage aims at matching records of the same entity (like customer or patient) in large (administrative) databases. The outcomes of the proposed research will improve current techniques in terms of efficiency, accuracy and the need for human intervention. Through experimental studies and stochastic modelling the performance of traditional and new methods for data cleaning, standardisation and linkage will be ....Investigation and Development of Parallel Large Scale Record Linkage Techniques. Record linkage aims at matching records of the same entity (like customer or patient) in large (administrative) databases. The outcomes of the proposed research will improve current techniques in terms of efficiency, accuracy and the need for human intervention. Through experimental studies and stochastic modelling the performance of traditional and new methods for data cleaning, standardisation and linkage will be assessed. The effect of the statistical dependency of attribute values will be studied. New methods using clustering for blocking large datasets, and predictive models including interaction terms will be implemented, analysed and evaluated on high-performance computers and office-based PC clusters.
Read moreRead less
COMPLEX NETWORKS: DYNAMICS, OPTIMIZATION AND CONTROL. Complex networks such large power grids, the Internet, transportation networks and co-operation networks of all kinds provide challenges for frontier technologies particularly computing, communication and control. In particular, advanced societies have become dependent on large infrastructure networks to an extent beyond our capability to plan and control them. The recent spate of collapses in power grids and virus attacks on the Internet i ....COMPLEX NETWORKS: DYNAMICS, OPTIMIZATION AND CONTROL. Complex networks such large power grids, the Internet, transportation networks and co-operation networks of all kinds provide challenges for frontier technologies particularly computing, communication and control. In particular, advanced societies have become dependent on large infrastructure networks to an extent beyond our capability to plan and control them. The recent spate of collapses in power grids and virus attacks on the Internet illustrate the need for research on modelling, analysis of behaviour, planning and control in such networks. This project aims to establish research in this area for Australia's benefit.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
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
Dynamics and Security Control of Complex Networks. The research will yield basic techniques to analyse, design and operate complex networks so that security, as well as performance, is achieved. These techniques will be further developed towards particular applications including power grids and telecommunication networks. However, the emphasis is on providing basic ideas and techniques.
Sparse grid approximations and fitting using generalised combination techniques. Sparse grid techniques provide an effective tool to deal with the
computational curse of dimensionality which is a constant challenge in
modelling complex data. The proposed research is aimed at the
development and analysis of algorithms for data fitting with sparse
grids using variants of the combination technique. The outcome of the
research is a theory which will provide insights in the applicability,
limit ....Sparse grid approximations and fitting using generalised combination techniques. Sparse grid techniques provide an effective tool to deal with the
computational curse of dimensionality which is a constant challenge in
modelling complex data. The proposed research is aimed at the
development and analysis of algorithms for data fitting with sparse
grids using variants of the combination technique. The outcome of the
research is a theory which will provide insights in the applicability,
limitations and the convergence properties of the proposed
algorithms. The outcomes will be widely applicable in modelling of
large scale and complex data as is encountered in areas of
bioinformatics, physics and experimental studies of complex systems.
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