AIMS

The subject aims to provide an understanding of the principles on which the Web, Email, DNS and other interesting distributed systems are based. Questions concerning distributed architecture, concepts and design; and how these meet the demands of contemporary distributed applications will be addressed.

INDICATIVE CONTENT

Topics covered include: characterization of distributed systems, system models, interprocess communication, remote invocation, indirect communication, operating system support, distributed objects and components, web services, security, distributed file systems, and name services.

AIMS

Declarative programming languages provide elegant and powerful programming paradigms which every programmer should know. This subject presents declarative programming languages and techniques.

INDICATIVE CONTENT

• The dangers of destructive update
• Functional programming
• Recursion
• Strong type systems
• Parametric polymorphism
• Algebraic types
• Type classes
• Defensive programming practice
• Higher order programming
• Currying and partial application
• Lazy evaluation
• Monads
• Logic programming
• Unification and resolution
• Nondeterminism, search, and backtracking

AIMS

Machine Learning is the study of making accurate, computationally efficient, interpretable and robust inferences from data, often drawing on principles from statistics. This subject aims to introduce students to the intellectual foundations of machine learning, including the mathematical principles of learning from data, algorithms and data structures for machine learning, and practical skills of data analysis.

INDICATIVE CONTENT

Indicative content includes: cleaning and normalising data, supervised learning (classification, regression, linear & non-linear models), and unsupervised learning (clustering), and mathematical foundations for a career in machine learning.

AIMS

The key focus of this subject is the foundations of autonomous agents that reason about action, applying techniques such as automated planning, reinforcement learning, game theory, and their real-world applications. Autonomous agents are active entities that perceive their environment, reason, plan and execute appropriate actions to achieve their goals, in service of their users (the real world, human beings, or other agents). The subject focuses on the foundations that enable agents to reason autonomously about goals & rewards, perception, actions, strategy, and the knowledge of other agents during collaborative task execution, and the ethical impacts of agents with this ability.

The programming language used in this subject is Python. No lectures or workshops on Python will be delivered.

INDICATIVE CONTENT

Topics are drawn from the field of advanced artificial intelligence including:

• Search algorithms and heuristic functions
• Classical (AI) planning
• Markov Decision Processes
• Reinforcement learning
• Game theory
• Ethics in AI planning

• Search algorithms and heuristic functions
• Classical (AI) planning
• Markov Decision Processes
• Reinforcement learning
• Game theory
• Ethics in AI planning

This subject combines practical spatial data management with the underpinning theories of spatial and spatiotemporal data representation and handling from Geographic Information Science. Spatial information is answering ‘where’ and ‘when’ questions – which are fundamental in decision making in complex systems, be it in urban planning, traffic and infrastructure management, environmental management, public health and sustainability, or any other social, economic, and environmental context.

The subject introduces foundations of effective, efficient, and large-scale spatial data management. This subject will cover the concepts, methods, and approaches that allow for efficient representation, querying, and retrieval of spatial data, in a modern ecosystem of spatial databases interfacing a geographic information system.

The knowledge acquired is fundamental for subsequent studies in spatial data analytics and visualisation, and is of particular relevance to people wishing to establish a career in the spatial information, the environmental, or the planning industry. It is also suited for every postgraduate student who is looking for solid skills with Geographic Information Systems.

In this subject, we will discuss the intricacies of computational representation and management of spatial information. The subject takes a spatial database perspective to management of extensive spatial datasets. The subject will cover the modelling, loading, transformation, analysis, and retrieval of spatial data in spatial databases. The subject covers data representations (vector, raster, and network data); spatial operations, including geometric, topological, set-oriented, and network operations; spatial indexes and access methods, including quadtrees and R-trees. The subject exposes the students to the whole lifecycle of spatial data management in a team-based project.

Please view this video for further information: Spatial Data Management

User Experience (UX) means the way we respond to technology, including our practical, intellectual, emotional and affective responses. UX is widely recognised as a major determinant of successful technology outcomes, and it provides the design inspiration behind some of the most successful innovations in digital technologies that define the present era. This subject concerns the methods and techniques that are used to identify what characterises UX and how you can recognise, measure and evaluate it in a variety of contexts. This entails a deep understanding of the psychological and social theories underlying UX, combined with practical knowledge of the various industry methods and tools currently in use. In terms of practice, an emphasis is placed on learning the skills needed to design, justify and conduct appropriate evaluations, and the interpretation of findings. In terms of theory, special emphasis is placed on how to identify and evaluate the various facets of UX, across a range of social and work-based settings, and across a range of technologies.

