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

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

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 # 31_2017 15 p. PDF	submitted on 11th Dec 2017 displayed on website on 25th Dec 2017 Nikolai Nepejvoda Additive representations of numbers: some remarks Fibonacci system is the best known example of additive systems. Here considered general additive systems/ Some criteria ate stated of possibility to represent natural, integer and real numbers/ Computational properties of some arithmetical operations are estimated. Paper contains also some problems. (In Russian). Key words: number representation, additive systems, Fibonacci system, finite automata.
article citation	http://psta.psiras.ru/read/psta2017_4_101-115.pdf
DOI	https://doi.org/10.25209/2079-3316-2017-8-4-101-115
Article # 46_2017 11 p. PDF	submitted on 14th Dec 2017 displayed on website on 29th Dec 2017 Sergej Znamenskij Model and axioms for similarity metrics Modern applications usually combine different similarity metrics taking into account the algorithms complexity, the peculiarities of human perception, data resources and samples. The optimization requires a unified formal description of the basic similarity metrics. The system of the similarity metric axioms is enchanced and its universal model is constructed which generalizes known models of similarity that do not reduce to the Euclidean metric. The model is based on a weighted partially ordered set. (In Russian). Key words: similarity of strings, sequence alignment, edit distance, LCS, Levenshtein metric.
article citation	http://psta.psiras.ru/read/psta2017_4_347-357.pdf
DOI	https://doi.org/10.25209/2079-3316-2017-8-4-347-357

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