Digraphs Definition for an Array Maintenance Problem

In this paper we present a data structure which improves the average complexity of the operations of updating and a certain type of retrieving information on an array. The data structure is devised from a particular family of digraphs verifying conditions so that they represent solutions for this problem.

An Effective Method for Constructing Data Structures Solving an Array Maintenance Problem

In this paper a constructive method of data structures solving an array maintenance problem is offered. These data structures are defined in terms of a family of digraphs which have previously been defined, representing solutions for this problem. We present as well a prototype of the method in Haskell.

Синтез Нейронных Сетей на Основе Информационных Гранул

Предлагается функциональная модель коммутационного элемента нейронной сети (информационной гранулы).

Поиск Общих Принципов Формализации в Теоретических и Прикладных Исследованиях

Обсуждается подход к формализации в различных предметных областях, сопровождающийся использованием качественно отличных логик на разных уровнях дискретизации процессов.

Comparative Analysis of Viscoelastic Models Involving Fractional Derivatives of Different Orders

Mathematics Subject Classification: 74D05, 26A33