## Volume 1, No. 1, 2006

- Congratulations from Lotfi A. Zadeh
- From Editorial Board

#### Articles

- Molodsov D.A., Leonov V.Y., Kovkov D.V.

**«Soft Sets Theory and Applications»**

Basic concepts of soft sets theory, their relation with Zadeh's fuzzy sets, and properties of soft mappings are considered. A soft set is defined as a family of approximate descriptions of an object. Application of soft sets to the problem of portfolio management is presented.Resources: elibrary.ru.

- Wagenknecht M., Sokolov A.Y.

**«Chaotic Dynamics in Fuzzy Recurring Models»**

In the paper fuzzy recurring models are analyzed as systems with nonlinear transition function. Analysis of transition function for its relation with chaotic dynamics is carried out for some fuzzy systems.Resources: elibrary.ru.

- Tulupyev A.L.

**«Acyclic algebraical Bayesian networks: Probabilistic Logic Inference»**

In the paper algebraical Bayesian networks (ABN) are defined as join graphs where every node holds a conjunctions ideal with their point- or interval-valued estimates of truth probability. Acyclic ABN (AABN) are defined as join trees. The conjuctions ideal with probabilistic estimates is a mathematical model of*knowledge pattern*with probabilistic uncertainty; ABN and AABN are one of the models of*knowledge patterns bases with uncertainty*which supports reconciliation,*a priori*and*a posteriori*inference. Schemes and features of several types of inference for AABN and its components are considered. Use of the language of matrices made statements of some facts more exact and condensed.Resources: elibrary.ru.

- Red'ko V.G., Tsoy Y.R.

**«Efficiency of Evolutionary Search in Quasispecies Model»**

Efficiency of the evolutionary search in M. Eigen's quasispecies model is estimated. Simple analytical formulas for the evolution rate and the total number of fitness function calculations are obtained. Analytical estimations are proved by computer simulations. It is shown that for the case of unimodal fitness function of binary strings with length N, the optimal string can be found during N generations under condition that the total number of fitness function calculations is of the order of N^2.Resources: elibrary.ru.

- Chernishev V., Chizhov Y., Kuleshova G., Borisov A.

**«Investigation of algorithms for goal-based agent control using evolutionary computation»**

The aim of this paper is to study properties of genetic programming algorithm and perform a comparative analysis with Elman neural network using agent control task in a cellular world. In order to solve this task, two programmes have been created: the first implements genetic programming algorithm and the second implements Elman neural network. These programmes are developed in Borland Delphi environment using Object-Pascal programming language. In the paper each method is analysed separately and their comparative analysis is performed.Resources: elibrary.ru.

#### Information Bulletin