AIMS

Technological advances in obtaining high throughput data have stimulated the development of new computational approaches to bioinformatics. This subject will cover core computational challenges in analysing bioinformatics data. We cover important algorithmic approaches and data structures used in solving these problems, and the challenges that arise as these problems increase in scale.

The subject is a core subject in the MSc (Bioinformatics) and is an elective in the Master of Information Technology and the Master of Engineering. It can also be taken by PhD students and by undergraduate students, subject to the approval of the lecturer.

INDICATIVE CONTENT

The subject covers key algorithms used in bioinformatics, with a focus on genomics. Indicative topics are: sequence alignment (dynamic algorithms and seed-and-extend), genome assembly, variant detection, phylogenetic reconstruction, genomic intervals, complexity and correctness of algorithms, clustering and classification of genomics data, data reduction and visualisation.
The subject assumes you have experience in programming and familiarity with the foundations of genomics.

AIM

The study of genomics is on the forefront of biology. Current laboratory technologies generate huge amounts of data and computational analysis is necessary to make sense of these data. This subject covers a broad range of approaches to the computational analysis of genomic data. Students will learn the theory behind a variety of different approaches to genomic analysis, and be introduced to key tools in current use, preparing them to use existing methods appropriately as well as developing new ways to analyse genomic data. Students will also have opportunities to apply their skills in workshops and assignments using both existing computational genomics tools and writing custom Python functions.

Computational Genomics is a selective subject in the MSc (Bioinformatics) and is an elective in other courses. It can also be taken by PhD students and by undergraduate students, subject to the approval of the subject coordinator.

INDICATIVE CONTENT

This subject covers the computational analysis of several important forms of genomic data. Topics include computational resource management, reproducible research principles, genomics workflows, sequence alignment, genome annotation, parallel computing, metagenomics and single-cell sequencing. The subject domain rapidly progresses, and subject content is regularly revised and updated.

Practical work includes writing bioinformatics functions with Python code, accessing genomics data repositories and using popular command-line tools.

AIMS

Mobile devices are ubiquitous nowadays. Mobile computing encompasses technologies, devices and software that enable (wireless) access to services anyplace, anytime, and anywhere. This subject will cover fundamental mobile computing techniques and technologies, and explain challenges that are unique to the design, implementation, and evaluation of mobile computing. In particular, this subject will enable students to develop mobile phone applications that take advantage of the unique sensing capabilities of mobile devices, their multi-modal interaction capabilities, and their ability to sense and respond to context.

AIMS

The Internet, World Wide Web, bank networks, mobile phone networks and many others are examples for Distributed Systems. Distributed Systems rely on a key set of algorithms and data structures to run efficiently and effectively. In this subject, we learn these key algorithms that professionals work with while dealing with various systems. Clock synchronization, leader election, mutual exclusion, and replication are just a few areas were multiple well known algorithms were developed during the evolution of the Distributed Computing paradigm.

INDICATIVE CONTENT

Topics covered include:

• Synchronous and asynchronous network algorithms that address resource allocation, communication
• Consensus among distributed processes
• Distributed data structures
• Data consistency
• Deadlock detection
• Lader election, and
• Global snapshots issues.

AIMS

The growing popularity of the Internet along with the availability of powerful computers and high-speed networks as low-cost commodity components are changing the way we do parallel and distributed computing (PDC). Cluster and Cloud Computing are two approaches for PDC. Clusters employ cost-effective commodity components for building powerful computers within local-area networks. Recently, “cloud computing” has emerged as the new paradigm for delivery of computing as services in a pay-as-you-go-model via the Internet. These approaches are used to tackle may research problems with particular focus on “big data” challenges that arise across a variety of domains.

Some examples of scientific and industrial applications that use these computing platforms are: system simulations, weather forecasting, climate prediction, automobile modelling and design, high-energy physics, movie rendering, business intelligence, big data computing, and delivering various business and consumer applications on a pay-as-you-go basis.

