Below are the summer schools and workshops sponsored by MathFIT during 1996-97. Text is included to give a flavour of some of the events.
Text processing, pattern matching and compression
"A current trend in computing is the interconnection of computers into a global network. The utility and efficiency of such a network is critically dependent on the techniques available within this environment. Typical of the topics arising are compression and coding in information retrieval systems, string-matching with errors, pattern-matching in digitised images, document analysis, information retrieval from hypertext and parallel algorithms for string matching."
Contact: Professor Mike Paterson, University of Warwick
Date: 15-20 December 1996
Methods and algorithms for radio channel assignment
"In recent years, the demand from new technologies for the radio spectrum has resulted in a state of severe spectral congestion. Not only the operators of radio services, but also the agencies responsible for spectrum management, are increasingly interested in using the spectrum more efficiently. Advances in radio channel assignment lead to more intensive use of the spectrum, without unacceptable interference. Channel assignment problems have natural formulations in terms of mathematical programming and extensions of graph colouring. The detailed analysis possible for some problems motivates new algorithms in more general cases."
Contact: Dr Robert Leese, University of Oxford Date: 8-10 April 1997
Models and algorithms for planning and scheduling problems
Contact: Dr Celia Glass, University of Southampton
Date: 7-11 April 1997
The art and science of Bayesian image analysis
Contact: Professor Kanti Mardia, University of Leeds
Date: 30 June - 2 July 1997
Games and computation
"The use of games to model various aspects of computation has been notably successful over the past few years. The basic idea is that one models interaction between a System and its Environment as a two-person game; a winning strategy for such a game will correspond to a proof of a behavioural property, or to a process which is correct with respect to some specification. In particular two areas where there has been rapid progress recently are: game semantics and its applications to programming languages and logic and the use of games in verifying properties of concurrent processes. Game semantics has been used to give the first syntax-independent constructions of fully abstract models for functional languages such as PCF and FPC, in both call-by-name and call-by-value versions, for imperative languages such as Idealized Algol, and for languages with non-local control operators such as call-cc. There are promising applications to object-oriented languages in progress. In the area of concurrency, games have been used to explicate bisimulation and proof-search in the modal mu-calculus, and have resulted in improvements to the efficiency of the implementation."
Contact: Professor Samson Abramsky, University of Edinburgh
Date: July 1997
Computational number theory
"With the advent of the Internet, the security of information is now a major concern. In order that security might be achieved, public-key cryptographic schemes are continually being developed and most of these schemes rely on results, methods and techniques from computational number theory for their construction and also for their security."
Contact: Dr Nigel Smart, University of Kent
Date: 14-16 July 1997
New paradigms for computation on classical spaces
"Abbas Edalat recently showed how Borel measures on a classical (locally compact) space could be embedded in the space of valuations on a certain domain. Since valuations enjoy a rich order-theoretic structure it became possible to define new approximations to Borel measures. This gives an essentially classical, i.e., Riemannian, approach to integration over measures, and a new approach to computation with arbitrary precision real numbers (as opposed to the floating point representation). In mathematics, this theory has been applied to a number of classical problems, the most prominent of which is the theory of Iterated Function Systems where new results on the existence and uniqueness of fractal measures have been obtained. Fractal measures which occur in this context are notoriously hard to integrate over. With the new approach these measures can be approximated order-theoretically and a general technique for integration over them has become available. In Computer Science, the new approaches have shown how to compute physical constants in a class of neural nets as well as in certain Ising models in statistical physics, and are being extended to include application areas which feature real numbers and/or integration in an essential way."
Contact: Professor Achim Jung, University of Birmingham
Date: 8-10 September 1997
|Return to MathFIT Past Events.|