Module finder

This fifteen credit module will introduce you to the theoretical, logistic, technical and legislative issues that have to be addressed if the theory and practice of archaeology are to be successfully applied in the investigation of sites underwater - these techniques are relevant to any form of scientific diving. Case studies will be used to demonstrate the logistical aspects of excavation strategy, as well as the equipment and techniques necessary for search, survey, excavation, sampling and recording underwater. The course includes introductory practical sessions on diving. Non-divers can participate on an equal footing to divers through the main, assessed activities, related to planning of diving projects and an understanding of the theoretical application of diving skills and current HSE regulations as applied to maritime archaeology. This module is designed to underpin practical training and fieldwork, thereby complementing the more thematic approach explored in the first semester module Maritime Archaeology. Assessment involves designing a diving project, which will be presented as a group and a formative exam on diving theory and legislation.

The practical component will allow hands-on development of skills and include supplementary pool sessions that can count towards your BSAC Ocean Diver diving qualification. No pre-existing diving qualification is required for this module.

This fifteen credit module will introduce you to the theoretical, logistic, technical and legislative issues that have to be addressed if the theory and practice of archaeology are to be successfully applied in the investigation of sites underwater - these techniques are relevant to any form of scientific diving. Case studies will be used to demonstrate the logistical aspects of excavation strategy, as well as the equipment and techniques necessary for search, survey, excavation, sampling and recording underwater. The course includes introductory practical sessions on diving. Non-divers can participate on an equal footing to divers through the main, assessed activities, related to planning of diving projects and an understanding of the theoretical application of diving skills and current HSE regulations as applied to maritime archaeology. This module is designed to underpin practical training and fieldwork, thereby complementing the more thematic approach explored in the first semester module Maritime Archaeology. Assessment involves designing a diving project, which will be presented as a group and a formative exam on diving theory and legislation.

Practical components will allow hands on development of skills act as supplementary and will take place in pool sessions for a total of approximately 18 hours as well as a weekend of sheltered open water dives to complete the BSAC Ocean Diver diving qualification for those who wish to do so. No pre-existing diving qualification is required for this module.

This is a structured module, partly delivered by self-study and partly by lectures, designed for MMath students in their fourth year.

A semigroup is a non-empty set on which is defined an associative binary operation. Unlike a group, a semigroup needn't contain an identity element nor inverses for each element. For example, the natural numbers N with the operation of addition + is a semigroup as is the set T(X) of all maps from a set X to itself with operation of composition of maps. As another example consider the set of all nxn matrices with real coefficients with the binary operation of matrix multiplication. We already know that matrix multiplication is associative and this set forms a semigroup.

In some respects we can think of a semigroup as an abstraction of a group but on the other hand it is sometimes useful to compare the theory of semigroups with that of rings (the 'multiplicative part' of a ring is just a semigroup) and many of the historical developments in the theory of semigroups owe much to these two theories. However recent work has highlighted strong connections with, for example, many aspects of theoretical computer science (automata theory, theory of codes and formal language theory) as well as with other areas of mathematics such as the theory of ordered structures and (partial) symmetries.

This is a structured module, partly delivered by self-study and partly by lectures, designed for MMath students in their fourth year.

A semigroup is a non-empty set on which is defined an associative binary operation. Unlike a group, a semigroup needn't contain an identity element nor inverses for each element. For example, the natural numbers N with the operation of addition + is a semigroup as is the set T(X) of all maps from a set X to itself with operation of composition of maps. As another example consider the set of all nxn matrices with real coefficients with the binary operation of matrix multiplication. We already know that matrix multiplication is associative and this set forms a semigroup.

In some respects we can think of a semigroup as an abstraction of a group but on the other hand it is sometimes useful to compare the theory of semigroups with that of rings (the 'multiplicative part' of a ring is just a semigroup) and many of the historical developments in the theory of semigroups owe much to these two theories. However recent work has highlighted strong connections with, for example, many aspects of theoretical computer science (automata theory, theory of codes and formal language theory) as well as with other areas of mathematics such as the theory of ordered structures and (partial) symmetries.

This is a structured module, partly delivered by self-study and partly by lectures, designed for MMath students in their fourth year.

