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.
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.
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
Innovations in Demographic Modelling for Government Analysis and Planning. This project aims to create innovative and cutting-edge demographic models to better meet the needs of practitioners and researchers. Together with the partner organisations, Commonwealth Treasury and the Australian Bureau of Statistics, it will focus on creating more accurate and fit-for-purpose forecasting methods for Australian fertility, mortality, and migration, including a policy scenario model to produce population ....Innovations in Demographic Modelling for Government Analysis and Planning. This project aims to create innovative and cutting-edge demographic models to better meet the needs of practitioners and researchers. Together with the partner organisations, Commonwealth Treasury and the Australian Bureau of Statistics, it will focus on creating more accurate and fit-for-purpose forecasting methods for Australian fertility, mortality, and migration, including a policy scenario model to produce population projections by visa/citizenship category and Australians overseas. Expected outcomes of this project include improved forecasting methods reported in open-access papers, user-friendly forecasting software and tools for the partner organisations, and a stronger relationship between researchers and practitioners.Read moreRead less
Toward a complete view of life on earth via single cell genomics. Genome sequencing has revolutionised biology, but for most microorganisms this revolution has not arrived because the majority cannot be grown in the laboratory. This project will address this grand challenge by targeted sequencing of single cells from the environment that will fill in many major gaps in the microbial tree of life.
Efficient and effective algorithms for searching strings in secondary storage. Pattern searching is fundamental to a wide range of computing applications, including web search and bioinformatics. In this project we will develop compression algorithms and hybrid memory-disk search structures that allow fast pattern matching on sequences of textual and numeric data, including when approximate search is required.
Discovery Early Career Researcher Award - Grant ID: DE150100240
Funder
Australian Research Council
Funding Amount
$315,000.00
Summary
Geometry and Conditioning in Structured Conic Problems. Conic programming allows one to model and solve large industrial problems via modern optimisation methods, such as interior-point algorithms. These methods are efficient and reliable in solving a vast number of problems, however, they fail on a relatively small but significant set of ill-posed instances, thus affecting the overall reliability of the technique. The reason for such behaviour is profound and constitutes one of the major unsolv ....Geometry and Conditioning in Structured Conic Problems. Conic programming allows one to model and solve large industrial problems via modern optimisation methods, such as interior-point algorithms. These methods are efficient and reliable in solving a vast number of problems, however, they fail on a relatively small but significant set of ill-posed instances, thus affecting the overall reliability of the technique. The reason for such behaviour is profound and constitutes one of the major unsolved problems in real complexity: there is no known algorithm that solves conic problems with real data in polynomial time. The project aims to develop a deep understanding of the geometry of conic problems, aiming for the resolution of this fundamental problem in computational theory.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.
Double auction markets with heterogeneous boundedly rational traders. The project will study limit order markets for the formation of security prices in modern exchanges, allowing heterogeneity and bounded rationality of the economic agents who will engage in various trading strategies. The model developed will be of interest to market participants seeking to design more efficient and transparent markets.
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