Compilation Techniques for Embedded Systems. Highly optimising compiler tools are becoming an important part of the software development process for embedded systems. This project will provide Australia with core technology in the area of tools for embedded systems. It will allow safer embedded systems in mission-critical applications. In addition, the Australian Industry will benefit from a substantially growing embedded systems market where tools are a pre-requisite for a cost-aware and safe s ....Compilation Techniques for Embedded Systems. Highly optimising compiler tools are becoming an important part of the software development process for embedded systems. This project will provide Australia with core technology in the area of tools for embedded systems. It will allow safer embedded systems in mission-critical applications. In addition, the Australian Industry will benefit from a substantially growing embedded systems market where tools are a pre-requisite for a cost-aware and safe software development. The industry interested in embedded system tools are: Telecom/Datacom, Consumer Electronics, Industrial Automation, Retail Automation, Office Automation, Military/Aerospace, Automotive, Information Automation, Medical Devices.Read moreRead less
Multivariate Algorithmics: Meeting the Challenge of Real World computational complexity. This Project will result in better methods for designing the algorithms that all computer applications depend on. Algorithms are the instruction sets that tell computers how to process information. Some information processing tasks are intrinsically difficult, even for computers working at enormous speeds. This Project will deliver new mathematical approaches to overcome these difficulties. More efficient al ....Multivariate Algorithmics: Meeting the Challenge of Real World computational complexity. This Project will result in better methods for designing the algorithms that all computer applications depend on. Algorithms are the instruction sets that tell computers how to process information. Some information processing tasks are intrinsically difficult, even for computers working at enormous speeds. This Project will deliver new mathematical approaches to overcome these difficulties. More efficient algorithmic approaches for difficult problems enable advances in all areas of computer applications such as medical diagnosis and health prediction, national security, communications efficiency, industrial productivity and all fields of science and engineering.Read moreRead less
Algebraic Models of Stream Ciphers. The project investigates communication security in the mobile environment where both confidentiality and authenticity are of a prime concern. Stream ciphers are a natural choice in mobile environments as they provide an efficient cryptographic protection using a limited computing resources. We treat stream ciphers as algebraic objects whose properties fully determine their cryptographic strength. We first analyse existing stream ciphers showing their algebraic ....Algebraic Models of Stream Ciphers. The project investigates communication security in the mobile environment where both confidentiality and authenticity are of a prime concern. Stream ciphers are a natural choice in mobile environments as they provide an efficient cryptographic protection using a limited computing resources. We treat stream ciphers as algebraic objects whose properties fully determine their cryptographic strength. We first analyse existing stream ciphers showing their algebraic properties and later we derive a design methodology for provably secure stream ciphers. The project leads to new secure and efficient designs for stream ciphers that are the preferred cryptographic tools used in Australian industry.Read moreRead less
Algebraic Analysis of Cryptosystems. This project studies an (new) algebraic approach to cryptanalysis of modern block ciphers. The approach works for all cryptosystems that use either small S-boxes, or their algebraic structure can be described by a system of overdefined quadratic equations. The cryptosystems that are potentially breakable using this approach are Rijndael and Serpent - the two top finalists of the Advanced Encryption Standard contest. The project also explores how this approach ....Algebraic Analysis of Cryptosystems. This project studies an (new) algebraic approach to cryptanalysis of modern block ciphers. The approach works for all cryptosystems that use either small S-boxes, or their algebraic structure can be described by a system of overdefined quadratic equations. The cryptosystems that are potentially breakable using this approach are Rijndael and Serpent - the two top finalists of the Advanced Encryption Standard contest. The project also explores how this approach can be applied to design new and more powerful factoring algorithms. The project has an explosive potential to redefine the theory and practice of modern cryptography.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
Algorithmics for Extremely Mobile Wireless Networks. Existing wireless network protocols need stringent conditions to be effective. These conditions are rarely met for concrete applications such as Defence, Disaster-Relief, Search-and-Rescue. All these cannot rely on existing infrastructure, and often require high mobility. This is crucial in the case of Australia which cannot rely on complete network coverage of its lands and seas. This project will develop new wireless protocols for applicati ....Algorithmics for Extremely Mobile Wireless Networks. Existing wireless network protocols need stringent conditions to be effective. These conditions are rarely met for concrete applications such as Defence, Disaster-Relief, Search-and-Rescue. All these cannot rely on existing infrastructure, and often require high mobility. This is crucial in the case of Australia which cannot rely on complete network coverage of its lands and seas. This project will develop new wireless protocols for applications requiring extreme mobility. It will increase Australia's control of this, now ubiquitous, technology thus rendering Australia a key player in this field.Read moreRead less
High dimensional problems of integration and approximation. In many applications, notably financial mathematics, problems of
integration and approximation of functions in very high dimensions
are of great interest. By finding modern mathematical solutions to
these problems, we will therefore contribute to Australia's future
success in developing innovative technologies for industrial and
economic applications. By researching at an internationally
competitive level and by cooperating with i ....High dimensional problems of integration and approximation. In many applications, notably financial mathematics, problems of
integration and approximation of functions in very high dimensions
are of great interest. By finding modern mathematical solutions to
these problems, we will therefore contribute to Australia's future
success in developing innovative technologies for industrial and
economic applications. By researching at an internationally
competitive level and by cooperating with international experts, we
will have a share in further strengthening the excellent role of
Australian research institutions within the international scientific
community in mathematics and scientific computing.Read moreRead less
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.
Trisections, triangulations and the complexity of manifolds. This project aims at practical representations of 3-dimensional and 4-dimensional spaces as needed in applications. Topology is the mathematical study of the shapes of spaces. Geometry endows spaces with additional structure such as distance, angle and curvature. Special combinatorial structures, such as minimal triangulations, are often closely connected to geometric structures or topological properties. This project aims to construct ....Trisections, triangulations and the complexity of manifolds. This project aims at practical representations of 3-dimensional and 4-dimensional spaces as needed in applications. Topology is the mathematical study of the shapes of spaces. Geometry endows spaces with additional structure such as distance, angle and curvature. Special combinatorial structures, such as minimal triangulations, are often closely connected to geometric structures or topological properties. This project aims to construct computable invariants, connectivity results for triangulations, and algorithms to recognise fundamental topological properties and structures such as trisections and bundles.Read moreRead less
Parameterized Algorithm Design and Complexity Analysis: New Methods and Strategic Applications in the FPT Algorithmic Server Project. A fundamental discovery of the first decades of computer science is that completely efficient (polynomial time) algorithms probably do not exist for thousands of natural computational problems. The project will result in new methods for designing and analyzing algorithms for hard problems with natural parameters, and in improved
algorithms for these problems.