Search results for " function"
showing 10 items of 9395 documents
REPEATED GAMES WITH PROBABILISTIC HORIZON
2005
Repeated games with probabilistic horizon are defined as those games where players have a common probability structure over the length of the game's repetition, T. In particular, for each t, they assign a probability pt to the event that "the game ends in period t". In this framework we analyze Generalized Prisoners' Dilemma games in both finite stage and differentiable stage games. Our construction shows that it is possible to reach cooperative equilibria under some conditions on the distribution of the discrete random variable T even if the expected length of the game is finite. More precisely, we completely characterize the existence of sub-game perfect cooperative equilibria in finite s…
The Local Fractional Derivative of Fractal Curves
2008
Fractal curves described by iterated function system (IFS) are generally non-integer derivative. For that we use fractional derivative to investigate differentiability of this curves. We propose a method to calculate local fractional derivative of a curve from IFS property. Also we give some examples of IFS representing the slopes of the right and left half-tangent of the fractal curves.
Memory limited inductive inference machines
1992
The traditional model of learning in the limit is restricted so as to allow the learning machines only a fixed, finite amount of memory to store input and other data. A class of recursive functions is presented that cannot be learned deterministically by any such machine, but can be learned by a memory limited probabilistic leaning machine with probability 1.
Learning by the Process of Elimination
2002
AbstractElimination of potential hypotheses is a fundamental component of many learning processes. In order to understand the nature of elimination, herein we study the following model of learning recursive functions from examples. On any target function, the learning machine has to eliminate all, save one, possible hypotheses such that the missing one correctly describes the target function. It turns out that this type of learning by the process of elimination (elm-learning, for short) can be stronger, weaker or of the same power as usual Gold style learning.While for usual learning any r.e. class of recursive functions can be learned in all of its numberings, this is no longer true for el…
On the duality between mechanistic learners and what it is they learn
1993
All previous work in inductive inference and theoretical machine learning has taken the perspective of looking for a learning algorithm that successfully learns a collection of functions. In this work, we consider the perspective of starting with a set of functions, and considering the collection of learning algorithms that are successful at learning the given functions. Some strong dualities are revealed.
Lazy consensus for networks with unknown but bounded disturbances
2007
We consider stationary consensus protocols for networks of dynamic agents. The measure of the neighbors' state is affected by Unknown But Bounded disturbances. Here the main contribution is the formulation and solution of what we call the isin-consensus problem, where the states are required to converge in a tube of ray isin asymptotically or in finite time.
Multilayer perceptron neural networks and radial-basis function networks as tools to forecast accumulation of deoxynivalenol in barley seeds contamin…
2011
The capacity of multi-layer perceptron artificial neural networks (MLP-ANN) and radial-basis function networks (RBFNs) to predict deoxynivalenol (DON) accumulation in barley seeds contaminated with Fusarium culmorum under different conditions has been assessed. Temperature (20-28 °C), water activity (0.94-0.98), inoculum size (7-15 mm diameter), and time were the inputs while DON concentration was the output. The dataset was used to train, validate and test many ANNs. Minimizing the mean-square error (MSE) was used to choose the optimal network. Single-layer perceptrons with low number of hidden nodes proved better than double-layer perceptrons, but the performance depended on the training …
Kernel manifold alignment for domain adaptation
2016
The wealth of sensory data coming from different modalities has opened numerous opportu- nities for data analysis. The data are of increasing volume, complexity and dimensionality, thus calling for new methodological innovations towards multimodal data processing. How- ever, multimodal architectures must rely on models able to adapt to changes in the data dis- tribution. Differences in the density functions can be due to changes in acquisition conditions (pose, illumination), sensors characteristics (number of channels, resolution) or different views (e.g. street level vs. aerial views of a same building). We call these different acquisition modes domains, and refer to the adaptation proble…
Dynamic graphics in Excel for teaching statistics: understanding the probability density function
2011
In this article, we show a dynamic graphic in Excel that is used to introduce an important concept in our subject, Statistics I: the probability density function. This interactive graphic seeks to facilitate conceptual understanding of the main aspects analysed by the learners.
A Novel Solution to Find the Dynamic Response of an Euler–Bernoulli Beam Fitted with Intraspan TMDs under Poisson Type Loading
2020
This contribution considers a virtual experiment on the vibrational response of rail and road bridges equipped with smart devices in the form of damping elements to mitigate vibrations. The internal damping of the bridge is considered a discontinuity that contain a dashpot. Exact complex eigenvalues and eigenfunctions are derived from a characteristic equation built as the determinant of a 4 x 4 matrix