This subject will enable students to understand these technologies, their goals, characteristics, and limitations, and develop both middleware supporting them and scalable applications supported by these platforms.

This subject is an elective subject in the Master of Information Technology. It can also be taken as an Advanced Elective subject in the Master of Engineering (Software).

INDICATIVE CONTENT

• Cluster computing: elements of parallel and distributed computing, cluster systems architecture, resource management and scheduling, single system image, parallel programming paradigms, cluster programming with MPI
• Utility computing: foundations and grid computing technologies
• Cloud computing: cloud platforms, Virtualization, Cloud Application Programming Models (Task, Thread, and MapReduce), Cloud applications, and future directions in utility and cloud computing
• “Big data” processing and analytics in distributed environments

Please view this video for further information: Cluster and Cloud Computing

AIMS

The subject aims to introduce students to parallel algorithms and their analysis. Fundamental principles of parallel computing are discussed. Various parallel architectures and programming platforms are introduced. Parallel algorithms for different architectures, as well as parallel algorithms addressing specific scientific problems are critically analysed.

INDICATIVE CONTENT

Topics include: principles of parallel computing, PRAM model, PRAM algorithms, parallel architectures, OpenMP, shared memory algorithms, systolic algorithms, parallel communication patterns, PVM/MPI, scientific applications, hypercube, graph embeddings and extended parallel computing models.

AIMS

Much of the world’s knowledge is stored in the form of text, and accordingly, understanding and harnessing knowledge from text are key challenges. In this subject, students will learn computational methods for working with text, in the form of natural language understanding, and language generation. Students will develop an understanding of the main algorithms used in natural language processing, for use in a diverse range of applications including machine translation, text mining, sentiment analysis, and question answering. The programming language used is Python.

INDICATIVE CONTENT

Topics covered may include:

• Text classification and unsupervised topic discovery
• Vector space models for natural language semantics
• Structured prediction for tagging
• Syntax models for parsing of sentences and documents
• N-gram language modelling
• Automatic translation, and multilingual methods
• Relation extraction and coreference resolution

AIMS

The subject will explore foundational knowledge in the area of cryptography and information security. The overall aim is to gain an understanding of fundamental cryptographic concepts like encryption and signatures and use it to build and analyse security in computers, communications and networks. This subject covers fundamental concepts in information security on the basis of methods of modern cryptography, including encryption, signatures and hash functions.

This subject is an elective subject in the Master of Engineering (Software). It can also be taken as an advanced elective in Master of Information Technology.

INDICATIVE CONTENT

The subject will be made up of three parts:

AIMS

The subject will explore foundational knowledge in the area of cryptography and information security. The overall aim is to gain an understanding of fundamental cryptographic concepts like encryption and signatures and use it to build and analyse security in computers, communications and networks. This subject covers fundamental concepts in information security on the basis of methods of modern cryptography, including encryption, signatures and hash functions.

This subject is an elective subject in the Master of Engineering (Software). It can also be taken as an advanced elective in Master of Information Technology.

INDICATIVE CONTENT

The subject will be made up of three parts:

• Cryptography: the essentials of public and private key cryptography, stream ciphers, digital signatures and cryptographic hash functions
• Access Control: the essential elements of authentication and authorization; and
• Secure Protocols; which are obtained through cryptographic techniques.

A particular emphasis will be placed on real-life protocols such as Secure Socket Layer (SSL) and Kerberos.

Topics drawn from:

• Symmetric key crypto systems
• Public key cryptosystems
• Hash functions
• Authentication
• Secret sharing
• Protocols
• Key Management.

AIMS

Good craftsmen know their tools, and compilers are amongst the most important tools that programmers use. There are many ways in which familiarity with compilers helps programmers. For example, knowledge of semantic analysis helps programmers understand error messages, and knowledge of code generation techniques helps programmers debug problems at assembly language level. The technologies used in compiler development are also useful when implementing other kinds of programs. The concepts and tools used in the analysis phases of a compiler are useful for any program whose input has a structure that is non-trivial to recognize, while those used in the synthesis phases are useful for any program that generates commands for another system. This subject provides an understanding of the main principles of programming language implementation, as well as first hand experience of the application of those principles.

INDICATIVE CONTENT

