Department of Computer Science
Seminars
Seminars and talks are frequently hosted by the Department and associated research groups. Staff and students are warmly invited to attend.
2017

Parity games are almost in P Event as iCalendar
14 June 2017, 1  2pmThis Wednesday, June 14 at 1pm, Bakh Khoussainov will be delivering a Departmental Seminar on his recent award winning paper, Parity games are almost in P, written jointly with C. Calude, S. Jain, W.Li, and F. Stephan. Details are below. Light refreshments will be provided. 
Gibbons Lectures  The Ethics of AI Event as iCalendar
25 May 2017, 6:30pmAs AI becomes more widespread, in the home, workplace and battlefield, with the deployed systems increasingly becoming autonomous, society needs to consider the ethics underpinning and supporting these systems. 
Gibbons Lectures  deep learning  what's missing? Event as iCalendar
18 May 2017, 6:30pmThere have certainly been some spectacular improvements in machine learning over the last couple of years, and one has to wonder what comes next? I will talk about recent breakthroughs but also focus on their intrinsic limitations in order to make some guesses about where the frontiers might lie. 
Gibbons Lectures  Home smart home Event as iCalendar
11 May 2017, 6:30pmOne of the grand social challenges that developed countries are facing in the 21st century is the problem of an ageing population. This holds in particular for countries with small populations like New Zealand. People expect to live longer than ever before, and they expect that this increased longevity will be enjoyed living an independent, high quality lifestyle in their own homes. 
Gibbons Lectures  AI: from Aristotle to deep learning machines Event as iCalendar
04 May 2017, 6:30pmThe talk presents briefly the main principles used in AI, from Aristotle’s true/false logic, through fuzzy logic, evolutionary computation and neural networks, to arrive at the current stateoftheart in AI – the deep learning machines. One particular such machine, developed in the presenter’s KEDRI Institute and dubbed NeuCube, is designed for deep learning of complex data patterns so as to predict future events. 
2016

Seminar: Measuring Partial Balance in Signed Networks Event as iCalendar
25 February 2016, 1  2:30pmProvisional year seminar on Measuring Partial Balance in Signed Networks 
Seminar: Mathematical Modelling and Analysis of Legislation Networks Event as iCalendar
25 February 2016, 11  12:30amProvisional year seminar on : Mathematical Modelling and Analysis of Legislation Networks 
Seminar  Distributed Computer Systems Research at the University of Saskatchewan Event as iCalendar
24 February 2016, 12  1pmComputer Science Departmental Seminar on: Distributed Computer Systems Research at the University of Saskatchewan
2015

