Relational arrays represent interactions or associations between pairs of actors, often over time or in varied contexts. We focus on the case where the elements of a relational array are modeled as a linear function of observable covariates. Due to the inherent dependencies among relations involving the same individual, standard regression methods for quantifying uncertainty in the regression c...

Ontology Based Data Access (OBDA) enables access to relational data with a complex structure through ontologies as conceptual domain models. A key component of an OBDA system are mappings between the schematic elements in the ontology and their correspondences in the relational schema. Today, in existing OBDA systems these mappings typically need to be compiled by hand, which is a complex and l...

This paper investigates the stability analysis of fuzzy relational dynamic systems. A new approach is introduced and a set of sufficient conditions is derived which sustains the unique globally asymptotically stable equilibrium point in a first-order fuzzy relational dynamic system with sumproduct fuzzy composition. This approach is also investigated for other types of fuzzy relational composit...

There is an increasing need to integrate spatial index structures into commercial database management systems. In geographic information systems (GIS), huge amounts of information involving both, spatial and thematic attributes, have to be managed. Whereas relational databases are adequate for handling thematic attributes, they fail to manage spatial information efficiently. In this paper, we p...

The scheme LambdaCD deals with a non empty set A, a unary functor F yielding a set, a unary functor G yielding a set, and a unary predicate P, and states that: There exists a function f such that dom f = A and for every element x of A holds if P[x], then f(x) = F(x) and if not P[x], then f(x) = G(x) for all values of the parameters. The following propositions are true: (1) Let L be a non empty ...

This research addresses the kinds of matching elements that determine analogical relatedness and literal similarity. Despite theoretical agreement on the importance of relational match, the empirical evidence is neither systematic nor definitive. In 3 studies, participants performed online evaluations of relatedness of sentence pairs that varied in either the object or relational match. Results...

This study extends the view that formal contracts and relational governance function as complements rather than as substitutes. We investigate how specific characteristics of service level agreements (SLAs) impact relational governance in information technology outsourcing relationships. Eleven contractual elements (categorized into three SLA characteristics: foundation, change, and governance ...

In this article we present several logical schemes. The scheme FraenkelInvolution deals with a non empty set A , subsets B, C of A , and a unary functor F yielding an element of A , and states that: B = {F (a);a ranges over elements of A : a ∈ C} provided the following conditions are satisfied: • C = {F (a);a ranges over elements of A : a ∈ B}, and • For every element a of A holds F (F (a)) = a...