Harvester open publications of NAS Ukraine
Harvester open publications of NAS UkraineNot a member yet
2350 research outputs found
Sort by
Using Petri nets to design parallel applications
No full textA set of CAA-M schemes corresponding to the most common workflow templates has been created. This makes it possible to use both approaches in order to transform the representations of the algorithm and use their features and advantages (modelling or a set of formal transformations). Using the considered templates, a generalised Petri net of the Floyd-Warschall algorithm for a set of parallel threads is constructed. This network is valid for a number of architectures (SMP, MPP, GPGPU technology architectures: Fermi, G80), but requires some specification of its elements for each of them, which is partially considered in the paper.Prombles in programming 2013; 2: 32-4
Partial evaluation in insertion modeling system
Get PDFThe paper relates to practical aspects of insertion modeling. Insertion modeling system is an environment for development of insertion machines, used to represent insertion models of distributed systems. The notions of insertion modeling are stated. The main features of partial evaluation are described in the paper. The concep-tion of partial evaluation in insertion modeling is presented.Problems in programming 2013; 1: 14-2
Accelerating algorithms for Bayesian network recovery. Adaptation to structures without cycles
No full textWe demonstrate a technique to improve algorithms for reconstruction of dependency structures from data. Modification proposed, not affecting performance in general case, facilitates recovering a dependency forest or poly-forest by means of first-rank tests only, thus reducing computational complexity. Prombles in programming 2011; 1: 63-6
The automated probability-algebraic simulation of the reliability of difficult systems
No full textThe approach to research the reliability of difficult systems and the resources of its automation grounded on the method of probability-algebraic simulation is stated, allowing to define the probability characteristics of the reliability of difficult systems under characteristics of reliability of components which make them. The changes occurring to each of components are modeled. Links between the components, defining changes of characteristics of system as a whole are considered.Prombles in programming 2011; 1: 89-9
Formal description of the types and - data structures mixed programmes
No full textExamines examines the approaches to the formal submission types and data structures of programming language, subject-oriented languages such as DSL, which are used to describe the diverse programs at Applied-domains. The analysis software specifications ready program with fundamental, general and specific data types for specification some of the concepts and tasks of subject areas.Problems in programming 2011; 2: 50-6
The construction and transformation of operations and some algorithmic designs of algorithms’ algebra with the data
No full textProperties of the operations which enter into the signature of algorithms’ algebra with the data are considered. Possibility to create the derivative operations convenient for various appendices, in particular with the fixing logic conditions, taking into account efficiency of realization in a target programming language is shown. Possibility to carry out optimizing transformations of algebra’s operations and typical algorithmic designs is shown. Problems in programming 2011; 4: 3-1
National localization of electronic signatures in modern office suites
No full textAn article describes a typical process of signing on the basis of the requirements of the standard model of qualified public key infrastructure. Article deals with comparison of technological capabilities of MS Office 2010 and model of the signature process. Specific recommendations on the national Ukrainian localization of MS Office 2010 are given in article.Prombles in programming 2011; 4: 85-8
Multilevel additive-multiplicative model of generalized indicators assessment on the basis of balanced scorecard strategic management
No full textThe problem of generalized indicators assessment on the basis of balanced scorecard strategic management is considered. The multilevel additive-multiplicative model of generalized indicators assessment of balanced scorecard is proposed. The proposed model appears to be easy to use and makes it possible to boost the adequacy of assessments, which are used in strategic management.Problems in programming 2010; 1: 108-11
Calorie calculation software system
No full textThis article describes the concept and essence of healthy nutrition, approaches to data analysis and reporting of food intake taking into account personal data, the role and features of creating software systems for calculating calories using various architectural solutions. As a result of the comparative analysis of the specified systems, a monolithic architecture was chosen, on the basis of which a software system for counting calories was designed, implemented, and tested using the Microsoft Visual Studio 2022 development environment; .Net Framework version 7.0.0; ADO.NET technologies; Windows Presentation Foundation (WPF); C# programming language; XAML markup languages; Microsoft SQL Server 2019 database in order to improve the quality of user experience.Prombles in programming 2024; 2-3: 199-20
Genetic algorithm for structural adaptation of sorting algorithms
Get PDFConstructivism was applied to form the sorting algorithm code. The meta-algorithm of program code generation is presented. Parts of existing sorting algorithms and auxiliary utilities are used for generation. A genetic algorithm was used to select the algorithm with the maximum time efficiency under the given conditions of use. The use of a standard genetic algorithm faces a problem associated with a different number of elementary sorting operations, which leads to the use of chromosomes of diff erent lengths. To solve the problem, a representation of the chromosome in the form of a binary tree is proposed. Each node has start genes, end genes, and two child nodes. To form an algorithm that is guaranteed to sort the array, all end nodes (leaves) include the final sorting gene at the end of the start genes sequence. This gene is decoded by calling the existing sorting algorithm, which is guaranteed to perform sorting. Crossover and mutation operations are performed on chromosomes in the form of a binary tree. Crossover is performed using the exchange of tree branches. Mechanisms of coding and decoding of the sorting algorithm from chromosome have been implemented. Decoding and formation of a suitable sorting algorithm is performed using linearization: formation of a textual representation using a depth-first tree traversal algorithm. The fitness function is defined as the average time of sorting randomly generated arrays for sorting (identical arrays for all chromosomes) in some stable environment, considering certain features of these arrays. It is possible to use other fitness functions related to the number of calculations, comparisons, or permutations. The developed software should be used for adaptation of sorting algorithms to stable input data streams and environments. Prombles in programming 2024; 2-3: 11-1