The subject describes how compilers analyse source programs, how they translate them to target programs, and what tools are available to support these tasks. Topics covered include compiler structures; lexical analysis; syntax analysis; semantic analysis; intermediate representations of programs; code generation; and optimisation.

AIMS

Many applications require reliability in access to data, and data should not be lost even in the presence of hardware failures. The ability to retrieve and process the data very efficiently is also paramount even when multiple users access the data from remote sites simultaneously. With the increasing size of data used in these applications, advanced techniques for data management have emerged to make many such advanced requirements for access to data a reality. The subject covers the technologies used in advanced database systems that use these techniques. Topics covered will include: transactions, concurrency control, reliability, ACID properties, performance, indexing of both structured and unstructured data, query processing, and further topics on different database types and database architectures.

INDICATIVE CONTENT

Topics covered include:

• Introduction to High Performance Database Systems
• Issues of Performance and Reliability
• Transaction Processing
• Recovery from Failures
• Map Reduce Models

AIMS

With exponential increases in the amount of data becoming available in fields such as finance and biology, and on the web, there is an ever-greater need for methods to detect interesting patterns in that data, and classify novel data points based on curated data sets. Learning techniques provide the means to perform this analysis automatically, and in doing so to enhance understanding of general processes or to predict future events.

Topics covered will include: supervised learning, semi-supervised and active learning, unsupervised learning, kernel methods, probabilistic graphical models, classifier combination, neural networks.

This subject is intended to introduce graduate students to machine learning though a mixture of theoretical methods and hands-on practical experience in applying those methods to real-world problems.

INDICATIVE CONTENT

Topics covered will include: linear models, support vector machines, random forests, AdaBoost, stacking, query-by-committee, multiview learning, deep neural networks, un/directed probabilistic graphical models (Bayes nets and Markov random fields), hidden Markov models, principal components analysis, kernel methods.

AIMS

At the heart of theoretical computer science are questions of both philosophical and practical importance. What does it mean for a problem to be solvable by computer? What are the limits of computability? Which types of problems can be solved efficiently? What are our options in the face of intractability? This subject covers such questions in the content of a wide-ranging exploration of the nexus between logic, complexity and algorithms, and examines many important (and sometimes surprising) results about the nature of computing.

INDICATIVE CONTENT

• Turing machines
• The Church-Turing Thesis
• Decidable languages
• Reducability
• Time Complexity: The classes P and NP, NP-complete problems
• Space complexity: including sub-linear space
• Circuit complexity
• Approximation algorithms
• Probabilistic complexity classes
• Additional topics may include descriptive complexity, interactive proofs, communication complexity, complexity as applied to cryptography
• Space complexity, including sub-linear space
• Finite state automata, pushdown automata, regular languages, context-free languages to the Recommended Background Knowledge.

Example of assignment

• Proving the equivalence of a variant of a standard machine to the original version
• Describing an NP-hardness reduction
• Designing an approximation algorithm for an NP-hard problem.

AIMS

As we become more dependent on data in every aspect of our lives the task of protecting it and applications dependant on it becomes harder. The sheer quantity of data and sophistication of the attacks is rapidly making manual analysis infeasible. Security Analytics will examine how we can protect data and automate the analysis of data to better detect, predict and prevent privacy and security vulnerabilities.

INDICATIVE CONTENT

The subject will first introduce the types of information leakage that can occur under several threat models and explore methods for protecting sensitive content during data analysis. The second part of the subject will introduce methods from machine learning that are widely used for cyber security analysis. Specific unsupervised machine learning techniques will be covered in more detail, which include methods for anomaly detection, alarm correlation and intrusion detection. The third part of the subject will introduce some of the theoretical challenges and emerging issues for security analytics research, based on recent trends in the evolution of security threats.

Indicative examples of the emerging challenges and issues that will be studied are privacy‐preserving analytics, adversarial machine learning, concept drift and new applications in monitoring critical infrastructure.

AIMS

The Internet pervades nearly every aspect of our lives, from banking through to dating, and onto our interactions with government. As more of our lives move online we face ever greater risks to our data and way of life from internet vulnerabilities and attacks. Web Security will examine the fundamentals behind common vulnerabilities and attacks, and will introduce students to ways of mitigating the risks associated with them. It will also examine some of the ethical challenges faced when evaluating security and disclosing vulnerabilities.

