PROBLEMS IN PROGRAMMING最新文献_第4页

Problems of scaling semantic information resources with a complex structure 复杂结构语义信息资源的扩展问题

PROBLEMS IN PROGRAMMING Pub Date : 2022-12-01 DOI: 10.15407/pp2022.03-04.171

J. Rogushina, I. Grishanova

{"title":"Problems of scaling semantic information resources with a complex structure","authors":"J. Rogushina, I. Grishanova","doi":"10.15407/pp2022.03-04.171","DOIUrl":"https://doi.org/10.15407/pp2022.03-04.171","url":null,"abstract":"We analyze scaling problems arising in modern intelligent information systems (IISs) and classify main reasons for their occurrence in their practical solutions. IISs integrate various elements of artificial intelligence (AI) for acquisition of knowledge relevant to actual user tasks. Important properties of these IISs are use of data with complex structure and orientation on semantic information resources (IRs). Therefore we analyze main features of the Data-Centric AI and opportunities for acquiring domain knowledge in various representations from Big Data. Knowledge organization systems (KOS) provide models and methods for effective store, retrieval and use of information processed by the Web-oriented IISs, and we consider existing approaches for their software platforms.We analyse the specifics of the scaling for systems focused on the semantic information processing and its differences from traditional data and Big Data scaling. This specifics is caused by complexity of data structure, number of various semantic relations between information objects into IR and complexity of semantic queries executed by KOS. On example of e-VUE – the Wiki-portal of the Great Ukrainian Encyclopedia – we analyze various situations that arise in process of practical development of semantic information resources with large volume and complex structure. Various ways of semantic retrieval into this information resource that use possibilities of the Semantic MediaWiki plugin are considered from the point of view of scaling aspects (such as increase of information objects, their relations and complication of their structure and characteristics). On base of this analysis we generate a set of recommendations aimed at ensuring more efficient development of such resources and their efficient functioning for practical use.","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":"131330073","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}

引用次数: 1

Software engineering and big data software 软件工程和大数据软件

PROBLEMS IN PROGRAMMING Pub Date : 2022-12-01 DOI: 10.15407/pp2022.03-04.069

N.O. Sydorov, N.M. Sydorova

{"title":"Software engineering and big data software","authors":"N.O. Sydorov, N.M. Sydorova","doi":"10.15407/pp2022.03-04.069","DOIUrl":"https://doi.org/10.15407/pp2022.03-04.069","url":null,"abstract":"Software engineering is a mature industry of human activity focused on the creation, deployment, marketing and maintenance of software. The fundamental concepts of engineering are life cycle model; three main components of life cycle phases - products, processes and resources; engineering and methodologies for creating, deployment and maintaining software. Software is the foun- dation of technological advances that lead to new high performance products. As the functionality of products grows, so does the need to efficiently and correctly create and maintain the complex software that enables this growth. Therefore, in addition to solving its own problems, software engineering serves the solution of the problems of creating and maintaining software in other domains, which are called application domains. Information technology is a well-known application domain. The basis of this domain is data. Information systems are being implemented in an organization to improve its effectiveness and efficiency. The functionality of information systems has grown dramatically when big data began to be used. This growth has led to the emergence of a wide variety of software-intensive big data information systems. At the same time, the role and importance of software engineering for solving the problems of this application domain has only intensified. Modern possibilities of software engineering are shown. The aspects of interaction between software engineering and big data systems are analyzed. The topics for the study of big data software ecosystems and big data system of systems are outlined.","PeriodicalId":313885,"journal":{"name":"PROBLEMS IN PROGRAMMING","volume":"126 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":"128206818","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}

引用次数: 0

Features of building recommendation systems based on neural network technology using multithreading 基于多线程的神经网络技术构建推荐系统的特点

PROBLEMS IN PROGRAMMING Pub Date : 2022-12-01 DOI: 10.15407/pp2022.03-04.289

N. Komleva, S. Zinovatna, V. Liubchenko, O. Komlevoi

引用次数: 0

The use of ontological knowledge for multi-criteria comparison of complex information objects 本体知识在复杂信息对象多准则比较中的应用

PROBLEMS IN PROGRAMMING Pub Date : 2022-12-01 DOI: 10.15407/pp2022.03-04.249

J. Rogushina, A. Gladun

{"title":"The use of ontological knowledge for multi-criteria comparison of complex information objects","authors":"J. Rogushina, A. Gladun","doi":"10.15407/pp2022.03-04.249","DOIUrl":"https://doi.org/10.15407/pp2022.03-04.249","url":null,"abstract":"In this work we consider comparison of complex information objects (CIO) as a component of intelligent decision-making. The specifics of proposed approach is that we compare not all theoretically possible CIOs but only their subset that is relevant for cur- rent situation and contains existing and available objects. Thus, we find an acceptable solution from the set of available ones that can be not optimal (according to certain criteria). We propose formal ontology-based model of CIO that considered as an element of intellectual information system. This model (in contrast to the domain ontology) defines unique names for positions of classes and class individuals to indicate the SIO structure. The methods of CIO comparison based on the use of knowledge from the relevant do- main ontology are considered. Various approaches to determining of semantic proximity and semantic similarity are considered as metrics for quantitative evaluation to select parameters of information objects that can be used for calculation of these evaluations. We propose an algorithm for semantic comparison of CIOs which are based on the same ontology and have a similar structure. This algorithm allows generation of comparison criteria and determining hierarchy of this criteria for the current situation. We propose to evaluate the semantic-level similarity of the elements of individual CIOs to certain reference CIO defined by the user (as a description of the optimal solution or generated CIO properties). As a result, a subset of CIOs that satisfy the user requirements is cre- ated, but we have to select only one CIO among them, which will be used in the future to fulfill the user task. Therefore, we need in a set of criteria for CIO comparison and methods to determine the importance of each of these criteria at the current moment in time. For this purpose, we propose to use the method of hierarchical analysis based on a pairwise comparison of the importance of individual criteria.","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":"126092492","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}

引用次数: 0

Automated generation of programs for a class of parametric neuroevolution algorithms 自动生成程序的一类参数神经进化算法

PROBLEMS IN PROGRAMMING Pub Date : 2022-12-01 DOI: 10.15407/pp2022.03-04.301

A. Doroshenko, I. Achour

{"title":"Automated generation of programs for a class of parametric neuroevolution algorithms","authors":"A. Doroshenko, I. Achour","doi":"10.15407/pp2022.03-04.301","DOIUrl":"https://doi.org/10.15407/pp2022.03-04.301","url":null,"abstract":"The facilities of algebra of hyperschemes are applied for automated generation of neuroevolution algorithms on an example of a binary multiplexer evaluation problem, which is a part of the SharpNEAT system. SharpNEAT is an open-source framework developed in C# programming language, which implements a genetic neuroevolution algorithm for the .NET platform. Neuroevolution is a form of artificial intelligence, which uses evolution algorithms for creating neural networks, parameters, topology, and rules. Evolution algorithms apply mutation, recombination, and selection mechanisms for finding neural networks with behavior that satisfies to conditions of some formally defined problem. In this paper, we demonstrate the use of algebra of algorithms and hyperschemes for the automated generation of evaluation programs for neuroevolution problems. Hyperscheme is a high-level parameterized specification of an algorithm for solving some class of problems. Setting the values of the hyperscheme parameters and further interpretation of a hyperscheme allows obtaining algorithms adapted to specific conditions of their use. Automated construction of hyperschemes and generation of algorithms based on them is implemented in the developed integrated toolkit for design and synthesis of programs. The design of algorithms is based on Glushkov systems of algorithmic algebra. The schemes are built using a dialogue constructor of syntactically correct programs, which consists in descending design of algorithms by detailing the constructions of algorithmic language. The design is represented as an algorithm tree. Based on algorithm schemes, programs in a target programming language are generated. The results of the experiment consisting in executing the generated binary multiplexer evaluating program on a cloud platform are given.","PeriodicalId":313885,"journal":{"name":"PROBLEMS IN PROGRAMMING","volume":"39 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":"128268135","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}

引用次数: 0

Generation of multipurpose formal models from legacy code 从遗留代码生成多用途正式模型

PROBLEMS IN PROGRAMMING Pub Date : 2022-12-01 DOI: 10.15407/pp2022.03-04.042

S. Potiyenko, A. Kolchin

{"title":"Generation of multipurpose formal models from legacy code","authors":"S. Potiyenko, A. Kolchin","doi":"10.15407/pp2022.03-04.042","DOIUrl":"https://doi.org/10.15407/pp2022.03-04.042","url":null,"abstract":"In this paper a method for generation of formal models from legacy systems code is proposed. The purpose of these models is to have a possibility of their application in different tasks such as automatic generation of executable tests, translation to modern programming languages, reverse engineering. The method pursues goals to decrease complexity of state space search and checking formulas satisfiability in relation to the direct code modeling, and to help legacy systems understanding and implementing in modern technologies. We focused on formalization of Cobol memory model as it is the most common language in legacy systems. Formal model is an attribute transition system with control flow. We proposed an algorithm for building enumerated types for any variables whose usage fulfills certain conditions, including translation procedure of numeric variables to enumerated ones. We considered a problem of translating non-comparable structures which overlap in memory (operator redefines in Cobol), are copied or compared with each other. In opposite to common approach of using union semantics (like union construction in C++), we described a method of structure fields decomposition which has no drawbacks of unions and makes for minimization of bytewise approach. We considered the developed method on the examples of structures as with simple fields as with arrays. We also gave examples of realization of bytewise approach in Java and C++ languages for those variables that cannot be represented as enumerated or numeric attributes. We tried this work for tests generation for middle-sized projects (up to 100 000 lines of code) where it showed efficiency of developed method, also generated formal models were used for debugging of Cobol to Java translator and business rules extraction.","PeriodicalId":313885,"journal":{"name":"PROBLEMS IN PROGRAMMING","volume":"122 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":"132605858","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}

引用次数: 0

Boyko Ontological system processing of databases of scientific publications 科学出版物数据库的本体系统处理

PROBLEMS IN PROGRAMMING Pub Date : 2022-12-01 DOI: 10.15407/pp2022.03-04.161

O. Palagin, N. Petrenko, M. Boyko

{"title":"Boyko Ontological system processing of databases of scientific publications","authors":"O. Palagin, N. Petrenko, M. Boyko","doi":"10.15407/pp2022.03-04.161","DOIUrl":"https://doi.org/10.15407/pp2022.03-04.161","url":null,"abstract":"Development of theories, methods and algorithms for the discovery and formation of new knowledge always was one of the most important tasks for any researcher, especially if they actively working on creation of new scientific publications. There is no universal language to describe formally concepts (knowledge) and systemology of transdisciplinary scientific research. Because of this, researchers have a set of urgent problems, and one of them is the way of speeding up the process of finding information (in the form of cognitive-structure) in their own sources. Ontological system for processing of databases of scientific publications created to solve this problem for a researcher, who have from tens to hundreds of scientific papers published. We are unaware of search systems, which would provide the same information for a researcher in such a short time. Ontological system implements technologies of Information Retrieval and Knowledge Discovery in Databases with accent on technologies and instruments such as Semantic Web and cognitive graphics. Development of such ontological system have three stages. On the first stage instruments for system development created, methods and algorithms of interaction between system components \"User ¾ Knowledge engineer ¾ Remote endpoint\", also data added to the system at this stage. On the second stage task of multimedia presentation for conceptual and figurative structures, described in scientific documents, solved. Gaining new knowledge problem solved on the third stage.","PeriodicalId":313885,"journal":{"name":"PROBLEMS IN PROGRAMMING","volume":"4 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":"130965804","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}

引用次数: 0

From temporal data to dynamic causal models 从时间数据到动态因果模型

PROBLEMS IN PROGRAMMING Pub Date : 2022-12-01 DOI: 10.15407/pp2022.03-04.183

O. Balabanov

{"title":"From temporal data to dynamic causal models","authors":"O. Balabanov","doi":"10.15407/pp2022.03-04.183","DOIUrl":"https://doi.org/10.15407/pp2022.03-04.183","url":null,"abstract":"We present a brief review of dynamic causal model inference from data. A vector autoregressive models is of our prime interest. The architecture, representation and schemes of measurement of temporal data and time series data are outlined. We argue that require- ment to data characteristics should come from the nature of dynamic process at hand and goals of model inference. To describe and evaluate temporal data one may use terms of longitude, measurement frequency etc. Data measurement frequency is crucial factor in order to an inferred model be adequate. Data longitude and observation session duration may be expressed via several temporal horizons, such as closest horizon, 2-step horizon, influence attainability horizon, oscillatory horizon, and evolutionary horizon. To justify a dynamic causal model inference from data, analyst needs to assume the dynamic process is stationary or at least obeys structural regularity. The main specificity of task of dynamic causal model inference is known temporal order of variables and certain structural regularity. If maximal lag of influence is unknown, inference of dynamic causal model faces additional problems. We examine the Granger’s causality concept and outline its deficiency in real circumstances. It is argued that Granger causality is incorrect as practical tool of causal discovery. In contrast, certain rules of edge orientation (included in known constraint-based algorithms of model inference) can reveal unconfounded causal relationship.","PeriodicalId":313885,"journal":{"name":"PROBLEMS IN PROGRAMMING","volume":"2 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":"123404890","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}

引用次数: 0

Method of detection of http attacks on a smart home using the algebraic matching method 使用代数匹配方法检测对智能家居的http攻击的方法

PROBLEMS IN PROGRAMMING Pub Date : 2022-12-01 DOI: 10.15407/pp2022.03-04.396

V.O. Gorbatiuk, S.O. Gorbatiuk

引用次数: 0

Organizational basics of operating digital platforms 运营数字平台的组织基础

PROBLEMS IN PROGRAMMING Pub Date : 2022-12-01 DOI: 10.15407/pp2022.03-04.491

V. Gorbachuk, S. Gavrylenko, G. Golotsukov, M. Pustovoit

{"title":"Organizational basics of operating digital platforms","authors":"V. Gorbachuk, S. Gavrylenko, G. Golotsukov, M. Pustovoit","doi":"10.15407/pp2022.03-04.491","DOIUrl":"https://doi.org/10.15407/pp2022.03-04.491","url":null,"abstract":"Network effects are determined by the influence of an additional user of a product or service on the value that other users attach to this product or service. Platforms are then defined as entities that connect economic agents, actively managing network effects among the digital copies (images) of those agents. Network effects are distinguished by their sources: such sources can be users of the only group or users of several groups. Because, on a digital platform, network effects are generated jointly by all users, regardless of the groups to which they belong, and interest in the platform increases when the volume of interaction this platform manages increases, it is difficult to distinguish between different sources of network effects. User participation in the platform and their application of platform features can be important because their active evaluation of products and services, together with information provided by user actions (for platforms that collect and apply big data), gives an understanding of those actions, allows providing better services by the platform or adding specific offers. When consumers search for a product, they face travel costs, price information costs, and product feature comparison costs. When suppliers are looking for a willing buyer, they incur travel costs and communication costs regarding their products. Intermediaries reduce transaction costs by centralizing the exchange. In the presence of a random-matching market, there are profitable opportunities for intermediaries to conduct centralized exchanges, since buyers and sellers are influenced by the type of their matching partner, and intermediation allows self-selecting for types of economic agents. Intermediated trade can partially or completely replace decentralized trade and lead to more socially efficient allocations.","PeriodicalId":313885,"journal":{"name":"PROBLEMS IN PROGRAMMING","volume":"22 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":"122344322","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}

引用次数: 0