Constrained and Stable Solutions of Nonlinear and Semismooth Equations. In this project, comprehensive models for designing safe power system parameters will be proposed, efficient algorthms for solving these models will be constructed. The new models and algorithms in this project will provide efficient tools to prevent catastrophic events in power systems, which is related with national security. This project will also strengthen collaboration of Australian applied
mathematians with inter ....Constrained and Stable Solutions of Nonlinear and Semismooth Equations. In this project, comprehensive models for designing safe power system parameters will be proposed, efficient algorthms for solving these models will be constructed. The new models and algorithms in this project will provide efficient tools to prevent catastrophic events in power systems, which is related with national security. This project will also strengthen collaboration of Australian applied
mathematians with international researchers and engineering scientists. This is important for the advance of science and technology in
Australia.Read moreRead less
Algebraic Methods in Design and Analysis of Stream Ciphers. The project investigates the problem of communication security in the mobile environment where both confidentiality and authenticity are of prime concern. Stream ciphers are a very natural choice in mobile environment as they provide an efficient cryptographic protection using a limited computing resources. We model stream cipher as a system of multivariate equations. In this approach, security of stream ciphers can be measured as the c ....Algebraic Methods in Design and Analysis of Stream Ciphers. The project investigates the problem of communication security in the mobile environment where both confidentiality and authenticity are of prime concern. Stream ciphers are a very natural choice in mobile environment as they provide an efficient cryptographic protection using a limited computing resources. We model stream cipher as a system of multivariate equations. In this approach, security of stream ciphers can be measured as the complexity of an algorithm that solves the appropriate system of equations. This project leads to new techniques for the design and analysis of stream ciphers.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
Approximation, Cubature and Point Designs on Spheres. The sphere is important in fields ranging from geophysics to global climate modelling to chemistry to codes for modern communications. This project aims to strengthen and unify key areas of mathematics on the sphere and at the same time provide methods and constructiions of practical significance. The areas of focus are constructive approximation of functions on the sphere, numerical integration on the sphere, and well distributed sets of poi ....Approximation, Cubature and Point Designs on Spheres. The sphere is important in fields ranging from geophysics to global climate modelling to chemistry to codes for modern communications. This project aims to strengthen and unify key areas of mathematics on the sphere and at the same time provide methods and constructiions of practical significance. The areas of focus are constructive approximation of functions on the sphere, numerical integration on the sphere, and well distributed sets of points on the sphere, including spherical designs.Read moreRead less
Nonsmooth Optimization in Constrained Spline Interpolation. Traditional methods based on standard calculus may not work for optimization problems with constraints; however, such problems can be reformulated as nonsmooth problems that need special treatment. The project aims to approach several important problems in constrained spline interpolation and approximation, from the perspective of nonsmooth optimization. The research, which builds upon a recent breakthrough in the approach to the convex ....Nonsmooth Optimization in Constrained Spline Interpolation. Traditional methods based on standard calculus may not work for optimization problems with constraints; however, such problems can be reformulated as nonsmooth problems that need special treatment. The project aims to approach several important problems in constrained spline interpolation and approximation, from the perspective of nonsmooth optimization. The research, which builds upon a recent breakthrough in the approach to the convex best interpolation by the applicant and his collaborators, is expected to provide fundamental theory for Newton-type methods being used for these problems with a vast number of applications in data fitting and curve and surface design.Read moreRead less
Big temporal graph processing in the Cloud. This project aims to develop efficient and scalable algorithms to process big temporal graphs in the Cloud. In particular, we will investigate three most representative types of queries over big temporal graphs including vertex-based queries, path-based queries, and subgraph-based queries. Expected outcomes of this project include theoretical foundations and scalable algorithms to process big temporal graphs as well as a system prototype for evaluation ....Big temporal graph processing in the Cloud. This project aims to develop efficient and scalable algorithms to process big temporal graphs in the Cloud. In particular, we will investigate three most representative types of queries over big temporal graphs including vertex-based queries, path-based queries, and subgraph-based queries. Expected outcomes of this project include theoretical foundations and scalable algorithms to process big temporal graphs as well as a system prototype for evaluation and to demonstrate the practical value. Success in this project should see significant benefits for many important applications such as cybersecurity, e-commerce, health and road networks.Read moreRead less
Discovery Early Career Researcher Award - Grant ID: DE240100668
Funder
Australian Research Council
Funding Amount
$435,000.00
Summary
Towards Processing of Big Streaming Temporal Graphs. This project aims to develop efficient and scalable algorithms to process big streaming temporal graphs, which is in high demand for many data-intensive applications such as cybersecurity, crime monitoring, and e-marketing. In particular, I will investigate three most representative types of queries including vertex-based queries, path-based queries, and subgraph-based queries. Expected outcomes of this project include theoretical foundations ....Towards Processing of Big Streaming Temporal Graphs. This project aims to develop efficient and scalable algorithms to process big streaming temporal graphs, which is in high demand for many data-intensive applications such as cybersecurity, crime monitoring, and e-marketing. In particular, I will investigate three most representative types of queries including vertex-based queries, path-based queries, and subgraph-based queries. Expected outcomes of this project include theoretical foundations and scalable algorithms to process big streaming temporal graphs as well as a system prototype for evaluation and to demonstrate the practical value. Success in this project should see significant benefits for many important applications such as cybersecurity, e-commerce, health and social analysis.Read moreRead less
Next-Generation Distributed Graph Engine for Big Graphs. This project aims to develop an efficient and scalable distributed graph engine to process big graphs. In particular, we will investigate the foundations for the distributed real-time graph engine, focusing on graph storage and graph operators, and then provide solutions for a set of representative graph mining and query processing tasks. Expected outcomes of this project include theoretical foundations and a scalable real-time graph engin ....Next-Generation Distributed Graph Engine for Big Graphs. This project aims to develop an efficient and scalable distributed graph engine to process big graphs. In particular, we will investigate the foundations for the distributed real-time graph engine, focusing on graph storage and graph operators, and then provide solutions for a set of representative graph mining and query processing tasks. Expected outcomes of this project include theoretical foundations and a scalable real-time graph engine to process big graphs as well as a system prototype for evaluation and to demonstrate the practical value. Success in this project should see significant benefits for many important applications such as cybersecurity, e-commerce, health and road networks.Read moreRead less
Real-time scheduling of trains to control peak electricity demand. This project aims to develop new scheduling and control methods that will enable railways to reduce their demand for electricity during peak demand periods, without undue disruption to the timetable.
These new methods and systems will integrate with—and expand the capabilities of—an Australian train control system that is used by railways around the world. This will enable better management of electricity within a region and be ....Real-time scheduling of trains to control peak electricity demand. This project aims to develop new scheduling and control methods that will enable railways to reduce their demand for electricity during peak demand periods, without undue disruption to the timetable.
These new methods and systems will integrate with—and expand the capabilities of—an Australian train control system that is used by railways around the world. This will enable better management of electricity within a region and better use of renewable energy sources, with significant cost savings for railways and the wider community.Read moreRead less