Features of the Development of Organic Animal Husbandry in Russia

Pavlov, Alexander Yurievich; Kindaev, A. Yu.

doi:10.55186/2413046x_2022_7_9_522

Cited by 2 publications

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Cilibrasi & Vitányi describe how compression/decompression programs exhibit desirable properties that make them excellent choices as the program p in the definition of KC [31]. While their approach is robust to a number of compression algorithms, consider the Lempel-Ziv-Welch (LZW) compression algorithm [32], and the related Lempel-Ziv-Markov chain (LZMA) algorithm [33], which create a dictionary of the data to be compressed. The dictionary can be stored as a hash table and the compressed representation of the data stored as a sequence of keys.…”

Section: Kolmogorov Complexitymentioning

confidence: 99%

Towards a Simulation Model Complexity Measure

Thompson¹,

Hodson²,

Grimaila³

et al. 2023

Preprint

View full text Add to dashboard Cite

Is it possible to develop a meaningful measure for the complexity of a simulation model? Algorithmic information theory provides concepts that have been applied in other areas of research for the practical measurement of object complexity. This article offers an overview of complexity from a variety of perspectives and provides a body of knowledge with respect to the complexity of simulation models. Key terms of model detail, resolution, and scope are defined. An important concept from algorithmic information theory, Kolmogorov complexity, and an application of this concept, normalized compression distance, are used to indicate the possibility of measuring changes in model detail. Additional research in this area can advance the modeling and simulation body of knowledge toward the practical application of measuring simulation model complexity. Examples show that KC and NCD measurements of simulation models can detect changes in scope and detail.

show abstract

Section: Kolmogorov Complexitymentioning

confidence: 99%

Towards a Simulation Model Complexity Measure

Thompson¹,

Hodson²,

Grimaila³

et al. 2023

Preprint

View full text Add to dashboard Cite

show abstract

“…Cilibrasi & Vitányi describe how compression/decompression programs exhibit desirable properties that make them excellent choices as the program p in the definition of KC [36]. While their approach is robust to a number of compression algorithms, consider the Lempel-Ziv-Welch (LZW) compression algorithm [37], and the related Lempel-Ziv-Markov chain (LZMA) algorithm [38], which create a dictionary of the data to be compressed. The dictionary can be stored as a hash table and the compressed representation of the data stored as a sequence of keys.…”

Section: Kolmogorov Complexitymentioning

confidence: 99%