- Full text PDF available (10)
- This year (0)
- Last five years (8)
In our work we propose implementing fuzzy logic using memristors. Min and max operations are done by antipodally configured memristor circuits that may be assembled into computational circuits. We discuss computational power of such circuits with respect to m-efficiency and experimentally observed behavior of memristive devices. Circuits implemented with… (More)
1. Introduction. Our work began with calculations of the numbers of points on a family of hyperelliptic curves given by the following equation over a finite field k of characteristic 2: y
Abstrakt In this note we critically examine the current state of teaching of Discrete Simulation at our university. We consider the case study of one of the projects that students are expected to solve in the course. Three approaches are compared-nonmodular resulting from the current approach , using Haskell, and using Reactive framework from C#. We… (More)
In our work we define a new algebra of operators as a substitute for fuzzy logic. Its primary purpose is for construction of binary dis-criminators for phonemes based on spectral content. It is optimized for design of non-parametric computational circuits, and makes uses of 4 operations: min, max, the difference and generalized additively homogenuous means.
We consider the ability of a very simple feed-forward ne-ural network to discriminate phonemes based on just relative power spectrum. The network consists of two neurons with symmetric nonlinear response over a spectral range. The output of the neurons is subsequently fed to a comparator. We show that often this is enough to achieve complete separation of… (More)
KS-algebra consists of expressions constructed with four kinds operations , the minimum, maximum, difference and additively homogeneous generalized means. Five families of Z-classifiers are investigated on binary classification tasks between English phonemes. It is shown that the classifiers are able to reflect well known formant characteristics of vowels,… (More)
OndrejŠuch Abstract. We prove a criterion to check whether a polynomial is irreducible. This criterion is related to trace map computations. It may be effectively used to detect irreducibility of polynomials of prime degree over their base field.