{"title":"Automation of the process of environmental monitoring in specially protected natural territories of the Russian Federation based on the content management system Directum RX","authors":"I. Rudko, L. Khoroshko, Pavel P. Keyno","doi":"10.15514/ispras-2022-34(2)-12","DOIUrl":"https://doi.org/10.15514/ispras-2022-34(2)-12","url":null,"abstract":"For organizations that execute control over specially protected natural areas of the Russian Federation, the task of consolidating data on ongoing observations is relevant. These data, called the chronicles of nature, for a long time were kept in a simplified, paper form and did not have a clear structure. The task of automating business processes for collecting data and exchanging this data between members of the scientific community, as well as building models necessary for the scientific departments of parks and reserves, is important and relevant. In this connection, we see it relevant to consider automating the process of environmental monitoring by developing an electronic document management module based on the integration platform Directum RX business solutions. The purpose of the research is to automate the eco-monitoring process based on the Directum RX platform, which allows to build a corporate content management system, as well as create a full-fledged data storage and retrieval system for collecting information about observations. The article describes the role model for working with the system, the system architecture and the developed components of the \"Ecomonitoring\" module based on the Directum RX platform. For this, a structural method was used, by dividing the task into many independent stages available for understanding and solving and hierarchical ordering. Integration with the Yandex weather service has been developed for further use in analytical models. A solution has been developed to manage the universal classifier of animals in accordance with the classifier of biological taxonomy accepted in the world. The automation of user actions for collecting and processing information about observations is demonstrated. As a result, the process of environmental monitoring was automated in one of the reserves of the Russian Federation.","PeriodicalId":33459,"journal":{"name":"Trudy Instituta sistemnogo programmirovaniia RAN","volume":"22 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90798471","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Mathematical modeling the process of gas flow in the turbomolecular pump using the Cercignani-Lampis gas-surface interaction model","authors":"U. S. Gordeeva, F. Sharipov","doi":"10.15514/ispras-2022-34(6)-16","DOIUrl":"https://doi.org/10.15514/ispras-2022-34(6)-16","url":null,"abstract":"In this paper, the process of gas flow in the flow path of a turbomolecular vacuum pump using the Cercignani-Lampis (CL) model was simulated. CL model was used as new boundary conditions when calculating the transition probability. The test particle method (Monte Carlo method) was used in the simulation. The calculation of the molecules transition probability through the blade channel in the forward and reverse directions, the transition resulting probability, the compression ratio was made.","PeriodicalId":33459,"journal":{"name":"Trudy Instituta sistemnogo programmirovaniia RAN","volume":"144 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79718114","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Introducing Programming Language Metrics","authors":"Timur Rasimovich Fayzrakhmanov","doi":"10.15514/ispras-2022-34(6)-5","DOIUrl":"https://doi.org/10.15514/ispras-2022-34(6)-5","url":null,"abstract":"We introduce possibly the first approximation of programming language metrics that represent a spectrum over 70 unique and carefully gathered dimensions by which any two programming languages can be compared. Based on those metrics, one can evaluate her own `best' language, and to demonstrate how complex feelings such as “simplicity” and “easy to use”, often found as arguments in language debates and advertisements, can be decomposed into clear and measurable pieces. We put the collection as a completely separate open-source file (here as an appendix) so that everyone can participate in eliciting new and interesting dimensions used in programming languages research, development, and use. Metrics can find their use to compare languages, define requirements, create rankings, give tips for language designers, and simply provide a bird’s-eye view on existing languages features found in the wild.","PeriodicalId":33459,"journal":{"name":"Trudy Instituta sistemnogo programmirovaniia RAN","volume":"21 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79338404","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Alesander Sergeevich Leonov, A. Laptev, Anastasia Laushkina, Mikhael Sinko, O. Basov
{"title":"Algorithm for finding specialists with unique skills based on a digital footprint","authors":"Alesander Sergeevich Leonov, A. Laptev, Anastasia Laushkina, Mikhael Sinko, O. Basov","doi":"10.15514/ispras-2022-34(4)-12","DOIUrl":"https://doi.org/10.15514/ispras-2022-34(4)-12","url":null,"abstract":"In recent years, due to significant changes in the labor market, companies have become more likely to face various problems when searching and selecting candidates. The main reason for these problems is that the existing Internet resources for finding candidates do not allow you to find a specialist with the required set of competencies and fully evaluate his experience, skills, achievements and personal characteristics. As a result, it becomes necessary to create a service for finding exclusive specialists. Most of these specialists do not have a resume in the public domain, are not looking for a job, but are ready to consider interesting offers. As a result, this work is devoted to the study of the possibility of finding specialists with unique competencies on the Internet based on the analysis of their digital footprint. The hypothesis is that it is possible to get a complete profile of a unique specialist if you collect, combine and analyze data from various sources. In the course of this work, the possibilities provided by open data sources on the Internet were analyzed, as well as the scientometric indicators of a specialist and the parameters of his reliability were determined. An algorithm for searching for the required specialists based on these data has been compiled, an automated system implementing this search has been designed, developed and tested.","PeriodicalId":33459,"journal":{"name":"Trudy Instituta sistemnogo programmirovaniia RAN","volume":"26 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88345120","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Improving the accuracy of static analysis by accounting for the values of class fields that can have only one constant value","authors":"Vadim Sergeevitch Karcev, V. N. Ignatyev","doi":"10.15514/ispras-2022-34(6)-2","DOIUrl":"https://doi.org/10.15514/ispras-2022-34(6)-2","url":null,"abstract":"The paper describes the approach for the improvement of the accuracy of general purpose static symbolic execution analysis of C# sources based on the accounting for the values of class fields that can have only one possible value. In addition, we propose the detector of forgotten readonly modifiers and unused fields, that use data collected by the main analysis. The approach and detectors were implemented as part of the industrial static analyzer SharpChecker. The main analysis is performed at the AST level to reduce time and resource costs. Collected values of the fields are used during symbolic execution phase allowing it to use concrete value instead of symbolic for the subset of class fields. As a result, we managed to noticeably improve the accuracy of some analyzers, such as UNREACHABLE_CODE (improved by 7.57%) or DEREF_OF_NULL (improved by 1.33%) and get new results in cases with forgotten readonly or unused fields. Achieved results allow to use analysis and detectors in the main branch of the SharpChecker and make it available to users. The paper considers in detail the algorithm of the detector and provides examples of results on the set of open source software.","PeriodicalId":33459,"journal":{"name":"Trudy Instituta sistemnogo programmirovaniia RAN","volume":"16 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82018364","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Dmitry Olegovich Markin, Sergey Mikhailovich Makeev, Thaj Trung Ho
{"title":"Security threat level estimation for untrusted software based on TrustZone technology","authors":"Dmitry Olegovich Markin, Sergey Mikhailovich Makeev, Thaj Trung Ho","doi":"10.15514/ispras-2022-34(1)-3","DOIUrl":"https://doi.org/10.15514/ispras-2022-34(1)-3","url":null,"abstract":"The paper proposes a model for assessing the security of information processed by untrusted software from the components of the TrustZone technology. The results of vulnerability analysis of TrustZone technology implementations are presented. The structure of the trustlets security analysis tool has been developed. The paper deals with the problem of assessing the credibility of foreign-made software and hardware based on processors with the ARM architecture. The main results of the work are the classification of trustlets using their threat level assessment and the model of security threat level estimation of information processed by trustlets. Trustlets are software that operates in a trusted execution environment based on TrustZone technology in computers with ARM processors. An assessment of the security of information processed by trustlets for some implementations of trusted execution environments was carried out. The structural scheme of the analysis tool that allows identifying potentially dangerous code constructs in binary files of trustlets is presented. Also analysis tool's algorithm performing syntactic analysis of trustlet data is described. The calculation of the security assessment is carried out on the basis of a set of features proposed by authors. Calculated security assessment levels can be used to classify trustlets that are part of «trusted» operating systems based on TrustZone technology. The levels of potential threat to the security of the information they process are used to differ trustlets during certification tests and vulnerability search. It is advisable to use the results of the work in the interests of conducting certification tests of computer software based on processors with ARM architecture.","PeriodicalId":33459,"journal":{"name":"Trudy Instituta sistemnogo programmirovaniia RAN","volume":"73 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78717186","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"https://ispranproceedings.elpub.ru/jour/article/view/1531","authors":"A. Shcherbakov, V. Frolov, V. Galaktionov","doi":"10.15514/ispras-2022-34(3)-4","DOIUrl":"https://doi.org/10.15514/ispras-2022-34(3)-4","url":null,"abstract":"Geometry simplification for the radiosity method is a laborious process and it is difficult to automate in the general case. As an alternative solution to this problem, this paper proposes a modification of the radiosity method using approximation called “virtual patches”. Virtual patches are elements of the geometry obtained by clustering some points of the original geometry for which the illumination is calculated. They have a normal, color and area, but do not have a geometric representation, representing a cloud of points inside the voxel. In comparison with the original radiosity method, the proposed method, without reducing the performance of calculating global illumination, increases its accuracy.","PeriodicalId":33459,"journal":{"name":"Trudy Instituta sistemnogo programmirovaniia RAN","volume":"27 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88212598","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Web Application to Promote Blood Donation in Russia","authors":"Pavel Smirnov, V. Malinovskaya, N. Voinov","doi":"10.15514/ispras-2022-34(2)-14","DOIUrl":"https://doi.org/10.15514/ispras-2022-34(2)-14","url":null,"abstract":"The paper is devoted to the issue of blood donation and possible ways to promote this activity using modern information technologies. Existing software solutions are analyzed and new Web application is proposed to implement all features required for potential blood donors to make this process clearer and more comfortable.","PeriodicalId":33459,"journal":{"name":"Trudy Instituta sistemnogo programmirovaniia RAN","volume":"2181 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91386784","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. Feoktistov, R. Kostromin, S. Gorsky, I. Bychkov, Andrei Tchernykh, Olga Yurevna Basharina
{"title":"Redundancy and Uncertainty-Based Algorithms for Computation Planning","authors":"A. Feoktistov, R. Kostromin, S. Gorsky, I. Bychkov, Andrei Tchernykh, Olga Yurevna Basharina","doi":"10.15514/ispras-2022-34(1)-9","DOIUrl":"https://doi.org/10.15514/ispras-2022-34(1)-9","url":null,"abstract":"Nowadays, the development and use of workflow-based applications (distributed applied software packages) are some of the key challenges in terms of preparing and carrying out large-scale scientific experiments in distributed environments with heterogeneous computing resources. The environment resources can be represented by clusters of personal computers, supercomputers, and private or public cloud platforms and differ in their computational characteristics. Moreover, the composition and characteristics of resources change in dynamics. Therefore, computations planning and resource allocation in the considered environments are important problems. In this regard, we propose new algorithms for computation planning taking into account redundancy and uncertainty in such distributed applied software packages. Compared to other algorithms of a similar purpose, the proposed algorithms use evaluations of workflow execution makespan obtained in the process of continuous integration, delivery, and deployment of applied software. The proposed algorithms provide the construction of redundant problem-solving schemes that allow us to adapt them to the dynamic characteristics of computational resources and improve distributed computing reliability. The algorithms are based on a theory of conceptual modeling computational processes. We demonstrate the process of constructing problem-solving schemes on model examples. In addition, we show the utility in using redundancy for increasing the distributed computing reliability In comparison with some traditional meta-schedulers.","PeriodicalId":33459,"journal":{"name":"Trudy Instituta sistemnogo programmirovaniia RAN","volume":"34 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86977182","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Unified type system for the modern general-purpose programing language","authors":"Alexey Kanatov, Eugene Zouev","doi":"10.15514/ispras-2022-34(3)-2","DOIUrl":"https://doi.org/10.15514/ispras-2022-34(3)-2","url":null,"abstract":"The paper presents an overview of the type system, which supports the convergence of procedural, object-oriented, functional, and concurrent programming paradigms relying on static type checking with smart type inference support and the ability to ensure dynamic type safety as well. The key element of the type system is that it is fully based on just 2 basis constants and all other constructions are derived.","PeriodicalId":33459,"journal":{"name":"Trudy Instituta sistemnogo programmirovaniia RAN","volume":"24 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76512295","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}