CARMA-Sponsored Events: Colloquia, Seminars, Workshops, Conferences and More.

Last updated Friday, 17 Aug, 2012

Details of upcoming events are listed on this page.

Upcoming CARMA Events

• CARMA OANT SEMINAR
• Speaker: Mr Matt Skerritt, School of Mathematical and Physical Sciences, The University of Newcastle
• Title: Computation of an Improved Lower Bound to Giuga’s Primality Conjecture
• Location: V205, Mathematics Building (Callaghan), The University of Newcastle
• Access Grid Venue: CARMA [ENQUIRIES]
• Time and Date: 3:30 pm, Mon, 27th May 2013
• Abstract:
  
  Our most recent computations tell us that any counterexample to Giuga’s 1950 primality conjecture must have at least 19,907 digits. Equivalently, any number which is both a Giuga and a Carmichael number must have at least 19,907 digits. This bound has not been achieved through exhaustive testing of all numbers with up to 19,907 digits, but rather through exploitation of the properties of Giuga and Carmichael numbers. We introduce the conjecture and an algorithm for finding lower bounds to a counterexample, then present our recent results and discuss challenges to further computation.
• [Permanent link]

• AMSI ACCESS GRID SEMINAR
• Speaker: Prof Martin Savelsbergh, School of Mathematical and Physical Sciences, The University of Newcastle
• Title: Incremental Network Design
• Location: V206, Mathematics Building (Callaghan), The University of Newcastle
• Access Grid Venue: UNewcastle [ENQUIRIES]
• Time and Date: 2:30 pm, Tue, 28th May 2013
• Abstract:
  
  Network infrastructures are a common phenomenon. Network upgrades and expansions typically occur over time due to budget constraints. We introduce a class of incremental network design problems that allow investigation of many of the key issues related to the choice and timing of infrastructure expansions and their impact on the costs of the activities performed on that infrastructure. We examine three variants: incremental network design with shortest paths, incremental network design with maximum flows, and incremental design with minimum spanning trees. We investigate their computational complexity, we analyse the performance of natural heuristics, we derive approximation algorithms and we study integer program formulations.
• [Permanent link]

• CARMA OANT SEMINAR
• Speaker: Dr Liangjin Yao, CARMA, The University of Newcastle
• Title: TBA
• Location: V205, Mathematics Building (Callaghan), The University of Newcastle
• Access Grid Venue: CARMA [ENQUIRIES]
• Time and Date: 3:30 pm, Mon, 3rd Jun 2013
• Abstract:
  
  TBA
• [Permanent link]

• CSSE AND CARMA SEMINAR
• Speaker: Prof Peter Eades, University of Sydney
• Title: How to Draw a Graph, Revisited
• Location: ES309, Engineering S Building (Callaghan), The University of Newcastle
• Time and Date: 12:00 pm, Tue, 4th Jun 2013
• Abstract:
  

  W. T. Tutte published a paper in 1963 entitled "How to Draw a Graph". Tutte's motivation was mathematical, and his paper can be seen as a contribution to the long tradition of geometric representations of combinatorial objects.

  Over the following 40-odd years, the motivation for creating visual representations of graphs has changed from mathematical curiosity to visual analytics. Current demand for graph drawing methods is now high, because of the potential for more human-comprehensible visual forms in industries as diverse as biotechnology, homeland security and sensor networks. Many new methods have been proposed, tested, implemented, and found their way into commercial tools. This paper describes two strands of this history: the force directed approach, and the planarity approach. Both approaches originate in Tutte's paper.

  Further, we demonstrate number of methods for graph visualization that can be derived from the weighted version of Tutte's method. These include results on clustered planar graphs, edge-disjoint paths, an animation method, interactions such as adding/deleting vertices/edges and a focus-plus-context view method.

• [Permanent link]

• EXTERNAL EVENT
• International Symposium on Electronic Art
• Location:
• Dates: Fri, 7th Jun 2013 - Sun, 16th Jun 2013
• http://www.isea2013.org/conference
  Proposals Due (300-word abstract)
  Friday, 14th November 2012
  
• [Permanent link]

• CARMA OANT SEMINAR
• Speaker: Assoc Prof Brailey Sims, CARMA, The University of Newcastle
• Title: TBA
• Location: V205, Mathematics Building (Callaghan), The University of Newcastle
• Access Grid Venue: CARMA [ENQUIRIES]
• Time and Date: 3:30 pm, Mon, 10th Jun 2013
• Abstract:
  
  TBA
• [Permanent link]

• EXTERNAL EVENT
• ICCC 2013: 4th International Conference on Computational Creativity
• Location:
• Dates: Wed, 12th Jun 2013 - Fri, 14th Jun 2013
• http://www.computationalcreativity.net/iccc2013/
  Submissions are due January 31, 2013
  Authors will be notified March 30, 2013
  Final, camera-ready revision are due April 18, 2013
  Local Organising Committee
  Kazjon Grace, University of Sydney, Australia
  Roger Dean, University of Western Sydney, Australia
  
• [Permanent link]

• EXTERNAL EVENT
• ACM Creativity and Cognition 2013
• Location:
• Dates: Mon, 17th Jun 2013 - Thu, 20th Jun 2013
• http://cc13.creativityandcognition.com
  17th December 2012 – PAPER AND POSTER SUBMISSION DEADLINE
  Jan 12th - WORKSHOP PROPOSAL SUBMISSION DEADLINE
  1st March 2013 – CREATIVITY & DEMONSTRATIONS SUBMISSION DEADLINE
• [Permanent link]

• CARMA OANT SEMINAR
• Speaker: Prof Jörg Fliege, CORMSIS, University of Southampton
• Title: TBA
• Location: V205, Mathematics Building (Callaghan), The University of Newcastle
• Access Grid Venue: UniSA
• Time and Date: 3:30 pm, Mon, 17th Jun 2013
• Abstract:
  
  TBA
• [Permanent link]

• CARMA OANT SEMINAR
• Speaker: Prof Miguel Ángel Goberna Torrent, Departamento de Estadística e Investigación Operativa, University of Alicante
• Title: Voronoi cells of arbitrary sets
• Location: V205, Mathematics Building (Callaghan), The University of Newcastle
• Access Grid Venue: UniSA
• Time and Date: 3:30 pm, Mon, 24th Jun 2013
• Abstract:
  
  Given a set T of the Euclidean space, whose elements are called sites, and a particular site s, the Voronoi cell of s is the set formed by all points closer to s than to any other site. The Voronoi diagram of T is the family of Voronoi cells of all the elements of T. In this talk we show some applications of the Voronoi diagrams of finite and infinite sets and analyze direct and inverse problems concerning the cells. We also discuss the stability of the cells under different types of perturbations and the effect of assigning weights to the sites.
• [Permanent link]

• MATHEMATICS OF PLANET EARTH
• MPE Australia 2013
• Location: RMIT University
• Dates: Mon, 8th Jul 2013 - Fri, 12th Jul 2013
• This conference is the central scientific event of MPE Australia 2013, bringing together the scientific community to address the mathematical contribution to the challenges of the planet and creating a platform to launch new scientific collaborations.

• Complex (and Dynamical) Systems
  A Data-Based View of Our World
  Population censuses and the human face of Australia
  Scientific Data Mining
  Earth System Modeling
  Mitigating Natural Disaster Risk
  Sustainability – Environmental modelling
  BioInvasion and BioSecurity
  Realising Our Subsurface Potential
  

  Abstract submission closes 31st May, 2013.

  For more information, visit the conference website.

• [Permanent link]