Schema matching is a critical problem for integrating heterogeneous information sources. Traditionally, the problem of matching multiple schemas has essentially relied on finding pairwise-attribute correspondence. In contrast, we propose a new matching paradigm, holistic schema matching, to holistically match many schemas at the same time and find all the matchings at once. By handling a set of...

many large oil and gas fields in the most productive world regions happen to be fractured. the exploration and development of these reservoirs is a true challenge for many operators. these difficulties are due to uncertainties in geological fracture properties such as aperture, length, connectivity and intensity distribution. to successfully address these challenges, it is paramount to improve ...

Abstract We apply the Darmois and $C^3$ matching conditions to three different spherically symmetric spacetimes. The exterior spacetime is described by Schwarzschild vacuum solution whereas for interior counterpart we choose perfect fluid solutions with same symmetry. show that are satisfied in all cases not fulfilled. argue this difference due a non-physical behavior of pressure on surface.

Neighbouring song sparrows, Melospiza melodia, in our Seattle population share song types and sometimes respond to neighbour song by type matching (replying with the same song type being sung) or repertoire matching (replying with a shared song other than the type being sung). Based on our modification of the threat hypothesis of Krebs et al. (1981, Animal Behaviour, 29, 918–923), according to ...

Let $G=(V,E)$ be a simple connected graph. A matching $M$ in a graph $G$ is a collection of edges of $G$ such that no two edges from $M$ share a vertex. A matching $M$ is maximal if it cannot be extended to a larger matching in $G$. The cardinality of any smallest maximal matching in $G$ is the saturation number of $G$ and is denoted by $s(G)$. In this paper we study the saturation numbe...

let $gamma_{n,kappa}$ be the class of all graphs with $ngeq3$ vertices and $kappageq2$ vertex connectivity. denote by $upsilon_{n,beta}$ the family of all connected graphs with $ngeq4$ vertices and matching number $beta$ where $2leqbetaleqlfloorfrac{n}{2}rfloor$. in the classes of graphs $gamma_{n,kappa}$ and $upsilon_{n,beta}$, the elements having maximum augmented zagreb index are determined.