INDICATIVE CONTENT

The subject will examine some of the cyber security challenges faced during system implementation and deployment. In particular it will identity common attack vectors, covering in more detail some of the Open Web Application Security Project (OWASP) Top 10 list of web application vulnerabilities, which may include topics such as injection, cross‐site scripting, session hijacking, and cross‐site request forgery, amongst others. Where appropriate practical examples will be examined to relate theory to practice. The subject will discuss methods for mitigating the risks associated with such vulnerabilities, and may include discussions on distributed denial of service, input validation and sanitisation, penetration testing, and the associated ethical and legal constraints, automated vulnerability scanning, and web application firewalls.

Contemporary software systems such as search engines must deal with huge amounts of data, often in real time. In such cases, standard data structures and algorithms do not scale. This subject aims to provide an overview of contemporary advanced algorithms and data structures in computer science for such problems. These techniques serve as building blocks for solving complex algorithmic problems, and have many practical applications.

Computers are invaluable tools for modelling and simulating complex systems in a range of real word domains. The complex behaviours exhibited by many biological, social and technological systems – such as epidemics, urban systems and robotics – challenge our ability to predict, analyse and design such systems. Building computational models of these systems can help us better understand their structure and behaviour, and make better decisions about their design and control.

The aim of this subject is to provide students with a solid foundation in the conceptual and technical skills required to design, implement and evaluate computational models of complex systems.

INDICATIVE CONTENT

Topics covered will be selected from:

• the use of models for science, engineering and policy
• dynamical systems analysis
• complexity and emergent behaviour
• agent-based models
• design, communication and evaluation of models
• analysis and visualisation of model behaviour
• case study exemplars of specific types of models, such as:

• spatial models (eg, transportation)
• network models (eg, epidemics)
• adaptive models (eg, robotics)

This subject will explore the fundamentals of quantum programming and quantum algorithm design. The subject will introduce students to a range of different quantum programming platforms and languages, and will include hands-on modules. The students will be prepared to write quantum programs, implement a range of simple quantum algorithms, such as Grover’s and Shor’s algorithms, and to execute quantum programs on a quantum computer through a cloud access.

This subject will be made up of three parts:

1. Fundamentals of quantum computing and quantum programming, including running quantum programs on actual cloud-based quantum computers.
2. Programming fundamental quantum algorithms, such as the Deutsch–Jozsa, Grover, Shor and HHL algorithms.
3. Quantum programming for cutting edge research topics, such as quantum error correction, variational quantum circuits and quantum machine learning.

AIMS

From self-driving cars to automatic processing of medical scans, vision is a key sensory modality for a variety of artificial intelligence tasks. However, extracting meaning from images poses various computational challenges. In this subject, students will learn the basic principles of image formation and computational methods for interpreting images. Students will develop an understanding of the standard frameworks used in computer vision algorithms and their applications in tasks such as object recognition, target detection, and three-dimensional reconstruction. The programming language used is Python.

INDICATIVE CONTENT

Topics covered may include:

• Basics of image formation
• Illumination and reflectance models
• Colour spaces
• Feature detectors and descriptors
• Stereo correspondence
• Methods for recovering three-dimensional shape
• Image segmentation
• Categorical and instance-level recognition

This subject aims to provide students with the necessary tools to: identify social and ethical issues of digital technology particularly artificial intelligence and reason about these issues; communicate concerns, or discuss ideas, from differing points of view; and ultimately build technology with awareness of, and respect for, inclusion and the responsibility that comes with building powerful tools. Not contemplating ethical or social implications of AI and other technological tools may open up unintended consequences and risks. Ethical dilemmas can also cause additional personal stress for individuals who lack the skills to think about them reflectively. For these reasons, the growing societal and ethical problems raised by artificial intelligence and other technologies have become a major focus of many organisations, including for start-ups, government, defence, and many corporations.

Topics include:

• the history of artificial intelligence
• established ethical theories and concepts and their relation to artificial intelligence and technology
• fairness, equity, and discrimination in automated decision making
• accountability, explainability, and transparency of AI
• practical approaches and ethical frameworks for designing, developing and deploying technology responsibly