PROGRAM SYSTEMS: THEORY AND APPLICATIONS

12+

Online Scientific Journal published by the Ailamazyan Program Systems Institute of the Russian Academy of Sciences

Papers are accepted in the form of a PDF file

To view the PDF files, you will need Adobe Acrobat Reader

• Содержание выпуска •
• Software and Hardware for Distributed Systems and Supercomputers •
• Mathematical Modelling •
• Supercomputing Software and Hardware •
• Mathematical Foundations of Programming •
• Methods for Optimal Control and Control Theory •
• Artificial Intelligence, Intelligence Systems, Neural Networks •

Mathematical Foundations of Programming

Responsible for the Section: doctor of physico-mathematical Sciences Nikolay Nepeivoda

On the left: assigned number of the paper, submission date, the number of A5 pages contained in the paper, and the reference to the full-text PDF .

Article # 29_2016 16 p. PDF	submitted on 17th Nov 2016 displayed on website on 07th Dec 2016 Nikolai Nepejvoda Local computations in system theory and VLDB Concept of intermediate-memory-free organization of computing process over big data processors is considered. An abstract topological notion of local system is introduced. It is considered on examples from various domains. Basic results including interrelation with robustness are stated. This work is planned to be the first in the series devoted to memory-free computations and locality. (In Russian). Key words: locality, distributed computing, wall of memory, robustness.
article citation	http://psta.psiras.ru/read/psta2016_4_145-160.pdf
DOI	https://doi.org/10.25209/2079-3316-2016-7-4-145-160
Article # 41_2016 12 p. PDF	submitted on 24th Nov 2016 displayed on website on 28th Dec 2016 Sergej Znamenskij Approximation of the longest common subsequence length for two long random strings The expected value E of the longest common subsequence of letters in two random words is considered as a function of the α = A of alphabet and of words lengths m and n. It is assumed that each letter independently appears at any position with equal probability. An approximate analitic expression for E(m, n, α) calculation is presented that allow to calculate theE(m, n, α) with an accuracy of 0.3 percent for 64 ≤ n + m ≤ 65, 536 and 1 < α < 129. The coefficients are selected by hand and can be refined. It is expected that the formula holds for each grater values of the argument with the same relative error. Key words: similarity of strings, sequence alignment, edit distance, LCS, Levenshtein metric.
article citation	http://psta.psiras.ru/read/psta2016_4_347-358.pdf
DOI	https://doi.org/10.25209/2079-3316-2016-7-4-347-358
Article # 42_2016 9 p. PDF	submitted on 27th Nov 2016 displayed on website on 07th Dec 2016 Mark Khatkevich Direct-flow adder program simulation Finite automata can add numbers represented in redundant number systems. This article gives direct-flow calculation scheme for addition. The same scheme goes for different types of input data, addition in binary, ternary, octal redundant systems is considered. Also, this scheme works adding binary matrices and real numbers. (In Russian). Key words: adder, direct-flow calculation, number representation.
article citation	http://psta.psiras.ru/read/psta2016_4_359-367.pdf
DOI	https://doi.org/10.25209/2079-3316-2016-7-4-359-367

Adress: Ailamazyan Program Systems Institute of the Russian Academy of Sciences, PSTA Online Journal, 4 a Peter the First Street,
Veskovo village, Pereslavl area, Yaroslavl region, 152021 Russia
Phone: +7-4852-695-228. E-mail: info@psta.psiras.ru. Website: http://psta.psiras.ru