Кафедра інформатики

Permanent URI for this collection

https://ekmair.ukma.edu.ua/handle/123456789/12311

Browse

Now showing 1 - 20 of 198

A Logical-Algebraic Approach to Revising Formal Ontologies: Application in Mereotopology
(2024) Aranda-Corral, Gonzalo; Borrego-Díaz, Joaquín; Chávez-González, Antonia; Gulayeva, Nataliya
In ontology engineering, reusing (or extending) ontologies poses a significant challenge, requiring revising their ontological commitments and ensuring accurate representation and coherent reasoning. This study aims to address two main objectives. Firstly, it seeks to develop a methodological approach supporting ontology extension practices. Secondly, it aims to demonstrate its feasibility by applying the approach to the case of extending qualitative spatial reasoning (QSR) theories. Key questions involve effectively interpreting spatial extensions while maintaining consistency. The framework systematically analyzes extensions of formal ontologies, providing a reconstruction of a qualitative calculus. Reconstructed qualitative calculus demonstrates improved interpretative capabilities and reasoning accuracy. The research underscores the importance of methodological approaches when extending formal ontologies, with spatial interpretation serving as a valuable case study.
Analysis of selection noise in genetic algorithms
(2025) Gulayeva, Nataliya; Borrego-Díaz, Joaquín; Sancho-Caparrini, Fernando
Selection is often considered as a fundamental force in the evolutionary process. Genetic drift, or selection noise, is an important characteristic of selection methods. It has a direct effect on the performance of genetic algorithms. In this paper, a brief review of methods to analyze genetic drift is given, and known estimations of selection noise of various selection schemes used in genetic algorithms are presented. After that, genetic drift ofwidely used proportional, ranking, and tournament selection schemes is thoroughly studied. To this end, two new measures for selection noise analysis are proposed, namely the noise takeover time and pure reproduction rate. Using these measures, the effect of population size, chromosome length, and selection scheme parameters on genetic drift is analyzed. Also, selection schemes known as being selection pressure equivalent are tested for selection noise equivalence. Both theoretical and experimental approaches are used for the analysis. The results obtained are presented in tabular form. Wherever possible, it is indicated whether the obtained results are identical or different from the results of previous studies. Since no comprehensive study of selection noise has been conducted previously, this indication concerns only some of the results. Although our results differ at some points from those presented earlier, they are consistent on both measures.
Complexity of the problem of verifying the coordination mechanism in a system of software support of network collaboration
(Springer New York, 2008) Glybovets, Mykola; Hlomozda, Dmytro
The problem of verifying the coordination mechanism in a system of software support of network collaboration is considered. This problem is demonstrated to be similar to the agent verification problem. It is proved that the problem of verifying the coordination mechanism is co-complete.
Construction of a mathematical model of multiobjective optimization on permutations
(2020) Koliechkina, Liudmyla; Dvirna, Olena; Nahirna, Alla
The article is devoted to the problem of constructing and solving mathematical models of applied problems as multiobjective problems on combinatorial configurations. This question is actual branch because any task of optimal design of complex economic and technical systems, technological devices, planning and management etc. requires that the desired solution be found consider many criteria. It is used transfer to Euclidian combinatorial configurations and using of discrete optimizations methods. Method for solving such problems is considered and it includes the analyzing of structural graph of Euclidean combinatorial configurations sets. These methods can be modified by combining with other multiobjective optimization approaches depending on the initial conditions of the problem. Models for defining real estate contribution plans and production planning as multiobjective discrete problems are proposed. These models can be supplemented as needed by the required functions and, depending on the initial conditions, are presented as tasks on different sets of combinatorial configurations.
Design of Grid Services for Running Virtual Machines as Computing Task Based on Transition Systems
(2017) Kryvyi, S.; Boyko, YU.; Pogorilyy, S.; Boretskyi, O.; Glibovets, M.
Proposed to apply method of grid system design on grid services for running virtual machines as regular computing task. The resulting global transition system is translated into a Petri net (PN). With the help of the PN is checked correctness of design, in particular the absence of deadlocks, dead transitions etc.
Development of a Chat-Bot Graphical Designer
(2023) Gulayeva, Nataliya; Kobieliev, Mykhailo
Chat-bot is a computer program conducting conversations with humans via natural language. There exist several chat-bot classification methods: by interaction mode, design technique, usage goal etc. In this paper, text rule-based task-oriented chat-bots are considered. A graphical designer for these chat-bots to be created and integrated in the Telegram messenger is developed and implemented. At that, chat-bot behaviour is modelled using Finite State Machine (FSM) extended by disabled transitions to save history of transition changes made during FSM design process.
Development of an iOS Application for Task Planning with Consideration of the User’s Emotional State
(2025) Piz, Mariana; Nahirna, Alla
The article focuses on the development of a digital tool designed to address the problem of decreased productivity caused by emotional exhaustion. The main objective of the study is to create an iOS application for task planning that takes into account the user’s emotional state, offers mindful breaks for emotional awareness and recovery, and provides analytics on emotional trends. The research includes a comparative analysis of existing software solutions in the areas of time management and mental well-being. During the development process, modern frameworks, tools, and architectural patterns for iOS development were analyzed. An adaptive planning algorithm was implemented, that takes into accountboth the user’s emotional feedback and the attributes of tasks. As a result of the research, a mobile application named Moodpace was developed using Swift, with SwiftUI for building the user interface, SwiftData for data persistence, and the MVVM architectural pattern to ensure maintainable code structure. During the development process, SwiftLint was used for static code analysis, and SwiftFormat was integrated for automatic code formatting. The app was localized into Ukrainian using String Catalog. The developed application is designed to help users manage their tasks while maintaining balance with their mental well-being. It is suitable for everyday use and especially beneficial for individuals with flexible schedules.
Efficiency of question-answering pipeline in systems with combined LLM and knowledge base usage
(2024) Androshchuk, Maksym
The integration of a large language model (LLM) with a knowledge base (KB) has been shown to significantly enhance the efficiency of question-answering (QA) pipelines. The KnowledgeNavigator framework has demonstrated effectiveness and generalization in QA tasks [1].
EMERECU – темпусівський грант створення електронного мультимедійного ресурсного центру навчальних матеріалів для України
(2006) Глибовець, Микола; Бублик, Володимир
Що собою представляє EMERECU? Це відкрита система для збереження навчальних матеріалів у найбільш розповсюджених форматах. Вона може бути використана і як єдина система організації навчання та управління в традиційній очній системі навчання. Система містить онлайнову навчальну платформу та ресурсний депозитарій, який використовує стандарти LTSC, IMS, SCORM. Використані найновіші технології для запису і трансляції лекцій дозволяють синхронізацію з матеріалами презентації та дуже невибагливі до апаратного забезпечення.
Emotional Experiences and Psychological Well-Being in 51 Countries During the COVID-19 Pandemic
(2024) Sun, Rui; Balabanova, Alisa; Bajada, Claude Julien; Liu, Yang; Kriuchok, Mariia; Voolma, Silja-Riin; Đurić, Mirna; Mayer, Claude-Hélène; Constantinou, Maria; Chichua, Mariam; Li, Chengcheng; Foster-Estwick, Ashley; Borg, Kurt; Hill, Carin; Kaushal, Rishabh; Diwan, Ketaki; Vitale, Valeria; Engels, Tiarah; Aminudin, Rabiah; Ursu, Irina; Fadhlia, Tengku Nila; Wu, Yi-jung; Sekaja, Lusanda; Hadchity, Milad; Deak, Anita; Sharaf, Shahira; Figueras, Pau; Kaziboni, Anthony; Whiston, Aoife; Ioumpa, Kalliopi; Montelongo, Alfredo; Pauw, Lisanne; Pavarini, Gabriela; Vedernikova, Evgeniya; Van Vu, Tuong; Nummenmaa, Lauri; Cong, Yong-Qi; Nikolic, Milica; Olguin, Andrea; Hou, Wai Kai; Israelashvili, Jacob; Koo, Hyunjin; Khademi, Samaneh; Ukachukwu, Chinwendu; Juma, Damian Omari; Kamiloğlu, Roza; Makhmud, Akerke; Lunga, Peter Sigurdson; Rieble, Carlotta; Rizwan, Muhammad; Helmy, Mai; Vuillier, Laura; Manokara, Kunalan; Quezada, Enzo Cáceres; Tserendamba, Delgermend; Yoshie, Michiko; Du, Amy; Philip-Joe, Kumba; Kúld, Pála Björk; Damani, Kalifa; Osei-Tutu, Annabella; Sauter, Disa
The COVID-19 pandemic presents challenges to psychological well-being, but how can we predict when people suffer or cope during sustained stress?Here,we test the prediction that specific types of momentary emotional experiences are differently linked to psychological well-being during the pandemic. Study 1 used survey data collected from 24,221 participants in 51 countries during the COVID-19 outbreak. We show that, across countries, wellbeing is linked to individuals’ recent emotional experiences, including calm, hope, anxiety, loneliness, and sadness. Consistent results are found in two age, sex, and ethnicity-representative samples in the United Kingdom (n= 971) and the United States (n= 961) with preregistered analyses (Study 2). A prospective 30-day daily diary study conducted in the United Kingdom (n= 110) confirms the key role of these five emotions and demonstrates that emotional experiences precede changes in well-being (Study 3). Our findings highlight differential relationships between specific types of momentary emotional experiences and well-being and point to the cultivation of calm and hope as candidate routes for well-being interventions during periods of sustained stress.
Experimental analysis of multinational genetic algorithm and its modifications
(2021) Gulayeva,Nataliia; Yaremko, Solomiia
Context. Niching genetic algorithms are one of the most popular approaches to solve multimodal optimization problems. When classifying niching genetic algorithms it is possible to select algorithms explicitly analyzing topography of fitness function landscape; multinational genetic algorithm is one of the earliest examples of these algorithms. Objective. Development and analysis of the multinational genetic algorithm and its modifications to find all maxima of a multimodal function. Method. Experimental analysis of algorithms is carried out. Numerous runs of algorithms on well-known test problems are conducted and performance criteria are computed, namely, the percentage of convergence, real (global, local) and fake peak ratios; note that peak rations are computed only in case of algorithm convergence. Results. Software implementation of a multinational genetic algorithm has been developed and experimental tuning of its parameters has been carried out. Two modifications of hill-valley function used for determining the relative position of individuals have been proposed. Experimental analysis of the multinational genetic algorithm with classic hill-valley function and with its modifications has been carried out. Conclusions. The scientific novelty of the study is that hill-valley function modifications producing less number of wrong identifications of basins of attraction in comparison with classic hill-valley function are proposed. Using these modifications yields to performance improvements of the multinational genetic algorithm for a number of test functions; for other test functions improvement of the quality criteria is accompanied by the decrease of the convergence percentage. In general, the convergence percentage and the quality criterion values demonstrated by the algorithm studied are insufficient for practical use in comparison with other known algorithms. At the same time using modified hill-valley functions as a post-processing step for other niching algorithms seems to be a promising improvement of performance of these algorithms.
Extension of scala language by distributed and parallel computing tools with Linda coordination system: [author's post-print]
(2010) Glybovets, Mykola; Gorohovskiy, Semen; Stukalo, M.
The paper describes a new library developed for Linda language implementation for Scala programming language (language support of the component programming software). The library uses client-server architecture and a database for the tuple space representation. It implements the search for similarities and “primitive” and additional operations. The library can be used for distributed and parallel application development.
Finding the Optimal Solution to the Problem of Conditional Optimization on the Graph of the Set of Partial Permutations
(2020) Koliechkina, Liudmyla; Nahirna, Alla
An optimization problem on a combinatorial set of partial permutations with additional constraints is formulated in the paper. An algorithm for solving this type of problem is considered, which consists of four steps. The algorithm lies in constructing a graph of a set of partial permutations to find the optimal solution. An example of a practical implementation of the presented algorithm is given.
Fourier descriptors for shape characterization
(ВПЦ НаУКМА, 2011) Buchko, Olena
У статті розглянуто методи опису форми на основі дескрипторів Фур’є. Побудовано дескриптори Фур’є на основі кутової і комплексної репрезентації форми, запропоновано новий дескриптор. Проаналізовано здібності дескрипторів характеризувати форми різних об’єктів.
Information system assessment of the creditworthiness of an individual
(2022) Nahirna, Alla; Chumachenko, Oleksandra; Pyechkurova, Olena
Nowadays enterprise information systems of banks provide modules for calculating creditworthiness of the business. Such systems are complex and it is difficult to maintain and develop them. Moreover, it requires the involvement of large teams. In addition, systems are complicated to change and update in accordance with changes in current legislation. From another point of view, demand for consumer loans is high, and creating a separate module for calculating the creditworthiness of an individual is appropriate in case of increasing the adaptability to changes and updates of the system. Calculating the creditworthiness of an individual is relevant not only for the banking system, but also for other spheres such as logistics and marketing. The work describes the created information system for calculating the creditworthiness of an individual, which calculates the class of the borrower based on data from credit history, credit rating, quality characteristics, financial indicators of the person and characteristics of the credit transaction. The use of the Asp.Net Core platform and the Vue.js framework to build a software module that can be used both independently and easily integrated into other corporate systems is demonstrated. In this work the major steps of designing and developing the system are described.
Massively Parallel MorphoNAS Implementation
(Національний університет "Києво-Могилянська академія", 2025) Medvid, Serhii
Our GPU-accelerated MorphoNAS (Morphogenetic Neural Architecture Search) enhances the biologically motivated developmental model of the original MorphoNAS, from sequential developmental simulations to large scale parallel simulation. Like the original CPU-based MorphoNAS system, the GPU enhanced version models morphogenesis (neural development) through reaction-diffusion, progenitor differentiation and axon-guided wiring that grow recurrent controllers. Unlike the original CPU-based version, the GPU-based version has the ability to formulate growth and control in parallel execution of thousands of genomes. Through use of sparse, device-resident representations of developmental dynamics and recurrent rollouts, we produce behaviorally equivalent recurrent controllers with up to three orders of magnitude speedup. As a result, we have enabled the possibility of performing evolutionary search over populations of developmental programs, transforming MorphoNAS from a proof-of-concept model of artificial morphogenesis and adaptive architecture discovery to a scalable framework for those objectives.
The Mathematical Model of the Optimal Choice of a Software Package for an Enterprise Information System
(2019) Koliechkina, Liudmyla; Nahirna, Alla
The mathematical definition of the optimal choice problem for software package for an enterprise information system is considered. The problem of the optimal software package choice is a mathematical model of combinatorial optimization on a set of combinations. The algorithm for solving this problem is presented for finding the minimum value of the target function considering additional linear constraints. This method makes it possible to significantly simplify the finding procedure of the optimal solution, since inequalities in the growth of constraints allow us to immediately determine whether a point in the set of combinations will be a support solution or not. In the positive case, the support solution is improved, taking into account the properties of many combinations when directly checking the growth of the target function. The algorithm and its realization are demonstrated by a numerical example. The proposed mathematical model and solution algorithm can be used for a similar class of problems that are modeled by optimization models, where the set of feasible solutions is presented in the many combinations form.
MorphoNAS-Bench: a Benchmark Suite for Morphogenetic Neural Network Generation
(2025) Medvid, Serhii
We present MorphoNAS-Bench, a benchmark and toolkit for neural architecture search (NAS) using a generative, developmentally inspired design space. Unlike current NAS benchmark datasets (NAS-Bench-101, NATS-Bench) that use static graph encodings of networks, in MorphoNAS-Bench networks are simple, compact genomes that drive morphogenetic development, allowing for a variety of richly defined, spatially embedded recurrent architectures that emerge through different forms of deterministic growth. The following local developmental rules are used in MorphoNAS to grow genomes: morphogen diffusion, cell division, differentiation, and axon guidance as key mechanisms. The seed benchmark dataset presented in this work consists of 1,000 genome-architecture pairs, taken from a pool of over 50,000 generation attempts using the following quality thresholds: a minimum 5 neurons, 3 edges, and 70% out-degree coverage. The dataset was constructed using Latin Hypercube Sampling (LHS) with orthogonal array design to ensure comprehensive parameter space coverage. The attempts were conducted using both fully stratified parameter sampling and a biologically inspired Genome.random() sampling method, ensuring a reasonable level of coverage of the search space while being plausible. Each sample includes detailed annotations of graph entropy, hierarchy scores, core-periphery structure, transitivity, reciprocity, and structural balance metrics. We share an analysis of the emergent properties like size, modularity, grouping, and efficiency, demonstrating that both generation strategies can produce structured networks that are rich in their nontriviality. The provided Python toolkit provides the means of investigation to test how genomes develop into neural networks, with associated structural analysis, framing MorphoNAS-Bench as a reproducible and biologically inspired testbed for any research studies exploring architecture diversity, evolution, and emergent structure in NAS.
The Practical Aspect of Using a Combinatorial Model on Configuration of Combinations
(2019) Koliechkina, Liudmyla; Nahirna, Alla
The paper proposes the practical task of choosing a set of programs to protect information at the enterprise. An optimization combinatorial model is built on the configuration of combinations to solve the task. An algorithm for finding a solution to this optimization problem is presented. A practical example of the use of a optimization combinatorial model and the search for the best choice of a set of programs for data protection at the enterprise is given.
Quadratic Optimization Problem on Permutation Set with Simulation of Applied Tasks
(2019) Koliechkina, Liudmyla; Nahirna, Alla; Dvirna, Olena
The article discusses the formulation of an optimization problem with a quadratic target function and additional constraints on the permutation set, which can be a model of many applied problems. An algorithm for solving an optimization problem with a quadratic target function and additional constraints on permutations is proposed. During the implementation of the method the first reference plan is found and additional restrictions for it are checked at the first stage. Thus, in the beginning of the algorithm, the number of considered solutions decreases. This makes it possible at the first stage to reduce the number of possible solutions and narrow the area of the problem study. An example of solving a theoretical problem using this method, demonstrating its effectiveness, is proposed. Such task can be used to modeling various technological processes. The reason for this is the optimization of mathematical models and algorithms for the proposed models.

Browse

Browsing Кафедра інформатики by Title

Results Per Page

Sort Options