Harvester open publications of NAS Ukraine
Harvester open publications of NAS UkraineNot a member yet
2350 research outputs found
Sort by
Пам’яті Олександри Петрівни Ісайкіної
No full textIn February 8, 2025, the candidate of biological sciences (1973), laureate of the State Prize of Ukraine in Science and Technology (1992), author of ca. 80 scientific publications, Oleksandra Petrivna Isaykina, passed away. She was a friendly, sensitive and erudite person, sincerely devoted to botanical science.Oleksandra worked at the M.M. Gryshko National Botanical Garden of the NAS of Ukraine since 1984, holding the positions of senior and leading researcher. The major topic of her research activities were the resources of medicinal plants. She worked in the Department of Medicinal Botany, where she was the curator of the “Medicinal Plants” plot. After expeditions to the Danube Plains Nature Reserve, she created a motherwort of selected forms of sea buckthorn, which served as the basis for industrial culture. Later, while working in the Department of Natural Flora, she was the head of the Herbarium, where she organized the card index, conducted an inventory of several families, and processed the Far Eastern herbarium of Sigismund Kharkevich, which he donated to the botanical garden
Determination of the optimal set of methods for iterative improvement of the reference route
No full textThe article solves the problem of a traveling salesman for planning a flight of an unmanned aerial vehicle in the conditions of eliminating the consequences of an emergency. An approach is considered that uses a combination of the nearest point method to create a reference solution and a number of methods of local variations of route points to improve the reference solution. The following methods are included in the reference solution improvement scenario: 1. 1PM - moving 1 point, 2. 2PE - exchanging places of 2 points and 3. DC - eliminating intersections of route segments. When improving the reference solution, the best result is obtained by combining several methods. The quality of route improvement depends on the type of route and the scenario (the set and sequence of methods included in the scenario). The results of the analysis of different scenarios of using reference solution improvement methods are summarized in the form of ordinary graphs and heat diagrams. Route maps are constructed for different scenarios of improving the reference solution. The most effective combinations of methods in the scenarios were 1-3, 3-1, 1-1. The worst combinations: 2-2 and complete repetitions of other methods 1-1-1, 2-2-2, 3-3-3. The magnitude of the gain in improving the quality of the route varied in the range from 1 to 28%, in most cases from 6 to 19%. This required from 2 to 24 iterations, in most cases from 20 to 24 iterations. The Euclidean distance, the hazard coefficient and the Euclidean distance with a multiplier in the form of a logistic function of the hazard coefficient were considered as the cost of the route. The method is designed for the limited computational capabilities of conventional business computers. When iteratively refining the solution, the methodological approach allows you to control the computational procedure in real time and complete it either upon reaching the specified accuracy or when time runs out. The model is created in the algorithmic language Matlab.Prombles in programming 2025; 3: 19-2
An approach to behavioral software models refinement using design patterns
No full textAn approach to behavioral software models refinement is proposed in this paper. Behavioral software models are represented as UML collaboration diagrams. The operation of behavioral software models refinement can be both executed as a separate operation of Model-Driven Architecture (MDA) and Model-Driven Development (MDD) approaches and as a constituent of other technics which require software models transformation or verification [2]. The proposed approach is based on matching of applications’ formalized process description with behavioral constituents of design patterns. Behavioral constituents of design patterns contain formalized representation of application functional requirements that are corresponded with some design pattern. The behavioral design patterns constituents for patterns “Bridge” and “State” are formed. Using this constituents refinement collaboration diagrams are designed. The results of problem domain explorations “Designing of cutting schemas for shoe and leather good details” are systematized. The requirements specification to class library that solves such tasks of the problem domain as designing of convex hull (detail representation), layings, layouts, sections, and cutting schemas is presented. The example of behavioral software models elicitation for solving task of designing laying for shoe and leather good with using formalized analytical representation is represented.Prombles in programming 2014; 2-3: 112-120
Інтродукція Liquidambar styraciflua L. в Україні та успішність його акліматизації в Національному ботанічному саду імені М.М. Гришка НАН України
No full textLiquidambar styraciflua L. plants were screened in all soil and climatic zones of Ukraine in artificial phytocenoses of urban areas, i.e., botanical gardens, parks, squares, green areas, residential areas, and streets.Considering L. styraciflua plants growing in the M.M. Gryshko National Botanical Garden of the NAS of Ukraine (Kyiv) as an example, their introduction success by the acclimatization degree, including the indicators of growth, generative development, winter hardiness, and drought resistance, was calculated. The acclimatization degree of the tested plants reached 90 points, corresponding to a good acclimatization level.Hence, L. styraciflua can be recommended for use in landscape construction to create groups, alleys, or as tapeworms in parks, squares, zoos, landscaping streets, boulevards, squares, adjacent areas near houses and administrative buildings, and private estates. These plants can also be successfully applied in expositions of botanical gardens and arboretums and as objects of topiary art
Principles of modeling GPGPU-applications using Petri nets
No full textA set of rules for formal GPGPU-application representation in terms of Petri nets was introduced. Models of memory allocation and copying, and CUDA streams scheduling were created using described rules.Prombles in programming 2014; 2-3: 57-6
Рaradigms of programming assembling type in software engeneering
No full textA formal apparatus of paradigms of the programming assembling kind, such as modular, objective, component and service programming is presented: The theoretical apparatus of every paradigm secures the formal development of some program elements of these paradigms, determination of interface these elements in the standard kind and their assembling on the single technological basis in environment of complex of ITC IPS.Prombles in programming 2014; 2-3: 121-132
Regression testing: techniques and future research directions
No full textThe most crucial phase in the software life cycle is maintenance phase, in which the development team is supposed to maintain the software which is delivered to the clients by them. Software maintenance results for the reasons like error corrections, enhancement of capabilities, deletion of obsolete capabilities and optimization. Now the changed or modified software needs testing known as regression testing. This paper surveys the two main groups of methods of regression testing (regression test selection methods and methods of prioritization) and discuss open problems and potential directions for future research.Prombles in programming 2014; 2-3: 133-14
Parallel distributed implementation of parallel processing simulation
No full textPrombles in programming 2014; 1: 40-4
The technology of machine learning for a composite web service development
Full text linkWe analyze dynamic programming and machine learning algorithms (on example of Q-learning) used for automatic adaptive composition of web services based on service quality assessments, their input parameters and work specifics. Software implementation of these algorithms on sets of services of different volumes is developed for comparison their performance parameters. We determine that the considered methods allow finding the optimal set of services only for composition with a predefined fixed-length route. This restriction causes a need to generalize the problem formulation for an arbitrary set of service classes in the composition route. On base of the performed analysis, we developed an algorithm that solves this problem of building a composite service with a route of arbitrary length (using the Q-Learning method), that has the best overall quality ratings. A software implementation of both this algorithm and other algorithms for solving this problem (genetic algorithm, greedy search, dynamic programming, SARSA, etc.) are developed to compare the speed of their work and the evaluation of the resulting composite service on data sets of different volumes.Prombles in programming 2024; 4: 3-1