The difference and truth-table hierarchies for NP
The dimension of graph directed attractors with overlaps on the line, with an application to a problem in fractal image recognition
Consider a graph directed iterated function system (GIFS) on the line which consists of similarities. Assuming neither any separation conditions, nor any restrictions on the contractions, we compute the almost sure dimension of the attractor. Then we apply our result to give a partial answer to an open problem in the field of fractal image recognition concerning some self-affine graph directed attractors in space.
The discrete logarithm problem over prime fields: the safe prime case. The Smart attack, non-canonical lifts and logarithmic derivatives
We connect the discrete logarithm problem over prime fields in the safe prime case to the logarithmic derivative.
The distribution of -ary search trees generated by van der Corput sequences.
The dynamics of the drum mower blade
The drum mower blade is freely rotatable around the fastening pin. During the operation of the mower, the centrifugal force and the resistance of the mowing material act on it. The presented article studies the effect of these forces on the behavior of the blade, in particular its oscillation around the steady state, depending on the properties of the cut material.
The Educational Use of Mathematical Software: Techniques and Examples
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 energy dissipation, the error probability and the time of duration a logical operation
The entropy and redundancy of normalized database structures
The entropy of Łukasiewicz-languages
The paper presents an elementary approach for the calculation of the entropy of a class of languages. This approach is based on the consideration of roots of a real polynomial and is also suitable for calculating the Bernoulli measure. The class of languages we consider here is a generalisation of the Łukasiewicz language.
The entropy of Łukasiewicz-languages
The paper presents an elementary approach for the calculation of the entropy of a class of languages. This approach is based on the consideration of roots of a real polynomial and is also suitable for calculating the Bernoulli measure. The class of languages we consider here is a generalisation of the Łukasiewicz language.
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 EuDML Metadata Schema : Version 1.0
After an extensive study of the metadata policy of each of its content partners, the EuDML project evaluated many different strategies and existing schemas that could store every detail faithfully, and yet reserve room for the enhancements foreseen in the project’s work plan. The framework provided by the so-called NLM Journal Archiving and Interchange Tag Suite was selected as best readily available approximation of our needs. Some modifications of it have been endorsed by the project, defining...
The expert system shell EQUANT-PC: brief information
The extent to which linear problems have linear optimal algorithms
The factor automaton
This paper concerns searching substrings in a string using the factor automaton. The factor automaton is a deterministic finite automaton constructed to accept every substring of the given string. Nondeterministic factor automaton is used to achieve new operations on factor automata for searching in non-constant texts.
The family of languages satisfying Bar-Hillel's lemma
The Fan-Raspaud conjecture: A randomized algorithmic approach and application to the pair assignment problem in cubic networks
It was conjectured by Fan and Raspaud (1994) that every bridgeless cubic graph contains three perfect matchings such that every edge belongs to at most two of them. We show a randomized algorithmic way of finding Fan-Raspaud colorings of a given cubic graph and, analyzing the computer results, we try to find and describe the Fan-Raspaud colorings for some selected classes of cubic graphs. The presented algorithms can then be applied to the pair assignment problem in cubic computer networks. Another...
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).