A semigroup is a non-empty set on which is defined an associative binary operation. Unlike a group, a semigroup needn't contain an identity element nor inverses for each element. For example, the natural numbers N with the operation of addition + is a semigroup as is the set T(X) of all maps from a set X to itself with operation of composition of maps. As another example consider the set of all nxn matrices with real coefficients with the binary operation of matrix multiplication. We already know that matrix multiplication is associative and this set forms a semigroup.

In some respects we can think of a semigroup as an abstraction of a group but on the other hand it is sometimes useful to compare the theory of semigroups with that of rings (the 'multiplicative part' of a ring is just a semigroup) and many of the historical developments in the theory of semigroups owe much to these two theories. However recent work has highlighted strong connections with, for example, many aspects of theoretical computer science (automata theory, theory of codes and formal language theory) as well as with other areas of mathematics such as the theory of ordered structures and (partial) symmetries.

This is a structured module, partly delivered by self-study and partly by lectures, designed for MMath students in their fourth year.

A semigroup is a non-empty set on which is defined an associative binary operation. Unlike a group, a semigroup needn't contain an identity element nor inverses for each element. For example, the natural numbers N with the operation of addition + is a semigroup as is the set T(X) of all maps from a set X to itself with operation of composition of maps. As another example consider the set of all nxn matrices with real coefficients with the binary operation of matrix multiplication. We already know that matrix multiplication is associative and this set forms a semigroup.

In some respects we can think of a semigroup as an abstraction of a group but on the other hand it is sometimes useful to compare the theory of semigroups with that of rings (the 'multiplicative part' of a ring is just a semigroup) and many of the historical developments in the theory of semigroups owe much to these two theories. However recent work has highlighted strong connections with, for example, many aspects of theoretical computer science (automata theory, theory of codes and formal language theory) as well as with other areas of mathematics such as the theory of ordered structures and (partial) symmetries.

This is a structured module, partly delivered by self-study and partly by lectures, designed for MMath students in their fourth year.

A semigroup is a non-empty set on which is defined an associative binary operation. Unlike a group, a semigroup needn't contain an identity element nor inverses for each element. For example, the natural numbers N with the operation of addition + is a semigroup as is the set T(X) of all maps from a set X to itself with operation of composition of maps. As another example consider the set of all nxn matrices with real coefficients with the binary operation of matrix multiplication. We already know that matrix multiplication is associative and this set forms a semigroup.

In some respects we can think of a semigroup as an abstraction of a group but on the other hand it is sometimes useful to compare the theory of semigroups with that of rings (the 'multiplicative part' of a ring is just a semigroup) and many of the historical developments in the theory of semigroups owe much to these two theories. However recent work has highlighted strong connections with, for example, many aspects of theoretical computer science (automata theory, theory of codes and formal language theory) as well as with other areas of mathematics such as the theory of ordered structures and (partial) symmetries.

This is a structured module, partly delivered by self-study and partly by lectures, designed for MMath students in their fourth year.

A semigroup is a non-empty set on which is defined an associative binary operation. Unlike a group, a semigroup needn't contain an identity element nor inverses for each element. For example, the natural numbers N with the operation of addition + is a semigroup as is the set T(X) of all maps from a set X to itself with operation of composition of maps. As another example consider the set of all nxn matrices with real coefficients with the binary operation of matrix multiplication. We already know that matrix multiplication is associative and this set forms a semigroup.

In some respects we can think of a semigroup as an abstraction of a group but on the other hand it is sometimes useful to compare the theory of semigroups with that of rings (the 'multiplicative part' of a ring is just a semigroup) and many of the historical developments in the theory of semigroups owe much to these two theories. However recent work has highlighted strong connections with, for example, many aspects of theoretical computer science (automata theory, theory of codes and formal language theory) as well as with other areas of mathematics such as the theory of ordered structures and (partial) symmetries.

This module is focused on developing the basics of Signals, Control and Communications:
• To introduce the underpinning elements of signal processing.
• To develop an approach to the modelling of dynamic electromechanical and electronic systems
• To introduce the basic concepts and applications of communications.

This module is focused on developing the basics of Signals, Control and Communications:
• To introduce the underpinning elements of signal processing.
• To develop an approach to the modelling of dynamic electromechanical and electronic systems
• To introduce the basic concepts and applications of communications.