1 / 19

Honours Information Session

Honours Information Session. John Thornton Gold Coast BIT Honours Degree Convenor J.Thornton@griffith.edu.au. About the Honours Degree. Must have GPA of 5.0 (credit) or better for 2 nd and 3 rd year of Bachelor degree One year full-time – 80CP made up of: 40CP Dissertation

sheilal
Download Presentation

Honours Information Session

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Honours Information Session John Thornton Gold Coast BIT Honours Degree Convenor J.Thornton@griffith.edu.au

  2. About the Honours Degree • Must have GPA of 5.0 (credit) or better for 2nd and 3rd year of Bachelor degree • One year full-time – 80CP made up of: • 40CP Dissertation • 10CP Research Methods in IT + 30CP electives • Up to one 3rd year course • Rest must be honours level • Supervisor may run a special subject • Graded 1st, 2.1, 2.2 or 3rd class John Thornton

  3. Choosing a Research Topic • Honours is about research training • Find a topic that interests you • Find a supervisor you can work with • Consider your future after honours • Entry into a more interesting job? • Research Higher Degree, e.g. PhD? • Career as an academic? • Your choice of topic and supervisor sets the direction of your future life – consider carefully – getting 1st class also matters John Thornton

  4. Financial Support • University values its research students • Your work and publications raise the university’s profile • Various School Scholarships: • Summer Project $2,000 • Honours Scholarship $2,000 • Other sources: • IIIS, NICTA, Supervisor Funds • Tutoring opportunities John Thornton

  5. How To Apply • Closing Date for applications 31st October • For details of how to apply, see: http://www.griffith.edu.au//ua/aa/sta/admission/honours/ • For details of the degree structure, see: http://www17.griffith.edu.au/cis/p_cat/admission.asp?ProgCode=2020&type=overview John Thornton

  6. Research with Dr John • Gold Coast Honours Convenor • Associate Director IIIS for Gold Coast • RHD Coordinator of the School of ICT • NICTA researcher • Leader of Constraint Satisfaction and Hierarchical Temporal Memory research groups • 8 PhD completions • 1 MPhil, 2 Masters, 5 Honours completions John Thornton

  7. 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

  8. 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, Constraints, April, 1997. John Thornton

  9. 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

  10. Example: Graph Colouring • Variables: geometric regions (e.g., all states in India) • Domain: available colours • Constraints: neighbours cannot have the same colour John Thornton

  11. Example: SAT Problem • Variables: propositional variables • Domain: truth values {True, False} • Constraints: Clausal Normal Form (a propositional formula): (x1  x2 x3)  (x2 x3  x4)  (x1  x3  x4) John Thornton

  12. General Techniques • Problems are often NP-complete • Over-constrained • Two classes of technique: • Backtracking • Local search John Thornton

  13. Eight Queens Problem Domain Variable Constraint John Thornton

  14. 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

  15. Selected Results • Building Structure into Local Search for SAT • IJCAI’07 Distinguished Paper Award • Winner of SAT Competition Gold Medals • gNovelty+ (2007), R+AdaptNovelty+ (2005) • Temporal Reasoning • Local Search (JLC), New SAT encoding (CP’06, AIJ) • Hybrid Search • Resolution + SLS (AAAI’05) • Evolving Algorithms for CSPs • Genetic programming (CEC’04, PRICAI’04) John Thornton

  16. Research Challenges • Parameter free clause weighting local search (for SAT competition) • Exploiting structure (dependency lattice) • Local search method for UNSAT problems (IJCAI’97 challenge problem) • Methods for solving problems in non –CNF form (bio-informatics, model checking) • Handling over-constrained problems • Local Search Invariance Engine for NICTA’s ATOMIC project John Thornton

  17. New Research Directions • 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

  18. The Teams IIIS CSP/SAT:Abdul Sattar, Wayne Pullan, Duc Nghia Pham, Stuart Bain, Lingzhong Zhou, Matthew Beaumont, Valnir Ferreira Jr. Abdelraouf Ishtaiwi NICTA CSP/SAT: Michael Maher, Andrew Verden, Mark Wallace, Peter Stuckey IIIS HTM:Michael Blumenstein, Trevor Hine, Jolon Faichney John Thornton

  19. Thank You Questions? (also see www.cit.gu.edu/~johnt/) John Thornton

More Related