Distributed power control algorithm for multiple access systems based on Verhulst model

In this paper the continuous Verhulst dynamic model is used to synthesize a new distributed power control algorithm (DPCA) for use in direct sequence code division multiple access (DS-CDMA) systems. The Verhulst model was initially designed to describe the population growth of biological species under food and physical space restrictions. The discretization of the corresponding differential equation is accomplished via the Euler numeric integration (ENI) method. Analytical convergence conditions for the proposed DPCA are also established. Several properties of the proposed recursive algorithm, such as Euclidean distance from optimum vector after convergence, convergence speed, normalized mean squared error (NSE), average power consumption per user, performance under dynamics channels, and implementation complexity aspects, are analyzed through simulations. The simulation results are compared with two other DPCAs: the classic algorithm derived by Foschini and Miljanic and the sigmoidal of Uykan and Koivo. Under estimated errors conditions, the proposed DPCA exhibits smaller discrepancy from the optimum power vector solution and better convergence (under fixed and adaptive convergence factor) than the classic and sigmoidal DPCAs. (C) 2010 Elsevier GmbH. All rights reserved.

Model selection approaches for non-linear system identification: a review

The identification of non-linear systems using only observed finite datasets has become a mature research area over the last two decades. A class of linear-in-the-parameter models with universal approximation capabilities have been intensively studied and widely used due to the availability of many linear-learning algorithms and their inherent convergence conditions. This article presents a systematic overview of basic research on model selection approaches for linear-in-the-parameter models. One of the fundamental problems in non-linear system identification is to find the minimal model with the best model generalisation performance from observational data only. The important concepts in achieving good model generalisation used in various non-linear system-identification algorithms are first reviewed, including Bayesian parameter regularisation and models selective criteria based on the cross validation and experimental design. A significant advance in machine learning has been the development of the support vector machine as a means for identifying kernel models based on the structural risk minimisation principle. The developments on the convex optimisation-based model construction algorithms including the support vector regression algorithms are outlined. Input selection algorithms and on-line system identification algorithms are also included in this review. Finally, some industrial applications of non-linear models are discussed.

B-Neck: A Distributed and Quiescent Max-Min Fair Algorithm

The problem of fairly distributing the capacity of a network among a set of sessions has been widely studied. In this problem, each session connects via a single path a source and a destination, and its goal is to maximize its assigned transmission rate (i.e., its throughput). Since the links of the network have limited bandwidths, some criterion has to be defined to fairly distribute their capacity among the sessions. A popular criterion is max-min fairness that, in short, guarantees that each session i gets a rate λi such that no session s can increase λs without causing another session s' to end up with a rate λs/ <; λs. Many max-min fair algorithms have been proposed, both centralized and distributed. However, to our knowledge, all proposed distributed algorithms require control data being continuously transmitted to recompute the max-min fair rates when needed (because none of them has mechanisms to detect convergence to the max-min fair rates). In this paper we propose B-Neck, a distributed max-min fair algorithm that is also quiescent. This means that, in absence of changes (i.e., session arrivals or departures), once the max min rates have been computed, B-Neck stops generating network traffic. Quiescence is a key design concept of B-Neck, because B-Neck routers are capable of detecting and notifying changes in the convergence conditions of max-min fair rates. As far as we know, B-Neck is the first distributed max-min fair algorithm that does not require a continuous injection of control traffic to compute the rates. The correctness of B-Neck is formally proved, and extensive simulations are conducted. In them, it is shown that B-Neck converges relatively fast and behaves nicely in presence of sessions arriving and departing.

Sequential and parallel synchronous alternating iterative methods

The so-called parallel multisplitting nonstationary iterative Model A was introduced by Bru, Elsner, and Neumann [Linear Algebra and its Applications 103:175-192 (1988)] for solving a nonsingular linear system Ax = b using a weak nonnegative multisplitting of the first type. In this paper new results are introduced when A is a monotone matrix using a weak nonnegative multisplitting of the second type and when A is a symmetric positive definite matrix using a P -regular multisplitting. Also, nonstationary alternating iterative methods are studied. Finally, combining Model A and alternating iterative methods, two new models of parallel multisplitting nonstationary iterations are introduced. When matrix A is monotone and the multisplittings are weak nonnegative of the first or of the second type, both models lead to convergent schemes. Also, when matrix A is symmetric positive definite and the multisplittings are P -regular, the schemes are also convergent.

