The Impulse Interactive Cuts of Entropy Functional Measure on Trajectories of Markov Diffusion Process, Integrating in Information Path Functional, Encoding and Applications
Journal Title: Journal of Advances in Mathematics and Computer Science - Year 2017, Vol 20, Issue 3
Abstract
The introduced entropy integral measure on random trajectories (EF) is defined by the process additive functional with functions drift and diffusion reducing this functional on trajectories to a regular integral functional. This functional evaluates the cutting process impulses imposed through an impulse control. The impulse control cuts the process EF on elementary information impulse which the introduced information path functional (IPF) integrates in a bit composing an information process. Compared to Shannon entropy measure of a random state, cutting the process on separated states decreases quantity of process information by the amount, concealed in correlation connections between these states, which hold a hidden process information infinite. The impulse elementary interactive cutting action provides both reduction of the observing process entropy and discrete unit of the cutting entropy memorized as an information Bit. That defines information as memorized entropy cutting in random observations which process interactions. Cutting maximum of minimal impulse information and transferring minimal entropy between impulses implement the paper maxmin-minimax principle of converting process entropy to information. Each cutoff sequentially and automatically converts entropy to information, naturally encoding information Bit from random process, which connects the Bits sequences in the IPF, and the EF predicts next cut. The impulse curvature, enclosing the entropy of interacting impulses, enables converting inner energy of an external (natural) process to bit of the interacting process which memorizes the bit by delivering the Landauer energy. It allows encoding the IPF information in evolving natural code. We found the conditions creating a natural bit memorized in interacting curved impulse and the conditions generating a code of the interacting information process which assembles the natural bits. The natural encoding satisfied Landauer’s principle and compensates for the cost of Maxwell’s Demon. The energy of a specific interaction limits the universal code length and density. It is shown that each IPF dimensional cut measures Feller kernel information. The -dimensional process cutoff generates a finite information measure, integrated in the IPF whose information approaches the EF measure at , restricting maximal information of the Markov diffusion process. Estimation extracting information confirms non-additivity of the EF measured fractions. The multiple applications validate the results.
Authors and Affiliations
Vladimir S. Lerner
Keywords
Related Articles
- EP ID EP322170
- DOI 10.9734/BJMCS/2017/30359
- Views 55
- Downloads 0
An Efficient CRT Based Reverse Converter for {22n+1-1, 2n-1, 22n-1} Moduli Set
This paper presents a reverse converter for the moduli set {22n+1-1, 2n-1, 22n-1} using a Chinese Remainder Theorem (CRT) algorithm and reverse method of data conversion. We compare our result with other converters found...
Rigidity and Shrinkability of Diagonalizable Matrices
We introduce the seemingly new concept of a rigid matrix based on the comparison of its sparsity to the sparsity of the natural powers of the matrix. Our results could be useful as a usage guide in the scheduling of vari...
Fixed Point Theorems for Presic Type Mappings in Gp-Metric Spaces
In this paper, we introduce some fixed point theorems in Presic type mappings on Gp-metric spaces. The present results generalizes various known results in the related literature.
Log Prediction of Wireless Telecommunication Systems Based on a Sequence-To-Sequence Model
Nowadays people are becoming increasingly dependent on wireless networks. Taking precautions and acting in advance to avoid problems of wireless networks have already shown great importance. In analyzing problems of wire...
Employing the Double, Multiplicative and The Com-Poisson Binomial Distributions for modeling Over and Under-dispersed Binary Data
In this paper, we compare the performances of several models for tting over-dispersed binary data. The distribution models considered in this study include the binomial (BN), the beta- binomial (BB), the multiplicative...