#### Filter Results:

#### Publication Year

2000

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

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)

- ONDREJ ŠUCH
- 2000

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)

- Ondrej Such
- ArXiv
- 2013

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.

Estimating class membership probabilities is an important step in many automated speech recognition systems. Since binary classifiers are usually easier to train, one common approach to this problem is to construct pair-wise binary classifiers. Pairwise models yield an over-determined system of equations for the class membership probabilities. Motivated by… (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)