We study direct product representations of algebras in varieties. We collect several conditions expressing that these representations are definable in a first-orderlogic sense, among them the concept of Definable Factor Congruences (DFC). The main results are that DFC is a Mal’cev property and that it is equivalent to all other conditions formulated; in particular we prove that V has DFC if and...

We study the problem of applying statistical methods for approximate model checking of probabilistic systems against properties encoded as PCTL formulas. Such approximate methods have been proposed primarily to deal with state-space explosion that makes the exact model checking by numerical methods practically infeasible for large systems. However, the existing statistical methods either consid...

abstract background: epilepsy exposes patients to many physical, social, and emotional challenges. thus, it seems to portray a complex picture and needs holistic care. medical treatment and psychosocial part of epilepsy remain central to managing and improving the patient’s qualify of life through team efforts. some studies have shown the dimensions of self‑management, but its management proces...

We prove that Kreisel’s Conjecture is true, if Peano arithmetic is axiomatised using minimality principle and axioms of identity (theory PAM ). The result is independent on the choice of language of PAM . We also show that if infinitely many instances of A(x) are provable in a bounded number of steps in PAM then there exists k ∈ ω s.t. PAM ` ∀x > k A(x). The results imply that PAM does not prov...

The paper investigates parameterized approximate message-passing schemes that are based on bounded inference and are inspired by Pearl's belief propagation algorithm (BP). We start with the bounded inference mini-clustering algorithm and then move to the iterative scheme called Iterative Join-Graph Propagation (IJGP), that combines both iteration and bounded inference. Algorithm IJGP belongs to...

The aim of this paper is to present a signature scheme in which the ability to sign messages of a signer is limited to a fixed number k of signatures. It is an identity-based signature schemein which each signature can be usedonly once. We called suchschemes “bounded life-span”. It is based on mental games and it uses zero-knowledge tools. A validation center is needed to initialize this identi...