A probabilistic framework for nonlinear dimensionality reduction algorithms. The Twin Measures Framework is a novel platform for analysing existing dimensionality reduction methods and the invention of new ones. This research will radically improve image analysis, with beneficial applications from pharmaceutical drug design through to border protection.
Approximate reasoning with qualitative spatial constraints involving landmarks. Applications like emergency management of bushfires, floods, or earthquake require spatial information systems to integrate multiple kinds of information and make intelligent responses in a very limited time. This project will make breakthroughs in developing efficient methods to reason about complex spatial situations.
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
Discovery Early Career Researcher Award - Grant ID: DE150101351
Funder
Australian Research Council
Funding Amount
$315,000.00
Summary
Playing and Solving General Games. Constructing rational agents for general dynamic decision problems is a long-standing open Artificial Intelligence challenge. An important milestone is to construct artificial agents that can learn and play new games well (universal playing agents). Specialised artificial intelligence systems are increasingly successful in domains such as Chess, Go, and Poker. The project aims to develop the theoretical and practical foundations of universal playing agents thro ....Playing and Solving General Games. Constructing rational agents for general dynamic decision problems is a long-standing open Artificial Intelligence challenge. An important milestone is to construct artificial agents that can learn and play new games well (universal playing agents). Specialised artificial intelligence systems are increasingly successful in domains such as Chess, Go, and Poker. The project aims to develop the theoretical and practical foundations of universal playing agents through a mathematical study of algorithms and heuristics for specific games. This project aims to significantly bridge the gap from efficient specialised players to high performance rational agents.Read moreRead less
Mining multi-typed and dynamic graphs. Large volumes of data collected nowadays from real-world applications are often represented as graphs. The nodes and the edges of such graphs represent different types of entities and interactions, and they have time information. This project will develop algorithms that mine efficiently such multi-typed and dynamic graphs.
Discovery Early Career Researcher Award - Grant ID: DE120101761
Funder
Australian Research Council
Funding Amount
$375,000.00
Summary
Solving intractable problems: from practice to theory and back. By analysing how theoretically intractable problems are solved in practice by highly optimised software solvers, this project aims at a better theoretical understanding of these problems. The gained mathematical insights will then be used to stimulate the development of new and improved software solvers.
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.
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
Local reoptimization for turbocharging heuristics. Theoretical computer science has up until now had little impact on the design of effective heuristics. While data sets may be large, significant structure is almost always present and important to take into account when designing algorithms. Parameterised complexity considers the underlying structure by parameterising not only on the size of the input but also on structural parameters. This project aims to take advantage of the many opportunitie ....Local reoptimization for turbocharging heuristics. Theoretical computer science has up until now had little impact on the design of effective heuristics. While data sets may be large, significant structure is almost always present and important to take into account when designing algorithms. Parameterised complexity considers the underlying structure by parameterising not only on the size of the input but also on structural parameters. This project aims to take advantage of the many opportunities for new theories in the design of new heuristics and in turbocharging existing heuristics for computationally hard problems.Read moreRead less
Algorithmic and computational advances in geometric group theory. This project aims to combine new algorithmic ideas, high performance computing and experimental mathematics to answer many outstanding questions in the field of geometric group theory. This project will put Australia at the forefront of new computer-assisted research, and give new insights into complex mathematical problems.