Harvester open publications of NAS Ukraine
Harvester open publications of NAS UkraineNot a member yet
2350 research outputs found
Sort by
Automated extraction of structured information from a variety of web pages
No full textThe expediency of using methods of structured data extraction from a set of HTML pages for the information search in the Internet is substantiated. The main methods of structured data extraction from the set of web pages, which are formed by a common scenario with different sets of data, are analyzed. The classification of methods according to the degree of automation (the factor of user influence) of the template formation process is considered. The principles of work of the main unsupervised methods (Roadrunner, FiVaTech, Trinity) are described in detail. Advantages and disadvantages of methods are shown. The expediency of using the Trinity method for data extraction in comparison with other methods is substantiated. The problem of choosing input documents for method among a set of HTML pages for generating a common template is considered. Experimental verification of Trinity method on the set of HTML pages, which represent articles of Ukrainian scientific journals, is made. To create a test set of HTML pages, an automated crawl of web site is performed. The realization of the search bot is done by processing the object model of HTML documents obtained from web sites. Templates (regular expressions) formed by the Trinity method are applied to the entire set of input HTML pages. Extraction results (structured data about articles) are exported to the database with the possibility of further analysis. The obtained results are compared with the data about the articles obtained by the manual analysis of the object model of web pages. The error in using the Trinity method on the experimental set of HTML pages is calculated.Problems in programming 2018; 2-3: 149-15
Algebras of quasiary and of bi-quasiary relations
No full textThe notion of quasiary relation which can be considered generalization of the notion of traditional n-ary relation is proposed. A number of algebras of quasiary relations is built and investigated. Alongside with conventional operations of union, intersection, and complement, special nominative operations of renomi-nation and quantification are defined for quasiary relations. The isomorphism between the algebra of quasiary relations and the first-order algebra of total single-valued quasiary predicates is proved. Al-gebras of bi-quasiary relations defined over sets of pairs of quasiary relations are built. The isomorphism between algebras of bi-quasiary relations and alge-bras of quasiary predicates is proved. The following subclasses of algebras of bi-quasiary relations are specified: alge-bras of partial single-valued (functional), total, total many-valued bi-quasiary relations. For all defined subclasses their counterparts of the classes of algebras of quasiary predicates are described. Also subalgebras of the algebra of bi-quasiary relations induced by upward closedness and downward closedness are investigated.Prombles in programming 2016; 1: 17-2
Історичні закономірності розвитку інтродукції рослин
No full textIn the historical aspect, the main stages and patterns of the development of plant introductions are considered. Views of T. Kuhn, V.D. Fedorov, F. Capra, V.N. Strakhov and B.M. Mirkin on the features of the formation of scientific theories and the paradigm shift as a natural phenomenon that determines the increase in the scientific level of research. Considering the introduction of plants from these positions, it can be argued that this science is cur rently experiencing another paradigm shift. The binary direction in natural science and in the introduction of plants in particular, is regarded as a brake in its development. This is opposed to the systemic approach and the trinitarian methodology as an alternative to the binary one. Trinitarian worldview is not opposed to the binary, but develops and supplements it, restoring ideas about the integrity that was lost in the analytic era. Based on this methodology, we formulated the information-energy theoryof plant introduction and its importance
Визначення летких речовин в плодах Diospyros virginiana L.
No full textObjective – to investigate the qualitative and quantitative content of volatile organic compounds in American persimmons (Diospyros virginiana L.) fruits of the collection of M.M. Gryshko National Botanical Garden of the NAS of Ukraine.
Material and methods. The objects of study were fruits of 10 years old plants of 7 genotypes (DV01–DV07) of Diospyros virginiana which were collected in October 2015. The investigation of the volatiles was conducted by the method of Chernohorod and Vinohradov (2006) using chromatographymass spectrometry. Basic statistical analyses were performed using PAST 2.17; hierarchical cluster analyses of similarity between genotypes were computed on the basis of the Bray-Curtis similarity index.
Results. During the analysis of qualitative composition and quantitative content of volatiles of fruits from the 7 genotypes 129 compounds were detected, and 118 compounds among them were identified. Total content of volatile compounds was from 121.60 to 676.50 mg/kg. Identified compounds belong to hydrocarbons, aldehydes, carboxylic acids and their ethers, monoterpenes, sesquiterpenes, triterpenes. In the fruits of investigated genotypes prevailed fatty acids (mg/kg): myristic acid (from 18.5 to 234.6), palmitic acid (from 14.9 to 125.7), lauric acid (from 29.8 to 50.5), 7,10,13-hexadecatrienic acid (from 18.6 to 33.4), 11-hexadecenoic acid (from 12.3 to 22.1). For all investigated genotypes 14 components were typical: furfural, linalool, phenylacetaldehyde, α-terpineol, geraniol, lauric acid, ethylmyristate, myristic acid, pentadecanoic acid, ethyl palmitate, ethyl palmitoleate, palmitic acid, palmitoleic acid, and squalene.
Conclusions. Detected volatile compounds in the fruits of Diospyros virginiana belong to alcohols, saturated and unsaturated aldehydes, ketones, fatty acids, esters, and terpenoids. Shares of keeping them in total identified fruits volatile substances vary and depend on the genotype of plants. The fruits are rich in fatty acids. They are considered as precursors of many specific aroma compounds. Found aldehydes are thought to be responsible for the decreasing of astringency by persimmon fruits. Study of the quantitative and qualitative content of volatile compounds of Diospyros virginiana fruits suggest about making sense of conducting further pharmacognostic investigations
Multiagent modeling of sequential multiunit japanese auctions
No full textFeatures of modeling of auctions are investigated from the point of view of simulation (multiagent) modeling. The characteristic of auctions as object of modeling is resulted. Statement of a task carries out and the method of construction of the mechanism of carrying out of sequential multiunit japanese auctions, which provides use by agents of dominant strategies is offered and allows to construct optimal auction. Efficiency of the suggested method experimentally proves to be true.Prombles in programming 2016; 1: 129-13
Algebras of general non-deterministic predicates
No full textLogics of general nondeterministic qua-siary predicates, called GND-predicates, are defined and investigated. These logics are program-oriented logical for-malisms that reflect such properties of programs as partiality, nondeterminism, and non-fixed arity. GND-predicates generalize partial predicates of the rela-tional type. The main attention is paid to the construction of composition algebras of GND-predicates. Compositions of GND-predicates are described, their properties are formulated. For these predicates, such important laws of tradi-tional logic as the law of absorption and the law of distributivity for for and are not valid. Various types of GND-predicates are identified. GND-predicates can be modeled as 7-value total deter-ministic predicates (TD7-predicates). A 7-element algebra of truth values of TD7-predicates is defined and all of its subalgebras are described. Each such subalgebra induces a corresponding al-gebra of TD7-predicates, which then in-duces the algebra of GND-predicates. This makes possible to identify a number of important composition algebras of general nondeterministic predicates. The languages of pure first-order logics of GND-predicates and their interpretations are described. The relations of a logical G-consequence and a logical G-equivalence are introduced. The relation of the logical G-consequence is mono-tonic, reflexive, and transitive; for it the properties of the decomposition of for-mulas are satisfied. On the basis of these properties, it is planned to construct cal-culi of sequential type for the logic of GND-predicates.Problems in programming 2018; 1: 05-2
Algorithms of relationships and dependencies search in Web-pages
No full textMethods of extraction and analysis of data – a relatively new and promising branch of computer science, has found its application in information retrieval systems. An algorithm of relationships and dependencies searching in the collections of Web pages. The algorithm does not provide relevant search resources. This function is performed by the search engine. It also produces cleaning, integration, and data selection. A special feature of the algorithm is to use the existing data store (search engine or data storage), language independence and ease of implementation.Prombles in programming 2016; 1: 44-5
Software technology for conducting simulation experiments with mathematical models of physiological systems
No full textBased on the given analysis of existing systems the necessity of development of new flexible physiologist-researcher oriented system is shown. The developed system, which allows physiologists to build virtual organisms from the extendable set of blocks, is described
Use of ontological analysis for competence evaluation of scientists in a particular subject domain
No full textObjective methods for competence evaluating of scientists in the subject domain pertinent to the specific scientific product – research project, publication, etc. are proposed. These methods are based on the semantic matching of the description of scientific product and documents that confirm the competence of its authors or experts in the domain of this product. In addition, the use of knowledge acquired from the Web open environment – Wiki-resources, scientometric databases, organization official website, domain ontologies is proposed. Specialized ontology of scientific activity which allows to standardize the terminological base for describing the qualifications of researchers is developed.Problems in programming 2016; 4: 81-9
Equivalence of two parallel execution systems
No full textThe method for properties proof for parallel programs running multiple-instance interleaving with shared memory is investigated. Two systems for parallel execution of programs are considered and the justification of the mutual expressiveness of these two approaches are presented in this paper. The first one is with a fixed yet parametric number of programs executing in parallel. The second one implements a generation model (start) and joining after the stop (join) of parallel programs (also called multithreading). The corresponding two basic functions are provided, and their semantics are given. Also, the semantics of other functions related to parallel execution, resource management and access synchronization are presented in this paper. The theorem on the (functional) equivalence of these two systems and its justification are presented. The program in this case is considered as a function over the data. It is argued that for an arbitrary program in one of the systems of parallelism it is possible to construct the corresponding program in another system, which returns the same result (that is, functionally equivalent). Only productive programs are considered here in the context of mutual expressiveness, because otherwise they "hang" and do not return any result, thus they are out of our scope. The obtained result allows us to move reasoning from the more complex system (by structure) with a dynamic generation of parallel program instances to the simpler system (for proofs) with a parametric number of identical programs executed in parallel. Questions for further research in this direction are also identified.Problems in programming 2018; 2-3: 093-09