Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

DEVICE MORPHISMS IN MARKOV NETWORK. Part 2

View through CrossRef
The results of inclusion of the algorithm and Markov network with abnormal inference of a large correlator in the сNnet-scheme are presented. A new Markov network scheme is synthesized, in which the large correlator is assigned the role of a device detecting coincidences in words and compositions of interacting words – categories obtained as a result of processing input data samples from many sources of such. This new network scheme is developed for processing input data samples from organizational systems to classify the interactions of words denoting objects of these systems with some useful purpose. The main scientific goal of the study has been achieved: a method for introducing known classifiers, which are not formally considered to be constructed using the Markov algorithm, into the Markov network with abnormal inference has been substantiated and synthesized. The problem of research on the synthesis of morphisms of a large correlator in the сNnet-scheme of the Markov algorithm is solved. An additional contribution is made to solving a larger scientific problem: synthesizing a complete list of morphisms for Markov algorithms and networks. Practical examples of implementing Brouwer creativity in the control channel and by manipulating input data are considered. An additional source type associator typeн is introduced into the сNnet-scheme of the Markov algorithm, which specifies a specific method for processing input data samples for individual schemes that make up the network. In the Markov network with abnormal inference, the commands of the large correlator Dcorb for its processor Пcorb are defined. Associators of sources of a special type for controlling the large correlator are introduced into consideration and investigated. A formula of the Markov network with abnormal inference with an integrated large correlator is synthesized, it is shown that it must be developed to determine the result of executing the commands of the control channel. It was concluded that morphisms of a large correlator were synthesized and included in the сNnet-scheme of the algorithm and the Markov network of indirect propagation, which made it possible to determine the method for introducing known classifiers into it.
Title: DEVICE MORPHISMS IN MARKOV NETWORK. Part 2
Description:
The results of inclusion of the algorithm and Markov network with abnormal inference of a large correlator in the сNnet-scheme are presented.
A new Markov network scheme is synthesized, in which the large correlator is assigned the role of a device detecting coincidences in words and compositions of interacting words – categories obtained as a result of processing input data samples from many sources of such.
This new network scheme is developed for processing input data samples from organizational systems to classify the interactions of words denoting objects of these systems with some useful purpose.
The main scientific goal of the study has been achieved: a method for introducing known classifiers, which are not formally considered to be constructed using the Markov algorithm, into the Markov network with abnormal inference has been substantiated and synthesized.
The problem of research on the synthesis of morphisms of a large correlator in the сNnet-scheme of the Markov algorithm is solved.
An additional contribution is made to solving a larger scientific problem: synthesizing a complete list of morphisms for Markov algorithms and networks.
Practical examples of implementing Brouwer creativity in the control channel and by manipulating input data are considered.
An additional source type associator typeн is introduced into the сNnet-scheme of the Markov algorithm, which specifies a specific method for processing input data samples for individual schemes that make up the network.
In the Markov network with abnormal inference, the commands of the large correlator Dcorb for its processor Пcorb are defined.
Associators of sources of a special type for controlling the large correlator are introduced into consideration and investigated.
A formula of the Markov network with abnormal inference with an integrated large correlator is synthesized, it is shown that it must be developed to determine the result of executing the commands of the control channel.
It was concluded that morphisms of a large correlator were synthesized and included in the сNnet-scheme of the algorithm and the Markov network of indirect propagation, which made it possible to determine the method for introducing known classifiers into it.

Related Results

MULTILAYER MARKOV NETWORKS WITH ABNORMAL INFERENCE
MULTILAYER MARKOV NETWORKS WITH ABNORMAL INFERENCE
The study is devoted to multilayer Markov networks are not direct output, introduced into scientific circulation in the theory of Markov algorithms. These networks are synthesized ...
DEVICE MORPHISMS IN MARKOV NETWORK. Part 1
DEVICE MORPHISMS IN MARKOV NETWORK. Part 1
The article presents the results of introducing objects – device processors designated by words – into the categorical and network сNnet-scheme of the Markov algorithm and the synt...
MARKOV NETWORK MODEL
MARKOV NETWORK MODEL
Markov networks synthesized from the N-scheme of the Markov algorithm, developed to replace his well-known y-scheme, are studied theoretically from the standpoint of theories of al...
cNnet-SCHEME OF THE MARKOV ALGORITHM
cNnet-SCHEME OF THE MARKOV ALGORITHM
The homology of the N-schema of the Markov algorithm is subjected to comprehensive scientific analysis. From the composition of the homology of the algorithm, new variants of modif...
LOGICAL ASSOCIATORS IN MARKOV NETWORKS
LOGICAL ASSOCIATORS IN MARKOV NETWORKS
In the theory of algorithms, A.A. Markov defined (introduced) his own logic, but it is not the only one that can be applied to his theory and algorithm. Markov networks and work in...
On morphisms preserving infinite Lyndon words
On morphisms preserving infinite Lyndon words
In a previous paper, we characterized free monoid morphisms preserving finite Lyndon words. In particular, we proved that such a morphism preserves the order on finite words. Here ...
ANALISA PERBANDINGAN METODE CELLULAR AUTOMATA ANN DAN MARKOV UNTUK PREDIKSI TUTUPAN LAHAN DI KOTA BLITAR
ANALISA PERBANDINGAN METODE CELLULAR AUTOMATA ANN DAN MARKOV UNTUK PREDIKSI TUTUPAN LAHAN DI KOTA BLITAR
ABSTRACT The development of urban areas in Blitar City, which is triggered by population growth and mobility, has caused changes in land cover, especially the reduction in rice fie...

Back to Top