The 2nd Conference on Digitization
The Bhattacharyya metric as an absolute similarity measure for frequency coded data
This paper highlights advantageous properties of the Bhattacharyya metric over the chi-squared statistic for comparing frequency distributed data. The original interpretation of the Bhattacharyya metric as a geometric similarity measure is reviewed and it is pointed out that this derivation is independent of the use of the Bhattacharyya measure as an upper bound on the probability of misclassification in a two-class problem. The affinity between the Bhattacharyya and Matusita measures is described...
The concept of indirectness in artificial intelligence
The conjugacy between Cascades generated by a weakly nonlinear system and the Euler method of a flow
Sufficient conditions for the existence of a topological conjugacy between a cascade obtained from a weakly nonlinear flow by fixing the time step and a cascade obtained by the Euler method are analysed. The aim of this paper is to provide relations between constants in the Fečkan theorem. Given such relations an implementation of a weakly nonlinear neuron is possible.
The convergence rate for a -functional in learning theory.
The Coverage Model and Its Use in Image Processing
The current approaches in pattern recognition
The Diamond Tool: a way of effective development and utilization of knowledge
This paper presents the Diamond Tool for knowledge management. The main objective of its specification and implementation was to create a universal and easily extendable tool for efficient work with knowledge. One of its extensions is the eTrium technology. The principal idea behind this technology is to represent explicitly the knowledge used by the information system by means of a knowledge agent built on the Diamond Tool – in contrary to current approaches, where knowledge is present implicitly...
The embedding of the formal concept analysis into the L-Fuzzy concept theory.
In this work, we study the relation between the concept lattice of Wille ([5], [6]) and the L-Fuzzy concept lattice ([2]) developed by us. To do it, we have defined an application g that associates to each concept of Wille an L-Fuzzy concept. The main point of this work is to prove that if we are working with a crisp relation between an object set and an attribute set, the concept lattice of Wille is a sublattice of the L-Fuzzy concept lattice. At the end, we show a typical example in the formal...
The employment of Prolog for a syntax analysis in syntactic pattern recognition applications
The estimation of electric power losses in electrical networks by fuzzy regression model using genetic algorithm.
This paper presents the comparative study for fuzzy regression model using linear programming, fuzzy regression model using genetic algorithms and standard regression model. The fuzzy and standard models were developed for estimation of electric power losses in electrical networks. Simulation was carried out with a tool developed in MATLAB.
The expert system shell EQUANT-PC: brief information
The finite automata approaches in stringology
We present an overview of four approaches of the finite automata use in stringology: deterministic finite automaton, deterministic simulation of nondeterministic finite automaton, finite automaton as a model of computation, and compositions of finite automata solutions. We also show how the finite automata can process strings build over more complex alphabet than just single symbols (degenerate symbols, strings, variables).
The geometry of configuration spaces for closed chains in two and three dimensions.
The Gödel Completeness Theorem for Uncountable Languages
This article is the second in a series of two Mizar articles constituting a formal proof of the Gödel Completeness theorem [15] for uncountably large languages. We follow the proof given in [16]. The present article contains the techniques required to expand a theory such that the expanded theory contains witnesses and is negation faithful. Then the completeness theorem follows immediately.
The GUHA method and the three-valued logic
The HeKatE methodology. Hybrid engineering of intelligent systems
This paper describes a new approach, the HeKatE methodology, to the design and development of complex rule-based systems for control and decision support. The main paradigm for rule representation, namely, eXtended Tabular Trees (XTT), ensures high density and transparency of visual knowledge representation. Contrary to traditional, flat rule-based systems, the XTT approach is focused on groups of similar rules rather than on single rules. Such groups form decision tables which are connected into...
The implementation of the example-based machine translation technique for Norwegian-to-Polish automatic translation system
The irrelevant information principle for collective probabilistic reasoning
Within the framework of discrete probabilistic uncertain reasoning a large literature exists justifying the maximum entropy inference process, , as being optimal in the context of a single agent whose subjective probabilistic knowledge base is consistent. In particular Paris and Vencovská completely characterised the inference process by means of an attractive set of axioms which an inference process should satisfy. More recently the second author extended the Paris-Vencovská axiomatic approach...
The logic of neural networks.
This paper establishes the equivalence between multilayer feedforward networks and linear combinations of Lukasiewicz propositions. In this sense, multilayer forward networks have a logic interpretation, which should permit to apply logical techniques in the neural networks framework.