Contents & Abstracts, Schedae Informaticae, Issue 15 (2006)

Adam Juliusz Kleiner , Enhancement to Lohner's Enclosures for Verified Trajectory Tracing in Dynamical Systems, pp. 9-28.

Abstract.  The paper presents some improvements of the Lohner's algorithm for the rigorous enclosure of trajectories of an ODE.

Keywords. enclosure, wrapping effect, interval arithmetic, affine arithmetic, verified computation, rigorous computation, initial value problem, ordinary differential equation, semidynamical system, vic (here introduced).

Full version:

Jacek Gruszczyński , A Limit Theorem for the System of  Leaky Buckets, pp. 29-39.

Abstract.   The sequence of systems of m leaky buckets and one multiplexer is considered. It turns out that the states of the buffers for tokens and the state of the buffer of the multiplexer satisfy differential equations in the limit as the size of the cells of the data and the value of the tokens tend to zero. The results are compared with the equations proposed by N.U. Ahmed and K.L. Teo.

Keywords. leaky bucket scheme, token buffer, multiplexer, jumping system, continuous system, approximation.

Full version:

Piotr Oprocha , Fast Solutions for DNA Code Words Test, pp. 41-54.

Abstract.  An essential part of any DNA computation is to encode data on DNA strands. Performing such computation we must be sure that no undesirable hybridization will occur. The aim of this paper is to present algorithms which can test if a given set of code words satisfies certain coding and involutory properties, as it is necessary to prevent undesirable DNA strands interactions. These algorithms are based on the theory of codes and pattern matching methods. If we denote by m sum of the lengths of words in a given set, then all presented algorithms can be realized with O(m²) complexity both for time and space.

Keywords. DNA, strings properties, code, complexity, algorithms.

Full version:

Joël Quinqueton , Adorjan Kiss , Uniscript: A Model for Emergent Memory, pp.  55-72.

Abstract.  In this paper we argue that mind is emerging. First we present a Knowledge Representation Model whose aim is to record in a clever way the 'facts and events' of a user. The main features of our model are:
    (1) Personal knowledge: no bottleneck, responsibility for validity. 
    (2) Persistent storage: forces to record truths that are not supposed to change. 
    (3) Instance-driven: knowledge units may exist even without classification or explicit rules to handle them.
    (4) Unicity-oriented: knowledge is composed of atomic pieces the existence of which is not supposed to be debatable.
We show in what way it can be considered as an emergent organisation of memory, and then briefly discuss its application to training in the ELeGI EEC project (European Learning Grid Infrastructure).

Full version:

Tomasz Peszek , Neuro – Fuzzy Prediction Systems in Energetics, pp. 73-94.

Abstract.  The paper concentrates on problems of short term electrical load forecasts. It focuses on application of hybrid systems based on neuro-fuzzy components for making such predictions. Subsequently basic concepts concerning modelling of such systems and examples of working solutions are introduced. Finally the method and the system created by the author is presented and discussed. 

Keywords. Artificial intelligence, hybrid systems, energy forecasts, energetics.

Full version:

Adam Roman , Merging States and Synchronization Problem, pp. 95-108.

Abstract.   In this paper we introduce the notion of merging states and merging systems and we use it for the classification of finite deterministic automata without initial and final states. We investigate the dependencies between the structure of an automaton described by merging systems and maximal lengths of minimal synchronizing words for automata which structures belong to the given class of merging systems. Numerical results for certain classes of automata are presented. We also give some properties of merging systems themselves. The work is motivated by the famous, unsolved Černý Conjecture. The aim of this paper is to propose the use of merging systems in the research on the Conjecture. 

Keywords. synchronization, Černý Conjecture, merging states.

Full version:

Călin Şandru , Viorel Negru , Validating UPML Concepts in a Multi-Agent Architecture, pp. 109-126.

Abstract.  The task oriented reasoning represents a powerful design paradigm. This research starts from a representative research in the area, the Unified Problem-Solving Method Development Language (UPML), and proposes a multi-agent architecture to support this approach. The paper first models an applicative program, solving non-linear equation systems, using UPML concepts and then instantiates the proposed generic multi-agent architecture in order to generate a multi-agent system to solve the proposed problem.

Keywords. multi-agent systems, problem solving methods, task oriented reasoning, knowledge based systems, non-linear equation systems.

Full version:

Carlos Cotta , From Genes to Memes: Optimization by Problem-Aware Evolutionary Algorithms, pp. 127-150.

Abstract.  Memetic algorithms are population-based metaheuristics aimed to solve hard optimization problems. These techniques are explicitly concerned with exploiting available knowledge in order to achieve the most effective resolution of the target problem. The rationale behind this optimization philosophy, namely the intrinsic theoretical limitations of problem-unaware optimization techniques, is presented in this work. A glimpse of the main features of memetic algorithms, and a brief overview of the numerous applications of these techniques is provided as well.

Keywords. evolutionary computation, memetic algorithms, optimization.

Full version:

Abstract.  In the paper we consider cellular automata defined on metric spaces (A^N, d) or (A^Z, d) endowed with the uniform Bernoulli measure μ and present general constructions of such automata which are surjective, not positively expansive and μ is the measure of the maximal and positive entropy.

Keywords. infinite word, uniform Bernoulli measure, surjective cellular automata, entropy, dynamical system.

Full version:

Abstract.  This paper presents a new approach to design floor-layouts with the use of computer. This approach is based on a special type of data structure in the form of a hierarchical hypergraph. This data structure describes the whole class of designs with fuzzy interpretation. 

Full version:

Abstract.  This paper presents new models for all recursive enumerable languages. These models are based on multigenerative grammar systems that simultaneously generate several strings in a parallel way. The components of these models are context-free grammars, working in a leftmost way. The rewritten nonterminals are determined by a finite set of nonterminal sequences.

Keywords. Grammar system, context-free grammar, leftmost derivation.

Full version: