Sparse grid approximations and fitting using generalised combination techniques. Sparse grid techniques provide an effective tool to deal with the
computational curse of dimensionality which is a constant challenge in
modelling complex data. The proposed research is aimed at the
development and analysis of algorithms for data fitting with sparse
grids using variants of the combination technique. The outcome of the
research is a theory which will provide insights in the applicability,
limit ....Sparse grid approximations and fitting using generalised combination techniques. Sparse grid techniques provide an effective tool to deal with the
computational curse of dimensionality which is a constant challenge in
modelling complex data. The proposed research is aimed at the
development and analysis of algorithms for data fitting with sparse
grids using variants of the combination technique. The outcome of the
research is a theory which will provide insights in the applicability,
limitations and the convergence properties of the proposed
algorithms. The outcomes will be widely applicable in modelling of
large scale and complex data as is encountered in areas of
bioinformatics, physics and experimental studies of complex systems.
Read moreRead less
Defence Against Phishing Attacks. Australian businesses and citizens are losing millions of dollars in cybercrimes every year. Rural and regional businesses depend on the integrity of their Internet banking service, and yet, cybercriminals are working hard to defraud these users. This project aims to build a reliable defence against phishing attacks which rely on social engineering to steal online identities, using intelligence gathered from the brazen trade of credentials in the public domain.
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
Fast, practical and effective algorithms for clustering with advice. To maintain a safe and healthy society, government and industry need high quality immunization and national security databases. Since we cannot afford to have duplicate, incomplete and conflicting records that refer to the same person, we unify them by identifying clusters of related records.
In the emerging field of functional genomics, diagnosis of certain diseases is enhanced by determining which genes act together. Diffe ....Fast, practical and effective algorithms for clustering with advice. To maintain a safe and healthy society, government and industry need high quality immunization and national security databases. Since we cannot afford to have duplicate, incomplete and conflicting records that refer to the same person, we unify them by identifying clusters of related records.
In the emerging field of functional genomics, diagnosis of certain diseases is enhanced by determining which genes act together. Different experimental runs might result in different clusterings of genes: we need one consensus clustering that summarizes the experimental outcomes.
Cleaning databases and combining clusterings by hand would require vast amounts of time. This project will result in faster and more accurate computational procedures.Read moreRead less
Approximate proximity for applications in data mining and visualization. Data Mining, pattern recognition and visualization of relational information are all important data analysis techniques in which it is essential to determine which data points are in the vicinity of others. The huge size of the data sets involved and the need for real-time interaction preclude the use of conventional methods for the precise computation of the proximity information required. This project will develop efficie ....Approximate proximity for applications in data mining and visualization. Data Mining, pattern recognition and visualization of relational information are all important data analysis techniques in which it is essential to determine which data points are in the vicinity of others. The huge size of the data sets involved and the need for real-time interaction preclude the use of conventional methods for the precise computation of the proximity information required. This project will develop efficient algorithms and data structures for gathering high-quality approximations of the full proximity information, and will use these innovations as the basis for new, practical tools for visualization, and clustering in data mining.Read moreRead less
Investigation and Development of Parallel Large Scale Record Linkage Techniques. Record linkage aims at matching records of the same entity (like customer or patient) in large (administrative) databases. The outcomes of the proposed research will improve current techniques in terms of efficiency, accuracy and the need for human intervention. Through experimental studies and stochastic modelling the performance of traditional and new methods for data cleaning, standardisation and linkage will be ....Investigation and Development of Parallel Large Scale Record Linkage Techniques. Record linkage aims at matching records of the same entity (like customer or patient) in large (administrative) databases. The outcomes of the proposed research will improve current techniques in terms of efficiency, accuracy and the need for human intervention. Through experimental studies and stochastic modelling the performance of traditional and new methods for data cleaning, standardisation and linkage will be assessed. The effect of the statistical dependency of attribute values will be studied. New methods using clustering for blocking large datasets, and predictive models including interaction terms will be implemented, analysed and evaluated on high-performance computers and office-based PC clusters.
Read moreRead less
Efficient Algorithms for In-memory Sorting, Searching and Indexing on Modern Multi-core Cache-based and Graphics Processor Architectures. This project clearly belongs to one of the national research priority
goals, Smart Information Use. The copy-based techniques and work on sorting and searching will considerably impact the development of in-memory algorithms in cutting-edge computer architectures. Efficient suffix trees and suffix sorting have myriad applications in string-processing and will ....Efficient Algorithms for In-memory Sorting, Searching and Indexing on Modern Multi-core Cache-based and Graphics Processor Architectures. This project clearly belongs to one of the national research priority
goals, Smart Information Use. The copy-based techniques and work on sorting and searching will considerably impact the development of in-memory algorithms in cutting-edge computer architectures. Efficient suffix trees and suffix sorting have myriad applications in string-processing and will be of high interest to bioinformatics companies. The sortdex project will develop novel algorithms that will be used by enterprise search engine companies to develop applications for libraries and organisations dealing with large databases. Algorithms using the graphics processor as a co-processor have important applications in the high-growth field of computer graphics and games. Read moreRead less
Analyzing Uncertain Data: Probabilistic Approaches. The expected research outcome includes siginificantly technical contributions to the uncertain data analysis technology development by supporting probablistic query procesing. The proposed systematic, algorithm and database centric approach to investigate the novel, ubiquitous problems will lead to a greater support, from the database community, to the advanced real applications, and creating new opportunities for the IT industry. The success o ....Analyzing Uncertain Data: Probabilistic Approaches. The expected research outcome includes siginificantly technical contributions to the uncertain data analysis technology development by supporting probablistic query procesing. The proposed systematic, algorithm and database centric approach to investigate the novel, ubiquitous problems will lead to a greater support, from the database community, to the advanced real applications, and creating new opportunities for the IT industry. The success of this project will not only further enhance us as an internationally leading research group in uncertain data analysis and provide training for high quality personnel in this important and growing area but also bring considerable economic and social benefits to 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