To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
In this paper, we present Reo, which forms a paradigm for composition of software components based on the notion of mobile channels. Reo is a channel-based exogenous coordination model in which complex coordinators, called connectors, are compositionally built out of simpler ones. The simplest connectors in Reo are a set of channels with well-defined behaviour supplied by users. Reo can be used as a language for coordination of concurrent processes, or as a ‘glue language’ for compositional construction of connectors that orchestrate component instances in a component-based system. The emphasis in Reo is just on connectors and their composition, and not on the entities that connect to, communicate and cooperate through these connectors. Each connector in Reo imposes a specific coordination pattern on the entities (for example, components) that perform I/O operations through that connector, without the knowledge of those entities. Channel composition in Reo is a very powerful mechanism for construction of connectors. We demonstrate the expressive power of connector composition in Reo through a number of examples. We show that exogenous coordination patterns that can be expressed as (meta-level) regular expressions over I/O operations can be composed in Reo out of a small set of only five primitive channel types.
This Special Issue of Mathematical Structures in Computer Science contains selected papers from ConCoord, the International Workshop on Concurrency and Coordination held in Lipari, Italy, on July 6–8, 2001 and associated to the 13th Lipari School for Computer Science Researchers on the Foundations of Wide Area Network Programming.
This paper describes the design and semantics of METAKLAIM, which is a higher order distributed process calculus equipped with staging mechanisms. METAKLAIM integrates METAML (an extension of SML for multi-stage programming) and KLAIM (a Kernel Language for Agents Interaction and Mobility), to permit interleaving of meta-programming activities (such as assembly and linking of code fragments), dynamic checking of security policies at administrative boundaries and ‘traditional’ computational activities on a wide area network (such as remote communication and code mobility). METAKLAIM exploits a powerful type system (including polymorphic types á la system F) to deal with highly parameterised mobile components and to enforce security policies dynamically: types are metadata that are extracted from code at run-time and are used to express trustiness guarantees. The dynamic type checking ensures that the trustiness guarantees of wide area network applications are maintained whenever computations interoperate with potentially untrusted components.
This paper presents the control system of a chess-playing robot developed by the Research Institute of Robots at the Shanghai Jiaotong University. Thanks to the Windows NT operation system and the RTX (Real-Time eXtension), the whole system can achieve good real-time performance. The control system, which is supported by a standard PC hardware platform and a modularized structure of system software, is open-ended and easily expansible.
In this chapter we investigate the use of fractal geometry for segmenting digital signals and images. A method of texture segmentation is introduced that is based on the fractal dimension. Using this approach, variations in texture across a signal or image can be characterized in terms of variations in the fractal dimension. By analysing the spatial fluctuations in-fractal dimension obtained using a conventional moving-window approach, a digital signal or image can be texture segmented; this is the principle of fractal-dimension segmentation (FDS). In this book, we apply this form of texture segmentation to isolated speech signals.
An overview of methods for computing the fractal dimension is presented, focusing on an approach that makes use of the characteristic power spectral density function (PSDF) of a random scaling fractal (RSF) signal. A more general model for the PSDF of a stochastic signal is then introduced and discussed with reference to texture segmentation.
We shall apply fractal-dimension segmentation to a number of different speech signals and discuss the results for isolated words and the components (e.g. fricatives) from which these words are composed. In particular, it will be shown that by pre-filtering speech signals with a low-pass filter of the form 1/k, they can be classified into fractal dimensions that lie within the correct range, i.e. [1, 2]. This provides confidence in the approach to speech segmentation considered in this book and, in principle, allows a template-matching scheme to be designed that is based exclusively on FDS.
This paper deseribes the control of multi-arm co-operating manipulator systems handling a common object. Inverse dynamics controllers with motive force compensation are developed for the co-operating fixed-base, free-floating, and free-flying space manipulator systems. Further, the relative performances of all the three configurations are compared on two tracking problems.
This paper deals with the design and development of a new perception system for controlling a set of ultrasonic transducers working at two different frequencies generated by a digital signal processor (DSP). Data gathering speed is increased by the simultaneous firing of sonars without crosstalk problems. The software and hardware implementation are presented as well as the results from the calibration process and the integration on board the mobile robot RAM-2. Finally, a demonstration of the use of the proposed equipment to wall-following via a fuzzy controller is described.
The choice of suitable high-level communication primitives for wide area network programming languages remains an open problem. This paper is driven by the practical consideration of providing an efficient and secure communication infrastructure for mobile agent systems. This has led us to formalise the Lime coordination middleware and propose a simplified model, which we call CoreLime, that addresses some of the main shortcomings of Lime while retaining its distinguishing feature, namely transient sharing of tuple spaces. We further discuss a prototype implementation along with security extensions. Our contribution is thus an exploration of the language design space rather than a theoretical investigation of properties of these models.
Vision-aided flexible link robot positoning using the Camera Space Manipulation (CSM) method is developed. The primary motivation for this work is to use an autonomous vision-aided robotic system to pick-up and accurately move a flexible object that it encounters. The work consists of analytical and experimental investigation of the performance of CSM for a kinematic model of the PUMA manipulator with a flexible structure at the wrist which accounts for the gravitation. Trade-offs between camera view parameters and axial deflection model parameters were investigated. View parameter reestimation and maneuvering resulted a very accurate placement of the end-effector at the target.
Modern information security manifests itself in many ways, according to the situation and its requirements. It deals with such concepts as confidentiality, data integrity, access control, identification, authentication and authorization. Practical applications, closely related to information security, are private messaging, electronic money, online services and many others.
Cryptography is the study of mathematical techniques related to aspects of information security. The word is derived from the Greek kryptos, meaning hidden. Cryptography is closely related to the disciplines of cryptanalysis and cryptology. In simple words, cryptanalysis is the art of breaking cryptosystems, i.e. retrieving the original message without knowing the proper key or forging an electronic signature. Cryptology is the mathematics, such as number theory, and the application of formulas and algorithms that underpin cryptography and cryptanalysis.
Cryptology is a branch of mathematical science describing an ideal world. It is the only instrument that allows the application of strict mathematical methods to design a cryptosystem and estimate its theoretical security. However, real security deals with complex systems involving human beings from the real world. Mathematical strength in a cryptographic algorithm is a necessary but not sufficient requirement for a system to be acceptably secure.
Moreover, in the ideal mathematical world, the cryptographic security of an object can be checked only by means of proving its resistance to various kinds of known attack. Practical security does not imply that the system is secure: other, unknown, types of attack may occur.
Speech is and will remain perhaps the most desirable medium of communication between humans. There are several ways of characterizing the communications potential of speech. One highly quantitative approach is in terms of information theory. According to information theory, speech can be represented in terms of its message content, or information. An alternative way of characterizing speech is in terms of the signal carrying the message information, that is the acoustic waveform [1].
The widespread application of speech processing technology required that touchtone telephones be readily available. The first touch-tone (dual-tone multifrequency, DTMF) telephone was demonstrated at Bell Laboratories in 1958, and deployment in the business and consumer world started in the early 1960s. Since DTMF service was introduced to the commercial and consumer world less than 40 years ago, it can be seen that voice processing has a relatively short history.
Research in speech processing by computer has traditionally been focused on a number of somewhat separable, but overlapping, problem areas. One of these is isolated word recognition, where the signal to be recognized consists of a single word or phrase, delimited by silence, to be identified as a unit without characterization of its internal structure. For this kind of problem, certain traditional pattern recognition techniques can be applied directly.
The computational background to digital signal processing (DSP) involves a number of techniques of numerical analysis. Those techniques which are of particular value are:
solutions to linear systems of equations
finite difference analysis
numerical integration
A large number of DSP algorithms can be written in terms of a matrix equation or a set of matrix equations. Hence, computational methods in linear algebra are an important aspect of the subject. Many DSP algorithms can be classified in terms of a digital filter. Two important classes of digital filter are used in DSP, as follows.
Convolution filters are nonrecursive filters. They use linear processes that operate on the data directly.
Fourier filters operate on data obtained by computing the discrete Fourier transform of a signal. This is accomplished using the fast Fourier transform algorithm.
Digital filters
Digital filters fall into two main categories:
real-space filters
Fourier-space filters
Real-space filters Real-space filters are based on some form of ‘moving window’ principle. A sample of data from a given element of the signal is processed giving (typically) a single output value. The window is then moved on to the next element of the signal and the process repeated. A common real-space filter is the finite impulse response (FIR) filter.
The benefits of using ontologies have been recognised in many areas such as knowledge and content management, electronic commerce and recently the emerging field of the Semantic Web. These new applications can be seen as a great success of research in ontologies. On the other hand, moving into real application comes with new challenges that need to be addressed on a principled level rather than for specific applications. This special issue will be devoted to less well-explored topics that have come into focus recently as a response to the new problems we face when trying to use ontologies in heterogeneous distributed environments. These environments include the use of ontologies in peer-to-peer and pervasive computing systems.