Fundamenta Informaticae - Volume 149, issue 4

Authors: Doberkat, Ernst-Erich

Article Type: Research Article

Abstract: In Universal Algebra the structure of congruences for algebraic systems is fairly well investigated, and the relationship to the structure of the underlying system proper is well known. We propose a first step into this direction for studying the structure of congruences for stochastic relations. A Galois connection to a certain class of Boolean σ-algebras is exploited, atoms and antiatoms are identified, and it is show that a σ-basis exists. These constructions are applied to the problem of finding bisimulation cuts of a congruence. It cuts the relation through a span of morphisms with a minimum of joint events.

DOI: 10.3233/FI-2016-1452

Citation: Fundamenta Informaticae, vol. 149, no. 4, pp. 363-383, 2016

Authors: Grześkowiak, Maciej

Article Type: Research Article

Abstract: We present a method of generating primes r ≡ 1 (mod n ), q and a Weil q -number π such that r divides Φn (q ) and r divides |A (𝔽q )|, where A /𝔽q is an ordinary abelian variety defined over a finite 𝔽q corresponding to π. Such primes can be used for implementing pairing-based cryptographic systems.

Keywords: Abelian vrieties over finite field, public key cryptography

DOI: 10.3233/FI-2016-1453

Citation: Fundamenta Informaticae, vol. 149, no. 4, pp. 385-400, 2016

Authors: Virbitskaite, Irina | Bushin, Dmitry | Best, Eike

Article Type: Research Article

Abstract: The intention of the paper is towards a framework for developing, studying and comparing observational equivalences in the setting of a real-time true concurrent model. In particular, we introduce a family of trace and bisimulation equivalences in interleaving, step, partial order and causal net semantics in the setting of time Petri nets (elementary net systems whose transitions are labeled with time firing intervals, can fire only if their lower time bounds are attained, and are forced to fire when their upper time bounds are reached) [3]. We deal with the relationships between the equivalences showing the discriminating power of the …approaches of the linear-time – branching-time and interleaving – partial order spectra and construct a hierarchy of equivalent classes of time Petri nets. This allows studying in complete detail the timing behaviour in addition to the degrees of relative concurrency and nondeterminism of processes. Show more

DOI: 10.3233/FI-2016-1454

Citation: Fundamenta Informaticae, vol. 149, no. 4, pp. 401-418, 2016

Authors: Wróbel, Łukasz | Sikora, Marek | Michalak, Marcin

Article Type: Research Article

Abstract: The paper presents the results of research related to the efficiency of the so-called rule quality measures which are used to evaluate the quality of rules at each stage of the rule induction. The stages of rule growing and pruning were considered along with the issue of conflict resolution which may occur during the classification. The work is the continuation of research on the efficiency of quality measures employed in sequential covering rule induction algorithm. In this paper we analyse only these quality measures (8 measures) which had been recognized as effective based on previous conducted research. The study was …conducted on approximately 70 benchmark datasets related to classification, regression and survival analysis problems. In the comparisons we analyzed prognostic abilities of the induced rules as well as the complexity of the resulting rule-based data models. Show more

DOI: 10.3233/FI-2016-1455

Citation: Fundamenta Informaticae, vol. 149, no. 4, pp. 419-449, 2016

Authors: Wu, Tingfang | Wang, Yanfeng | Jiang, Suxia | Shi, Xiaolong

Article Type: Research Article

Abstract: Spiking neural (SN, for short) P systems are a class of distributed parallel computing models inspired by the way in which neurons communicate with each other by means of electrical impulses. Recently, a new variant of SN P systems, called SN P systems with homogenous neurons and synapses (HRSSN P systems for short) was proposed, where the spiking and forgetting rules are placed on synapses instead of in neurons and each synapse has the same set of spiking and forgetting rules. This variant of SN P systems has already been proved to be Turing universal as both number generating and …accepting devices. In this work, we consider the problem of looking for small universal HRSSN P systems. Specifically, a universal HRRSN P system with standard rules and weight at most 5 having 70 neurons is constructed as a device of computing functions; as a number generator, we find a universal system with standard rules and weight at most 5 having 71 neurons. Show more

DOI: 10.3233/FI-2016-1456

Citation: Fundamenta Informaticae, vol. 149, no. 4, pp. 451-470, 2016

Article Type: Other

Citation: Fundamenta Informaticae, vol. 149, no. 4, pp. 471-472, 2016