130 likes | 221 Views
Research Information Session. Associate Professor John Thornton Gold Coast BIT Honours Degree Convenor and Research Higher Degree Convenor J.Thornton@griffith.edu.au. Research with Dr John. Gold Coast Honours Convenor Associate Director IIIS for Gold Coast
E N D
Research Information Session Associate Professor John Thornton Gold Coast BIT Honours Degree Convenor and Research Higher Degree Convenor J.Thornton@griffith.edu.au
Research with Dr John • Gold Coast Honours Convenor • Associate Director IIIS for Gold Coast • RHD Coordinator IIIS and ICT Gold Coast • NICTA researcher • Leader of Constraint Satisfaction and Hierarchical Temporal Memory research groups • 8 PhD completions • 1 MPhil, 2 Masters, 5 Honours completions John Thornton
What are Constraints? A constraint is a relationship over object(s) in the world. What is allowed? What is not allowed? Knowledge about broad range of real world domains can be easily expressed in terms of constraints John Thornton
Constraint Programming “Constraint programming represents one of the closest approaches computer science has yet made to the Holy Grail of programming: the user states the problem, the computer solves it.” Eugene Freuder. John Thornton
Constraint Satisfaction • Given: • A set of variables • A set of permitted values for each variable • A set of constraints on subsets of variables Find: an assignment of values to variables such that all the constraints are satisfied. John Thornton
General Techniques • Problems are often NP-complete • Over-constrained • Two classes of technique: • Backtracking • Local search John Thornton
Eight Queen Problem Domain Variable Constraint John Thornton
Place 8 Queens randomly on the board 3 2 2 1 1 1 3 3 0 1 2 2 3 4 3 1 2 2 2 2 2 3 1 1 2 Answer Found Pick a Queen: Calculate cost of each move Take least cost move then try another Queen 1 2 1 2 1 3 2 3 1 4 1 5 1 0 1 1 1 3 1 4 1 0 1 4 1 4 1 4 1 2 3 1 1 1 3 1 4 3 2 1 3 3 1 4 2 2 2 1 3 2 2 2 2 2 3 2 2 2 3 1 2 4 3 1 3 1 1 2 2 2 1 1 2 1 2 3 3 2 3 0 2 2 3 3 3 3 3 3 4 1 Local Search John Thornton
Selected Results • Building Structure into Local Search for SAT • IJCAI’07 Distinguished Paper Award • Winner of SAT Competition Gold Medals • gNovelty+ (2007 & 2009), R+AdaptNovelty+ (2005) • Temporal Reasoning • Local Search (JLC), New SAT encoding (CP’06 & AIJ 2008) • Hybrid Search • Resolution + SLS (AAAI’05) • Evolving Algorithms for CSPs • Genetic programming (CEC’04, PRICAI’04) John Thornton
Practical Problems • NICTA ATOMIC Project • Building the local search component of the G12 constraint solving platform • NICTA Vehicle Routing Project • Logistic planning of vehicles, crews, deliveries and pick-ups • Jeppesen (Boeing) • Local search for postal delivery problem • SAT Competiton • Parameter free search, portfolio algorithms, exploiting structure • Glycomics and Eskitis • Protein folding for malaria research • Identifying pathways in Parkinson’s disease John Thornton
Machine Learning • Hierarchical Temporal Memory • Using insights from computational neuroscience to build more robust and flexible pattern recognition machines • Exploiting temporal connections between inputs (temporal pooling) • Combining recognition with prediction John Thornton
The Teams • CSP/SAT: • NICTA QRL: Abdul Sattar, Duc Nghia Pham, Hakim Newton • Jeppesen: Valnir Ferreira Jr. • NICTA Sydney/Canberra: Michael Maher, Andrew Verden, Phil Kilby • IIIS HTM:Michael Blumenstein, Trevor Hine, Jolon Faichney John Thornton
Thank You Questions? (also see www.cit.gu.edu/~johnt/) John Thornton