is stable. A policy m,, is obtained which is optimal in the sense that its stability region Cn0 is a superset of the stability region of every other scheduling policy. The stability region Cmo is characterized. Finally, we study the behavior of the network for arrival rates that lie outside the stability

The particle swarm is an algorithm for finding optimal regions of complex search spaces through interaction of individuals in a population of particles. Though the algorithm, which is based on a metaphor of social interaction, has been shown to perform well, researchers have not adequately

regularity in a large sample of 92 countries spanning the past four decades, and show that it holds across regions, time periods, income levels, and growth rates. We next ask whether the factors that explain cross-country differences in growth rates of average incomes have differential effects on the poorest

their stability using stability regions and a hybrid systems technique. Following that, we discuss methods to compensate network-induced delay and present experimental results over a physical network. Then, we model NCSs with packet dropout and multiple-packet transmission as asynchronous dynamical systems (ADSs

stabilizes the system and provides bounded average delay guarantees whenever the input rates are within this capacity region. Such performance holds for general arrival and channel state processes, even if these processes are unknown to the network controller. We then apply this control algorithm to an ad

This paper investigates how monetary policy should be conducted in a two-region, general equilibrium model with monopolistic competition and price stickiness. This framework delivers a simple welfare criterion based on the utility of the consumers that has the usual tradeoff between stabilizing

stable minimal surface M is a plane (Corollary 4). The earliest result of this type was due to S. Bernstein [2] who proved this in the case that M is the graph of a function (stability is automatic in this case). The Bernstein theorem was generalized by R. Osserman [lo] who showed that the statement

interactions (CC, CN, CO, NN, NO, and 00). A qua-dratic error function is used to characterize the set of pairwise interactions from nine-residue sliding windows in a database of 96 reliable protein structures. Regions of candidate protein structures that are mistraced or misreg-istered can

The Internet routing fabric is partitioned into several domains. Each domain represents a region of the fabric administered by a single commercial entity. Over the past two years, the routing fabric has experienced significant growth. From more than a year's worth of inter-domain routing

, a descriptive classification scheme was developed for and applied on Canadian Rivers by An attempt to classify rivers in the great plains region using sediment transport, channel stability, and measured channel dimensions was developed by Brice and Blodgett (1978) described four channel types of