Performance in a cognitive task can be considered as the outcome of a decision-making process operating across various knowledge domains or aspects of a single domain. Therefore, an analysis of these decisions in various tasks can shed light on the interplay and integration of these domains (or elements within a single domain) as they are associated with specific task characteristics. In this s...

Before the "relational revolution", developers had to understand the details of the data structures on which they operated in order to access the content. Relational theory introduced the concept of "data independence" in that the operations in the relational algebra do not need to know anything about the structure of the data in order to work. This allows analysts, designers, and programmers t...

Public repositories for microarray data have been constructed by some researches which follow the standards such as MIAME-compliant data and MAGE-OM/ML. However, enough consideration has not been taken into the design of storage structure for the hierarchy of microarray data. In this paper, we propose alternative mapping strategy to mine the structural similarity and an advanced mapping rule fr...

Many years of research related to fuzzy logic and fuzzy set theory extensions to relational databases have not lead to stable implementations, standardized languages or fuzzy relational database application development tools and methods. The main goal of this paper is the modelling and the implementation of a set of tools that allow usage of fuzzy logic enriched with priorities in relational da...

A flexible method to store XML documents in relational or object-relational databases is presented that is based on an adaptable fragmentation. Whereas most known approaches decompose XML documents into minimal units we propose to store fragments of variable granularity ranging from single elements to whole documents. Different fragmentation strategies depending on the specific access and query...

(6) Let S, T be upper-bounded antisymmetric non empty relational structures and D be a subset of [:S, T :]. If [:S, T :] is complete or inf D exists in [:S, T :], then infD = 〈 infπ1(D), infπ2(D)〉. (7) Let S, T be non empty relational structures and x, y be elements of [:S, T :]. Then x ≤ {y} if and only if the following conditions are satisfied: (i) x1 ≤ {y1}, and (ii) x2 ≤ {y2}. 1This work ha...

In this paper we present Ontop, an open-source Ontology Based Data Access (OBDA) system that allows for querying relational data sources through a conceptual representation of the domain of interest, provided in terms of an ontology, to which the data sources are mapped. Key features of Ontop are its solid theoretical foundations, a virtual approach to OBDA that avoids materializing triples and...

This paper connects theory of learning with theory of governance, in the context of inter-firm relations. It recognizes fundamental criticism of transaction cost economics (TCE), but preserves elements from that theory. The theory of governance used incorporates learning and trust. The paper identifies two kinds of relational risk: hold-up and spillover. For the governance of relations, i.e. th...

The use of a conceptual model (or an ontology) to describe relational data sources has been proved to be extremely useful to overcome many important data access problems. However, the task of wrapping relational data sources by means of an ontology is mainly done manually. In this paper we introduce an automatic procedure for extracting a conceptual view from a relational database. The semantic...

Health systems, particularly those in low- and middle-income countries (LMICs), need stronger management and leadership capacities. Management and leadership are not synonymous, yet should be considered together as there can be too much of one and not enough of the other. In complex adaptive health systems, the multiple interactions and relationships between people and elements of the system me...