Reliable and Seamless Service Provisioning in Mobile Edge Computing . This project aims to develop enabling technologies to provide reliable and seamless services in mobile edge computing environments. This project will develop advanced algorithms with performance guarantees and efficient mechanisms for such service provisioning. The project expects to lay theoretical foundations and generate new knowledge for the provisioning of reliability-aware and mobility-aware services in mobile edge compu ....Reliable and Seamless Service Provisioning in Mobile Edge Computing . This project aims to develop enabling technologies to provide reliable and seamless services in mobile edge computing environments. This project will develop advanced algorithms with performance guarantees and efficient mechanisms for such service provisioning. The project expects to lay theoretical foundations and generate new knowledge for the provisioning of reliability-aware and mobility-aware services in mobile edge computing. The expected outcome of the project is a set of solutions to the myriad of services relying on mobile edge computing including e-Health, autonomous vehicles, and Internet of Things. This project will develop key fundamental technologies to improve Australia’s standing in the international research community.
Read moreRead less
New Applications of Additive Combinatorics in Number Theory and Graph Theory. The project aims to advance significantly the interplay between additive combinatorics, number theory and graph theory. The project will use and advance methods and results of additive combinatorics and give new applications to such fundamental problems on Cayley graphs as connectivity, random walks, colouring and dominating sets. The significance of the project is ensured by its goal of advancing existing results and ....New Applications of Additive Combinatorics in Number Theory and Graph Theory. The project aims to advance significantly the interplay between additive combinatorics, number theory and graph theory. The project will use and advance methods and results of additive combinatorics and give new applications to such fundamental problems on Cayley graphs as connectivity, random walks, colouring and dominating sets. The significance of the project is ensured by its goal of advancing existing results and methods of additive combinatorics and also in finding their new applications that have long-lasting impact on paramount problems for Cayley graphs that underlie the architecture of crucial communication networks. Achieving progress on these problems and developing relevant methods of additive combinatorics will be the main outcomes. Read moreRead less
Quantification of whole brain structural connectivity and fibre densities. The project is intended to develop and improve accuracy in tools used to measure brain connections. Its overall aim is to produce definitive evidence of the biological accuracy of quantitative measures of brain structural connectivity as derived from diffusion magnetic resonance imaging (MRI). Discovery in the quantitative field of MRI research is important to worldwide efforts to identify the human ‘connectome’. The proj ....Quantification of whole brain structural connectivity and fibre densities. The project is intended to develop and improve accuracy in tools used to measure brain connections. Its overall aim is to produce definitive evidence of the biological accuracy of quantitative measures of brain structural connectivity as derived from diffusion magnetic resonance imaging (MRI). Discovery in the quantitative field of MRI research is important to worldwide efforts to identify the human ‘connectome’. The project plans to bring together novel diffusion MRI post-processing methods and state-of-the-art 3-D glass-brain histology techniques using mice. Investment in MRI research that specifically addresses methods to accurately measure structural brain connectivity may ultimately contribute to improving non-invasive imaging methods.Read moreRead less
Software-defined provisioning of Internet of Things applications in fog computing systems. This project aims to investigate and provide solutions for the realisation of a seemingly integrated Fog Computing (FC) paradigm with cloud environments, networking devices and Internet of Things devices. Fog Computing (FC) is an emerging paradigm with great promises for advancing Information and Communications Technologies. Using interdisciplinary approaches, the project expects to generate new knowledge ....Software-defined provisioning of Internet of Things applications in fog computing systems. This project aims to investigate and provide solutions for the realisation of a seemingly integrated Fog Computing (FC) paradigm with cloud environments, networking devices and Internet of Things devices. Fog Computing (FC) is an emerging paradigm with great promises for advancing Information and Communications Technologies. Using interdisciplinary approaches, the project expects to generate new knowledge for optimising both hardware and software resources of a FC system. Outcomes of this project include practical solutions through building novel mathematical frameworks and optimisation objectives. The project is expected to provide efficient monitoring and control of intelligent spaces, management of urban and rural environments and will have applications in the areas of energy, security, transport and public health.Read moreRead less
Unlocking the potential for linear and discrete optimisation in knot theory and computational topology. Computational topology is a young, energetic field that uses computers to solve complex geometric problems, such as whether a loop of string is tangled. Such computations are becoming increasingly important in mathematics, and applications span biology, physics and information sciences, however many core problems in the field remain intractable for all but the simplest cases. This project unit ....Unlocking the potential for linear and discrete optimisation in knot theory and computational topology. Computational topology is a young, energetic field that uses computers to solve complex geometric problems, such as whether a loop of string is tangled. Such computations are becoming increasingly important in mathematics, and applications span biology, physics and information sciences, however many core problems in the field remain intractable for all but the simplest cases. This project unites geometric techniques with powerful methods from operations research, such as linear and discrete optimisation, to build fast, powerful tools that can for the first time systematically solve large topological problems. Theoretically, this project has significant impact on the famous open problem of detecting knottedness in fast polynomial time.Read moreRead less
Algebraic and geometric methods in switched control system analysis and design. The theory of switched control systems underpins complex network technologies that enable cleaner, more efficient and sustainable energy, transport and industry. The research aims to extend the fundamental knowledge base in systems and control, contributing to maintain the solid world-class reputation of Australia in the field.
Parameterized Analysis of Bio-inspired Computing - From Theory to High Performing Algorithms. This project will establish the field of parameterised analysis of bio-inspired computing which includes prominent approaches such as evolutionary algorithms and ant colony optimisation. It will rigorously analyse features of instances of combinatorial optimisation problems and their impact on the runtime behaviour of bio-inspired computing methods. Furthermore, the project will design new bio-inspired ....Parameterized Analysis of Bio-inspired Computing - From Theory to High Performing Algorithms. This project will establish the field of parameterised analysis of bio-inspired computing which includes prominent approaches such as evolutionary algorithms and ant colony optimisation. It will rigorously analyse features of instances of combinatorial optimisation problems and their impact on the runtime behaviour of bio-inspired computing methods. Furthermore, the project will design new bio-inspired computing algorithms that make use of instance features and hardness characteristics. The results will advance the theoretical knowledge of bio-inspired computing, bridge the gap between theory and practice, and provide more powerful algorithms for complex optimisation problems occurring for example in the field of supply chain management for the mining industry.Read moreRead less
Lattices as a constructive and destructive cryptographic tool. The project is driven by the great number of potential applications of deep mathematical and algorithmic methods to different areas of modern cryptography. These areas provide a solid platform for more applied fields such as Computer and Information Security and E-commerce. It will lead to commercialisation and everyday-life improvements.
Quantum algorithms for quantum chemistry. This project aims to develop more efficient algorithms to simulate quantum chemistry on quantum computers. Quantum computers have the potential to perform calculations that would be intractable for even the largest supercomputers, but need to be programmed in a radically different way to achieve this speed. One of the most important applications of quantum computers is to simulate quantum mechanics to predict the properties of molecules and materials, an ....Quantum algorithms for quantum chemistry. This project aims to develop more efficient algorithms to simulate quantum chemistry on quantum computers. Quantum computers have the potential to perform calculations that would be intractable for even the largest supercomputers, but need to be programmed in a radically different way to achieve this speed. One of the most important applications of quantum computers is to simulate quantum mechanics to predict the properties of molecules and materials, and thereby design them. Current quantum algorithms are very resource intensive, making them impractical for the foreseeable future. The expected outcome of this project is to provide much more efficient algorithms that can be run on quantum processors in the near future.Read moreRead less
Quantum computation: through the algorithm and complexity theory lens. This project aims to advance our knowledge of quantum computation through the lens of algorithm and complexity theory. Three core areas of the theory will be examined: interactive computing models, query complexity, and circuit lower bounds. The expected outcomes include: revealing the quantum advantages of interactive computing models; techniques for verifying quantum devices in the cloud and quantum cloud computing in gener ....Quantum computation: through the algorithm and complexity theory lens. This project aims to advance our knowledge of quantum computation through the lens of algorithm and complexity theory. Three core areas of the theory will be examined: interactive computing models, query complexity, and circuit lower bounds. The expected outcomes include: revealing the quantum advantages of interactive computing models; techniques for verifying quantum devices in the cloud and quantum cloud computing in general; sharpening the separation between algorithm performance in quantum and classical query models; establishing both unconditional and conditional hardness results for quantum circuits. This comprehensive understanding will enhance Australia's research portfolio in the theory of quantum computing.Read moreRead less