Displaying 401 – 420 of 922

Showing per page

A sharpening of the Parikh mapping

Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu (2010)

RAIRO - Theoretical Informatics and Applications

In this paper we introduce a sharpening of the Parikh mapping and investigate its basic properties. The new mapping is based on square matrices of a certain form. The classical Parikh vector appears in such a matrix as the second diagonal. However, the matrix product gives more information about a word than the Parikh vector. We characterize the matrix products and establish also an interesting interconnection between mirror images of words and inverses of .

A short note on Perez’s approximation by dependence structure simplification

Radim Jiroušek (2007)

Kybernetika

Perez’s approximations of probability distributions by dependence structure simplification were introduced in 1970s, much earlier than graphical Markov models. In this paper we will recall these Perez’s models, formalize the notion of a compatible system of elementary simplifications and show the necessary and sufficient conditions a system must fulfill to be compatible. For this we will utilize the apparatus of compositional models.

A simple upper bound to the Bayes error probability for feature selection

Lorenzo Bruzzone, Sebastiano B. Serpico (1998)

Kybernetika

In this paper, feature selection in multiclass cases for classification of remote-sensing images is addressed. A criterion based on a simple upper bound to the error probability of the Bayes classifier for the minimum error is proposed. This criterion has the advantage of selecting features having a link with the error probability with a low computational load. Experiments have been carried out in order to compare the performances provided by the proposed criterion with the ones of some of the widely...

A simplex trained neural network-based architecture for sensor fusion and tracking of target maneuvers

Yee Chin Wong, Malur K. Sundareshan (1999)

Kybernetika

One of the major applications for which neural network-based methods are being successfully employed is in the design of intelligent integrated processing architectures that efficiently implement sensor fusion operations. In this paper we shall present a novel scheme for developing fused decisions for surveillance and tracking in typical multi-sensor environments characterized by the disparity in the data streams arriving from various sensors. This scheme employs an integration of a multilayer neural...

A Slideing Mesh-Mortar Method for a two Dimensional Currents Model of Electric Engines

Annalisa Buffa, Yvon Maday, Francesca Rapetti (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

The paper deals with the application of a non-conforming domain decomposition method to the problem of the computation of induced currents in electric engines with moving conductors. The eddy currents model is considered as a quasi-static approximation of Maxwell equations and we study its two-dimensional formulation with either the modified magnetic vector potential or the magnetic field as primary variable. Two discretizations are proposed, the first one based on curved finite elements and the...

A sliding Mesh-Mortar method for a two dimensional Eddy currents model of electric engines

Annalisa Buffa, Yvon Maday, Francesca Rapetti (2001)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

The paper deals with the application of a non-conforming domain decomposition method to the problem of the computation of induced currents in electric engines with moving conductors. The eddy currents model is considered as a quasi-static approximation of Maxwell equations and we study its two-dimensional formulation with either the modified magnetic vector potential or the magnetic field as primary variable. Two discretizations are proposed, the first one based on curved finite elements and the...

Currently displaying 401 – 420 of 922