Seminar  Approximation Algorithms for Fully Proportional Representation by Clustering Voters Event as iCalendar
09 December 2015, 12  1pmDepartmental Seminar on: Approximation Algorithms for Fully Proportional Representation by Clustering Voters 
Seminar  The Survey Octopus: an approach to teaching Total Survey Error Event as iCalendar
06 November 2015, 12  1pmDepartmental Seminar on: The Survey Octopus: an approach to teaching Total Survey Error. The talk will describe the Survey Octopus, show how it relates to Groves et als' model of the survey lifecycle, and explain the benefits and problems of each depiction of TSE. 
Seminar: Departmental Seminar on Adventures in computational social science: New Zealand as a "social laboratory" Event as iCalendar
26 August 2015, 12  1pmOver the next two years, under a James Cook fellowship, we will be constructing a simulationbased model of some of the key sociodemographic processes in New Zealand society over the last quarter century, drawing in the first instance on the New Zealand Longitudinal Census, 19812013, as its empirical foundation. Potentially this is a powerful instrument of cooperative social inquiry that can be used for policy testing, for scholarly purposes, and also for teaching as well. 
Seminar: Quantum random walks Event as iCalendar
16 June 2015, 3  4pmQuantum walk represents a generalised version of the wellknown classical random walk. Regardless of their apparent connection, the dynamics of a quantum walk is often nonintuitive and far deviates from its classical counterpart. A multiparticle quantum walk presents an even richer dynamical system due to intrinsic quantum correlation and interaction. Current research is suggesting potential applications across a wide range of different fields. In this talk, I will give a brief introduction to quantum walks, discuss their potential applications, and consider several physical implementation schemes. 
Seminar: Can network coding help bridge the digital divide in the Pacific? Event as iCalendar
10 June 2015, 12  1pmNetworkcoded TCP (TCP/NC) can increase goodput under high latency and packet loss, but has not been used to tunnel conventional TCP and UDP across satellite links before. We report on a feasibility study aimed at determining expected goodput gain across such TCP/NC tunnels into island targets on geostationary and medium earth orbit satellite links. 
SERG Seminar: Performance Analysis using Subsuming Methods: An Industrial Case Study Event as iCalendar
05 May 2015, 12  1pmSubsuming methods analysis is a new approach that aggregates performance costs across repeated patterns of method calls that occur in the application’s runtime behaviour. This allows automatic identification of patterns that are expensive and represent practical optimisation opportunities. 
Seminar: Algorithmically random infinite structures Event as iCalendar
29 April 2015, 2  3pmIn spite of much work, research on algorithmic randomness has excluded the investigation of randomness for infinite structures such as graphs, trees, and algebras. The reason is that it was unclear how one introduces a meaningful measures into these classes of structures. In this talk we provide a solution to this problem, and initiate the study of algorithmic randomness in various classes of infinite structures. 
Seminar: The $d$step conjecture for runs verified Event as iCalendar
15 April 2015, 12  1pmIn 1999 Kolpakov & Kucherov showed that the maximum number of runs in a string is linear in the length of the string. A run is a maximal repetition. They posited a socalled \emph{runs conjecture} that the upper bound should be at most the length of the string, i.e. that $\rho=\max\{r(x):x=n\}\leq n$, where $r(x)$ denotes the number of runs in a string $x$. Many researchers, including the speaker, since investigated the problem and several progressively closer asymptotic lower and upper bounds were achieved. In 2012 Deza and Franek proposed a $d$step approach and conjectured that $\rho_d(n) = \max\{r(x):x=n\ \&\ x\ has\ exactly$ $d\ distinct\ symbols\}\leq nd$ for any $2\leq d\leq n$. In 2015, Bannai et al. proved the runs conjecture giving a universal upper bound of $\rho(n)\leq n2$. Refining their method, we proved the $d$step conjecture showing some interesting structural properties of runmaximal strings. 
Seminar: Practical Recordandreplay Debugging Event as iCalendar
25 March 2015, 12  1pmMozilla's browser developers find debugging expensive and frustrating, especially when bugs are nondeterministic. Researchers have proposed to expedite debugging by recording, replaying and analyzing program executions, and in theory such techniques are wellunderstood, but they have not yet been widely adopted. 
SERG Seminar: Improving Course Relevance: Techniques for Incorporating the Social Value of Computing into your Courses Event as iCalendar
24 March 2015, 12  1pmThis talk introduces "Computing for the Social Good: Educational Practices" (CSGEd). CSGEd is an umbrella term meant to incorporate any educational activity, from small to large, that endeavours to convey and reinforce computing's social relevance and potential for positive societal impact. 
Seminar: Demystifying Big Data Adoption: Paradigm shifts and Complexity Tolerance Theory Event as iCalendar
04 March 2015, 11am  12pmAmidst the big data hype pushed by the technology vendors and the unexpectedly low adoption rate, this seminar aims to clarify the myths about big data adoption and to offer research directions on big data system development. We will first describe big data management challenges, present 10 paradigm shifts in big data management, and then present the results of an empirical study of 20 large international European companies (average number of employees of our case companies is > 150,000 people). 
Seminar: Cognitive Crash Dummies: Predictive Human Performance Modeling for Interactive System Design Event as iCalendar
02 March 2015, 3  4pmThis talk reviews the state of the art of predictive modeling and discusses realworld experiences using cognitive crash dummies. 
Seminar: Reticulate Evolution: Why Trees Become Networks Event as iCalendar
25 February 2015, 12  1pmIn this talk, we will investigate problems in evolutionary biology from the perspectives of graph theory and theoretical computer science. 
Seminar: RealTime Big Data Stream Analytics Event as iCalendar
18 February 2015, 12  2pmWe will discuss some advanced stateoftheart methodologies in stream mining based in the use of adaptive size sliding windows. Finally, we will present the MOA software framework with classification, regression, and frequent pattern methods, and the new Apache SAMOA distributed streaming software.