All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 2

Displaying 21 – 39 of 39

Showing per page

Prediction of time series by statistical learning: general losses and fast rates

Pierre Alquier, Xiaoyin Li, Olivier Wintenberger (2013)

Dependence Modeling

We establish rates of convergences in statistical learning for time series forecasting. Using the PAC-Bayesian approach, slow rates of convergence √ d/n for the Gibbs estimator under the absolute loss were given in a previous work [7], where n is the sample size and d the dimension of the set of predictors. Under the same weak dependence conditions, we extend this result to any convex Lipschitz loss function. We also identify a condition on the parameter space that ensures similar rates for the...

Predictive control for trajectory tracking and decentralized navigation of multi-agent formations

Ionela Prodan, Sorin Olaru, Cristina Stoica, Silviu-Iulian Niculescu (2013)

International Journal of Applied Mathematics and Computer Science

This paper addresses a predictive control strategy for a particular class of multi-agent formations with a time-varying topology. The goal is to guarantee tracking capabilities with respect to a reference trajectory which is pre-specified for an agent designed as the leader. Then, the remaining agents, designed as followers, track the position and orientation of the leader. In real-time, a predictive control strategy enhanced with the potential field methodology is used in order to derive a feedback...

Preliminaries to Classical First Order Model Theory

Marco Caminati (2011)

Formalized Mathematics

First of a series of articles laying down the bases for classical first order model theory. These articles introduce a framework for treating arbitrary languages with equality. This framework is kept as generic and modular as possible: both the language and the derivation rule are introduced as a type, rather than a fixed functor; definitions and results regarding syntax, semantics, interpretations and sequent derivation rules, respectively, are confined to separate articles, to mark out the hierarchy...

Preservation of properties of fuzzy relations during aggregation processes

Józef Drewniak, Urszula Dudziak (2007)

Kybernetika

Diverse classes of fuzzy relations such as reflexive, irreflexive, symmetric, asymmetric, antisymmetric, connected, and transitive fuzzy relations are studied. Moreover, intersections of basic relation classes such as tolerances, tournaments, equivalences, and orders are regarded and the problem of preservation of these properties by n -ary operations is considered. Namely, with the use of fuzzy relations R 1 , ... , R n and n -argument operation F on the interval [ 0 , 1 ] , a new fuzzy relation R F = F ( R 1 , ... , R n ) is created. Characterization...

Prime ideal theorem for double Boolean algebras

Léonard Kwuida (2007)

Discussiones Mathematicae - General Algebra and Applications

Double Boolean algebras are algebras (D,⊓,⊔,⊲,⊳,⊥,⊤) of type (2,2,1,1,0,0). They have been introduced to capture the equational theory of the algebra of protoconcepts. A filter (resp. an ideal) of a double Boolean algebra D is an upper set F (resp. down set I) closed under ⊓ (resp. ⊔). A filter F is called primary if F ≠ ∅ and for all x ∈ D we have x ∈ F or x ⊲ ∈ F . In this note we prove that if F is a filter and I an ideal such that F ∩ I = ∅ then there is a primary filter G containing F such that G...

Probabilistic propositional calculus with doubled nonstandard semantics

Ivan Kramosil (1999)

Kybernetika

The classical propositional language is evaluated in such a way that truthvalues are subsets of the set of all positive integers. Such an evaluation is projected in two different ways into the unit interval of real numbers so that two real-valued evaluations are obtained. The set of tautologies is proved to be identical, in all the three cases, with the set of classical propositional tautologies, but the induced evaluations meet some natural properties of probability measures with respect to nonstandard...

Probability distribution of transformed random variables with application to nonlinear features extraction

Lubomír Soukup (1998)

Kybernetika

A method for estimation of probability distribution of transformed random variables is presented. The proposed approach admits an approximation of the transformation of the random variables. The approximate probability density function (pdf) is corrected to obtain a resulting pdf which incorporates a prior knowledge of approximation errors. The corrected pdf is not contaminated by any uncontrollable approximation. The method is applied to pattern recognition. It is shown that class conditional pdf...

Processing of Byzantine Neume Notation in Ancient Historical Manuscripts

Laskov, Lasko (2011)

Serdica Journal of Computing

This article presents the principal results of the doctoral thesis “Recognition of neume notation in historical documents” by Lasko Laskov (Institute of Mathematics and Informatics at Bulgarian Academy of Sciences), successfully defended before the Specialized Academic Council for Informatics and Mathematical Modelling on 07 June 2010.Byzantine neume notation is a specific form of note script, used by the Orthodox Christian Church since ancient times until nowadays for writing music and musical...

Program for generating fuzzy logical operations and its use in mathematical proofs

Tomáš Bartušek, Mirko Navara (2002)

Kybernetika

Fuzzy logic is one of the tools for management of uncertainty; it works with more than two values, usually with a continuous scale, the real interval [ 0 , 1 ] . Implementation restrictions in applications force us to use in fact a finite scale (finite chain) of truth degrees. In this paper, we study logical operations on finite chains, in particular conjunctions. We describe a computer program generating all finitely-valued fuzzy conjunctions ( t -norms). It allows also to select these t -norms according to...

Currently displaying 21 – 39 of 39

Previous Page 2