Seminar: SMT, Planning and Snowmen

Professor Mateu Villaret, from Universitat de Girona is a visiting scholar with the AI group from July 1st until September 30th. Professor Villaret works on algorithms for routing and scheduling with the AI group at St Andrews.

As well as solving practical problems, he also enjoys puzzle games. That is the basis of this talk, about using Planning and SMT to solve the “Snowman” puzzle.

Event details

  • When: 6th August 2018 11:00 - 12:00
  • Where: Cole 1.33a
  • Series: AI Seminar Series
  • Format: Seminar

Systems Seminar: Coupled Adaptive Complex Network, by Saray Shai, University of St Andrews


This talk presents the introduction and our early investigation on coupled adaptive complex networks. Generally an adaptive network is the network whose topology adapts and evolves with the dynamics of the network. At present, adaptive networks are ubiquitous across many disciplines, including technical distribution networks such as road networks and the internet; natural and biological networks; and social science networks. These networks are often interact with or depend upon other networks, resulting in coupled adaptive networks.

In this talk, we present our recent study of susceptible-infected-susceptible (SIS) epidemic dynamics on coupled adaptive networks, where susceptible nodes are able to avoid contact with infection by rewiring their intra-network connections. However, infected nodes can pass the disease through inter-network connections, which do not change with time: the dependencies between the coupled networks remain constant.

An analytical formalism is developed and validated using extensive numerical simulation. The experiment results show that the stability is increased with the increase in the number of inter-network links, in the sense that the range of parameters over which both endemic and healthy states coexist (both solution branches are stable) becomes smaller. Also we find a new stable solution branch that does not appear in the case of single adaptive network but only in the case of weakly coupled networks, in which the disease is endemic in one network but neither becomes endemic nor dies out in the other. Instead, it persists only at the nodes that are coupled to nodes in the other network through inter-network links.

Event details

  • When: 29th January 2013 13:00 - 14:00
  • Where: Cole 1.33b
  • Format: Seminar

Forthcoming talk by SICSA Distinguished Visitor

Room 1.33a at 2:00 pm on Friday 7th September 2012

  • Introduction to Grammatical Formalisms for Natural Language Parsing
  • Giorgio Satta, Department of Information Engineering, University of Padua, Italy

In the field of natural language parsing, the syntax of natural languages is

modeled by means of formal grammars and automata. Sometimes these formalisms

are borrowed from the field of formal language theory and are adapted to the
task at hand, as in the case of context-free grammars and their lexicalized
versions, where each individual rule is specialized for one or more lexical
items. Sometimes these formalisms are newly developed, as in the case of
dependency grammars and tree adjoining grammars. In this talk, I will
briefly overview several of these models, discussing their mathematical
properties and their use in parsing of natural language.

Event details

  • When: 7th September 2012 14:00 - 15:00
  • Where: Cole 1.33a
  • Format: Seminar, Talk