Документ взят из кэша поисковой машины. Адрес оригинального документа : http://www.intsys.msu.ru/en/magazine/archive/v16(1-4)/
Дата изменения: Unknown
Дата индексирования: Thu Feb 27 22:32:12 2014
Кодировка: Windows-1251
Intelligent Systems :: Magazine :: Web archive :: Volume 16, issue 1-4, 2012
Русская версия этой страницы
To the Start Page
The Chair of Mathematical Theory of Intelligent Systems and
Laboratory of Problems of Theoretical Cybernetics
of Moscow State University Official Website
To the Start Page News MaTIS Chair Staff Science Teaching Research Magazine Culture Full-text Search
 Web archive Magazine archive: electronic versions of last magazine issues in PDF format

Contents of magazine "Intelligent systems"
Volume 16, issue 1-4, 2012

Part 1. General problens of Intelligent systems theory

  • Абросимов В.К., Демидов Р.С.. Информационный ландшафт организации (in Russian).

    New concepts needed for the analysis of selection and implementation information systems effectiveness - the information landscape, the compatibility and the consistency, the necessity and sufficiency of information resource have introduced and discuss. It is shown that with its sharing it is easy and methodically reasonably to choose the most effective and potentially demanded for business information system from a group of such systems with different characteristics
    Keywords: information system, information resource, selection, implementation efficiency, landscape
  • Лебедев А.А.. Синтез операторов агрегирования информации по экспертным описаниям (in Russian).

    The problem of selecting an aggregation function, a function describing the behaviour of one element of a system relative to others, is omnipresent in developing information gathering and analysis systems. In this paper, we develop an approach to describe k-valued logic functions by fuzzy constraints. We prove that the general problem of defining a function by fuzzy constraints is NP-complete and also provide polynomial algorithms solving the problem in several special cases.
    Keywords: selecting aggregation functions, fuzzy constraints
  • Топровер Г.Л., Киселев С.Л.. Имитационная модель компьютерного анализа фактов (in Russian).

    The article presents a simulation-driven formal model for computer-aided facts analysis based on the pattern recognition theory methods.
    Keywords: knowledge management, factology, factography, facts analysis
  • Чмырь И.А.. Естественный диалог: моделирование диалоговой транзакции в контексте представления знаний (in Russian).

    The paper deals with an investigation and modeling of dialogue and dialogue transactions. An ontological model of human dialogue interaction, underlying follow-up reasoning, is obtained on the basis of analysis of human-human dialogues and illustrated by one of Plato's dialogue Protagoras. In the sequel, attention is focused on one type of human-human dialogues, called erotetic dialogue and on the structure of erotetic dialogue transaction from the viewpoint of knowledge interchange within the transaction. A spectrum of formal models, oriented towards discovering the inner logical structure of erotetic transaction is offered. The distinguishing feature of all models is their orientation on language-independent entities representing declarative knowledge associated with a transaction's elements.
    Keywords: ontological dialogue model, erotetic dialogue, dialogue transaction, declarative knowledge, Language of Ternary Description

Part 2. Special questions of Intelligent systems theory

Part 3. Mathematical models

  • Бокк Н.Г.. О порядке элемента в группе автоматных подстановок (in Russian).

    We build a group automaton of 2n order for each natural n. We also introduce a criterion of order definition for automata with Abelian intrinsic groups by group generators. Finally we show that such criterion is impossible in general case.
    Keywords: automaton permutations, group automata, intrinsic semigroup, automaton order
  • Ишматова Ю.А.. О некоторых свойствах групп алгебр с параметрами (in Russian).

    Groups of algebras with parameters are the main object of cryptographic standards of Uzbekistan. We investigate a number of cryptographically essential properties of such groups. We prove reversibility criterion, evaluate group order and show correspondence of exponentiation with parameter and exponentiation in residue rings.
    Keywords: algerbas with parameters, cryptographic standards, exponentiation
  • Перпер Е.М.. О функциональной сложности поиска подстроки (in Russian).

    The paper deals with the problem of search subwords in set of words. This problem is as follows: suppose we are given a set of words; in this set for an arbitrary subword we must find words which contain this subword. In this paper, three algorithms of search are developed and, with them, estimates of the functional complexity of search are obtained.
    Keywords: word, subword, search, information graph, complexity, volume
  • Пивоваров А.П.. Об одном способе получения нижних оценок сложности информационных графов (in Russian).

    This paper contains one method for obtaining of lower bounds for complexity of information graphs of different types (in average and in the worst case). For this purpose the notion of general information graph is introduced. This notion covers the majority of information graph modifications. The notion of general information graph acceptability for a output function is introduced. The estimates obtained for some general information graph depend on the codomain cardinality of the output function.
    Keywords: general information graph, lower bound for complexity, search modelling
  • Родин А.А.. О континуальности множества специальных предполных классов во множестве автоматных отображений (in Russian).

    Let D be a closed class in k-valued logic. Denote by P(D) the set of deterministic finite functions having k-valued function from D in every state. It is shown in the article, that there exists continuum of precomplete classes C such that C includes P(D).
    Keywords: automata mappings, precomplete class, K-valued logic
  • Соколов А.П.. О сложности перестройки формальных нейронов (in Russian).

    Problems of neurons learning complexity are considered in this paper. Threshold function act as mathemetical model of neuron. Following problem is being studied: what is the complexity of mutual reconstruction (learning) of pairs of threshold functions in the worst case, in most cases and inside sets of threshold functions that are invariant by groups of permutations. Threshold functions are defined by means of linear forms with integer coefficients. Number of elementary operations over weight coefficients of the linear form is the measure of complexity of mutual reconstruction of threshold functions. Set of upper and lower bounds for complexity of mutual reconstruction of formal neurons for various cases was found. It was developed an algorithm for reconstruction of given formal neuron to the desired one. Time complexity of this algorithm was estimated.
    Keywords: threshold functions, learning complexity of neural networks
   ї 2001-2013. The Chair of Mathematical Theory of Intelligent Systems, Laboratory of Problems of Theoretical Cybernetics
XWare
 Full-text search
 
Only exact word forms      Give up to search results per page
Rambler's Top100 Рейтинг@Mail.ru