Search results for "abstract"
showing 10 items of 1959 documents
About Graph Mappings
2019
Summary In this articles adjacency-preserving mappings from a graph to another are formalized in the Mizar system [7], [2]. The generality of the approach seems to be largely unpreceeded in the literature to the best of the author’s knowledge. However, the most important property defined in the article is that of two graphs being isomorphic, which has been extensively studied. Another graph decorator is introduced as well.
About Graph Unions and Intersections
2020
Summary In this article the union and intersection of a set of graphs are formalized in the Mizar system [5], based on the formalization of graphs in [7].
On Different Type Solutions of Boundary Value Problems
2016
We consider boundary value problems of the type x'' = f(t, x, x'), (∗) x(a) = A, x(b) = B. A solution ξ(t) of the above BVP is said to be of type i if a solution y(t) of the respective equation of variations y'' = fx(t, ξ(t), ξ' (t))y + fx' (t, ξ(t), ξ' (t))y' , y(a) = 0, y' (a) = 1, has exactly i zeros in the interval (a, b) and y(b) 6= 0. Suppose there exist two solutions x1(t) and x2(t) of the BVP. We study properties of the set S of all solutions x(t) of the equation (∗) such that x(a) = A, x'1(a) ≤ x' (a) ≤ x'2(a) provided that solutions extend to the interval [a, b].
Images and Preimages of Null Sets
2013
In this chapter we study conditions that guarantee that our mapping maps sets of measure zero to sets of measure zero. We start with the problem in general Sobolev spaces, after which we establish a better result for mappings of finite distortion. Then we introduce a natural class of counterexamples to statements of this type and finally we give a weak condition under which the preimage of a set of measure zero has measure zero for mappings of finite distortion.
Semantics for Managing Systems in Heterogeneous and Distributed Environment
2002
The problem of legacy systems collaboration is being solved. Particularly we look at the collaboration as workflow in a distributed and heterogeneous environment. Attention is paid to the description of semantics for workflow process definition languages. There are many solutions how semantics can be decomposed into logical fragments, but the problem of obtaining reusable components that are easy to compile into desired specific semantics still remains. We evolve the division of semantics by semantic aspects whose description is based on abstract data types (pre-built components) and connectors (meta-programs to produce the glue code) between them. This paper offers a way in which semantic …
Results of a literature review on methods for estimating buildings energy demand at district level
2019
Abstract In the framework of distributed energy planning, evaluating reliable energy profiles of different sectors has a prominent role. At the same time, it is a quite challenging task, since the availability of actual energy profiles of buildings at the district level is not widespread. A survey of over 70 studies in scientific literature has been accomplished and a set of criteria has been defined for classifying the selected contributions based on the energy demand data features, source and/or estimation methods, highlighting the ones adopting hourly energy profiles. As final results, tables summarizing the main methods characteristics and a selection of studies providing directly useab…
A general procedure for the construction of Gorges polygons for multi-phase windings of electrical machines
2018
This paper presents a simple and effective procedure for the determination of the Gorges polygon, suitable for all possible winding configurations in electrical machines. This methodology takes into account the determination of a Winding Distribution Table (WDT), in which all the information about the distribution of the currents along the stator periphery is computed and from which the Görges polygon are easily derived. The proposed method can be applied to both symmetrical and asymmetrical multi-phase windings, including concentrated, fractional, reduced and dead-coil ones. The examples provided in this paper demonstrate the versatility of the proposed method.
Metamodel specialization for graphical modeling language support
2016
Most of current modeling languages are based on graphical diagrams. The concrete graphical syntax of these languages typically is defined informally -- by text and diagram examples. Only recently, starting from UML 2.5, a formalism is offered for defining the graphical syntax of UML. This formalism is based on Diagram Definition standard by OMG, where the main emphasis is on enabling diagram interchange between different tools implementing the given language. While this is crucial for standardized languages such as UML, this aspect is not so important for domain specific languages. In this paper an approach is offered for simple direct definition of concrete graphical syntax by means of met…
A Step Towards a Data Quality Theory
2019
Data quality issues have been topical for many decades. However, a unified data quality theory has not been proposed yet, since many concepts associated with the term “data quality” are not straightforward enough. The paper proposes a user-oriented data quality theory based on clearly defined concepts. The concepts are defined by using three groups of domain-specific languages (DSLs): (1) the first group uses the concept of a data object to describe the data to be analysed, (2) the second group describes the data quality requirements, and (3) the third group describes the process of data quality evaluation. The proposed idea proved to be simple enough, but at the same time very effective in…
Matching factorization theorems with an inverse-error weighting
2018
We propose a new fast method to match factorization theorems applicable in different kinematical regions, such as the transverse-momentum-dependent and the collinear factorization theorems in Quantum Chromodynamics. At variance with well-known approaches relying on their simple addition and subsequent subtraction of double-counted contributions, ours simply builds on their weighting using the theory uncertainties deduced from the factorization theorems themselves. This allows us to estimate the unknown complete matched cross section from an inverse-error-weighted average. The method is simple and provides an evaluation of the theoretical uncertainty of the matched cross section associated w…