Security Applications of Combinatorial Puzzles. This project provides a basis for improving the implementation and maintenance of key management systems. The application of discrete mathematics to information security will help safeguard Australia, will provide opportunities for Australians to take a leading role in an important area and will develop a research network, bridging both theoretical and practical aspects of mathematics and computer science. The project will enhance Australia's inter ....Security Applications of Combinatorial Puzzles. This project provides a basis for improving the implementation and maintenance of key management systems. The application of discrete mathematics to information security will help safeguard Australia, will provide opportunities for Australians to take a leading role in an important area and will develop a research network, bridging both theoretical and practical aspects of mathematics and computer science. The project will enhance Australia's international reputation by establishing collaborations with well-respected international mathematicians and computer scientists. The proposal contains topics suitable for the training of new graduates, allowing them to make high quality original research contributions in a novel and important area. Read moreRead less
The fundamental structure of combinatorial configurations. Combinatorial configurations are fundamental mathematical tools used to model physical problems in the information sciences. Combinatorial trades arise from the differences between combinatorial configurations. They uniquely determine the underlying structure of the configuration and are central to the determination of defining sets. With this proposal we shall study the existence, properties and applications of combinatorial trades and ....The fundamental structure of combinatorial configurations. Combinatorial configurations are fundamental mathematical tools used to model physical problems in the information sciences. Combinatorial trades arise from the differences between combinatorial configurations. They uniquely determine the underlying structure of the configuration and are central to the determination of defining sets. With this proposal we shall study the existence, properties and applications of combinatorial trades and the associated defining sets. Our results will have applications in the areas of biotechnology, information systems, information security and experimental design.Read moreRead less
Cycle decompositions of graphs. The benefits to Australia of fundamental research in core disciplines such as mathematics are well documented. This project aims to solve long-standing and significant open problems in the field of mathematics known as graph theory. Solving such problems will undoubtedly bring Australian research in this field to the fore, and help to enhance Australia's international research profile generally. The project offers substantial postgraduate training in the form of t ....Cycle decompositions of graphs. The benefits to Australia of fundamental research in core disciplines such as mathematics are well documented. This project aims to solve long-standing and significant open problems in the field of mathematics known as graph theory. Solving such problems will undoubtedly bring Australian research in this field to the fore, and help to enhance Australia's international research profile generally. The project offers substantial postgraduate training in the form of three excellent PhD projects in discrete mathematics. The computer age has ensured that this is a booming discipline and an increasing component of undergraduate syllabi around the world. It is thus a crucial area in which to be providing quality research training.Read moreRead less
Efficient Pre-Processing of Hard Problems: New Approaches, Basic Theory and Applications. Computers store even larger amounts of data about all aspects of human and industrial activity. However, they have not become significantly better at solving common problems in optimization and search. Traditional complexity theory indicates many of these problems require algorithms that are very unlikely to exist. The Parameterized Complexity approach allows us to obtain very efficient algorithms for a lar ....Efficient Pre-Processing of Hard Problems: New Approaches, Basic Theory and Applications. Computers store even larger amounts of data about all aspects of human and industrial activity. However, they have not become significantly better at solving common problems in optimization and search. Traditional complexity theory indicates many of these problems require algorithms that are very unlikely to exist. The Parameterized Complexity approach allows us to obtain very efficient algorithms for a large variety of problems, but the machinery required was diverse and complicated. This research will organize the machinery into a new approach that systematically finds good algorithms by applying simplifications around a parameter of the domain of the problem. As a result, efficient algorithms are obtained for many diverse areas.Read moreRead less
Emerging applications of advanced computational methods and discrete mathematics. Ongoing improvements in computer performance are revolutionising research in combinatorial discrete mathematics, and leading to exciting new applications in information technology and the biological and chemical sciences. As a result, substantial international research effort, both at universities and in commercial and industrial organisations, is being channelled into high-performance computation and theoretical p ....Emerging applications of advanced computational methods and discrete mathematics. Ongoing improvements in computer performance are revolutionising research in combinatorial discrete mathematics, and leading to exciting new applications in information technology and the biological and chemical sciences. As a result, substantial international research effort, both at universities and in commercial and industrial organisations, is being channelled into high-performance computation and theoretical problems in combinatorial mathematics. Our aim is to develop and apply advanced computational methods through the study of several unsolved theoretical problems in design theory and practical problems in exact matrix computation and drug design.Read moreRead less
Timed Commitment Schemes to Smooth Internet Bottlenecks, Defend against Denial of Service Attacks, and Bypass Some Legal Problems of Enccryption. Bottlenecks on the Internet and Denial of Service attacks on a server are both caused by excessive demands made on a system. This proposal is to reduce the ill-effects of either by building on our previous theoretical work on strongboxes of combinatorial designs. In the case of bottlenecks, the demands are legitimate but badly timed, and our approach ....Timed Commitment Schemes to Smooth Internet Bottlenecks, Defend against Denial of Service Attacks, and Bypass Some Legal Problems of Enccryption. Bottlenecks on the Internet and Denial of Service attacks on a server are both caused by excessive demands made on a system. This proposal is to reduce the ill-effects of either by building on our previous theoretical work on strongboxes of combinatorial designs. In the case of bottlenecks, the demands are legitimate but badly timed, and our approach will redistribute the demands more evenly. In the case of Denial of Service attacks, the demands are malicious, and our approach will respond in such a way as to deplete the resources of the attacker.Read moreRead less