We call a nitely complete category algebraically coherent if the change-ofbase functors of its bration of points are coherent, which means that they preserve nite limits and jointly strongly epimorphic pairs of arrows. We give examples of categories satisfying this condition; for instance, coherent categories, categories of interest in the sense of Orzech, and (compact) Hausdor algebras over a ...

Constraint-based pattern discovery is at the core of numerous data mining tasks. Patterns are extracted with respect to a given set of constraints (frequency, closedness, size, etc). In practice, many constraints require threshold values whose choice is often arbitrary. This difficulty is even harder when several thresholds are required and have to be combined. Moreover, patterns barely missing...

While the desire to gain full access to stationary information sources (e.g. the company ́s backoffice database) from abroad is only natural, inherent design limitations such as a lack of computational power, extremely limited resources and closedness to modifications, let mobile system integration be still a difficult issue. In contrast to other approaches to the field, the “Java Border Service...

This study analyzed patients’ perceptions of their nurses’ willingness to engage in interaction and patients’ satisfaction in communication about health with their nurses (N = 270). Results indicated that a strong and significant positive correlation exists between patients’ perceptions of their nurse’s interaction engagement and their satisfaction with their relationship with their nurse (r = ...

The classical definition of global hyperbolicity for a spacetime (M, g) comprises two conditions: (A) compactness of the diamonds J(p) ∩ J−(q), and (B) strong causality. Here we show that condition (B) can be replaced just by causality. In fact, we show first that the classical definition of causal simplicity (which impose to be distinguishing, apart from the closedness of J(p), J−(q)) can be w...

The multiplicity structure of a polynomial system at an isolated zero is identified with the dual space consisting of differential functionals vanishing on the entire polynomial ideal. Algorithms have been developed for computing dual spaces as the kernels of Macaulay matrices. These previous algorithms face a formidable obstacle in handling Macaulay matrices whose dimensions grow rapidly when ...

We survey various notions of probabilistic automata and probabilistic bisimulation, accumulating in an expressiveness hierarchy of probabilistic system types. The aim of this paper is twofold: On the one hand it provides an overview of existing types of probabilistic systems and, on the other hand, it explains the relationship between these models. We overview probabilistic systems with discret...