Lineární algebra ukrytá v internetovém vyhledávači Google
Linear-Size Nonobtuse Triangulation of Polygons.
Linguistic knowledge base simplification regarding accuracy and interpretability.
This work proposes a new method in order to simplify linguistic knowledge bases. The main goal consists of improving simultaneously accuracy and interpretability when it is possible, or at least ensuring a good trade-off between them, as well as consistency of the final knowledge base. It is used with linguistic rules which can be defined by expert, induced by data, or both of them. The simplification process is applied to the well known wine classification problem. The results are encouraging.
L'interrogation : ébauche d'une représentation formelle par des équations
Listing all plane graphs.
Local Boolean manifolds from knowledge representation systems.
We introduce a structure to represent observations on entities in order to obtain knowledge about some of their characteristic properties or attributes. This structure is based on the Pawlak's definition of information systems (also knowledge representation systems) and lead us to obtain algebraic structures of lattice depending from the choice of an observational context. The semantical algebraic structure so obtained is of local Boolean manifold whose global structure is an orthoposet which shows...
Local detection of defects from image sequences
Our aim is to discuss three approaches to the detection of defects in continuous production processes, which are based on local methods of processing image sequences. These approaches are motivated by and applicable to images of hot metals or other surfaces, which are uniform at a macroscopic level, when defects are not present. The first of them is based on the estimation of fractal dimensions of image cross-sections. The second and third approaches are compositions of known techniques, which are...
Local stability conditions for discrete-time cascade locally recurrent neural networks
The paper deals with a specific kind of discrete-time recurrent neural network designed with dynamic neuron models. Dynamics are reproduced within each single neuron, hence the network considered is a locally recurrent globally feedforward. A crucial problem with neural networks of the dynamic type is stability as well as stabilization in learning problems. The paper formulates local stability conditions for the analysed class of neural networks using Lyapunov's first method. Moreover, a stabilization...
Local transition functions of quantum Turing machines
Local Transition Functions of Quantum Turing Machines
Foundations of the notion of quantum Turing machines are investigated. According to Deutsch's formulation, the time evolution of a quantum Turing machine is to be determined by the local transition function. In this paper, the local transition functions are characterized for fully general quantum Turing machines, including multi-tape quantum Turing machines, extending the results due to Bernstein and Vazirani.
Localization and fuzzy classification of manufacturing defects in sheets of glass.
Artificial Vision Systems are commonly used in industrial applications. The low cost of the equipment facilitates the development of new products. In this paper we describe the use of an artificial vision system in one of the phases of a quality control process related to automotive industries: the windshield manufacturing. We intend to localize and classify the defects that were originated while manufacturing the glass that forms the windshield. We will show that a fuzzy classifier, after being...
Localization of touching points for interpolation of discrete circles.
Locally catenative sequences and Turtle graphics
Motivated by striking properties of the well known Fibonacci word we consider pictures which are defined by this word and its variants via so-called turtle graphics. Such a picture can be bounded or unbounded. We characterize when the picture defined by not only the Fibonacci recurrence, but also by a general recurrence formula, is bounded, the characterization being computable.
Locally catenative sequences and Turtle graphics
Motivated by striking properties of the well known Fibonacci word we consider pictures which are defined by this word and its variants via so-called turtle graphics. Such a picture can be bounded or unbounded. We characterize when the picture defined by not only the Fibonacci recurrence, but also by a general recurrence formula, is bounded, the characterization being computable.
Locally linear discriminate embedding for face recognition.
Locally testable semigroups.
Locally weighted neural networks for an analysis of the biosensor response
This paper presents a semi-global mathematical model for an analysis of a signal of amperometric biosensors. Artificial neural networks were applied to an analysis of the biosensor response to multi-component mixtures. A large amount of the learning and test data was synthesized using computer simulation of the biosensor response. The biosensor signal was analyzed with respect to the concentration of each component of the mixture. The paradigm of locally weighted linear regression was used for retraining...
Logarithmic frequency in morphic sequences
We study the logarithmic frequency of letters and words in morphic sequences and show that this frequency must always exist, answering a question of Allouche and Shallit.
Logic and functional programming by retractions
Logic and functional programming by retractions : operational semantics