Implicit stochastic Runge-Kutta methods for stochastic differential equations

In this paper we construct implicit stochastic Runge-Kutta (SRK) methods for solving stochastic differential equations of Stratonovich type. Instead of using the increment of a Wiener process, modified random variables are used. We give convergence conditions of the SRK methods with these modified random variables. In particular, the truncated random variable is used. We present a two-stage stiffly accurate diagonal implicit SRK (SADISRK2) method with strong order 1.0 which has better numerical behaviour than extant methods. We also construct a five-stage diagonal implicit SRK method and a six-stage stiffly accurate diagonal implicit SRK method with strong order 1.5. The mean-square and asymptotic stability properties of the trapezoidal method and the SADISRK2 method are analysed and compared with an explicit method and a semi-implicit method. Numerical results are reported for confirming convergence properties and for comparing the numerical behaviour of these methods.

Limit Theorems for Maxima of Heavy-Tailed Terms with Random Dependent Weights

2000 Mathematics Subject Classification: Primary 60F17, 60G52, 60G70 secondary 60E07, 62E20.

RATE OF CONVERGENCE OF MAXIMUM LIKELIHOOD ESTIMATORS UNDER RELAXED SMOOTHNESS CONDITIONS ON THE LIKELIHOOD FUNCTION

This report reviews literature on the rate of convergence of maximum likelihood estimators and establishes a Central Limit Theorem, which yields an O(1/sqrt(n)) rate of convergence of the maximum likelihood estimator under somewhat relaxed smoothness conditions. These conditions include the existence of a one-sided derivative in θ of the pdf, compared to up to three that are classically required. A verification through simulation is included in the end of the report.

Known and new results on absolute convergence of Fourier integrals

New sufficient conditions for representation of a function via the absolutely convergent Fourier integral are obtained in the paper. In the main result, Theorem 1.1, this is controlled by the behavior near infinity of both the function and its derivative. This result is extended to any dimension d &= 2.

Evolutionary and convergence stability for continuous phenotypes in finite populations derived from two-allele models.

The evolution of a quantitative phenotype is often envisioned as a trait substitution sequence where mutant alleles repeatedly replace resident ones. In infinite populations, the invasion fitness of a mutant in this two-allele representation of the evolutionary process is used to characterize features about long-term phenotypic evolution, such as singular points, convergence stability (established from first-order effects of selection), branching points, and evolutionary stability (established from second-order effects of selection). Here, we try to characterize long-term phenotypic evolution in finite populations from this two-allele representation of the evolutionary process. We construct a stochastic model describing evolutionary dynamics at non-rare mutant allele frequency. We then derive stability conditions based on stationary average mutant frequencies in the presence of vanishing mutation rates. We find that the second-order stability condition obtained from second-order effects of selection is identical to convergence stability. Thus, in two-allele systems in finite populations, convergence stability is enough to characterize long-term evolution under the trait substitution sequence assumption. We perform individual-based simulations to confirm our analytic results.

Effect of genetic convergence on phylogenetic inference.

Phylogenetic reconstructions are a major component of many studies in evolutionary biology, but their accuracy can be reduced under certain conditions. Recent studies showed that the convergent evolution of some phenotypes resulted from recurrent amino acid substitutions in genes belonging to distant lineages. It has been suggested that these convergent substitutions could bias phylogenetic reconstruction toward grouping convergent phenotypes together, but such an effect has never been appropriately tested. We used computer simulations to determine the effect of convergent substitutions on the accuracy of phylogenetic inference. We show that, in some realistic conditions, even a relatively small proportion of convergent codons can strongly bias phylogenetic reconstruction, especially when amino acid sequences are used as characters. The strength of this bias does not depend on the reconstruction method but varies as a function of how much divergence had occurred among the lineages prior to any episodes of convergent substitutions. While the occurrence of this bias is difficult to predict, the risk of spurious groupings is strongly decreased by considering only 3rd codon positions, which are less subject to selection, as long as saturation problems are not present. Therefore, we recommend that, whenever possible, topologies obtained with amino acid sequences and 3rd codon positions be compared to identify potential phylogenetic biases and avoid evolutionarily misleading conclusions.

