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 ...

How do you encourage or facilitate on-line participation? What constitutes effective participation? The paper firstly examines selected theories about encouraging effective on-line participation and secondly, reviews a range of qualitative and quantitative methods for assessing the effectiveness of students' on-line participation. The author aims to make informed recommendations on strategies t...

In a classic digital signature scheme, the global community is capable of verifying a signature. In a designated verifier scheme (DVS), only the designated verifier has this capability. In a classic DVS scheme the signer themselves “designates” the entity that will have the capability of verifying their signature. In a pure identity-based signature scheme a Trusted Authority is introduced, and ...

In this paper we study the properties of systems of bounded arithmetic capturing small complexity classes and state conditions sufficient for such systems to capture the corresponding complexity class tightly. Our class of systems of bounded arithmetic is the class of secondorder systems with comprehension axiom for a syntactically restricted class of formulas Φ ⊂ Σ 1 based on a logic in the de...

Formal languages can be described by several means. A basic question is how succinctly can a descriptional system represent a formal language in comparison with other descriptional systems? What is the maximal size trade-off when changing from one system to another, and can it be achieved? Here, we select some recent trends in the descriptional complexity of formal languages and discuss the pro...

This paper presents some new results concerning the descriptional complexity of partially parallel grammars. Specifically, it proves that every recursively enumerable language is generated (i) by a four-nonterminal scattered context grammar with no more than four non-context-free productions, (ii) by a two-nonterminal multisequential grammar with no more than two selectors, or (iii) by a three-...

The classical descriptive set theory is devoted to the study of descriptive classes of sets in Polish spaces. There are many deep results which found applications, e.g., in real analysis or functional analysis. Several books and survey papers contain essential parts of this theory, see [49], [2], [48], [54], [63]. One of the key tools for the study of Borel sets in Polish spaces are analytic sp...

This is a survey paper on the descriptive set theory of hereditary families of closed sets in Polish spaces. Most of the paper is devoted to ideals and σ-ideals of closed or compact sets.

the blue ocean strategy aims to create business in the fields which didn’t exist before. this research has been developed with the aim of designing a blue ocean strategy as a modern solution. the current study is a functional one situated in the descriptive survey group, considering the nature of the subject and the goals. the judgment sampling is applied to determine the criteria frameworks an...

Computational models of visual processing often use framebased image acquisition techniques to process a temporally changing stimulus. This approach is unlike biological mechanisms that are spikebased and independent of individual frames. The neuromorphic Dynamic Vision Sensor (DVS) [Lichtsteiner et al., 2008] provides a stream of independent visual events that indicate local illumination chang...