Harvester open publications of NAS Ukraine
Harvester open publications of NAS UkraineNot a member yet
2350 research outputs found
Sort by
-calculus as a realistic formalization of a class of rewriting systems
No full textA new formalism of typed -calculus is offered as theoretical foundation for the construction of the special classes of programming systems based on rewriting rules. The formalism utilizes the ordered non-confluent sets of rewriting rules and interaction with programming environment that allows to extend possibilities of programming dynamic applications.Problems in programming 2011; 2: 3-1
On application of machine-learning for designing adaptive sorting programs in algebra of algorithms
No full textThe experiment on development of adaptive sorting program on the basis of usage of algorithm selection method, machine learning system and algebra-algorithmic approach is conducted. Machine learning facilities allow to automatize constructing of adaptive algorithm on the basis of analysis of experimental data, related to execution of initial algorithms. Designing of algorithms is based on usage of systems of algorithmic algebras.Prombles in programming 2011; 2: 23-3
Applicability of qualified public key infrastructure in Ukraine
No full textThe paper-founded approach to the construction of the National System of digital signatures based on the EU regulatory framework. Describes the business algorithms using digital signature as "anchor" of trust. Analyzed the degree of integration of digital signature based on the regulatory framework of the EU, modern office suites, as basic tools of e-business services.Prombles in programming 2011; 3: 79-8
First-order composition-nominative logics with generalized renominations
No full textFirst-order composition-nominative logics of partial single-valued, total multi-valued, and partial multi-valued quasiary predicates are investigated. It is proposed to extend these logics with generalized renominations and special predicates that detect if the subject variables have assigned values. Languages and semantic models of such logics are defined, their semantic properties, in particular, properties of relations of logical consequence are studied.Prombles in programming 2014; 2-3: 17-2
Specialized search engine system of scientific materials in Ukrainian language with social aspects
No full textThe paper describes the architecture of search engine scientific materials in Ukrainian language with the social component. Considered and the choice of technologies to develop a system described by its functionality. The algorithm for the selection scientific articles logical parts in the PDF documents.Prombles in programming 2014; 2-3: 303-21
First-order logics with partial predicates for checking variable definedness
Full text linkWe study semantic properties of new classes of program-oriented logics of partial quasiary predicates without monotonicity restriction. A feature of these logics is the use of special 0-ary parametric compositions – partial predicates which checks whether a subject name (variable) has a value in a given data. Such predicates-indicators are needed for quantifier elimination: from formulas of the form x we come to formulas of the form To perform such elimination in logics of non-monotonic predicates, the condition of definedness of a name z is needed, meaning a component with the name zis contained in the input data. We propose two types of pure first-order logics with partial predicates-indicators: LQ and LQ. Logics LQ use extended renominations, while LQ use traditional renominations. In this paper we describe composition algebras and languages of these logics, and introduce and investigate logical consequence relations for formulas and sets of formulas of the language: irrefutability (IR), truth (T), falsity (F) and strong (TF) logical consequences. Conditions that guarantee the logical consequence relation are considered, and their main properties are specified. Special attention is paid to the properties related to predicates-indicators and quantifier elimination. Logical consequence relations’ properties are the semantic basis for sequent calculi’s construction. Basic properties of a given logical consequence relation induce respective sequent forms for the corresponding calculus; properties that guarantee the logical consequence relation induce closedness conditions for sequents in this calculus. Construction of such sequent calculi is planned in the future works.Prombles in programming 2024; 4: 23-3
Декоративні багаторічники у квітникарстві Центральної України: таксономічне різноманіття, структурний аналіз, успішність натуралізації чужорідних видів
No full textThis study presents a comprehensive analysis of the taxonomic diversity, acclimatization processes, and naturalization success of ornamental herbaceous perennials and semi-woody plants in Central Ukraine. The role of these plants in regional floriculture and the ecological risks associated with their introduction are discussed. It was found that regional floriculture probably has a long history, but the first specific records on the study object appeared at the end of the 18th century. The research revealed that 794 species, subspecies, and hybrids from 301 genera and 70 families are cultivated in the regional floriculture. The largest number of species and infraspecific taxa belong to the families Asteraceae (11.6 %), Asparagaceae (6.5 %), Lamiaceae (6.5 %), Ranunculaceae (6.0 %), and Crassulaceae (5.3 %). The most represented genera are Allium (25 species), Iris (19 species and hybrids), and Primula (14 species and hybrids). It was found that 84.5 % of the studied species and infraspecific taxa are ergasiophytes, while 15.5 % are native plants, often represented by cultivars, reflecting the predominance of introduced species and cultivars in the assortment of ornamental plants. Among the plants used in floriculture in Central Ukraine, herbaceous perennials species constitute the largest group (77.5 %), while the presence of semi-woody plants (5.1 %) and annual and biennial plants (17.4 %) is significantly lower. The distribution of native species by range types covers all major elements of the natural flora, but species with European (23.6 %), Eurasian (19.5 %), and European-Mediterranean (13.9 %) distribution patterns are the most frequently cultivated. Among ergasiophytes, most species and infraspecies have Asian (28.0 %), Mediterranean (19.4 %), and American (19.1 %) origin, with a significant proportion of hybrids and cultigenous species (11.2 %). Overall, species from all geographic regions, including tropical and oceanic zones, are represented in floriculture.An essential aspect of the study was assessing the acclimatization and naturalization degrees of ornamental alien plants. The scheme for overcoming limiting barriers by alien species was supplemented with a model describing the acclimatization of ergasiophytes and their escape beyond cultivated areas. The acclimatization of ergasiophytes in this study is considered a controlled process that is ongoing simultaneously with spontaneous naturalization. It was found that 44.9 % of ergasiophytes achieved complete acclimatization, 15.4 % penetrated beyond cultivation sites, becoming ergasiophygophytes, 2.7 % naturalized, and 1.5 % acquired invasive status. For example, invasive plants include Helianthus tuberosus, Reynoutria japonica, and Solidago canadensis. Potentially invasive species requiring monitoring and further study comprise Corydalis caucasica, Petrosedum orientale, Symphyotrichum × versicolor, Thladiantha dubia, and others
Application of machine learning models to predict energy consumption in smart home systems
No full textThe article investigates the application of machine learning methods to forecast energy consumption in the con text of smart home systems. The research is based on the internationally renowned PSML (Power System Ma chine Learning) time series dataset, which includes information on electricity consumption, generation, balanc ing and load forecasting in the context of a decarbonized energy network. The PSML dataset is characterized by high detail and covers different time scales - from hourly to daily values, which allows assessing both short-term and medium-term trends in energy consumption. The paper provides a comparative analysis of classical and modern machine learning methods, including regres sion, classification and clustering, for load forecasting and identifying patterns in electricity consumption in the domestic environment. Particular attention is paid to optimizing models for working with big data, processing gaps and anomalies, as well as integrating forecasts into automatic smart home energy management systems.Prombles in programming 2025; 3: 29-3
Constructive-synthesizing modeling of the genetic algorithm chromosomes with encoded sorting algorithms
No full textIn the structural adaptation of algorithms using a genetic algorithm, one of the challenges is encoding the struc ture of algorithms into a chromosome. This article explores an approach to structural adaptation and the devel opment of efficient sorting algorithms based on the paradigm of constructive-synthesizing modeling. A method is proposed for representing chromosomes as encoded structures corresponding to various variants of sorting algorithms. This approach allows the solution search space to be formed not only as a set of numerical parameters but also as complete software. Operations of substitution, partial inference, and composition are described, which enable the synthesis of new sorting algorithms. A genetic algorithm is applied to generate and select functionally equivalent algorithms. Examples are provided of constructing chromosome trees that encode sorting procedures of varying complexity. A program has been implemented for generating and evolutionarily improving chromo somes with encoded sorting algorithms. The application of constructive-synthesizing modeling to the problem of encoding structurally different but functionally equivalent algorithms into chromosomes is demonstrated. Ex perimental results confirmed that usage of constructive-synthesizing modeling increases population diversity and accelerates the discovery of efficient solutions compared to classical genetic algorithms. The proposed method ology can be used for automated algorithm construction, optimization of their structure, and adaptation to spe cific usage conditions.Prombles in programming 2025; 3: 39-52