BEGIN:VCALENDAR
VERSION:2.0
PRODID:PHP
METHOD:REQUEST
TZID:Australia/Sydney
BEGIN:VTIMEZONE
TZID:Australia/Sydney
X-LIC-LOCATION:Australia/Sydney
BEGIN:DAYLIGHT
TZOFFSETFROM:+1000
TZOFFSETTO:+1100
TZNAME:AEDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+1100
TZOFFSETTO:+1000
TZNAME:AEST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=4;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20190424T160000
DTEND;TZID=Australia/Sydney:20190424T170000
SUMMARY:CARMA Colloquium\n "Calculus of variations and the bending of carbon nanostructures"\n A/Prof Duangkamon Baowan
LOCATION:SR202, SR Building
DESCRIPTION:CARMA Colloquium\nSR202, SR Building\n"Calculus of variations and the bending of carbon nanostructures"\nA/Prof Duangkamon Baowan\n\nAbstract:\nCalculus of variations is utilized to minimize the elastic energy arising from the curvature squared while maximizing the van der Waals energy. Firstly, the shape of folded graphene sheets is investigated, and an arbitrary constant arising by integrating the Euler–Lagrange equation is determined. In this study, the structure is assumed to have a translational symmetry along the fold, so that the problem may be reduced to a two dimensional problem with reflective symmetry across the fold.\n\nSecondly, both variational calculus technique and least squared minimization procedure are employed to determine the joining structure involved a C60 fullerene and a carbon nanotube, namely a nanobud. We find that these two methods are in reasonable overall agreement. However, there is no experimental or simulation data to determine which procedure gives the more realistic results.\n
UID:1108
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20190321T092111
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20190502T160000
DTEND;TZID=Australia/Sydney:20190502T170000
SUMMARY:CARMA Seminar\n "Stabilizing controllers with avoidance properties (for underactuated linear systems)"\n Dr Philipp Braun
LOCATION:SR202, SR Building
DESCRIPTION:CARMA Seminar\nSR202, SR Building\n"Stabilizing controllers with avoidance properties (for underactuated linear systems)"\nDr Philipp Braun\n\nAbstract:\nFor linear and nonlinear dynamical systems, control problems such as feedback stabilization of target sets and feedback laws guaranteeing obstacle avoidance are topics of interest throughout the control literature. While the isolated problems (i.e., guaranteeing only stability or avoidance) are well understood, the combined control problem guaranteeing stability and avoidance simultaneously is leading to significant challenges even in the case of linear systems. In this talk we highlight difficulties in the controller design with conflicting objectives in terms of guaranteed avoidance of bounded sets and asymptotic stability of the origin. In addition, using the framework of hybrid systems, we propose a partial solution to the combined control problem for underactuated linear systems.
UID:1118
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20190410T190723
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20190503T120000
DTEND;TZID=Australia/Sydney:20190303T163000
SUMMARY:Symmetry in Newcastle
LOCATION:W 238, Behavioural Sciences
DESCRIPTION:Symmetry in Newcastle\nW 238, Behavioural Sciences\n
Schedule:
12-1: Heiko Dietrich
1-2: Lunch
2-3: Youming Qiao
3-3.30: Tea
3.30-4.30: Nicole Sutherland
\n\n"Quotient algorithms (a.k.a. how to compute with finitely presented groups)"\nDr Heiko Dietrich\n\nAbstract:\nIn this talk, I will survey some of the famous quotient algorithms that can be used to compute efficiently with finitely presented groups. The last part of the talk will be about joint work with Alexander Hulpke (Colorado State University): we have looked at quotient algorithms for non-solvable groups, and I will report on the findings so far.\n"Isomorphism testing problems: in light of Babai’s graph isomorphism breakthrough"\nDr Youming Qiao\n\nAbstract:\nIn computer science, an isomorphism testing problem asks whether two objects are in the same orbit under a group action. The most famous problem of this type has been the graph isomorphism problem. In late 2015, L. Babai announced a quasipolynomial-time algorithm for the graph isomorphism problem, which is widely regarded as a breakthrough in theoretical computer science. This leads to a natural question, that is, which isomorphism testing problems should naturally draw our attention for further exploration?\n"Computations of Galois groups and splitting fields"\nDr Nicole Sutherland\n\nAbstract:\nThe Galois group of a polynomial is the automorphism group of its \nsplitting field. These automorphisms act by permuting the roots of the \npolynomial so that a Galois group will be a subgroup of a symmetric group. \nUsing the Galois group the splitting field of a polynomial can be computed \nmore efficiently than otherwise, using the knowledge of the symmetries of \nthe roots. I will present an algorithm developed by Fieker and Klueners, \nwhich I have extended, for computing Galois groups of polynomials over \narithmetic fields as well as approaches to computing splitting fields \nusing the symmetries of the roots.
UID:1121
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20190425T203913
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20190509T090000
DTEND;TZID=Australia/Sydney:20190509T100000
SUMMARY:CARMA Workshop "Lie Symmetry Techniques for PDEs"
LOCATION:SR202, SR Building
DESCRIPTION:CARMA Workshop\nSR202, SR Building\nLie Symmetry Techniques for PDEs\n\nLie symmetry methods can be useful for constructing exact solutions to differential equations, and this workshop will show you how to determine the symmetry properties of linear and nonlinear PDEs, and how to exploit these properties to reduce the order of the governing equation. For more information, please visit the workshop web page.
UID:1115
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20190401T161951
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20190509T160000
DTEND;TZID=Australia/Sydney:20190509T170000
SUMMARY:CARMA Colloquium\n "Projection Methods: Convergence and Counterexamples"\n Dr Vera Roshchina
LOCATION:LSTH, Life Sciences Lecture Theatre
DESCRIPTION:CARMA Colloquium\nLSTH, Life Sciences Lecture Theatre\n"Projection Methods: Convergence and Counterexamples"\nDr Vera Roshchina\n\nAbstract:\nThe history of projection methods goes back to von Neumann and his method of alternating projections for finding a point in the intersection of two linear subspaces. These days the method of alternating projections and its various modifications, such as the Douglas-Rachford algorithm, are successfully used to solve challenging feasibility and optimisation problems.\nThe convergence of projection methods (and its rate) depends on the structure of the sets that comprise the feasibility problem, and also on their position relative to each other. I will survey a selection of results, focusing on the impact of the geometry of the sets on the convergence.
UID:1127
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20190503T112322
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20190516T160000
DTEND;TZID=Australia/Sydney:20190516T170000
SUMMARY:CARMA Colloquium\n "Order and randomness in dynamics over finite fields"\n Prof John Roberts
LOCATION:LSTH, Life Sciences Lecture Theatre
DESCRIPTION:CARMA Colloquium\nLSTH, Life Sciences Lecture Theatre\n"Order and randomness in dynamics over finite fields"\nProf John Roberts\n\nAbstract:\nIn the past decade, the research area of arithmetic dynamics has grown in prominence. This area considers iterated maps as dynamical systems, acting on the integers, the rationals or on finite fields (meaning there is a finite phase space in the last case). Tools used to investigate arithmetic dynamics include combinatorics, arithmetic geometry, number theory, graph theory as well as numerical experimentation. There are important applications of arithmetic dynamical systems in cryptography. I will survey some of our investigations in arithmetic dynamics which have been motivated by the order and chaos divide in Hamiltonian dynamics.
UID:1123
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20190426T091451
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20190521T140000
DTEND;TZID=Australia/Sydney:20190521T150000
SUMMARY:CARMA Colloquium\n "Newton-MR: Newton's Method Without Smoothness or Convexity with Applications to Machine Learning"\n Dr Fred Roosta
LOCATION:SR202, SR Building
DESCRIPTION:CARMA Colloquium\nSR202, SR Building\n"Newton-MR: Newton's Method Without Smoothness or Convexity with Applications to Machine Learning"\nDr Fred Roosta\n\nAbstract:\nRecently, second-order methods have shown great success in a variety of machine learning applications. However, establishing convergence of the canonical member of this class, i.e., the celebrated Newton's method, has long been limited to making restrictive assumptions on (strong) convexity. Furthermore, smoothness assumptions, such as Lipschitz continuity of the gradient/Hessian, have always been an integral part of the analysis. In fact, it is widely believed that in the absence of well-behaved and continuous Hessian, the application of curvature can hurt more so that it can help. This has in turn limited the application range of the classical Newton’s method in machine learning. \n\nTo set the scene, we first briefly highlight some recent results, which shed light on the advantages of Newton-type methods for machine learning, as compared with first-order alternatives. We then turn our focus to a new member of this class, Newton-MR, which is derived using two seemingly simple modiﬁcations of the classical Newton’s method. We show that, unlike the classical Newton’s method, Newton-MR can be applied, beyond the traditional convex settings, to invex problems. Newton-MR appears almost indistinguishable from its classical counterpart, yet it offers a diverse range of algorithmic and theoretical advantages. Furthermore, by introducing a weaker notion of joint regularity of Hessian and gradient, we show that Newton-MR converges globally even in the absence of the traditional smoothness assumptions. Finally, we obtain local convergence results in terms of the distance to the set of optimal solutions. This greatly relaxes the notion of “isolated minimum”, which is required for the local convergence analysis of the classical Newton’s method. Numerical simulations using several machine learning problems demonstrate the great potential of Newton-MR as compared with several other second-order methods.
UID:1125
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20190426T091859
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20190523T160000
DTEND;TZID=Australia/Sydney:20190523T170000
SUMMARY:CARMA Colloquium\n "Integer multiplication in time $O(n \log n)$"\n A/Prof David Harvey
LOCATION:LSTH, Life Sciences Lecture Theatre
DESCRIPTION:CARMA Colloquium\nLSTH, Life Sciences Lecture Theatre\n"Integer multiplication in time $O(n \log n)$"\nA/Prof David Harvey\n\nAbstract:\nJoris van der Hoeven and I recently discovered an algorithm \nthat computes the product of two $n$-bit integers in $O(n \log n)$ bit \noperations. This is asymptotically faster than all previous known \nalgorithms, and matches the complexity bound conjectured by Schönhage \nand Strassen in 1971. In this talk, I will discuss the history of \ninteger multiplication, and give an overview of the new algorithm. No \nprevious background on multiplication algorithms will be assumed.
UID:1124
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20190426T091647
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20190530T160000
DTEND;TZID=Australia/Sydney:20190530T170000
SUMMARY:CARMA Colloquium\n "Sorting permutations with stacks"\n A/Prof. Murray Elder
LOCATION:SR202, SR Building
DESCRIPTION:CARMA Colloquium\nSR202, SR Building\n"Sorting permutations with stacks"\nA/Prof. Murray Elder\n\nAbstract:\nKnuth showed that a permutation can be sorted by passing it right-to-left through an infinite stack if and only if it \emph{avoids} a certain forbidden sub-pattern (231).\n\nSince then, many variations have been studies. I will describe some of these including new work of my PhD student Andrew Goh on stacks in series and ``pop-stacks".
UID:1128
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20190522T110022
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20190604T160000
DTEND;TZID=Australia/Sydney:20190604T170000
SUMMARY:CARMA Seminar\n "Yang-Baxter integrable dimers and Fused Restricted-Solid-On-Solid Models"\n Alessandra Vittorini Orgeas
LOCATION:SR202, SR Building
DESCRIPTION:CARMA Seminar\nSR202, SR Building\n"Yang-Baxter integrable dimers and Fused Restricted-Solid-On-Solid Models"\nAlessandra Vittorini Orgeas\n\nAbstract:\nTo be announced...
UID:1111
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20190325T115639
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20190605T090000
DTEND;TZID=Australia/Sydney:20190607T170000
SUMMARY:CARMA Workshop "CARMA Workshop on Computer-Aided Proof"
LOCATION:NewSpace
DESCRIPTION:CARMA Workshop\nNewSpace\nCARMA Workshop on Computer-Aided Proof\n\nComputers are playing an increasingly important role in the creation and verification of mathematical proofs. This role is expected to become central in the future of mathematics.
This workshop will bring together experts in computer proof assistants, formal proof verification systems, formal foundations of mathematics and related topics. The intended audience will be working mathematicians and graduate students, who are not necessarily experts in formal mathematics. Please visit the workshop website for more information.
UID:1097
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20190311T104538
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20191208T090000
DTEND;TZID=Australia/Sydney:20191212T170000
SUMMARY:CARMA Workshop "Data Science Down-Under"
LOCATION:TBA ( Campus, The University of Newcastle)
DESCRIPTION:CARMA Workshop\nTBA( Campus, The University of Newcastle)\n\nData Science Down-Under\n\nFor more information, please visit the workshop webpage.
UID:1098
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20190311T112220
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20200128T090000
DTEND;TZID=Australia/Sydney:20200201T170000
SUMMARY:CARMA Workshop "Mathematics in Industry Study Group 2020"
LOCATION:NewSpace
DESCRIPTION:CARMA Workshop\nNewSpace\nMathematics in Industry Study Group 2020\n\nVisit the MISG website for more information.
UID:1112
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20190325T160820
END:VEVENT
END:VCALENDAR