PROBLEMS IN PROGRAMMING最新文献

{"title":"Table interpretation of the temporal description logic LTLALC","authors":"V. Reznichenko, I. Chystiakova","doi":"10.15407/pp2022.03-04.216","DOIUrl":"https://doi.org/10.15407/pp2022.03-04.216","url":null,"abstract":"Description logics are widely used to describe and represent knowledge in the Semantic Web. This is a modern and powerful mechanism that provides the possibility of extracting knowledge from already existing ones. Thanks to this, conceptual of subject areas modeling has become one of the fields of application of descriptive logics, taking into account the use of inference mechanisms. Conceptual modeling is used to create databases and knowledge bases. A key issue of the subject area modeling is the ability to monitor the dynamics of changes in the state of the subject area over time. It is necessary to describe not only the current actual state of the database (knowledge bases), but also the background. Temporal descriptive logics are used to solve this problem. They have the same set of algorithmic problems that are presented in conventional descriptive logics, but to them are added questions related to the description of knowledge in time. This refers to the form of time (continuous or discrete), time structure (moments of time, intervals, chains of intervals), time linearity (linear or branched), domain (present, past, future), the concept of “now”, the method of measurement, etc. An urgent task today is to create an algorithm for the temporal interpretation of conventional descriptive logics. That is, to show a way in which temporal descriptive logic can be applied to ordinary descriptive logic. The paper presents an algorithm for temporal interpretation of LTL into ALC. Linear, unbranched time is chosen for the description goal. It is presented in the form of a whole temporal axis with a given linear order on it. Only the future tense is considered. The algorithm contains graphic notations of LTL application in ALC: concepts, concept constructors, roles, role constructors, TBox and ABox. Numerous examples are used to illustrate the application of the algorithm.","PeriodicalId":313885,"journal":{"name":"PROBLEMS IN PROGRAMMING","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124849463","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 dialogue system based on ontology automatically built through a natural language text analysis","authors":"A. A. Litvin, V. Velychko, V. Kaverynskyi","doi":"10.15407/pp2022.03-04.196","DOIUrl":"https://doi.org/10.15407/pp2022.03-04.196","url":null,"abstract":"An integrated approach is created to the development of natural-language dialogue systems driven by an ontological graph database. Ontology here has a defined regular structure that contains typed semantic relationships between concepts, as well as related contexts, which may also have a multilevel structure and additional typing. The ontology is created automatically due to the semantic analysis of a natural language using a specially developed original software, which is set up to work with inflected languages, in particular Ukrainian. The ontology description is serialized in OWL format. To work as part of the dialog system, the ontology is transferred to the graph database Neo4j. The Cypher language is used for formal queries. The original phrases of the user are subject to a special method of semantic analysis, which determines the type of formal query to the database. The essence of the analysis is that the text of the user phrase goes through a series of checks. Based on their results, a set of basic templates for formal requests is determined, as well as additional constructions that are attached to the basic template. Some of the checks may also return the notion of substitution to certain specified positions of the formal query. Formal queries can return both contexts and lists of ontology concepts. In addition to concepts, queries can also return information about specific semantic predicates that connect them, which simplifies the synthesis of natural language responses. The synthesis of answers is based on special templates, the choice of which is directly related to the corresponding template of the formal query.","PeriodicalId":313885,"journal":{"name":"PROBLEMS IN PROGRAMMING","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129248439","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":"Information resources distribution between automated workstations in local corporative networks","authors":"O. Pursky, Valery Kozlov, Tetyana Tomashevska, V. Dyvak, Nataliia Hordiiko, Mykola Sinitsky","doi":"10.15407/pp2022.03-04.023","DOIUrl":"https://doi.org/10.15407/pp2022.03-04.023","url":null,"abstract":"This article focuses on the problem of optimal distribution of related information resources between automated workstations in local corporate networks. In this work we present a mathematical description of the algorithm for quasi-optimal distribution of related information resources at designing automated workstations in a local corporate network. The undirected graph describing the task of information resources optimal distribution is presented. The method of quasi-optimal distribution of related resources at designing automated workstations in the local corporative network is proposed based on the developed algorithm. Using conditional organization as an example the modeling of optimal distribution of related information resources has been considered in local corporative network. The described algorithm provides an opportunity to optimally distribute the information resource in the local corporate network, as well as solve the task of building reliable and efficient local networks. The proposed method of quasi-optimal distribution of related information resources can be used in corporation of any type.","PeriodicalId":313885,"journal":{"name":"PROBLEMS IN PROGRAMMING","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128292312","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":"Identification of the native language of a person","authors":"Y.S. Lazorenko, I. Sinitsyn, V.L. Shevchenko","doi":"10.15407/pp2022.03-04.271","DOIUrl":"https://doi.org/10.15407/pp2022.03-04.271","url":null,"abstract":"With the great increase of population movement, caused either by temporarily needs due to travelling or by long-term ones due to work, etc., there appears a need to improve the processes of movement control and identification of groups of people. The primary need is to identify if a person belongs to a certain nationality or territory of primary residence. In addition, it can be useful for scientific social and political researches, as well as for the field of tourism and entertainment. Such identification of people by language environment can also help to find out more about the cultural environment, which will make possible to predict the preferences of entire groups of customers better. The analysis of the audio recording of the speaker’s speech was divided into 3 stages, each of which contains a defined step-by-step instruction for the processes of data preparation and handling. Firstly, the sound itself was analyzed, because voice and pronunciation are one of the fastest and most effective tools for identifying a person or a group of people. Then the audio recording was converted into text and an analysis of the lexical composition of the studied fragment of the conversation was done. At the end, the results of the program, got in the previous two stages, were compared and the complex evaluations were done according to the criterias determined in the theoretical researches. The mentioned criterias were used with weighting factors assigned to them. As a result, an assumption about the speech environment of the speaker was given by the program. The work also describes the factors which affects the formation of pronunciation and the change of various intonations, the relationship between text and sound. Some dependencies between sound parameters and the pronunciation of sounds in the Russian and Ukrainian languages were mathematically formalized. The topic of the work is wide, as it considers not only lexical, but also acoustic features of speech. In this way, not only changeable or situational qualities are taken into account, for example, the vocabulary of the conversation, but also those ones that are related to the person regardless of the context of the conversation, his or her emotional state or what language he or she is speaking at the very moment. The criterias considered in the work can help to make assumptions about the speaker’s «natural», most familiar language, in other words the language he or she uses most of the time in life.","PeriodicalId":313885,"journal":{"name":"PROBLEMS IN PROGRAMMING","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127811038","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":"Maximum independent sets of graph vertices searching for software projects improvement","authors":"O.O. Slabospitska, P. Stetsyuk, O. Khomiak","doi":"10.15407/pp2022.03-04.073","DOIUrl":"https://doi.org/10.15407/pp2022.03-04.073","url":null,"abstract":"The need is fixed to software project enhancing with seamless integration of technological-descriptive and normative project manage- ment approaches by means of classical Graph Discrete Optimization Problems tailoring for software project management tasks, poorly equipped with best practices within technological approach. Class of software project management tasks is proposed to demonstrate the benefits of such integration. Two Boolean linear programming problems are investigated for searching some maximum size indepen- dent set (Section 1) and an algorithm for searching all possible maximum size independent sets (Section 2). Section 3 presents Problem Statement for searching a given number of non-intersecting independent sets with maximum sum of vertices’ numbers within independent sets. Based on it, Vizing-Plesnevich algorithm is described for coloring the graph vertices with the minimum number of colors. To solve Boolean problems, both specialized mathematical programming language AMPL and corresponding solver program named gu- robi are used. For basic algorithms developed, reference AMPL code versions are given as well as their running results. Illustrative examples of software project enhancing with the algorithms elaborated are considered in Section 4, namely: 25 specialists being conflicted during their previous projects partitioning into coherent conflict-free sub-teams for software projects portfolio; schedule optimization for autonomous testing of reusable components within a critical software system; cores composing for independent teams in a critical software project.","PeriodicalId":313885,"journal":{"name":"PROBLEMS IN PROGRAMMING","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134157928","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":"Probable use of regional situational centers of the intellectual system «Сontrol_TEE» using UAVs","authors":"J. Pisarenko, E.Yu. Melkumyan, A. Koval","doi":"10.15407/pp2022.03-04.349","DOIUrl":"https://doi.org/10.15407/pp2022.03-04.349","url":null,"abstract":"To ensure the optimal functioning of the complex objects of new technology and information systems being created, it is important to develop the principles of building hardware complexes taking into account the specifics of the cycle of a techno-ecological events. In this work, attention is paid to the further development of the methodological approach to the creation of a situational center based on a model of a geo-information sys- tem using a technopark of robotic systems with elements of AI, which implements a software complex of communication of unmanned transport of general purpose in the city environment with the base, helps to reduce costs and during crisis situations in which the access of expert people is difficult or fundamentally impossible. The charter of the sports federation of unmanned aviation of the sports and engineering direction has been developed, which unites athletes, coaches, sports judges, specialists and amateurs of organizations interested in the development of the sport of unmanned aviation and aerobatics shows. A multi-level architecture scheme for building a network of regional situational centers has been developed. Information about the UAVs movement in the city is sent to the central situational center (CSC) from the regional ones, all requests for UAVs to perform certain actions are sent to it via the Internet, this information is processed and decisions are made here, and all necessary communications are deployed here services regional situational centers, located in the protected perimeter, conduct radio exchange with UAVs in their area of operation, manage their area according to the general plan dictated by the CSC, have functionality for autonomous traffic control and execution of requests in case of loss communication with the CSC.","PeriodicalId":313885,"journal":{"name":"PROBLEMS IN PROGRAMMING","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130405544","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":"Friend-or-Foe Recognition Algorithm Development for the Corresponding Software Building","authors":"M. Ogurtsov","doi":"10.15407/pp2022.03-04.387","DOIUrl":"https://doi.org/10.15407/pp2022.03-04.387","url":null,"abstract":"The year 2022 showed an urgent need to improve the existing systems for recognizing objects in the aerial space, which is caused by the significant increase in the number of technical means (especially unmanned aerial vehicles) on the battlefield. Such a sharp increase in the number of objects that simultaneously take part in combat operations in the air requires the improvement of military object recognition systems, both qualitatively and quantitatively. This requires the development of appropriate new generation Friend-or-Foe algorithms for the objects’ recognition. The main requirements for recognition systems of aerial objects of civil application were determined. They includes: maximum com- patibility; support for a large number of objects; outdated recognition complexes support; support for alternative ways of recognition; support for alternative data entry methods; determining the coordinates of aerial objects in an emergency situation. Friend-or-foe recognition systems for military applications are also considered. In contrast to civilian systems, the following basic requirements have been identified for them: 1) Maximum speed of the recognition process. 2) Protection against false positives. 3) Protection against legitimate aerial object imitation. 4) Support for a large number of objects. 5) Protection against cases of loss of a legitimate aerial object. 6) Rotation of the secret part. 7) Protection against false-negative results to prevent friendly fire. 8) Protection against man-in-the-middle attacks. 9) Flexible integration with the NATO block recognition system. 10) Availability of opportunities for purely domestic production and support of the object recognition system. 11) Protection against electronic warfare means. 12) Support for several recognition modes. 13) Automatic blocking of the launch of ground-to-air and air-to-air weapons against objects that confirm their legitimacy by a correct response to a request. 14) Determining the coordinates of aerial objects in an emergency. Based on the formulated requirements, a new friend-or-foe algorithm for the state identification system for military use is proposed, built based on the state standards, and taking into account the features of its software implementation in order to increase speed. Its implementation will ensure sufficient scalability, stability, reliability, and multi-level recognition.","PeriodicalId":313885,"journal":{"name":"PROBLEMS IN PROGRAMMING","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124515312","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":"Protecting public clients using an authorization algorithm","authors":"A. Doroshenko","doi":"10.15407/pp2022.03-04.409","DOIUrl":"https://doi.org/10.15407/pp2022.03-04.409","url":null,"abstract":"The paper focuses on authorization in public clients and provides a secure authorization model as an alternative to costly Microsoft Duende BFF solution. After providing a brief overview of confidential and public clients in terms of authorization, we have analyzed problems and potential attack vectors associated with the authorization process in public clients due to their inability to hold credentials securely. Confidential clients are implemented on secure servers or able to facilitate secure authentication by other means, while public clients lack this security. Our research discovered algorithms, models, and methods for secure authorization in public clients. As a part of our model, we have implemented high entropy Proof Key for Code Exchange generator in C# .NET 6.0. In addition, we have provided a solution to a problem of storing sensitive information in public clients using the Backend for Frontend concept. This concept leverages a reverse proxy pattern where a backend application acts as a proxy and handles all client requests. Having a proxy backend application significantly tightens security model for public clients, while restricting possible attack vectors. The authorization model being researched was based on Proof Key for Code Exchange and Backend for Frontend approach. During the testing phase of our research, we have confirmed that the model was not vulnerable to Cross-Site-Scripting and Auth Code Interception attacks. A sequence diagram outlining main actors and interactions among them in context of authorization has been designed. The diagram stands as the visual representation of the model that uses proposed methods and algorithms. As a result, we have managed to build an alternative to secure authorization solutions for public clients that do not rely on the client secret. We have summarized our key findings in a Blazor Web Assembly application, which is classified as public and uses the described authentication model.","PeriodicalId":313885,"journal":{"name":"PROBLEMS IN PROGRAMMING","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128890261","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":"Web service for enterprise resource manage- ment systems","authors":"A.D. Tarasenko, A. Doroshenko","doi":"10.15407/pp2022.02.047","DOIUrl":"https://doi.org/10.15407/pp2022.02.047","url":null,"abstract":"A web service for enterprise resource management systems has been developed, which allows creating and managing fast secure enterprise resource management systems based on user-required modules. The uniqueness of the service is that in addition to the fact that it contains most of the existing standards and capabilities of other ERP systems from other IT companies, it has a significant advantage - there is no need to address IT-specialists for the development and configuration of ERP systems for the needs of the end user in its use. The main website of the web service has been developed, which provides authentication and authorization; installer application for creating and running ERP system; ERP server application, and client application for interaction with ERP system. Functional testing of the developed web service was carried out by testing each application separately and in a joint relationship. Thanks to the concept of modularity, this system is easily supplemented and expanded. In the future, this service can be supplemented with new functionality, depending on business requirements.","PeriodicalId":313885,"journal":{"name":"PROBLEMS IN PROGRAMMING","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124997257","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":"Master’s thesis in software engineering – object, subject, contents of research","authors":"M.O. Sydorov","doi":"10.15407/pp2022.02.022","DOIUrl":"https://doi.org/10.15407/pp2022.02.022","url":null,"abstract":"Nowadays scientific researches In Ukraine are based on formulating the goals of research, us- ing the concept of object and subject of research. Moreover, as time has shown, this is an important stage of work on which the effectiveness of the study depends. Both the total use of a software in different arias of life and improvement of software engineering prepare better conditions for this stage of the dissertation research. Modern software engineering uses scientific research methods that should be used to perform dissertation research. The purpose of this article is the following: to provide recommendations for the formulation of the object and subject of the master’s thesis. Special phocus is made on specialization in the software engineering fundamentals. It also aimed at describing the scientific methods of evidence-based research in the master’s thesis. It pays attention to the results presentation. These points are considered in the context of the conditions that have developed in education and the relevant problems that have arisen in the Universities′ curriculum. There are some problems in choosing the topics of master′s thesis. The one is objective in nature and arises from the combination of the domain of software engineering with application domains in a context of specialization. The article is aimed at masters in software engineering and their supervisors.","PeriodicalId":313885,"journal":{"name":"PROBLEMS IN PROGRAMMING","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115619322","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}