We present a new technique for verifying correspondences in security proto-cols. In particular, correspondences can be used to formalize authentication. Ourtechnique is fully automatic, it can handle an unbounded number of sessions of theprotocol, and it is efficient in practice. It significantly extends a previous techniquefor the verification of secrecy. The protocol is repres...

We report on an implemented grapheme to phoneme conversion architecture Given a set of examples spelling words with their associated phonetic represen tation in a language a grapheme to phoneme conversion system is automatically produced for that language which takes as its input the spelling of words and pro duces as its output the phonetic transcription according to the rules implicit in the ...

Measures for the width of a periodic function are discussed, based on five different mappings of a (periodic) function on a circle to a (non–periodic) function on a line or line segment. The uncertainty relations corresponding to these measures are also obtained by using a generalization of the Cauchy–Schwarz inequality.

The Machine Learning Toolbox contains a set of ten Machine Learning algo rithms integrated with a common interface and common knowledge represen tation language An essential component of the Toolbox is the Consultant a knowledge based system that advises novice users about which algorithm they could use for a particular application We show how the Consultant s architecture evolved through its s...

We present a rst order logic of time chance and probability that is capable of expressing the relation between subjective probability and objective chance at di erent times Us ing this capability we show how the logic can distinguish between causal and evidential correlation by distinguishing between condi tions events and actions that in uence the agent s belief in chance and the agent believe...

We survey the basic theory of the strengthened Cauchy-Buniakowskii-Schwarz inequality and its applications in multilevel methods for the solution of linear systems arising from nite element or nite diierence discretisation of elliptic partial diierential equations. Proofs are given both in a nite element context, and in purely algebraic form.