In this paper, we relate two of the most well developed approaches to agent-oriented programming, namely, BDI (Belief-Desire-Intention) style programming and “Golog-like” high-level programming. In particular, we show how “Golog-like” programming languages can be used to develop BDI-style agent systems. The contribution of this paper is twofold. First, it demonstrates how practical agent system...

Modern processor architectures, in addition to having still more cores, also require still more consideration to memory-layout in order to run at full capacity. The usefulness of most languages is deprecating as their abstractions, structures or objects are hard to map onto modern processorions, structures or objects are hard to map onto modern processor architectures efficiently. The work in t...

Modern high-level programming languages often contain constructs whose semantics are non-trivial. In practice however, software developers generally restrict the use of such constructs to settings in which their semantics is simple (programmers use language constructs in ways they understand and can reason about). As a result, when developing tools for analyzing and manipulating software, a dis...

Computer-aided font design is still a very tedious and repetitive task. New font models and new functionalities presented by digital media further require a new method for design of font families and dynamic variable fonts. Current design paradigms are either outline based, offering low level operations, or parametric but non-visual programming. Parametric feature based design helps in creating...

This paper deals with the dynamic semantics of a new proposed formalism, called Object Oriented High Level Petri Nets (OOHLPN). In the first part of the paper, the formal definition of OOHLPN is briefly introduced, and an example of using OOHLPN is provided. The second part of the paper presents the dynamic semantics of OOHLPN. First, the semantics of Extended High Level Petri Nets with Objects...

In the present paper we consider the statistic “number of udu’s” in Dyck paths. The enumeration of Dyck paths according to semilength and various other parameters has been studied in several papers. However, the statistic “number of udu’s” has been considered only recently. Let Dn denote the set of Dyck paths of semilength n and let Tn, k, Ln, k, Hn, k and W (r) n, k denote the number of Dyck p...

We present a general trace query language which is a solution to the ever growing command sets of other tracers. It provides all the required generality while being very simple and eecient. We model a program execution into a trace which is a stream of events. Execution events have a uniform representation, and can be analysed by Prolog programs. With this approach and thanks to the expressive ...

High-level control of parallel process behaviour simplifies the development of parallel software substantially by freeing the programmer from low-level process management and coordination details. The latter are handled by a sophisticated runtime system which controls program execution. In this paper we look behind the scenes and show how the enormous gap between high-level parallel language co...

Automatic Speaker Recognition systems have been largely dominated by acoustic-spectral based systems, relying in proper modelling of the short-term vocal tract of speakers. However, there is scientific and intuitive evidence that speaker specific information is embedded in the speech signal in multiple shortand long-term characteristics. In this work, a multilevel speaker recognition system com...