Research-Intensive Open-Source Projects at Australia's Leading University
Showing 5 of 6 projects. Click any project card for scope, mentors, and proposal studio.
Mentors: Student: Mathu
<p>Current implementation of PPSPM Software (<a href="http://dmm.anu.edu.au/PPSPM/" target="_blank">http://dmm.anu.edu.au/PPSPM/</a>) handles similar patient matching (SPM) based on Bloom filter based masking and matching techniques of numerical attributes (such as age, blood pressure, BMI, and date of birth), categorical attributes (such as gender and marital status) and string attributes (such as names and addresses) (Vatsalan et al. 2016). Aim of this R&D project is to extend the functionality of PPSPM software to increase the accuracy and probability of Similar Patient Matching by identifying and incorporating advanced techniques (while preserving privacy) to include other complex patient medical data (such as scan image, textual data, medical reports, and geographical data) in record linkage.</p>
Mentors: Student: Ezequiel Postan
<p>Skeptik [1] is a collection of data structures and algorithms focused especially on the compression of formal proofs.</p> <p>Resolution proofs, in particular, are used by various sat-solvers, smt-solvers and automated theorem provers, as certificates of correctness for the answers they provide. These automated deduction tools have a wide range of application areas, from mathematics to software and hardware verification.</p> <p>By providing smaller resolution proofs that are easier and faster to check, Skeptik aims at improving the reliability of these automated deduction tools and at facilitating the exchange of information between them.</p> <p>This project aims to implement full TPTP-TSTP parsers [2] and a random generator of first order logic proofs to test a diverse variety of algorithms.</p> <p>Regarding proof compression, this project aims to lift the ideas behind splitting proof compression algorithm [3] (developed for propositional logic) to first order logic and to explore improvements for similar algorithms already implemented in Skeptik.</p> <p>References<br> [1] github.com/Paradoxika/Skeptik<br> [2] www.cs.miami.edu/~tptp/<br> [3] en.wikipedia.org/wiki/Resolution_proof_compression_by_splitting</p>
Mentors: Student: Yan Xiao
<p>Developing a visualization tool that can visualize graphs dynamically, and designing dynamic analysis strategies that can provide a flexible and efficient way for conducting various network analysis tasks dynamically</p>
Mentors: Student: itegulov
<p>Skeptik[1] is a tool focused on compression of proofs, but it's also possible to generate proofs using it's infrastructure.</p> <p>There is a new algorithm developed by ANU employees, called Conflict Resolution algorithm[2], which has no implementation yet and can generate proofs in first-order logic.</p> <p>Conflict Resolution algorithm extends wellknown SAT solver DPLL[3] and CDCL[4] algorithm and tries to generalize it’s ideas for first-order logic. In CR we negate instances (substitutions) of decision literals (unlike CDCL where we negate decision literals), but main idea is the same: we decide to assign truthness to some atom and then try to propagate and achieve truthness of some other atoms. Eventually, we will reach a conflict or satisfactions and generate some conflict clauses if reached conflict.</p> <ul> <li>[1] <a href="https://github.com/Paradoxika/Skeptik" target="_blank">https://github.com/Paradoxika/Skeptik</a></li> <li>[2] <a href="http://arxiv.org/pdf/1602.04568v1.pdf" target="_blank">http://arxiv.org/pdf/1602.04568v1.pdf</a></li> <li>[3] <a href="https://en.wikipedia.org/wiki/DPLL_algorithm" target="_blank">https://en.wikipedia.org/wiki/DPLL_algorithm</a></li> <li>[4] <a href="https://en.wikipedia.org/wiki/Conflict-Driven_Clause_Learning" target="_blank">https://en.wikipedia.org/wiki/Conflict-Driven_Clause_Learning</a></li> </ul>
Mentors: Student: JPenington
<p>I will be using investigating the opportunities that Extempore provides in creating a more dynamic workflow for scientists programming simulation and how Extempore can be used to make these simulations more powerful. With the help of some C++ fluid dynamics code, I will be exploring the best ways to use Extempore to create a more effective environment for scientific simulation while doing some real physics. It will show off how extempore can be used to change non-trivial aspects of a simulation at run time.</p>