Human capital distribution, growth and convergence

This paper studies the dynamic relationship between distribution and endogenous growth in an overlapping generations model with accumulation of human and physical capital. It is shown how human capital can determine a relationship between per capita growth rates and inequality in the distribution of income. Family background effects and spillovers in the transmission of human capital generate a dynamics in which aggregate variables depend not only on the stock, but also on the distribution of human capital. The evolution of this distribution over time is then characterized under different assumptions on private returns and the form of the externality in the technology for humancapital. Conditions for existence, uniqueness and stability of a constant growth equilibrium with a stationary distribution are derived. Increasing returns, idiosyncratic abilities and the possibility of poverty traps are explicitely characterized in a closed form solution of the equilibrium dynamics, showing the role played by technology and preferences parameters.

The poor stay poor: Non-convergence across countries and regions

We study the issue of income convergence across countries and regions witha Bayesian estimator which allows us to use information in an efficient andflexible way. We argue that the very slow convergence rates to a commonlevel of per-capita income found, e.g., by Barro and Xavier Sala-i-Martin,is due to a 'fixed effect bias' that their cross-sectional analysisintroduces in the results. Our approach permits the estimation of differentconvergence rates to different steady states for each cross sectional unit.When this diversity is allowed, we find that convergence of each unit to(its own) steady state income level is much faster than previously estimatedbut that cross sectional differences persist: inequalities will only bereduced by a small amount by the passage of time. The cross countrydistribution of the steady state is largely explained by the cross countrydistribution of initial conditions.

A note on the convergence to competitive equilibria in economies with moral hazard

We examine the conditions under which competitive equilibria can beobtained as the limit, when the number of strategic traders getslarge, of Nash equilibria in economies with asymmetric informationon agents' effort and possibly imperfect observability of agents'trades. Convergence always occur when either effort is publiclyobserved (no matter what is the information available tointermediaries on agents' trades); or effort is private informationbut agents' trades are perfectly observed; or no information at allis available on agents' trades. On the other hand, when eachintermediary can observe its trades with an agent, but not theagent's trades with other intermediaries, the (Nash) equilibriawith strategic intermediaries do not converge to any of thecompetitive equilibria, for an open set of economies. The source ofthe difficulties for convergence is the combination of asymmetricinformation and the restrictions on the observability of tradeswhich prevent the formation of exclusive contractual relationshipsand generate barriers to entry in the markets for contracts.

Scale-dependent adaptive evolution and morphological convergence to climatic niche in Californian eriogonoids (Polygonaceae)

Aim Macroevolutionary patterns and processes change substantially depending on levels of taxonomic and ecological organization, and the resolution of environmental and spatial variability. In comparative methods, the resolution of environmental and spatial variability often defines the number of selective regimes used to test whether phenotypic characteristics are adaptively correlated with the environment. Here, we examine how investigator choice of the number of selective regimes, determined by varying the resolution of among-species variability in the species climatic niche (hereafter called ecological scale'), influences trait morphological diversification among Eriogonoideae species. We assess whether adaptive or neutral processes drive the evolution of several morphological traits in these species. Location South-western North America. Methods We applied a phylogenetic framework of three evolutionary models to four morphological traits and the climatic niches of Eriogonoideae (in the buckwheat family, Polygonaceae). We tested whether morphological traits evolve in relation to climate by adaptive or neutral process, and whether the resulting patterns of morphological variability are conserved or convergent across the clade. We inspected adaptive models of evolution under different levels of resolution of among-species variability of the climatic niche. Results We show that morphological traits and climate niches of Eriogonoideae species are not phylogenetically conserved. Further, adaptive evolution of phenotypic traits is specific to climatic niche occupancy across this clade. Finally, the likely evolutionary process and the level of detectable niche conservatism change depending on the resolution of environmental variability of the climatic niche. Main conclusions Our study demonstrates the need to consider both the resolution of environmental variability and alternative evolutionary models to understand the morphological diversification that accompanies divergent adaptive evolution of lineages to climatic conditions.