Subgroup discovery and community detection are standard approaches for identifying (cohesive) subgroups. This paper presents an organized picture of recent research in descriptive community (and subgroup) detection. Here, it summarizes approaches for the identification of descriptive patterns targeting both static as well as dynamic (sequential) relations. We specifically focus on attributed gr...

Many technical problems involved with Component Based Software Development might be considered solved these days. Less so are mental reservations both, developers as well as their managers have with respect to the risks involved with building software from powerful building blocks. This paper addresses the issue of trust developers might extend towards components. Besides psychological aspects ...

Background: Psoriasis is a common and genetically determined skin disease, which is frequent throughout the world. Objective: To perform a descriptive clinical study of 200 cases of psoriasis in Ahwaz. Patients and Methods: This study was performed from November 1997 to April 1999 on 200 psoriatic patients attended a private skin clinic in Ahwaz. Data were collected from patients and entered in...

We consider P systems with a linear membrane structure working on objects over a unary alphabet using sets of rules resembling homomorphisms. Such a restricted variant of P systems allows for a unique minimal representation of the generated unary language and in that way for an effective solution of the equivalence problem. Moreover, we examine the descriptional complexity of unary P systems wi...

Infinitary logic, the logic of languages with infinitely long conjunctions, plays an important role in model theory, recursion theory and descriptive set theory. This book is the first modern introduction to the subject in 40 years, and will bring students and researchers in all areas of mathematical logic up to the threshold of modern research. The classical topics of back-and-forth systems, m...

Proof. As the edges in GC represent causal relations, a path of length 0 (no edge) is not considered a causal relation, and existence of a directed path from a variable back to itself would contravene the causal DAG assumption, hence: irreflexive and acyclic (or, more accurate, asymmetric). Transitivity follows immediately, by concatenation, from the sequence 〈X, .., Y, .., Z〉, in which each no...

The workshop was partially funded by the Faculty of Mathematics and Physics at the University of Ljubljana, the Institute for Mathematics, Physics and Mechanics, as well as the European Union. It was the fourth in a series of workshops aimed at bringing together researchers from exact real number computation, computable analysis, effective descriptive set theory, constructive analysis, and rela...

We introduce a new framework for classifying logics on finite structures and studying their expressive power. This framework is based on the concept of almost everywhere equivalence of logics, that is to say, two logics having the same expressive power on a class of asymptotic measure 1. More precisely, if L, L0 are two logics and ì is an asymptotic measure on finite structures, then L a.e. L0 ...

Kolmogorov complexity, which is also called algorithmic (descriptive) complexity is an object, such as a piece of text, to measure the computational resources needed, which are mostly the length of the shortest binary program to specify an object. Strings whose Kolmogorov complexity is small relative to the string’s size are not considered to be complex and easy to use a short program to specif...