Search results for "PROBABILITY"
showing 10 items of 3417 documents
Stability and -gain controller design for positive switched systems with mixed time-varying delays
2013
This paper investigates the problems of stability and L"1-gain controller design for positive switched systems with mixed time-varying delays. The mixed time-varying delays are presented in the forms of discrete delay and distributed delay. The purpose of this paper is to design a class of switching signals and a state feedback controller for the considered system such that the resulting closed-loop system is exponentially stable with L"1-gain performance. By constructing an appropriate co-positive type Lyapunov-Krasovskii functional and using the average dwell time approach, we propose a sufficient condition to ensure the exponential stability with weighted L"1-gain performance for the sys…
Maximal subgroups of small index of finite almost simple groups
2022
We prove in this paper that a finite almost simple group $R$ with socle the non-abelian simple group $S$ possesses a conjugacy class of core-free maximal subgroups whose index coincides with the smallest index $\operatorname{l}(S)$ of a maximal group of $S$ or a conjugacy class of core-free maximal subgroups with a fixed index $v_S \leq {\operatorname{l}(S)^2}$, depending only on $S$. We show that the number of subgroups of the outer automorphism group of $S$ is bounded by $\log^3 {\operatorname{l}(S)}$ and $\operatorname{l}(S)^2 < |S|$.
Network structure and optimal technological innovation
2019
The role of networks in the emergence, diffusion and evolution of technological innovations has attracted much theoretical and empirical attention. Yet, much of the work has explored the role of undirected and homogeneous networks. In real cases, many networks are directed. The flow of information, benefits or observations is directed from one node towards another node. Real networks are also heterogeneous, for example, few nodes have a high degree while many others have a low degree. In this article, we report on the results of an evolutionary agent-based model in which a group of agents, in our case firms, collectively search a complex (rugged) technological landscape and observe each oth…
Population Monte Carlo Schemes with Reduced Path Degeneracy
2017
Population Monte Carlo (PMC) algorithms are versatile adaptive tools for approximating moments of complicated distributions. A common problem of PMC algorithms is the so-called path degeneracy; the diversity in the adaptation is endangered due to the resampling step. In this paper we focus on novel population Monte Carlo schemes that present enhanced diversity, compared to the standard approach, while keeping the same implementation structure (sample generation, weighting and resampling). The new schemes combine different weighting and resampling strategies to reduce the path degeneracy and achieve a higher performance at the cost of additional low computational complexity cost. Computer si…
BELM: Bayesian Extreme Learning Machine
2011
The theory of extreme learning machine (ELM) has become very popular on the last few years. ELM is a new approach for learning the parameters of the hidden layers of a multilayer neural network (as the multilayer perceptron or the radial basis function neural network). Its main advantage is the lower computational cost, which is especially relevant when dealing with many patterns defined in a high-dimensional space. This brief proposes a bayesian approach to ELM, which presents some advantages over other approaches: it allows the introduction of a priori knowledge; obtains the confidence intervals (CIs) without the need of applying methods that are computationally intensive, e.g., bootstrap…
Human Factor Interrelationships to Improve Worker Reliability: Implementation of MCDM in the Agri-Food Sector
2023
Performance Shaping Factors (PSFs) are contextual, individual, and cognitive factors used in Human Reliability Analysis (HRA) to quantify the worker contribution to errors when performing a generic task. Although the empirical evidence demonstrates the existence of PSF interrelationships, the majority of HRA methods assume their independence. As a consequence, the resulting Human Error Probability (HEP) might be over- or underestimated. To deal with this issue, only a few qualitative guidelines or statistical-based approaches have been proposed so far. While the former are not well structured, the latter require a high computational effort and a proper number of input data. Therefore, the p…
Cell Association With Load Balancing in Nonuniform Heterogeneous Cellular Networks: Coverage Probability and Rate Analysis
2017
To meet the ever-growing traffic demand and address the cell capacity shortage problem, associating end users to various tiers of cells in a multitier cellular network appears to be a promising approach. In this paper, we consider a nonuniform heterogeneous cellular network (NuHCN) and propose a cell association scheme that selectively mutes certain small-cell base stations (BSs) and covers end users by cell range extension (via cell biasing) for achieving load balancing. The envisaged NuHCN is comprised of two tiers of BSs, i.e., macro- and small-cell BSs, deployed according to three independent homogeneous Poisson point processes for BSs and end users, respectively. Accordingly, the avail…
A saturated strategy robustly ensures stability of the cooperative equilibrium for Prisoner's dilemma
2016
We study diffusion of cooperation in a two-population game in continuous time. At each instant, the game involves two random individuals, one from each population. The game has the structure of a Prisoner's dilemma where each player can choose either to cooperate (c) or to defect (d), and is reframed within the field of approachability in two-player repeated game with vector payoffs. We turn the game into a dynamical system, which is positive, and propose a saturated strategy that ensures local asymptotic stability of the equilibrium (c, c) for any possible choice of the payoff matrix. We show that there exists a rectangle, in the space of payoffs, which is positively invariant for the syst…
The shape of small sample biases in pricing kernel estimations
2016
AbstractNumerous empirical studies find pricing kernels that are not-monotonically decreasing; the findings are at odds with the pricing kernel being marginal utility of a risk-averse, so-called representative agent. We study in detail the common procedure which estimates the pricing kernel as the ratio of two separate density estimations. In the first step, we analyse theoretically the functional dependence for the ratio of a density to its estimated density; this cautions the reader regarding potential computational issues coupled with statistical techniques. In the second step, we study this quantitatively; we show that small sample biases shape the estimated pricing kernel, and that est…
Recursive and bargaining values
2021
Abstract We introduce two families of values for TU-games: the recursive and bargaining values. Bargaining values are obtained as the equilibrium payoffs of the symmetric non-cooperative bargaining game proposed by Hart and Mas-Colell (1996). We show that bargaining values have a recursive structure in their definition, and we call this property recursiveness. All efficient, linear, and symmetric values that satisfy recursiveness are called recursive values. We generalize the notions of potential, and balanced contributions property, to characterize the family of recursive values. Finally, we show that if a time discount factor is considered in the bargaining model, every bargaining value h…