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.
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.
Visual analytics for massive multivariate networks. Visual analytics for massive multivariate networks. This project aims to create methods to visually analyse massive multivariate networks. The amount of network data available has exploded in recent years: software systems, social networks and biological systems have millions of nodes and billions of edges with multivariate attributes. Their size and complexity makes these data sets hard to exploit. More efficient ways to understand the data ar ....Visual analytics for massive multivariate networks. Visual analytics for massive multivariate networks. This project aims to create methods to visually analyse massive multivariate networks. The amount of network data available has exploded in recent years: software systems, social networks and biological systems have millions of nodes and billions of edges with multivariate attributes. Their size and complexity makes these data sets hard to exploit. More efficient ways to understand the data are needed. This project will design, implement and evaluate visualisation methods for massive multivariate network data sets. This research is expected to be used by Australian software development, biotechnology and security companies to exploit their data.Read moreRead less
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
New Efficient Cryptographic Tools for Data Privacy and Software Protection. Online services for collaborative communication and software distribution are commonplace today, but their use is hampered by data privacy breaches and intellectual property violations via software reverse engineering. Recent theoretical breakthroughs in cryptography promise to provide new powerful tools for solving these problems, but these tools are not yet suitable for practical use, due to their low efficiency and a ....New Efficient Cryptographic Tools for Data Privacy and Software Protection. Online services for collaborative communication and software distribution are commonplace today, but their use is hampered by data privacy breaches and intellectual property violations via software reverse engineering. Recent theoretical breakthroughs in cryptography promise to provide new powerful tools for solving these problems, but these tools are not yet suitable for practical use, due to their low efficiency and a lack of solid security foundations. This project aims to apply algebraic and probabilistic techniques to improve efficiency of existing tools, and the understanding of their security. Outcomes are expected to include new insights in cryptographic theory, and new practical tools for cyber security.Read moreRead less
Automation of metric temporal reasoning. A major contemporary engineering concern is to ensure the predictable and robust operation of computer systems involving software, hardware, and human users. The need for systematic and careful construction of such systems requires the development of formal methods based on a dense view of time rather than the traditional step-by-step models.
automated strategic reasoning. Formal methods are used to ensure robust correct behaviour in design and implementation of computer systems. Traditional models of computer operation involve a linear sequence of behaviour but today’s systems are complex interactions between many components including the environment of the system and human users. Thus analysis is done via a logical game between components where each is trying to meet its specified requirements regardless of what others do: formalis ....automated strategic reasoning. Formal methods are used to ensure robust correct behaviour in design and implementation of computer systems. Traditional models of computer operation involve a linear sequence of behaviour but today’s systems are complex interactions between many components including the environment of the system and human users. Thus analysis is done via a logical game between components where each is trying to meet its specified requirements regardless of what others do: formalisms include branching time and competing coalitions of agents. This project is to take early advantage of recent breakthroughs in automated logical reasoning with such models by the investigator to deliver general practical techniques of system development and verification.Read moreRead less
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
Discovery Early Career Researcher Award - Grant ID: DE140101628
Funder
Australian Research Council
Funding Amount
$301,970.00
Summary
Non-Intrusive Resource Sharing for Cloud Data Centre Efficiency. Resource sharing using hardware virtualisation has become increasingly common for cloud data centre efficiency. Such virtualisation allows multiple workloads to share a common set of resources in a single physical machine. In practice, however, these co-located workloads often compete for resources, leading to their resource usage being non-isolable and intrusive. This intrusive resource sharing is a major source of cloud data cent ....Non-Intrusive Resource Sharing for Cloud Data Centre Efficiency. Resource sharing using hardware virtualisation has become increasingly common for cloud data centre efficiency. Such virtualisation allows multiple workloads to share a common set of resources in a single physical machine. In practice, however, these co-located workloads often compete for resources, leading to their resource usage being non-isolable and intrusive. This intrusive resource sharing is a major source of cloud data centre inefficiency. This project will develop non-intrusive resource allocation and scheduling solutions that enable co-located workloads to organically use resources. These solutions exploit the heterogeneity and dynamicity of cloud data centres that are often perceived as the main hurdles of resource management.Read moreRead less