Harvester open publications of NAS Ukraine
Harvester open publications of NAS UkraineNot a member yet
2350 research outputs found
Sort by
Життєві форми тополі пірамідальної (Populus italica (Du Roi) Moench) на кар’єрно-відвальних комплексах Криворіжжя
Objective – to ascertain the variety of life forms of Populus italica (Du Roi) Moench, naturally inhabiting quarry and dump complexes of Kryvyi Rih area.
Material and methods. In the quarry and dump complexes of iron-ore productions of Kryvyi Rih area, we defined the origin of plants of P. italica, places of their growing; substrate where they grow, and their age. Life forms of P. italica were classified in obedience to A.A. Chistyakova (1987, 1988). We digged out plant rootage, determined the amount of root offspring, their age, height and diameter of above-ground orthotropic shoots.
Results. Because of multi-optional progress during ontomorphogenesis, P. italica can be presented in the adulthood by some life forms: single-trunked tree, few- and multi-trunked tree or tree-bush, clump-forming tree, depending on different ecotopes. A single-trunked trees do not occur often, mainly they are trees of seed origin on the rocky slopes of old dumps in the places of soil washing-off in deepening and gullies. For such individuals, we noted a less height, habitus of crown as compared to the plants of undisturbed habitats, and also less general duration of ontogenesis or his separate periods. Little-trunked forms consist of 2–3 trunks of similar diameters, multi-trunked – from 7–11 trunks. Such life form of P. italica appears as a result of progress of shoots from the asleep buds in basale part of immature and virginil plants and as a result of progress of root shoots. In the even areas of iron-ore dump and quarry complexes, P. italica often forms life form – clumpforming tree – during ontogenesis. Such trees consist more than 90 % of number of self-inhabited plants in the dump of the Pershotravnevyi mine. The maternal individuals were 20–25-year-old, their height varied from 11 to 19 m, and the trunk diameter – from 26 to 34 cm. Area occupied by the root shoots of clump-forming tree of P. italic varied from 25 to 250 m2. The root underwood of P. italica on iron-ore dumps spreads on all directions from a maternal individual and a to 15–20 m can appear in the distance from her. The clump-forming trees of P. italica, being a complex individuals, consist of the united partial formations arising up as a result of branching of superficial roots of 3–5-year-old root shoots with subsequent formation of underwood. These formations can move away from a maternal individual and prove as independent individuals.
Conclusions. The individuals of P. italica of seed origin in dumps and sides of quarries of Kryvyi Rih area stand out with high vitality and because of multioptional progress, can be presented in the adulthood by different life forms. Most often P. italica on iron-ore dumps forms such life form as clump-forming tree due to annual formation of root underwood. As a result the general assimilative surface of such complex individuals increases. Such behavioural strategy of P. italica is an adaptive response to the unfavourable terms of growing in the quarry and dump complexes of Kryvyi Rih area
Game theoretic modeling of AIMD network equilibrium
This paper deals with modeling of network’s dynamic using game theory approach. The process of interaction among players (network users), trying to maximize their payoffs (e.g. throughput) could be analyzed using game-based concepts (Nash equilibrium, Pareto efficiency, evolution stability etc.). In this work we presented the model of TCP network’s dynamic and proved existence and uniqueness of solution, formulated payoff matrix for a network game and found conditions of equilibrium existence depending of loss sensitivity parameter. We consider influence if denial of service attacks on the equilibrium characteristics and illustrate results by simulations.Prombles in programming 2016; 1: 116-12
Fundamentals for Cost Estimating of Applied Software Development and Modification
Keen Methods for Applied Software development and modification Cost estimating with COCOMO, WebMO and D. Cleary models are uniformly enhanced up to state tenders for Software Systems elaboration and maintenance. Generic procedure is proposed for the Methods enhanced cohe-rent use over all the stages of the tenders preparing, performing and control as well as an architecture draft for the tools of its automated support.Problems in programming 2016; 2-3: 264-27
Transformation of the legacy code on Fortran for scalability and cloud computing
Proposed an approach to automatic transformation of the legacy code on Fortran for execution on cloud computing platforms. Proposed architecture of the system based on web-services choreography, which allows infinite scalability of the system and reduces overhead on message passing. Investigated an approach of the approach on example of the program from the quantum chemistry field.Problems in programming 2016; 2-3: 133-14
Fuzzy probability and fuzzy events
The article deals with different approaches to calculating the probability of fuzzy event. We consider The problems in fuzzy formulation, which are solving with help of the proposed approaches to the calculation of fuzzy probability are considered.Problems in programming 2016; 2-3: 170-17
Semantic properties of five-valued logics
A new class of program-oriented logical formalisms – propositional five-valued logics and five-valued logics of quasiary predicates is proposed and studied in the article. The quasiarity of predicates means that their arity is not fixed. A special feature of such five-valued logics is the use of special truth values, indicating errors or uncertainties in various systems, in particular, software systems. The article gives an ontological justification of five-valued logics and examines their examples. For the propositional level, an algebra of truth values is constructed and its semantic properties are studied. For the predicate level, the five-valued logic of quasiary predicates is constructed, its semantic properties are studied, the relation of equivalence of formulas and the relation of logical consequence are introduced, the principle of duality is proved and various normal forms are considered. Further research is focused on constructing algorithms for checking satisfiability and refutability of formulas and constructing various types of calculi for the introduced logics.Problems in programming 2018; 1: 22-3
Formal foundations for software model to model transformation operation
Software model transformation operations are central operations in Model-Driven approaches. In order to represent software models, graphical modeling notations, for example UML, are used. Quality of software model, obtained after transformation, influences on further operations with this model. Thus, it is important to design formal approaches for model to model transformation that are grounded on analytical and mathematical tools. These approaches should provide a background for flexible adopting software model transformational techniques for peculiarities of specific software development lifecycle model.Challenges to mathematical tools and transformation rules that are involved to designing of model to model transformation approaches are formulated in this paper. The ground of mathematical tools choice that is based on these challenges is performed.An approach for performing model to model transformation, which is based on graph transformation, is presented in this paper. Transformational operations are considered on meta-level and concrete level. On meta-level choosing of mathematical tools for representing of transformation stages and transformational artifacts are grounded. Software models are represented as graphs. Initial information for transformation is represented as a set of sub-graphs. Transformation rules are composed using second and first order logics. On the level of the first-order logic all software model elements that participate in transformation are considered. In the level of second-order logic transformation rule considers types of software model element that are participate in the transformation.Proposed approach is extensible and may be used for extend functionality of model to model tools that process software models. For example in MEDINI QVT there is no direct ways to compose a model to model transformation rule that considers those software models elements that have no direct links.Problems in programming 2018; 2-3: 124-13
Theoretical principles of use of ontologies for semantization of the Web resources
In this paper we show the main directions of semantization of the Web information resources and their theoretical bases. We consider the semantization problems associated with the open environment information at the knowledge level. This analysis substantiates the need for the Web semantic search methods and means. Modern principle tendencies in the personified semantic deal with the ontology-based formalization of knowledge about the information needs of users and their current tasks. Our approach is based on use of the semantically marked Wiki-resources as a source of knowledge for constructing of ontologies of individual task. Each task ontology is considered as a small subset of domain ontology with large number of terms volume and high complexity. We develop the formal model of the task ontology as a special case of the formal model of domain ontology and propose methods for constructing of this task ontology on base of the set of semantically marked Wiki pages. The software implementation of the retrieval systems capable to process such task ontologies is analyzed on example of MAIPS – semantic retrieval system which provides personalized satisfaction of user information needs. Such personification is based on knowledge contained into the user task thesauri that are built on base of task ontologies. Problems in programming 2018; 2-3: 197-20
Use of ontologies for personification of semantic retrieval
Modern means of knowledge representation and processing into the intelligent information systems that are oriented on the work into open environment are considered. Methods of building and use of the domain ontologies that represent knowledge about users and their information needs are developed. Models and methods that support semantic search of information and it`s personified processing on base of these ontologies are proposed. Software tools based on the Semantic Web technologies that realize proposed methods are created. MAIPS system performs personified semantic search by use of ontologies and thesauri for representation of knowledge about search objects and subjects. Methods of refinement of these ontologies on base of semantically marked Wiki-resources analysis are proposed.Problems in programming 2017; 3: 52-67
Use of domain ontology for homonymy clarification into the natural language texts
The article analyses the clarification of various types of homonymy that can be executed without use of semantic information, but only on the basis of syntactic rules. This analysis shows how features of the syntactic structures of legislative and academic texts allow to reduce the number of formal rules required for parsing. A minimal set of syntactic rules necessary for the automatic analysis of such texts is proposed. A method of homonymy clarification in natural language business, scientific and legal text documents is developed. Proposed method does not require the use of a large number of syntactic rules and marked-up texts. Such specificity greatly simplifies the implementation and reduces the time required for creation and markup of text corpora. This result is achieved by use of domain ontology, and by the specifics of syntactic structures of business, scientific and legal documents. In addition, we demonstrate how the use of domain ontology allows to simplify the analysis of the test documents. As opposed to other systems of automatic processing of natural language texts that use domain ontology for semantic analysis too the domain ontology is used to highlight terms in the text and further morphological information of each word in wordy terms.Problems in programming 2017; 2: 61-7