Harvester open publications of NAS Ukraine
Harvester open publications of NAS UkraineNot a member yet
2350 research outputs found
Sort by
Integration of the description logics with operations at role constructors into relational data model
No full textThe paper is a logical continuation of the previously published work, which was dedicated to the creation of mappings from the description logic into binary relational data model. Based on the previously created binary relational data structure we perform mappings of the ALC extension into relational data model (RDM). The results of previous research namely data structure RM2, mappings of the basic ALC concepts and its classical extensions into RDM were used in this paper.Problems in programming 2016; 4: 58-6
Essential issues of modern floating point arithmetic
No full textAn overview of modern floating point arithmetic is presented. Aspects that differ from real numbers arithmetic and thus being the source of many numeric problems are emphasized. These problems scale drastically given volume of a data is large and computations being parallel. Nevertheless, it is possible to minimize and even guarantee a certain precision of the results even without considerable loss of performance
The practice investigation of the information technology efficiency for automated definition of terms in the semantic content of educational materials
No full textThe information technology on base of the disperse evaluation, which with enough high efficiency allows automated define the semantic terms in content of educational materials article is given. The factors that hinder effective analysis of educational materials have been considered. High efficiency offered technologies gives possible of its using in row of the problems, such as estimation of the correspondence of educational materials to requirements, estimation of the correspondence of set test tasks to educational materials, semantic help of making tests, automated keyword list and abstract generation.Problems in programming 2016; 2-3: 237-24
Reference model for Semantic Web adaptive composite service
No full textAn innovative Approach is substantiated for such a Semantic Web Service (ACS) on-line composing that is adaptive – able to change its behaviour to meet new requirements and to fit new (un)foreseen situations – and applicable by third parties for any composing method. Reference Model is presented for ACS being considered as Dynamic Line of changeable Semantic Services for customers in target domain. The Basics for ACS engineering through Dynamic Variability Management over the Line are stated. ACS Diagnostic Variability Model to clarify its on-line adaptation Needs and Strategies is elaborated. The operations are formalized to implement the Strategies – namely, (un)anticipated change of the Component Services set, their interim Compositions’ structure and functions, ACS itself functions – with the isomorphism proposed between the Models of its functions and, respectively, Composite Services.Putting Approach into practice enables effectiveness and efficiency increasing of business processes with the heterogeneous and unstable contexts usage and re-engineering.Problems in programming 2017; 4: 051-06
Peterson’s algorithm Total correctness proof in IPCL
Get PDFThe total correctness of the Peterson’s Algorithm has been proved. States and transitions were fixed by the program. Runtime environment considered is interleaving concurrency with shared memory. Invariant of the program was constructed. All reasoning provided in terms of Method for software properties proof in Interleaving Parallel Compositional Languages (IPCL). Conclusions about adequacy of the Method usage for such a kind of tasks (thanks to flexibility of composition-nominative platform) and its practicality as well as ease of use for real-world systems have been made based on this and other author’s works.Problems in programming 2016; 2-3: 113-11
Integration of the description logics axiomatic into relational data model
No full textThe paper is a logical continuation of the previously published work, which was dedicated to the creation of mappings from the description logic into binary relational data model. On base of the previously created binary relational data structure we perform mappings of the ALC axiomatic into relational data model (RDM). The results of previous research namely data structure RM2, mappings of the basic ALC concepts were used in this paper.Problems in programming 2017; 1: 51-5
The expert analytic process for the choice of the organization management actions using corporative knowledge. Part II. Methods and Models of the Expert Methodology
No full textPaper is devoted to the models and the methods of support for the special process of the alternative management action expert choice when the action has to be realized by organizational measures. Such the choice takes into account the influence of the action on the decidable problem situation and its probable negative aftereffects in organization activity field. In Part I the model of the organization goals is presented. This model includes such the types of goals as standard, planned, produced by stakeholders' interests and brought about the decisions made in organization ones. The goals included are both hard and soft ones. The properties of goals such as equivalence, opposition and accessibility are formalized by means the model proposed. The analysis of these properties that is realized under actual state of the decision field and goals field of organization is employed as important analytical support for the expert analytical choice process. It includes the functions of the context and recommendations forming for the action perspectivity expert evaluation that will be considered in the next part of this paper.Problems in programming 2018; 1: 92-10
Logics of general non-deterministic predicates: semantic aspects
No full textSemantic aspects of a new class of program-oriented logical formalisms – logics of general non-deterministic quasiary predicates (GND-predicates) – are considered. Сlasses of GND-predicates are singled out, their compositions and algebras are investigated. The language of pure first-order logics of GND-predicates is described. The relation of the logical consequence for the sets of formulas is proposed and investigated. The properties of the decomposition of formulas and of quantifier elimination are described.Problems in programming 2018; 2-3: 031-04
Functionality and Statistics of the use of the scientific digital library of periodical publications of the NAS of Ukraine
No full textBrief overview of the functionality of the Scientific Digital Library of periodicals of the National Academy of Sciences of Ukraine is presented, as well as its usage statistics. The library was created in the Institute of Software Systems of the National Academy of Sciences of Ukraine as one of the projects under the Informatization Program of the NAS. The digital library is deployed in the Vernadsky National Library of Ukraine and it is supported and accompanied by the Institute of Software Systems of the National Academy of Sciences of Ukraine. Statistics are collected as of January 2017.Problems in programming 2017; 3: 68-9
Use of ontological knowledge by intelligent agents
No full textOntological means of knowledge representation in the Web-oriented intelligent information systems are considered. The formal model of ontology that ensures the use of knowledge from various distributed applications that support semantic information processing is proposed. The specifics of this model is a separation into the special group of characteristics of such ontological elements as classes and object and data properties – hierarchical, disjoint and equivalent etc. Use of ontologies into the intelligent applications differs significantly according with their role – internal and external. The properties of internal and external ontologies and their use by intelligent personal software agents whose behavior is modeled through the apparatus of intentional relations (beliefs, knowledge and purpose) are considered. Personal software agents are considered as a subclass of computer agents. Their intelligence level is analyzed as far as their management of distributed knowledge is concerned. Problems in programming 2017; 2: 82-9