ABSTRACT
In this talk, we will provide a self-contained introduction to the field of computational social choice – an emerging research area that applies tools and techniques of computer science (most notably, algorithms, complexity and artificial intelligence) to problems that arise in voting theory, fair division, and other subfields of social choice theory. We will give a high-level overview of this research area, and mention some open problems that may be of interest to mathematicians and computer scientists.

Cybersecurity for Critical Infrastructure, or ‘how to break into a nuclear power station for fun & profit’

Dr Richard Gold, Cisco Systems, UK

Cyber Security for Critical Infrastructures such as the power grid, oil & gas pipelines and dams has become a hot topic since the Stuxnet malware attack against the nuclear enrichment centrifuges in Iran. However, due to intrinsic issues with the field of Critical Infrastructure (a.k.a., ICS or SCADA), it is difficult to deploy standard IT security solutions “as is” to these systems. In this talk I discuss the problems associated with deploying effective security processes in Critical Infrastructures, the various types of security holes which these system contain and a step-by-step approach to exploiting a Critical Infrastructure installation. Thinking from the attacker’s perspective allows us to get an insight into how these systems are vulnerable and how a potential attacker might exploit them.

Dr Alan Boyd and Dr Nicholas Malden, D Young & Co LLP (Patent Attorneys)
Intellectual Property – What, why, and how?
In many technological fields, especially computer science, output isn’t a physical object that can be sold, but is an idea or an expression of an idea that comes from your mind. But how can industry take advantage of such ideas or expressions, and what’s to stop a competitor from simply copying your hard work and benefiting from it at your expense? In this talk, we’ll take you through the basics of Intellectual Property (IP) and look at how it can be used by a computer scientist, its importance to new start-ups and large multinationals alike, and also introduce you to the patent attorney profession. We’ll give you a chance to try your hand at writing a patent claim, and we’ll give a prize to the best one!

Limits of language can be studied from various perspectives such as morphology, syntax, and semantics, among others. At the syntactic level, one direction that has been pursued very actively is via the theory of formal languages, beginning with the so-called Chomsky hierarchy. In this hierarchy, the finite state languages (regular languages) and the context free languages (CFL) have been studied very extensively, leading to many important results relevant to syntax as well as parsing. At the same time, inadequacy of these two classes of grammars (languages) for capturing natural languages has been well documented by now.
A careful look at the pumping lemma for context free languages led to the discovery of the so-called tree adjoining grammars (TAG) and to the notion of mildly context sensitive languages (MCSL), which has served as a framework for showing equivalences among other systems (such as Combinatory Categorial Grammars, CCG and Head Grammars (HG), for example). This has led to a deeper understanding of the limits of language, more specifically, by trying to provide an answer to the question: how far do we need to be beyond CFL to achieve syntactic adequacy.
I will try to describe some of this recent work by a number of researchers in the past few years.

Aravind Joshi did his undergraduate work in India and his graduate work at the University of Pennsylvania in Electrical Engineering, while simultaneously attending some courses in Linguistics at the same University. Since 1961 he has been a faculty member in the Department of Computer and Information Science and the Department of Linguistics. At present, he is a Professor of Computer and Cognitive Science and a Member of the Institute for Research in Cognitive Science.
Besides working on some problems in the mathematics of language, at present, he is involved in a project on discourse annotation, jointly with Bonnie Webber (Edinburgh U.) and Rashmi Prasad (U. Wisconsin), for creating the Penn Discourse Treebank (PDTB).