Contents & Abstracts, Schedae Informaticae, Issue 11 (2002)

Zbigniew Skolicki, Semigroups and Automata, pp. 11-20

Abstract. We show that identifying formal automata with semigroups is possible not only for finite automata but also for all such automata that we know how to make a catenation of input data, this operation produces another sensible input and we can figure out an empty input.

Full version:

Konrad Kułakowski , Music Grammars. An Analysis of Transitions as a Method of Music Pattern Recognition, pp. 21-40

Abstract. The issue of creating good methods of pattern recognition for discrete music data (e.g. notes) is still very important. The proposed formalism should provide convenient mechanisms for problem definition and solutions. As far as possible it should be based on a well known formal theory, easy to understand and implement. This paper deals with a hybrid, discriminant-syntactic approach to problem of music pattern recognition.

Keywords. Pattern Recognition, Music Grammar, Music Representation.

Full version:

Joanna Kołodziej , A Simple Markov Model and Asymptotic Properties of a Hierarchical Genetic Strategy, pp. 41-56

Abstract. In this paper a Hierarchical Genetic Strategy (HGS) is presented as a family of Markov chains. We apply the Vose's theory to construct a simple mathematical model of HGS. Studying asymptotic properties of HGS and performing some simple experiments we try to verify its efficiency and compare it with other genetic algorithms.

Full version:

Jaroslav E. Poliscuk , Adaptive Machine Reinforcement Learning, pp. 57-74

Abstract. In this article is defined a reinforcement learning method, in which a subject of learning is analyzed. The essence of this method is the selection of activities by a try and fail process and awarding deferred rewards. If an environment is characterized by the Markov property, then step-by-step dynamics will enable forecasting of subsequent conditions and awarding subsequent rewards on the basis of the present known conditions and actions, relatively to the Markov decision making process. The relationship between the present conditions and values and the potential future conditions is defined by the Bellman equation. The article discusses also a method of temporal difference learning, mechanism of eligibility traces, as well as their algorithms TD(0) and TD(Lambda). Theoretical analyses were supplemented by the practical studies, with reference to all implementation of the Sarsa(Lambda) algorithm, with replacing eligibility traces and the Epsilon greedy policy.

Keywords: Algorithm TD(0), algorithm TD(Lambda), Bellman equation, Markov decision making process, mechanism of eligibility traces, method of temporal difference learning, reinforcement learning method.

Full version:

Piotr Kowalczyk, Lech Solarz, Artur P. Terzyk, Piotr A. Gauden, Vladimir M. Gun'ko, Solving the Unstable Linear Fredholm Integral Equation of the First Kind by Means of a New Stochastic Algorithm, pp. 75-97

Abstract. A new adsorption stochastic algorithm (called ASA) is proposed for solving the unstable linear Fredholm integral equation of the first kind. The developed algorithm was applied for the calculation of the pore size distribution of activated carbons from single adsorption isotherms assuming different forms of the kernel (i.e. Dubinin and Radushkevich (DR) and/or Nguyen and Do (ND)) of a linear Fredholm integral equation of the first kind. The results obtained by ASA are compared with obtained applying, developed by Provencher, the advanced regularization CONTIN algorithm, advanced evolutionary algorithm GABI written by Arabas and modified by Kowalczyk, and simple evolutionary algorithm based on the mutation strategy labeled SASA. Additionally, the ASA results obtained by solving the integral equation with the ND kernel are compared with the results obtained by regularization solution of the integral equation with density functional theory (DFT) local isotherms as a kernel. It is shown that the developed ASA algorithm always provides stable and very similar results to the Tikhonov regularization method. Moreover, the ASA computations obtained for the ND local isotherms as a kernel are very similar to the results obtained by the most sophisticated regularization DFT software.

Keywords. Fredholm integral equation of the first kind, optimization methods, genetic algorithms, adsorption, activated carbon

Full version:

Piotr Uhruski , Zdzisław Onderka , The Object Oriented Platform for the Process Migration in the Heterogeneous Networks, pp. 99-114

Abstract. This paper describes the object oriented approach to the design of a task migration platform in a heterogeneous computer network. The load sharing and load balancing problems are discussed. The load sharing  problem consisting of three parts:
an information policy, a location policy and a transfer policy was presented [3]. The migration Software Development Kit (SDK) for an application, which should meet the well defined requirements, is defined. The above mentioned SDK was applied to the example of multiplying the given vector by the given matrix, which is a frequent subproblem in the CAE calculations.

Keywords. Process migration, heterogeneous network, distributed application, object oriented design and programming, Java, CORBA, load sharing,  load balancing.

Full version:

Paweł Hajto , A Neural Economic Time Series Prediction with the Use of a Wavelet Analysis, pp. 115-132

Abstract. In this article a wavelet and artificial neural networks theory is used to predict economic time series in a described computer application. Its predicting capabilities were tested on a USD/PLN average exchange ratio and discussed in this paper. The achieved results are satisfactory. 

Full version:

Romuald Chatłas , On Categories in Cognitive Linguistics - an Alternative to the Classical Categorization, pp. 133-140

Abstract. The general model of pattern recognition is described in order to  expose the role of categorization in the problem of recognition. A new approach to categorization which is based on the category notion proposed in cognitive linguistics is presented. Observations on the potential use of this approach in pattern recognition are made.

Full version: