Harvester open publications of NAS Ukraine
Harvester open publications of NAS UkraineNot a member yet
2350 research outputs found
Sort by
Флористична характеристика деяких синантропних рослинних угруповань низовини Кобулеті (Аджарія, Грузія)
The materials of the field research of synanthropic vegetation in the territory of the Kobuleti in the 2016–2020 years are provided. In particular, 134 taxa belonging to 49 families and 97 genera were revealed in the three different plant communities (Cryptomerietum japonicae, Eucalyptetum-viminali-globulo-cinerei, and Cinnamomo glanduliferae-Cryptomerietum japonicae) in the Kobuleti lowland. The community Cryptomerietum japonicae comprises 66 taxa, 33 of which are native, and 33 have an alien origin. Woody plants in Cryptomerietum japonicae are represented by 15 taxa. The community Eucalyptetum-viminali-globulo-cinerei comprises 91 taxa, 36 of which are native and 55 are alien. Woody plants in Eucalyptetum-viminali-globulo-cinerei are represented with 17 taxa, while the rest 74 taxa are herbaceous. In Cinnamomo glanduliferae-Cryptomerietum japonicae there are discovered 49 plant taxa, including 25 native and 24 aliens. In this community, 16 taxa are represented by woody plants and 33 taxa – by herbaceous ones.Therefore, in the investigated region, 60 taxa (44.77 %) were found to be native and 74 taxa (55.23 %) alien. Among aliens, 31 taxa have East Asian origin, 16 taxa are from the Mediterranean, 13 taxa originated from Europe, ten taxa originated from North American, and four – originated from Australia.Despite cuttings and artificial planting of alien representatives, some indigenous woody species (i.e., Corylus avellana, Frangula alnus, Vaccinium arctostaphylos, Smilax excelsa, Quercus hartwissiana, Carpinus caucasica, Castanea sativa, and Hedera colchica) still occur in this territory. Both native and alien taxa participate in the formation of the described landscape structure. Successional events have started in the Kolkheti Lowland in ancient times. It is a long-term process, which is still ongoing, as our observations confirmed it
Distributed implementation of neuroevolution of augmenting topologies method
Despite the neuroevolution of augmenting topologies method strengths, like the capability to be used in cases where the formula for a cost function and the topology of the neural network are difficult to determine, one of the main problems of such methods is slow convergence towards optimal results, especially in cases with complex and challenging environments. This paper proposes the novel distributed implementation of neuroevolution of augmenting topologies method, which considering availability of sufficient computational resources allows drastically speed up the process of optimal neural network configuration search. Batch genome evaluation was implemented for the means of proposed solution performance optimization, fair, and even computational resources usage. The proposed distributed implementation benchmarking shows that the generated neural networks evaluation process gives a manifold increase of efficiency on the demonstrated task and computational environment.Prombles in programming 2021; 3: 03-15
Designing RESTful API for the e-procurement system in private sector
The software for the e-procurement system was developed based on .NET Core RESTful API with Open API specifications. The server side uses RESTful API which ensures compatibility with the majority of clients and enables them to exchange information in JSON format. The authentication and authorization flow was implemented using OAuth open standard paired with Microsoft Identity Service. User roles and functionality were handled with a standalone service for authentication and registration that made our system efficient and scalable. Business logic was designed to be split into micro-services accessible through routing controllers. This approach allowed us to separate the responsibilities between the server and the client side. Special authorization headers passed during modification queries allowed us to control and restrict access to particular resources for unauthorized users. The distributed cache mechanism inside the data repository level was used in order to increase the responsiveness of the system. The state handling subsystem was designed utilizing Finite State Machine concepts. The developed system was verified using unit and integration tests.Prombles in programming 2021; 1: 03-1
Extended performance accounting using Valgrind tool
Modern workloads, parallel or sequential, usually suffer from insufficient memory and computing performance. Common trends to improve workload performance include the utilizations of complex functional units or coprocessors, which are able not only to provide accelerated computations but also independently fetch data from memory generating complex address patterns, with or without support of control flow operations. Such coprocessors usually are not adopted by optimizing compilers and should be utilized by special application interfaces by hand. On the other hand, memory bottlenecks may be avoided with proper use of processor prefetch capabilities which load necessary data ahead of actual utilization time, and the prefetch is also adopted only for simple cases making programmers to do it usually by hand. As workloads are fast migrating to embedded applications a problem raises how to utilize all hardware capabilities for speeding up workload at moderate efforts. This requires precise analysis of memory access patterns at program run time and marking hot spots where the vast amount of memory accesses is issued. Precise memory access model can be analyzed via simulators, for example Valgrind, which is capable to run really big workload, for example neural network inference in reasonable time. But simulators and hardware performance analyzers fail to separate the full amount of memory references and cache misses per particular modules as it requires the analysis of program call graph. We are extending Valgrind tool cache simulator, which allows to account memory accesses per software modules and render realistic distribution of hot spot in a program. Additionally the analysis of address sequences in the simulator allows to recover array access patterns and propose effective prefetching schemes. Motivating samples are provided to illustrate the use of Valgrind tool.Prombles in programming 2021; 2: 54-6
Main Aspects of Big Data Semantic Annotation
Semantic annotations, due to their structure, are an integral part of the effective solution of big data problems. However, the problem of defining semantic annotations is not trivial. Manual annotation is not acceptable for big data due to their size and heterogeneity, as well as the complexity and cost of the annotation process, the automatic annotation task for big data has not yet decision. So, resolving the problem of semantic annotation requires modern mixed approaches, which would be based on and using the existing theoretical apparatus, namely methods and models of machine learning, statistical learning, working with content of different types and formats, natural language processing, etc. It also should provide solutions for main annotation tasks: discovering and extracting entities and relationships from content of any type and defining semantic annotations based on existing sources of knowledge (dictionaries, ontologies, etc.). The obtained annotations must be accurate and provide a further opportunity to solve application problems with the annotated data. Note that the big data contents are very different, as a result, their properties that should be annotated are very different too. This requires different metadata to describe the data. It leads to large number of different metadata standards for data of different types or formats appears. However, to effectively solve the annotation problem, it is necessary to have a generalized description of the metadata types, and we have to consider metadata specificity within this description. The purpose of this work is to define the general classification of metadata and determinate common aspects and approaches to big data semantic annotation.Problems in programming 2020; 4: 22-3
A software technology providing tuning procedures of a quantitative model of human hemodynamics
Mathematical modeling and specialized software simulators (SSS) based on quantitative models (QM) are modern research tools expanding research opportunities in human physiology. In particular, lumped-parametric models (LPM) of the cardiovascular system (CVS) have been proposed by many authors. However, most models do not include complex mechanisms providing overall control of human circulation. To fill this gap, we had proposed three special models and a concept of their functional integration. The problem is that the integral model is too complex to be manually tuned. To provide effective tuning procedures, special software containing autonomic modules for the solving equations of each model is proposed. In general, the complex mathematical model (CMM), including both the physiology and the external (inpdynamic ut) influences, is constructed and programmed. The software, taking into account three main blocks of models, provides their quantitative tuning procedures. The first block describes the self-regulation of human hemodynamics in a 23-compartmental lumped-parametric model (LPM) of the cardiovascular system (CVS). The second block describes eight physiological mechanisms independently providing CVS’s acute and long-term control in body horizontal, sitting, and vertical positions. The third block describes external/internal dynamic influences on CVS. The model creator, due to SSS, can manually set values of both compartments’ 92 parameters and sensitivity constants of every physiological mechanism. Special tuning tools allow the modeler to imitate a certain number of tests and to build graphs of hemodynamic responses to the chosen test.Prombles in programming 2020; 4: 03-1
Comparison of the effectiveness of the Map-Reduce approach and the actor model in solving problems with high connectivity of inp data on the example of the optimization problem for a swarm of particles
The paper defines the notion of distributed problems with bounded input components. Particle Swarm Optimization problem is shown to be an example of such a class. Such a problem's implementation based on the Map-Reduce model (implemented on the Spark framework) and an implementation based on an actor model with shared memory support (implemented on Strumok DSL) is provided. Both versions' performance assessment is conducted. The hybrid actor model is shown to be an order of magnitude more effective in time and memory efficiency than Map-Reduce implementation. Additional optimization for the hybrid actor model solution is proposed. The prospects of using the hybrid actor model for other similar problems are given. Problems in programming 2021; 1: 49-5
Mapping of the descriptive logic into RDF using binary relational data model
This paper is dedicated to the data integration problem. To establish relationships between data models is one of the key tasks in this solution. The descriptive logic and the relational data model are at the heart of a study. They have been used to create a mapping method on the theoretical level. The binary relational data model has been developed as a part of a mapping method. The previous studies are continued in this paper to prove on practice a mapping creation method between the descriptive logic and the binary relational data model. The method uses the binary relational data model as an integrating model. This paper continues the previous research of practical implementation of the mapping creation between the descriptive logic and the binary relational data model. The task to prove the theoretical mapping method on practice was formulated. A question how to map the binary relational data model into RDF-triples was considered. A brief overview of the R2R ML conversion tool was given. Triple maps were created to convert a conceptual information model of descriptive logic into RDF triplets with the help of R2R ML. Also, triples maps are described to convert basic mapping mechanisms into RDF with the help of R2R ML. Prombles in programming 2021; 1: 56-8
Чеклист флори околиць м. Балаклії (Харківська область, Україна): аборигенні та чужорідні таксони, поширення рідкісних рослин, нові знахідки
For the first time, information on the flora of the Siverskyi Donets basin in the vicinity of Balakliya town (Kharkiv region of Ukraine) was summarized based on the comprehensive analysis of published data, herbarium material, and own field examinations. Field surveys were conducted during September 2015 and March-July 2016. The surveyed areas were located mainly in the valleys of the Sіverskyi Donets river and some of its tributaries within the former Balakliуa district. The conspectus of flora comprising 933 taxa of vascular plants (including 798 recorded during field surveys) has been prepared. In particular, 739 taxa of native and 194 taxa of alien plants were recorded. The habitats of 14 species from the Red Book of Ukraine were found. The locations of other protected, uncommon and new for the flora of the region plant species were also identified. Several taxa (i.e., some of the calciphytes like Astragalus albicaulis, Linum czernjajevii, Odontarrhena tortuosa subsp. cretacea, Scutellaria supina, and Silene supina) were found out of their previously known ranges. Newly established locations of some other species (e.g., Ephedra distachya, Onosma simplicissima, and Ornithogalum boucheanum) significantly complement previously known chorological data. Finally, information about new findings of such alien taxa actively expanding new areas as Cornus sanguinea subsp. australis, Fraxinus pennsylvanica, Sedum sexangulare, Ulmus pumila, and Vitis vulpina is provided.It has been established that the flora of the Siverskyi Donets basin in the vicinity of Balakliya town is a rich natural center of phytodiversity being under active adventisation. Forest reclamation plantations play a significant role in spreading the alien plants. Railway and the pine terrace of the Siverskyi Donets also serve the migration corridors for many of such alien plants
Дендрофлора Наталіївського парку (Харківська область, Україна): таксономічний склад та моніторинг насаджень
To develop measures for the restoration of historic plantations and landscapes of the Nataliivskyi Park (Kharkiv region, Ukraine), the investigations of taxonomic composition and distribution of woody plant taxa, as well as structure of different landscape areas, were carried out in 2018–2019. The recent studies were realized according to the same protocol applied in 1997 by Y. Klymenko, and taking into account previously published data.In 1939, the dendroflora of the Nataliivskyi Park comprised about 100 taxa. Later, the number of taxa significantly decreased, and in 1950 the park’s dendroflora comprised only about 40 taxa. In 1997 there were 74 taxa reported. Since 1997, the taxonomic composition of the park’s dendroflora has been enriched by ten taxa and is currently represented by 84 taxa. Simultaneously, the number of valuable plants in the plantations decreased (only one or two plants represent some such taxa). Due to a bark beetle attack on drought-weakened trees of Picea abies and P. pungens, most of them withered. The area of allotments with Pinus sylvestris and Quercus robur remained almost the same, which indicates their stability. The area of allotments with the domination of such naturalized introducers as Acer negundo and Robinia pseudoacacia and the area of allotments with the domination of neither taxa have increased. In the landscapes, the redistribution of the types of areas appeared. The forest type of landscape became predominant, while the meadow type of landscape has almost disappeared.Hence, to restore historical plantings and landscapes, it is necessary to re-cultivate taxa represented here during the park’s heyday and remove invasive tree species. Although cuttings in protected areas are currently prohibited, our investigations showed that they might help preserve such valuable territories as Nataliivskyi Park