The \Boom hierarchy" is a hierarchy of types that begins at the level of trees and includes lists, bags and sets. This hierarchy forms the basis for the calculus of total functions developed by Bird and Meertens, and which has become known as the \Bird-Meertens formalism". This paper describes a hierarchy of types that logically precedes the Boom hierarchy. We show how the basic operators of th...

The way we represent intentions, behaviors, and the spatial context, is crucial for any approach to mobile intention recognition. Formal grammars are cognitively comprehensible and make expressiveness properties explicit. By adding spatial domain knowledge to a grammar we can reduce parsing ambiguities. We argue that there are a number of mobile intention recognition problems which require the ...

in this paper, using the tight-binding model, we extend the real-space renormalization group method to time-dependent hamiltonians. we drive the time-dependent recursion relations for the renormalized tight-binding hamiltonian by decimating selective sites of lattice iteratively. the formalism is then used for the calculation of the local density of electronic states for a one dimensional quant...

We compare the Pegg-Barnett (PB) formalism with the covariant phase observable approach to the problem of quantum phase and show that PB-formalism gives essentially the same results as the canonical (covariant) phase observable. We also show that PB-formalism can be extended to cover all covariant phase observables including the covariant phase observable arising from the angle margin of the Hu...

In this work, we determined the analytical expressions of the form factor of a cubical particle in the WKB approximation. We adapted some variables (size parameter, refractive index, the scattering angle) and found the form factor in the approximation of Rayleigh-Gans-Debye (RGD), Anomalous Diffraction (AD), and determined the efficiency factor of the extinction. Finally, to illustrate our form...

By treating dialogues as abstract games, we are able to develop a logic-based formalism for modeling of dialogues between intelligent and autonomous software agents. Complex dialogues, including dialogues embedded in one another, can be represented in the formalism as sequences of moves in a combination of dialogue games. We show that our formalism can represent the different types of dialogue ...

A formalism is presented for modelling the evolutionary dynamics of a population of gene sequences. The formalism was originally developed for describing genetic algorithms. In this paper the formalism is elaborated by considering the evolution of an ensemble of populations. This allows the evolution to be modelled more accurately. To illustrate the formalism the problem of a population of gene...

In this paper, two methods are described, by means of which it is possible to calculate the non rigid group of molecules consisting of a number of XH3 groups attached to a rigid framework. The first method is a combination of the wreath product formalism of Balasubramanian and modern computer algebra and the second method is a computational approach by using group theory package GAP. We apply t...