This paper discusses region-based representations useful to create connected operators. The filtering approach involves three steps: first, a region tree representation of the input image is constructed. Second, the simplification is obtained by pruning the tree and third, and output image is constructed from the pruned tree. The paper focuses in particular on several pruning strategies that ca...

We consider the descriptive complexity of some subsets of the infinite permutation group S∞ which arise naturally from the classical series rearrangement theorems of Riemann, Levy, and Steinitz. In particular, given some fixed conditionally convergent series of vectors in Euclidean space Rd, we study the set of permutations which make the series diverge, as well as the set of permutations which...

There is a growing need for abstractions in logic specification languages such as FO(·) and ASP. One technique to achieve these abstractions are templates (sometimes called macros). While the semantics of templates are virtually always described through a syntactical rewriting scheme, we present an alternative view on templates as second order definitions. To extend the existing definition cons...

This lecture continues the study of hybrid games and their logic, differential game logic [Pla15], that Lecture 20 on Hybrid Systems & Games started. Lecture 20 saw the introduction of differential game logic with a focus on identifying and highlighting the new dynamical aspect of adversarial dynamics. The meaning of hybrid games in differential game logic had been left informal, based on the i...

the problem of attributes and semantics of divine features and its relation with god’s real theism is one of the fundamental issues in theology and very often has been a sphere for representing of different believes of islamic thinkers. among them, gh?sz? sa?ed from qom, one of the greatest shiite thinkers at the time of safavi dynasty, has had a special idea about existential and semantics of ...

We construct a minimal rK-degree, continuum many, in fact. We also show that every minimal sequence, that is, a sequence with minimal rK-degree, must have very low descriptional complexity, that every minimal sequence is rK-reducible to a random sequence, and that there is a random sequence with no minimal sequence rK-reducible to it.