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
Wind Speed Equation of Circular Cyclone
This paper uses a point model of cylindrical box wrapped by zero-weighted membrane to derive a wind speed equation of circular cyclone by method of section based on Boyle’s law, Charles’ law and Newton’s laws. The obtain...
Estimating the Parameters of a Disease Model from Clinical Data
Estimation of parameters (rate constants) in infectious disease models can be done either through literature or from clinical data. This article presents parameter estimation of a disease model from clinical data using t...
Image-Based Identification of Cell Cultures by Machine Learning
Biomedical laboratories often use different cell types in the same assay or the same cell type in different assays. One cell type can become contaminated by another, or cells can be mis-identified, giving poor results. A...
Performance Analysis of ACO Based Routing Protocols- EMCBR, AntChain, IACR, ACO-EAMRA for Wireless Sensor Networks (WSNs)
This research paper is study of ACO based routing protocols proposed for Wireless Sensor Networks by various researchers. The protocols comprehensively compared via this research paper are: Ant Colony Based Energy Aware...
Solving Multi-level Multi-objective Fractional Programming Problem with Rough Intervals in the Objective Functions
In this paper multi-level multi-objective fractional programming problem (ML-MOFP) is considered where some or all of its coefficients in the objective function are rough intervals. At the first phase of the solution app...