Search results for "stochastic"
showing 10 items of 1018 documents
Time scales of adaptive behavior and motor learning in the presence of stochastic perturbations.
2009
In this paper, the major assumptions of influential approaches to the structure of variability in practice conditions are discussed from the perspective of a generalized evolving attractor landscape model of motor learning. The efficacy of the practice condition effects is considered in relation to the theoretical influence of stochastic perturbations in models of gradient descent learning of multiple dimension landscapes. A model for motor learning is presented combining simulated annealing and stochastic resonance phenomena against the background of different time scales for adaptation and learning processes. The practical consequences of the model's assumptions for the structure of pract…
One- and multi-locus multi-allele selection models in a random environment
1979
We deduce conditions for stochastic local stability of general perturbed linear stochastic difference equations widely applicable in population genetics. The findings are adapted to evaluate the stability properties of equilibria in classical one- and multi-locus multi-allele selection models influenced by random temporal variation in selection intensities. As an example of some conclusions and biological interpretations we analyse a special one-locus multi-allele model in more detail.
Complementary Judgment Matrix Method with Imprecise Information for Multicriteria Decision-Making
2018
The complementary judgment matrix (CJM) method is an MCDA (multicriteria decision aiding) method based on pairwise comparisons. As in AHP, the decision-maker (DM) can specify his/her preferences using pairwise comparisons, both between different criteria and between different alternatives with respect to each criterion. The DM specifies his/her preferences by allocating two nonnegative comparison values so that their sum is 1. We measure and pinpoint possible inconsistency by inconsistency errors. We also compare the consistency of CJM and AHP trough simulation. Because preference judgments are always more or less imprecise or uncertain, we introduce a way to represent the uncertainty throu…
Partial joint processing with efficient backhauling using particle swarm optimization
2012
In cellular communication systems with frequency reuse factor of one, user terminals (UT) at the cell-edge are prone to intercell interference. Joint processing is one of the coordinated multipoint transmission techniques proposed to mitigate this interference. In the case of centralized joint processing, the channel state information fed back by the users need to be available at the central coordination node for precoding. The precoding weights (with the user data) need to be available at the corresponding base stations to serve the UTs. These increase the backhaul traffic. In this article, partial joint processing (PJP) is considered as a general framework that allows reducing the amount …
Dynamic Coalitional TU Games: Distributed Bargaining among Players' Neighbors
2013
We consider a sequence of transferable utility (TU) games where, at each time, the characteristic function is a random vector with realizations restricted to some set of values. The game differs from other ones in the literature on dynamic, stochastic or interval valued TU games as it combines dynamics of the game with an allocation protocol for the players that dynamically interact with each other. The protocol is an iterative and decentralized algorithm that offers a paradigmatic mathematical description of negotiation and bargaining processes. The first part of the paper contributes to the definition of a robust (coalitional) TU game and the development of a distributed bargaining protoc…
Learning for allocations in the long-run average core of dynamical cooperative TU games
2011
We consider repeated coalitional TU games characterized by unknown but bounded and time-varying coalitions' values. We build upon the assumption that the Game Designer uses a vague measure of the extra reward that each coalition has received up to the current time to learn on how to re-adjust the allocations among the players. As main result, we present an allocation rule based on the extra reward variable that converges with probability one to the core of the long-run average game. Analogies with stochastic stability theory are put in evidence.
Stochastic reconstruction of sandstones
2000
A simulated annealing algorithm is employed to generate a stochastic model for a Berea and a Fontainebleau sandstone with prescribed two-point probability function, lineal path function, and ``pore size'' distribution function, respectively. We find that the temperature decrease of the annealing has to be rather quick to yield isotropic and percolating configurations. A comparison of simple morphological quantities indicates good agreement between the reconstructions and the original sandstones. Also, the mean survival time of a random walker in the pore space is reproduced with good accuracy. However, a more detailed investigation by means of local porosity theory shows that there may be s…
Reliability-based design optimization of trusses under dynamic shakedown constraints
2019
A reliability-based design optimization problem under dynamic shakedown constraints for elastic perfectly plastic truss structures subjected to stochastic wind actions is presented. The simultaneous presence of quasi-static (cyclic) thermal loads is also considered. As usual in the shakedown theory, the quasi-statical loads will be defined as variable within a deterministic domain, while the dynamic problem will be treated considering an extended Ceradini-Gavarini approach. Some sources of uncertainties are introduced in the structural system and in the load definition. The reliability-optimization problem is formulated as the minimization of the volume of the structure subjected to determi…
Statistical validation of rival models for observable stochastic process and its identification
2011
In this paper, for statistical validation of rival (analytical or simulation) models collected for modeling observable process in stochastic system (say, transportation or service system), a uniformly most powerful invariant (UMPI) test is developed from the generalized maximum likelihood ratio (GMLR). This test can be considered as a result of a new approach to solving the Behrens-Fisher problem when covariance matrices of multivariate normal populations (compared with respect to their means) are different and unknown. The test makes use of an invariant statistic whose distribution, under the null hypothesis, does not depend on the unknown (nuisance) parameters. The sample size and thresho…
SMAA - Stochastic multiobjective acceptability analysis
1998
Stochastic multiobjective acceptability analysis (SMAA) is a multicriteria decision support technique for multiple decision makers based on exploring the weight space. Inaccurate or uncertain input data can be represented as probability distributions. In SMAA the decision makers need not express their preferences explicitly or implicitly; instead the technique analyses what kind of valuations would make each alternative the preferred one. The method produces for each alternative an acceptability index measuring the variety of different valuations that support that alternative, a central weight vector representing the typical valuations resulting in that decision, and a confidence factor mea…