Search arXivSearch

arXiv · 2112.15505

Information Systems Dynamics: Foundations and Applications

Abstract

This article firstly reviews and summarizes the rapid development of information technology, characterized by the close combination of computer and network communication, which leads to a series of investigations, including the analyses of the important role of a series of technological achievements in the context of information movement and application, the interrelationship between the real-world, information space and information system, and the integrated framework of the real-world and information system, and the modifications and improvements of the Xu's previous mathematical theory on information models, properties and metrics. Based on the mathematical foundations, eleven types of information measure efficacies and their distribution across information systems are put forward, and then the dynamics configurations of information systems are comprehensively analyzed, which constitutes the basic theoretical framework of information systems dynamics with general significance. Finally, Smart Court SoSs (System of Systems) Engineering Project of China are introduced as the exemplified application of the theoretical work, which aims at providing a reference for the analysis, design, development and evaluation of large-scale complex information systems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jianfeng Xu, Zhenyu Liu, Shuliang Wang, Tao Zheng, Yashi Wang, Yingfei Wang, Yongjie Qiao, Yingxu Dang. 2022-03-09. Information Systems Dynamics: Foundations and Applications. https://arxiv.org/abs/2112.15505

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT