text:
Resource allocation in stochastic processing networks : performance and scaling
Zhong, Yuan, Ph.D. Massachusetts Institute of Technology. Operations Research Center
This thesis addresses the design and analysis of resource allocation policies in largescale stochastic systems, motivated by examples such as the Internet, cloud facilities, wireless networks, etc. A canonical framework ...
Scalable Address Allocation Protocol for Mobile Ad Hoc Networks
Paris-Sud XI, Université de
Scalable Address Allocation Protocol for Mobile Ad Hoc Networks Yu Chen Google, UK chenyu hoc networks an efficient distributed address allocation protocol which is immune to topology changes difficult, we show that node's mobility can, in fact, be useful to provide efficient address allocation
Advanced Disjoint Address Allocation for Mobile Ad Hoc Networks
Yeom, Ikjun
Advanced Disjoint Address Allocation for Mobile Ad Hoc Networks Jinkyu Lee, Sehoon Kim and Ikjun Email: {jklee, firstname.lastname@example.com, email@example.com Abstract--Regarding to address allocation, a mobile ad hoc network (MANET) may suffer from the lack of address and network partition/merging due
Price-Based Resource Allocation in Wireless Ad Hoc Networks
Yuan Xue; Baochun Li; Klara Nahrstedt
The shared-medium multi-hop nature of wireless ad hoc networks poses fundamental challenges to the design of an effective resource allocation algorithm to maximize the aggregated utility of flows, while maintaining basic fairness among multiple flows. When previously proposed scheduling algorithms have been shown to perform well in providing fair shares of bandwidth among single-hop wireless flows, they did not consider
Stochastic optimisation of water allocation on a global scale
NASA Astrophysics Data System (ADS)
Schmitz, Oliver; Straatsma, Menno; Karssenberg, Derek; Bierkens, Marc F. P.
Climate change, increasing population and further economic developments are expected to increase water scarcity for many regions of the world. Optimal water management strategies are required to minimise the water gap between water supply and domestic, industrial and agricultural water demand. A crucial aspect of water allocation is the spatial scale of optimisation. Blue water supply peaks at the upstream parts of large catchments, whereas demands are often largest at the industrialised downstream parts. Two extremes exist in water allocation: (i) 'First come, first serve,' which allows the upstream water demands to be fulfilled without considerations of downstream demands, and (ii) 'All for one, one for all' that satisfies water allocation over the whole catchment. In practice, water treaties govern intermediate solutions. The objective of this study is to determine the effect of these two end members on water allocation optimisation with respect to water scarcity. We conduct this study on a global scale with the year 2100 as temporal horizon. Water supply is calculated using the hydrological model PCR-GLOBWB, operating at a 5 arcminutes resolution and a daily time step. PCR-GLOBWB is forced with temperature and precipitation fields from the Hadgem2-ES global circulation model that participated in the latest coupled model intercomparison project (CMIP5). Water demands are calculated for representative concentration pathway 6.0 (RCP 6.0) and shared socio-economic pathway scenario 2 (SSP2). To enable the fast computation of the optimisation, we developed a hydrologically correct network of 1800 basin segments with an average size of 100 000 square kilometres. The maximum number of nodes in a network was 140 for the Amazon Basin. Water demands and supplies are aggregated to cubic kilometres per month per segment. A new open source implementation of the water allocation is developed for the stochastic optimisation of the water allocation. We apply a Genetic Algorithm for each segment to estimate the set of parameters that distribute the water supply for each node. We use the Python programming language and a flexible software architecture allowing to straightforwardly 1) exchange the process description for the nodes such that different water allocation schemes can be tested 2) exchange the objective function 3) apply the optimisation either to the whole catchment or to different sub-levels and 4) use multi-core CPUs concurrently and therefore reducing computation time. We demonstrate the application of the scientific workflow to the model outputs of PCR-GLOBWB and present first results on how water scarcity depends on the choice between the two extremes in water allocation.
Joint iterative power allocation and relay selection for cooperative MIMO systems using discrete stochastic algorithms
Patrick Clarke; Rodrigo C. de Lamare
In this work, we propose a set of joint power allocation and relay selection (RS) algorithms for multi-relay cooperative multiple-input-multiple-output (MIMO) systems. Adaptive discrete stochastic algorithms (DSA) are used to generate a subset of relays over which stochastic gradient continuous power allocation operates. Optimum minimum mean-square error (MMSE) and adaptive reception are considered in a decode-and-forward (DF) network with a
Estimating technical and allocative inefficiency relative to stochastic production and cost frontiers
Peter Schmidt; C. A. Knox Lovell
considered stochastic frontier production functions. This paper extends that work by considering the duality between stochastic frontier production and cost functions, under the assumptions of exact cost minimization (technical inefficiency only) and of inexact cost minimization (technical and allocative inefflciency). We show how to measure both types of inefficiency, and the associated cost of inefficiency. The techniques are illustrated using
Dynamic address allocation protocols for Mobile ad hoc networks
Patchipulusu, Praveena
, mechanisms like DHCP are not sufficient to assign IP addresses in the MANET environment when nodes enter and leave the MANET group at their will. This thesis proposes a distributed algorithm "Dynamic Address Allocation Protocol". This protocol takes...
Optimal Resource Allocation in Wireless Ad Hoc Networks: A Price-Based Approach
Yuan Xue; Baochun Li; Klara Nahrstedt
The shared-medium multi-hop nature of wireless ad hoc networks poses fundamental challenges to the design of effective resource allocation algorithms that are optimal with respect to resource utilization and fair across different network flows. None of the existing resource allocation algorithms in wireless ad hoc networks have realistically considered end-to-end flows spanning multiple hops. Moreover, strategies proposed in wireline networks
A Stochasticity Threshold in Holography and and the Instability of AdS
Pallab Basu; Chethan Krishnan; Ayush Saurabh
We give strong numerical evidence that a self-interacting probe scalar field in AdS, with only a few modes turned on initially, will undergo fast thermalization only if it is above a certain energetic threshold. Below the threshold the energy stays close to constant in a few modes for a very long time instead of cascading quickly. This indicates the existance of a Strong Stochasticity Threshold (SST) in holography. The idea of SST is familiar from certain statistical mechanical systems, and we suggest that it exists also in AdS gravity. This would naturally reconcile the generic non-linear instability of AdS observed by Bizon and Rostworowski, with the Fermi-Pasta-Ulam-Tsingou-like quasi-periodocity noticed recently for some classes of initial conditions. We show that our simple set-up captures many of the relevant features of the full gravity-scalar system.
Secure Prophet Address Allocation for Mobile Ad Hoc Networks
Hongbo Zhou
A mobile node in a MANET must be assigned with a free IP address before it may participate in unicast communications. This is a fundamental and difficult problem in the practical application of any MANET. There have been several solutions proposed, among which prophet address allocation outperforms others in terms of communication overhead, latency, and scalability. However, none of the
Navigation-based optimization of stochastic strategies for allocating a robot swarm among multiple sites
Spring Berman; Ádám M. Halász; M. Ani Hsieh; Vijay Kumar
Abstract—We present a decentralized, communication-less approach to the dynamic allocation of a swarm of homogeneous robots to a target distribution among multiple sites. Building on our work in [1], we optimize stochastic control policies for the robots that cause the population to quickly redistribute among the sites while adhering to a limit on inter-site traffic at equilibrium. We propose a
ROSA: Distributed Joint Routing and Dynamic Spectrum Allocation in Cognitive Radio Ad Hoc Networks
Michael J. Medleyx
Throughput maximization is one of the main challenges in cogni- tive radio ad hoc networks, where local spectrum resources may change from time to time and hop-by-hop. For this reason, a cross- layer opportunistic spectrum access and dynamic routing algorithm for cognitive radio networks is proposed, called ROSA (ROuting and Spectrum Allocation algorithm). Through local control ac- tions, ROSA aims
A bidding algorithm for optimized utility-based resource allocation in ad hoc networks
is the mobility of the nodes and its effect on C. Curescu is with Ericsson Research, Torshamnsgatan 23, Kista, 164 for bandwidth allo- cation in wireless ad hoc networks. The quality of service (QoS) levels for each end mobility or less frequent allocations. Index Terms-- Mobile computing, pricing and resource alloca- tion
Relay assisted F\\/TDMA ad hoc networks: node classification, power allocation and relaying strategies
Semih Serbetli; Aylin Yener
Abstract—This paper considers the design of relay assisted F\\/TDMA ad hoc networks with multiple relay nodes each of which assists the transmission of a predefined subset of source nodes to their respective destinations. Considering the sum capacity as the performance metric, we solve the problem of optimally allocating the total power of each relay node between the transmissions it is
ROSA: distributed joint routing and dynamic spectrum allocation in cognitive radio ad hoc networks
Lei Ding; Tommaso Melodia; Stella N. Batalama; Michael J. Medley
ABSTRACT Throughput maximization,is one of the main challenges in cogni- tive radio ad hoc networks, where local spectrum resources may change from time to time and hop-by-hop. For this reason, a cross- layer opportunistic spectrum access and dynamic,routing algorithm for cognitive radio networks is proposed, called ROSA (ROuting and Spectrum Allocation algorithm). Through local control ac- tions, ROSA aims at
Maximizing Throughput of Linear Vehicular Ad-hoc NETworks (VANETs) --a Stochastic Approach
Paris-Sud XI, Université de
Maximizing Throughput of Linear Vehicular Ad-hoc NETworks (VANETs) -- a Stochastic email@example.com Abstract: In this paper we use stochastic geometry to propose two models for Aloha-based linear VANETs parameters. Index Terms--VANETs, MAC (Medium Access Control) Layer Optimization, Throughput I. INTRODUCTION
Stochastic Analysis of Non-slotted Aloha in Wireless Ad-Hoc Networks
Paris-Sud XI, Université de
Stochastic Analysis of Non-slotted Aloha in Wireless Ad-Hoc Networks Bartlomiej Blaszczyszyn Paul M models of non-slotted Aloha for Mobile Ad-hoc NET- works (MANETs): one model assumes a static pattern-slotted Aloha to slotted Aloha studied in [6]. We observe that when the path loss is not very strong both models
Stochastic channel modeling for ad hoc wireless networks
Mohammed M. Olama; Seddik M. Djouadi; Charalambos D. Charalambous
Due to nodes mobility and environmental changes in mobile ad hoc networks, the ad hoc channel is time varying and subject to fading. As a consequence of these variations, the statistical characteristics of the received signal vary continuously, giving rise to a Doppler power spectral density (DPSD) which varies from one observation instant to the next. Therefore, the traditional models
A novel bandwidth allocation scheme for QoS routing in mobile ad hoc networks
NASA Astrophysics Data System (ADS)
Wu, Bin; Kuo, Geng-Sheng
The main purpose of this paper is to propose a novel bandwidth allocation scheme for facilitating quality of service (QoS) routing in mobile ad hoc networks (MANETs). In a MANET using time division multiple access (TDMA), each node communicates with its neighbors in the same time slot. In general, finding a route with the maximum end-to-end bandwidth subject to the constraint of collision-free transmission is an NP-complete problem. This paper proposed a sub-optimal solution to this problem. The solution is based on a centrally controlled bandwidth allocation scheme to properly assign the available time slots to each intermediate link. The advantage of our proposed scheme is that the resource utilization of MANET is maximized and the end-to-end QoS is guaranteed during the route establishment period. Performance analyses show that when using the proposed scheme with AODV to perform QoS routing, it achieves about 25% throughput higher than its best-effort counterpart if the node is moving at 5mps speed.
Adaptive power allocation in energy-constrained wireless ad-hoc networks
Gao Xiang; Hyung-Kun Park
In this paper, we proposed a new power allocation scheme in a cooperative relay network to increase network lifetime. To maximize network lifetime, it is important to allocate power fairly among nodes in a network as well as to minimize total transmitted power. In the proposed scheme, the allocated power is proportional to the residual power, satisfies the required SNR
ZAL: Zero-Maintenance Address Allocation in Mobile Wireless Ad Hoc Networks
Zhihua Hu; Baochun Li
Abstract - The allocation of IP addresses in hybrid wireless networks is one of the most critical issues in all - IP converged wireless networks The reason is that centralized IP address allocation mechanisms may not be available in networks comprised of heterogeneous mobile wire - less devices In this paper, we propose Zero - Maintenance Address Allocation (ZAL), a
Optimal power allocation for relay assisted F\\/TDMA ad hoc networks
Semih Serbetli; Aylin Yener
In this paper, we study the power allocation problem at the relay nodes for two-hop F\\/TDMA networks with multiple sources and destinations. Considering the sum capacity as the performance metric, we solve the problem of optimally allocating the total power of each relay node between the transmissions it is assisting. We consider regenerative decode-and-forward (RDF), nonregenerative decode-and-forward (NDF), amplify-and-forward (AF)
Distributed resource allocation for DS-CDMA-based multimedia ad hoc wireless LANs
Sanjay Lal; Elvino S. Sousa
Power control in direct sequence code division multiple access (DS-CDMA) systems and power\\/rate allocation in multirate DS-CDMA based networks is an open and interesting research area which has attracted much attention. However, with a few exceptions, most researchers have emphasized centralized resource allocation algorithms for cellular systems where the base station keeps track of the requirements of the various users
Mechanism Design for Stochastic Virtual Resource Allocation in Non-cooperative Cloud Systems
Zhen Kong; Cheng-Zhong Xu; Minyi Guo
Currently, virtualization technology has been widely adopted by cloud service providers to provide flexible and cost- effective resource sharing among users. On cloud platforms, computing resources are allocated on-demand dynamically and the application hosted on a virtual machine(VM) usually has the illusion of complete control of resources. Thus, a selfish VM may strategically compete for resource with other VMs to
Production, Manufacturing and Logistics Cooperation and game-theoretic cost allocation in stochastic
Boucherie, Richard J.
Production, Manufacturing and Logistics Cooperation and game-theoretic cost allocation Inventory model a b s t r a c t We study cooperation strategies for companies that continuously review they provide an incentive for the companies to cooperate. We consider two natural cooperation strategies: (i
Optimal rate allocation for energy-efficient multipath routing in wireless ad hoc networks
Vikram Srinivasan; Carla-fabiana Chiasserini; Pavan S. Nuggehalli; Ramesh R. Rao
In this paper, we address the problem of energy effi- ciency in wireless ad hoc networks. We consider an ad hoc network comprising a set of sources, communicating with their destinations using multiple routes. Each source is associated with a utility func- tion which increases with the total traffic flowing over the available source-destination routes. The network lifetime is defined
Stochastic allocation and scheduling for conditional task graphs in multi-processor systems-on-chip
Michele Lombardi; Michela Milano; Martino Ruggiero; Luca Benini
Embedded systems designers are turning to multicore architectures to satisfy the ever-growing computational needs of applications\\u000a within a reasonable power envelope. One of the most daunting challenges for MultiProcessor System-on-Chip (MPSoC) platforms\\u000a is the development of tools for efficient mapping multi-task applications onto hardware platforms. Software mapping can be\\u000a formulated as an optimal allocation and scheduling problem, where the application
Optimal Rate Allocation and Traffic Splits for Energy Efficient Routing in Ad Hoc Networks
Vikram Srinivasan; Carla-fabiana Chiasserini; Pavan Nuggehalli; Ramesh R. Rao
In this paper, we address the problem of energy efficiencyin ad hoc wireless networks. We consider a network thatis shared by a set of sources, each one communicating with itscorresponding destination using multiple routes. Each source isassociated with a utility function which increases with the totaltraffic flowing over the available source-destination routes. Thenetwork lifetime is defined as the time until
Marques, Antonio Garcia
-1-4577-0539-71111$26.00 ©2011 IEEE 3196 9, 10, II]. The most critical design challenges include: DCI) The need to satisfy are available to cope with DCI-DC3. To ad dress DCI, some works limit the interference power at the primary
Introducing health gains in location-allocation models: A stochastic model for planning the delivery of long-term care
NASA Astrophysics Data System (ADS)
Cardoso, T.; Oliveira, M. D.; Barbosa-Póvoa, A.; Nickel, S.
Although the maximization of health is a key objective in health care systems, location-allocation literature has not yet considered this dimension. This study proposes a multi-objective stochastic mathematical programming approach to support the planning of a multi-service network of long-term care (LTC), both in terms of services location and capacity planning. This approach is based on a mixed integer linear programming model with two objectives - the maximization of expected health gains and the minimization of expected costs - with satisficing levels in several dimensions of equity - namely, equity of access, equity of utilization, socioeconomic equity and geographical equity - being imposed as constraints. The augmented ?-constraint method is used to explore the trade-off between these conflicting objectives, with uncertainty in the demand and delivery of care being accounted for. The model is applied to analyze the (re)organization of the LTC network currently operating in the Great Lisbon region in Portugal for the 2014-2016 period. Results show that extending the network of LTC is a cost-effective investment.
Stochastic Analysis of Non-slotted Aloha in Wireless Ad-Hoc Networks
Blaszczyszyn, Bartek
In this paper we propose two analytically tractable stochastic models of non-slotted Aloha for Mobile Ad-hoc NETworks (MANETs): one model assumes a static pattern of nodes while the other assumes that the pattern of nodes varies over time. Both models feature transmitters randomly located in the Euclidean plane, according to a Poisson point process with the receivers randomly located at a fixed distance from the emitters. We concentrate on the so-called outage scenario, where a successful transmission requires a Signal-to-Interference-and-Noise Ratio (SINR) larger than a given threshold. With Rayleigh fading and the SINR averaged over the duration of the packet transmission, both models lead to closed form expressions for the probability of successful transmission. We show an excellent matching of these results with simulations. Using our models we compare the performances of non-slotted Aloha to previously studied slotted Aloha. We observe that when the path loss is not very strong both models, when appropri...
Implementation of equity in resource allocation for regional earthquake risk mitigation using two-stage stochastic programming.
Zolfaghari, Mohammad R; Peyghaleh, Elnaz
This article presents a new methodology to implement the concept of equity in regional earthquake risk mitigation programs using an optimization framework. It presents a framework that could be used by decisionmakers (government and authorities) to structure budget allocation strategy toward different seismic risk mitigation measures, i.e., structural retrofitting for different building structural types in different locations and planning horizons. A two-stage stochastic model is developed here to seek optimal mitigation measures based on minimizing mitigation expenditures, reconstruction expenditures, and especially large losses in highly seismically active countries. To consider fairness in the distribution of financial resources among different groups of people, the equity concept is incorporated using constraints in model formulation. These constraints limit inequity to the user-defined level to achieve the equity-efficiency tradeoff in the decision-making process. To present practical application of the proposed model, it is applied to a pilot area in Tehran, the capital city of Iran. Building stocks, structural vulnerability functions, and regional seismic hazard characteristics are incorporated to compile a probabilistic seismic risk model for the pilot area. Results illustrate the variation of mitigation expenditures by location and structural type for buildings. These expenditures are sensitive to the amount of available budget and equity consideration for the constant risk aversion. Most significantly, equity is more easily achieved if the budget is unlimited. Conversely, increasing equity where the budget is limited decreases the efficiency. The risk-return tradeoff, equity-reconstruction expenditures tradeoff, and variation of per-capita expected earthquake loss in different income classes are also presented. PMID:25676412
Optimal Storage Allocation for Serial
Yechiali, Uri
Optimal Storage Allocation for Serial Haim Mendelson, Joseph S. Pliskin, and Uri Yechiali Tel Aviv reside on a direct-access storage device in which storage space is limited. Records are added allocating storage space to the files. Key Words and Phrases: serial files, storage allocation
Resonance with Stochastic Time
NASA Astrophysics Data System (ADS)
Ohira, Toru
We introduce a resonant phenomenon using a model incorporating delay (temporal non-locality) and stochastic time (temporal stochasticity). Although this model is a very simple linear dynamical differential equation, the addition of these elements makes it very rich. As an illustrative example, we describe a human stick balancing experiment that includes added fluctuations. We discuss how these concepts of temporal non-locality and stochasticity could play a role in characterizing biological and physiological systems, as well as in physics.
NASA Astrophysics Data System (ADS)
McDonnell, Mark D.; Stocks, Nigel G.; Pearce, Charles E. M.; Abbott, Derek
Preface; 1. Introduction and motivation; 2. Stochastic resonance: its definitions, history and debates; 3. Stochastic quantization; 4. Suprathreshold stochastic resonance: encoding; 5. Suprathreshold stochastic resonance: large N encoding; 6. Suprathreshold stochastic resonance: decoding; 7. Suprathreshold stochastic resonance: large N decoding; 8. Optimal stochastic quantization; 9. SSR, neural coding, and performance tradeoffs; 10. Stochastic resonance in the auditory system; 11. The future of stochastic resonance and suprathreshold stochastic resonance; Appendices; References; Index.
Optimal Allocation of Construction Planning Resources
Olusegun O. Faniran; Peter E. D. Love; Heng Li
Efficient allocation of resources for construction planning activities requires construction planning resource requirements to be determined on a cost-effective and value-adding basis. However, although some research studies have indicated that increasing resource allocations to construction planning activities will lead to improved project performance, other research studies have indicated that investing in construction planning beyond an optimum point will lead to
We consider the asset allocation problem for a defined-contribution pension fund in continuous-time. The methodological approach we use is the stochastic optimal control. We assume a complete financial market and two stochastic processes describing the behavior of salaries and the consumer price index. We propose a model in which the presence of stochastic salaries is consistent with the assumption of
Stochastic parameterization: is sophistication useful?
Plant, Robert
with Plant-Craig Stochastic parameterization: is sophistication useful? p.8/1 #12;Multiplicative noiseStochastic parameterization: is sophistication useful? R. S. Plant and M. A. Whitall Department models is not energetic enough Adding near-grid scale noise can correct that Some very simple noise
77 FR 5406 - Amateur Radio Use of the Allocation at 5 MHz
Federal Register 2010, 2011, 2012, 2013, 2014
...maximum authorized power amateur stations...Table of Frequency Allocations (Allocation Table) and our...provide emergency communications using the 60 meter...channel, increasing power limits, and adding...current numbering system for domestic...
Kunio Yasue; Mari Jibu; Tetsuya Misawa; Jean-Claude Zambrini
Stochastic dynamics of relative membrane potential in the neural network is investigated. It is called stochastic neurodynamics. The least action principle for stochastic neurodynamics is assumed, and used to derive the fundamental equation. It is called a neural wave equation. A solution of the neural wave equation is called a neural wave function and describes stochastic neurodynamics completely. Linear superposition
Informative allocation and consistent treatment selection Tamas Rudas
Rudas, Tamas
the odds ratio (cross product ratio). Such decisions do not depend on the allocation of the observations based on the value of the odds ratio (Rudas, 1998) or cross product ratio (cpr) a/b c/d = ad bc based on the cross sum ratio is investigated. This procedure is not only sensitive to allocation
Manpower Allocation and Reporting
NASA Technical Reports Server (NTRS)
Merwarth, P. D.
Interactive Manpower Allocation and Reporting System (MARS) helps planners make manpower allocation decisions. Includes provisions to enter overall constraints for projects and persons, assign individuals to projects, compute automatically overhead category, report on deviations from constraints, and generate manpower resource allocation reports.
Optimal Resource Allocation for Homogeneous Wireless Multicast
Amr M. Mohamed; Hussein M. Alnuweiri
Multicast-based data communication is an efficient communication scheme especially in multihop ad hoc networks where the MAC layer is based on one-hop broadcast from one source to multiple receivers. In this paper, we address the problem of resource allocation for a set of homogeneous multicast sessions over multihop wireless networks. We propose an iterative algorithm that achieves the optimal rates
Active and reactive power in stochastic resonance for energy harvesting
Kubota, Madoka; Hikihara, Takashi
A power allocation to active and reactive power in stochastic resonance is discussed for energy harvesting from mechanical noise. It is confirmed that active power can be increased at stochastic resonance, in the same way of the relationship between energy and phase at an appropriate setting in resonance.
Reinforcement Learning for Dynamic Channel Allocation in Cellular Telephone Systems
Dimitri Bertsekas; Satinder Singh
In cellular telephone systems, an important problem is to dynamically allocatethe communication resource (channels) so as to maximize service ina stochastic caller environment. This problem is naturally formulated as adynamic programming problem and we use a reinforcement learning (RL)method to find dynamic channel allocation policies that are better thanprevious heuristic solutions. The policies obtained perform well for a broadvariety of
Stateless proportional bandwidth allocation
NASA Astrophysics Data System (ADS)
Jagannathan, Prasanna K.; Durresi, Arjan; Jain, Raj
This paper proposes a new method of bandwidth allocation during congestion, called the proportional allocation of bandwidth. Traditionally, max-min fairness has been proposed to allocate bandwidth under congestion. Our allocation scheme considers the situation where flows might have different subscribed information rates, based on their origin. In proportional allocation of bandwidth, during congestion all flows get a share of available bandwidth, which is in proportion to their subscribed information rate. We suggest a method for implementing this with minimum signaling and without storing per-flow state. Our method is based on the principles of differentiated services - diffserv. We show by simulation that it is possible to obtain proportional bandwidth allocation without per-flow state storing and minimum signaling.
Variational Principles for Stochastic Soliton Dynamics
DD Holm; TM Tyranowski
We develop a variational method of deriving stochastic partial differential equations whose solutions follow the flow of a stochastic vector field. As an example in one spatial dimension we numerically simulate singular solutions (peakons) of the stochastically perturbed Camassa-Holm (CH) equation derived using this method. These numerical simulations show that peakon soliton solutions of the stochastically perturbed CH equation persist and provide an interesting laboratory for investigating the sensitivity and accuracy of adding stochasticity to finite dimensional solutions of stochastic partial differential equations (SPDE). In particular, some choices of stochastic perturbations of the peakon dynamics by Wiener noise (canonical Hamiltonian stochastic deformations, or CH-SD) allow peakons to interpenetrate and exchange order on the real line in overtaking collisions, although this behaviour does not occur for other choices of stochastic perturbations which preserve the Euler-Poincar\\'e structure of the CH equation (parametric stochastic deformations, or P-SD), and it also does not occur for peakon solutions of the unperturbed deterministic CH equation. The discussion raises issues about the science of stochastic deformations of finite-dimensional approximations of evolutionary PDE and the sensitivity of the resulting solutions to the choices made in stochastic modelling.
Terence Kelly
This paper considers the problem of allocating discrete res ources according to utility functions reported by potential recip ients and relates this abstract problem to resource allocation in a Ut ility Data Center (UDC). A simple integer program formulation, which gen- eralizes well-known knapsack problems, permits a remarkable breadth of expression while retaining clarity and analytic tractab ility. In the
Google's Auction for TV Ads Preliminary version
Nisan, Noam
Google's Auction for TV Ads Preliminary version Noam Nisan Jason Bayer Deepak Chandra Tal Franji Robert Gardner Yossi Matias Neil Rhodes Misha Seltzer Danny Tom Hal Varian Dan Zigmond Google Inc. Abstract This document describes the auction system used by Google for allocation and pricing of TV ads
NSDL National Science Digital Library
Ad Critic strives to enter every television advertisement into its database of online commercials, which can be downloaded for free and viewed with QuickTime. A complete list of advertisements is indexed by company and by ad title. There are, however, also indexes of newly added ads, most-downloaded ads, movie trailers, and music found in ads, making it easier for users to search for a new or favorite advertisement. Ad Critic includes a section on advertising news and commentary and provides services for advertising agencies including online market research and detailed viewer statistics.
Stochastic resonance in electrical circuits. I. Conventional stochastic resonance
Dmitrii G. Luchinsky; Riccardo Mannella; Peter V. E. McClintock; Nigel G. Stocks
Stochastic resonance (SR), a phenomenon in which a periodic signal in a nonlinear system can be amplified by added noise, is introduced and discussed. Techniques for investigating SR using electronic circuits are described in practical terms. The physical nature of SR, and the explanation of weak-noise SR as a linear response phenomenon, are considered. Conventional SR, for systems characterized by
The Allocative Efficiency Implications of Water Pollution Abatement Cost Comparisons
NASA Astrophysics Data System (ADS)
Shortle, James S.
Assessments of the efficiency of water pollution control allocations are usually based on abatement cost comparisons. The general rule is that efficiency is improved by reallocating abatement from sources with high marginal costs to low-cost sources. The welfare-theoretic foundation of this rule is well established for situations with nonstochastic emissions. In situations with stochastic emissions, pollution control involves improving the distribution of emissions. Nevertheless, efficiency analyses involving stochastic emissions usually sidestep formal consideration of the stochastic element by measuring pollution control and control costs with respect to changes in long-term average flows. An economic model of stochastic emissions is used to demonstrate that this approach can give misleading results. An alternative procedure is briefly discussed.
A Framework for Optimal Control Allocation with Structural Load Constraints
NASA Technical Reports Server (NTRS)
Frost, Susan A.; Taylor, Brian R.; Jutte, Christine V.; Burken, John J.; Trinh, Khanh V.; Bodson, Marc
Conventional aircraft generally employ mixing algorithms or lookup tables to determine control surface deflections needed to achieve moments commanded by the flight control system. Control allocation is the problem of converting desired moments into control effector commands. Next generation aircraft may have many multipurpose, redundant control surfaces, adding considerable complexity to the control allocation problem. These issues can be addressed with optimal control allocation. Most optimal control allocation algorithms have control surface position and rate constraints. However, these constraints are insufficient to ensure that the aircraft's structural load limits will not be exceeded by commanded surface deflections. In this paper, a framework is proposed to enable a flight control system with optimal control allocation to incorporate real-time structural load feedback and structural load constraints. A proof of concept simulation that demonstrates the framework in a simulation of a generic transport aircraft is presented.
Discrete Time Stochastic Petri Nets
Michael K. Molloy
Basic graph models of processes, such as Petri nets, have usually omitted the concept of time as a parameter. Time has been added to the Petri net model in two ways. The timed Petri net (TPN) uses a fixed number of discrete time intervals. The stochastic Petri net (SPN) uses an exponentially distributed random variable. In this paper, a discrete
Stochastic Programming Approach to Hydraulic Fracture Design for the Lower Tertiary Gulf of Mexico
Podhoretz, Seth
.......................................................................................... 1 Deep-water Lower Tertiary Background ............................................. 3 Research Objectives ............................................................................. 7 Literature Review... ....................................... 47 Finite Conductivity Fracture Approximation ..................................... 52 Proppant Allocation in Multilayer Reservoirs .................................... 53 vi IV STOCHASTIC OPTIMIZATION...
Software Function Allocation Methodology
O'Neal, Michael Ralph
SOFTWARE FUNCTION ALLOCATION METHODOLOGY A Thesis MICHAEL RALPH O'NEAL Submitted to the Graduate College of Texas AEM University in partial fulfillment of the requirements for the degree of MASTER OF SCIENCE May 1988 Major Subject: Computer... Science SOFTWARE FUNCTION ALLOCATION METHODOLOGY A Thesis by MICHAEL RALPH O'NEAL Approved as to style and content by: Wi liam Livel (Chairman Sallie Sheppa d (Member) David Van Fleet (Member) Glen Williams (Head of Department) May 1988...
A Method for Reducing the Severity of Epidemics by Allocating Vaccines According to Centrality
Drewniak, Krzysztof; Mikler, Armin R
One long-standing question in epidemiological research is how best to allocate limited amounts of vaccine or similar preventative measures in order to minimize the severity of an epidemic. Much of the literature on the problem of vaccine allocation has focused on influenza epidemics and used mathematical models of epidemic spread to determine the effectiveness of proposed methods. Our work applies computational models of epidemics to the problem of geographically allocating a limited number of vaccines within several Texas counties. We developed a graph-based, stochastic model for epidemics that is based on the SEIR model, and tested vaccine allocation methods based on multiple centrality measures. This approach provides an alternative method for addressing the vaccine allocation problem, which can be combined with more conventional approaches to yield more effective epidemic suppression strategies. We found that allocation methods based on in-degree and inverse betweenness centralities tended to be the most ...
ERIC Educational Resources Information Center
Value added measures (VAM) uses changes in student test scores to determine how much "value" an individual teacher has "added" to student growth during the school year. Some policymakers, school districts, and educational advocates have applauded VAM as a straightforward measure of teacher effectiveness: the better a teacher, the better students…
Aid allocation and poverty reduction
Paul Collier; David Dollar
This paper derives a poverty-efficient allocation of aid and compares it with actual aid allocations. The allocation of aid that has the maximum effect on poverty depends on the level of poverty and the quality of policies. Using the headcount, poverty-gap, and squared poverty gap measures of poverty, alternatively, all yield similar poverty-efficient allocations. Finally, we find that the actual
Allocation Constraints in Stratification
Marcin Kozak; Pawel Jankowski
When a finite population is to be stratified, one of constraints in stratification is that sample sizes from strata may not be greater than the corresponding stratum sizes and may not be smaller than two. There are several ways of treating this allocation constraint, each providing an alternative approach to stratification. In this article, it is shown that a choice
Political Allocation of Finance
Enrico Perotti; CEPR Marcel Vorage; IDEI Toulouse
Politicians in‡uence the allocation of …nance either directly via state banks, or indirectly via private banks using banking regulation or creditor rights. With state ownership of banks, entrepreneurs may form coalitions to bribe politicians to directly obtain scarce loans. With private ownership of banks, interest groups may lobby to in‡uence creditor rights to limit access to less established …rms. When
Asset Allocation under Hierarchical Clustering
Jin Zhang; Dietmar Maringer
This paper proposes a clustering asset allocation scheme which provides better risk-adjusted portfolio performance than those obtained from traditional asset allocation approaches such as the equal weight strategy and the Markowitz minimum variance allocation. The clustering criterion used, which involves maximization of the in-sample Sharpe ratio (SR), is different from traditional clustering criteria reported in the literature. Two evolutionary methods,
Sensory Optimization by Stochastic Tuning
Jurica, Peter; Gepshtein, Sergei; Tyukin, Ivan; van Leeuwen, Cees
Individually, visual neurons are each selective for several aspects of stimulation, such as stimulus location, frequency content, and speed. Collectively, the neurons implement the visual system's preferential sensitivity to some stimuli over others, manifested in behavioral sensitivity functions. We ask how the individual neurons are coordinated to optimize visual sensitivity. We model synaptic plasticity in a generic neural circuit, and find that stochastic changes in strengths of synaptic connections entail fluctuations in parameters of neural receptive fields. The fluctuations correlate with uncertainty of sensory measurement in individual neurons: the higher the uncertainty the larger the amplitude of fluctuation. We show that this simple relationship is sufficient for the stochastic fluctuations to steer sensitivities of neurons toward a characteristic distribution, from which follows a sensitivity function observed in human psychophysics, and which is predicted by a theory of optimal allocation of receptive fields. The optimal allocation arises in our simulations without supervision or feedback about system performance and independently of coupling between neurons, making the system highly adaptive and sensitive to prevailing stimulation. PMID:24219849
Joint optimization of bid and budget allocation in sponsored search
Weinan Zhang; Ying Zhang; Bin Gao; Yong Yu; Xiaojie Yuan; Tie-Yan Liu
This paper is concerned with the joint allocation of bid price and campaign budget in sponsored search. In this application, an advertiser can create a number of campaigns and set a budget for each of them. In a campaign, he\\/she can further create several ad groups with bid keywords and bid prices. Data analysis shows that many advertisers are dealing
Cochlear Implant Coding with Stochastic Beamforming and Suprathreshold Stochastic Resonance
Nigel G. Stocks; Boris Shulgin; Stephen D. Holmes; Alexander Nikitin; Robert P. Morse
Cochlear implants are prosthetic devices used to provide hearing to people who would otherwise be profoundly deaf. The deliberate\\u000a addition of noise to the electrode signals can in principle increase the amount of information transmitted via an effect termed\\u000a suprathreshold stochastic resonance (SSR). However, for SSR to occur the noise must be added in such a way so as to
Allocations for HANDI 2000 business management system
Wilson, D.
The Data Integration 2000 Project will result in an integrated and comprehensive set of functional applications containing core information necessary to support the Project Hanford Management Contract. It is based on the Commercial-Off-The-Shelf product solution with commercially proven business processes. The COTS product solution set, of PassPort and People Soft software, supports finance, supply and chemical management/Material Safety Data Sheet, human resources. Allocations at Fluor Daniel Hanford are burdens added to base costs using a predetermined rate.
Huang, Minyi
communication systems, power control is important at the user level in order to minimize energy requirementsSTOCHASTIC CONTROL FOR DISTRIBUTED SYSTEMS WITH APPLICATIONS TO WIRELESS COMMUNICATIONS Minyi Huang. Clever power allocation provides an efficient means to overcome in the uplink the so-called near
Multi-server buffer allocation Smith, Cruz, & van Woensel Topological Network Design of General,
Cruz, Frederico
and Gershwin, 1992). Even today, stochastic models are used to analyze and optimize such systems (see, transportation infrastructures could be designed in such a way that the network flows are maximized takingMulti-server buffer allocation Smith, Cruz, & van Woensel Topological Network Design of General
An Investigation of the Technical and Allocative Efficiency of Broadacre Farmers
Ben Henderson; Ross S. Kingwell
The technical and allocative efficiency of broadacre farmers in a southern region of Western Australia is investigated over a three-year period. Applying data envelopment analysis (DEA) and stochastic frontier analysis (SFA) reveals there is some inefficiency in each year, which decreases over time. The distributions of technical efficiency in each year are positively skewed toward higher efficiency levels, indicating a
Optimal Allocation of Inventory and Demand for Managing Supply Chain Revenues
Katariya, Abhilasha
the supplier's joint replenishment, allocation and pricing problem by formulating it as a multi-period, two-stage stochastic dynamic program. We show that a dynamic pricing policy is optimal at stage 2, and the stage 1 optimal policy is characterized by two...
Resource Allocation in Fading Ad-Hoc Networks
Yousefi'zadeh, Homayoun
Probability Loss effect compensation: Reed-Solomon Coder R(b, k), tc = b-k 2 (b, k) = S s=1 (b, k, s) = 1 - b Ri,s Ri,s,lb i, s 0 Pi Pi,ub i Known CSI: Pi, Mi,s ; Unknown CSI: Pi, Mi Lagrangian Theory
Dynamic address allocation protocols for Mobile ad hoc networks
Patchipulusu, Praveena
the assigning policy of the algorithm. We will see this later in Node Join section [3. A. 2]. Every node sends hello messages periodically to its neighbours so that each node is aware of its neighbours. In hello messages, a node also includes the unique... notion of time-lease for address assignment. Whenever time-lease is about to expire, it can take the lease for another time period from the previous node. Each node i whose address is, say i, sends hello beacons to its neighboring nodes. Neighboring...
Stochastic resonance in a stochastic bistable system
NASA Astrophysics Data System (ADS)
Ai, Bao-quan; Liu, Liang-gang
Stochastic resonance (SR) in a bistable system is investigated in the presence of a stochastic potential. The signal-to-noise ratio (SNR) is calculated by using the two-state approach. It is found that there exist transitions in SNR from one peak to two peaks, then to one peak again and finally to no peak on increasing the intensity of the stochastic potential. An optimal stochastic potential may induce a doubly stochastic resonance (DSR). When the intensity of the stochastic potential is too large, the effect of the double well diminishes and the SR phenomenon disappears.
Google's Auction for Radio and TV Ads Preliminary version
Tomkins, Andrew
Google's Auction for Radio and TV Ads Preliminary version Noam Nisan Jason Bayer Deepak Chandra Tal Franji Robert Gardner Yossi Matias Neil Rhodes Misha Seltzer Danny Tom Hal Varian Dan Zigmond Google Inc. Abstract This document describes the auction system used by Google for allocation and pricing of TV ads
ERIC Educational Resources Information Center
Orsini, Larry L.; Hudack, Lawrence R.; Zekan, Donald L.
The value-added statement (VAS), relatively unknown in the United States, is used in financial reports by many European companies. Saint Bonaventure University (New York) has adapted a VAS to make it appropriate for not-for-profit universities by identifying stakeholder groups (students, faculty, administrators/support personnel, creditors, the…
Simultaneous Approximations for Adversarial and Stochastic Online Budgeted Allocation
Pregibon, Daryl
achieves a competitive ratio of 1 - in a random permutation model. For weighted graphs, however, we prove for weighted graphs. In particular, for unweighted graphs, under some mild assumptions, we show that Balance to maximize the size of the matching for unweighted graphs where wij = 1 for each (xi, yj) E(G). For weight
Adding Local Search to Particle Swarm Optimization
Sanjoy Das; Praveen Koduru; Min Gui; Michael Cochran; Austin Wareing; Stephen M. Welch; Bruce R. Babin
Particle swarm optimization is a stochastic algorithm for optimizing continuous functions. It uses a population of particles that follow trajectories through the search space towards good optima. This paper proposes adding a local search component to PSO to improve its convergence speed. Two possible methods are discussed. The first adds a term containing estimated gradient information to the velocity of
NSDL National Science Digital Library
This is a task from the Illustrative Mathematics website that is one part of a complete illustration of the standard to which it is aligned. Each task has at least one solution and some commentary that addresses important asects of the task and its potential use. Here are the first few lines of the commentary for this task: A town's total allocation for firefighter's wages and bene?ts in a new budget is \\$600,000. If wages are calculated at \\$40,000 per firefighter and ben...
Adaptive channel allocation in TACS
M. Almgren; M. Frodigh; B. Hansson; J. Lundequist; K. Wallstedt
The paper describes an adaptive channel allocation, ACA, algorithm designed for an analog cellular system like TACS. The incentive to use more advanced radio resource allocation algorithms can be to eliminate frequency planning, to increase the capacity and improve the quality of the system. Specific to TACS is that measurements only are available in the uplink. Based on these limited
Spacecraft thruster control allocation problems
Pablo A. Servidia; Ricardo Sánchez Peńa
We consider the control allocation problem in a spacecraft thruster configuration. It consists on the determination of the force command to be sent to each thruster in order to point the total torque and\\/or thrust vectors. Here, we state four possible practical problems and propose a control allocation algorithm based on a subgradient optimization, which is shown to be faster
Proposed amendment language for the allocation of Atka mackerel to vessels using jig gear -Amendment 34 to the Fishery
Proposed amendment language for the allocation of Atka mackerel to vessels using jig gear implemented on [insert date] allocates Atka mackerel to vessels using jig gear. Annually, up to 2 percent.4.9.4 is added to read as follows: 188.8.131.52 Atka mackerel The Regional Administrator, in consultation
ISlT 2002, Lausanne,Switzerland,June 30-July 5,2002 Optimal Rate Allocation for Superposition Coding
Liu, Youjian "Eugene"
-level superposition coding is ad- equate to achieve most of the throughput gain in a quasi, the channel states are first partitioned into sets. Each set is allocated an information rate (or equivalently is a joint optimization of rate allocation and channel state parti- tion. The asymptotical case for a quasi
Frequency (Stochastic) Resonance and Stochastic Resonance for a Superconducting Junctions' Device
NASA Astrophysics Data System (ADS)
Li, Jing-Hui
In this paper, we investigate a Josephson-junction device with dichotomous resistance or a special SQUID (superconducting quantum interference device). It is shown that frequency (stochastic) resonance and stochastic resonance can appear for some suitably selected parameters' values of the device respectively. Our results can provide some insights for the investigation of the SQUID response to the signal (including the input alternating current, the added alternating voltage, the vertically added alternating magnetic field, and the detected (electric-magnetic) temporal-periodic signal).
Optimization of Workflow Resources Allocation with Cost Constraint
Zhijiao Xiao; Huiyou Chang; Yang Yi
A resource allocation method is proposed to determine the proper number of resources added to each resource class with cost\\u000a constraint in order to optimize workflow time performance. The average throughput time of workflow instances is used to measure\\u000a the workflow time performance. An approach which calculates the average throughput time of workflow instances is proposed.\\u000a An improved genetic algorithm
Zinc allocation and re-allocation in rice
Stomph, Tjeerd Jan; Jiang, Wen; Van Der Putten, Peter E. L.; Struik, Paul C.
Aims: Agronomy and breeding actively search for options to enhance cereal grain Zn density. Quantifying internal (re-)allocation of Zn as affected by soil and crop management or genotype is crucial. We present experiments supporting the development of a conceptual model of whole plant Zn allocation and re-allocation in rice. Methods: Two solution culture experiments using 70Zn applications at different times during crop development and an experiment on within-grain distribution of Zn are reported. In addition, results from two earlier published experiments are re-analyzed and re-interpreted. Results: A budget analysis showed that plant zinc accumulation during grain filling was larger than zinc allocation to the grains. Isotope data showed that zinc taken up during grain filling was only partly transported directly to the grains and partly allocated to the leaves. Zinc taken up during grain filling and allocated to the leaves replaced zinc re-allocated from leaves to grains. Within the grains, no major transport barrier was observed between vascular tissue and endosperm. At low tissue Zn concentrations, rice plants maintained concentrations of about 20 mg Zn kg?1 dry matter in leaf blades and reproductive tissues, but let Zn concentrations in stems, sheath, and roots drop below this level. When plant zinc concentrations increased, Zn levels in leaf blades and reproductive tissues only showed a moderate increase while Zn levels in stems, roots, and sheaths increased much more and in that order. Conclusions: In rice, the major barrier to enhanced zinc allocation towards grains is between stem and reproductive tissues. Enhancing root to shoot transfer will not contribute proportionally to grain zinc enhancement. PMID:24478788
Determining the Appropriate Asset Allocation
Johnson, Jason; Polk, Wade
THE APPROPRIATE ASSET ALLOCATION Jason Johnson and Wade Polk* * Assistant Professor and Extension Economist?Management and Extension Program Specialist?Risk Management, The Texas A&M University System Liquidity Liquidity refers to the ease with which an investment...
Roadway Improvement Project Cost Allocation
Minnesota, University of
Roadway Improvement Project Cost Allocation CTS 21st Annual Transportation Research Conference costs #12;Potential Applications · Roadway Project Feasibility Studies Identified potential roadway infrastructure improvement Documentation of estimated project costs Determine property assessments
Bayesian Proportional Resource Allocation Games
Tsitsiklis, John N.
We consider a proportional allocation mechanism that gives to each user an amount of a resource proportional to the user's bid. We study a corresponding Bayesian game in which each user has incomplete information on the ...
Collective credit allocation in science
Shen, Hua-Wei
Collaboration among researchers is an essential component of the modern scientific enterprise, playing a particularly important role in multidisciplinary research. However, we continue to wrestle with allocating credit to the coauthors of publications with multiple authors, since the relative contribution of each author is difficult to determine. At the same time, the scientific community runs an informal field-dependent credit allocation process that assigns credit in a collective fashion to each work. Here we develop a credit allocation algorithm that captures the coauthors' contribution to a publication as perceived by the scientific community, reproducing the informal collective credit allocation of science. We validate the method by identifying the authors of Nobel-winning papers that are credited for the discovery, independent of their positions in the author list. The method can also compare the relative impact of researchers working in the same field, even if they did not publish together. The ability...
3972 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 7, NO. 10, OCTOBER 2008 Stochastic Delay Guarantees and
Zhuang, Weihua
Guarantees and Statistical Call Admission Control for IEEE 802.11 Single-Hop Ad Hoc Networks Atef Abdrabou bandwidth equally among the nodes in an ad hoc network, resource allocation such as call admission control guarantees via fully distributed model-based call admission control for IEEE 802.11 single-hop ad hoc
Fuzzy Random Redundancy Allocation Problems
Shuming Wang; Junzo Watada
\\u000a Due to subjective judgement, imprecise human knowledge and perception in capturing statistical data, the real data of lifetimes\\u000a in many systems are both random and fuzzy in nature. Based on the fuzzy random variables that are used to characterize the\\u000a lifetimes, this paper studies the redundancy allocation problems to a fuzzy random parallel-series system.\\u000a \\u000a \\u000a Two fuzzy random redundancy allocation models
Technical, allocative and economic efficiencies in swine production in Hawaii: a comparison of parametric and nonparametric approaches
Khem R. Sharma; PingSun Leung; Halina M. Zaleski
Technical, allocative and economic efficiency measures are derived for a sample of swine producers in Hawaii using the parametric stochastic efficiency decomposition technique and nonparametric data envelopment analysis (DEA). Efficiency measures obtained from the two frontier approaches are compared. Firm-specific factors affecting productive efficiencies are also analyzed. Finally, swine producers' potential for reducing cost through improved efficiency is also examined.
Ad Hoc Joint Committee of the Graduate Assembly and Faculty Council on
Johnston, Daniel
Ad Hoc Joint Committee of the Graduate Assembly and Faculty Council on Graduate Student Fellowships ........................................6 Allocation of Graduate Student Awards by College and Type of Award...........................6 .............................................................................................................20 Appendix A: Graduate Fellowship Questionnaire for Graduate Advisers
Collaborative Resource Allocation
NASA Technical Reports Server (NTRS)
Wang, Yeou-Fang; Wax, Allan; Lam, Raymond; Baldwin, John; Borden, Chester
Collaborative Resource Allocation Networking Environment (CRANE) Version 0.5 is a prototype created to prove the newest concept of using a distributed environment to schedule Deep Space Network (DSN) antenna times in a collaborative fashion. This program is for all space-flight and terrestrial science project users and DSN schedulers to perform scheduling activities and conflict resolution, both synchronously and asynchronously. Project schedulers can, for the first time, participate directly in scheduling their tracking times into the official DSN schedule, and negotiate directly with other projects in an integrated scheduling system. A master schedule covers long-range, mid-range, near-real-time, and real-time scheduling time frames all in one, rather than the current method of separate functions that are supported by different processes and tools. CRANE also provides private workspaces (both dynamic and static), data sharing, scenario management, user control, rapid messaging (based on Java Message Service), data/time synchronization, workflow management, notification (including emails), conflict checking, and a linkage to a schedule generation engine. The data structure with corresponding database design combines object trees with multiple associated mortal instances and relational database to provide unprecedented traceability and simplify the existing DSN XML schedule representation. These technologies are used to provide traceability, schedule negotiation, conflict resolution, and load forecasting from real-time operations to long-range loading analysis up to 20 years in the future. CRANE includes a database, a stored procedure layer, an agent-based middle tier, a Web service wrapper, a Windows Integrated Analysis Environment (IAE), a Java application, and a Web page interface.
Subpopulation triage: how to allocate conservation effort among populations.
McDonald-Madden, Eve; Baxter, Peter W J; Possingham, Hugh P
Threatened species often exist in a small number of isolated subpopulations. Given limitations on conservation spending, managers must choose from strategies that range from managing just one subpopulation and risking all other subpopulations to managing all subpopulations equally and poorly, thereby risking the loss of all subpopulations. We took an economic approach to this problem in an effort to discover a simple rule of thumb for optimally allocating conservation effort among subpopulations. This rule was derived by maximizing the expected number of extant subpopulations remaining given n subpopulations are actually managed. We also derived a spatiotemporally optimized strategy through stochastic dynamic programming. The rule of thumb suggested that more subpopulations should be managed if the budget increases or if the cost of reducing local extinction probabilities decreases. The rule performed well against the exact optimal strategy that was the result of the stochastic dynamic program and much better than other simple strategies (e.g., always manage one extant subpopulation or half of the remaining subpopulation). We applied our approach to the allocation of funds in 2 contrasting case studies: reduction of poaching of Sumatran tigers (Panthera tigris sumatrae) and habitat acquisition for San Joaquin kit foxes (Vulpes macrotis mutica). For our estimated annual budget for Sumatran tiger management, the mean time to extinction was about 32 years. For our estimated annual management budget for kit foxes in the San Joaquin Valley, the mean time to extinction was approximately 24 years. Our framework allows managers to deal with the important question of how to allocate scarce conservation resources among subpopulations of any threatened species. PMID:18477029
A stochastic dynamic programming model for stream water quality management
P. P. Mujumdar; Pavan Saxena
This paper deals with development of a seasonal fraction-removal policy model for waste load allocation in streams addressing\\u000a uncertainties due to randomness and fuzziness. A stochastic dynamic programming (SDP) model is developed to arrive at the\\u000a steady-state seasonal fraction-removal policy. A fuzzy decision model (FDM) developed by us in an earlier study is used to\\u000a compute the system performance measure
Stochastic differential equations
Sobczyk, K. (Polska Akademia Nauk, Warsaw (Poland))
This book provides a unified treatment of both regular (or random) and Ito stochastic differential equations. It focuses on solution methods, including some developed only recently. Applications are discussed, in particular an insight is given into both the mathematical structure, and the most efficient solution methods (analytical as well as numerical). Starting from basic notions and results of the theory of stochastic processes and stochastic calculus (including Ito's stochastic integral), many principal mathematical problems and results related to stochastic differential equations are expounded here for the first time. Applications treated include those relating to road vehicles, earthquake excitations and offshore structures.
Task allocation among multiple intelligent robots
NASA Technical Reports Server (NTRS)
Gasser, L.; Bekey, G.
Researchers describe the design of a decentralized mechanism for allocating assembly tasks in a multiple robot assembly workstation. Currently, the approach focuses on distributed allocation to explore its feasibility and its potential for adaptability to changing circumstances, rather than for optimizing throughput. Individual greedy robots make their own local allocation decisions using both dynamic allocation policies which propagate through a network of allocation goals, and local static and dynamic constraints describing which robots are elibible for which assembly tasks. Global coherence is achieved by proper weighting of allocation pressures propagating through the assembly plan. Deadlock avoidance and synchronization is achieved using periodic reassessments of local allocation decisions, ageing of allocation goals, and short-term allocation locks on goals.
Collective credit allocation in science
Shen, Hua-Wei; Barabási, Albert-László
Collaboration among researchers is an essential component of the modern scientific enterprise, playing a particularly important role in multidisciplinary research. However, we continue to wrestle with allocating credit to the coauthors of publications with multiple authors, because the relative contribution of each author is difficult to determine. At the same time, the scientific community runs an informal field-dependent credit allocation process that assigns credit in a collective fashion to each work. Here we develop a credit allocation algorithm that captures the coauthors' contribution to a publication as perceived by the scientific community, reproducing the informal collective credit allocation of science. We validate the method by identifying the authors of Nobel-winning papers that are credited for the discovery, independent of their positions in the author list. The method can also compare the relative impact of researchers working in the same field, even if they did not publish together. The ability to accurately measure the relative credit of researchers could affect many aspects of credit allocation in science, potentially impacting hiring, funding, and promotion decisions. PMID:25114238
Advanced Topics in AI Task Allocation-Task Allocation -
Institute for SoftwareTechnology Inffeldgasse 16b/2 A 8010 GA-8010 Graz Austria #12;Agenda Motivation Examples Motivation Examples Formal Problem Description T f T k All ti Taxonomy of Task Allocation passable (police) extinguish the fires (fire brigades) rescue all civilians (ambulances
Activity-Based Costing for Economic Value Added®
Regina M. Anctil; James S. Jordan; Arijit Mukherji
Economic value added, which is the currently popular term for the traditional accounting concept of residual income (RI), subtracts from operating income an interest charge for invested capital. This paper provides an activity-based cost system that supports RI maximization. We construct a model of participative budgeting for a multi-activity firm in which the cost system allocates plant and equipment cost
Dynamic versus static allocation policies in multipurpose multireservoir systems
NASA Astrophysics Data System (ADS)
Tilmant, A.; Goor, Q.; Pinte, D.; van der Zaag, P.
As the competition for water is likely to increase in the near future due to socioeconomic development and population growth, water resources managers will face hard choices when allocating water between competing users. Because water is a vital resource used in multiple sectors, including the environment, the allocation is inherently a political and social process, which is likely to become increasingly scrutinized as the competition grows between the different sectors. Since markets are usually absent or ineffective, the allocation of water between competing demands is achieved administratively taking into account key objectives such as economic efficiency, equity and maintaining the ecological integrity. When crop irrigation is involved, water is usually allocated by a system of annual rights to use a fixed, static, volume of water. In a fully-allocated basin, moving from a static to a dynamic allocation process, whereby the policies are regularly updated according to the hydrologic status of the river basin, is the first step towards the development of river basin management strategies that increase the productivity of water. More specifically, in a multipurpose multireservoir system, continuously adjusting release and withdrawal decisions based on the latest hydrologic information will increase the benefits derived from the system. However, the extent to which such an adjustment can be achieved results from complex spatial and temporal interactions between the physical characteristics of the water resources system (storage, natural flows), the economic and social consequences of rationing and the impacts on natural ecosystems. The complexity of the decision-making process, which requires the continuous evaluation of numerous trade-offs, calls for the use of integrated hydrologic-economic models. This paper compares static and dynamic management approaches for a cascade of hydropower-irrigation reservoirs using stochastic dual dynamic programming (SDDP) formulations. As its name indicates, SDDP is an extension of SDP that removes the curse of dimensionality found in discrete SDP and can therefore be used to analyze large-scale water resources systems. For the static approach, the multiobjective (irrigation-hydropower) optimization problem is solved using the constraint method, i.e. net benefits from hydropower generation are maximized and irrigation water withdrawals are additional constraints. In the dynamic approach, the SDDP model seeks to maximize the net benefits of both hydropower and irrigation crop production. A cascade of 8 reservoirs in the Turkish and Syrian parts of the Euphrates river basin is used as a case study.
Sutcliffe, Paul [Department of Mathematical Sciences, Durham University, Durham DH1 3LE (United Kingdom)
Applications to holographic theories have led to some recent interest in magnetic monopoles in four-dimensional Anti-de Sitter (AdS) spacetime. Some analytic and numerical results are discussed for monopoles in AdS, including the symmetries of minimal energy monopoles (which are often Platonic), a connection to Skyrmions, and the emergence of a hexagonal lattice in the large charge limit.
James T. Liu; Hong Lü; Christopher N. Pope; Justin F. Vázquez-Poritz
We explore the non-BPS analog of `AdS bubbles', which are regular spherically symmetric 1\\/2 BPS geometries in type IIB supergravity. They have regular horizons and can be thought of as bubbling generalizations of non-extremal AdS black hole solutions in five-dimensional gauged supergravity. Due to the appearance of the Heun equation even at the linearized level, various approximation and numerical methods
New Solution Methods for Joint Chance-Constrained Stochastic Programs with Random Left-Hand Sides
Tanner, Matthew W.
of this dissertation details an application of joint chance-constrained stochastic programs to a vaccination allocation problem. We show why it is necessary to formulate the problem with random parameters and also why chance-constraints are a good framework for de...
New Solution Methods for Joint Chance-Constrained Stochastic Programs with Random Left-Hand Sides
Tanner, Matthew W.
of this dissertation details an application of joint chance-constrained stochastic programs to a vaccination allocation problem. We show why it is necessary to formulate the problem with random parameters and also why chance-constraints are a good framework for de...
Feedback stabilization over stochastic multiplicative input channels: Continuous-time case
Nan Xiao; Lihua Xie
The present work fits within the general study of communication and control co-design, where the mean square stabilization of continuous-time networked control systems over stochastic multiplicative input channels is addressed. Motivated by the limited communication capacity and network resource allocation in multiple channel communication systems, we assume that the overall quality of service defined in this paper is fixed and
Anninos, Dionysios; Padi, Megha; Song, Wei; Strominger, Andrew
Three dimensional topologically massive gravity (TMG) with a negative cosmological constant -\\ell^{-2} and positive Newton constant G admits an AdS_3 vacuum solution for any value of the graviton mass \\mu. These are all known to be perturbatively unstable except at the recently explored chiral point \\mu\\ell=1. However we show herein that for every value of \\mu\\ell3, there are known warped black hole solutions which are asymptotic to warped AdS_3. We show that these black holes are discrete quotients of warped AdS_3 just as BTZ black holes are discrete quotients of ordinary AdS_3. Moreover new solutions of this type, relevant to any theory with warped AdS_3 solutions, are exhibited. Finally we note that the black hole thermodynamics is consistent with the hypothesis that, for \\mu\\ell>3, the warped AdS_3 ground state of TMG is holographically dual to a 2D boundary CFT with central charges c_R={15(\\mu\\ell)^2+81\\over G\\mu((\\mu\\ell)^2+27)} and c_L={12 \\mu\\ell^2\\over G((\\mu\\ell)^2+27)}.
SHALE: An Efficient Algorithm for Allocation of Guaranteed Display Advertising
Bharadwaj, Vijay; Ma, Wenjing; Nagarajan, Chandrashekhar; Tomlin, John; Vassilvitskii, Sergei; Vee, Erik; Yang, Jian
Motivated by the problem of optimizing allocation in guaranteed display advertising, we develop an efficient, lightweight method of generating a compact {\\em allocation plan} that can be used to guide ad server decisions. The plan itself uses just O(1) state per guaranteed contract, is robust to noise, and allows us to serve (provably) nearly optimally. The optimization method we develop is scalable, with a small in-memory footprint, and working in linear time per iteration. It is also "stop-anytime", meaning that time-critical applications can stop early and still get a good serving solution. Thus, it is particularly useful for optimizing the large problems arising in the context of display advertising. We demonstrate the effectiveness of our algorithm using actual Yahoo! data.
Distributed Resource Allocation in Communication Networks
Huang, Jianwei
(Princeton University) Distributed Resource Allocation Jan. 2007 1 / 60 #12;Acknowledgement Academia-Wei Tan, Jeffrey Dwoskin Northwestern University: Michael Honig, Randall Berry, Aggelos Katsaggelos Resource Allocation Jan. 2007 2 / 60 #12;Communication Networks Are Everywhere ... SGSN Internal Network
24 CFR 594.15 - Allocation amounts.
Code of Federal Regulations, 2012 CFR
...ASSISTANT SECRETARY FOR COMMUNITY PLANNING AND DEVELOPMENT, DEPARTMENT OF HOUSING AND URBAN DEVELOPMENT COMMUNITY FACILITIES JOHN HEINZ NEIGHBORHOOD DEVELOPMENT PROGRAM Funding Allocation and Criteria § 594.15 Allocation amounts. (a)...
24 CFR 594.15 - Allocation amounts.
Code of Federal Regulations, 2014 CFR
...ASSISTANT SECRETARY FOR COMMUNITY PLANNING AND DEVELOPMENT, DEPARTMENT OF HOUSING AND URBAN DEVELOPMENT COMMUNITY FACILITIES JOHN HEINZ NEIGHBORHOOD DEVELOPMENT PROGRAM Funding Allocation and Criteria § 594.15 Allocation amounts. (a)...
24 CFR 594.15 - Allocation amounts.
Code of Federal Regulations, 2011 CFR
...ASSISTANT SECRETARY FOR COMMUNITY PLANNING AND DEVELOPMENT, DEPARTMENT OF HOUSING AND URBAN DEVELOPMENT COMMUNITY FACILITIES JOHN HEINZ NEIGHBORHOOD DEVELOPMENT PROGRAM Funding Allocation and Criteria § 594.15 Allocation amounts. (a)...
24 CFR 594.15 - Allocation amounts.
Code of Federal Regulations, 2013 CFR
...ASSISTANT SECRETARY FOR COMMUNITY PLANNING AND DEVELOPMENT, DEPARTMENT OF HOUSING AND URBAN DEVELOPMENT COMMUNITY FACILITIES JOHN HEINZ NEIGHBORHOOD DEVELOPMENT PROGRAM Funding Allocation and Criteria § 594.15 Allocation amounts. (a)...
24 CFR 594.15 - Allocation amounts.
Code of Federal Regulations, 2010 CFR
...ASSISTANT SECRETARY FOR COMMUNITY PLANNING AND DEVELOPMENT, DEPARTMENT OF HOUSING AND URBAN DEVELOPMENT COMMUNITY FACILITIES JOHN HEINZ NEIGHBORHOOD DEVELOPMENT PROGRAM Funding Allocation and Criteria § 594.15 Allocation amounts. (a)...
Economic allocation: Examples and derived decision tree
Jeroen B. Guinée; Reinout Heijungs; Gjalt Huppes
Goal, Scope and Background In the recently published (Dutch) Handbook on LCA, economic allocation is advised as baseline method for most allocation situations\\u000a in a detailed LCA. Although the Handbook on LCA aimed to provide a 'cookbook' with operational guidelines for conducting each\\u000a step of an LCA, this was not completely achieved for the allocation step. The guidelines for allocation largely
Regulating nutrient allocation in plants
Udvardi, Michael; Yang, Jiading; Worley, Eric
The invention provides coding and promoter sequences for a VS-1 and AP-2 gene, which affects the developmental process of senescence in plants. Vectors, transgenic plants, seeds, and host cells comprising heterologous VS-1 and AP-2 genes are also provided. Additionally provided are methods of altering nutrient allocation and composition in a plant using the VS-1 and AP-2 genes.
Resource allocation for broadband networks
Joseph Y. Hui
The author suggests the use of congestion measures at the packet level, the burst level, and the call level to evaluate congestion for integrated traffic. These measures result from the fact that communication terminals can often be characterized in terms of call level, burst level, and packet level statistics. They can be used for the purpose of bandwidth allocation at
Subramanian, Venkat
sharing amounts for equipment separate from direct costs. F&A Cos COST SHARING (establish a cost sharing allocation and/or increase cost sharing amounts not shown on the project's current PC Form) Dept # Fund # Voluntary Cost Sharing (offered by PI) Mandatory Cost Sharing
Incremental transmission loss allocation under pool dispatch
Francisco D. Galiana; Antonio J. Conejo; Ivana Kockar
Incremental transmission loss analysis has been used for decades, but recent interest in its application to loss allocation calls for new in-depth results. This paper demonstrates that, for incremental methods to be applied correctly in loss allocation, it is first necessary to specify the load distribution and loss supply strategies. Incremental loss allocation among bus power injections is shown to
Product development resource allocation with foresight
Nitin R. Joglekar; David N. Ford
Shortening project duration is critical to product development project success in many industries. As a primary driver of progress and an effective management tool, resource allocation among development activities can strongly influence project duration. Effective allocation is difficult due to the inherent closed loop flow of development work and the dynamic demand patterns of work backlogs. The Resource Allocation Policy
Power Aware Page Allocation Alvin R. Lebeck
Ellis, Carla
Power Aware Page Allocation Alvin R. Lebeck Department of Computer Science Duke University email@example.com http://www.cs.duke.edu/~alvy Milly Watt #12;Power Aware Page Allocation 2© Alvin R. Lebeck, 2001, NSF Research Instrumentation, Intel, Microsoft #12;Power Aware Page Allocation 3© Alvin R. Lebeck
New allocation methods for repairable systems
Suprasad V. Amari; Vaishali Hegde
Allocations are used to translate the reliability and availability goals of a system into reliability and availability goals for the subsystems. There are very few allocation methods available for repairable systems, even though most systems are repairable. The most popular allocation method for repairable systems assigns equal availabilities to subsystems to meet the desired system level availability. This method assumes
On the Fair Division of Multiple Stochastic Pies to Multiple Agents within the Nash Bargaining Solution
Karmperis, Athanasios C.; Aravossis, Konstantinos; Tatsiopoulos, Ilias P.; Sotirchos, Anastasios
The fair division of a surplus is one of the most widely examined problems. This paper focuses on bargaining problems with fixed disagreement payoffs where risk-neutral agents have reached an agreement that is the Nash-bargaining solution (NBS). We consider a stochastic environment, in which the overall return consists of multiple pies with uncertain sizes and we examine how these pies can be allocated with fairness among agents. Specifically, fairness is based on the Aristotle's maxim: "equals should be treated equally and unequals unequally, in proportion to the relevant inequality". In this context, fairness is achieved when all the individual stochastic surplus shares which are allocated to agents are distributed in proportion to the NBS. We introduce a novel algorithm, which can be used to compute the ratio of each pie that should be allocated to each agent, in order to ensure fairness within a symmetric or asymmetric NBS. PMID:23024752
Efficient bit allocation for an arbitrary set of quantizers
Yair Shoham; A. Gersho
A bit allocation algorithm that is capable of efficiently allocating a given quota of bits to an arbitrary set of different quantizers is proposed. This algorithm is useful in any coding scheme which uses bit allocation or, more generally, codebook allocation. It produces an optimal or very nearly optimal allocation, while allowing the set of admissible bit allocation values to
A Distributed Resource Management Architecture that Supports Advance Reservations and Co-Allocation
Ian Foster; Carl Kesselman; Craig Lee; Bob Lindell; Klara Nahrstedt; Alain Roy
The realization of end-to-end quality of service (QoS) guarantees in emerging network- based applications requires mechanisms that support rst dynamic discovery and then ad- vance or immediate reservation of resources that will often be heterogeneous in type and implementation and independently controlled and administered . We propose the Globus Architecture for Reservation and Allocation (GARA) to address the four highlighted
Contrasted effect of biochar and earthworms on rice growth and resource allocation in different soils
Diana Noguera; Marco Rondón; Kam-Rigne Laossi; Valerio Hoyos; Patrick Lavelle; Maria Helena Cruz de Carvalho; Sébastien Barot
Adding biochar to soils and maintaining high earthworm biomasses are potential ways to increase the fertility of tropical soils and the sustainability of crop production in the spirit of agroecology and ecological engineering. However, a thorough functional assessment of biochar effect on plant growth and resource allocations is so far missing. Moreover, earthworms and biochar increase mineral nutrient availability through
Introducing the SAPS System and a Corresponding Allocation Mechanism for Synchronous Online Reciprocal Peer Support Activities
Gijs de Bakker; Jan van Bruggen; Wim Jochems; Peter B. Sloep
While student populations in higher education are becoming more heterogeneous, recently several attempts have been made to introduce online peer support to decrease the tutor load of teachers. We propose a system that facilitates synchronous online reciprocal peer support activities for ad hoc student questions: the Synchronous Allocated Peer Support (SAPS) system. Via this system, students with questions during their
Allocating Variability and Reserve Requirements (Presentation)
Kirby, B.; King, J.; Milligan, M.
This presentation describes how you could conceivably allocate variability and reserve requirements, including how to allocate aggregation benefits. Conclusions of this presentation are: (1) Aggregation provides benefits because individual requirements are not 100% correlated; (2) Method needed to allocate reduced requirement among participants; (3) Differences between allocation results are subtle - (a) Not immediately obvious which method is 'better'; (b) Many are numerically 'correct', they sum to the physical requirement; (c) Many are not 'fair', Results depend on sub-aggregation and/or the order individuals are included; and (4) Vector allocation method is simple and fair.
Phase transitions in crowd dynamics of resource allocation
Ghosh, Asim; Chatterjee, Arnab; Marsili, Matteo; Chakrabarti, Bikas K
We define and study a class of resources allocation processes where $gN$ agents, by repeatedly visiting $N$ resources, try to converge to optimal configuration where each resource is occupied by at most one agent. The process exhibits a phase transition, as the density $g$ of agents grows, from an absorbing to an active phase. In the latter, even if the number of resources is in principle enough for all agents ($g<1$), the system never settles to a frozen configuration. We recast these processes in terms of zero-range interacting particles, studying analytically the mean field dynamics and investigating numerically the phase transition in finite dimensions. We find a good agreement with the critical exponents of the stochastic fixed-energy sandpile. The lack of coordination in the active phase also leads to a non-trivial faster-is-slower effect.
Instantaneous stochastic perturbation theory
Martin Lüscher
A form of stochastic perturbation theory is described, where the representative stochastic fields are generated instantaneously rather than through a Markov process. The correctness of the procedure is established to all orders of the expansion and for a wide class of field theories that includes all common formulations of lattice QCD.
Amplification by stochastic interference
K. Svozil; D. Felix; K. Ehrenberger
A new method is introduced to obtain a strong signal by the interference of weak signals in noisy channels. The method is based on the interference of 1/f noise from parallel channels. One realization of stochastic interference is the auditory nervous system. Stochastic interference may have broad potential applications in the information transmission by parallel noisy channels.
Succession Model Landscape Stochasticity
100 1000 10000 patch sizes birth rate both Disturbance Model Landscape Stochasticity Low Control High" accomplished by incrementing the patch birth rate (Control: s = a = 10) A simple model of species viabilitySuccession Model Landscape Stochasticity Low Control High Very High ThresholdMultiplier 0.1 1 10
Richard Colombo; Weina Jiang
A central problem in database marketing is how to choose which customers in the firm's database to target with an offer. This paper presents a simple stochastic RFM model to carry out such a task. By making a few straightforward assumptions about the customers in the database, the stochastic model provides a means of (1) ranking customers in terms of
Power Optimization in Fault-Tolerant Mobile Ad Hoc Networks
Oliviero Riganelli; Radu Grosu; Samir R. Das; C. R. Ramakrishnan; Scott A. Smolka
In this paper, we investigate the transmission-power assignment problem for k-connected mobile ad hoc networks (MANETs), the problem of optimizing the lifetime of a MANET at a given degree k of connectivity by minimizing power consump- tion. Our proposed solution is fully distributed and uses a model- based transmission power adaptation strategy based on model- predictive control. Specifically, a stochastic
Alejandra Castro; Wei Song
We revisit some properties of AdS$_2$ Einstein-Maxwell gravity with the aim of reconciling apparently conflicting results in prior literature. We show that the two dimensional theory can be obtained as a dimensional reduction of the three dimensional Einstein gravity with the CSS boundary condition. In general, this theory on AdS$_2$ can be viewed as an effective theory of the near horizon geometry of a (near-)extremal black hole. We provide an interpretation of our results in terms of the microscopic description of an extremal black hole.
Stochastic Analysis of Aloha in Vehicular Ad-hoc Networks
Boyer, Edmond
of Carrier Sense Multiple Access (CSMA) or another collision avoidance mechanism as their MAC protocols; cf study perfor- mance metrics based on the signal-over-interference and noise ratio (SINR) assuming power probability. We consider the presence or the absence of noise and we study performance with outage
Bifurcation Analysis of Stochastic Non-smooth Systems
NASA Astrophysics Data System (ADS)
Gaus, Nicole; Proppe, Carsten
Non-smooth systems with stochastic parameters are important models e.g. for brake and cam follower systems. They show special bifurcation phenomena, such as grazing bifurcations. This contribution studies the influence of stochastic processes on bifurcations in non-smooth systems. As an example, the classical mass on a belt system is considered, where stick-slip vibrations occur. Measurements indicate that the friction coefficient which plays a large role in the system behavior is not deterministic but can be described as a friction characteristic with added white noise. Therefore, a stochastic process is introduced into the non-smooth model and its influence on the bifurcation behavior is studied. It is shown that the stochastic process may alter the bifurcation behavior of the deterministic system.
Supersymmetric holography on AdS3
Candu, Constantin
The proposed duality between Vasiliev's supersymmetric higher spin theory on AdS3 and the 't Hooft limit of the 2d superconformal Kazama-Suzuki models is analysed in detail. In particular, we show that the partition functions of the two theories agree in the large N limit.
Supersymmetric holography on AdS3
Constantin Candu; Matthias R. Gaberdiel
The proposed duality between Vasiliev's supersymmetric higher spin theory on AdS3 and the 't Hooft limit of the 2d superconformal Kazama-Suzuki models is analysed in detail. In particular, we show that the partition functions of the two theories agree in the large N limit.
Spiky strings in ?-deformed AdS
NASA Astrophysics Data System (ADS)
Banerjee, Aritra; Bhattacharya, Soumya; Panigrahi, Kamal L.
We study rigidly rotating strings in ?-deformed AdS background. We probe this classically integrable background with `spiky' strings and analyze the string profiles in the large charge limit systematically. We also discuss the dispersion relation among the conserved charges for these solutions in long string limit.
Stochastic multisymplectic integrator for stochastic KdV equation
NASA Astrophysics Data System (ADS)
Jiang, Shanshan; Wang, Lijin; Hong, Jialin
In this paper we investigate the stochastic multisymplectic methods to solve the stochastic partial differential equation. The stochastic KdV equations are considered. Besides conserving the multi-symplectic structure of original equation, the stochastic multi-symplectic methods are also investigated for the conservation of various conservation laws. We deduce the transit laws of the specific formal conservation laws. Numerical experiments are illustrated to verify the good behaviors of stochastic multisymplectic methods.
Stochastic Decoding of Turbo Codes
Quang Trung Dong; Matthieu Arzel; Christophe Jégo; Warren J. Gross
Stochastic computation is a technique in which operations on probabilities are performed on random bit streams. Stochastic decoding of forward error-correction (FEC) codes is inspired by this technique. This paper extends the application of the stochastic decoding approach to the families of convolutional codes and turbo codes. It demonstrates that stochastic computation is a promising solution to improve the data
Uncertainty Representation in Stochastic Reservoir Optimization
NASA Astrophysics Data System (ADS)
Lamontagne, J. R.; Stedinger, J. R.; Shoemaker, C. A.; Tan, S. N.
Water resources managers attempt to operate reservoir and hydropower systems to maximize system objectives, subject to a host of physical and policy constraints, and in light of uncertainty about future conditions. Optimization models are widely used to advise the decision making process. An important aspect of such models is how uncertainties related to future hydrologic and economic conditions are represented, and the extent to which different uncertainty representations affect the quality of recommended decisions. This study explores the consequences of different uncertainty representations in stochastic optimization models of hydropower systems by comparing simulated system performance using different stochastic optimization models. An important question is whether the added computational burden from greater uncertainty resolution (which can be prohibitive for operational models in many cases) actually improves model recommendations. This is particularly relevant as more complex, ensemble forecasts are incorporated into short- and mid-term planning models. Another important consideration is how watershed hydrology (both seasonal and episodic characteristics), system size, economic context, and the temporal resolution of the model influence how uncertainty should be represented. These topics are explored through several US examples including a sampling stochastic dynamic programming (SSDP) model of a small single-reservoir system on the Kennebec River in Maine, and a stochastic programming model of the large multi-reservoir Federal Columbia River system in the Pacific Northwest. These studies highlight the importance of flexible model frameworks which allow exploration of different representations of a system and of uncertainties before locking operational decision support system development into a specific representation.
Statistical analysis of stochastic resonance in a thresholded detector
Wefelmeyer, Wolfgang
Statistical analysis of stochastic resonance in a thresholded detector Priscilla E. Greenwood be detected if noise is added to the data. The noisy signal must be strong enough to exceed the threshold at least occasionally; but very strong noise tends to drown out the signal. There is an optimal noise level
Simulation Evaluation of Call Dropping Policies for Stochastic Capacity Networks
Williamson, Carey
, Simula- tion, Call Blocking, Call Dropping, Wireless CDMA 1 Introduction In many network environments Mode (ATM) networks use Connection Ad- mission Control (CAC) to determine which calls are allowedSimulation Evaluation of Call Dropping Policies for Stochastic Capacity Networks Hongxia Sun Carey
An applied compact introductory survey of Markov stochastic processes and control in continuous time is presented. The presentation is in tutorial stages, beginning with determinis- tic dynamical systems for contrast and continuing on to perturbing the deterministic model with diusions using Wiener processes. Then jump perturbations are added using simple Poisson pro- cesses constructing the theory of simple jump-diusions. Next,
Constant time worker thread allocation via configuration caching
Eichenberger, Alexandre E; O'Brien, John K. P.
Mechanisms are provided for allocating threads for execution of a parallel region of code. A request for allocation of worker threads to execute the parallel region of code is received from a master thread. Cached thread allocation information identifying prior thread allocations that have been performed for the master thread are accessed. Worker threads are allocated to the master thread based on the cached thread allocation information. The parallel region of code is executed using the allocated worker threads.
Renaud Gauthier
We develop the foundations of Algebraic Stochastic Calculus, with an aim to replacing what is typically referred to as Stochastic Calculus by a purely categorical version thereof. We first give a sheaf theoretic reinterpretation of Probability Theory. We regard probability spaces (X, F, P) as Grothendieck sites (F, J_P) on which Brownian motions are defined via sheaves in symmetric monoidal infinity-categories. Due to the complex nature of such a formalism we are naturally led to considering a purely categorical, time independent formalism in which stochastic differential equations are replaced by studying problems in deformation theory.
Semiparametric smoothing estimators for long-memory processes with added noise
Crato, Nuno
Semiparametric smoothing estimators for long-memory processes with added noise Nuno Crato estimators for long-memory processes with added noise Abstract: The development of Long Memory Stochastic, particularly when the signal-to-noise ratio is small. However, various types of empirical processes have been
Adaptive Distributed Resource Allocation for Sensor Networks
Hock Beng Lim; Di Ma; Cheng Fu; Bang Wang; Meng Joo Er
\\u000a A major research challenge in the field of sensor networks is the distributed resource allocation problem, which concerns\\u000a how the limited resources in a sensor network should be allocated or scheduled to minimize costs and maximize the network\\u000a capability. We survey the existing work on the distributed resource allocation problem. To address the drawbacks in the existing\\u000a work, we propose
A stochastic model of eye lens growth.
Šiki?, Hrvoje; Shi, Yanrong; Lubura, Snježana; Bassnett, Steven
The size and shape of the ocular lens must be controlled with precision if light is to be focused sharply on the retina. The lifelong growth of the lens depends on the production of cells in the anterior epithelium. At the lens equator, epithelial cells differentiate into fiber cells, which are added to the surface of the existing fiber cell mass, increasing its volume and area. We developed a stochastic model relating the rates of cell proliferation and death in various regions of the lens epithelium to deposition of fiber cells and radial lens growth. Epithelial population dynamics were modeled as a branching process with emigration and immigration between proliferative zones. Numerical simulations were in agreement with empirical measurements and demonstrated that, operating within the strict confines of lens geometry, a stochastic growth engine can produce the smooth and precise growth necessary for lens function. PMID:25816743
Basin-wide cooperative water resources allocation
Lizhong Wang; Liping Fang; Keith W. Hipel
Abstract The Cooperative Water Allocation Model,(CWAM) is designed,within a general mathematical,programming,frame- work,for modeling,equitable and,efficient water allocation among,competing,users at the basin level and,applied to a large-scale water allocation problem in the South Saskatchewan River Basin located in southern Alberta, Canada. This comprehensive,model,consists of two main steps: initial water rights allocation and subsequent,water and net benefits real- location. Two mathematical programming approaches,
Spring, William Joseph [Quantum Information and Probability Group, School of Computer Science, University of Hertfordshire, Hatfield, Herts AL10 9AB (United Kingdom)
We consider quantum analogues of n-parameter stochastic processes, associated integrals and martingale properties extending classical results obtained in [1, 2, 3], and quantum results in [4, 5, 6, 7, 8, 9, 10].
Asymptotically AdS brane black holes
Galfard, Christophe [D.A.M.T.P., Centre for Mathematical Sciences, University of Cambridge, Wilberforce Road, Cambridge CB3 0WA (United Kingdom); Germani, Cristiano [D.A.M.T.P., Centre for Mathematical Sciences, University of Cambridge, Wilberforce Road, Cambridge CB3 0WA (United Kingdom); Yukawa Institute for Theoretical Physics, Kyoto UniversityOiwake-cho Kitashirakawa Sakyo, Kyoto 606-8502 (Japan); Ishibashi, Akihiro [Enrico Fermi Institute, University of Chicago, Chicago, Illinois 60637 (United States)
We study the possibility of having a static, asymptotically AdS black hole localized on a braneworld with matter fields, within the framework of the Randall and Sundrum scenario. We attempt to look for such a brane black hole configuration by slicing a given bulk spacetime and taking Z{sub 2} symmetry about the slices. We find that such configurations are possible, and as an explicit example, we provide a family of asymptotically AdS brane black hole solutions for which both the bulk and brane metrics are regular on and outside the black hole horizon and brane matter fields are realistic in the sense that the dominant energy condition is satisfied. We also find that our braneworld models exhibit signature change inside the black hole horizon.
Loefstedt, R.; Coppersmith, S.N. (AT T Bell Laboratories, Murray Hill, New Jersey 07974 (United States))
We demonstrate that stochastic resonance, where an increase in the noise acting on a nonlinear dynamical system increases the signal-to-noise ratio describing the response to periodic driving, can occur in quantum systems as well as classical ones. We show that quantum stochastic resonance can be observed experimentally by measuring conductance fluctuations in mesoscopic metals and describe the experimental parameters for which it occurs.
Strategic planning for disaster recovery with stochastic last mile distribution
Bent, Russell Whitford [Los Alamos National Laboratory; Van Hentenryck, Pascal [BROWN UNIV.; Coffrin, Carleton [BROWN UNIV.
This paper considers the single commodity allocation problem (SCAP) for disaster recovery, a fundamental problem faced by all populated areas. SCAPs are complex stochastic optimization problems that combine resource allocation, warehouse routing, and parallel fleet routing. Moreover, these problems must be solved under tight runtime constraints to be practical in real-world disaster situations. This paper formalizes the specification of SCAPs and introduces a novel multi-stage hybrid-optimization algorithm that utilizes the strengths of mixed integer programming, constraint programming, and large neighborhood search. The algorithm was validated on hurricane disaster scenarios generated by Los Alamos National Laboratory using state-of-the-art disaster simulation tools and is deployed to aid federal organizations in the US.
Stochastic Ocean Eddy Perturbations in a Coupled General Circulation Model.
NASA Astrophysics Data System (ADS)
Howe, N.; Williams, P. D.; Gregory, J. M.; Smith, R. S.
High-resolution ocean models, which are eddy permitting and resolving, require large computing resources to produce centuries worth of data. Also, some previous studies have suggested that increasing resolution does not necessarily solve the problem of unresolved scales, because it simply introduces a new set of unresolved scales. Applying stochastic parameterisations to ocean models is one solution that is expected to improve the representation of small-scale (eddy) effects without increasing run-time. Stochastic parameterisation has been shown to have an impact in atmosphere-only models and idealised ocean models, but has not previously been studied in ocean general circulation models. Here we apply simple stochastic perturbations to the ocean temperature and salinity tendencies in the low-resolution coupled climate model, FAMOUS. The stochastic perturbations are implemented according to T(t) = T(t-1) + (?T(t) + ?(t)), where T is temperature or salinity, ?T is the corresponding deterministic increment in one time step, and ?(t) is Gaussian noise. We use high-resolution HiGEM data coarse-grained to the FAMOUS grid to provide information about the magnitude and spatio-temporal correlation structure of the noise to be added to the lower resolution model. Here we present results of adding white and red noise, showing the impacts of an additive stochastic perturbation on mean climate state and variability in an AOGCM.
Optimal dynamic water allocation: Irrigation extractions and environmental tradeoffs in the Murray River, Australia
NASA Astrophysics Data System (ADS)
Grafton, R. Quentin; Chu, Hoang Long; Stewardson, Michael; Kompas, Tom
A key challenge in managing semiarid basins, such as in the Murray-Darling in Australia, is to balance the trade-offs between the net benefits of allocating water for irrigated agriculture, and other uses, versus the costs of reduced surface flows for the environment. Typically, water planners do not have the tools to optimally and dynamically allocate water among competing uses. We address this problem by developing a general stochastic, dynamic programming model with four state variables (the drought status, the current weather, weather correlation, and current storage) and two controls (environmental release and irrigation allocation) to optimally allocate water between extractions and in situ uses. The model is calibrated to Australia's Murray River that generates: (1) a robust qualitative result that "pulse" or artificial flood events are an optimal way to deliver environmental flows over and above conveyance of base flows; (2) from 2001 to 2009 a water reallocation that would have given less to irrigated agriculture and more to environmental flows would have generated between half a billion and over 3 billion U.S. dollars in overall economic benefits; and (3) water markets increase optimal environmental releases by reducing the losses associated with reduced water diversions.
NSDL National Science Digital Library
The creators of BadAds believe that advertising has become far too intrusive in American lives. Along with TV, magazine, radio ads, and billboards, advertisements and commercials are popping up in movie theatres, schools, public bathrooms, and even on stickers on fruit. Four criteria determine whether advertising is intrusive: an inability to turn the ad off; its entrance into your home without your consent; your lack of choice whether or not to watch it; and ads that don't support anything in particular and may actually cost you money. Rather than just venting about intrusive advertising, BadAds urges visitors to become active in the fight against bad ads by writing complaint letters to a host of venues that support intrusive advertising including movie theaters, sporting venues, television networks, and the heads of educational institutions. BadAds offers instructions on writing complaint letters as well as many suggestions as to who should receive these letters.
10 CFR 440.10 - Allocation of funds.
Code of Federal Regulations, 2012 CFR
...2012-01-01 false Allocation of funds. 440.10 Section 440.10 Energy DEPARTMENT OF ENERGY ENERGY CONSERVATION WEATHERIZATION ASSISTANCE FOR LOW-INCOME PERSONS § 440.10 Allocation of funds. (a) DOE shall allocate financial...
10 CFR 440.10 - Allocation of funds.
Code of Federal Regulations, 2013 CFR
...2013-01-01 false Allocation of funds. 440.10 Section 440.10 Energy DEPARTMENT OF ENERGY ENERGY CONSERVATION WEATHERIZATION ASSISTANCE FOR LOW-INCOME PERSONS § 440.10 Allocation of funds. (a) DOE shall allocate financial...
10 CFR 440.10 - Allocation of funds.
Code of Federal Regulations, 2010 CFR
...2010-01-01 false Allocation of funds. 440.10 Section 440.10 Energy DEPARTMENT OF ENERGY ENERGY CONSERVATION WEATHERIZATION ASSISTANCE FOR LOW-INCOME PERSONS § 440.10 Allocation of funds. (a) DOE shall allocate financial...
10 CFR 440.10 - Allocation of funds.
Code of Federal Regulations, 2011 CFR
...2011-01-01 false Allocation of funds. 440.10 Section 440.10 Energy DEPARTMENT OF ENERGY ENERGY CONSERVATION WEATHERIZATION ASSISTANCE FOR LOW-INCOME PERSONS § 440.10 Allocation of funds. (a) DOE shall allocate financial...
10 CFR 440.10 - Allocation of funds.
Code of Federal Regulations, 2014 CFR
...2014-01-01 false Allocation of funds. 440.10 Section 440.10 Energy DEPARTMENT OF ENERGY ENERGY CONSERVATION WEATHERIZATION ASSISTANCE FOR LOW-INCOME PERSONS § 440.10 Allocation of funds. (a) DOE shall allocate financial...
Systematization of water allocation systems: an engineering approach
Santos Roman, Deborah Matilde
The allocation of water resources is typically accomplished within the framework of water allocation systems (WAS). In general, a WAS sets priorities, applies rules, and organizes responses to a range of water allocation ...
24 CFR 791.404 - Field Office allocation planning.
Code of Federal Regulations, 2012 CFR
The allocation planning process should provide for the equitable distribution of available budget authority, consistent with the relative housing needs of each allocation area within the field office jurisdiction. (b) Establishing allocation...
24 CFR 982.101 - Allocation of funding.
Code of Federal Regulations, 2010 CFR
...DEPARTMENT OF HOUSING AND URBAN DEVELOPMENT SECTION 8 TENANT BASED ASSISTANCE: HOUSING CHOICE VOUCHER PROGRAM Funding and PHA Application for Funding § 982.101 Allocation of funding. (a) Allocation of funding. HUD allocates available...
24 CFR 982.101 - Allocation of funding.
Code of Federal Regulations, 2012 CFR
...DEPARTMENT OF HOUSING AND URBAN DEVELOPMENT SECTION 8 TENANT BASED ASSISTANCE: HOUSING CHOICE VOUCHER PROGRAM Funding and PHA Application for Funding § 982.101 Allocation of funding. (a) Allocation of funding. HUD allocates available...
24 CFR 982.101 - Allocation of funding.
Code of Federal Regulations, 2013 CFR
...DEPARTMENT OF HOUSING AND URBAN DEVELOPMENT SECTION 8 TENANT-BASED ASSISTANCE: HOUSING CHOICE VOUCHER PROGRAM Funding and PHA Application for Funding § 982.101 Allocation of funding. (a) Allocation of funding. HUD allocates available...
24 CFR 982.101 - Allocation of funding.
Code of Federal Regulations, 2011 CFR
...DEPARTMENT OF HOUSING AND URBAN DEVELOPMENT SECTION 8 TENANT BASED ASSISTANCE: HOUSING CHOICE VOUCHER PROGRAM Funding and PHA Application for Funding § 982.101 Allocation of funding. (a) Allocation of funding. HUD allocates available...
How to Allocate Hard Candies Fairly
Marco Dall; Mosca Raaele
We consider the problem of allocating a finite number of indivisible items to two players with additive utilities. We design a procedure that looks for all the maximin allocations. The procedure makes repeated use of an extension of the Adjusted Winner, an eective procedure that deals with divisible items, to find new candidate solutions, and to suggest which items should
How to allocate hard candies fairly
Marco Dall'Aglio; Raffaele Mosca
We consider the problem of allocating a finite number of indivisible items to two players with additive utilities. We design a procedure that looks for all the maximin allocations and makes repeated use of an extension of the Adjusted Winner, an effective procedure that deals with divisible items, to find new candidate solutions, and to suggest which items should be
Cost Allocation Policy OMB Circular A-21
Clark, John
Expenses can be allocated to the federal grant or contract activity based on benefit derived, causeCost Allocation Policy OMB Circular A-21 Office of Management and Budget (OMB) Circular A-21 establishes principles for determining costs applicable to grants, contracts, and other agreements
Projected 1999-2000 Cost Allocation Summary.
ERIC Educational Resources Information Center
Wisconsin Technical Coll. System Board, Madison.
Information contained in this summary was derived from data submitted by Wisconsin technical colleges on their 1999-2000 projected cost allocation schedules. Cost allocation information is used to calculate the distribution of state aids to each college, and prepare financial and enrollment reports including state statistical summaries and reports…
Outsourcing Warranty Repairs: Dynamic Allocation Michelle Opp
Kulkarni, Vidyadhar G.
Outsourcing Warranty Repairs: Dynamic Allocation Michelle Opp Kevin Glazebrook Vidyadhar G In this paper we consider the problem of minimizing the costs of outsourcing warranty repairs when failed items study. Key words: Optimal allocation, Warranty outsourcing, Index policies, Dynamic routing, Restless
A Time Allocation Study of University Faculty
ERIC Educational Resources Information Center
Link, Albert N.; Swann, Christopher A.; Bozeman, Barry
Many previous time allocation studies treat work as a single activity and examine trade-offs between work and other activities. This paper investigates the at-work allocation of time among teaching, research, grant writing and service by science and engineering faculty at top US research universities. We focus on the relationship between tenure…
Rethinking Reinforcement: Allocation, Induction, and Contingency
ERIC Educational Resources Information Center
Baum, William M.
The concept of reinforcement is at least incomplete and almost certainly incorrect. An alternative way of organizing our understanding of behavior may be built around three concepts: "allocation," "induction," and "correlation." Allocation is the measure of behavior and captures the centrality of choice: All behavior entails choice and consists of…
Fair allocation of transmission power losses
A. Gomez Exposito; J. M. Riquelme Santos; T. Gonzalez Garcia; E. A. Ruiz Velasco
In this paper, the issue of how transmission power losses should be allocated is addressed. First, it is shown that existing methodologies allocate interaction components regardless of the size of the involved partners. Then, several alternatives to split those terms are suggested which somehow take into account the relative contribution of each transaction. Although the ideas are presented by resorting
Finley Jr., Russell L.
University School of Medicine. 2.2. Research is a dynamic process and research space needs expand;Guidelines for Research Space Allocation and Management Wayne State University School of Medicine Page 2 of 51 GUIDELINES FOR RESEARCH SPACE ALLOCATION AND MANAGEMENT July, 2001 1. Scope and Applicability
Capacity Optimizing Power Allocation in Interference Channels
Shiyang Deng; Tobias Weber; Andreas Ahrens
The interference channel is an essential model in both wireline and wireless communication systems. This article addresses transmit power allocation in interference channels with total transmit power constraint. The optimum power allocation maximizing the sum rate in two user interference channels can be derived analytically. However, the non-convexity of the optimization problem makes it prohibitively complex to obtain the optimum
Register allocation in the SPUR Lisp compiler
James R. Larus; Paul N. Hilfinger
Register allocation is an important component of most compilers, particularly those for RISC machines. The SPUR Lisp compiler uses a sophisticated, graph-coloring algorithm developed by Fredrick Chow (Chow84). This paper describes the algorithm and the techniques used to implement it efficiently and evaluates its performance on several large pro- grams. The allocator successfully assigned most temporaries and local variables to
Social Security and Household Portfolio Allocation
R. Glenn Hubbard
The entitlement to social security retirement benefits is a major component of aggregate household wealth. This paper focuses on the impact of social security annuities on household portfolio allocation, extending existing optimizing models of portfolio allocation to explicitly consider the role of social security. The model is implemented using cross-section data. The partial equilibrium impacts of changes in social security
45 CFR 400.13 - Cost allocation.
Code of Federal Regulations, 2010 CFR
...must allocate costs appropriately among its CMA grant, social services grant, and any other...identified by the Director, may be charged to the CMA grant. All other costs must be allocated among the CMA grant, social services grant, and any...
45 CFR 400.13 - Cost allocation.
Code of Federal Regulations, 2012 CFR
...must allocate costs appropriately among its CMA grant, social services grant, and any other...identified by the Director, may be charged to the CMA grant. All other costs must be allocated among the CMA grant, social services grant, and any...
45 CFR 400.13 - Cost allocation.
Code of Federal Regulations, 2013 CFR
...must allocate costs appropriately among its CMA grant, social services grant, and any other...identified by the Director, may be charged to the CMA grant. All other costs must be allocated among the CMA grant, social services grant, and any...
45 CFR 400.13 - Cost allocation.
Code of Federal Regulations, 2014 CFR
...must allocate costs appropriately among its CMA grant, social services grant, and any other...identified by the Director, may be charged to the CMA grant. All other costs must be allocated among the CMA grant, social services grant, and any...
45 CFR 400.13 - Cost allocation.
Code of Federal Regulations, 2011 CFR
...must allocate costs appropriately among its CMA grant, social services grant, and any other...identified by the Director, may be charged to the CMA grant. All other costs must be allocated among the CMA grant, social services grant, and any...
Lobbying by Ethnic Groups and Aid Allocation
Sajal Lahiri; Pascalis Raimondos-Moller
We develop a political-economic model of foreign aid allocation. Each ethnic group in the donor country lobbies the government to allocate more aid to its country of origin, and the government accepts political contributions from lobby groups. Initial per-capita income of the recipients and those of the ethnic groups are shown to be important determinants of the solution of the
Barmah-Millewa forest environmental water allocation
G. Stewart; B. Harper
The formal allocation of water for the environment is a developing area of river management both scientifically and in terms of community participation. This case study, illustrating the recent use of the Barmah-Millewa Forest Environmental Water Allocation (EWA), provides a practical demonstration of community participation in environmental water management, the application of hydrological and biological \\
Allocation and Scheduling of Complex Periodic Tasks
Krithi Ramamritham
A static algorithm for allocating and scheduling components of complex periodic tasks across sites in distributed systems is discussed. Besides dealing with the periodicity constraints (which have been the sole concern of many previous algorithms), this algorithm handles precedence, communication, and fault-tolerance requirements of subtasks of the tasks. The algorithm determines the allocation of subtasks of periodic tasks to sites,
Distributed Coordination in Dynamic Spectrum Allocation Networks
Almeroth, Kevin C.
Distributed Coordination in Dynamic Spectrum Allocation Networks Jun Zhao Microsoft Research Asia, Beijing, P.R.China firstname.lastname@example.com Haitao Zheng Univ. of California, Santa Barbara, U.S.A htzheng To eliminate interference, historic (and current) spectrum policies allocate fixed spectrum slices to each
Solvable stochastic dealer models for financial markets
NASA Astrophysics Data System (ADS)
Yamada, Kenta; Takayasu, Hideki; Ito, Takatoshi; Takayasu, Misako
We introduce solvable stochastic dealer models, which can reproduce basic empirical laws of financial markets such as the power law of price change. Starting from the simplest model that is almost equivalent to a Poisson random noise generator, the model becomes fairly realistic by adding only two effects: the self-modulation of transaction intervals and a forecasting tendency, which uses a moving average of the latest market price changes. Based on the present microscopic model of markets, we find a quantitative relation with market potential forces, which have recently been discovered in the study of market price modeling based on random walks.
Carbon allocation and accumulation in conifers
Gower, S.T.; Isebrands, J.G.; Sheriff, D.W.
Forests cover approximately 33% of the land surface of the earth, yet they are responsible for 65% of the annual carbon (C) accumulated by all terrestrial biomes. In general, total C content and net primary production rates are greater for forests than for other biomes, but C budgets differ greatly among forests. Despite several decades of research on forest C budgets, there is still an incomplete understanding of the factors controlling C allocation. Yet, if we are to understand how changing global events such as land use, climate change, atmospheric N deposition, ozone, and elevated atmospheric CO{sub 2} affect the global C budget, a mechanistic understanding of C assimilation, partitioning, and allocation is necessary. The objective of this chapter is to review the major factors that influence C allocation and accumulation in conifer trees and forests. In keeping with the theme of this book, we will focus primarily on evergreen conifers. However, even among evergreen conifers, leaf, canopy, and stand-level C and nutrient allocation patterns differ, often as a function of leaf development and longevity. The terminology related to C allocation literature is often inconsistent, confusing and inadequate for understanding and integrating past and current research. For example, terms often used synonymously to describe C flow or movement include translocation, transport, distribution, allocation, partitioning, apportionment, and biomass allocation. A common terminology is needed because different terms have different meanings to readers. In this paper we use C allocation, partitioning, and accumulation according to the definitions of Dickson and Isebrands (1993). Partitioning is the process of C flow into and among different chemical, storage, and transport pools. Allocation is the distribution of C to different plant parts within the plant (i.e., source to sink). Accumulation is the end product of the process of C allocation.
Estanislao Herscovich; Pablo Minces; Carmen Nunez
Correlation functions of one unit spectral flowed states in string theory on AdS_3 are considered. We present the modified Knizhnik-Zamolodchikov and null vector equations to be satisfied by amplitudes containing states in winding sector one and study their solution corresponding to the four point function including one w=1 field. We compute the three point function involving two one unit spectral flowed operators and find expressions for amplitudes of three w=1 states satisfying certain particular relations among the spins of the fields. Several consistency checks are performed.
Dionysios Anninos; Wei Li; Megha Padi; Wei Song; Andrew Strominger
Three dimensional topologically massive gravity (TMG) with a negative\\u000acosmological constant -\\\\ell^{-2} and positive Newton constant G admits an AdS_3\\u000avacuum solution for any value of the graviton mass \\\\mu. These are all known to\\u000abe perturbatively unstable except at the recently explored chiral point\\u000a\\\\mu\\\\ell=1. However we show herein that for every value of \\\\mu\\\\ell< 3 there are\\u000atwo
Stochastic Optimization for Machine Learning
Powell, Warren B.
Stochastic Optimization for Machine Learning ICML 2010, Haifa, Israel Tutorial by Nati Srebro Descent: formulation, analysis and use in machine learning · Learn about extensions and generalizations, and their Machine Learning counterparts Main Goal: Machine Learning is Stochastic Optimization #12;Outline
NSDL National Science Digital Library
Doyle, Kim.
Webreference.com (discussed in the April 19, 1996 Scout Report) has recently added this interesting and thought-provoking resource to its site. The resource presents the results of a study of banner ad placement at webreference.com, conducted between March 25 and April 15, 1997 by three University of Michigan School of Business Administration students. The study concludes that changes in placement of banner ads affects "click-through" rates.
Chapman, Michael S.
p Presenter... ask you to re nter is software reate Flash m nt that can b ter software roducts Technology Phone: (503) 494-7074 email@example.com Adding Narration, cont. Note: If slides have animations to start recording on the first level · Click the "Next Animation" button to advance to the next level
Stochastic cooling at Fermilab
Marriner, J.
The topics discussed are the stochastic cooling systems in use at Fermilab and some of the techniques that have been employed to meet the particular requirements of the anti-proton source. Stochastic cooling at Fermilab became of paramount importance about 5 years ago when the anti-proton source group at Fermilab abandoned the electron cooling ring in favor of a high flux anti-proton source which relied solely on stochastic cooling to achieve the phase space densities necessary for colliding proton and anti-proton beams. The Fermilab systems have constituted a substantial advance in the techniques of cooling including: large pickup arrays operating at microwave frequencies, extensive use of cryogenic techniques to reduce thermal noise, super-conducting notch filters, and the development of tools for controlling and for accurately phasing the system.
Basic stochastic simulation: Stochastic simulation algorithm
NSDL National Science Digital Library
David Liao
The stochastic simulation algorithm (SSA, Kinetic Monte Carlo, Gillespie algorithm) produces an example trajectory for a particular member of a probabilistic ensemble by looping over the following steps. The current state of the system is used to determine the likelihood of each possible chemical reaction in relative comparison to the likelihoods for the other possible reactions, as well as to determine when the next reaction is expected. Pseudo-random numbers are drawn to "roll the dice" to determine exactly when the next reaction will proceed, and which kind of reaction it will happen to be.
Zaikin; Kurths; Schimansky-Geier
We report the effect of doubly stochastic resonance which appears in nonlinear extended systems if the influence of noise is twofold: A multiplicative noise induces bimodality of the mean field of the coupled network and an independent additive noise governs the dynamic behavior in response to small periodic driving. For optimally selected values of the additive noise intensity stochastic resonance is observed, which is manifested by a maximal coherence between the dynamics of the mean field and the periodic input. Numerical simulations of the signal-to-noise ratio and theoretical results from an effective two state model are in good quantitative agreement. PMID:10991250
Stochasticity, a first introduction
NSDL National Science Digital Library
Even when we model the dynamics of the abundances of molecules inside biological systems using calculus, it is important to remember that underlying behavior can be apparently random ("stochastic"). Even a deterministic system containing components moving in periodic ways can, at early times, support dynamics that appear disordered. The behavior of systems containing complicated collections of interacting parts can be difficult to predict with accuracy (chaos). Finally, systems can display stochasticity because the outcomes of measurements on quantum systems are indeterminate in a fundamental way. Random processes are modeled using Markov models.
HF interference mitigation using STAP with dynamic degrees of freedom allocation
David A. Holdsworth; Guiseppe A. Fabrizio
A variation of space-time adaptive processing (STAP) allowing dynamic allocation of spatial and range (fast time) degrees of freedom on a beam-by-beam basis is introduced. This technique tailors the adaptive processing to the prevailing interference characteristics within each beam, making use of both spatial and range adaptive processing. An added benefit is that the algorithm also takes finite sample support
Some Notes on the Dynamics and Optimal Control of Stochastic Pension Fund Models in Continuous Time
This paper discusses the modelling and control of pension funds. A continuous-time stochastic pension fund model is proposed in which there are n risky assets plus the risk-free asset as well as randomness in the level of benefit outgo. We consider Markov control strategies which optimise over the contribution rate and over the range of possible asset-allocation strategies. For a
Ehssan Sakhaee; Abbas Jamalipour; Nei Kato
There has been an enormous growth in mobile ad hoc networks (MANETs) in land based small to medium size networks with relatively strict power and resources. In this paper the concept of ad hoc networking between aircraft is introduced, which can be considered as a novel approach in increasing the data rate and practicality of future in-flight broadband Internet access.
Allocation Games: Addressing the Ill-Posed Nature of Allocation in Life-Cycle Inventories.
Hanes, Rebecca J; Cruze, Nathan B; Goel, Prem K; Bakshi, Bhavik R
Allocation is required when a life cycle contains multi-functional processes. One approach to allocation is to partition the embodied resources in proportion to a criterion, such as product mass or cost. Many practitioners apply multiple partitioning criteria to avoid choosing one arbitrarily. However, life cycle results from different allocation methods frequently contradict each other, making it difficult or impossible for the practitioner to draw any meaningful conclusions from the study. Using the matrix notation for life-cycle inventory data, we show that an inventory that requires allocation leads to an ill-posed problem: an inventory based on allocation is one of an infinite number of inventories that are highly dependent upon allocation methods. This insight is applied to comparative life-cycle assessment (LCA), in which products with the same function but different life cycles are compared. Recently, there have been several studies that applied multiple allocation methods and found that different products were preferred under different methods. We develop the Comprehensive Allocation Investigation Strategy (CAIS) to examine any given inventory under all possible allocation decisions, enabling us to detect comparisons that are not robust to allocation, even when the comparison appears robust under conventional partitioning methods. While CAIS does not solve the ill-posed problem, it provides a systematic way to parametrize and examine the effects of partitioning allocation. The practical usefulness of this approach is demonstrated with two case studies. The first compares ethanol produced from corn stover hydrolysis, corn stover gasification, and corn grain fermentation. This comparison was not robust to allocation. The second case study compares 1,3-propanediol (PDO) produced from fossil fuels and from biomass, which was found to be a robust comparison. PMID:26061700
Downlink resource allocation in multi-carrier systems: frequency-selective vs. equal power allocation
Hyang-won Lee; Song Chong
This paper revisits equal power allocation from the viewpoint of asymptotic network utility maximization (NUM) problem in multi-carrier systems. It is a well-known fact that the equal power allocation is near optimal to the sum capacity maximization problem in high SNR (signal-to-noise ratio) regime, i.e., optimal water-filling approximates to equal power allocation in that case. Due to this property together
Stochastic Engine Convergence Diagnostics
The stochastic engine uses a Markov Chain Monte Carlo (MCMC) sampling device to allow an analyst to construct a reasonable estimate of the state of nature that is consistent with observed data and modeling assumptions. The key engine output is a sample from the posterior distribution, which is the conditional probability distribution of the state of nature, given the data.
Tollestrup, A.V.; Dugan, G
Major headings in this review include: proton sources; antiproton production; antiproton sources and Liouville, the role of the Debuncher; transverse stochastic cooling, time domain; the accumulator; frequency domain; pickups and kickers; Fokker-Planck equation; calculation of constants in the Fokker-Planck equation; and beam feedback. (GHT)
Stochastic correlative learning algorithms
Simon Haykin; Zhe Chen; Suzanna Becker
This paper addresses stochastic correlative learning as the basis for a broadly defined class of statistical learning algorithms known collectively as the algorithm of pattern extraction (ALOPEX) family. Starting with the neurobiologically motivated Hebb's rule, the two conventional forms of the ALOPEX algorithm are derived, followed by a modified variant designed to improve the convergence speed. We next describe two
Balancing Stochastic Assembly Lines
N. Richard Reeve; Warren H. Thomas
This paper is concerned with balancing continuous assembly lines with stochastic work elements, The primary problem is defined as follows: "Given an initial balance, a cycle time, normally distributed work element times with given means and variances, and a precedence graph, rearrange the work elements such that the probability of one or more stations exceeding the cycle time is minimized."
Stochastic amplification in epidemics.
Alonso, David; McKane, Alan J; Pascual, Mercedes
The role of stochasticity and its interplay with nonlinearity are central current issues in studies of the complex population patterns observed in nature, including the pronounced oscillations of wildlife and infectious diseases. The dynamics of childhood diseases have provided influential case studies to develop and test mathematical models with practical application to epidemiology, but are also of general relevance to the central question of whether simple nonlinear systems can explain and predict the complex temporal and spatial patterns observed in nature outside laboratory conditions. Here, we present a stochastic theory for the major dynamical transitions in epidemics from regular to irregular cycles, which relies on the discrete nature of disease transmission and low spatial coupling. The full spectrum of stochastic fluctuations is derived analytically to show how the amplification of noise varies across these transitions. The changes in noise amplification and coherence appear robust to seasonal forcing, questioning the role of seasonality and its interplay with deterministic components of epidemiological models. Childhood diseases are shown to fall into regions of parameter space of high noise amplification. This type of "endogenous" stochastic resonance may be relevant to population oscillations in nonlinear ecological systems in general. PMID:17251128
Stochastic model for aerodynamic force dynamics on wind turbine blades in unsteady wind inflow
Luhur, Muhammad Ramzan; Kühn, Martin; Wächter, Matthias
The paper presents a stochastic approach to estimate the aerodynamic forces with local dynamics on wind turbine blades in unsteady wind inflow. This is done by integrating a stochastic model of lift and drag dynamics for an airfoil into the aerodynamic simulation software AeroDyn. The model is added as an alternative to the static table lookup approach in blade element momentum (BEM) wake model used by AeroDyn. The stochastic forces are obtained for a rotor blade element using full field turbulence simulated wind data input and compared with the classical BEM and dynamic stall models for identical conditions. The comparison shows that the stochastic model generates additional extended dynamic response in terms of local force fluctuations. Further, the comparison of statistics between the classical BEM, dynamic stall and stochastic models' results in terms of their increment probability density functions gives consistent results.
Control of stochastic resonance in bistable systems by using periodic signals
NASA Astrophysics Data System (ADS)
Lin, Min; Fang, Li-Min; Zheng, Yong-Jun
According to the characteristic structure of double wells in bistable systems, this paper analyses stochastic fluctuations in the single potential well and probability transitions between the two potential wells and proposes a method of controlling stochastic resonance by using a periodic signal. Results of theoretical analysis and numerical simulation show that the phenomenon of stochastic resonance happens when the time scales of the periodic signal and the noise-induced probability transitions between the two potential wells achieve stochastic synchronization. By adding a bistable system with a controllable periodic signal, fluctuations in the single potential well can be effectively controlled, thus affecting the probability transitions between the two potential wells. In this way, an effective control can be achieved which allows one to either enhance or realize stochastic resonance.
Title: Ontario Wind Power Allocation Ontario Ministry of Natural Resources
Title: Ontario Wind Power Allocation Data Creator / Copyright Owner: Ontario Ministry of Natural/A Updates: N/A Abstract: This data consists of a polygon shapefile, Wind Power Allocation Block. A Wind Power Allocation Block is an area that could be allocated for the exploration of wind power generation
A Memory Allocation Proler for C and Lisp Programs
Benjamin Zorn; Paul Hilnger
This paper describes mprof, a tool used to study the dynamic memory allocation behavior of programs. Mprof records the amount of memory that a function allocates, breaks down allocation information by type and size, and displays a program's dynamic call graph so that functions indirectly responsible for memory allocation are easy to identify. Mprof is a two-phase tool. The monitor
Optimal Time slot Allocation for Multi-user Wireless Networks
Bahk, Saewoong
Optimal Time slot Allocation for Multi-user Wireless Networks Neung-Hyung Lee, Keun Chul Hwang. These researches focused on the power allocation, but they did not consider time slot allocation which can be also used to improve the efficiency. In this paper, we introduce a time slot allocation problem for multi
Shadows, currents and AdS fields
R. R. Metsaev
Conformal totally symmetric arbitrary spin currents and shadow fields in flat space-time of dimension greater than or equal to four are studied. Gauge invariant formulation for such currents and shadow fields is developed. Gauge symmetries are realized by involving the Stueckelberg fields. Realization of global conformal boost symmetries is obtained. Gauge invariant differential constraints for currents and shadow fields are obtained. AdS/CFT correspondence for currents and shadow fields and the respective normalizable and non-normalizable solutions of massless totally symmetric arbitrary spin AdS fields is studied. The bulk fields are considered in modified de Donder gauge that leads to decoupled equations of motion. We demonstrate that leftover on-shell gauge symmetries of bulk fields correspond to gauge symmetries of boundary currents and shadow fields, while the modified de Donder gauge conditions for bulk fields correspond to differential constraints for boundary conformal currents and shadow fields. Breaking conformal symmetries, we find interrelations between the gauge invariant formulation of the currents and shadow fields and the gauge invariant formulation of massive fields.
10 CFR 490.503 - Credit allocation.
Code of Federal Regulations, 2013 CFR
...2013-01-01 2013-01-01 false Credit allocation. 490.503 Section 490.503 Energy DEPARTMENT OF ENERGY ENERGY CONSERVATION ALTERNATIVE FUEL TRANSPORTATION PROGRAM Alternative Fueled Vehicle Credit Program § 490.503...
10 CFR 490.503 - Credit allocation.
Code of Federal Regulations, 2012 CFR
...2012-01-01 2012-01-01 false Credit allocation. 490.503 Section 490.503 Energy DEPARTMENT OF ENERGY ENERGY CONSERVATION ALTERNATIVE FUEL TRANSPORTATION PROGRAM Alternative Fueled Vehicle Credit Program § 490.503...
10 CFR 490.503 - Credit allocation.
Code of Federal Regulations, 2014 CFR
...2014-01-01 2014-01-01 false Credit allocation. 490.503 Section 490.503 Energy DEPARTMENT OF ENERGY ENERGY CONSERVATION ALTERNATIVE FUEL TRANSPORTATION PROGRAM Alternative Fueled Vehicle Credit Program § 490.503...
10 CFR 490.503 - Credit allocation.
Code of Federal Regulations, 2010 CFR
...2010-01-01 2010-01-01 false Credit allocation. 490.503 Section 490.503 Energy DEPARTMENT OF ENERGY ENERGY CONSERVATION ALTERNATIVE FUEL TRANSPORTATION PROGRAM Alternative Fueled Vehicle Credit Program § 490.503...
10 CFR 490.503 - Credit allocation.
Code of Federal Regulations, 2011 CFR
...2011-01-01 2011-01-01 false Credit allocation. 490.503 Section 490.503 Energy DEPARTMENT OF ENERGY ENERGY CONSERVATION ALTERNATIVE FUEL TRANSPORTATION PROGRAM Alternative Fueled Vehicle Credit Program § 490.503...
Code of Federal Regulations, 2010 CFR
...2010-10-01 false Allocation. 5452.249 Section 5452.249 Federal Acquisition Regulations System DEFENSE LOGISTICS AGENCY, DEPARTMENT OF DEFENSE SOLICITATION PROVISIONS AND CONTRACT CLAUSES Texts of Provisions and Clauses...
Fund allocation using capacitated vehicle routing problem
NASA Astrophysics Data System (ADS)
Mamat, Nur Jumaadzan Zaleha; Jaaman, Saiful Hafizah; Ahmad, Rokiah Rozita; Darus, Maslina
In investment fund allocation, it is unwise for an investor to distribute his fund into several assets simultaneously due to economic reasons. One solution is to allocate the fund into a particular asset at a time in a sequence that will either maximize returns or minimize risks depending on the investor's objective. The vehicle routing problem (VRP) provides an avenue to this issue. VRP answers the question on how to efficiently use the available fleet of vehicles to meet a given service demand, subjected to a set of operational requirements. This paper proposes an idea of using capacitated vehicle routing problem (CVRP) to optimize investment fund allocation by employing data of selected stocks in the FTSE Bursa Malaysia. Results suggest that CRVP can be applied to solve the issue of investment fund allocation and increase the investor's profit.
Resource conservation and allocation via process integration
Harell, Dustin Ashley
Throughout the process industry, the conservation and allocation of mass and energy resources plays a pivotal role in the site wide optimization of a plant. Typically, raw materials are transformed into products, byproducts ...
Code of Federal Regulations, 2011 CFR
...2011-10-01 false Allocation. 5452.249 Section 5452.249 Federal Acquisition Regulations System DEFENSE LOGISTICS AGENCY, DEPARTMENT OF DEFENSE SOLICITATION PROVISIONS AND CONTRACT CLAUSES Texts of Provisions and Clauses...
Code of Federal Regulations, 2014 CFR
...2014-10-01 false Allocation. 5452.249 Section 5452.249 Federal Acquisition Regulations System DEFENSE LOGISTICS AGENCY, DEPARTMENT OF DEFENSE SOLICITATION PROVISIONS AND CONTRACT CLAUSES Texts of Provisions and Clauses...
Code of Federal Regulations, 2013 CFR
... 2012-10-01 true Allocation. 5452.249 Section 5452.249 Federal Acquisition Regulations System DEFENSE LOGISTICS AGENCY, DEPARTMENT OF DEFENSE SOLICITATION PROVISIONS AND CONTRACT CLAUSES Texts of Provisions and Clauses...
Code of Federal Regulations, 2012 CFR
...2012-10-01 false Allocation. 5452.249 Section 5452.249 Federal Acquisition Regulations System DEFENSE LOGISTICS AGENCY, DEPARTMENT OF DEFENSE SOLICITATION PROVISIONS AND CONTRACT CLAUSES Texts of Provisions and Clauses...
Adaptively Parallel Processor Allocation for Cilk Jobs
Sen, Siddhartha
The problem of allocating processor resources fairly and efficiently to parallel jobs has been studied extensively in the past. Most of this work, however, assumes that the instantaneous parallelism of the jobs is known ...
Essays on innovation, productivity, and talent allocation
Shu, Pian
This thesis contains three essays on innovation, productivity, and talent allocation. The first essay explores a novel channel through which short-term economic fluctuations affect the long-term innovative output of the ...
ORIGINAL PAPER Photosynthetic assimilation and carbohydrate allocation
Boyer, Edmond
ORIGINAL PAPER Photosynthetic assimilation and carbohydrate allocation of Quercus rubra seedlings increases in biomass and total non- structural carbohydrates (TNC), stock type differences to herbivory- mental. Keywords Animal browse . Northern red oak . Non-structural carbohydrates . Planting stock types
Lexicographic Bit Allocation for MPEG Video
Hoang, Dzung T.; Linzer, Elliot L.; Vitter, Jeffrey Scott
We consider the problem of allocating bits among pictures in an MPEG video coder to equalize the visual quality of the coded pictures, while meeting bu er and channel constraints imposed by the MPEG Video Bu ering Veri er. ...
24 CFR 945.203 - Allocation plan.
Code of Federal Regulations, 2010 CFR
...vacant because there had not been a demand for dwellings of that size in...update of the allocation plan data, and projections for the next...operated by the PHA, using the data obtained from the system developed in §...
Control Allocation with Load Balancing
NASA Technical Reports Server (NTRS)
Bodson, Marc; Frost, Susan A.
Next generation aircraft with a large number of actuators will require advanced control allocation methods to compute the actuator commands needed to follow desired trajectories while respecting system constraints. Previously, algorithms were proposed to minimize the l1 or l2 norms of the tracking error and of the actuator deflections. The paper discusses the alternative choice of the l(infinity) norm, or sup norm. Minimization of the control effort translates into the minimization of the maximum actuator deflection (min-max optimization). The paper shows how the problem can be solved effectively by converting it into a linear program and solving it using a simplex algorithm. Properties of the algorithm are also investigated through examples. In particular, the min-max criterion results in a type of load balancing, where the load is th desired command and the algorithm balances this load among various actuators. The solution using the l(infinity) norm also results in better robustness to failures and to lower sensitivity to nonlinearities in illustrative examples.
Bit allocation and encoding for vector sources
A. Segall
This paper considers the problem of efficient transmission of vector sources over a digital noiseless channel. It treats the problem of optimal allocation of the total number of available bits to the components of a memoryless stationary vector source with independent components. This allocation is applied to various encoding schemes, such as minimum mean-square error, sample-by-sample quantization, or entropy quantization.
Optimality versus stability in water resource allocation.
Read, Laura; Madani, Kaveh; Inanloo, Bahareh
Water allocation is a growing concern in a developing world where limited resources like fresh water are in greater demand by more parties. Negotiations over allocations often involve multiple groups with disparate social, economic, and political status and needs, who are seeking a management solution for a wide range of demands. Optimization techniques for identifying the Pareto-optimal (social planner solution) to multi-criteria multi-participant problems are commonly implemented, although often reaching agreement for this solution is difficult. In negotiations with multiple-decision makers, parties who base decisions on individual rationality may find the social planner solution to be unfair, thus creating a need to evaluate the willingness to cooperate and practicality of a cooperative allocation solution, i.e., the solution's stability. This paper suggests seeking solutions for multi-participant resource allocation problems through an economics-based power index allocation method. This method can inform on allocation schemes that quantify a party's willingness to participate in a negotiation rather than opt for no agreement. Through comparison of the suggested method with a range of distance-based multi-criteria decision making rules, namely, least squares, MAXIMIN, MINIMAX, and compromise programming, this paper shows that optimality and stability can produce different allocation solutions. The mismatch between the socially-optimal alternative and the most stable alternative can potentially result in parties leaving the negotiation as they may be too dissatisfied with their resource share. This finding has important policy implications as it justifies why stakeholders may not accept the socially optimal solution in practice, and underlies the necessity of considering stability where it may be more appropriate to give up an unstable Pareto-optimal solution for an inferior stable one. Authors suggest assessing the stability of an allocation solution as an additional component to an analysis that seeks to distribute water in a negotiated process. PMID:24412983
Intra-daily FX optimal portfolio allocation
Luc BAUWENS; Walid BEN OMRANE; Erick RENGIFO
We design and implement optimal foreign exchange portfolio allocations. An optimal allocation maximizes the expected return sub ject to a Value-at-Risk (VaR) constraint. Based on intradaily data, the optimization procedure is carried out at regular time intervals. For the estimation of the conditional variance from which the VaR is computed, we use univariate and multivariate GARCH models. The result for
Solution techniques for some allocation problems
A. Federgruen; P. Zipkin
This paper presents methods for solving allocation problems that can be stated as convex knapsack problems with generalized\\u000a upper bounds. Such bounds may express upper limits on the total amount allocated to each of several subsets of activities.\\u000a In addition our model arises as a subproblem in more complex mathematical programs. We therefore emphasize efficient procedures\\u000a to recover optimality when
Thinking Twice about Second-Price Ad Auctions
Azar, Yossi; Karlin, Anna R; Nguyen, C Thach
Recent work has addressed the algorithmic problem of allocating advertisement space for keywords in sponsored search auctions so as to maximize revenue, most of which assume that pricing is done via a first-price auction. This does not realistically model the Generalized Second Price (GSP) auction used in practice, in which bidders pay the next-highest bid for keywords that they are allocated. Towards the goal of more realistically modeling these auctions, we introduce the Second-Price Ad Auctions problem, in which bidders' payments are determined by the GSP mechanism. We show that the complexity of the Second-Price Ad Auctions problem is quite different than that of the more studied First-Price Ad Auctions problem. First, unlike the first-price variant, for which small constant-factor approximations are known, it is NP-hard to approximate the Second-Price Ad Auctions problem to any non-trivial factor, even when the bids are small compared to the budgets. Second, this discrepancy extends even to the 0-1 speci...
Ultimate open pit stochastic optimization
NASA Astrophysics Data System (ADS)
Marcotte, Denis; Caron, Josiane
Classical open pit optimization (maximum closure problem) is made on block estimates, without directly considering the block grades uncertainty. We propose an alternative approach of stochastic optimization. The stochastic optimization is taken as the optimal pit computed on the block expected profits, rather than expected grades, computed from a series of conditional simulations. The stochastic optimization generates, by construction, larger ore and waste tonnages than the classical optimization. Contrary to the classical approach, the stochastic optimization is conditionally unbiased for the realized profit given the predicted profit. A series of simulated deposits with different variograms are used to compare the stochastic approach, the classical approach and the simulated approach that maximizes expected profit among simulated designs. Profits obtained with the stochastic optimization are generally larger than the classical or simulated pit. The main factor controlling the relative gain of stochastic optimization compared to classical approach and simulated pit is shown to be the information level as measured by the boreholes spacing/range ratio. The relative gains of the stochastic approach over the classical approach increase with the treatment costs but decrease with mining costs. The relative gains of the stochastic approach over the simulated pit approach increase both with the treatment and mining costs. At early stages of an open pit project, when uncertainty is large, the stochastic optimization approach appears preferable to the classical approach or the simulated pit approach for fair comparison of the values of alternative projects and for the initial design and planning of the open pit.
Improved Stochastic Transport Modeling for DIII-D
I. Joseph; R. A. Moyer; T. E. Evans; T. H. Osborne; M. J. Schaffer; A. Runov; R. Schneider; S. V. Kasilov; M. E. Fenstermacher; M. Groth; C. J. Lasnier; G. D. Porter
The E3D two-fluid code is used to model the effect of resonant magnetic perturbations (RMPs) on DIII-D pedestal and SOL particle and thermal transport. E3D uses Monte Carlo integration to accurately compute the stochastically enhanced perpendicular transport caused by the 3D magnetic geometry. Progress has been made in adding parallel momentum balance and in efforts to use anomalous particle and
Experimental observation of stochastic resonance in a magnetoelastic ribbon
M. L. Spano; M. Wun-Fogle; W. L. Ditto
We report the observation of stochastic resonance in a parametrically driven bistable magnetoelastic buckling-ribbon experiment. We have found that the parametric addition of white noise increases the signal-to-noise ratio of the response of the ribbon by 10 to 12 dB relative to that of the ribbon with no externally added noise. We have also observed a characteristic spectrum for the
Oscillatory stability limit prediction using stochastic subspace identification
H. Ghasemi; C. A. Canizares; A. Moshref
Determining stability limits and maximum loading margins in a power system is important and can be of significant help for system operators for preventing stability problems. In this paper, stochastic subspace identification is employed to extract the critical mode(s) from the measured ambient noise without requiring artificial disturbances (e.g., line outages, generator tripping, and adding\\/removing loads), so that the identified
Stochastic resonance in psychophysics and in animal behavior.
Ward, Lawrence M; Neiman, Alexander; Moss, Frank
A recent analysis of the energy detector model in sensory psychophysics concluded that stochastic resonance does not occur in a measure of signal detectability ( d'), but can occur in a percent-correct measure of performance as an epiphenomenon of nonoptimal criterion placement [Tougaard (2000) Biol Cybern 83: 471-480]. When generalized to signal detection in sensory systems in general, this conclusion is a serious challenge to the idea that stochastic resonance could play a significant role in sensory processing in humans and other animals. It also seems to be inconsistent with recent demonstrations of stochastic resonance in sensory systems of both nonhuman animals and humans using measures of system performance such as signal-to-noise ratio of power spectral densities and percent-correct detections in a two-interval forced-choice paradigm, both closely related to d'. In this paper we address this apparent dilemma by discussing several models of how stochastic resonance can arise in signal detection systems, including especially those that implement a "soft threshold" at the input transform stage. One example involves redefining d' for energy increments in terms of parameters of the spike-count distribution of FitzHugh-Nagumo neurons. Another involves a Poisson spike generator that receives an exponentially transformed noisy periodic signal. In this case it can be shown that the signal-to-noise ratio of the power spectral density at the signal frequency, which exhibits stochastic resonance, is proportional to d'. Finally, a variant of d' is shown to exhibit stochastic resonance when calculated directly from the distributions of power spectral densities at the signal frequency resulting from transformation of noise alone and a noisy signal by a sufficiently steep nonlinear response function. All of these examples, and others from the literature, imply that stochastic resonance is more than an epiphenomenon, although significant limitations to the extent to which adding noise can aid detection do exist. PMID:12181585
Aggregated Stochastic State Classes in Quantitative Evaluation of non-Markovian Stochastic Petri Nets
Horváth, András
Terms--non-Markovian stochastic Petri nets, stochastic time Petri nets, steady state analysis of stochastic state classes provides a new approach for the analysis of non-Markovian stochastic Petri Nets, stochastic state classes. I. INTRODUCTION Non-Markovian stochastic Petri nets enable representation of models
Stochastic Broadcast for VANET
Michael Slavik; Imad Mahgoub
Vehicular ad-hoc networks (VANETs) are an emerging important type of wireless ad-hoc network. Unlike many other types of MANETs, VANET applications such as traffic data dissemination are inherently broadcast oriented and require communication protocols to be anonymous and scalable. Simple broadcast flooding satisfies these requirements, but its performance is highly dependent on network density and may lead to the broadcast
Criteria for Car Parking Allocation System Criteria for Car Parking Allocation System
Mottram, Nigel
Criteria for Car Parking Allocation System Criteria for Car Parking Allocation System 2014-15 Criteria for Car Parking All #12;The issue and control of car parking permits is vested in Estates Services. The annual charges are incorporated in the application form. The car parking charges will be deducted from
An Analysis and Allocation System for Library Collections Budgets: The Comprehensive Allocation Process (CAP)
ERIC Educational Resources Information Center
Lyons, Lucy Eleonore; Blosser, John
The "Comprehensive Allocation Process" (CAP) is a reproducible decision-making structure for the allocation of new collections funds, for the reallocation of funds within stagnant budgets, and for budget cuts in the face of reduced funding levels. This system was designed to overcome common shortcomings of current methods. Its philosophical…
Energetics of stochastic resonance
NASA Astrophysics Data System (ADS)
Jung, Peter; Marchesoni, Fabio
In this paper, we discuss the motion of a Brownian particle in a double-well potential driven by a periodic force in terms of energies delivered by the periodic and the noise forces and energy dissipated into the viscous environment. It is shown that, while the power delivered by the periodic force to the Brownian particle is controlled by the strength of the noise, the power delivered by the noise itself is independent of the amplitude and frequency of the periodic force. The implications of this result for the mechanism of stochastic resonance in an equilibrium system is that it is not energy from the noise force which enhances a small periodic force, but rather an increase of energy delivered by the periodic force, regulated by the strength of the noise. We further re-evaluate the frequency dependence of stochastic resonance in terms of energetic terms including efficiency.
Double entropic stochastic resonance
NASA Astrophysics Data System (ADS)
Burada, P. S.; Schmid, G.; Reguera, D.; Rubi, J. M.; Hänggi, P.
We demonstrate the appearance of a purely entropic stochastic resonance (ESR) occurring in a geometrically confined system, where the irregular boundaries cause entropic barriers. The interplay between a periodic input signal, a constant bias and intrinsic thermal noise leads to a resonant ESR phenomenon in which feeble signals become amplified. This new phenomenon is characterized by the presence of two peaks in the spectral amplification at corresponding optimal values of the noise strength. The main peak is associated with the manifest stochastic resonance synchronization mechanism involving the inter-well noise-activated dynamics while a second peak relates to a regime of optimal sensitivity for intra-well dynamics. The nature of ESR, occurring when the origin of the barrier is entropic rather than energetic, offers new perspectives for novel investigations and potential applications. ESR by itself presents yet another case where one constructively can harvest noise in driven nonequilibrium systems.
NASA Astrophysics Data System (ADS)
Abdullaev, S. S.
In many Hamiltonian systems subjected to a time (or space) -periodic perturbation with a broad spectrum an approach is widely used of replacing the system by periodically ? -kicked dynamical systems, which allows us to reduce them to symplectic mappings. In this paper it is shown that this approach has a fundamental failure, and the corresponding mapping does not correctly describe the continuous original system. It is demonstrated on the example of the stochastic web map obtained by this approach to describe a periodically driven harmonic oscillator which exhibits non-Kolmogorov—Arnold—Moser chaos, particularly, the formation of stochastic webs. A correct canonical map corresponding to this system is obtained using a recently developed method based on the canonical transformation of variables [S. S. Abdullaev, J. Phys. A 35, 2811 (2002)]. Using a direct numerical integration of the system it is shown that the canonical map correctly describes the periodically driven harmonic oscillator with a finite number of spectrum modes.
Emittance growth due to Intra-Beam Scattering significantly reduces the heavy ion luminosity lifetime in RHIC. Stochastic cooling of the stored beam could improve things considerably by counteracting IBS and preventing particles from escaping the rf bucket [1]. High frequency bunched-beam stochastic cooling is especially challenging but observations of Schottky signals in the 4-8 GHz band indicate that conditions are favorable in RHIC [2]. We report here on measurements of the longitudinal beam transfer function carried out with a pickup kicker pair on loan from FNAL TEVATRON. Results imply that for ions a coasting beam description is applicable and we outline some general features of a viable momentum cooling system for RHIC.
Energetics of stochastic resonance.
Jung, Peter; Marchesoni, Fabio
In this paper, we discuss the motion of a Brownian particle in a double-well potential driven by a periodic force in terms of energies delivered by the periodic and the noise forces and energy dissipated into the viscous environment. It is shown that, while the power delivered by the periodic force to the Brownian particle is controlled by the strength of the noise, the power delivered by the noise itself is independent of the amplitude and frequency of the periodic force. The implications of this result for the mechanism of stochastic resonance in an equilibrium system is that it is not energy from the noise force which enhances a small periodic force, but rather an increase of energy delivered by the periodic force, regulated by the strength of the noise. We further re-evaluate the frequency dependence of stochastic resonance in terms of energetic terms including efficiency. PMID:22225390
Samuelson, Paul A.
Because a commodity like wheat can be carried forward from one period to the next, speculative arbitrage serves to link its prices at different points of time. Since, however, the size of the harvest depends on complicated probability processes impossible to forecast with certainty, the minimal model for understanding market behavior must involve stochastic processes. The present study, on the basis of the axiom that it is the expected rather than the known-for-certain prices which enter into all arbitrage relations and carryover decisions, determines the behavior of price as the solution to a stochastic-dynamic-programming problem. The resulting stationary time series possesses an ergodic state and normative properties like those often observed for real-world bourses. PMID:16591903
Dorogovtsev, Andrei A [Institute of Mathematics of Ukrainian National Academy of Sciences, Kiev (Ukraine)
For sets in a Hilbert space the concept of quadratic entropy is introduced. It is shown that this entropy is finite for the range of a stochastic flow of Brownian particles on R. This implies, in particular, the fact that the total time of the free travel in the Arratia flow of all particles that started from a bounded interval is finite. Bibliography: 10 titles.
A retrodictive stochastic simulation algorithm
Vaughan, T.G. [Centre for Atom Optics and Ultrafast Spectroscopy, Swinburne University of Technology, Melbourne VIC 3122 (Australia)], E-mail: email@example.com; Drummond, P.D. [Centre for Atom Optics and Ultrafast Spectroscopy, Swinburne University of Technology, Melbourne VIC 3122 (Australia); Drummond, A.J. [Department of Computer Science, University of Auckland, Private Bag 92019, Auckland 1142 (New Zealand)
In this paper we describe a simple method for inferring the initial states of systems evolving stochastically according to master equations, given knowledge of the final states. This is achieved through the use of a retrodictive stochastic simulation algorithm which complements the usual predictive stochastic simulation approach. We demonstrate the utility of this new algorithm by applying it to example problems, including the derivation of likely ancestral states of a gene sequence given a Markovian model of genetic mutation.
Resource allocation, hyperphagia and compensatory growth.
Gurney, William S C; Nisbet, Roger M
Organisms often shown enhanced growth during recovery from starvation, and can even overtake continuously fed conspecifics (overcompensation). In an earlier paper (Ecology 84, 2777-2787), we studied the relative role played by hyperphagia and resource allocation in producing overcompensation in juvenile (non-reproductive) animals. We found that, although hyperphagia always produces growth compensation, overcompensation additionally requires protein allocation control which routes assimilate preferentially to structure during recovery. In this paper we extend our model to cover reproductively active individuals and demonstrate that growth rate overcompensation requires a similar combination of hyperphagia and allocation control which routes the part of enhanced assimilation not used for reproduction preferentially towards structural growth. We compare the properties of our dynamic energy budget model with an earlier proposal, due to Kooijman, which we extend to include hyperphagia. This formulation assumes that the rate of allocation to reserves is controlled by instantaneous feeding rate, and one would thus expect that an extension to include hyperphagia would not predict growth overcompensation. However, we show that a self-consistent representation of the hyperphagic response in Kooijman's model overrides its fundamental dynamics, leading to preferential allocation to structural growth during recovery and hence to growth overcompensation. PMID:15522353
Nick Evans; James French; Kristan Jensen; Ed Threlfall
We describe hadronization events, using the AdS/CFT Correspondence, which display many of the qualitative features expected in QCD. In particular we study the motion of strings with separating end points in a back-reacted hard wall geometry. The solutions show the development of a linear QCD-like string. The end points oscillate in the absence of string breaking. We introduce string breaking by hand and evolve the new state forward in time to observe the separation of two string segments. A kink associated with this breaking evolves to the end points of the string inducing rho meson production. We explicitly compute the rho meson production at the end point.
Evans, Nick; French, James; Threlfall, Ed [School of Physics and Astronomy, University of Southampton, Southampton, SO17 1BJ (United Kingdom); Jensen, Kristan [Department of Physics, University of Washington, Seattle, Washington 98195 (United States)
We describe hadronization events, using the AdS/CFT Correspondence, which display many of the qualitative features expected in QCD. In particular we study the motion of strings with separating end points in a back-reacted hard wall geometry. The solutions show the development of a linear QCD-like string. The end points oscillate in the absence of string breaking. We introduce string breaking by hand and evolve the new state forward in time to observe the separation of two string segments. A kink associated with this breaking evolves to the end points of the string inducing rho meson production. We explicitly compute the rho meson production at the end point.
Evolution of longevity through optimal resource allocation
Cicho?, M.
Models of life history evolution predict optimal traits of a simplified organism under various environmental conditions, but they at most acknowledge the existence of ageing. On the other hand, genetic models of ageing do not consider the effects of ageing on life histroy traits other than fecundity and longevity. This paper reports the results of a dynamic programming model which optimizes resource allocation to growth, reproduction and somatic repair. A low extrinsic (environmentally caused) mortality rate and high repair efficiency promote allocation to repair, especially early in life, resulting in delayed ageing and low growth rates, delayed maturity, large body size and dramatic enhancement of survival and maximum lifespan. The results are generally consistent with field, comprative and experimental data. They also suggest that the relationships between maximum lifespan and age at maturity and body size observed in nature may be by-products of optimal allocation strategies.
Biomass Resource Allocation among Competing End Uses
Newes, E.; Bush, B.; Inman, D.; Lin, Y.; Mai, T.; Martinez, A.; Mulcahy, D.; Short, W.; Simpkins, T.; Uriarte, C.; Peck, C.
The Biomass Scenario Model (BSM) is a system dynamics model developed by the U.S. Department of Energy as a tool to better understand the interaction of complex policies and their potential effects on the biofuels industry in the United States. However, it does not currently have the capability to account for allocation of biomass resources among the various end uses, which limits its utilization in analysis of policies that target biomass uses outside the biofuels industry. This report provides a more holistic understanding of the dynamics surrounding the allocation of biomass among uses that include traditional use, wood pellet exports, bio-based products and bioproducts, biopower, and biofuels by (1) highlighting the methods used in existing models' treatments of competition for biomass resources; (2) identifying coverage and gaps in industry data regarding the competing end uses; and (3) exploring options for developing models of biomass allocation that could be integrated with the BSM to actively exchange and incorporate relevant information.
Distributed Resource Allocation for Epidemic control
Enyioha, Chinwendu; Preciado, Victor; Pappas, George J
We present a distributed resource allocation strategy to control an epidemic outbreak in a networked population based on a Distributed Alternating Direction Method of Multipliers (D-ADMM) algorithm. We consider a linearized Susceptible- Infected-Susceptible (SIS) epidemic spreading model in which agents in the network are able to allocate vaccination resources (for prevention) and antidotes (for treatment) in the presence of a contagion. We express our epidemic control condition as a spectral constraint involving the Perron-Frobenius eigenvalue, and formulate the resource allocation problem as a Geometric Program (GP). Next, we separate the network-wide optimization problem into subproblems optimally solved by each agent in a fully distributed way. We conclude the paper by illustrating performance of our solution framework with numerical simulations.
Totally Unimodular Stochastic Programs
School of Industrial and Systems Engineering, Georgia Institute of Technology ... vector in IRn2 , hk is a vector in IRm, Tk, the technology matrix, is a matrix in ..... based on adding linear cutting planes to build outer approximations of the ...
Stochastic dynamics: A review of stochastic calculus of variations
J. C. Zambrini
We present the main results of a variational calculus for Markovian stochastic processes which allows us to characterize the dynamics of probabilistic systems by extremal properties for some functionals of processes. They generalize, by construction, the main variational formulations of classical dynamics. This framework is used for the dynamical analysis of Nelson's stochastic mechanics, an approach to quantum mechanics in
Pulsating strings on (AdS3 × S3) ?
NASA Astrophysics Data System (ADS)
Panigrahi, Kamal L.; Pradhan, Pabitra M.; Samal, Manoranjan
We derive the energy of pulsating strings as a function of adiabatic invariant oscillation number, which oscillates in S {/? 2}. We find similar solutions for the strings oscillating in deformed AdS 3. Furthermore, we generalize the result of the oscillating strings in anti-de Sitter space in the presence of extra angular momentum in ( AdS 3 × S 1) ? .
Nonparametric Bayes Stochastically Ordered Latent Class Models
Yang, Hongxia; O'Brien, Sean; Dunson, David B.
Latent class models (LCMs) are used increasingly for addressing a broad variety of problems, including sparse modeling of multivariate and longitudinal data, model-based clustering, and flexible inferences on predictor effects. Typical frequentist LCMs require estimation of a single finite number of classes, which does not increase with the sample size, and have a well-known sensitivity to parametric assumptions on the distributions within a class. Bayesian nonparametric methods have been developed to allow an infinite number of classes in the general population, with the number represented in a sample increasing with sample size. In this article, we propose a new nonparametric Bayes model that allows predictors to flexibly impact the allocation to latent classes, while limiting sensitivity to parametric assumptions by allowing class-specific distributions to be unknown subject to a stochastic ordering constraint. An efficient MCMC algorithm is developed for posterior computation. The methods are validated using simulation studies and applied to the problem of ranking medical procedures in terms of the distribution of patient morbidity. PMID:22505787
Two Virasoro symmetries in stringy warped AdS3
NASA Astrophysics Data System (ADS)
Compčre, Geoffrey; Guica, Monica; Rodriguez, Maria J.
We study three-dimensional consistent truncations of type IIB supergravity which admit warped AdS3 solutions. These theories contain subsectors that have no bulk dynamics. We show that the symplectic form for these theories, when restricted to the non-dynamical subsectors, equals the symplectic form for pure Einstein gravity in AdS3. Consequently, for each consistent choice of boundary conditions in AdS3, we can define a consistent phase space in warped AdS3 with identical conserved charges. This way, we easily obtain a Virasoro × Virasoro asymptotic symmetry algebra in warped AdS3; two different types of Virasoro × Ka?-Moody symmetries are also consistent alternatives.
Efficient Computation of Stochastic Complexity
Petri Kontkanen; Wray Buntine; Petri Myllymaki; Jorma Rissanen; Henry Tirri
Stochastic complexity of a data set is defined as the shortest possible code length for the data ob- tainable by using some fixed set of models. This measure is of great theoretical and practical im- portance as a tool for tasks such as model selec- tion or data clustering. Unfortunately, comput- ing the modern version of stochastic complexity, defined as
N. Cufaro-Petroni; S. De Martino; F. Illuminati
The methods of stochastic control theory are proposed in the context of charged-particle beam dynamics. The stochastic dynamics that is introduced here is invariant for time reversal and can be easily recast in the form of a Schrodinger-like equation where Planck's constant is re- placed by the beam emittance. It changes a bilinear control problem for Schrodinger equation in a
Stochastics In Circumplanetary Dust Dynamics
F. Spahn; A. V. Krivov; M. Sremcevic; U. Schwarz; J. Kurths
Charged dust grains in circumplanetary environments experience, beyond various de- terministic forces, also stochastic perturbations: E.g., fluctuations of the magnetic field, the charge of the grains etc. Here, we investigate the dynamics of a dust population in a circular orbit around the planet which is perturbed by a stochastic magnetic field B , modeled by an isotropi- cally Gaussian white
Stochastic Volatility in DSGE models
Giorgio Primiceri; Alejandro Justiniano
A number of recent papers have concluded that stochastic volatility plays a prominent role in describing the business cycle, particularly for the characterization of monetary policy. The impact of including stochastic volatility in DSGE models remains, however, unexplored. This paper therefore deals with the estimation of DSGE models when structural innovations have volatilities that are allowed to vary over time.
Carlos de Morais Cordeiro; Dharma P. Agrawal
Recent advances in portable computing and wireless technologies are opening up exciting possibilities for the future of wireless mobile networking. A Mobile Ad hoc NETwork (MANET) consists of mobile platforms which are free to move arbitrarily. This is in contrast with the topology of the existing Internet, where the router topology is essentially static (barring network configuration or router failures).
Stochastic Theory of Relativistic Quantum Mechanics
Maurice Godart
The stochastic theory of relativistic quantum mechanics presented here is modelled on the one that has been proposed previously and that was claimed to be a promising substitute to the orthodox theory in the non-relativistic domain. So it also relies heavily upon the theory of stochastic processes, with its definitions, theorems and specific vocabulary as well. Its main hypothesis states indeed that the classical trajectories of the particles are identical to the sample functions of a diffusion Markov process, whose conditional probability density is proposed as a substitute for the wave function. Along the way, we introduce ad hoc hypotheses for the sole reason that they facilitate and even make possible the further development of the theory. These and the so-called Nelson equations are used to determine the drift vectors and the diffusion tensor characteristic of such a process. It is then possible to write down the Fokker-Planck and Kolmogorov equations that can be used to determine the normal and conditional probability densities. This logical sequence of steps leads to the solution of specific problems and we apply it to the special case of the free particle.
Estimating parameters in stochastic systems: A variational Bayesian approach
NASA Astrophysics Data System (ADS)
Vrettas, Michail D.; Cornford, Dan; Opper, Manfred
This work is concerned with approximate inference in dynamical systems, from a variational Bayesian perspective. When modelling real world dynamical systems, stochastic differential equations appear as a natural choice, mainly because of their ability to model the noise of the system by adding a variation of some stochastic process to the deterministic dynamics. Hence, inference in such processes has drawn much attention. Here a new extended framework is derived that is based on a local polynomial approximation of a recently proposed variational Bayesian algorithm. The paper begins by showing that the new extension of this variational algorithm can be used for state estimation (smoothing) and converges to the original algorithm. However, the main focus is on estimating the (hyper-) parameters of these systems (i.e. drift parameters and diffusion coefficients). The new approach is validated on a range of different systems which vary in dimensionality and non-linearity. These are the Ornstein-Uhlenbeck process, the exact likelihood of which can be computed analytically, the univariate and highly non-linear, stochastic double well and the multivariate chaotic stochastic Lorenz '63 (3D model). As a special case the algorithm is also applied to the 40 dimensional stochastic Lorenz '96 system. In our investigation we compare this new approach with a variety of other well known methods, such as the hybrid Monte Carlo, dual unscented Kalman filter, full weak-constraint 4D-Var algorithm and analyse empirically their asymptotic behaviour as a function of observation density or length of time window increases. In particular we show that we are able to estimate parameters in both the drift (deterministic) and the diffusion (stochastic) part of the model evolution equations using our new methods.
NASA Astrophysics Data System (ADS)
Accomazzi, Alberto; Henneken, E.; Grant, C. S.; Kurtz, M. J.; Di Milia, G.; Luker, J.; Thompson, D. M.; Bohlen, E.; Murray, S. S.
ADS Labs is a platform that ADS is introducing in order to test and receive feedback from the community on new technologies and prototype services. Currently, ADS Labs features a new interface for abstract searches, faceted filtering of results, visualization of co-authorship networks, article-level recommendations, and a full-text search service. The streamlined abstract search interface provides a simple, one-box search with options for ranking results based on a paper relevancy, freshness, number of citations, and downloads. In addition, it provides advanced rankings based on collaborative filtering techniques. The faceted filtering interface allows users to narrow search results based on a particular property or set of properties ("facets"), allowing users to manage large lists and explore the relationship between them. For any set or sub-set of records, the co-authorship network can be visualized in an interactive way, offering a view of the distribution of contributors and their inter-relationships. This provides an immediate way to detect groups and collaborations involved in a particular research field. For a majority of papers in Astronomy, our new interface will provide a list of related articles of potential interest. The recommendations are based on a number of factors, including text similarity, citations, and co-readership information. The new full-text search interface allows users to find all instances of particular words or phrases in the body of the articles in our full-text archive. This includes all of the scanned literature in ADS as well as a select portion of the current astronomical literature, including ApJ, ApJS, AJ, MNRAS, PASP, A&A, and soon additional content from Springer journals. Fulltext search results include a list of the matching papers as well as a list of "snippets" of text highlighting the context in which the search terms were found. ADS Labs is available at http://adslabs.org
75 FR 32495 - Operating Fund Subsidies Allocation Formula
Federal Register 2010, 2011, 2012, 2013, 2014
...Operating Fund Subsidies Allocation Formula AGENCY: Office of the Chief Information...which assistance is determined using a formula approach under the Operating Fund Program...Operating Fund Subsidies Allocation Formula. OMB Approval Number:...
34 CFR 300.807 - Allocations to States.
Code of Federal Regulations, 2014 CFR
...REHABILITATIVE SERVICES, DEPARTMENT OF EDUCATION ASSISTANCE TO STATES FOR THE EDUCATION OF CHILDREN WITH DISABILITIES Preschool Grants for Children with Disabilities § 300.807 Allocations to States. The Secretary allocates the amount...
34 CFR 300.807 - Allocations to States.
Code of Federal Regulations, 2012 CFR
...REHABILITATIVE SERVICES, DEPARTMENT OF EDUCATION ASSISTANCE TO STATES FOR THE EDUCATION OF CHILDREN WITH DISABILITIES Preschool Grants for Children with Disabilities § 300.807 Allocations to States. The Secretary allocates the amount...
34 CFR 300.807 - Allocations to States.
Code of Federal Regulations, 2013 CFR
...REHABILITATIVE SERVICES, DEPARTMENT OF EDUCATION ASSISTANCE TO STATES FOR THE EDUCATION OF CHILDREN WITH DISABILITIES Preschool Grants for Children with Disabilities § 300.807 Allocations to States. The Secretary allocates the amount...
Resource Allocation and Scheduling in Heterogeneous Cloud Environments
Lee, Gunho
cloud providers usually allocate resources arbitrarily as they are not aware of the hosted application'cloud providers usually allocate resources using simple or random policies as they are not aware of the hosted application'
Optimal Energy Allocation and Admission Control for Communications Satellites
Modiano, Eytan
1 Optimal Energy Allocation and Admission Control for Communications Satellites Alvin Fu, Eytan control for communications satellites in earth orbit. These satellites receive requests for transmis- sion allocation problems in wireless commu- nications. Keywords-- Satellite, Communication, Resource Alloca- tion
Simpson, Suzanne
allocate differentially depending on the quality of their mate. We manipulated male diet to determine if females had a mate preference based on male chronic condition. Afterward, we dissected the females and measured their allocation using egg size and egg...
Some dynamic resource allocation problems in wireless networks Randall Berry
Kuzmanovic, Aleksandar
dynamically allocate communication resources such as transmission rate and power based on current channel definition is also discussed. Keywords: wireless networks, resource allocation, power control, quality of service 1. INTRODUCTION Two fundamental aspects of typical mobile wireless communication systems
7 CFR 235.4 - Allocation of funds to States.
Code of Federal Regulations, 2012 CFR
...2012-01-01 false Allocation of funds to States. 235.4 Section 235.4 Agriculture...AGRICULTURE CHILD NUTRITION PROGRAMS STATE ADMINISTRATIVE EXPENSE FUNDS § 235.4 Allocation of funds to States. (a) Nondiscretionary SAE...
7 CFR 235.4 - Allocation of funds to States.
Code of Federal Regulations, 2010 CFR
...2010-01-01 false Allocation of funds to States. 235.4 Section 235.4 Agriculture...AGRICULTURE CHILD NUTRITION PROGRAMS STATE ADMINISTRATIVE EXPENSE FUNDS § 235.4 Allocation of funds to States. (a) Nondiscretionary SAE...
7 CFR 235.4 - Allocation of funds to States.
Code of Federal Regulations, 2014 CFR
...2014-01-01 false Allocation of funds to States. 235.4 Section 235.4 Agriculture...AGRICULTURE CHILD NUTRITION PROGRAMS STATE ADMINISTRATIVE EXPENSE FUNDS § 235.4 Allocation of funds to States. (a) Nondiscretionary SAE...
7 CFR 235.4 - Allocation of funds to States.
Code of Federal Regulations, 2013 CFR
...2013-01-01 false Allocation of funds to States. 235.4 Section 235.4 Agriculture...AGRICULTURE CHILD NUTRITION PROGRAMS STATE ADMINISTRATIVE EXPENSE FUNDS § 235.4 Allocation of funds to States. (a) Nondiscretionary SAE...
7 CFR 235.4 - Allocation of funds to States.
Code of Federal Regulations, 2011 CFR
...2011-01-01 false Allocation of funds to States. 235.4 Section 235.4 Agriculture...AGRICULTURE CHILD NUTRITION PROGRAMS STATE ADMINISTRATIVE EXPENSE FUNDS § 235.4 Allocation of funds to States. (a) Nondiscretionary SAE...
Weight allocation in distributed admission control for wireless networks
Boutaba, Raouf
a Distributed Call Admission Control (DCAC) framework designed for wireless mobile multimedia networks. WeWeight allocation in distributed admission control for wireless networks Youssef Iraqi*, Raouf: Weight allocation; Distributed admission control; Wireless networks 1. Introduction 1.1. Background
7 CFR 1493.5 - Criteria for agricultural commodity allocations.
Code of Federal Regulations, 2010 CFR
...2010-01-01 false Criteria for agricultural commodity allocations...1493.5 Criteria for agricultural commodity allocations...Potential benefits that the extension of export credit guarantees...for the particular U.S. agricultural commodity under...
7 CFR 1493.4 - Criteria for country allocations.
Code of Federal Regulations, 2011 CFR
...for country allocations. The criteria considered by CCC in reviewing proposals for country allocations under the GSM-102 or GSM-103 programs, will include, but not be limited to, the following: (a) Potential benefits that the...
43 CFR 1882.4 - Allocation of funds.
Code of Federal Regulations, 2011 CFR
...ASSISTANCE, LOCAL GOVERNMENTS Mineral Development Impact Relief Loans § 1882.4 Allocation of funds...and political subdivisions suffering the most severe social and economic impacts. The allocation of funds under this section...
12 CFR 615.5208 - Allotment of allocated investments.
Code of Federal Regulations, 2011 CFR
12 Banks and Banking 6 2011-01-01 2011-01-01... Allotment of allocated investments. 615.5208 Section 615.5208 Banks and Banking FARM CREDIT ADMINISTRATION... Allotment of allocated investments. (a) The...
12 CFR 615.5208 - Allotment of allocated investments.
Code of Federal Regulations, 2010 CFR
12 Banks and Banking 6 2010-01-01 2010-01-01... Allotment of allocated investments. 615.5208 Section 615.5208 Banks and Banking FARM CREDIT ADMINISTRATION... Allotment of allocated investments. (a) The...
Essays on the real and financial allocation of capital
Ramírez Verdugo, Arturo
This dissertation consists of three papers studying how firms allocate real and financial capital, and how taxes, the labor market and asymmetric information affect these allocation decisions. The first paper studies the ...
Slot Allocation with Constraint Programming: Models and Results
Paris-Sud XI, Université de
Slot Allocation with Constraint Programming: Models and Results Nicolas Barnier, Pascal Brisset algorithm to allocate departure slots which features several drawbacks concerning soundness, interpretation violation. This paper presents two alternative models, also implemented using CP technology, of the slot
42 CFR 121.8 - Allocation of organs.
Code of Federal Regulations, 2012 CFR
... false Allocation of organs. 121.8 Section 121...4. (h) Directed donation. Nothing in this section...prohibit the allocation of an organ to a recipient named by those authorized to make the donation. [64 FR 56659,...
42 CFR 121.8 - Allocation of organs.
Code of Federal Regulations, 2011 CFR
... false Allocation of organs. 121.8 Section 121...4. (h) Directed donation. Nothing in this section...prohibit the allocation of an organ to a recipient named by those authorized to make the donation. [64 FR 56659,...
42 CFR 121.8 - Allocation of organs.
Code of Federal Regulations, 2014 CFR
... false Allocation of organs. 121.8 Section 121...4. (h) Directed donation. Nothing in this section...prohibit the allocation of an organ to a recipient named by those authorized to make the donation. [64 FR 56659,...
42 CFR 121.8 - Allocation of organs.
Code of Federal Regulations, 2013 CFR
... false Allocation of organs. 121.8 Section 121...4. (h) Directed donation. Nothing in this section...prohibit the allocation of an organ to a recipient named by those authorized to make the donation. [64 FR 56659,...
A Distributed Tasks Allocation Scheme in Multi-UAV Context
Thomas Lemaire; Rachid Alami; Simon Lacroix
This paper deals with the task allocation problem in multi-robot systems. We propose a completely distributed architecture, where robots dynamically allocate their tasks while they are building their plans. We first focus on the problem of simple \\
7 CFR 3430.311 - Allocation of research funds.
Code of Federal Regulations, 2011 CFR
... 2011-01-01 false Allocation of research funds. 3430.311 Section 3430.311...ADMINISTRATIVE PROVISIONS Agriculture and Food Research Initiative § 3430.311 Allocation of research funds. (a) Fundamental...
10 CFR 490.703 - Biodiesel fuel use credit allocation.
Code of Federal Regulations, 2010 CFR
... 2010-01-01 2010-01-01 false Biodiesel fuel use credit allocation. 490.703... ALTERNATIVE FUEL TRANSPORTATION PROGRAM Biodiesel Fuel Use Credit § 490.703 Biodiesel fuel use credit allocation. (a)...
7 CFR 1470.4 - Allocation and management.
Code of Federal Regulations, 2011 CFR
...Continued) COMMODITY CREDIT CORPORATION, DEPARTMENT OF AGRICULTURE LOANS, PURCHASES, AND OTHER OPERATIONS CONSERVATION STEWARDSHIP PROGRAM General Provisions § 1470.4 Allocation and management. (a) The Chief will allocate acres and...
7 CFR 1470.4 - Allocation and management.
Code of Federal Regulations, 2014 CFR
...Continued) COMMODITY CREDIT CORPORATION, DEPARTMENT OF AGRICULTURE LOANS, PURCHASES, AND OTHER OPERATIONS CONSERVATION STEWARDSHIP PROGRAM General Provisions § 1470.4 Allocation and management. (a) The Chief will allocate acres and...
7 CFR 1470.4 - Allocation and management.
Code of Federal Regulations, 2012 CFR
...Continued) COMMODITY CREDIT CORPORATION, DEPARTMENT OF AGRICULTURE LOANS, PURCHASES, AND OTHER OPERATIONS CONSERVATION STEWARDSHIP PROGRAM General Provisions § 1470.4 Allocation and management. (a) The Chief will allocate acres and...
7 CFR 1470.4 - Allocation and management.
Code of Federal Regulations, 2013 CFR
...Continued) COMMODITY CREDIT CORPORATION, DEPARTMENT OF AGRICULTURE LOANS, PURCHASES, AND OTHER OPERATIONS CONSERVATION STEWARDSHIP PROGRAM General Provisions § 1470.4 Allocation and management. (a) The Chief will allocate acres and...
7 CFR 1470.4 - Allocation and management.
Code of Federal Regulations, 2010 CFR
...Continued) COMMODITY CREDIT CORPORATION, DEPARTMENT OF AGRICULTURE LOANS, PURCHASES, AND OTHER OPERATIONS CONSERVATION STEWARDSHIP PROGRAM General Provisions § 1470.4 Allocation and management. (a) The Chief will allocate acres and...
Quantifying the impact of customer allocations on supply chain performance
Sheth, Neel
This project investigates the impact that customer allocations have on key cost and service indicators at Intel Corporation. Allocations provide a method to fill orders during constrained supply, when total demand for a ...
7 CFR 1466.6 - State allocation and management.
Code of Federal Regulations, 2010 CFR
...false State allocation and management. 1466.6 Section 1466...6 State allocation and management. The State Conservationist...level goals and treatment objectives; (b) Identify, as appropriate...conservationists who are NRCS employees that are assigned the...
42 CFR 495.358 - Cost allocation plans.
Code of Federal Regulations, 2010 CFR
... Cost allocation plans. 495.358 ...495.358 Public Health CENTERS FOR...DEPARTMENT OF HEALTH AND HUMAN SERVICES...FOR THE ELECTRONIC HEALTH RECORD TECHNOLOGY INCENTIVE... Cost allocation plans. State...
The allocation of ecosystem net primary productivity in tropical forests
Malhi, Yadvinder
in allocation values across sites. Keywords: carbon cycle; rootshoot ratio; Amazonia; Andes; Asia; Hawaii 1 and consumption by soil fauna. The fraction allocated to fine roots and exudates influences water uptake, nutri
Semiparametric smoothing estimators for long-memory processes with added noise
Nuno Crato; Bonnie K. Ray
The development of long-memory stochastic volatility (LMSV) models has increased the interest in the estimation of persistent processes observed with added noise. This paper investigates the performance of semi-parametric methods for estimating the long-memory-parameter in the long-range dependence plus noise case and demonstrates improvements obtained by preliminary smoothing and aggregation of the series.
The allocation of ecosystem net primary productivity in tropical forests
Malhi, Yadvinder; Doughty, Christopher; Galbraith, David
The allocation of the net primary productivity (NPP) of an ecosystem between canopy, woody tissue and fine roots is an important descriptor of the functioning of that ecosystem, and an important feature to correctly represent in terrestrial ecosystem models. Here, we collate and analyse a global dataset of NPP allocation in tropical forests, and compare this with the representation of NPP allocation in 13 terrestrial ecosystem models. On average, the data suggest an equal partitioning of allocation between all three main components (mean 34 ± 6% canopy, 39 ± 10% wood, 27 ± 11% fine roots), but there is substantial site-to-site variation in allocation to woody tissue versus allocation to fine roots. Allocation to canopy (leaves, flowers and fruit) shows much less variance. The mean allocation of the ecosystem models is close to the mean of the data, but the spread is much greater, with several models reporting allocation partitioning outside of the spread of the data. Where all main components of NPP cannot be measured, litterfall is a good predictor of overall NPP (r2 = 0.83 for linear fit forced through origin), stem growth is a moderate predictor and fine root production a poor predictor. Across sites the major component of variation of allocation is a shifting allocation between wood and fine roots, with allocation to the canopy being a relatively invariant component of total NPP. This suggests the dominant allocation trade-off is a 'fine root versus wood' trade-off, as opposed to the expected 'root–shoot' trade-off; such a trade-off has recently been posited on theoretical grounds for old-growth forest stands. We conclude by discussing the systematic biases in estimates of allocation introduced by missing NPP components, including herbivory, large leaf litter and root exudates production. These biases have a moderate effect on overall carbon allocation estimates, but are smaller than the observed range in allocation values across sites. PMID:22006964
Server Allocation Algorithms for Tiered Systems
Kamalika Chaudhuri; Anshul Kothari; Rudi Pendavingh; Ram Swaminathan; Robert Endre Tarjan; Yunhong Zhou
Many web-based systems have a tiered application architec- ture, in which a request needs to transverse all the tiers before finishing its processing. One of the most important QoS metrics for these appli- cations is the expected response time for the user. Since the expected response time in any tier depends upon the number of servers allocated to this tier,
Stavrakakis, Ioannis
STORAGE CAPACITY ALLOCATION ALGORITHMS FOR HIERARCHICAL CONTENT DISTRIBUTION Nikolaos Laoutaris of Athens, 15784 Athens, Greece {laoutaris,vassilis,email@example.com Abstract The addition of storage storage budget to the nodes of a hierarchical con- tent distribution system is formulated; optimal
Competition in Law Enforcement and Capital Allocation
Nicolas Marceau; Steeve Mongrain
This paper studies interjurisdictional competition in the fight against crime and its impact on occupational choice and the allocation of capital. In a world where capital is mobile, jurisdictions are inhabited by individuals who choose to become workers or criminals. Because the return of the two occupations depends on capital, and because investment in capital in a jurisdiction depends on
Prioritized resource allocation for stressed networks
Cory C. Beard; Victor S. Frost
Overloads that occur during times of network stress result in blocked access to all users, independent of importance. These overloads can occur because of degraded resource availability or abnormally high demand. Public broadband networks must dynamically recognize some multimedia connections as having greater importance than others and allocate resources accordingly. A new approach to connection admission control is proposed that
Improved Approximation Algorithms for Resource Allocation
Gruia Calinescu; Amit Chakrabarti; Howard J. Karloff; Yuval Rabani
Abstract: We study the problem ofnding a most protable subset of n given tasks, each with a givenstart andnish time as well as prot and resource requirement, that at no time exceeds thequantity B of available resource. We show that this NP-hard Resource Allocation problemcan be (1=2 ")-approximated in polynomial time, which improves upon earlier approximationresults for this problem, the
Multiattribute Decision Making by Sequential Resource Allocation
Oren, Shmuel S.
Multiattribute Decision Making by Sequential Resource Allocation PETER A. MORRIS Applied Decision that the preference information revealed by the decision-maker's choices is exactly the information necessary to make with a single criterion. Individuals, corporations and govern- ments make daily decisions that involve different
Channel Allocation Problem Medium Access Protocols
Ramkumar, Mahalingam
Outline 1 Channel Allocation Problem Poisson Distribution 2 Medium Access Protocols ALOHA Slotted ALOHA Layer 2 Components ALOHA Slotted ALOHA CSMA Three Scenarios Medium access protocols can be classified Wireless Ethernet (WLAN) IEEE 802.2 Other Layer 2 Components ALOHA Slotted ALOHA CSMA ALOHA n stations
Resource allocation and scheduling in cloud computing
Eman Elghoneimy; Othmane Bouhali; Hussein Alnuweiri
Cloud computing is a platform that hosts applications and services for businesses and users to accesses computing as a service. In this paper, we identify two scheduling and resource allocation problems in cloud computing. We describe Hadoop MapReduce and its schedulers, and present recent research efforts in this area including alternative schedulers and enhancements to existing schedulers. The second scheduling
Optimizing continuous berth allocation by immune algorithm
Zhi-Hua Hu; Xiao-Long Han; Yi-Zhong Ding
The continuous berth allocation problem (BAPC) solves the BAP with continuous berth space and continuous time to optimize the utilization of space and time of the ports. A nonlinear programming (NLP) model is built and an immune algorithm (IA) is proposed to solve it. The effects of the number of vessels, the berth space length and the length of planning
Balanced Allocation on Graphs Krishnaram Kenthapadi
Pratt, Vaughan
Balanced Allocation on Graphs Krishnaram Kenthapadi Rina Panigrahy Abstract It is well known(1)) log n/ log log n balls. Azar, Broder, Kar- lin, and Upfal [1] showed that instead of choosing, the maximum load reduces drastically to log log n/ log d+O(1). In this paper, we study the two choice balls
Discrete Resource Allocation in Visual Working Memory
ERIC Educational Resources Information Center
Barton, Brian; Ester, Edward F.; Awh, Edward
Are resources in visual working memory allocated in a continuous or a discrete fashion? On one hand, flexible resource models suggest that capacity is determined by a central resource pool that can be flexibly divided such that items of greater complexity receive a larger share of resources. On the other hand, if capacity in working memory is…
Optimizing Organ Allocation and Acceptance OGUZHAN ALAGOZ
Schaefer, Andrew
for transplantations, donated organs are very scarce. The demand for organs has greatly outstripped the supply. Thus Network for Organ Sharing (UNOS) is responsible for managing the national organ donation and allocation donation and procurement via Organ Procurement Organizations (OPOs), which are non-profit agencies
Issues in organ procurement, allocation, and transplantation.
Nierste, Deborah
Organ transplantation extends lives and improves health but presents complex ethical dilemmas for nurses caring for donors, recipients, and their families. This article overviews organ procurement and allocation, discusses ethical dilemmas in transplantation, and offers strategies from professional and biblical perspectives for coping with moral distress and maintaining compassionate care. PMID:23607154
Contingency allocation and management for building projects
Malik Ranasinghe
A theoretical approach is presented for contingency allocation and management in building projects using the quantification of uncertainty of project cost. The uncertainty of input items to a bill of quantities, namely, quantities of bill items, usage of resources and their prices are quantified as two moments. From these, two moments for project cost are evaluated. The cumulative distribution function
Acquisitions Allocations: Equity, Politics, and Formulas.
ERIC Educational Resources Information Center
Packer, Donna
Reviews the literature on library acquisitions allocations and the lack of agreement on effective policies. Discussion focuses on a process developed at Western Washington University, which combines mathematical formulations of equity with the reality of campus politics, while protecting collection integrity. (44 references) (Author/CLB)
Limits on linearity of missile allocation optimization
Canavan, G.H.
Optimizations of missile allocation based on linearized exchange equations produce accurate allocations, but the limits of validity of the linearization are not known. These limits are explored in the context of the upload of weapons by one side to initially small, equal forces of vulnerable and survivable weapons. The analysis compares analytic and numerical optimizations and stability induces based on aggregated interactions of the two missile forces, the first and second strikes they could deliver, and they resulting costs. This note discusses the costs and stability indices induced by unilateral uploading of weapons to an initially symmetrical low force configuration. These limits are quantified for forces with a few hundred missiles by comparing analytic and numerical optimizations of first strike costs. For forces of 100 vulnerable and 100 survivable missiles on each side, the analytic optimization agrees closely with the numerical solution. For 200 vulnerable and 200 survivable missiles on each side, the analytic optimization agrees with the induces to within about 10%, but disagrees with the allocation of the side with more weapons by about 50%. The disagreement comes from the interaction of the possession of more weapons with the shift of allocation from missiles to value that they induce.
House Allocation With Fractional Endowments Stergios Athanassoglou
Sethuraman, Jay
to her peers. For this general model, we design an algorithm to find a fractional allocation of houses house, we recover the housing market model, first considered by Shapley and Scarf [8]. For this model, Shapley and Scarf proposed the Top-Trading Cycles mechanism (attributed to Gale) that finds the unique
Ground data systems resource allocation process
NASA Technical Reports Server (NTRS)
Berner, Carol A.; Durham, Ralph; Reilly, Norman B.
The Ground Data Systems Resource Allocation Process at the Jet Propulsion Laboratory provides medium- and long-range planning for the use of Deep Space Network and Mission Control and Computing Center resources in support of NASA's deep space missions and Earth-based science. Resources consist of radio antenna complexes and associated data processing and control computer networks. A semi-automated system was developed that allows operations personnel to interactively generate, edit, and revise allocation plans spanning periods of up to ten years (as opposed to only two or three weeks under the manual system) based on the relative merit of mission events. It also enhances scientific data return. A software system known as the Resource Allocation and Planning Helper (RALPH) merges the conventional methods of operations research, rule-based knowledge engineering, and advanced data base structures. RALPH employs a generic, highly modular architecture capable of solving a wide variety of scheduling and resource sequencing problems. The rule-based RALPH system has saved significant labor in resource allocation. Its successful use affirms the importance of establishing and applying event priorities based on scientific merit, and the benefit of continuity in planning provided by knowledge-based engineering. The RALPH system exhibits a strong potential for minimizing development cycles of resource and payload planning systems throughout NASA and the private sector.
Resource Allocation Patterns and Student Achievement
ERIC Educational Resources Information Center
James, Lori; Pate, James; Leech, Donald; Martin, Ellice; Brockmeier, Lantry; Dees, Elizabeth
This quantitative research study was designed to examine the relationship between system resource allocation patterns and student achievement, as measured by eighth grade Criterion-Referenced Competency Test (CRCT) mathematics, eighth grade CRCT reading, eleventh grade Georgia High School Graduation Test (GHSGT) mathematics, eleventh grade and…
Market Economy Based Resource Allocation in Grids
Melbourne, University of
IT6011] Under the supervision of Dr. Arobinda Gupta School of Information Technology Indian Institute of Technology, Kharagpur India May 2006 #12;i School of Information Technology Indian Institute of Technology Allocation in Grids", submitted by Sai Rahul Reddy P, to the School of Information Technology, in partial
Internal Markets for Supply Chain Capacity Allocation
allocation problems using internal markets among employees of the same company. Unlike earlier forms's ability to pay marke participants based on factors other than just the profitability of their market of corporate, not individual, profits. Incentives for collusion among peers can be reduced by paying
Characterizing Vickrey allocation rule by anonymity
Ashlagi, Itai
We consider the problem of allocating finitely many units of an indivisible good among a group of agents when each agent receives at most one unit of the good and pays a non-negative price. For example, imagine that a ...
EnterAllocation Changes: Savings Account $
Huang, Jianyu
Education Other $ METRO'S ROUTING AND TRANSIT NO. 211381990 For all allocation changes, please forward to Metro Credit Union at: 877-MY-METRO (Fax) 617-889-7776 Mail to: Deposit Operations Metro Credit Union NO. NAME (PRINT) Eagle I.D. Number: SIGNATURE I/We hereby make application for membership in Metro
A stochastic multi-symplectic scheme for stochastic Maxwell equations with additive noise
Hong, Jialin, E-mail: email@example.com [Institute of Computational Mathematics and Scientific/Engineering Computing, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190 (China); Ji, Lihai, E-mail: firstname.lastname@example.com [Institute of Applied Physics and Computational Mathematics, Beijing 100094 (China); Zhang, Liying, E-mail: firstname.lastname@example.com [Institute of Computational Mathematics and Scientific/Engineering Computing, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190 (China)
In this paper we investigate a stochastic multi-symplectic method for stochastic Maxwell equations with additive noise. Based on the stochastic version of variational principle, we find a way to obtain the stochastic multi-symplectic structure of three-dimensional (3-D) stochastic Maxwell equations with additive noise. We propose a stochastic multi-symplectic scheme and show that it preserves the stochastic multi-symplectic conservation law and the local and global stochastic energy dissipative properties, which the equations themselves possess. Numerical experiments are performed to verify the numerical behaviors of the stochastic multi-symplectic scheme.
Market-based Service Allocation for Distributed Computing
Ikki FUJIWARA; Kento AIDA; Isao ONO
Market-based resource allocation is expected to be an effective mechanism to allocate resources in a cloud computing environment, where the resources are virtualized and delivered to users as services. In this paper we propose a market mechanism to efficiently allocate multiple computation\\/storage services among multiple participants, or the Cloud Service Exchange. The proposed mechanism enables users (1) to order a
Quantization of Multiple Sources Using Integer Bit Allocation
Zeger, Kenneth
budget. Alternatively, searches of integer-valued bit allocations near the Huang-Schultheiss solutionQuantization of Multiple Sources Using Integer Bit Allocation Benjamin Farber and Kenneth Zeger Abstract Asymptotically optimal bit allocation among a set of quantizers for a finite col- lection
7 CFR 1435.307 - Transfer of allocation.
Code of Federal Regulations, 2012 CFR
...Transfer of allocation. (a) If a sugarcane processing facility is sold or transferred...allocations, based on the number of acres of sugarcane base being transferred and the pro...to allocation of the processor for the sugarcane base being transferred, will be...
7 CFR 1435.307 - Transfer of allocation.
Code of Federal Regulations, 2010 CFR
...Transfer of allocation. (a) If a sugarcane processing facility is sold or transferred...allocations, based on the number of acres of sugarcane base being transferred and the pro...to allocation of the processor for the sugarcane base being transferred, will be...
7 CFR 1435.307 - Transfer of allocation.
Code of Federal Regulations, 2013 CFR
...Transfer of allocation. (a) If a sugarcane processing facility is sold or transferred...allocations, based on the number of acres of sugarcane base being transferred and the pro...to allocation of the processor for the sugarcane base being transferred, will be...
7 CFR 1435.307 - Transfer of allocation.
Code of Federal Regulations, 2014 CFR
...Transfer of allocation. (a) If a sugarcane processing facility is sold or transferred...allocations, based on the number of acres of sugarcane base being transferred and the pro...to allocation of the processor for the sugarcane base being transferred, will be...
7 CFR 1435.307 - Transfer of allocation.
Code of Federal Regulations, 2011 CFR
...Transfer of allocation. (a) If a sugarcane processing facility is sold or transferred...allocations, based on the number of acres of sugarcane base being transferred and the pro...to allocation of the processor for the sugarcane base being transferred, will be...
Study on water allocation in Taizhou,Zhejiang, China
Peng Hong; Wang Yan; Zhang Wanshun
As the increasing water demand and serious water pollution, conventional allocation pattern, which mainly considers water quantity as the key factor, is no longer satisfying the water allocation need. A coupled water quantity-quality model in a river basin is presented in this paper to provide a tool for water allocation schemes analysis. The pollutants transport and hydrological cycling processes in
Subcarrier allocation in coded OFDMA uplink systems: Diversity versus CFO
Boyer, Edmond
and without CSI at the transmitter. We look at the effects of correlation the robustness of the proposed blockwise allocation policy to the effect of carrier frequency offsets (CFO information (CSI) available, the most used allocation schemes are the blockwise and interleaved allocations
12 CFR 1026.53 - Allocation of payments.
Code of Federal Regulations, 2014 CFR
...Banks and Banking 9 2014-01-01 2014-01-01 false ...Open-End Credit Offered to College Students § 1026.53 Allocation...allocate the excess amount first to the balance...issuer must allocate any amount paid by the...
12 CFR 226.53 - Allocation of payments.
Code of Federal Regulations, 2014 CFR
...Banks and Banking 3 2014-01-01 2014-01-01 false ...Open-End Credit Offered to College Students § 226.53 Allocation...allocate the excess amount first to the balance...issuer must allocate any amount paid by the...
Cooperative water resource allocation based on equitable water rights
Lizhong Wang; Liping Fang; Keith W. Hipel
A comprehensive methodology is developed to achieve equitable, efficient and sustainable water allocation in a river basin. Water allocation is carried out in two steps: (1) allocation of initial water rights to water stakeholders and users based on existing water rights systems or agreements; and (2) reallocation of water and net benefits through water transfers to promote equitable cooperation of
Optimum Power and Rate Allocation for Coded Victoria Kostina
Loyka, Sergey
) system, spatial mul- tiplexing, coded V-BLAST, power/rate allocation, waterfilling, performance analysis], consider rate allocation. Most practical communication systems use coding; uncoded systems are rareOptimum Power and Rate Allocation for Coded V-BLAST Victoria Kostina Department of Electrical
Power allocation for non-regenerative OFDM relaying channels
Yu Guan-Ding; Zhang Zhao-Yang; Chen Yan; Chen Shi; Qiu Pei-liang
Relayed transmission is an efficient way to combat wireless channel fading and to increase system throughput. By allocating the overall power to the transmitter and the relay optimally, the system performance can be further improved. This paper discusses the optimal power allocation in frequency-selective non-regenerative relaying channels, where OFDM is employed. Firstly, the optimal power allocation between a cooperative subcarrier
Minimum BER Power Allocation for MIMO Spatial Multiplexing Systems
Blostein, Steven D.
Minimum BER Power Allocation for MIMO Spatial Multiplexing Systems Neng Wang and Steven D. Blostein.g., voice and video communications. Power allocation also reduces feedback significantly compared to general-mail: {nwang,firstname.lastname@example.com Abstract-- Power allocation for multiple-input multiple-output (MIMO) spatial
Dynamic Resource Allocation in CDMA Systems with Deterministic
Koutsopoulos, Iordanis
Dynamic Resource Allocation in CDMA Systems with Deterministic Codes and Multirate Provisioning for resource allocation algorithms under the aforementioned regimes. Index Terms--Wireless communication, code division multiple access, resource allocation, power control, cross-layer design. Ç 1 INTRODUCTION THE last
47 CFR 76.924 - Allocation to service cost categories.
Code of Federal Regulations, 2011 CFR
...2011-10-01 false Allocation to service cost...Telecommunication FEDERAL COMMUNICATIONS COMMISSION...76.924 Allocation to service cost...franchise, system, regional... Cable Plant Power Expense Pole...h), small systems owned by...Adjustments (e) Allocation to service...
A relay selection scheme under optimal power allocation
Zhou Kenan; Tat Ming Lok
Cooperative diversity is an important technique in wireless communication and relay selection plays a significant role in this diversity technique. While some relay selection schemes only optimize the relay selection process under a simple power allocation, this paper analyzes the optimal power allocation, demonstrates the relationship between the position of the best relay node and the power allocation ratio to
47 CFR 76.924 - Allocation to service cost categories.
Code of Federal Regulations, 2014 CFR
...2014-10-01 false Allocation to service cost...Telecommunication FEDERAL COMMUNICATIONS COMMISSION...76.924 Allocation to service cost...franchise, system, regional... Cable Plant Power Expense Pole...h), small systems owned by...Adjustments (e) Allocation to service...
47 CFR 76.924 - Allocation to service cost categories.
Code of Federal Regulations, 2012 CFR
...2012-10-01 false Allocation to service cost...Telecommunication FEDERAL COMMUNICATIONS COMMISSION...76.924 Allocation to service cost...franchise, system, regional... Cable Plant Power Expense Pole...h), small systems owned by...Adjustments (e) Allocation to service...
Simultaneous Routing and Power Allocation in CDMA Wireless Data Networks
(CDMA) systems. In CDMA systems, the capacity of a link depends not only on the power allocated constraints are not jointly convex in communication rates and power allocations, so a straightforward formuSimultaneous Routing and Power Allocation in CDMA Wireless Data Networks Mikael Johansson* , Lin
47 CFR 76.924 - Allocation to service cost categories.
Code of Federal Regulations, 2013 CFR
...2013-10-01 false Allocation to service cost...Telecommunication FEDERAL COMMUNICATIONS COMMISSION...76.924 Allocation to service cost...franchise, system, regional... Cable Plant Power Expense Pole...h), small systems owned by...Adjustments (e) Allocation to service...
Power Allocation Algorithms for OFDM-Based Cognitive Radio Systems
Shuangcheng Yan; Pinyi Ren; Fushun Lv
In this paper, we investigate an optimal power allocation algorithm for OFDM-based cognitive radio. In the model of power allocation, we set the interference constraints for each primary user, and also take subcarrier sidelobes interference (adjacent channel interference (ACI)) into account, when we use the optimal power allocation algorithm, the transmission capacity of secondary users (SU) is maximized while the
Slot allocation using logical networks for TDM virtual circuit
Jantsch, Axel
Slot allocation using logical networks for TDM virtual circuit configuration for network-on-chip Slot allocation using logical networks for TDM virtual circuit configuration for networkOutline Background on TDM (Time-Division-Multiplexing) VC The problem of slot allocation Our approach
Allocating fixed costs and resources via data envelopment analysis
J. E. Beasley
In this paper we show that data envelopment analysis (DEA) can be viewed as maximising the average efficiency of the decision-making units (DMUs) in an organisation. Building upon this we present DEA based models for: (a) allocating fixed costs to DMUs and (b) allocating input resources to DMUs. Simultaneous to allocating input resources output targets are also decided for each
Queuing analysis of dynamic resource allocation for virtual routers
Paris-Sud XI, Université de
Queuing analysis of dynamic resource allocation for virtual routers M. Said Seddiki , Bilel Nefzi routers in order to allow an adaptive change in the resource allocation. In this paper, we focus on the router data plane virtualization and we explore this issue by presenting a new dynamic allocation
The Development of a Human Effectiveness Function Allocation Methodology (HEFAM).
ERIC Educational Resources Information Center
Connelly, Marilee N.; Willis, Joe E.
This report was a part of the Human Effectiveness Function Allocation Methodology (HEFAM) project, which is attempting to develop a workable cost-effectiveness methodology for man-machine function allocation. Researchers reviewed the cost-effectiveness and function allocation literature, and interviewed engineers, data analysts, programers,…
Reward Allocation among Chinese High School Students in Hong Kong.
ERIC Educational Resources Information Center
Chiu, Chi-Yue
Examined effects of personality and performance on reward allocation. Subjects were 89 Hong Kong senior high school students. Results showed that the subjects took into consideration the recipient's personality when they allocated reward to a relatively low performer. Personality was not a factor in allocation of reward to a high performer. (GG)
Optimized prophet address allocation (OPAA) for Body Area Networks
Samaneh Movassaghi; Mehran Abolhasan; Justin Lipman
Each node in a Body Area Network (BAN) needs to be assigned with a free IP address before it may participate in any sort of communication. This paper evaluates the performance of an IP address allocation scheme, namely Prophet allocation to be used for BANs. This allocation scheme is a fully decentralized addressing scheme which is applicable to BANs as
Storage Allocation for Real-Time, Embedded Systems
Steven M. Donahue; Matthew P. Hampton; Morgan Deters; Jonathan M. Nye; Ron K. Cytron; Krishna M. Kavi
Dynamic storage allocation and automatic garbage collection are among the most popular features that high-level languages can offer. However, time- critical applications cannot be written in such languages unless the time taken to allocate and deallocate storage can be reasonably bounded. In this paper, we present algorithms for automatic storage allocation that are appropriate for real- time and embedded systems.
Ejaculate allocation by male sand martins, Riparia riparia
E. H. Nicholls; T. Burke; T. R. Birkhead
Males of many species allocate sperm to ejaculates strategically in response to variation in the risk and intensity of sperm competition. The notable exception is passerine birds, in which evidence for strategic allocation is absent. Here we report the results of a study testing for strategic ejaculate allocation in a passerine bird, the sand martin ( Riparia riparia ). Natural
Stochastic morphological evolution equations
NASA Astrophysics Data System (ADS)
Kloeden, Peter E.; Lorenz, Thomas
The inadequacy of locally defined set-valued differential equations to describe the evolution of shapes and morphological forms in biology, which are usually neither convex or nondecreasing, was recognised by J.-P. Aubin, who introduced morphological evolution equations, which are essentially nonlocally defined set-valued differential equations with the inclusion vector field also depending on the entire reachable set. This concept is extended here to the stochastic setting of set-valued Itô evolution equations in Hilbert spaces. Due to the nonanticipative nature of Itô calculus, the evolving reachable sets are nonanticipative nonempty closed random sets. The existence of solutions and their dependence on initial data are established. The latter requires the introduction of a time-oriented semi-metric in time-space variables. As a consequence the stochastic morphological evolution equations generate a deterministic nonautonomous dynamical system formulated as a two-parameter semigroup with the complication that the random subsets take values in different spaces at different time instances due to the nonanticipativity requirement. It is also shown how nucleation processes can be handled in this conceptual framework.
Stochastic Quantum Gas Dynamics
NASA Astrophysics Data System (ADS)
Proukakis, Nick P.; Cockburn, Stuart P.
We study the dynamics of weakly-interacting finite temperature Bose gases via the Stochastic Gross-Pitaevskii equation (SGPE). As a first step, we demonstrate [jointly with A. Negretti (Ulm, Germany) and C. Henkel (Potsdam, Germany)] that the SGPE provides a significantly better method for generating an equilibrium state than the number-conserving Bogoliubov method (except for low temperatures and small atom numbers). We then study [jointly with H. Nistazakis and D.J. Frantzeskakis (University of Athens, Greece), P.G.Kevrekidis (University of Massachusetts) and T.P. Horikis (University of Ioannina, Greece)] the dynamics of dark solitons in elongated finite temperature condensates. We demonstrate numerical shot-to-shot variations in soliton trajectories (S.P. Cockburn et al., arXiv:0909.1660.), finding individual long-lived trajectories as in experiments. In our simulations, these variations arise from fluctuations in the phase and density of the underlying medium. We provide a detailed statistical analysis, proposing regimes for the controlled experimental demonstration of this effect; we also discuss the extent to which simpler models can be used to mimic the features of ensemble-averaged stochastic trajectories.
Stochastic Blind Motion Deblurring.
Xiao, Lei; Gregson, James; Heide, Felix; Heidrich, Wolfgang
Blind motion deblurring from a single image is a highly under-constrained problem with many degenerate solutions. A good approximation of the intrinsic image can, therefore, only be obtained with the help of prior information in the form of (often nonconvex) regularization terms for both the intrinsic image and the kernel. While the best choice of image priors is still a topic of ongoing investigation, this research is made more complicated by the fact that historically each new prior requires the development of a custom optimization method. In this paper, we develop a stochastic optimization method for blind deconvolution. Since this stochastic solver does not require the explicit computation of the gradient of the objective function and uses only efficient local evaluation of the objective, new priors can be implemented and tested very quickly. We demonstrate that this framework, in combination with different image priors produces results with Peak Signal-to-Noise Ratio (PSNR) values that match or exceed the results obtained by much more complex state-of-the-art blind motion deblurring algorithms. PMID:25974941
Impact of time delays on stochastic resonance in an ecological system describing vegetation
NASA Astrophysics Data System (ADS)
Han, Qinglin; Yang, Tao; Zeng, Chunhua; Wang, Hua; Liu, Zhiqiang; Fu, Yunchang; Zhang, Chun; Tian, Dong
In this paper, we investigate the stochastic resonance phenomenon in a vegetation ecological system with time delay, at which the vegetation dynamics is assumed to be disturbed by both intrinsic and extrinsic noises. The signal-to-noise ratio is calculated when a weak periodic signal is added to the system. The impacts of time delay ? and correlation strength k between two noises on the signal-to-noise ratio are discussed, respectively. Our research results show that: (i) the increase of ? or k can enhance the stochastic resonance in the signal-to-noise ratio as a function of intrinsic noise strength ?; (ii) on the contrary, the increase of ? or k can weaken the stochastic resonance in the signal-to-noise ratio as a function of extrinsic noise strength D; and (iii) the increase of ? can lead to double stochastic resonance phenomenon in the signal-to-noise ratio as a function of k.
Stability Analysis of Connected Cruise Control with Stochastic Delays Wubing B. Qin
Awtar, Shorya
by using adaptive cruise control (ACC) systems where the distance to the preceding vehicle is measuredStability Analysis of Connected Cruise Control with Stochastic Delays Wubing B. Qin Dept cruise control (CCC) where vehicles rely on ad-hoc wireless vehicle-to-vehicle (V2V) communication
On square-wave-driven stochastic resonance for energy harvesting in a bistable system
NASA Astrophysics Data System (ADS)
Su, Dongxu; Zheng, Rencheng; Nakano, Kimihiko; Cartmell, Matthew P.
Stochastic resonance is a physical phenomenon through which the throughput of energy within an oscillator excited by a stochastic source can be boosted by adding a small modulating excitation. This study investigates the feasibility of implementing square-wave-driven stochastic resonance to enhance energy harvesting. The motivating hypothesis was that such stochastic resonance can be efficiently realized in a bistable mechanism. However, the condition for the occurrence of stochastic resonance is conventionally defined by the Kramers rate. This definition is inadequate because of the necessity and difficulty in estimating white noise density. A bistable mechanism has been designed using an explicit analytical model which implies a new approach for achieving stochastic resonance in the paper. Experimental tests confirm that the addition of a small-scale force to the bistable system excited by a random signal apparently leads to a corresponding amplification of the response that we now term square-wave-driven stochastic resonance. The study therefore indicates that this approach may be a promising way to improve the performance of an energy harvester under certain forms of random excitation.
The Organization of Work in Social Insect Task Allocation as an Ad Hoc, Dynamical Network
White, Douglas R.
in harvester ants (Pogonomyrmex barbatus) [2]. In- side the nest, ants care for the brood (the preadult forms around doing nothing. The ants that work outside the nest are a distinct group, apparently older than depend on numbers engaged in another [3,4]. Ants switch tasks, though not all transitions are possible
Resource Allocation in Fading Wireless Ad-Hoc Networks with Temporally Correlated Loss
Yousefi'zadeh, Homayoun
to noise. Often times, the former factor has a much greater effect than the latter. While increasing between signals cannot be ne- glected, to date only few articles have utilized accurate models correlated loss when optimizing total power consumption in end-to-end transmission of multimedia content over
NSDL National Science Digital Library
Brought to you by the folks at Adcritic.com, this Website features sixteen 30-second spots from the Presidential primary and general elections campaign. Political Ad Critic lists a "top ten," with Ralph Nader's hip parody ("The Truth: Priceless") of the popular MasterCard commercials awarded number one, and posts new ads from the campaign each week. Currently, there are four commercials from the Gore campaign posted here -- one of which has Gore speaking Spanish -- and six from Bush's camp, including the now-infamous "bureaucRATS" spot. (The QuickTime control bar allows users to advance frame by frame so they can judge for themselves the commercial's disputed subliminal content.) Commercials from the Libertarian party candidate Harry Browne, and primary contenders John McCain and Bill Bradley round out the Website. May the best commercial win.
AdS cycles in eternally inflating background
NASA Astrophysics Data System (ADS)
Liu, Zhi-Guo; Piao, Yun-Song
In the eternally inflating background, the bubbles with AdS vacua will crunch. However, this crunch might be followed by a bounce. It is generally thought that the bubble universe may be cyclic, which will go through a sequence of AdS crunches, until the field inside the bubble finally lands at a dS minimum. However, we show that due to the amplification of field fluctuation, the bubble universe going through AdS cycles will inevitably fragment within two or three cycles. We discuss its implication to the eternal inflation scenario.
Assessing marginal water values in multipurpose multireservoir systems via stochastic programming
NASA Astrophysics Data System (ADS)
Tilmant, A.; Pinte, D.; Goor, Q.
The International Conference on Water and the Environment held in Dublin in 1992 emphasized the need to consider water as an economic good. Since water markets are usually absent or ineffective, the value of water cannot be directly derived from market activities but must rather be assessed through shadow prices. Economists have developed various valuation techniques to determine the economic value of water, especially to handle allocation issues involving environmental water uses. Most of the nonmarket valuation studies reported in the literature focus on long-run policy problems, such as permanent (re)allocations of water, and assume that the water availability is given. When dealing with short-run allocation problems, water managers are facing complex spatial and temporal trade-offs and must therefore be able to track site and time changes in water values across different hydrologic conditions, especially in arid and semiarid areas where the availability of water is a limiting and stochastic factor. This paper presents a stochastic programming approach for assessing the statistical distribution of marginal water values in multipurpose multireservoir systems where hydropower generation and irrigation crop production are the main economic activities depending on water. In the absence of a water market, the Lagrange multipliers correspond to shadow prices, and the marginal water values are the Lagrange multipliers associated with the mass balance equations of the reservoirs. The methodology is illustrated with a cascade of hydroelectric-irrigation reservoirs in the Euphrates river basin in Turkey and Syria.
Efficient bit allocation for an arbitrary set of quantizers [speech coding
Y. Shoham; A. Gersho
A bit allocation algorithm that is capable of efficiently allocating a given quota of bits to an arbitrary set of different quantizers is proposed. This algorithm is useful in any coding scheme which uses bit allocation or, more generally, codebook allocation. It produces an optimal or very nearly optimal allocation, while allowing the set of admissible bit allocation values to
Stochastic Resonance: from climate to biology
Roberto Benzi
In this paper I will review some basic aspects of the mechanism of stochastic resonance. Stochastic resonance was first introduced as a possible mechanism to explain long term climatic variation. Since then, there have been many applications of stochastic resonance in physical and biological systems. I will show that in complex system, stochastic resonance can substantially change as a function of the ``system complexity''. Also, I will briefly mention how to apply stochastic resonance for the case of Brownian motors.
From Random Matrices to Stochastic Operators
Alan Edelman; Brian D. Sutton
We propose that classical random matrix models are properly viewed as finite difference schemes for stochastic differential operators. Three particular stochastic operators commonly arise, each associated with a familiar class of local eigenvalue behavior. The stochastic Airy operator displays soft edge behavior, associated with the Airy kernel. The stochastic Bessel operator displays hard edge behavior, associated with the Bessel kernel. The article concludes with suggestions for a stochastic sine operator, which would display bulk behavior, associated with the sine kernel.
Power Allocation for Amplify-and-Forward Opportunistic Relaying Systems
NASA Astrophysics Data System (ADS)
Hui, Hui; Zhu, Shihua; Lv, Gangming
In this letter, power allocation methods are devised for Amplify-and-Forward (AF) opportunistic relaying systems aiming at minimizing the outage probability. First, we extend the result on outage probability in [8] and develop an approximate expression to simplify the power allocation problem. A corresponding optimization problem is constructed and proved to be convex. Then an iterative numerical method is proposed to find the optimal power allocation factor. We also propose a near-optimal method which can directly calculate the power allocation factor to reduce computational complexity. Numerical results show that the proposed methods have a similar performance with the ideal one, and outperform equal power allocation significantly with little overhead.
Coordinated aviation network resource allocation under uncertainty
Andrew M. Churchill; David J. Lovell
Congestion in the air traffic system, both recurrent and non-recurrent, is typically handled by rationing access rights to individual resources such as airports or important parts of the airspace. Under the planning paradigm employed in the U.S., this rationing process occurs independently at each resource. The stochastic integer programming model proposed in this paper brings coordination to this process while
Gibbs Sampling Based Distributed OFDMA Resource Allocation
Paris-Sud XI, Université de
sampling based algorithms to perform a distributed optimization that would lead to the global optimum number of BSs. Various stochastic optimization methods have been introducedsuch as particle swarm optimization, genetic algorithm, ant colony or tabu search [4]. These approaches generally require a knowledge
Three Dimensional Origin of AdS_2 Quantum Gravity
Alejandra Castro; Cynthia Keeler; Finn Larsen
We study AdS_2 quantum gravity with emphasis on consistency with results from AdS_3. We lift AdS_2 black holes to three dimensions and map fluctuations around the solutions. Comparison with near extremal BTZ are discussed, with due emphasis on global aspects. The results confirm that parameters like central charges and conformal weights computed directly in 2D are consistent with standard results in 3D. Applying our results to the thermodynamics of near extreme Kerr black holes, we show that AdS_2 quantum gravity gives the correct central charge c=12J, and the entropy of excitations above the extremal limit is captured correctly.
Ruin problems with stochastic premium stochastic return on investments
Rongming Wang; Lin Xu; Dingjun Yao
In this paper, ruin problems in the risk model with stochastic premium incomes and stochastic return on investments are studied.\\u000a The logarithm of the asset price process is assumed to be a L?vy process. An exact expression for expected discounted penalty\\u000a function is established. Lower bounds and two kinds of upper bounds for expected discounted penalty function are obtained\\u000a by
Dyonic AdS black holes from magnetohydrodynamics
Marco M. Caldarelli; Óscar J. C. Dias; Dietmar Klemm
We use the AdS\\/CFT correspondence to argue that large dyonic black holes in anti-de Sitter spacetime are dual to stationary solutions of the equations of relativistic magnetohydrodynamics on the conformal boundary of AdS. The dyonic Kerr-Newman-AdS4 solution corresponds to a charged diamagnetic fluid not subject to any net Lorentz force, due to orthogonal magnetic and electric fields compensating each other.
Stochastic geometry of turbulence
NASA Astrophysics Data System (ADS)
Falkovich, Gregory
Geometric statistics open the window into the most fundamental aspect of turbulence flows, their symmetries, both broken and emerging. On one hand, the study of the stochastic geometry of multi-point configurations reveals the statistical conservation laws which are responsible for the breakdown of scale invariance in direct turbulence cascades. On the other hand, the numerical and experimental studies of inverse cascade reveal that some families of isolines can be mapped to a Brownian walk (i.e. belong to the so-called SLE class) and are thus not only scale invariant but conformally invariant. That means that some aspects of turbulence statistics can be probably described by a conformal field theory. The talk is a review of broken and emerging symmetries in turbulence statistics.
Stochastic Coupled Cluster Theory
NASA Astrophysics Data System (ADS)
Thom, Alex J. W.
In an extension of the Full Configuration Interaction Monte Carlo method of Alavi et al., I describe a stochastic algorithm to perform Coupled Cluster Theory which represents excitation amplitudes as populations discrete excitation particles (excips) in the space of excitation operators (excitors). Re-expressing the Coupled Cluster equations as the dynamics of excips in this space, we show that a simple set of rules consisting of spawning, death, and annihilation steps suffice to evolve a distribution of in the space of excitors to sample the Coupled Cluster solution and correctly evaluate its energy. These rules are extremely simple to implement and not truncation-specific and thus this method can calculate solutions to an arbitrary level of truncation. I present results of CCSDTQ calculations on the neon atom with basis sets up to cc-pV6Z as well as calculations on the uniform electron gas beyond the capability of other present methods.
Bolotin, Y.L.; Gonchar, V.Y.; Inopin, E.V.; Levenko, V.V.; Tarasov, V.N.; Chekanov, N.A. (Khar'kov Physicotechnical Institute, Ukrainian Academy of Sciences, Khar'kov (UA))
The transition from regular to random motion is studied for collective nuclear processes with large amplitude. The connection between the features of the dynamics and the geometry of the potential-energy surface is studied. Some two-dimensional dynamical systems, including quadrupole surface vibrations of nuclei and induced nuclear fission, are studied in detail. Some quantum manifestations of classical stochasticity are investigated, in particular the connection between the statistical properties of the quantum energy spectra and the nature of the motion---regular or random---in the classical limit. For potentials with a localized region of negative Gaussian curvature there is found to be a triple transition: regularity--chaos--regularity, and its influence on the statistical properties of the spectrum is investigated.
Influence of a Stochastic Term on the Meszaros Effect
NASA Astrophysics Data System (ADS)
Silva, J. M.
In this work we rediscuss the Meszaros effect by taking into account possible stochastic effects due to the primeval thermal bath. By applying the Langevin approach, we analyze how the growing mode of the non-relativistic component evolves when a stochastic term is added to the evolution equation of the density contrast. For white noise, we conclude that the effect is very robust since the total growth of the increasing mode until the matter-radiation equilibrium is only 1.2 times the standard result if the coefficient of the Langevin force is of the order of unity. In principle, such a study may also be interesting after zeq when the Universe is dominated by cold dark matter but the baryonic component is still in thermal contact with the radiation fluid.
[Value-Added--Adding Economic Value in the Food Industry].
ERIC Educational Resources Information Center
Welch, Mary A., Ed.
This booklet focuses on the economic concept of "value added" to goods and services. A student activity worksheet illustrates how the steps involved in processing food are examples of the concept of value added. The booklet further links food processing to the idea of value added to the Gross National Product (GNP). Discussion questions, a student…
An inexact mixed risk-aversion two-stage stochastic programming model for water resources management under uncertainty.
Li, W; Wang, B; Xie, Y L; Huang, G H; Liu, L
Uncertainties exist in the water resources system, while traditional two-stage stochastic programming is risk-neutral and compares the random variables (e.g., total benefit) to identify the best decisions. To deal with the risk issues, a risk-aversion inexact two-stage stochastic programming model is developed for water resources management under uncertainty. The model was a hybrid methodology of interval-parameter programming, conditional value-at-risk measure, and a general two-stage stochastic programming framework. The method extends on the traditional two-stage stochastic programming method by enabling uncertainties presented as probability density functions and discrete intervals to be effectively incorporated within the optimization framework. It could not only provide information on the benefits of the allocation plan to the decision makers but also measure the extreme expected loss on the second-stage penalty cost. The developed model was applied to a hypothetical case of water resources management. Results showed that that could help managers generate feasible and balanced risk-aversion allocation plans, and analyze the trade-offs between system stability and economy. PMID:25226833
Dynamic advance reservation with delayed allocation
Vokkarane, Vinod; Somani, Arun
A method of scheduling data transmissions from a source to a destination, includes the steps of: providing a communication system having a number of channels and a number of paths, each of the channels having a plurality of designated time slots; receiving two or more data transmission requests; provisioning the transmission of the data; receiving data corresponding to at least one of the two or more data transmission requests; waiting until an earliest requested start time T.sub.s; allocating at the current time each of the two or more data transmission requests; transmitting the data; and repeating the steps of waiting, allocating, and transmitting until each of the two or more data transmission requests that have been provisioned for a transmission of data is satisfied. A system to perform the method of scheduling data transmissions is also described.
Inventory Allocation for Online Graphical Display Advertising
Yang, Jian; Vassilvitskii, Sergei; Tomlin, John; Shanmugasundaram, Jayavel; Anastasakos, Tasos; Kennedy, Oliver
We discuss a multi-objective/goal programming model for the allocation of inventory of graphical advertisements. The model considers two types of campaigns: guaranteed delivery (GD), which are sold months in advance, and non-guaranteed delivery (NGD), which are sold using real-time auctions. We investigate various advertiser and publisher objectives such as (a) revenue from the sale of impressions, clicks and conversions, (b) future revenue from the sale of NGD inventory, and (c) "fairness" of allocation. While the first two objectives are monetary, the third is not. This combination of demand types and objectives leads to potentially many variations of our model, which we delineate and evaluate. Our experimental results, which are based on optimization runs using real data sets, demonstrate the effectiveness and flexibility of the proposed model.
Statistical validation of stochastic models
Hunter, N.F. [Los Alamos National Lab., NM (United States). Engineering Science and Analysis Div.; Barney, P.; Paez, T.L. [Sandia National Labs., Albuquerque, NM (United States). Experimental Structural Dynamics Dept.; Ferregut, C.; Perez, L. [Univ. of Texas, El Paso, TX (United States). Dept. of Civil Engineering
It is common practice in structural dynamics to develop mathematical models for system behavior, and the authors are now capable of developing stochastic models, i.e., models whose parameters are random variables. Such models have random characteristics that are meant to simulate the randomness in characteristics of experimentally observed systems. This paper suggests a formal statistical procedure for the validation of mathematical models of stochastic systems when data taken during operation of the stochastic system are available. The statistical characteristics of the experimental system are obtained using the bootstrap, a technique for the statistical analysis of non-Gaussian data. The authors propose a procedure to determine whether or not a mathematical model is an acceptable model of a stochastic system with regard to user-specified measures of system behavior. A numerical example is presented to demonstrate the application of the technique.
Massive Stochastic Testing of SQL
Donald R. Slutz
Deterministic testing of SQL database systems is human intensive and cannot adequately cover the SQL input domain. A system (RAGS), was built to stochastically generate valid SQL statements 1 million times faster than a human and execute them.
A singular stochastic integral equation
Nualart, David; Sanz, Marta
This note is devoted to the discussion of the stochastic differential equation $ XdX + YdY = 0$, $ X$ and $ Y$ being continuous local martingales. A method to construct solutions of this equation is given....
Adding Value to Agricultural Products
Anderson, David P.; Hanselka, Daniel
You can significantly increase farm income by adding value to agricultural products and marketing those products effectively. This publication explains how to design a value-added product based on consumer preferences and how to build a business...
Server Allocation Algorithms for Tiered Systems
Kamalika Chaudhuri; Anshul Kothari; Rudi Pendavingh; Ram Swaminathan; Robert Endre Tarjan; Yunhong Zhou
Many web-based systems have a tiered application architecture, in which a request needs to transverse all the tiers before\\u000a finishing its processing. One of the most important QoS metrics for these applications is the expected response time for the\\u000a user. Since the expected response time in any tier depends upon the number of servers allocated to this tier, and a
Robust resource allocations in temporal networks
Wolfram Wiesemann; Daniel Kuhn; Berç Rustem
Temporal networks describe workflows of time-consuming tasks whose processing order is constrained by precedence relations.\\u000a In many cases, the durations of the network tasks can be influenced by the assignment of resources. This leads to the problem\\u000a of selecting an 'optimal' resource allocation, where optimality is measured by network characteristics such as the makespan\\u000a (i.e., the time required to complete
Improving Register Allocation for Subscripted Variables
David Callahan; Steve Carr; Ken Kennedy
Most conventional compilers fail to allocate array el- ements to registers because standard data-flow anal- ysis treats arrays like scalars, making it impossible to analyze the definitions and uses of individual array elements. This deficiency is particularly troublesome for floating-point registers, which are most often used as temporary repositories for subscripted variables. In this paper, we present a source-to-source trans-
Railway track allocation: models and methods
Richard M. Lusby; Jesper Larsen; Matthias Ehrgott; David Ryan
Efficiently coordinating the movement of trains on a railway network is a central part of the planning process for a railway\\u000a company. This paper reviews models and methods that have been proposed in the literature to assist planners in finding train\\u000a routes. Since the problem of routing trains on a railway network entails allocating the track capacity of the network
Rethinking Reinforcement: Allocation, Induction, and Contingency
Baum, William M
The concept of reinforcement is at least incomplete and almost certainly incorrect. An alternative way of organizing our understanding of behavior may be built around three concepts: allocation, induction, and correlation. Allocation is the measure of behavior and captures the centrality of choice: All behavior entails choice and consists of choice. Allocation changes as a result of induction and correlation. The term induction covers phenomena such as adjunctive, interim, and terminal behavior—behavior induced in a situation by occurrence of food or another Phylogenetically Important Event (PIE) in that situation. Induction resembles stimulus control in that no one-to-one relation exists between induced behavior and the inducing event. If one allowed that some stimulus control were the result of phylogeny, then induction and stimulus control would be identical, and a PIE would resemble a discriminative stimulus. Much evidence supports the idea that a PIE induces all PIE-related activities. Research also supports the idea that stimuli correlated with PIEs become PIE-related conditional inducers. Contingencies create correlations between "operant" activity (e.g., lever pressing) and PIEs (e.g., food). Once an activity has become PIE-related, the PIE induces it along with other PIE-related activities. Contingencies also constrain possible performances. These constraints specify feedback functions, which explain phenomena such as the higher response rates on ratio schedules in comparison with interval schedules. Allocations that include a lot of operant activity are "selected" only in the sense that they generate more frequent occurrence of the PIE within the constraints of the situation; contingency and induction do the "selecting." PMID:22287807
Software pipelining with register allocation and spilling
Jian Wangt; Andreas Krall; M. Anton Ertl; Christine Eisenbeis
This paper studies the problem of simultaneous register allocation and software pipelining. We present the Register Requirement Graph to dynamically reflect the register requirement during software pipelining and develop a Register-Pressure-Sensitive (RPS) scheduling technique. Three algorithms—RPS without spilling, RPS with spilling and software pipelining with a limited number of registers—are proposed. The preliminary experimental results show the efficiency of the
Software pipelining with register allocation and spilling
Jian Wangt; Andreas Krall; M. Anton Ertl; Christine Eisenbeis
This paper studies the problem of simultaneous register allocation and software pipelining. We present the register requirement graph to dynamically reflect the register requirement during software pipelining and develop a Register-Pressure-Sensitive (RPS) scheduling technique. Three algorithms-RPS without spilling, RPS with spilling and software pipelining with a limited number of registers-are proposed. The preliminary experimental results show the efficiency of the
Asset Allocation Dynamics and Pension Fund Performance
David Blake; Bruce N. Lehmann; Allan Timmermann
Using a data set on more than 300 U.K. pension funds' asset holdings, this article provides a systematic investigation of the performance of managed portfolios across multiple asset classes. We find evidence of slow mean reversion in the funds' portfolio weights toward a common, time-varying strategic asset allocation. We also find surprisingly little cross-sectional variation in the average ex post
Schwinger Mechanism with Stochastic Quantization
Kenji Fukushima; Tomoya Hayata
We prescribe a formulation of the particle production with real-time Stochastic Quantization. To construct the retarded and the time-ordered propagators we decompose the stochastic variables into positive- and negative-energy parts. In this way we demonstrate how to derive a standard formula for the Schwinger mechanism under time-dependent electric fields. We discuss a mapping to the Schwinger-Keldysh formalism and a relation to the classical statistical simulation.
Optimal stochastic enhancement of photoionization.
Singh, Kamal P; Rost, Jan M
The effect of noise on the nonlinear photoionization of an atom due to a femtosecond pulse is investigated in the framework of the stochastic Schrödinger equation. A modest amount of white noise results in an enhancement of the net ionization yield by several orders of magnitude, giving rise to a form of quantum stochastic resonance. We demonstrate that this effect is preserved if the white noise is replaced by broadband chaotic light. PMID:17501395
Stochastic efficiency: five case studies
NASA Astrophysics Data System (ADS)
Proesmans, Karel; Van den Broeck, Christian
Stochastic efficiency is evaluated in five case studies: driven Brownian motion, effusion with a thermo-chemical and thermo-velocity gradient, a quantum dot and a model for information to work conversion. The salient features of stochastic efficiency, including the maximum of the large deviation function at the reversible efficiency, are reproduced. The approach to and extrapolation into the asymptotic time regime are documented.
Optimal allocation of trend following strategies
NASA Astrophysics Data System (ADS)
Grebenkov, Denis S.; Serror, Jeremy
We consider a portfolio allocation problem for trend following (TF) strategies on multiple correlated assets. Under simplifying assumptions of a Gaussian market and linear TF strategies, we derive analytical formulas for the mean and variance of the portfolio return. We construct then the optimal portfolio that maximizes risk-adjusted return by accounting for inter-asset correlations. The dynamic allocation problem for n assets is shown to be equivalent to the classical static allocation problem for n2 virtual assets that include lead-lag corrections in positions of TF strategies. The respective roles of asset auto-correlations and inter-asset correlations are investigated in depth for the two-asset case and a sector model. In contrast to the principle of diversification suggesting to treat uncorrelated assets, we show that inter-asset correlations allow one to estimate apparent trends more reliably and to adjust the TF positions more efficiently. If properly accounted for, inter-asset correlations are not deteriorative but beneficial for portfolio management that can open new profit opportunities for trend followers. These concepts are illustrated using daily returns of three highly correlated futures markets: the E-mini S&P 500, Euro Stoxx 50 index, and the US 10-year T-note futures.
Adapting water allocation management to drought scenarios
NASA Astrophysics Data System (ADS)
Giacomelli, P.; Rossetti, A.; Brambilla, M.
Climate change dynamics have significant consequences on water resources on a watershed scale. With water becoming scarcer and susceptible to variation, the planning and reallocation decisions in watershed management need to be reviewed. This research focuses on an in-depth understanding of the current allocation balance of water resources among competitors, placed along the course of the Adda River. In particular, during the summer period, the demand for water dramatically increases. This is due to the increase in irrigation activities in the lower part of the basin and to the highest peaks of tourist inflow, in the Como Lake and Valtellina areas. Moreover, during these months, the hydroelectric reservoirs in the upper part of the Adda River basin (the Valtellina) retain most of the volume of water coming from the snow and glacier melt. The existing allocation problem among these different competing users is exacerbated by the decreasing water supplies. The summer of 2003 testified the rise in a number of allocation problems and situations of water scarcity that brought about environmental and economical consequences. The RICLIC project is committed to the understanding of water dynamics on a regional scale, to quantify the volumes involved and offer local communities an instrument to improve a sustainable water management system, within uncertain climate change scenarios.
Why VCG auctions can hardly be applied to the pricing of inter-domain and ad hoc networks
Tuffin, Bruno
Why VCG auctions can hardly be applied to the pricing of inter-domain and ad hoc networks Patrick among users (pricing is then used to control congestion); however, computing allocations and prices. · If there are no such resource constraints, pricing aims at incentivizing intermediate agents to transfer traffic
Value Added in English Schools
ERIC Educational Resources Information Center
Ray, Andrew; McCormack, Tanya; Evans, Helen
Value-added indicators are now a central part of school accountability in England, and value-added information is routinely used in school improvement at both the national and the local levels. This article describes the value-added models that are being used in the academic year 2007-8 by schools, parents, school inspectors, and other…
Stochasticity, succession, and environmental perturbations in a fluidic ecosystem
Zhou, Jizhong; Deng, Ye; Zhang, Ping; Xue, Kai; Liang, Yuting; Van Nostrand, Joy D.; Yang, Yunfeng; He, Zhili; Wu, Liyou; Stahl, David A.; Hazen, Terry C.; Tiedje, James M.; Arkin, Adam P.
Unraveling the drivers of community structure and succession in response to environmental change is a central goal in ecology. Although the mechanisms shaping community structure have been intensively examined, those controlling ecological succession remain elusive. To understand the relative importance of stochastic and deterministic processes in mediating microbial community succession, a unique framework composed of four different cases was developed for fluidic and nonfluidic ecosystems. The framework was then tested for one fluidic ecosystem: a groundwater system perturbed by adding emulsified vegetable oil (EVO) for uranium immobilization. Our results revealed that groundwater microbial community diverged substantially away from the initial community after EVO amendment and eventually converged to a new community state, which was closely clustered with its initial state. However, their composition and structure were significantly different from each other. Null model analysis indicated that both deterministic and stochastic processes played important roles in controlling the assembly and succession of the groundwater microbial community, but their relative importance was time dependent. Additionally, consistent with the proposed conceptual framework but contradictory to conventional wisdom, the community succession responding to EVO amendment was primarily controlled by stochastic rather than deterministic processes. During the middle phase of the succession, the roles of stochastic processes in controlling community composition increased substantially, ranging from 81.3% to 92.0%. Finally, there are limited successional studies available to support different cases in the conceptual framework, but further well-replicated explicit time-series experiments are needed to understand the relative importance of deterministic and stochastic processes in controlling community succession. PMID:24550501
Morten Moshagen; Jochen Musch; Edgar Erdfelder
Surveys on sensitive issues provide distorted prevalence estimates when participants fail to respond truthfully. The randomized-response\\u000a technique (RRT) encourages more honest responding by adding random noise to responses, thereby removing any direct link between\\u000a a participant's response and his or her true status with regard to a sensitive attribute. However, in spite of the increased\\u000a confidentiality, some respondents still refuse
Systemic risk in dynamical networks with stochastic failure criterion
NASA Astrophysics Data System (ADS)
Podobnik, B.; Horvatic, D.; Bertella, M. A.; Feng, L.; Huang, X.; Li, B.
Complex non-linear interactions between banks and assets we model by two time-dependent Erd?s-Renyi network models where each node, representing a bank, can invest either to a single asset (model I) or multiple assets (model II). We use a dynamical network approach to evaluate the collective financial failure —systemic risk— quantified by the fraction of active nodes. The systemic risk can be calculated over any future time period, divided into sub-periods, where within each sub-period banks may contiguously fail due to links to either i) assets or ii) other banks, controlled by two parameters, probability of internal failure p and threshold Th ("solvency" parameter). The systemic risk decreases with the average network degree faster when all assets are equally distributed across banks than if assets are randomly distributed. The more inactive banks each bank can sustain (smaller Th), the smaller the systemic risk —for some Th values in I we report a discontinuity in systemic risk. When contiguous spreading becomes stochastic ii) controlled by probability p2 —a condition for the bank to be solvent (active) is stochastic— the systemic risk decreases with decreasing p2. We analyse the asset allocation for the U.S. banks.
Black Hole Astrophysics in AdS Braneworlds
NASA Astrophysics Data System (ADS)
Emparan, Roberto; García-Bellido, Juan; Kaloper, Nemanja
We consider astrophysics of large black holes localized on the brane in the infinite Randall-Sundrum model. Using their description in terms of a conformal field theory (CFT) coupled to gravity, deduced in ref. [1], we show that they undergo a period of rapid decay via Hawking radiation of CFT modes. For example, a black hole of mass few × Modot would shed most of its mass in ~ 104-105 years if the AdS radius is L ~ 10-1 mm, currently the upper bound from table-top experiments. Since this is within the mass range of X-ray binary systems containing a black hole, the evaporation enhanced by the hidden sector CFT modes could cause the disappearance of X-ray sources on the sky. This would be a striking signature of RS2 with a large AdS radius. Alternatively, for shorter AdS radii, the evaporation would be slower. In such cases, the persistence of X-ray binaries with black holes already implies an upper bound on the AdS radius of Llesssim10-2 mm, an order of magnitude better than the bounds from table-top experiments. The observation of primordial black holes with a mass in the MACHO range M ~ 0.1-0.5 Modot and an age comparable to the age of the universe would further strengthen the bound on the AdS radius to Llesssimfew × 10-6 mm.
NASA Astrophysics Data System (ADS)
Kikuchi, Kenji
Accelerator driven nuclear transmutation system has been pursued to have a clue to the solution of high-level radioactive waste management. The concept consists of super conducting linac, sub-critical reactor and the beam window. Reference model is set up to 800MW thermal power by using 1.5GeV proton beams with considerations multi-factors such as core criticality. Materials damage is simulated by high-energy particle transport codes and so on. Recent achievement on irradiation materials experiment is stated and the differences are pointed out if core burn-up is considered or not. Heat balance in tank-type ADS indicates the temperature conditions of steam generator, the beam widow and cladding materials. Lead-bismuth eutectics demonstration has been conducted. Corrosion depth rate was shown by experiments.
Adding and Subtracting Integers
NSDL National Science Digital Library
Mrs. Richins
Now that you have mastered the common math operations of adding, subtracting, multiplying and dividing, you are ready to tackle some more challenging, yet practical problems. For example: How much money do you have if your Mom paid you $20 for every time you mowed the lawn, but you had to pay your little brother $5 for every time he helped you, and together you accomplished the job 7 times? Or how about this one: if you picked 5 apples but 2 were rotten and you had to divide them equally between you and your five friends, how much would each person get? Current Knowledge You will need a piece of paper to record information and to write down examples, so grab one now. Number the paper from 1 to 10. Get with a partner and write down how you think the equations to solve the above problems will be written. Write these ...
Stochastic spur gear dynamics by numerical path integration
NASA Astrophysics Data System (ADS)
Naess, A.; Kolnes, F. E.; Mo, E.
In this paper the method of numerical path integration is applied to investigate the dynamics of a model of a pair of meshing spur gears. Our approach is based on the observation that the dynamics of a nonlinear mechanical system excited by a deterministic loading process can, to a large extent, be characterized by the response obtained by adding a small white noise to the loading. By this, the response can be expressed as a Markov diffusion process, which makes available the powerful toolbox of stochastic analysis, in particular the path integration method.
Signal amplification in a nanomechanical Duffing resonator via stochastic resonance
NASA Astrophysics Data System (ADS)
Almog, Ronen; Zaitsev, Stav; Shtempluck, Oleg; Buks, Eyal
The authors experimentally study stochastic resonance in a nonlinear bistable nanomechanical doubly clamped beam resonator, which is capacitively excited by an adjacent gate electrode. The resonator is tuned to its bistability region by an intense pump near a point of equal transition rates between its two metastable states. The pump is amplitude modulated, inducing modulation of the activation barrier between the states. When noise is added to the excitation, resonator's displacement exhibits noise dependent amplification of the modulation signal. They measure resonator's response in the time and frequency domains, the spectral amplification, and the statistical distribution of the jump time.
Stochastic Resonance for a SQUID with Dichotomous Resistance
NASA Astrophysics Data System (ADS)
Li, Jing-Hui
We investigate the response to the ac current for a superconducting quantum interference device (SQUID) with a dichotomous resistance. It is shown that, for some suitably selected parameters' values, stochastic resonance appears for the amplitude of the stationary average voltage of the SQUID versus the correlation time of the dichotomous noise. Our result can provide some useful insights for the investigation of the response of the SQUID (especially for the ones with the nano junctions) to the temporal-periodic signal (including the input ac current, the irradiation microwave, the detected temporal-periodic signal, and the added ac voltage).
Brennan J. M.; Blaskiewicz, M.; Mernick, K.
The full 6-dimensional [x,x'; y,y'; z,z'] stochastic cooling system for RHIC was completed and operational for the FY12 Uranium-Uranium collider run. Cooling enhances the integrated luminosity of the Uranium collisions by a factor of 5, primarily by reducing the transverse emittances but also by cooling in the longitudinal plane to preserve the bunch length. The components have been deployed incrementally over the past several runs, beginning with longitudinal cooling, then cooling in the vertical planes but multiplexed between the Yellow and Blue rings, next cooling both rings simultaneously in vertical (the horizontal plane was cooled by betatron coupling), and now simultaneous horizontal cooling has been commissioned. The system operated between 5 and 9 GHz and with 3 x 10{sup 8} Uranium ions per bunch and produces a cooling half-time of approximately 20 minutes. The ultimate emittance is determined by the balance between cooling and emittance growth from Intra-Beam Scattering. Specific details of the apparatus and mathematical techniques for calculating its performance have been published elsewhere. Here we report on: the method of operation, results with beam, and comparison of results to simulations.
Interaction as stochastic noise
Roberto D'Agosta
Interaction is so ubiquitous that imaging a world free from it is a difficult fantasy exercise. At the same time, in understanding any complex physical system, our ability of accounting for the mutual interaction of its constituents is often insufficient when not the restraining factor. Many strategies have been devised to control particle-particle interaction and explore the diverse regimes, from weak to strong interaction. Beautiful examples of these achievements are the experiments on Bose condensates, or the recent experiments on the dynamics of spin chains. Here I introduce another possibility, namely replacing the particle-particle interaction with an external stochastic field, and once again reducing the dynamics of a many-body system to the dynamics of single-particle systems. The theory is exact, in the sense that no approximations are introduced in decoupling the many-body system in its non-interacting sub-parts. Moreover, the equations of motion are linear, and no unknown external potential is inserted.
NASA Astrophysics Data System (ADS)
McDonnell, Mark D.; Amblard, Pierre-Olivier; Stocks, Nigel G.
We introduce and define the concept of a stochastic pooling network (SPN), as a model for sensor systems where redundancy and two forms of 'noise'—lossy compression and randomness—interact in surprising ways. Our approach to analysing SPNs is information theoretic. We define an SPN as a network with multiple nodes that each produce noisy and compressed measurements of the same information. An SPN must combine all these measurements into a single further compressed network output, in a way dictated solely by naturally occurring physical properties—i.e. pooling—and yet cause no (or negligible) reduction in mutual information. This means that SPNs exhibit redundancy reduction as an emergent property of pooling. The SPN concept is applicable to examples in biological neural coding, nanoelectronics, distributed sensor networks, digital beamforming arrays, image processing, multiaccess communication networks and social networks. In most cases the randomness is assumed to be unavoidably present rather than deliberately introduced. We illustrate the central properties of SPNs for several case studies, where pooling occurs by summation, including nodes that are noisy scalar quantizers, and nodes with conditionally Poisson statistics. Other emergent properties of SPNs and some unsolved problems are also briefly discussed.
On Revenue Maximization in Second-Price Ad Auctions
Azar, Yossi; Karlin, Anna R; Nguyen, C Thach
Most recent papers addressing the algorithmic problem of allocating advertisement space for keywords in sponsored search auctions assume that pricing is done via a first-price auction, which does not realistically model the Generalized Second Price (GSP) auction used in practice. Towards the goal of more realistically modeling these auctions, we introduce the Second-Price Ad Auctions problem, in which bidders' payments are determined by the GSP mechanism. We show that the complexity of the Second-Price Ad Auctions problem is quite different than that of the more studied First-Price Ad Auctions problem. First, unlike the first-price variant, for which small constant-factor approximations are known, it is NP-hard to approximate the Second-Price Ad Auctions problem to any non-trivial factor. Second, this discrepancy extends even to the 0-1 special case that we call the Second-Price Matching problem (2PM). In particular, offline 2PM is APX-hard, and for online 2PM there is no deterministic algorithm achieving a n...
Worldsheet scattering in AdS3/CFT2
NASA Astrophysics Data System (ADS)
Sundin, Per; Wulff, Linus
We confront the recently proposed exact S-matrices for AdS 3/ CFT 2 with direct worldsheet calculations. Utilizing the BMN and Near Flat Space (NFS) expansions for strings on AdS 3 × S 3 × S 3 × S 1 and AdS 3 × S 3 × T 4 we compute both tree-level and one-loop scattering amplitudes. Up to some minor issues we find nice agreement in the tree-level sector. At the one-loop level however we find that certain non-zero tree-level processes, which are not visible in the exact solution, contribute, via the optical theorem, and give an apparent mismatch for certain amplitudes. Furthermore we find that a proposed one-loop modification of the dressing phase correctly reproduces the worldsheet calculation while the standard Hernandez-Lopez phase does not. We also compute several massless to massless processes.
Comments on String Theory on $AdS_3$
Amit Giveon; David Kutasov; Nathan Seiberg
We study string propagation on $AdS_3$ times a compact space from an ``old fashioned'' worldsheet point of view of perturbative string theory. We derive the spacetime CFT and its Virasoro and current algebras, thus establishing the conjectured $AdS$\\/CFT correspondence for this case in the full string theory. Our results have implications for the extreme IR limit of the $D1-D5$ system,
Mixed-symmetry fields in AdS(5), conformal fields, and AdS/CFT
NASA Astrophysics Data System (ADS)
Metsaev, R. R.
Mixed-symmetry arbitrary spin massive, massless, and self-dual massive fields in AdS(5) are studied. Light-cone gauge actions for such fields leading to decoupled equations of motion are constructed. Light-cone gauge formulation of mixed-symmetry anomalous conformal currents and shadows in 4d flat space is also developed. AdS/CFT correspondence for normalizable and non-normalizable modes of mixed-symmetry AdS fields and the respective boundary mixed-symmetry anomalous conformal currents and shadows is studied. We demonstrate that the light-cone gauge action for massive mixed-symmetry AdS field evaluated on solution of the Dirichlet problem amounts to the light-cone gauge 2-point vertex of mixed-symmetry anomalous shadow. Also we show that UV divergence of the action for mixed-symmetry massive AdS field with some particular value of mass parameter evaluated on the Dirichlet problem amounts to the action of long mixed-symmetry conformal field, while UV divergence of the action for mixed-symmetry massless AdS field evaluated on the Dirichlet problem amounts to the action of short mixed-symmetry conformal field. We speculate on string theory interpretation of a model which involves short low-spin conformal fields and long higher-spin conformal fields.
Mixed-symmetry fields in AdS(5), conformal fields, and AdS/CFT
R. R. Metsaev
Mixed-symmetry arbitrary spin massive, massless, and self-dual massive fields in AdS(5) are studied. Light-cone gauge actions for such fields leading to decoupled equations of motion are constructed. Light-cone gauge formulation of mixed-symmetry anomalous conformal currents and shadows in 4d flat space is also developed. AdS/CFT correspondence for normalizable and non-normalizable modes of mixed-symmetry AdS fields and the respective boundary mixed-symmetry anomalous conformal currents and shadows is studied. We demonstrate that the light-cone gauge action for massive mixed-symmetry AdS field evaluated on solution of the Dirichlet problem amounts to the light-cone gauge 2-point vertex of mixed-symmetry anomalous shadow. Also we show that UV divergence of the action for mixed-symmetry massive AdS field with some particular value of mass parameter evaluated on the Dirichlet problem amounts to the action of long mixed-symmetry conformal field, while UV divergence of the action for mixed-symmetry massless AdS field evaluated on the Dirichlet problem amounts to the action of short mixed-symmetry conformal field. We speculate on string theory interpretation of a model which involves short low-spin conformal fields and long higher-spin conformal fields.
Topology-aware resource allocation for data-intensive workloads
Gunho Lee; Niraj Tolia; Parthasarathy Ranganathan; Randy H. Katz
This paper proposes an architecture for optimized resource allocation in Infrastructure-as-a-Service (IaaS)-based cloud systems. Current IaaS systems are usually unaware of the hosted application's requirements and therefore allocate resources independently of its needs, which can significantly impact performance for distributed data-intensive applications. To address this resource allocation problem, we propose an architecture that adopts a what if methodology to guide
Topology-aware resource allocation for data-intensive workloads
Gunho Lee; Niraj Tolia; Parthasarathy Ranganathan; Randy H. Katz
This paper proposes an architecture for optimized resource allocation in Infrastructure-as-a-Service (IaaS)-based cloud systems. Current IaaS systems are usually unaware of the hosted application's requirements and therefore allocate resources independently of its needs, which can significantly impact performance for distributed data-intensive applications. To address this resource allocation problem, we propose an architecture that adopts a \\
Allocating timber to mills based on stand and mill characteristics
Rodgers, Joseph Adam
Value Factors. Database Development Inventory Conversion Allocation Module Development. System Performance Evaluation. IV. REVIEW OF THE LITERATURE Forest Planning. Timber Valuation Optimization of Product Yields Resource Allocation Techniques... allocation of timber. The size and grade of the timber and distance to the mill are among the factors This thesis follows the form of Forest Products Journal. which influence the quantity and value of the products produced. The farther a stand is from a...
Optimal bit allocation via the generalized BFOS algorithm
Eve A. Riskin
We analyze the use of the generalized Breiman, Friedman, Olshen, andStone (BFOS) algorithm, a recently developed technique for variable rate vectorquantizer design, for optimal bit allocation. It is shown that if each source hasa convex quantizer function then the complexity of the algorithm is low.Key Words: Bit allocation, vector quantization, tree coding1 IntroductionIn bit allocation, a given number of bits
Recipient allocation preferences and organizational choices: a fit perspective
Gogus, Celile Itir
(e.g., Deutsch, 1985). Effective allocation processes are essential for the well-being of an organization as proper distributions are necessary for achieving organizational goals such as high levels of performance and maintenance of harmony within... involved, or making allocations randomly (Deutsch, 1975; Conlon, Porter & Parks, 2004). A decision-maker?s choice of an allocation norm is important not only because distributions have important individual and collective consequences (Leventhal, 1980...
Power allocation algorithms in parallel relay communication networks
Rui Zhao; Canhui Cai; Donghua Chen
We consider a parallel relay communication network based on the nonorthorgonal amplify-and-forward protocol. We design two optimal power allocation schemes: separate power allocation (SPA) of the relays using the improved water-filling algorithm and joint power allocation (JPA) of the source and relays using convex optimization algorithm. Simulation results show that, in the fading channels with path loss, the proposed JPA
Allocation of energy use in petroleum refineries to petroleum products
Michael Wang; Hanjie Lee; John Molburg
Aim, Scope, and Background Studies to evaluate the energy and emission impacts of vehicle\\/fuel systems have to address allocation of the energy use and\\u000a emissions associated with petroleum refineries to various petroleum products because refineries produce multiple products.\\u000a The allocation is needed in evaluating energy and emission effects of individual transportation fuels. Allocation methods\\u000a used so far for petroleum-based fuels (e.g.,
Allocation of multiport memories for hierarchical data streams
P. E. R. Lippens; J. L. van Meerbergen; W. F. J. Verhaegh; A. van der Werf
A multiport memory allocation problem for hierarchical, i.e. multi-dimensional, data streams is described. Memory allocation techniques are used in high level synthesis for foreground and background memory allocation, the design of data format converters, and the design of synchronous inter-processor communication hardware. The techniques presented in this paper differ from other approaches in the sense that data streams are considered
Allocation of multiport memories for hierarchical data stream
Paul E. R. Lippens; Jef L. van Meerbergen; Wim F. J. Verhaegh; Albert van der Werf
In this paper a multiport memory allocation problem for hierarchical, i.e. multi-dimensional, data streams is described. Memory allocation techniques are used in high level synthesis for foreground and background memory allocation, the design of data format converters, and the design of synchronous inter-processor communication hardware. The techniques presented in this paper differ from other approaches in literature in the sense
Reward Allocation and CultureA Meta-Analysis
Ronald Fischer; Peter B. Smith
A meta-analysis is reported of those cross-cultural reward allocation studies in which the allocator was not a recipient of the allocation. Results from 25 studies in 14 different cultures were included. Previous narrative reviews of the literature have used individualism-collectivism as an explanatory framework. However, it was found that Schwartz's hierarchy and Hofstede's power distance dimensions account best for cross-cultural
Outline Perspective Structure Analysis Stochastics Some Issues in Stochastic Variational Problems
Outline Perspective Structure Analysis Stochastics Some Issues in Stochastic Variational Problems Dec 2009 Robinson UW-Madison Stochastic VP #12;Outline Perspective Structure Analysis Stochastics Outline of Topics 1 Variational Problems: A Different View 2 Structure and Analysis 3 How Can We Use This
Phase transitions in warped AdS3 gravity
NASA Astrophysics Data System (ADS)
Detournay, Stéphane; Zwikel, Céline
We consider asymptotically Warped AdS3 black holes in Topologically Massive Gravity. We study their thermodynamic stability and show the existence of a Hawking-Page phase transition between the black hole and thermal background phases. At zero angular potential, the latter is shown to occur at the self-dual point of the dual Warped Conformal Field Theory partition function, in analogy with the phase transition for BTZ black holes in AdS3/CFT2. We also discuss how the central and vacuum charges can be obtained from inner horizon mechanics in the presence of a gravitational anomaly.
Enhanced algorithms for stochastic programming
Krishna, A.S.
In this dissertation, we present some of the recent advances made in solving two-stage stochastic linear programming problems of large size and complexity. Decomposition and sampling are two fundamental components of techniques to solve stochastic optimization problems. We describe improvements to the current techniques in both these areas. We studied different ways of using importance sampling techniques in the context of Stochastic programming, by varying the choice of approximation functions used in this method. We have concluded that approximating the recourse function by a computationally inexpensive piecewise-linear function is highly efficient. This reduced the problem from finding the mean of a computationally expensive functions to finding that of a computationally inexpensive function. Then we implemented various variance reduction techniques to estimate the mean of a piecewise-linear function. This method achieved similar variance reductions in orders of magnitude less time than, when we directly applied variance-reduction techniques directly on the given problem. In solving a stochastic linear program, the expected value problem is usually solved before a stochastic solution and also to speed-up the algorithm by making use of the information obtained from the solution of the expected value problem. We have devised a new decomposition scheme to improve the convergence of this algorithm.
Bayesian Statistics Stochastic Simulation -Gibbs sampling
Wright, Francis
Bayesian Statistics Stochastic Simulation - Gibbs sampling Bayesian Statistics - an Introduction Dr Pettit Bayesian Statistics - an Introduction #12;Bayesian Statistics Stochastic Simulation - Gibbs sampling What is Bayesian Statistics? Bayes Theorem The Likelihood Principle Mixtures of conjugate priors
Stochastic Frontiers and Asymmetric Information Models
Boyer, Edmond
Stochastic Frontiers and Asymmetric Information Models Philippe Gagnepain Departamento de Economía and production stochastic frontiers; asymmetric information; technical inefficiency; effort; regulation; test or conferences. Under a slightly different title, this paper has been presented at The ASSET Conference
Survey of Transmission Cost Allocation Methodologies for Regional Transmission Organizations
Fink, S.; Porter, K.; Mudd, C.; Rogers, J.
The report presents transmission cost allocation methodologies for reliability transmission projects, generation interconnection, and economic transmission projects for all Regional Transmission Organizations.
Characterizing contract-based multiagent resource allocation in networks.
An, Bo; Lesser, Victor
We consider a multiagent resource allocation problem where individual users intend to route traffic by requesting the help of entities across a network, and a cost is incurred at each network node that depends on the amount of traffic to be routed. We propose to study contract-based network resource allocation. In our model, users and nodes in the network make contracts before nodes route traffic for the users. The problem is an interesting self-interested negotiation problem because it requires the complete assembly of a set of distinct resources, and there are multiple combinations of distinct resources that could satisfy the goal of negotiation. First, we characterize the network allocation problem and show that finding optimal allocations is NP-complete and is inapproximable. We take both Nash equilibrium and pairwise Nash equilibrium as the solution concepts to characterize the equilibrium allocations. We find that, for any resource allocation game, Nash equilibrium and pairwise Nash equilibrium always exist. In addition, socially optimal allocations are always supported by Nash equilibrium and pairwise Nash equilibrium. We introduce best-response dynamics in which each agent takes a myopic best-response strategy and interacts with each other to dynamically form contracts. We analyze the convergence of the dynamics in some special cases. We also experimentally study the convergence rate of the dynamics and how efficient the evolved allocation is as compared with the optimal allocation in a variety of environments. PMID:19955040
Fault and the allocation of spare organs.
Smart, B
This paper argues that rectificatory justice should supplement distributive justice in allocating priority of access to scarce medical resources. Where a patient is at fault for the scarcity of healthy organs a principle of restitution requires that she should give priority to the faultless. Such restitution is non-punitive, and is akin to reparation in civil law, not criminal law. However, it is doubtful whether such a principle can be fairly applied within the present culture of governmental complicity in cigarette advertising. PMID:8035435
Transport in a stochastic magnetic field
White, R.B.; Wu, Yanlin (Princeton Univ., NJ (United States). Plasma Physics Lab.); Rax, J.M. (Association Euratom-CEA, Centre d'Etudes Nucleaires de Cadarache, 13 -Saint-Paul-lez-Durance (France). Dept. de Recherches sur la Fusion Controlee)
Collisional heat transport in a stochastic magnetic field configuration is investigated. Well above stochastic threshold, a numerical solution of a Chirikov-Taylor model shows a short-time nonlocal regime, but at large time the Rechester-Rosenbluth effective diffusion is confirmed. Near stochastic threshold, subdiffusive behavior is observed for short mean free paths. The nature of this subdiffusive behavior is understood in terms of the spectrum of islands in the stochastic sea.
Transport in a stochastic magnetic field
White, R.B.; Wu, Yanlin [Princeton Univ., NJ (United States). Plasma Physics Lab.; Rax, J.M. [Association Euratom-CEA, Centre d`Etudes Nucleaires de Cadarache, 13 -Saint-Paul-lez-Durance (France). Dept. de Recherches sur la Fusion Controlee
Collisional heat transport in a stochastic magnetic field configuration is investigated. Well above stochastic threshold, a numerical solution of a Chirikov-Taylor model shows a short-time nonlocal regime, but at large time the Rechester-Rosenbluth effective diffusion is confirmed. Near stochastic threshold, subdiffusive behavior is observed for short mean free paths. The nature of this subdiffusive behavior is understood in terms of the spectrum of islands in the stochastic sea.
On the comparative allocation of biomass, energy, and nutrients in plants
W. G. Abrahamson; H. Caswell
The objective of this study was to test the assumption that biomass allocation, energy allocation, and nutrient element allocation are equivalent for studies involving ecological-strategy analysis in plants. The results for the semelparous Verbascum thapsus and five iteroparous Solidago species show that the mineral elements examined are allocated differently than biomass. Thus, in a study aimed at estimating the allocation
Hartung, Thomas
Taking the 110th anniversary of marketing of aspirin as starting point, the almost scary toxicological profile of aspirin is contrasted with its actual use experience. The author concludes that we are lucky that, in 1899, there was no regulatory toxicology. Adding, for the purpose of this article, a fourth R to the Three Rs, i.e. Realism, three reality-checks are carried out. The first one comes to the conclusion that the tools of toxicology are hardly adequate for the challenges ahead. The second one concludes that, specifically, the implementation of the EU REACH system is not feasible with these tools, mainly with regard to throughput. The third one challenges the belief that classical alternative methods, i.e. replacing animal test-based tools one by one, is actually leading to a new toxicology - it appears to change only patches of the patchwork, but not to overcome any inherent limitations other than ethical ones. The perspective lies in the Toxicology for the 21st Century initiatives, which aim to create a new approach from the scratch, by an evidence-based toxicology and a global "Human Toxicology Programme". PMID:20105011
Stochastic simulation of chemical kinetics.
Gillespie, Daniel T
Stochastic chemical kinetics describes the time evolution of a well-stirred chemically reacting system in a way that takes into account the fact that molecules come in whole numbers and exhibit some degree of randomness in their dynamical behavior. Researchers are increasingly using this approach to chemical kinetics in the analysis of cellular systems in biology, where the small molecular populations of only a few reactant species can lead to deviations from the predictions of the deterministic differential equations of classical chemical kinetics. After reviewing the supporting theory of stochastic chemical kinetics, I discuss some recent advances in methods for using that theory to make numerical simulations. These include improvements to the exact stochastic simulation algorithm (SSA) and the approximate explicit tau-leaping procedure, as well as the development of two approximate strategies for simulating systems that are dynamically stiff: implicit tau-leaping and the slow-scale SSA. PMID:17037977
Correlation Functions in Stochastic Inflation
Vennin, Vincent
Combining the stochastic and $\\delta N$ formalisms, we derive non perturbative analytical expressions for all correlation functions of scalar perturbations in single-field, slow-roll inflation. The standard, classical formulas are recovered as saddle-point limits of the full results. This yields a classicality criterion that shows that stochastic effects are small only if the potential is sub-Planckian and not too flat. The saddle-point approximation also provides an expansion scheme for calculating stochastic corrections to observable quantities perturbatively in this regime. In the opposite regime, we show that a strong suppression in the power spectrum is generically obtained, and comment on the physical implications of this effect.
Stochastic Gravity: Theory and Applications
B. L. Hu; E. Verdaguer
Whereas semiclassical gravity is based on the semiclassical Einstein equation with sources given by the expectation value of the stress-energy tensor of quantum fields, stochastic semiclassical gravity is based on the Einstein-Langevin equation, which has in addition sources due to the noise kernel. In the first part, we describe the fundamentals of this new theory via two approaches: the axiomatic and the functional. In the second part, we describe three applications of stochastic gravity theory. First, we consider metric perturbations in a Minkowski spacetime, compute the two-point correlation functions of these perturbations and prove that Minkowski spacetime is a stable solution of semiclassical gravity. Second, we discuss structure formation from the stochastic gravity viewpoint. Third, we discuss the backreaction of Hawking radiation in the gravitational background of a black hole and describe the metric fluctuations near the event horizon of an evaporating black hole
Paul Dunlop; Simon Smith
Processes within the construction industry have for many years been systematically modernised and allocated rigid procedures. However, this has not been the case with concrete placing operations. These have been left to evolve naturally and to develop in a piecemeal manner. As a result inefficiencies have become established in concrete operations that have led to wastage in terms of time
Impulsive control of stochastic system under the sense of stochastic asymptotical stability
NASA Astrophysics Data System (ADS)
Niu, Yu-Jun; Ma, Ge
This paper studies the stochastic asymptotical stability of stochastic impulsive differential equations, and establishes a comparison theory to ensure the trivial solution's stochastic asymptotical stability. From the comparison theory, it can find out whether the stochastic impulsive differential system is stable just by studying the stability of a deterministic comparison system. As a general application of this theory, it controls the chaos of stochastic Lü system using impulsive control method, and numerical simulations are employed to verify the feasibility of this method.
On stochastic approaches of nuclear dynamics
Y. Abe; S. Ayik; P.-G. Reinhard; E. Suraud
We present recent developments of stochastic descriptions of nuclear dynamics. We focus on the newly introduced microscopic descriptions, such as stochastic extensions of currently used kinetic equations, as well as on more phenomenological, macroscopic approaches. We show to what extent these stochastic descriptions may offer a proper picture of nuclear dynamics both in strongly out of equilibrium situations, such as
Maximum entropy principle and nonlinear stochastic oscillators
K. Sobczyk; J. Trebicki
The principle of maximum entropy introduced first in physics and successfully applied in many other fields (e.g. statistics, reliability estimation, simulation) has recently been developed to analyze the systems governed by stochastic differential equations. In this paper we extend the maximum entropy method to the general class of stochastic nonlinear systems and apply it to stochastic nonlinear oscillators. To indicate
Stochastic modelling of gene regulatory networks
Hana El Samad; Mustafa Khammash; Linda Petzold; Dan Gillespie
SUMMARY Gene regulatory networks are dynamic and stochastic in nature, and exhibit exquisite feedback and feedforward control loops that regulate their biological function at different levels. Modelling of such networks poses new challenges due, in part, to the small number of molecules involved and the stochastic nature of their interactions. In this article, we motivate the stochastic modelling of genetic
3, 453483, 2012 A stochastic model
Zuyev, Sergei
ESDD 3, 453483, 2012 A stochastic model for the polygonal tundra F. Cresto Aleina et al. Title paper in ESD if available. A stochastic model for the polygonal tundra based on Poisson-Voronoi Diagrams483, 2012 A stochastic model for the polygonal tundra F. Cresto Aleina et al. Title Page Abstract
A mathematical framework for stochastic climate models
Andrew J. Majda; Ilya Timofeyev; Eric Vanden Eijnden
There has been a recent burst of activity in the atmosphere-ocean sciences com- munity in utilizing stable linear Langevin stochastic models for the unresolved degrees of freedom in stochastic climate prediction. Here a systematic mathe- matical strategy for stochastic climate modeling is developed, and some of the new phenomena in the resulting equations for the climate variables alone are explored.
A Learning Criterion for Stochastic Rules
Kenji Yamanishi
This paper proposes a learning criterion for stochastic rules. This criterion is developed by extending Valiant's PAC (Probably Approximately Correct) learning model, which is a learning criterion for deterministic rules. Stochastic rules here refer to those which probabilistically asign a number of classes, {Y}, to each attribute vector X. The proposed criterion is based on the idea that learning stochastic
Penrose Inequality for Asymptotically AdS Spaces
Igor Itkin; Yaron Oz
In general relativity, the Penrose inequality relates the mass and the entropy associated with a gravitational background. If the inequality is violated by an initial Cauchy data, it suggests a creation of a naked singularity, thus providing means to consider the cosmic censorship hypothesis. We propose a general form of Penrose inequality for asymptotically locally AdS spaces.
Adding patents v4 1 myPublications: Adding patents
Oakley, Jeremy
Adding patents v4 1 myPublications: Adding patents You can use myPublications to record details of all your different research outputs, including patents. The system does not automatically search any patent databases so it is necessary for you to enter them manually. 1. On your Home screen click
The Universal Phase Space of AdS3 Gravity
NASA Astrophysics Data System (ADS)
Scarinci, Carlos; Krasnov, Kirill
We describe what can be called the "universal" phase space of AdS3 gravity, in which the moduli spaces of globally hyperbolic AdS spacetimes with compact spatial sections, as well as the moduli spaces of multi-black-hole spacetimes are realized as submanifolds. The universal phase space is parametrized by two copies of the universal Teichmüller space {{T}(1)} and is obtained from the correspondence between maximal surfaces in AdS3 and quasisymmetric homeomorphisms of the unit circle. We also relate our parametrization to the Chern-Simons formulation of 2+1 gravity and, infinitesimally, to the holographic (Fefferman-Graham) description. In particular, we obtain a relation between the generators of quasiconformal deformations in each {{T}(1)} sector and the chiral Brown-Henneaux vector fields. We also relate the charges arising in the holographic description (such as the mass and angular momentum of an AdS3 spacetime) to the periods of the quadratic differentials arising via the Bers embedding of {{T}(1)×{T}(1)} . Our construction also yields a symplectic map {T^ ast {T}(1) ? {T}(1) × {T}(1)} generalizing the well-known Mess map in the compact spatial surface setting.
Dyonic AdS black holes from magnetohydrodynamics
Marco M. Caldarelli; Oscar J. C. Dias; Dietmar Klemm
We use the AdS/CFT correspondence to argue that large dyonic black holes in anti-de Sitter spacetime are dual to stationary solutions of the equations of relativistic magnetohydrodynamics on the conformal boundary of AdS. The dyonic Kerr-Newman-AdS_4 solution corresponds to a charged diamagnetic fluid not subject to any net Lorentz force, due to orthogonal magnetic and electric fields compensating each other. The conserved charges, stress tensor and R-current of the fluid are shown to be in exact agreement with the corresponding quantities of the black hole. Furthermore, we obtain stationary solutions of the Navier-Stokes equations in four dimensions, which yield predictions for (yet to be constructed) charged rotating black strings in AdS_5 carrying nonvanishing momentum along the string. Finally, we consider Scherk-Schwarz reduced AdS gravity on a circle. In this theory, large black holes and black strings are dual to lumps of deconfined plasma of the associated CFT. We analyze the effects that a magnetic field introduces in the Rayleigh-Plateau instability of a plasma tube, which is holographically dual to the Gregory-Laflamme instability of a magnetically charged black string.
Personalized Ad Delivery When Ads Fatigue: An Approximation Algorithm
Zoë Abrams; Erik Vee
We consider a crucial aspect of displaying advertisements on the internet: the individual user. In particular, we consider ad fatigue, where a user tires of an advertisement as it is seen more often. We would like to show advertisements such that, given the impact of ad fatigue, the overall eciency of the system is optimized. We design an approximation algorithm,
Stochastic modeling of Lagrangian accelerations
NASA Astrophysics Data System (ADS)
Reynolds, Andy
It is shown how Sawford's second-order Lagrangian stochastic model (Phys. Fluids A 3, 1577-1586, 1991) for fluid-particle accelerations can be combined with a model for the evolution of the dissipation rate (Pope and Chen, Phys. Fluids A 2, 1437-1449, 1990) to produce a Lagrangian stochastic model that is consistent with both the measured distribution of Lagrangian accelerations (La Porta et al., Nature 409, 1017-1019, 2001) and Kolmogorov's similarity theory. The later condition is found not to be satisfied when a constant dissipation rate is employed and consistency with prescribed acceleration statistics is enforced through fulfilment of a well-mixed condition.
Stochastic models of chaotic systems
Leith, C.E.
Nonlinear dynamical systems, although strictly deterministic, often exhibit chaotic behavior which appears to be random. The determination of the probabilistic properties of such systems is, in general, an open problem. Closure approximations for moment expansion methods have been unsatisfactory. More successful has been approximation on the dynamics level by the use of linear stochastic models that attempt to generate the probabilistic properties of the original nonlinear chaotic system as closely as possible. Examples are reviewed of this approach to simple nonlinear systems, to turbulence, and to large-eddy simulation. A stochastic model that simulates the transient energy spectrum of the global atmosphere is developed.
Comments on optical stochastic cooling
K.Y. Ng, S.Y. Lee and Y.K. Zhang
An important necessary condition for transverse phase space damping in the optical stochastic cooling with transit-time method is derived. The longitudinal and transverse damping dynamics for the optical stochastic cooling is studied. The authors also obtain an optimal laser focusing condition for laser-beam interaction in the correction undulator. The amplification factor and the output peak power of the laser amplifier are found to differ substantially from earlier publications. The required power is large for hadron colliders at very high energy.
QB1 - Stochastic Gene Regulation
Munsky, Brian [Los Alamos National Laboratory
Summaries of this presentation are: (1) Stochastic fluctuations or 'noise' is present in the cell - Random motion and competition between reactants, Low copy, quantization of reactants, Upstream processes; (2) Fluctuations may be very important - Cell-to-cell variability, Cell fate decisions (switches), Signal amplification or damping, stochastic resonances; and (3) Some tools are available to mode these - Kinetic Monte Carlo simulations (SSA and variants), Moment approximation methods, Finite State Projection. We will see how modeling these reactions can tell us more about the underlying processes of gene regulation.
Stochastic Optimization of Complex Systems
Birge, John R. [University of Chicago
This project focused on methodologies for the solution of stochastic optimization problems based on relaxation and penalty methods, Monte Carlo simulation, parallel processing, and inverse optimization. The main results of the project were the development of a convergent method for the solution of models that include expectation constraints as in equilibrium models, improvement of Monte Carlo convergence through the use of a new method of sample batch optimization, the development of new parallel processing methods for stochastic unit commitment models, and the development of improved methods in combination with parallel processing for incorporating automatic differentiation methods into optimization.
A hidden symmetry of AdS resonances
NASA Astrophysics Data System (ADS)
Evnin, Oleg; Krishnan, Chethan
Recent investigations have revealed powerful selection rules for resonant energy transfer between modes of nonlinear perturbations in global anti-de Sitter (AdS) space-time. It is likely that these selection rules are due to the highly symmetric nature of the underlying AdS background, though the precise relation has remained unclear. In this article, we demonstrate that the equation satisfied by the scalar field mode functions in AdSd +1 has a hidden S U (d ) symmetry, and explicitly specify the multiplets of this S U (d ) symmetry furnished by the mode functions. We also comment on the role this structure might play in explaining the selection rules.
Gauge boson exchange in AdS d+1
NASA Astrophysics Data System (ADS)
D'Hoker, Eric; Freedman, Daniel Z.
We study the amplitude for exchange of massless gauge bosons between pairs of massive scalar fields in anti-de Sitter space. In the AdS/CFT correspondence this amplitude describes the contribution of conserved flavor symmetry currents to 4-point functions of scalar operators in the boundary conformal theory. A concise, covariant, Y2K compatible derivation of the gauge boson propagator in AdS d + 1 is given. Techniques are developed to calculate the two bulk integrals over AdS space leading to explicit expressions or convenient, simple integral representations for the amplitude. The amplitude contains leading power and sub-leading logarithmic singularities in the gauge boson channel and leading logarithms in the crossed channel. The new methods of this paper are expected to have other applications in the study of the Maldacena conjecture.
Wilson lines for AdS5 black strings
NASA Astrophysics Data System (ADS)
Hristov, Kiril; Katmadas, Stefanos
We describe a simple method of extending AdS5 black string solutions of 5d gauged supergravity in a supersymmetric way by addition of Wilson lines along a circular direction in space. When this direction is chosen along the string, and due to the specific form of 5d supergravity that features Chern-Simons terms, the existence of magnetic charges automatically generates conserved electric charges in a 5d analogue of the Witten effect. Therefore we find a rather generic, model-independent way of adding electric charges to already existing solutions with no backreaction from the geometry or breaking of any symmetry. We use this method to explicitly write down more general versions of the Benini-Bobev black strings [1, 2] and comment on the implications for the dual field theory and the similarities with generalizations of the Cacciatori-Klemm black holes [3] in AdS4.
Wilson lines for AdS_5 black strings
Kiril Hristov; Stefanos Katmadas
We describe a simple method of extending AdS_5 black string solutions of 5d gauged supergravity in a supersymmetric way by addition of Wilson lines along a circular direction in space. When this direction is chosen along the string, and due to the specific form of 5d supergravity that features Chern-Simons terms, the existence of magnetic charges automatically generates conserved electric charges in a 5d analogue of the Witten effect. Therefore we find a rather generic, model-independent way of adding electric charges to already existing solutions with no backreaction from the geometry or breaking of any symmetry. We use this method to explicitly write down more general versions of the Benini-Bobev black strings and comment on the implications for the dual field theory and the similarities with generalizations of the Cacciatori-Klemm black holes in AdS_4.
AdS Holography in the Penrose Limit
Nelia Mann; Joseph Polchinski
We study the holographic description of string theory in a plane wave spacetime by taking the Penrose limit of the usual AdS/CFT correspondence. We consider three-point functions with two BMN operators and one non-BMN operator; the latter should go over to a perturbation of the dual CFT. On the string side we take the Penrose limit of the metric perturbation produced by the non-BMN operator, and the BMN state propagates in this perturbed background. The work of Lee, Minwalla, Rangamani, and Seiberg shows that for chiral operators the AdS three-point functions agree with those calculated in the free gauge theory. However, when this is reduced to an effective plane wave amplitude by truncating the amplitude to propagate from the AdS boundary to the Penrose geodesic, we find a puzzling mismatch. We discuss possible resolutions, and future directions.
A Hidden Symmetry of AdS Resonances
Oleg Evnin; Chethan Krishnan
Recent investigations have revealed powerful selection rules for resonant energy transfer between modes of non-linear perturbations in global anti-de Sitter (AdS) space-time. It is likely that these selection rules are due to the highly symmetric nature of the underlying AdS background, though the precise relation has remained unclear. In this article, we demonstrate that the equation satisfied by the scalar field mode functions in AdS(d+1) has a hidden SU(d) symmetry, and explicitly specify the multiplets of this SU(d) symmetry furnished by the mode functions. We also comment on the role this structure might play in explaining the selection rules.
Comparing administered and market-based water allocation systems using an agent-based modeling approach
NASA Astrophysics Data System (ADS)
Zhao, J.; Cai, X.; Wang, Z.
It also has been well recognized that market-based systems can have significant advantages over administered systems for water allocation. However there are not many successful water markets around the world yet and administered systems exist commonly in water allocation management practice. This paradox has been under discussion for decades and still calls for attention for both research and practice. This paper explores some insights for the paradox and tries to address why market systems have not been widely implemented for water allocation. Adopting the theory of agent-based system we develop a consistent analytical model to interpret both systems. First we derive some theorems based on the analytical model, with respect to the necessary conditions for economic efficiency of water allocation. Following that the agent-based model is used to illustrate the coherence and difference between administered and market-based systems. The two systems are compared from three aspects: 1) the driving forces acting on the system state, 2) system efficiency, and 3) equity. Regarding economic efficiency, penalty on the violation of water use permits (or rights) under an administered system can lead to system-wide economic efficiency, as well as being acceptable by some agents, which follows the theory of the so-call rational violation. Ideal equity will be realized if penalty equals incentive with an administered system and if transaction costs are zero with a market system. The performances of both agents and the over system are explained with an administered system and market system, respectively. The performances of agents are subject to different mechanisms of interactions between agents under the two systems. The system emergency (i.e., system benefit, equilibrium market price, etc), resulting from the performance at the agent level, reflects the different mechanism of the two systems, the "invisible hand" with the market system and administrative measures (penalty and subsidy) with the administered system. Furthermore, the impact of hydrological uncertainty on the performance of water users under the two systems is analyzed by extending the deterministic model to a stochastic one subject to the uncertainty of water availability. It is found that the system response to hydrologic uncertainty depends on risk management mechanics - sharing risk equally among the agents or by prescribed priorities on some agents. Figure1. Agent formulation and its implications in administered system and market-based system
Exploiting stochastic process algebra achievements for generalized stochastic Petri nets
Holger Hermannst; Ulrich Herzog; Vassilis Mertsiotakis; Michael Rettelbach
Constructing large generalized stochastic Petri nets (GSPN) by hierarchical composition of smaller components is a promising way to cope with the complexity of the design process for models of real hardware and software systems. The composition of nets is inspired by process algebraic operators. A solid theoretical framework of such operators relies on equivalences that are substitutive with respect to
Land resources allocation strategies in an urban area involving uncertainty: a case study of Suzhou, in the Yangtze River Delta of China.
Lu, Shasha; Guan, Xingliang; Zhou, Min; Wang, Yang
A large number of mathematical models have been developed to support land resource allocation decisions and land management needs; however, few of them can address various uncertainties that exist in relation to many factors presented in such decisions (e.g., land resource availabilities, land demands, land-use patterns, and social demands, as well as ecological requirements). In this study, a multi-objective interval-stochastic land resource allocation model (MOISLAM) was developed for tackling uncertainty that presents as discrete intervals and/or probability distributions. The developed model improves upon the existing multi-objective programming and inexact optimization approaches. The MOISLAM not only considers economic factors, but also involves food security and eco-environmental constraints; it can, therefore, effectively reflect various interrelations among different aspects in a land resource management system. Moreover, the model can also help examine the reliability of satisfying (or the risk of violating) system constraints under uncertainty. In this study, the MOISLAM was applied to a real case of long-term urban land resource allocation planning in Suzhou, in the Yangtze River Delta of China. Interval solutions associated with different risk levels of constraint violation were obtained. The results are considered useful for generating a range of decision alternatives under various system conditions, and thus helping decision makers to identify a desirable land resource allocation strategy under uncertainty. PMID:24525844
Land Resources Allocation Strategies in an Urban Area Involving Uncertainty: A Case Study of Suzhou, in the Yangtze River Delta of China
NASA Astrophysics Data System (ADS)
Lu, Shasha; Guan, Xingliang; Zhou, Min; Wang, Yang
A large number of mathematical models have been developed to support land resource allocation decisions and land management needs; however, few of them can address various uncertainties that exist in relation to many factors presented in such decisions (e.g., land resource availabilities, land demands, land-use patterns, and social demands, as well as ecological requirements). In this study, a multi-objective interval-stochastic land resource allocation model (MOISLAM) was developed for tackling uncertainty that presents as discrete intervals and/or probability distributions. The developed model improves upon the existing multi-objective programming and inexact optimization approaches. The MOISLAM not only considers economic factors, but also involves food security and eco-environmental constraints; it can, therefore, effectively reflect various interrelations among different aspects in a land resource management system. Moreover, the model can also help examine the reliability of satisfying (or the risk of violating) system constraints under uncertainty. In this study, the MOISLAM was applied to a real case of long-term urban land resource allocation planning in Suzhou, in the Yangtze River Delta of China. Interval solutions associated with different risk levels of constraint violation were obtained. The results are considered useful for generating a range of decision alternatives under various system conditions, and thus helping decision makers to identify a desirable land resource allocation strategy under uncertainty.
Green functions in stochastic field theory
NASA Astrophysics Data System (ADS)
Honkonen, Juha
Functional representations are reviewed for the generating function of Green functions of stochastic problems stated either with the use of the Fokker-Planck equation or the master equation. Both cases are treated in a unified manner based on the operator approach similar to quantum mechanics. Solution of a second-order stochastic differential equation in the framework of stochastic field theory is constructed. Ambiguities in the mathematical formulation of stochastic field theory are discussed. The Schwinger-Keldysh representation is constructed for the Green functions of the stochastic field theory which yields a functional-integral representation with local action but without the explicit functional Jacobi determinant or ghost fields.
25 CFR 290.5 - Who approves tribal revenue allocation plans?
Code of Federal Regulations, 2011 CFR
...OF THE INTERIOR ECONOMIC ENTERPRISES TRIBAL REVENUE ALLOCATION PLANS § 290.5 Who approves tribal revenue allocation plans? The ABO will review and approve tribal revenue allocation plans for compliance with...
25 CFR 290.5 - Who approves tribal revenue allocation plans?
Code of Federal Regulations, 2013 CFR
...OF THE INTERIOR ECONOMIC ENTERPRISES TRIBAL REVENUE ALLOCATION PLANS § 290.5 Who approves tribal revenue allocation plans? The ABO will review and approve tribal revenue allocation plans for compliance with...
25 CFR 290.5 - Who approves tribal revenue allocation plans?
Code of Federal Regulations, 2014 CFR
...OF THE INTERIOR ECONOMIC ENTERPRISES TRIBAL REVENUE ALLOCATION PLANS § 290.5 Who approves tribal revenue allocation plans? The ABO will review and approve tribal revenue allocation plans for compliance with...
25 CFR 290.5 - Who approves tribal revenue allocation plans?
Code of Federal Regulations, 2012 CFR
...OF THE INTERIOR ECONOMIC ENTERPRISES TRIBAL REVENUE ALLOCATION PLANS § 290.5 Who approves tribal revenue allocation plans? The ABO will review and approve tribal revenue allocation plans for compliance with...
22nd Annual Transportation Research Conference Minnesota Highway Cost Allocation Study
Minnesota, University of
22nd Annual Transportation Research Conference Minnesota Highway Cost Allocation Study Hao-Wei Chen Outline · Minnesota Highway Cost Allocation Tool (MHCAT) · HCA results Highway Cost Allocation (HCA) Study Transportation Research Conference Highway Taxes Evaluation · Key Concepts Tax Revenue
Saskatchewan, University of
AN ARTIFICIAL NEURAL NETWORK BASED TRANSMISSION LOSS ALLOCATION FOR BILATERAL CONTRACTS Rezaul to allocate transmission loss to respective transactions. An artificial neural network based transmission loss technique. Keywords: Neural network; transmission loss; loss allocation; bilateral contracts. 1
25 CFR 161.403 - How are grazing permits allocated within each range unit?
Code of Federal Regulations, 2012 CFR
...are grazing permits allocated within each range unit? 161.403 Section 161.403...are grazing permits allocated within each range unit? (a) Initial allocation...current authorized stocking rate on a given range unit. (b) Grazing permit...
25 CFR 161.403 - How are grazing permits allocated within each range unit?
Code of Federal Regulations, 2013 CFR
...are grazing permits allocated within each range unit? 161.403 Section 161.403...are grazing permits allocated within each range unit? (a) Initial allocation...current authorized stocking rate on a given range unit. (b) Grazing permit...
25 CFR 161.403 - How are grazing permits allocated within each range unit?
Code of Federal Regulations, 2011 CFR
...are grazing permits allocated within each range unit? 161.403 Section 161.403...are grazing permits allocated within each range unit? (a) Initial allocation...current authorized stocking rate on a given range unit. (b) Grazing permit...