Auction-based bandwidth allocation in the Internet
NASA Astrophysics Data System (ADS)
Wei, Jiaolong; Zhang, Chi
2002-07-01
It has been widely accepted that auctioning which is the pricing approach with minimal information requirement is a proper tool to manage scare network resources. Previous works focus on Vickrey auction which is incentive compatible in classic auction theory. In the beginning of this paper, the faults of the most representative auction-based mechanisms are discussed. And then a new method called uniform-price auction (UPA), which has the simplest auction rule is proposed and it's incentive compatibility in the network environment is also proved. Finally, the basic mode is extended to support applications which require minimum bandwidth guarantees for a given time period by introducing derivative market, and a market mechanism for network resource allocation which is predictable, riskless, and simple for end-users is completed.
Bandwidth auction for SVC streaming in dynamic multi-overlay
NASA Astrophysics Data System (ADS)
Xiong, Yanting; Zou, Junni; Xiong, Hongkai
2010-07-01
In this paper, we study the optimal bandwidth allocation for scalable video coding (SVC) streaming in multiple overlays. We model the whole bandwidth request and distribution process as a set of decentralized auction games between the competing peers. For the upstream peer, a bandwidth allocation mechanism is introduced to maximize the aggregate revenue. For the downstream peer, a dynamic bidding strategy is proposed. It achieves maximum utility and efficient resource usage by collaborating with a content-aware layer dropping/adding strategy. Also, the convergence of the proposed auction games is theoretically proved. Experimental results show that the auction strategies can adapt to dynamic join of competing peers and video layers.
A Hierarchical Auction-Based Mechanism for Real-Time Resource Allocation in Cloud Robotic Systems.
Wang, Lujia; Liu, Ming; Meng, Max Q-H
2017-02-01
Cloud computing enables users to share computing resources on-demand. The cloud computing framework cannot be directly mapped to cloud robotic systems with ad hoc networks since cloud robotic systems have additional constraints such as limited bandwidth and dynamic structure. However, most multirobotic applications with cooperative control adopt this decentralized approach to avoid a single point of failure. Robots need to continuously update intensive data to execute tasks in a coordinated manner, which implies real-time requirements. Thus, a resource allocation strategy is required, especially in such resource-constrained environments. This paper proposes a hierarchical auction-based mechanism, namely link quality matrix (LQM) auction, which is suitable for ad hoc networks by introducing a link quality indicator. The proposed algorithm produces a fast and robust method that is accurate and scalable. It reduces both global communication and unnecessary repeated computation. The proposed method is designed for firm real-time resource retrieval for physical multirobot systems. A joint surveillance scenario empirically validates the proposed mechanism by assessing several practical metrics. The results show that the proposed LQM auction outperforms state-of-the-art algorithms for resource allocation.
Bandwidth-sharing in LHCONE, an analysis of the problem
NASA Astrophysics Data System (ADS)
Wildish, T.
2015-12-01
The LHC experiments have traditionally regarded the network as an unreliable resource, one which was expected to be a major source of errors and inefficiency at the time their original computing models were derived. Now, however, the network is seen as much more capable and reliable. Data are routinely transferred with high efficiency and low latency to wherever computing or storage resources are available to use or manage them. Although there was sufficient network bandwidth for the experiments’ needs during Run-1, they cannot rely on ever-increasing bandwidth as a solution to their data-transfer needs in the future. Sooner or later they need to consider the network as a finite resource that they interact with to manage their traffic, in much the same way as they manage their use of disk and CPU resources. There are several possible ways for the experiments to integrate management of the network in their software stacks, such as the use of virtual circuits with hard bandwidth guarantees or soft real-time flow-control, with somewhat less firm guarantees. Abstractly, these can all be considered as the users (the experiments, or groups of users within the experiment) expressing a request for a given bandwidth between two points for a given duration of time. The network fabric then grants some allocation to each user, dependent on the sum of all requests and the sum of available resources, and attempts to ensure the requirements are met (either deterministically or statistically). An unresolved question at this time is how to convert the users’ requests into an allocation. Simply put, how do we decide what fraction of a network's bandwidth to allocate to each user when the sum of requests exceeds the available bandwidth? The usual problems of any resourcescheduling system arise here, namely how to ensure the resource is used efficiently and fairly, while still satisfying the needs of the users. Simply fixing quotas on network paths for each user is likely to lead to inefficient use of the network. If one user cannot use their quota for some reason, that bandwidth is lost. Likewise, there is no incentive for the user to be efficient within their quota, they have nothing to gain by using less than their allocation. As with CPU farms, some sort of dynamic allocation is more likely to be useful. A promising approach for sharing bandwidth at LHCONE is the ’Progressive Second-Price auction’, where users are given a budget and are required to bid from that budget for the specific resources they want to reserve. The auction allows users to effectively determine among themselves the degree of sharing they are willing to accept based on the priorities of their traffic and their global share, as represented by their total budget. The network then implements those allocations using whatever mix of technologies is appropriate or available. This paper describes how the Progressive Second-Price auction works and how it can be applied to LHCONE. Practical questions are addressed, such as how are budgets set, what strategy should users use to manage their budget, how and how often should the auction be run, and how do we ensure that the goals of fairness and efficiency are met.
Decentralized Planning for Autonomous Agents Cooperating in Complex Missions
2010-09-01
Consensus - based decentralized auctions for robust task allocation ," IEEE Transactions on Robotics...Robotics, vol. 24, pp. 209-222, 2006. [44] H.-L. Choi, L. Brunet, and J. P. How, " Consensus - based decentralized auctions for robust task allocation ...2003. 123 [31] L. Brunet, " Consensus - Based Auctions for Decentralized Task Assignment," Master’s thesis, Dept.
Market power in auction and efficiency in emission permits allocation.
Jiang, Min Xing; Yang, Dong Xiao; Chen, Zi Yue; Nie, Pu Yan
2016-12-01
This paper analyzes how to achieve the cost-effectiveness by initial allocation of CO 2 emission permits when a single dominant firm in production market has market power in auction, and compare two prevalent allocation patterns, mixed allocation and single auction. We show how the firm with market power may manipulate the auction price, thereby this leads to fail to achieve cost-effective solution by auction unless the total permits for allocation equal to the effective emissions cap. Provided that the market power firm receives strictly positive free permits, the effective emissions cap of mixed allocation is larger than that of single auction. The production market share of dominant firm is increasing with the free permits it holds. Finally, we examine the compliance costs and welfare of mixed allocation and single auction, the result show that the former is preferred to the later when policy makers consider economic welfare without welfare cost due to CO 2 emissions. Copyright © 2016 Elsevier Ltd. All rights reserved.
NASA Technical Reports Server (NTRS)
Gruyer, Nicolas; Lenoir, Nathalie
2003-01-01
The current allocation of slots on congested European airports constitutes an obstacle to the effective liberalisation of air transportation undertaken in Europe. With a view to favouring effluent slot utilisation and competition, as is the goal of the Euopean commission, we propose to use a market mechanism, based on temporary" utilisation licences. In order to allocate those licences, we propose and describe an iterated combinatorial auction mechanism where a percentage of licences would be reallocated each season. A secondary market would also be set up in order to reallocate slots during a season. Since a combinatorial auction involve a complex optimisation procedure, we describe how it can be made to work in the case of auctions.
Auctions for coastal energy resources
NASA Astrophysics Data System (ADS)
Griffin, Robert M.
It is becoming increasingly common to allocate public resources to the private sector for the purpose of developing these resources. One of the earliest uses of auctions in the U.S. for allocating rights to public resources was in the offshore oil and gas industry. The U.S. Federal government, through the Department of Interior (DOI), has used auctions to allocate development rights to offshore oil and gas resources to the private sector since the 1950's. Since then many things have changed. Oil and gas markets have gone through boom and bust cycles, giant technological advances in extraction and assessment have taken place, and alternative energy based in the coastal zone is now in demand in markets as well. There has been an enormous amount of research into the drivers of bidder behavior in auctions and optimal auction design in the last 60 years as well. Throughout all of this, the DOI has continued to use basically the same exact auction design to allocate oil and gas leases. The U.S. offshore oil and gas resources sold by the Department of Interior have accounted for more than $65 billion in revenue since the program started. These offshore resources are an important source of government revenue and national wealth. Additionally, the expansion of the energy sector offshore has enormous potential for electricity generation in the U.S., estimated by the National Renewable Energy Laboratory as approaching 54 gigawatts by 2030 (U.S. Department of Energy, 2008). Taken together, the DOI controls access to a large part of the future of energy in the U.S. The research herein assesses the auction formats used to allocate both fossil fuels and renewable resources on the Outer Continental Shelf (OCS). The first manuscript looks at the current method used by the DOI to allocate oil and gas leases on the OCS, and is primarily interested in how bidders behave in this environment. Using latent class estimation techniques to separate distinct bidding behavior in a laboratory simulation of current U.S. policy, it compares lab results to field data and identifies efficiency and revenue losses stemming from the endogenous entry aspect of current policy. The second manuscript identifies an alternative auction method for allocating these development rights and develops a bidding model based on that of Milgrom (2000) for private value auctions. When tested against laboratory data, the model is favorably predictive of outcomes, but the path of bidding significantly deviates from predictions due to jump bidding and bidder impatience. The final manuscript provides a qualitative assessment of alternative auction arrangements for allocating access to wind energy on the OCS. In consideration of the relative state of the wind energy and oil and gas industries, the DOI may want to employ an allocation policy that better fits the current status of the wind energy industry. Considering the federal mandates regarding allocation that the DOI is required to follow, several allocation methods are identified for the short and medium term that meet federal mandates and promote the growth of the industry.
Cooperation based dynamic team formation in multi-agent auctions
NASA Astrophysics Data System (ADS)
Pippin, Charles E.; Christensen, Henrik
2012-06-01
Auction based methods are often used to perform distributed task allocation on multi-agent teams. Many existing approaches to auctions assume fully cooperative team members. On in-situ and dynamically formed teams, reciprocal collaboration may not always be a valid assumption. This paper presents an approach for dynamically selecting auction partners based on observed team member performance and shared reputation. In addition, we present the use of a shared reputation authority mechanism. Finally, experiments are performed in simulation on multiple UAV platforms to highlight situations in which it is better to enforce cooperation in auctions using this approach.
Auction-based Security Game for Multiuser Cooperative Networks
NASA Astrophysics Data System (ADS)
Wang, An; Cai, Yueming; Yang, Wendong; Cheng, Yunpeng
2013-04-01
In this paper, we develop an auction-based algorithm to allocate the relay power efficiently to improve the system secrecy rate in a cooperative network, where several source-destination pairs and one cooperative relay are involved. On the one hand, the cooperative relay assists these pairs to transmit under a peak power constraint. On the other hand, the relay is untrusty and is also a passive eavesdropper. The whole auction process is completely distributed and no instantaneous channel state information exchange is needed. We also prove the existence and uniqueness of the Nash Equilibrium (NE) for the proposed power auction game. Moreover, the Pareto optimality is also validated. Simulation results show that our proposed auction-based algorithm can effectively improve the system secrecy rate. Besides, the proposed auction-based algorithm can converge to the unique NE point within a finite number of iterations. More interestingly, we also find that the proposed power auction mechanism is cheat-proof.
Auction Mechanism to Allocate Air Traffic Control Slots
NASA Technical Reports Server (NTRS)
Raffarin, Marianne
2003-01-01
This article deals with an auction mechanism for airspace slots, as a means of solving the European airspace congestion problem. A disequilibrium, between Air Traffic Control (ATC) services supply and ATC services demand are at the origin of almost one fourth of delays in the air transport industry in Europe. In order to tackle this congestion problem, we suggest modifying both pricing and allocation of ATC services, by setting up an auction mechanism. Objects of the auction will be the right for airlines to cross a part of the airspace, and then to benefit from ATC services over a period corresponding to the necessary time for the crossing. Allocation and payment rules have to be defined according to the objectives of this auction. The auctioneer is the public authority in charge of ATC services, whose aim is to obtain an efficient allocation. Therefore, the social value will be maximized. Another objective is to internalize congestion costs. To that end, we apply the principle of Clarke-Groves mechanism auction: each winner has to pay the externalities imposed on other bidders. The complex context of ATC leads to a specific design for this auction.
A Greedy Double Auction Mechanism for Grid Resource Allocation
NASA Astrophysics Data System (ADS)
Ding, Ding; Luo, Siwei; Gao, Zhan
To improve the resource utilization and satisfy more users, a Greedy Double Auction Mechanism(GDAM) is proposed to allocate resources in grid environments. GDAM trades resources at discriminatory price instead of uniform price, reflecting the variance in requirements for profits and quantities. Moreover, GDAM applies different auction rules to different cases, over-demand, over-supply and equilibrium of demand and supply. As a new mechanism for grid resource allocation, GDAM is proved to be strategy-proof, economically efficient, weakly budget-balanced and individual rational. Simulation results also confirm that GDAM outperforms the traditional one on both the total trade amount and the user satisfaction percentage, specially as more users are involved in the auction market.
Research on Multirobot Pursuit Task Allocation Algorithm Based on Emotional Cooperation Factor
Fang, Baofu; Chen, Lu; Wang, Hao; Dai, Shuanglu; Zhong, Qiubo
2014-01-01
Multirobot task allocation is a hot issue in the field of robot research. A new emotional model is used with the self-interested robot, which gives a new way to measure self-interested robots' individual cooperative willingness in the problem of multirobot task allocation. Emotional cooperation factor is introduced into self-interested robot; it is updated based on emotional attenuation and external stimuli. Then a multirobot pursuit task allocation algorithm is proposed, which is based on emotional cooperation factor. Combined with the two-step auction algorithm recruiting team leaders and team collaborators, set up pursuit teams, and finally use certain strategies to complete the pursuit task. In order to verify the effectiveness of this algorithm, some comparing experiments have been done with the instantaneous greedy optimal auction algorithm; the results of experiments show that the total pursuit time and total team revenue can be optimized by using this algorithm. PMID:25152925
Research on multirobot pursuit task allocation algorithm based on emotional cooperation factor.
Fang, Baofu; Chen, Lu; Wang, Hao; Dai, Shuanglu; Zhong, Qiubo
2014-01-01
Multirobot task allocation is a hot issue in the field of robot research. A new emotional model is used with the self-interested robot, which gives a new way to measure self-interested robots' individual cooperative willingness in the problem of multirobot task allocation. Emotional cooperation factor is introduced into self-interested robot; it is updated based on emotional attenuation and external stimuli. Then a multirobot pursuit task allocation algorithm is proposed, which is based on emotional cooperation factor. Combined with the two-step auction algorithm recruiting team leaders and team collaborators, set up pursuit teams, and finally use certain strategies to complete the pursuit task. In order to verify the effectiveness of this algorithm, some comparing experiments have been done with the instantaneous greedy optimal auction algorithm; the results of experiments show that the total pursuit time and total team revenue can be optimized by using this algorithm.
Truthful Incentive Mechanisms for Social Cost Minimization in Mobile Crowdsourcing Systems
Duan, Zhuojun; Yan, Mingyuan; Cai, Zhipeng; Wang, Xiaoming; Han, Meng; Li, Yingshu
2016-01-01
With the emergence of new technologies, mobile devices are capable of undertaking computational and sensing tasks. A large number of users with these mobile devices promote the formation of the Mobile Crowdsourcing Systems (MCSs). Within a MCS, each mobile device can contribute to the crowdsourcing platform and get rewards from it. In order to achieve better performance, it is important to design a mechanism that can attract enough participants with mobile devices and then allocate the tasks among participants efficiently. In this paper, we are interested in the investigation of tasks allocation and price determination in MCSs. Two truthful auction mechanisms are proposed for different working patterns. A Vickrey–Clarke–Groves (VCG)-based auction mechanism is proposed to the continuous working pattern, and a suboptimal auction mechanism is introduced for the discontinuous working pattern. Further analysis shows that the proposed mechanisms have the properties of individual rationality and computational efficiencies. Experimental results suggest that both mechanisms guarantee all the mobile users bidding with their truthful values and the optimal maximal social cost can be achieved in the VCG-based auction mechanism. PMID:27058541
Nezarat, Amin; Dastghaibifard, G H
2015-01-01
One of the most complex issues in the cloud computing environment is the problem of resource allocation so that, on one hand, the cloud provider expects the most profitability and, on the other hand, users also expect to have the best resources at their disposal considering the budget constraints and time. In most previous work conducted, heuristic and evolutionary approaches have been used to solve this problem. Nevertheless, since the nature of this environment is based on economic methods, using such methods can decrease response time and reducing the complexity of the problem. In this paper, an auction-based method is proposed which determines the auction winner by applying game theory mechanism and holding a repetitive game with incomplete information in a non-cooperative environment. In this method, users calculate suitable price bid with their objective function during several round and repetitions and send it to the auctioneer; and the auctioneer chooses the winning player based the suggested utility function. In the proposed method, the end point of the game is the Nash equilibrium point where players are no longer inclined to alter their bid for that resource and the final bid also satisfies the auctioneer's utility function. To prove the response space convexity, the Lagrange method is used and the proposed model is simulated in the cloudsim and the results are compared with previous work. At the end, it is concluded that this method converges to a response in a shorter time, provides the lowest service level agreement violations and the most utility to the provider.
MASM: a market architecture for sensor management in distributed sensor networks
NASA Astrophysics Data System (ADS)
Viswanath, Avasarala; Mullen, Tracy; Hall, David; Garga, Amulya
2005-03-01
Rapid developments in sensor technology and its applications have energized research efforts towards devising a firm theoretical foundation for sensor management. Ubiquitous sensing, wide bandwidth communications and distributed processing provide both opportunities and challenges for sensor and process control and optimization. Traditional optimization techniques do not have the ability to simultaneously consider the wildly non-commensurate measures involved in sensor management in a single optimization routine. Market-oriented programming provides a valuable and principled paradigm to designing systems to solve this dynamic and distributed resource allocation problem. We have modeled the sensor management scenario as a competitive market, wherein the sensor manager holds a combinatorial auction to sell the various items produced by the sensors and the communication channels. However, standard auction mechanisms have been found not to be directly applicable to the sensor management domain. For this purpose, we have developed a specialized market architecture MASM (Market architecture for Sensor Management). In MASM, the mission manager is responsible for deciding task allocations to the consumers and their corresponding budgets and the sensor manager is responsible for resource allocation to the various consumers. In addition to having a modified combinatorial winner determination algorithm, MASM has specialized sensor network modules that address commensurability issues between consumers and producers in the sensor network domain. A preliminary multi-sensor, multi-target simulation environment has been implemented to test the performance of the proposed system. MASM outperformed the information theoretic sensor manager in meeting the mission objectives in the simulation experiments.
Research on air and missile defense task allocation based on extended contract net protocol
NASA Astrophysics Data System (ADS)
Zhang, Yunzhi; Wang, Gang
2017-10-01
Based on the background of air and missile defense distributed element corporative engagement, the interception task allocation problem of multiple weapon units with multiple targets under network condition is analyzed. Firstly, a mathematical model of task allocation is established by combat task decomposition. Secondly, the initialization assignment based on auction contract and the adjustment allocation scheme based on swap contract were introduced to the task allocation. Finally, through the simulation calculation of typical situation, the model can be used to solve the task allocation problem in complex combat environment.
Nezarat, Amin; Dastghaibifard, GH
2015-01-01
One of the most complex issues in the cloud computing environment is the problem of resource allocation so that, on one hand, the cloud provider expects the most profitability and, on the other hand, users also expect to have the best resources at their disposal considering the budget constraints and time. In most previous work conducted, heuristic and evolutionary approaches have been used to solve this problem. Nevertheless, since the nature of this environment is based on economic methods, using such methods can decrease response time and reducing the complexity of the problem. In this paper, an auction-based method is proposed which determines the auction winner by applying game theory mechanism and holding a repetitive game with incomplete information in a non-cooperative environment. In this method, users calculate suitable price bid with their objective function during several round and repetitions and send it to the auctioneer; and the auctioneer chooses the winning player based the suggested utility function. In the proposed method, the end point of the game is the Nash equilibrium point where players are no longer inclined to alter their bid for that resource and the final bid also satisfies the auctioneer’s utility function. To prove the response space convexity, the Lagrange method is used and the proposed model is simulated in the cloudsim and the results are compared with previous work. At the end, it is concluded that this method converges to a response in a shorter time, provides the lowest service level agreement violations and the most utility to the provider. PMID:26431035
Two-dimensional priority-based dynamic resource allocation algorithm for QoS in WDM/TDM PON networks
NASA Astrophysics Data System (ADS)
Sun, Yixin; Liu, Bo; Zhang, Lijia; Xin, Xiangjun; Zhang, Qi; Rao, Lan
2018-01-01
Wavelength division multiplexing/time division multiplexing (WDM/TDM) passive optical networks (PON) is being viewed as a promising solution for delivering multiple services and applications. The hybrid WDM / TDM PON uses the wavelength and bandwidth allocation strategy to control the distribution of the wavelength channels in the uplink direction, so that it can ensure the high bandwidth requirements of multiple Optical Network Units (ONUs) while improving the wavelength resource utilization. Through the investigation of the presented dynamic bandwidth allocation algorithms, these algorithms can't satisfy the requirements of different levels of service very well while adapting to the structural characteristics of mixed WDM / TDM PON system. This paper introduces a novel wavelength and bandwidth allocation algorithm to efficiently utilize the bandwidth and support QoS (Quality of Service) guarantees in WDM/TDM PON. Two priority based polling subcycles are introduced in order to increase system efficiency and improve system performance. The fixed priority polling subcycle and dynamic priority polling subcycle follow different principles to implement wavelength and bandwidth allocation according to the priority of different levels of service. A simulation was conducted to study the performance of the priority based polling in dynamic resource allocation algorithm in WDM/TDM PON. The results show that the performance of delay-sensitive services is greatly improved without degrading QoS guarantees for other services. Compared with the traditional dynamic bandwidth allocation algorithms, this algorithm can meet bandwidth needs of different priority traffic class, achieve low loss rate performance, and ensure real-time of high priority traffic class in terms of overall traffic on the network.
Operator Objective Function Guidance for a Real-Time Unmanned Vehicle Scheduling Algorithm
2012-12-01
Consensus - Based Decentralized Auctions for Robust Task Allocation ,” IEEE Transactions on Robotics and Automation, Vol. 25, No. 4, No. 4, 2009, pp. 912...planning for the fleet. The decentralized task planner used in OPS-USERS is the consensus - based bundle algorithm (CBBA), a decentralized , polynomial...and surveillance (OPS-USERS), which leverages decentralized algorithms for vehicle routing and task allocation . This
Efficient Double Auction Mechanisms in the Energy Grid with Connected and Islanded Microgrids
NASA Astrophysics Data System (ADS)
Faqiry, Mohammad Nazif
The future energy grid is expected to operate in a decentralized fashion as a network of autonomous microgrids that are coordinated by a Distribution System Operator (DSO), which should allocate energy to them in an efficient manner. Each microgrid operating in either islanded or grid-connected mode may be considered to manage its own resources. This can take place through auctions with individual units of the microgrid as the agents. This research proposes efficient auction mechanisms for the energy grid, with is-landed and connected microgrids. The microgrid level auction is carried out by means of an intermediate agent called an aggregator. The individual consumer and producer units are modeled as selfish agents. With the microgrid in islanded mode, two aggregator-level auction classes are analyzed: (i) price-heterogeneous, and (ii) price homogeneous. Under the price heterogeneity paradigm, this research extends earlier work on the well-known, single-sided Kelly mechanism to double auctions. As in Kelly auctions, the proposed algorithm implements the bidding without using any agent level private infor-mation (i.e. generation capacity and utility functions). The proposed auction is shown to be an efficient mechanism that maximizes the social welfare, i.e. the sum of the utilities of all the agents. Furthermore, the research considers the situation where a subset of agents act as a coalition to redistribute the allocated energy and price using any other specific fairness criterion. The price homogeneous double auction algorithm proposed in this research ad-dresses the problem of price-anticipation, where each agent tries to influence the equilibri-um price of energy by placing strategic bids. As a result of this behavior, the auction's efficiency is lowered. This research proposes a novel approach that is implemented by the aggregator, called virtual bidding, where the efficiency can be asymptotically maximized, even in the presence of price anticipatory bidders. Next, an auction mechanism for the energy grid, with multiple connected mi-crogrids is considered. A globally efficient bi-level auction algorithm is proposed. At the upper-level, the algorithm takes into account physical grid constraints in allocating energy to the microgrids. It is implemented by the DSO as a linear objective quadratic constraint problem that allows price heterogeneity across the aggregators. In parallel, each aggrega-tor implements its own lower-level price homogeneous auction with virtual bidding. The research concludes with a preliminary study on extending the DSO level auc-tion to multi-period day-ahead scheduling. It takes into account storage units and conven-tional generators that are present in the grid by formulating the auction as a mixed inte-ger linear programming problem.
NASA Astrophysics Data System (ADS)
Panfil, Wawrzyniec; Moczulski, Wojciech
2017-10-01
In the paper presented is a control system of a mobile robots group intended for carrying out inspection missions. The main research problem was to define such a control system in order to facilitate a cooperation of the robots resulting in realization of the committed inspection tasks. Many of the well-known control systems use auctions for tasks allocation, where a subject of an auction is a task to be allocated. It seems that in the case of missions characterized by much larger number of tasks than number of robots it will be better if robots (instead of tasks) are subjects of auctions. The second identified problem concerns the one-sided robot-to-task fitness evaluation. Simultaneous assessment of the robot-to-task fitness and task attractiveness for robot should affect positively for the overall effectiveness of the multi-robot system performance. The elaborated system allows to assign tasks to robots using various methods for evaluation of fitness between robots and tasks, and using some tasks allocation methods. There is proposed the method for multi-criteria analysis, which is composed of two assessments, i.e. robot's concurrency position for task among other robots and task's attractiveness for robot among other tasks. Furthermore, there are proposed methods for tasks allocation applying the mentioned multi-criteria analysis method. The verification of both the elaborated system and the proposed tasks' allocation methods was carried out with the help of simulated experiments. The object under test was a group of inspection mobile robots being a virtual counterpart of the real mobile-robot group.
Auctions with Dynamic Populations: Efficiency and Revenue Maximization
NASA Astrophysics Data System (ADS)
Said, Maher
We study a stochastic sequential allocation problem with a dynamic population of privately-informed buyers. We characterize the set of efficient allocation rules and show that a dynamic VCG mechanism is both efficient and periodic ex post incentive compatible; we also show that the revenue-maximizing direct mechanism is a pivot mechanism with a reserve price. We then consider sequential ascending auctions in this setting, both with and without a reserve price. We construct equilibrium bidding strategies in this indirect mechanism where bidders reveal their private information in every period, yielding the same outcomes as the direct mechanisms. Thus, the sequential ascending auction is a natural institution for achieving either efficient or optimal outcomes.
NASA Astrophysics Data System (ADS)
Zhang, Chongfu; Xiao, Nengwu; Chen, Chen; Yuan, Weicheng; Qiu, Kun
2016-02-01
We propose an energy-efficient orthogonal frequency division multiplexing-based passive optical network (OFDM-PON) using adaptive sleep-mode control and dynamic bandwidth allocation. In this scheme, a bidirectional-centralized algorithm named the receiver and transmitter accurate sleep control and dynamic bandwidth allocation (RTASC-DBA), which has an overall bandwidth scheduling policy, is employed to enhance the energy efficiency of the OFDM-PON. The RTASC-DBA algorithm is used in an optical line terminal (OLT) to control the sleep mode of an optical network unit (ONU) sleep and guarantee the quality of service of different services of the OFDM-PON. The obtained results show that, by using the proposed scheme, the average power consumption of the ONU is reduced by ˜40% when the normalized ONU load is less than 80%, compared with the average power consumption without using the proposed scheme.
Three essays on auction markets
NASA Astrophysics Data System (ADS)
Shunda, Nicholas James
This dissertation contains a series of theoretical investigations of auction markets. The essays it contains cover wholesale electricity markets, a popular selling mechanism on eBay, and supplier entry into multi-unit procurement auctions. The study in Chapter 1 compares the procurement cost-minimizing and productive efficiency performance of the auction mechanism used by independent system operators in wholesale electricity auction markets in the U.S. with that of a proposed alternative. The current practice allocates energy contracts as if the auction featured a discriminatory final payment method when, in fact, the markets are uniform price auctions. The proposed alternative explicitly accounts for the market-clearing price during the allocation phase. We find that the proposed alternative largely outperforms the current practice on the basis of procurement costs in the context of simple auction markets featuring both day-ahead and real-time auctions and that the procurement cost advantage of the alternative is complete when we simulate the effects of increased competition. We also find that a tradeoff between the objectives of procurement cost minimization and productive efficiency emerges in our simple auction markets and persists in the face of increased competition. The study in Chapter 2 considers a possible rationale for an auction with a buy price. In an auction with a buy price, the seller provides bidders with an option to end the auction early by accepting a transaction at a posted price. The "Buy-It-Now" option on eBay is a leading example of an auction with a buy price. The study develops a model of an auction with a buy price in which bidders use the auction's reserve price and buy price to formulate a reference price. The model both explains why a revenue-maximizing seller would want to augment her auction with a buy price and demonstrates that the seller sets a higher reserve price when she can affect the bidders' reference price through the auction's reserve price and buy price than when she can affect the bidders' reference price through the auction's reserve price only. Introducing a small reference-price effect can shrink the range of buy prices bidders are willing to exercise. The comparative statics properties of bidding behavior are in sharp contrast to equilibrium behavior in other models where the existence and size of the auction's buy price have no effect on bidding behavior. The study in Chapter 3 investigates endogenous entry in multi-unit auctions. We formulate and study models of multi-unit discriminatory and uniform price auctions and investigate the entry incentives and procurement costs they generate in equilibrium. We study two types of endogenous entry: in auctions with "interim entry costs," suppliers know their private cost information before deciding whether or not to undertake entry; in auctions with ex ante entry costs, suppliers do not know their private cost information before deciding whether or not to enter. The discriminatory and uniform price auctions are efficient and procurement cost equivalent in all the environments we study. With interim entry costs, the two auctions provide identical entry incentives. In contrast, with ex ante entry costs, suppliers enter the discriminatory auction at a higher rate than they enter the uniform price auction.
Back pressure based multicast scheduling for fair bandwidth allocation.
Sarkar, Saswati; Tassiulas, Leandros
2005-09-01
We study the fair allocation of bandwidth in multicast networks with multirate capabilities. In multirate transmission, each source encodes its signal in layers. The lowest layer contains the most important information and all receivers of a session should receive it. If a receiver's data path has additional bandwidth, it receives higher layers which leads to a better quality of reception. The bandwidth allocation objective is to distribute the layers fairly. We present a computationally simple, decentralized scheduling policy that attains the maxmin fair rates without using any knowledge of traffic statistics and layer bandwidths. This policy learns the congestion level from the queue lengths at the nodes, and adapts the packet transmissions accordingly. When the network is congested, packets are dropped from the higher layers; therefore, the more important lower layers suffer negligible packet loss. We present analytical and simulation results that guarantee the maxmin fairness of the resulting rate allocation, and upper bound the packet loss rates for different layers.
Spectrum sharing in cognitive radio networks--an auction-based approach.
Wang, Xinbing; Li, Zheng; Xu, Pengchao; Xu, Youyun; Gao, Xinbo; Chen, Hsiao-Hwa
2010-06-01
Cognitive radio is emerging as a promising technique to improve the utilization of the radio frequency spectrum. In this paper, we consider the problem of spectrum sharing among primary (or "licensed") users (PUs) and secondary (or "unlicensed") users (SUs). We formulate the problem based on bandwidth auction, in which each SU makes a bid for the amount of spectrum and each PU may assign the spectrum among the SUs by itself according to the information from the SUs without degrading its own performance. We show that the auction is a noncooperative game and that Nash equilibrium (NE) can be its solution. We first consider a single-PU network to investigate the existence and uniqueness of the NE and further discuss the fairness among the SUs under given conditions. Then, we present a dynamic updating algorithm in which each SU achieves NE in a distributed manner. The stability condition of the dynamic behavior for this spectrum-sharing scheme is studied. The discussion is generalized to the case in which there are multiple PUs in the network, where the properties of the NE are shown under appropriate conditions. Simulations were used to evaluate the system performance and verify the effectiveness of the proposed algorithm.
The Impact of Human-Automation Collaboration in Decentralized Multiple Unmanned Vehicle Control
2011-01-01
based decentralized auctions for robust task allocation ,[ IEEE Trans. Robot., vol. 25, no. 4, pp...operators can aid such systems by bringing their knowledge- based reasoning and experience to bear. Given a decentralized task planner and a goal- based ...experience to bear. Given a decentralized task planner and a goal- based operator interface for a network of unmanned vehicles in a search, track,
Multi-granularity Bandwidth Allocation for Large-Scale WDM/TDM PON
NASA Astrophysics Data System (ADS)
Gao, Ziyue; Gan, Chaoqin; Ni, Cuiping; Shi, Qiongling
2017-12-01
WDM (wavelength-division multiplexing)/TDM (time-division multiplexing) PON (passive optical network) is being viewed as a promising solution for delivering multiple services and applications, such as high-definition video, video conference and data traffic. Considering the real-time transmission, QoS (quality of services) requirements and differentiated services model, a multi-granularity dynamic bandwidth allocation (DBA) in both domains of wavelengths and time for large-scale hybrid WDM/TDM PON is proposed in this paper. The proposed scheme achieves load balance by using the bandwidth prediction. Based on the bandwidth prediction, the wavelength assignment can be realized fairly and effectively to satisfy the different demands of various classes. Specially, the allocation of residual bandwidth further augments the DBA and makes full use of bandwidth resources in the network. To further improve the network performance, two schemes named extending the cycle of one free wavelength (ECoFW) and large bandwidth shrinkage (LBS) are proposed, which can prevent transmission from interruption when the user employs more than one wavelength. The simulation results show the effectiveness of the proposed scheme.
Algorithmic Coordination in Robotic Networks
2010-11-29
appropriate performance, robustness and scalability properties for various task allocation , surveillance, and information gathering applications is...networking, we envision designing and analyzing algorithms with appropriate performance, robustness and scalability properties for various task ...distributed algorithms for target assignments; based on the classic auction algorithms in static networks, we intend to design efficient algorithms in worst
A Combinatorial Auction among Versatile Experts and Amateurs
NASA Astrophysics Data System (ADS)
Ito, Takayuki; Yokoo, Makoto; Matsubara, Shigeo
Auctions have become an integral part of electronic commerce and a promising field for applying multi-agent technologies. Correctly judging the quality of auctioned goods is often difficult for amateurs, in particular, in Internet auctions. However, experts can correctly judge the quality of goods. In this situation, it is difficult to make experts tell the truth and attain an efficient allocation, since experts have a clear advantage over amateurs and they would not reveal their valuable information without some reward. In our previous work, we have succeeded in developing such auction protocols under the following two cases: (1) the case of a single-unit auction among experts and amateurs, and (2) the case of a combinatorial auction among single-skilled experts and amateurs. In this paper, we focus on versatile experts. Versatile experts have an interest in, and expert knowledge on the qualities of several goods. In the case of versatile experts, there would be several problems, e.g., free riding problems, if we simply extended the previous VCG-style auction protocol. Thus, in this paper, we employ PORF (price-oriented, rationing-free) protocol for designing our new protocol to realize a strategy-proof auction protocol for experts. In the protocol, the dominant strategy for experts is truth-telling. Also, for amateurs, truth-telling is the best response when two or more experts select the dominant strategy. Furthermore, the protocol is false-name-proof.
An enhanced DWBA algorithm in hybrid WDM/TDM EPON networks with heterogeneous propagation delays
NASA Astrophysics Data System (ADS)
Li, Chengjun; Guo, Wei; Jin, Yaohui; Sun, Weiqiang; Hu, Weisheng
2011-12-01
An enhanced dynamic wavelength and bandwidth allocation (DWBA) algorithm in hybrid WDM/TDM PON is proposed and experimentally demonstrated. In addition to the fairness of bandwidth allocation, this algorithm also considers the varying propagation delays between ONUs and OLT. The simulation based on MATLAB indicates that the improved algorithm has a better performance compared with some other algorithms.
NASA Astrophysics Data System (ADS)
Wu, Bin; Yin, Hongxi; Qin, Jie; Liu, Chang; Liu, Anliang; Shao, Qi; Xu, Xiaoguang
2016-09-01
Aiming at the increasing demand of the diversification services and flexible bandwidth allocation of the future access networks, a flexible passive optical network (PON) scheme combining time and wavelength division multiplexing (TWDM) with point-to-point wavelength division multiplexing (PtP WDM) overlay is proposed for the next-generation optical access networks in this paper. A novel software-defined optical distribution network (ODN) structure is designed based on wavelength selective switches (WSS), which can implement wavelength and bandwidth dynamical allocations and suits for the bursty traffic. The experimental results reveal that the TWDM-PON can provide 40 Gb/s downstream and 10 Gb/s upstream data transmission, while the PtP WDM-PON can support 10 GHz point-to-point dedicated bandwidth as the overlay complement system. The wavelengths of the TWDM-PON and PtP WDM-PON are allocated dynamically based on WSS, which verifies the feasibility of the proposed structure.
1980-04-15
schedule their air transportation networks, and learn the performance and financial results through simulation of the resulting traffic flows, costs...players in the role of airline management responsible for airline scheduling and market, fleet and financial planning. The Game Administrator created a...revenues and consequently the financial results for each airline. During this exercise the objective of each airline team was to schedule its flights so
Adaptive Broadcasting Mechanism for Bandwidth Allocation in Mobile Services
Horng, Gwo-Jiun; Wang, Chi-Hsuan; Chou, Chih-Lun
2014-01-01
This paper proposes a tree-based adaptive broadcasting (TAB) algorithm for data dissemination to improve data access efficiency. The proposed TAB algorithm first constructs a broadcast tree to determine the broadcast frequency of each data and splits the broadcast tree into some broadcast wood to generate the broadcast program. In addition, this paper develops an analytical model to derive the mean access latency of the generated broadcast program. In light of the derived results, both the index channel's bandwidth and the data channel's bandwidth can be optimally allocated to maximize bandwidth utilization. This paper presents experiments to help evaluate the effectiveness of the proposed strategy. From the experimental results, it can be seen that the proposed mechanism is feasible in practice. PMID:25057509
Essays on wholesale auctions in deregulated electricity markets
NASA Astrophysics Data System (ADS)
Baltaduonis, Rimvydas
2007-12-01
The early experience in the restructured electric power markets raised several issues, including price spikes, inefficiency, security, and the overall relationship of market clearing prices to generation costs. Unsatisfactory outcomes in these markets are thought to have resulted in part from strategic generator behaviors encouraged by inappropriate market design features. In this dissertation, I examine the performance of three auction mechanisms for wholesale power markets - Offer Cost Minimization auction, Payment Cost Minimization auction and Simple-Offer auction - when electricity suppliers act strategically. A Payment Cost Minimization auction has been proposed as an alternative to the traditional Offer Cost Minimization auction with the intention to solve the problem of inflated wholesale electricity prices. Efficiency concerns for this proposal were voiced due to insights predicated on the assumption of true production cost revelation. Using a game theoretic approach and an experimental method, I compare the two auctions, strictly controlling for the level of unilateral market power. A specific feature of these complex-offer auctions is that the sellers submit not only the quantities and the minimum prices that they are willing to sell at, but also the start-up fees, which are designed to reimburse the fixed start-up costs of the generation plants. I find that the complex structure of the offers leaves considerable room for strategic behavior, which consequently leads to anti-competitive and inefficient market outcomes. In the last chapter of my dissertation, I use laboratory experiments to contrast the performance of two complex-offer auctions against the performance of a simple-offer auction, in which the sellers have to recover all their generation costs - fixed and variable - through a uniform market-clearing price. I find that a simple-offer auction significantly reduces consumer prices and lowers price volatility. It mitigates anti-competitive effects that are present in the complex-offer auctions and achieves allocative efficiency more quickly.
NASA Astrophysics Data System (ADS)
Kim, Hoon; Hyon, Taein; Lee, Yeonwoo
Most of previous works have presented the dynamic spectrum allocation (DSA) gain achieved by utilizing the time or regional variations in traffic demand between multi-network operators (NOs). In this paper, we introduce the functionalities required for the entities related with the spectrum sharing and allocation and propose a spectrum allocation algorithm while considering the long-term priority between NOs, the priority between multiple class services, and the urgent bandwidth request. To take into account the priorities among the NOs and the priorities of multiple class services, a spectrum sharing metric (SSM) is proposed, while a negotiation procedure is proposed to treat the urgent bandwidth request.
Coalition Formation under Uncertainty
2010-03-01
world robotics and demonstrate the algorithm’s scalability. This provides a framework well suited to decentralized task allocation in general collectives...impatience and acquiescence to define a robot allocation to a task in a decentralized manner. The tasks are assigned to the entire collective, and one...20] allocates tasks to robots with a first-price auction method [31]. It announces a task with defined metrics, then the robots issue bids. The task
Auction-based distributed efficient economic operations of microgrid systems
NASA Astrophysics Data System (ADS)
Zou, Suli; Ma, Zhongjing; Liu, Xiangdong
2014-12-01
This paper studies the economic operations of the microgrid in a distributed way such that the operational schedule of each of the units, like generators, load units, storage units, etc., in a microgrid system, is implemented by autonomous agents. We apply and generalise the progressive second price (PSP) auction mechanism which was proposed by Lazar and Semret to efficiently allocate the divisible network resources. Considering the economic operation for the microgrid systems, the generators play as sellers to supply energy and the load units play as the buyers to consume energy, while a storage unit, like battery, super capacitor, etc., may transit between buyer and seller, such that it is a buyer when it charges and becomes a seller when it discharges. Furthermore in a connected mode, each individual unit competes against not only the other individual units in the microgrid but also the exogenous main grid possessing fixed electricity price and infinite trade capacity; that is to say, the auctioneer assigns the electricity among all individual units and the main grid with respect to the submitted bid strategies of all individual units in the microgrid in an economic way. Due to these distinct characteristics, the underlying auction games are distinct from those studied in the literature. We show that under mild conditions, the efficient economic operation strategy is a Nash equilibrium (NE) for the PSP auction games, and propose a distributed algorithm under which the system can converge to an NE. We also show that the performance of worst NE can be bounded with respect to the system parameters, say the energy trading price with the main grid, and based upon that, the implemented NE is unique and efficient under some conditions.
NASA Astrophysics Data System (ADS)
Zang, Hailing
This dissertation uses recently developed empirical methodologies for the study of multi-unit auctions to test the impacts of Financial Transmission Rights (FTRs) on the competitiveness of restructured electricity markets. FTRs are a special type of financial option that hedge against volatility in the cost of transporting electricity over the grid. Policy makers seek to use the prices of FTRs as market signals to incentivize efficient investment and utilization of transmission capacity. However, prices will not send the correct signals if market participants strategically use FTRs. This dissertation uses data from the Texas electricity market to test whether the prices of FTRs are efficient to achieve such goals. The auctions studied are multi-unit, uniform-price, sealed-bid auctions. The first part of the dissertation studies the auctions on the spot market of the wholesale electricity industry. I derive structural empirical models to test theoretical predictions as to whether bidders fully internalize the effect of FTRs on profits into their bidding decisions. I find that bidders are learning as to how to optimally bid above marginal cost for their inframarginal capacities. The bidders also learn to bid to include FTRs into their profit maximization problem during the course of the first year. But starting from the second year, they deviated from optimal bidding that includes FTRs in the profit maximization problems. Counterfactual analysis show that the primary effect of FTRs on market outcomes is changing the level of prices rather than production efficiency. Finally, I find that in most months, the current allocations of FTRs are statistically equivalent to the optimal allocations. The second part of the dissertation studies the bidding behavior in the FTR auctions. I find that FTRs' strategic impact on the FTR purchasing behavior is significant for large bidders---firms exercising market power in the FTR auctions. Second, trader forecasts future FTR credit very accurately while large generators' forecasts of future FTR credit tends to be biased upward. Finally, the bid shading patterns are consistent with theoretical predictions and support the existence of common values.
Dynamic Bandwidth Allocation with Effective Utilization of Polling Interval over WDM/TDM PON
NASA Astrophysics Data System (ADS)
Ni, Cuiping; Gan, Chaoqin; Gao, Ziyue
2014-12-01
WDM/TDM (wavelength-division multiplexing/time-division multiplexing) PON (passive optical network) appears to be an attractive solution for the next generation optical access networks. Dynamic bandwidth allocation (DBA) plays a crucial role in efficiently and fairly allocating the bandwidth among all users in WDM/TDM PON. In this paper, two dynamic bandwidth allocation schemes (DBA1 and DBA2) are proposed to eliminate the idle time of polling cycles (i.e. polling interval), improve bandwidth utilization and make full use of bandwidth resources. The two DBA schemes adjust the time slot of sending request information and make fair scheduling among users to achieve the effective utilization of polling interval in WDM/TDM PON. The simulation and theoretical analyses verify that the proposed schemes outperform the conventional DBA scheme. We also make comparisons between the two schemes in terms of bandwidth utilization and average packet delay to further demonstrate the effectiveness of the scheme of DBA2.
NASA Astrophysics Data System (ADS)
Wang, Fu; Liu, Bo; Zhang, Lijia; Jin, Feifei; Zhang, Qi; Tian, Qinghua; Tian, Feng; Rao, Lan; Xin, Xiangjun
2017-03-01
The wavelength-division multiplexing passive optical network (WDM-PON) is a potential technology to carry multiple services in an optical access network. However, it has the disadvantages of high cost and an immature technique for users. A software-defined WDM/time-division multiplexing PON was proposed to meet the requirements of high bandwidth, high performance, and multiple services. A reasonable and effective uplink dynamic bandwidth allocation algorithm was proposed. A controller with dynamic wavelength and slot assignment was introduced, and a different optical dynamic bandwidth management strategy was formulated flexibly for services of different priorities according to the network loading. The simulation compares the proposed algorithm with the interleaved polling with adaptive cycle time algorithm. The algorithm shows better performance in average delay, throughput, and bandwidth utilization. The results show that the delay is reduced to 62% and the throughput is improved by 35%.
40 CFR 97.621 - Recordation of TR SO2 Group 1 allowance allocations and auction results.
Code of Federal Regulations, 2012 CFR
2012-07-01
... allocated to the TR SO2 Group 1 units at the source in accordance with § 97.611(a) for the control period in... allocated to the TR SO2 Group 1 units at the source in accordance with § 97.611(a) for the control period in... SO2 Group 1 units at the source in accordance with § 97.611(a) for the control period in 2013. (c) By...
40 CFR 97.721 - Recordation of TR SO2 Group 2 allowance allocations and auction results.
Code of Federal Regulations, 2012 CFR
2012-07-01
... allocated to the TR SO2 Group 2 units at the source in accordance with § 97.711(a) for the control period in... allocated to the TR SO2 Group 2 units at the source in accordance with § 97.711(a) for the control period in... SO2 Group 2 units at the source in accordance with § 97.711(a) for the control period in 2013. (c) By...
I/O-aware bandwidth allocation for petascale computing systems
DOE Office of Scientific and Technical Information (OSTI.GOV)
Zhou, Zhou; Yang, Xu; Zhao, Dongfang
In the Big Data era, the gap between the storage performance and an appli- cation's I/O requirement is increasing. I/O congestion caused by concurrent storage accesses from multiple applications is inevitable and severely harms the performance. Conventional approaches either focus on optimizing an ap- plication's access pattern individually or handle I/O requests on a low-level storage layer without any knowledge from the upper-level applications. In this paper, we present a novel I/O-aware bandwidth allocation framework to coordinate ongoing I/O requests on petascale computing systems. The motivation behind this innovation is that the resource management system has a holistic view ofmore » both the system state and jobs' activities and can dy- namically control the jobs' status or allocate resource on the y during their execution. We treat a job's I/O requests as periodical subjobs within its lifecycle and transform the I/O congestion issue into a classical scheduling problem. Based on this model, we propose a bandwidth management mech- anism as an extension to the existing scheduling system. We design several bandwidth allocation policies with different optimization objectives either on user-oriented metrics or system performance. We conduct extensive trace- based simulations using real job traces and I/O traces from a production IBM Blue Gene/Q system at Argonne National Laboratory. Experimental results demonstrate that our new design can improve job performance by more than 30%, as well as increasing system performance.« less
40 CFR 97.521 - Recordation of TR NOX Ozone Season allowance allocations and auction results.
Code of Federal Regulations, 2014 CFR
2014-07-01
... 40 Protection of Environment 21 2014-07-01 2014-07-01 false Recordation of TR NOX Ozone Season... SO2 TRADING PROGRAMS TR NOX Ozone Season Trading Program § 97.521 Recordation of TR NOX Ozone Season... Ozone Season source's compliance account the TR NOX Ozone Season allowances allocated to the TR NOX...
40 CFR 97.521 - Recordation of TR NOX Ozone Season allowance allocations and auction results.
Code of Federal Regulations, 2012 CFR
2012-07-01
... 40 Protection of Environment 22 2012-07-01 2012-07-01 false Recordation of TR NOX Ozone Season... SO2 TRADING PROGRAMS TR NOX Ozone Season Trading Program § 97.521 Recordation of TR NOX Ozone Season... Ozone Season source's compliance account the TR NOX Ozone Season allowances allocated to the TR NOX...
40 CFR 97.521 - Recordation of TR NOX Ozone Season allowance allocations and auction results.
Code of Federal Regulations, 2013 CFR
2013-07-01
... 40 Protection of Environment 22 2013-07-01 2013-07-01 false Recordation of TR NOX Ozone Season... SO2 TRADING PROGRAMS TR NOX Ozone Season Trading Program § 97.521 Recordation of TR NOX Ozone Season... Ozone Season source's compliance account the TR NOX Ozone Season allowances allocated to the TR NOX...
NASA Technical Reports Server (NTRS)
Bradley, D. B.; Irwin, J. D.
1974-01-01
A computer simulation model for a multiprocessor computer is developed that is useful for studying the problem of matching multiprocessor's memory space, memory bandwidth and numbers and speeds of processors with aggregate job set characteristics. The model assumes an input work load of a set of recurrent jobs. The model includes a feedback scheduler/allocator which attempts to improve system performance through higher memory bandwidth utilization by matching individual job requirements for space and bandwidth with space availability and estimates of bandwidth availability at the times of memory allocation. The simulation model includes provisions for specifying precedence relations among the jobs in a job set, and provisions for specifying precedence execution of TMR (Triple Modular Redundant and SIMPLEX (non redundant) jobs.
Power Management in Regenerative Life Support Systems
NASA Technical Reports Server (NTRS)
Crawford, Sekou; Pawlowski, Christopher; Finn, Cory; Mead, Susan C. (Technical Monitor)
1999-01-01
Effective management of power can reduce the cost of launch and operation of regenerative life support systems. Variations in power may be quite severe and may manifest as surges or spikes, While the power plant may have some ability to deal with these variations, with batteries for example, over-capacity is expensive and does nothing to address the fundamental issue of excessive demand. Because the power unit must be sized to accommodate the largest demand, avoiding power spikes has the potential to reduce the required size of the power plant while at the same time increasing the dependability of the system. Scheduling of processors can help to reduce potential power spikes. However, not all power-consuming equipment is easily scheduled. Therefore, active power management is needed to further decrease the risk of surges or spikes. We investigate the use of a hierarchical scheme to actively manage power for a model of a regenerative life support system. Local level controllers individually determine subsystem power usage. A higher level controller monitors overall system power and detects surges or spikes. When a surge condition is detected, the higher level controller conducts an 'auction' and describes subsystem power usage to re-allocate power. The result is an overall reduction in total power during a power surge. The auction involves each subsystem making a 'bid' to buy or sell power based on local needs. However, this re-allocation cannot come at the expense of life support function. To this end, participation in the auction is restricted to those processes meeting certain tolerance constraints. These tolerances represent acceptable limits within which system processes can be operated. We present a simulation model and discuss some of our results.
A Hybrid OFDM-TDM Architecture with Decentralized Dynamic Bandwidth Allocation for PONs
Cevik, Taner
2013-01-01
One of the major challenges of passive optical networks is to achieve a fair arbitration mechanism that will prevent possible collisions from occurring at the upstream channel when multiple users attempt to access the common fiber at the same time. Therefore, in this study we mainly focus on fair bandwidth allocation among users, and present a hybrid Orthogonal Frequency Division Multiplexed/Time Division Multiplexed architecture with a dynamic bandwidth allocation scheme that provides satisfying service qualities to the users depending on their varying bandwidth requirements. Unnecessary delays in centralized schemes occurring during bandwidth assignment stage are eliminated by utilizing a decentralized approach. Instead of sending bandwidth demands to the optical line terminal (OLT) which is the only competent authority, each optical network unit (ONU) runs the same bandwidth demand determination algorithm. ONUs inform each other via signaling channel about the status of their queues. This information is fed to the bandwidth determination algorithm which is run by each ONU in a distributed manner. Furthermore, Light Load Penalty, which is a phenomenon in optical communications, is mitigated by limiting the amount of bandwidth that an ONU can demand. PMID:24194684
Market-oriented Programming Using Small-world Networks for Controlling Building Environments
NASA Astrophysics Data System (ADS)
Shigei, Noritaka; Miyajima, Hiromi; Osako, Tsukasa
The market model, which is one of the economic activity models, is modeled as an agent system, and applying the model to the resource allocation problem has been studied. For air conditioning control of building, which is one of the resource allocation problems, an effective method based on the agent system using auction has been proposed for traditional PID controller. On the other hand, it has been considered that this method is performed by decentralized control. However, its decentralization is not perfect, and its performace is not enough. In this paper, firstly, we propose a perfectly decentralized agent model and show its performance. Secondly, in order to improve the model, we propose the agent model based on small-world model. The effectiveness of the proposed model is shown by simulation.
Trust-based Task Assignment in Military Tactical Networks
2012-06-01
Decentralized Auctions for Robust Task Allocation ,“ IEEE Trans. on Robotics, vol. 25, no. 4, pp. 912‐926, Aug. 2009. [10] B.B. Choudhury, B.B. Biswal, and D...Choi et al. [9] and Choudhury et al. [10] investigated market‐ based task allocation algorithms for multi‐robot systems. Choi et al. [9] proposed a... consensus ‐ based bundle algorithm for rapid conflict‐free matching between tasks and robots. Choudhury et al. [10] conducted an empirical study on a
A False-name-Proof Double Auction Protocol for Arbitrary Evaluation Values
NASA Astrophysics Data System (ADS)
Sakurai, Yuko; Yokoo, Makoto
We develop a new false-name-proof double auction protocol called the Generalized Threshold Price Double auction (GTPD) protocol. False-name-proofness generalizes strategy-proofness by incorporating the possibility of false-name bids, e.g., bids submitted using multiple e-mail addresses. An existing protocol called TPD protocol is false-name-proof but can handle only the cases where marginal utilities of each agent always decrease, while our new GTPD protocol can handle arbitrary evaluation values. When marginal utilities can increase, some bids cannot be divided into a single unit (e.g., an all-or-nothing bid). Due to the existence of such indivisible bids, meeting supply/demand becomes difficult. Furthermore, a seller/buyer can submit a false-name-bid by pretending to be a potential buyer/seller to manipulate allocations and payments. In the GTPD protocol, the auctioneer is required to absorb the supply-demand imbalance up to a given upper-bound. Also, the GTPD incorporate a new false-name-proof one-sided auction protocol that is guaranteed to sell/buy a certain number of units. Simulation results show that when the threshold price is set appropriately, this protocol can obtain a good social surplus, and the number of absorbed units is much smaller than the given upper-bound.
A game-theoretical pricing mechanism for multiuser rate allocation for video over WiMAX
NASA Astrophysics Data System (ADS)
Chen, Chao-An; Lo, Chi-Wen; Lin, Chia-Wen; Chen, Yung-Chang
2010-07-01
In multiuser rate allocation in a wireless network, strategic users can bias the rate allocation by misrepresenting their bandwidth demands to a base station, leading to an unfair allocation. Game-theoretical approaches have been proposed to address the unfair allocation problems caused by the strategic users. However, existing approaches rely on a timeconsuming iterative negotiation process. Besides, they cannot completely prevent unfair allocations caused by inconsistent strategic behaviors. To address these problems, we propose a Search Based Pricing Mechanism to reduce the communication time and to capture a user's strategic behavior. Our simulation results show that the proposed method significantly reduce the communication time as well as converges stably to an optimal allocation.
A mechanism design approach to bandwidth allocation in tactical data networks
NASA Astrophysics Data System (ADS)
Mour, Ankur
The defense sector is undergoing a phase of rapid technological advancement, in the pursuit of its goal of information superiority. This goal depends on a large network of complex interconnected systems - sensors, weapons, soldiers - linked through a maze of heterogeneous networks. The sheer scale and size of these networks prompt behaviors that go beyond conglomerations of systems or `system-of-systems'. The lack of a central locus and disjointed, competing interests among large clusters of systems makes this characteristic of an Ultra Large Scale (ULS) system. These traits of ULS systems challenge and undermine the fundamental assumptions of today's software and system engineering approaches. In the absence of a centralized controller it is likely that system users may behave opportunistically to meet their local mission requirements, rather than the objectives of the system as a whole. In these settings, methods and tools based on economics and game theory (like Mechanism Design) are likely to play an important role in achieving globally optimal behavior, when the participants behave selfishly. Against this background, this thesis explores the potential of using computational mechanisms to govern the behavior of ultra-large-scale systems and achieve an optimal allocation of constrained computational resources Our research focusses on improving the quality and accuracy of the common operating picture through the efficient allocation of bandwidth in tactical data networks among self-interested actors, who may resort to strategic behavior dictated by self-interest. This research problem presents the kind of challenges we anticipate when we have to deal with ULS systems and, by addressing this problem, we hope to develop a methodology which will be applicable for ULS system of the future. We build upon the previous works which investigate the application of auction-based mechanism design to dynamic, performance-critical and resource-constrained systems of interest to the defense community. In this thesis, we consider a scenario where a number of military platforms have been tasked with the goal of detecting and tracking targets. The sensors onboard a military platform have a partial and inaccurate view of the operating picture and need to make use of data transmitted from neighboring sensors in order to improve the accuracy of their own measurements. The communication takes place over tactical data networks with scarce bandwidth. The problem is compounded by the possibility that the local goals of military platforms might not be aligned with the global system goal. Such a scenario might occur in multi-flag, multi-platform military exercises, where the military commanders of each platform are more concerned with the well-being of their own platform over others. Therefore there is a need to design a mechanism that efficiently allocates the flow of data within the network to ensure that the resulting global performance maximizes the information gain of the entire system, despite the self-interested actions of the individual actors. We propose a two-stage mechanism based on modified strictly-proper scoring rules, with unknown costs, whereby multiple sensor platforms can provide estimates of limited precisions and the center does not have to rely on knowledge of the actual outcome when calculating payments. In particular, our work emphasizes the importance of applying robust optimization techniques to deal with the uncertainty in the operating environment. We apply our robust optimization - based scoring rules algorithm to an agent-based model framework of the combat tactical data network, and analyze the results obtained. Through the work we hope to demonstrate how mechanism design, perched at the intersection of game theory and microeconomics, is aptly suited to address one set of challenges of the ULS system paradigm - challenges not amenable to traditional system engineering approaches.
A novel dynamic wavelength bandwidth allocation scheme over OFDMA PONs
NASA Astrophysics Data System (ADS)
Yan, Bo; Guo, Wei; Jin, Yaohui; Hu, Weisheng
2011-12-01
With rapid growth of Internet applications, supporting differentiated service and enlarging system capacity have been new tasks for next generation access system. In recent years, research in OFDMA Passive Optical Networks (PON) has experienced extraordinary development as for its large capacity and flexibility in scheduling. Although much work has been done to solve hardware layer obstacles for OFDMA PON, scheduling algorithm on OFDMA PON system is still under primary discussion. In order to support QoS service on OFDMA PON system, a novel dynamic wavelength bandwidth allocation (DWBA) algorithm is proposed in this paper. Per-stream QoS service is supported in this algorithm. Through simulation, we proved our bandwidth allocation algorithm performs better in bandwidth utilization and differentiate service support.
NASA Astrophysics Data System (ADS)
Wei, Pei; Gu, Rentao; Ji, Yuefeng
2014-06-01
As an innovative and promising technology, network coding has been introduced to passive optical networks (PON) in recent years to support inter optical network unit (ONU) communication, yet the signaling process and dynamic bandwidth allocation (DBA) in PON with network coding (NC-PON) still need further study. Thus, we propose a joint signaling and DBA scheme for efficiently supporting differentiated services of inter ONU communication in NC-PON. In the proposed joint scheme, the signaling process lays the foundation to fulfill network coding in PON, and it can not only avoid the potential threat to downstream security in previous schemes but also be suitable for the proposed hybrid dynamic bandwidth allocation (HDBA) scheme. In HDBA, a DBA cycle is divided into two sub-cycles for applying different coding, scheduling and bandwidth allocation strategies to differentiated classes of services. Besides, as network traffic load varies, the entire upstream transmission window for all REPORT messages slides accordingly, leaving the transmission time of one or two sub-cycles to overlap with the bandwidth allocation calculation time at the optical line terminal (the OLT), so that the upstream idle time can be efficiently eliminated. Performance evaluation results validate that compared with the existing two DBA algorithms deployed in NC-PON, HDBA demonstrates the best quality of service (QoS) support in terms of delay for all classes of services, especially guarantees the end-to-end delay bound of high class services. Specifically, HDBA can eliminate queuing delay and scheduling delay of high class services, reduce those of lower class services by at least 20%, and reduce the average end-to-end delay of all services over 50%. Moreover, HDBA also achieves the maximum delay fairness between coded and uncoded lower class services, and medium delay fairness for high class services.
Jung, Sun-Young; Kim, Chang-Hun; Han, Sang-Kook
2018-05-14
Simultaneous multiple access (MA) within a single wavelength can increase the data rate and split ratio in a passive optical network while optical beat interference (OBI) becomes serious in the uplink. Previous techniques to reduce OBI were limited by their complexity and lack of extendibility; as well, bandwidth allocation among MA signals is needed for single photo diode (PD) detection. We proposed and experimentally demonstrated full-band optical pulse division multiplexing-based MA (OPDMA) in an optical access network, which can effectively reduce OBI with extendibility and fully utilize frequency resources of optical modulator without bandwidth allocation in a single-wavelength MA.
Smarter than others? Conjectures in lowest unique bid auctions.
Zhou, Cancan; Dong, Hongguang; Hu, Rui; Chen, Qinghua
2015-01-01
Research concerning various types of auctions, such as English auctions, Dutch auctions, highest-price sealed-bid auctions, and second-price sealed-bid auctions, is always a topic of considerable interest in interdisciplinary fields. The type of auction, known as a lowest unique bid auction (LUBA), has also attracted significant attention. Various models have been proposed, but they often fail to explain satisfactorily the real bid-distribution characteristics. This paper discusses LUBA bid-distribution characteristics, including the inverted-J shape and the exponential decrease in the upper region. The authors note that this type of distribution, which initially increases and later decreases, cannot be derived from the symmetric Nash equilibrium framework based on perfect information that has previously been used. A novel optimization model based on non-perfect information is presented. The kernel of this model is the premise that agents make decisions to achieve maximum profit based on imaginary information or assumptions regarding the behavior of others.
ERIC Educational Resources Information Center
Congress of the U.S., Washington, DC. House Committee on Energy and Commerce.
A discussion of H.R. 1407, a bill to establish procedures to improve the allocation and assignment to the electromagnetic spectrum centered on the current policy of allocating portions of the spectrum through lotteries and auction. This report includes a copy of the bill, the text of testimony presented and materials submitted for the record, and…
Nash Social Welfare in Multiagent Resource Allocation
NASA Astrophysics Data System (ADS)
Ramezani, Sara; Endriss, Ulle
We study different aspects of the multiagent resource allocation problem when the objective is to find an allocation that maximizes Nash social welfare, the product of the utilities of the individual agents. The Nash solution is an important welfare criterion that combines efficiency and fairness considerations. We show that the problem of finding an optimal outcome is NP-hard for a number of different languages for representing agent preferences; we establish new results regarding convergence to Nash-optimal outcomes in a distributed negotiation framework; and we design and test algorithms similar to those applied in combinatorial auctions for computing such an outcome directly.
Cross-layer shared protection strategy towards data plane in software defined optical networks
NASA Astrophysics Data System (ADS)
Xiong, Yu; Li, Zhiqiang; Zhou, Bin; Dong, Xiancun
2018-04-01
In order to ensure reliable data transmission on the data plane and minimize resource consumption, a novel protection strategy towards data plane is proposed in software defined optical networks (SDON). Firstly, we establish a SDON architecture with hierarchical structure of data plane, which divides the data plane into four layers for getting fine-grained bandwidth resource. Then, we design the cross-layer routing and resource allocation based on this network architecture. Through jointly considering the bandwidth resource on all the layers, the SDN controller could allocate bandwidth resource to working path and backup path in an economical manner. Next, we construct auxiliary graphs and transform the shared protection problem into the graph vertex coloring problem. Therefore, the resource consumption on backup paths can be reduced further. The simulation results demonstrate that the proposed protection strategy can achieve lower protection overhead and higher resource utilization ratio.
Initial Approaches to Mitigating the Impacts of the AWS-3 Auction (1755-1780 MHz)
2015-05-13
band. Specifically, the impact of new Long Term Evolution – Advanced ( LTE -A) services on AMT operations at the Edwards Range. 15. SUBJECT TERMS...AWS-3, Aeronautical Mobile Telemetry, LTE -A, Transition Plan, Transmitters, Receivers, Antenna Systems, Bandwidth Efficient Modulation, Spectrum 16...occupants of the adjacent band which is expected to be 4G LTE -Advanced services • More potential for RF interference from commercial services • Band will
Auction and Game Theory Based Recommendations for DOD Acquisitions
2015-03-24
SPONSORED REPORT SERIES Auction and Game Theory Based Recommendations for DOD Acquisitions 24 March 2015 Justin Blott, 2d Lt; Nicholas...TYPE 3. DATES COVERED 00-00-2015 to 00-00-2015 4. TITLE AND SUBTITLE Auction and Game Theory Based Recommendations for DOD Acquisitions 5a...Postgraduate School Abstract This paper synthesizes auction and game theory literature into specific military acquisition improvement
Intelligent bandwidth compression
NASA Astrophysics Data System (ADS)
Tseng, D. Y.; Bullock, B. L.; Olin, K. E.; Kandt, R. K.; Olsen, J. D.
1980-02-01
The feasibility of a 1000:1 bandwidth compression ratio for image transmission has been demonstrated using image-analysis algorithms and a rule-based controller. Such a high compression ratio was achieved by first analyzing scene content using auto-cueing and feature-extraction algorithms, and then transmitting only the pertinent information consistent with mission requirements. A rule-based controller directs the flow of analysis and performs priority allocations on the extracted scene content. The reconstructed bandwidth-compressed image consists of an edge map of the scene background, with primary and secondary target windows embedded in the edge map. The bandwidth-compressed images are updated at a basic rate of 1 frame per second, with the high-priority target window updated at 7.5 frames per second. The scene-analysis algorithms used in this system together with the adaptive priority controller are described. Results of simulated 1000:1 bandwidth-compressed images are presented.
Energy-saving EPON Bandwidth Allocation Algorithm Supporting ONU's Sleep Mode
NASA Astrophysics Data System (ADS)
Zhang, Yinfa; Ren, Shuai; Liao, Xiaomin; Fang, Yuanyuan
2014-09-01
A new bandwidth allocation algorithm was presented by combining merits of the IPACT algorithm and the cyclic DBA algorithm based on the DBA algorithm for ONU's sleep mode. Simulation results indicate that compared with the normal mode ONU, the ONU's sleep mode can save about 74% of energy. The new algorithm has a smaller average packet delay and queue length in the upstream direction. While in the downstream direction, the average packet delay of the new algorithm is less than polling cycle Tcycle and the average queue length is less than the product of Tcycle and the maximum link rate. The new algorithm achieves a better compromise between energy-saving and ensuring quality of service.
NASA Technical Reports Server (NTRS)
1997-01-01
Patterned after the Cassini Resource Exchange (CRE), Sholtz and Associates established the Automated Credit Exchange (ACE), an Internet-based concept that automates the auctioning of "pollution credits" in Southern California. An early challenge of the Jet Propulsion Laboratory's Cassini mission was allocating the spacecraft's resources. To support the decision-making process, the CRE was developed. The system removes the need for the science instrument manager to know the individual instruments' requirements for the spacecraft resources. Instead, by utilizing principles of exchange, the CRE induces the instrument teams to reveal their requirements. In doing so, they arrive at an efficient allocation of spacecraft resources by trading among themselves. A Southern California RECLAIM air pollution credit trading market has been set up using same bartering methods utilized in the Cassini mission in order to help companies keep pollution and costs down.
Li, Yajie; Zhao, Yongli; Zhang, Jie; Yu, Xiaosong; Jing, Ruiquan
2017-11-27
Network operators generally provide dedicated lightpaths for customers to meet the demand for high-quality transmission. Considering the variation of traffic load, customers usually rent peak bandwidth that exceeds the practical average traffic requirement. In this case, bandwidth provisioning is unmetered and customers have to pay according to peak bandwidth. Supposing that network operators could keep track of traffic load and allocate bandwidth dynamically, bandwidth can be provided as a metered service and customers would pay for the bandwidth that they actually use. To achieve cost-effective bandwidth provisioning, this paper proposes an autonomic bandwidth adjustment scheme based on data analysis of traffic load. The scheme is implemented in a software defined networking (SDN) controller and is demonstrated in the field trial of multi-vendor optical transport networks. The field trial shows that the proposed scheme can track traffic load and realize autonomic bandwidth adjustment. In addition, a simulation experiment is conducted to evaluate the performance of the proposed scheme. We also investigate the impact of different parameters on autonomic bandwidth adjustment. Simulation results show that the step size and adjustment period have significant influences on bandwidth savings and packet loss. A small value of step size and adjustment period can bring more benefits by tracking traffic variation with high accuracy. For network operators, the scheme can serve as technical support of realizing bandwidth as metered service in the future.
NASA Astrophysics Data System (ADS)
Bock, Carlos; Prat, Josep; Walker, Stuart D.
2005-12-01
A novel time/space/wavelength division multiplexing (TDM/WDM) architecture using the free spectral range (FSR) periodicity of the arrayed waveguide grating (AWG) is presented. A shared tunable laser and a photoreceiver stack featuring dynamic bandwidth allocation (DBA) and remote modulation are used for transmission and reception. Transmission tests show correct operation at 2.5 Gb/s to a 30-km reach, and network performance calculations using queue modeling demonstrate that a high-bandwidth-demanding application could be deployed on this network.
47 CFR 2.1049 - Measurements required: Occupied bandwidth.
Code of Federal Regulations, 2010 CFR
2010-10-01
... established for the characteristic baseband frequency. (Modulation reference level is defined as the average....1049 Section 2.1049 Telecommunication FEDERAL COMMUNICATIONS COMMISSION GENERAL FREQUENCY ALLOCATIONS... Certification § 2.1049 Measurements required: Occupied bandwidth. The occupied bandwidth, that is the frequency...
Worst-Case Cooperative Jamming for Secure Communications in CIoT Networks.
Li, Zhen; Jing, Tao; Ma, Liran; Huo, Yan; Qian, Jin
2016-03-07
The Internet of Things (IoT) is a significant branch of the ongoing advances in the Internet and mobile communications. The use of a large number of IoT devices makes the spectrum scarcity problem even more serious. The usable spectrum resources are almost entirely occupied, and thus, the increasing radio access demands of IoT devices cannot be met. To tackle this problem, the Cognitive Internet of Things (CIoT) has been proposed. In a CIoT network, secondary users, i.e., sensors and actuators, can access the licensed spectrum bands provided by licensed primary users (such as telephones). Security is a major concern in CIoT networks. However, the traditional encryption method at upper layers (such as symmetric cryptography and asymmetric cryptography) may be compromised in CIoT networks, since these types of networks are heterogeneous. In this paper, we address the security issue in spectrum-leasing-based CIoT networks using physical layer methods. Considering that the CIoT networks are cooperative networks, we propose to employ cooperative jamming to achieve secrecy transmission. In the cooperative jamming scheme, a certain secondary user is employed as the helper to harvest energy transmitted by the source and then uses the harvested energy to generate an artificial noise that jams the eavesdropper without interfering with the legitimate receivers. The goal is to minimize the signal to interference plus noise ratio (SINR) at the eavesdropper subject to the quality of service (QoS) constraints of the primary traffic and the secondary traffic. We formulate the considered minimization problem into a two-stage robust optimization problem based on the worst-case Channel State Information of the Eavesdropper. By using semi-definite programming (SDP), the optimal solutions of the transmit covariance matrices can be obtained. Moreover, in order to build an incentive mechanism for the secondary users, we propose an auction framework based on the cooperative jamming scheme. The proposed auction framework jointly formulates the helper selection and the corresponding energy allocation problems under the constraint of the eavesdropper's SINR. By adopting the Vickrey auction, truthfulness and individual rationality can be guaranteed. Simulation results demonstrate the good performance of the cooperative jamming scheme and the auction framework.
Holding-time-aware asymmetric spectrum allocation in virtual optical networks
NASA Astrophysics Data System (ADS)
Lyu, Chunjian; Li, Hui; Liu, Yuze; Ji, Yuefeng
2017-10-01
Virtual optical networks (VONs) have been considered as a promising solution to support current high-capacity dynamic traffic and achieve rapid applications deployment. Since most of the network services (e.g., high-definition video service, cloud computing, distributed storage) in VONs are provisioned by dedicated data centers, needing different amount of bandwidth resources in both directions, the network traffic is mostly asymmetric. The common strategy, symmetric provisioning of traffic in optical networks, leads to a waste of spectrum resources in such traffic patterns. In this paper, we design a holding-time-aware asymmetric spectrum allocation module based on SDON architecture and an asymmetric spectrum allocation algorithm based on the module is proposed. For the purpose of reducing spectrum resources' waste, the algorithm attempts to reallocate the idle unidirectional spectrum slots in VONs, which are generated due to the asymmetry of services' bidirectional bandwidth. This part of resources can be exploited by other requests, such as short-time non-VON requests. We also introduce a two-dimensional asymmetric resource model for maintaining idle spectrum resources information of VON in spectrum and time domains. Moreover, a simulation is designed to evaluate the performance of the proposed algorithm, and results show that our proposed asymmetric spectrum allocation algorithm can improve the resource waste and reduce blocking probability.
2010-03-01
in a pyramid style, as shown in Table 6. The pyramid style gradually introduces complexity into the process and identifies learning effects by later...Corps BUMED Bethesda, Maryland 4. Captain Pamela Giza , NC, USN Deputy Director, Navy Nurse Corps BUMED Bethesda, Maryland 5. Captain Regina
Rethinking Traffic Management: Design of Optimizable Networks
2008-06-01
Though this paper used optimization theory to design and analyze DaVinci , op- timization theory is one of many possible tools to enable a grounded...dynamically allocate bandwidth shares. The distributed protocols can be implemented using DaVinci : Dynamically Adaptive VIrtual Networks for a Customized...Internet. In DaVinci , each virtual network runs traffic-management protocols optimized for a traffic class, and link bandwidth is dynamically allocated
Intelligent bandwith compression
NASA Astrophysics Data System (ADS)
Tseng, D. Y.; Bullock, B. L.; Olin, K. E.; Kandt, R. K.; Olsen, J. D.
1980-02-01
The feasibility of a 1000:1 bandwidth compression ratio for image transmission has been demonstrated using image-analysis algorithms and a rule-based controller. Such a high compression ratio was achieved by first analyzing scene content using auto-cueing and feature-extraction algorithms, and then transmitting only the pertinent information consistent with mission requirements. A rule-based controller directs the flow of analysis and performs priority allocations on the extracted scene content. The reconstructed bandwidth-compressed image consists of an edge map of the scene background, with primary and secondary target windows embedded in the edge map. The bandwidth-compressed images are updated at a basic rate of 1 frame per second, with the high-priority target window updated at 7.5 frames per second. The scene-analysis algorithms used in this system together with the adaptive priority controller are described. Results of simulated 1000:1 band width-compressed images are presented. A video tape simulation of the Intelligent Bandwidth Compression system has been produced using a sequence of video input from the data base.
NASA Astrophysics Data System (ADS)
Pleros, N.; Kalfas, G.; Mitsolidou, C.; Vagionas, C.; Tsiokos, D.; Miliou, A.
2017-01-01
Future broadband access networks in the 5G framework will need to be bilateral, exploiting both optical and wireless technologies. This paper deals with new approaches and synergies on radio-over-fiber (RoF) technologies and how those can be leveraged to seamlessly converge wireless technology for agility and mobility with passive optical networks (PON)-based backhauling. The proposed convergence paradigm is based upon a holistic network architecture mixing mm-wave wireless access with photonic integration, dynamic capacity allocation and network coding schemes to enable high bandwidth and low-latency fixed and 60GHz wireless personal area communications for gigabit rate per user, proposing and deploying on top a Medium-Transparent MAC (MT-MAC) protocol as a low-latency bandwidth allocation mechanism. We have evaluated alternative network topologies between the central office (CO) and the access point module (APM) for data rates up to 2.5 Gb/s and SC frequencies up to 60 GHz. Optical network coding is demonstrated for SCM-based signaling to enhance bandwidth utilization and facilitate optical-wireless convergence in 5G applications, reporting medium-transparent network coding directly at the physical layer between end-users communicating over a RoF infrastructure. Towards equipping the physical layer with the appropriate agility to support MT-MAC protocols, a monolithic InP-based Remote Antenna Unit optoelectronic PIC interface is shown that ensures control over the optical resource allocation assisting at the same time broadband wireless service. Finally, the MT-MAC protocol is analysed and simulation and analytical theoretical results are presented that are found to be in good agreement confirming latency values lower than 1msec for small- to mid-load conditions.
Design and Promotion Strategy of Marketing Platform of Aquatic Auction based on Internet
NASA Astrophysics Data System (ADS)
Peng, Jianliang
For the online trade and promotion of aquatic products and related materials through the network between supply and demand, the design content and effective promotional strategies of aquatic auctions online marketing platform is proposed in this paper. Design elements involve the location of customer service, the basic function of the platform including the purchase of general orders, online auctions, information dissemination, and recommendation of fine products, human services, and payment preferences. Based on network and mobile e-commerce transaction support, the auction platform makes the transaction of aquatic products well in advance. The results are important practical value for the design and application of online marketing platform of aquatic auction.
Auctions vs negotiations: a study of price differentials.
Kjerstad, Egil
2005-12-01
Recent contributions in auction and bargaining theory suggest that a procurer should place more faith in the power of competition among alternative suppliers than in his or her own negotiating skill. Based on data from 216 contracts between procurers and suppliers of medical and surgical articles, we test whether auctions and bargaining result in significantly different prices. The main results are that auctions give 'thicker' markets compared with negotiations, as expected, but that auctions do not result in significantly lower prices compared with negotiations. Copyright (c) 2005 John Wiley & Sons, Ltd.
Khalumba, Mercelyne; Wünscher, Tobias; Wunder, Sven; Büdenbender, Mirjam; Holm-Müller, Karin
2014-06-01
Cost-effectiveness is an important aspect in the assessment of payments for environmental services (PES) initiatives. In participatory field trials with communities in Western Kenya, we combined procurement auctions for forest enrichment contracts with performance-based payments and compared the outcomes with a baseline scenario currently used by the Kenyan Forest Service. Procurement auctions were the most cost-effective. The competitive nature of the auction reduced contracting expenses (provision costs), and the result-oriented payments provided additional incentives to care for the planted seedlings, resulting in their improved survival rates (service quantity). These gains clearly exceeded increases in transaction costs associated with conducting an auction. The number of income-poor auction participants and winners was disproportionately high and local institutional buy-in was remarkably strong. Our participatory approach may, however, require adaptations when conducted at a larger scale. Although the number of contracts we monitored was limited and prohibited the use of statistical tests, our study is one of the first to reveal the benefits of using auctions for PES in developing countries. © 2014 Society for Conservation Biology.
2010-03-01
MILITARY COMPENSATION .....................7 1. Basic Pay and Allowances ......................8 2. Other Monetary and Non-Monetary Benefits ......9...3. Deferred Benefits ............................10 4. Special Pays and Bonuses .....................10 C. THE SRB PROGRAM (MARINE CORPS...or flexible benefits packages, to military personnel. Much of the thesis builds on this prior research. Chapter II provides an overview of
Network Enabled Operations: The Experiences of Senior Canadian Commanders
2006-03-31
d’opérations par réseaux dans ce pays, qu’il n’y a pas de solution universelle car, selon les commandants interrogés, les besoins en réseaux...was provide by Lerhe who said that the commander must understand his communications systems sufficiently to appreciate the allocation of bandwidth...alter bandwidth allocation as he moves from the operational theatre (at sea) to port and vice versa. More specifically, this officer felt that a task
NASA Astrophysics Data System (ADS)
Dormady, Noah Christopher
QoS support over ultrafast TDM optical networks
NASA Astrophysics Data System (ADS)
Narvaez, Paolo; Siu, Kai-Yeung; Finn, Steven G.
1999-08-01
HLAN is a promising architecture to realize Tb/s access networks based on ultra-fast optical TDM technologies. This paper presents new research results on efficient algorithms for the support of quality of service over the HLAN network architecture. In particular, we propose a new scheduling algorithm that emulates fair queuing in a distributed manner for bandwidth allocation purpose. The proposed scheduler collects information on the queue of each host on the network and then instructs each host how much data to send. Our new scheduling algorithm ensures full bandwidth utilization, while guaranteeing fairness among all hosts.
Terahertz wireless communications based on photonics technologies.
Nagatsuma, Tadao; Horiguchi, Shogo; Minamikata, Yusuke; Yoshimizu, Yasuyuki; Hisatake, Shintaro; Kuwano, Shigeru; Yoshimoto, Naoto; Terada, Jun; Takahashi, Hiroyuki
2013-10-07
There has been an increasing interest in the application of terahertz (THz) waves to broadband wireless communications. In particular, use of frequencies above 275 GHz is one of the strong concerns among radio scientists and engineers, because these frequency bands have not yet been allocated at specific active services, and there is a possibility to employ extremely large bandwidths for ultra-broadband wireless communications. Introduction of photonics technologies for signal generation, modulation and detection is effective not only to enhance the bandwidth and/or the data rate, but also to combine fiber-optic (wired) and wireless networks. This paper reviews recent progress in THz wireless communications using telecom-based photonics technologies towards 100 Gbit/s.
Using Economic Incentives to Manage Stormwater Runoff in ...
Communities nationwide are facing increased responsibility for controlling stormwater runoff, and, subsequently, rising costs of stormwater management. In this report we describe and test a methodology that can be used by communities to focus limited budgets on the most efficient and ecologically-effective installation of stormwater management practices. The overall project has two primary objectives: (1) to test the use of an auction to cost-effectively allocate stormwater management practices among landowners, and (2) to determine the effectiveness of the resulting implementation in terms of hydrological, water quality, and ecological measures. Here, we describe the theories, methods, and criteria used to distribute rain gardens and rain barrels to homeowners in a small, midwestern watershed. The first round of the reverse auction in 2007 resulted in 50 rain gardens and 100 rain barrels installed at 67 of the approximately 350 residential properties in the experimental watershed. In 2008, the auction was repeated and we accepted bids for an additional 35 rain gardens and 74 rain barrels. Stormwater management practices were distributed relatively evenly throughout the watershed and are expected to result in significant improvements in stream quality. We describe our monitoring approach, including 1) parcel-scale hydrology and water quality monitoring of selected rain gardens, and 2) stream monitoring following before-after-control-impact approach for as
Peng, Yu-Shu; Jan, Lih-Tsyr
2009-10-01
Over the past decade, electronic markets based on the Internet, particularly online auctions, have become popular venues for conducting business. Previous studies often focused on the construction of the best bidding model, while few studies have tried to integrate multiple pricing strategies to predict the probability of closing an auction and the price premium. This study constructs a mediated model to examine the relationship among pricing strategies, the strength of bidding intentions, and online auction performance. The sample consists of 1,055 auctions of iPod MP3 players from eBay Web sites in Hong Kong, Singapore, Belgium, and France. Empirical results show that the pricing strategies directly influence both the probability of closing an auction and the level of price premium. The pricing strategies also indirectly influence the price premium through the mediating effect of the strength of bidding intentions.
A Classroom Auction with Externalities: Applied to Mergers and Acquisitions
ERIC Educational Resources Information Center
Meister, J. Patrick; Anderson, Kyle J.
2007-01-01
The authors describe an in-class exercise in which students participate in an auction to buy US Airways. The exercise is based on events of late 1995, in which neither United nor American Airlines decided to bid for US Airways. Two teams of students participate in an English auction. Students learn that the equilibrium of the sequential game is…
Code of Federal Regulations, 2012 CFR
2012-07-01
...—Allowance Schedule for Auctions Year of purchase Spot auction Advance auction Advance auction* 1993 50,000 a... for therein. (b) Timing of the auctions. The spot auction and the advance auction will be held on the... Administrator will conduct one spot auction and one advance auction in each calendar year. (c) Submittal for...
Code of Federal Regulations, 2010 CFR
2010-07-01
...—Allowance Schedule for Auctions Year of purchase Spot auction Advance auction Advance auction* 1993 50,000 a... for therein. (b) Timing of the auctions. The spot auction and the advance auction will be held on the... Administrator will conduct one spot auction and one advance auction in each calendar year. (c) Submittal for...
Code of Federal Regulations, 2013 CFR
2013-07-01
...—Allowance Schedule for Auctions Year of purchase Spot auction Advance auction Advance auction* 1993 50,000 a... for therein. (b) Timing of the auctions. The spot auction and the advance auction will be held on the... Administrator will conduct one spot auction and one advance auction in each calendar year. (c) Submittal for...
Code of Federal Regulations, 2011 CFR
2011-07-01
...—Allowance Schedule for Auctions Year of purchase Spot auction Advance auction Advance auction* 1993 50,000 a... for therein. (b) Timing of the auctions. The spot auction and the advance auction will be held on the... Administrator will conduct one spot auction and one advance auction in each calendar year. (c) Submittal for...
Code of Federal Regulations, 2014 CFR
2014-07-01
...—Allowance Schedule for Auctions Year of purchase Spot auction Advance auction Advance auction* 1993 50,000 a... for therein. (b) Timing of the auctions. The spot auction and the advance auction will be held on the... Administrator will conduct one spot auction and one advance auction in each calendar year. (c) Submittal for...
Flexible power and bandwidth allocation in mobile satellites
NASA Astrophysics Data System (ADS)
Keyes, L. A.
The introduction of L-band mobile communication services by spot beam satellites creates a payload design challenge due to uncertainty in the location and size of the new market to be served. A combination of payload technologies that allow a flexible allocation of power and bandwidth to any portion of the coverage area is described. Power flexibility is achieved by a novel combination of a low-level beam-forming network and a matrix power module which ensures equal sharing of power among individual amplifiers. This eliminates the loss of efficiency and increased mass when an amplifier associated with a beam must be over-designed to meet uncertainties in power distribution between beams. Flexibility in allocation of bandwidth to beams is achieved by intermediate frequency subdivision of the L-band service categories defined by ITU. These spectral subdivisions are assigned to beams by an IF interconnect matrix having beam ports and filter ports as inputs and outputs, respectively. Two such filter switch matrices are required, one for the inbound L-band to feeder link transponder, and one for the outbound feeder link to L-band transponder.
Federal Register 2010, 2011, 2012, 2013, 2014
2013-04-10
... unit is the basic unit that will be used to determine the winners in Auction 902 and to measure... Bureaus will measure coverage based on population rather than road miles. Under the auction design options...: EV-DO, EV-DO Rev A, UMTS/HSPA, HSPA+, WiMAX, and LTE. If the Mosaik data did not show such coverage...
DOE Office of Scientific and Technical Information (OSTI.GOV)
Rey, D.; Ryan, W.; Ross, M.
A method for more efficiently utilizing the frequency bandwidth allocated for data transmission is presented. Current space and range communication systems use modulation and coding schemes that transmit 0.5 to 1.0 bits per second per Hertz of radio frequency bandwidth. The goal in this LDRD project is to increase the bandwidth utilization by employing advanced digital communications techniques. This is done with little or no increase in the transmit power which is usually very limited on airborne systems. Teaming with New Mexico State University, an implementation of trellis coded modulation (TCM), a coding and modulation scheme pioneered by Ungerboeck, wasmore » developed for this application and simulated on a computer. TCM provides a means for reliably transmitting data while simultaneously increasing bandwidth efficiency. The penalty is increased receiver complexity. In particular, the trellis decoder requires high-speed, application-specific digital signal processing (DSP) chips. A system solution based on the QualComm Viterbi decoder and the Graychip DSP receiver chips is presented.« less
NASA Astrophysics Data System (ADS)
Zhang, Hao; Chen, Minghua; Parekh, Abhay; Ramchandran, Kannan
2011-09-01
We design a distributed multi-channel P2P Video-on-Demand (VoD) system using "plug-and-play" helpers. Helpers are heterogenous "micro-servers" with limited storage, bandwidth and number of users they can serve simultaneously. Our proposed system has the following salient features: (1) it jointly optimizes over helper-user connection topology, video storage distribution and transmission bandwidth allocation; (2) it minimizes server load, and is adaptable to varying supply and demand patterns across multiple video channels irrespective of video popularity; and (3) it is fully distributed and requires little or no maintenance overhead. The combinatorial nature of the problem and the system demand for distributed algorithms makes the problem uniquely challenging. By utilizing Lagrangian decomposition and Markov chain approximation based arguments, we address this challenge by designing two distributed algorithms running in tandem: a primal-dual storage and bandwidth allocation algorithm and a "soft-worst-neighbor-choking" topology-building algorithm. Our scheme provably converges to a near-optimal solution, and is easy to implement in practice. Packet-level simulation results show that the proposed scheme achieves minimum sever load under highly heterogeneous combinations of supply and demand patterns, and is robust to system dynamics of user/helper churn, user/helper asynchrony, and random delays in the network.
Analysis of Online DBA Algorithm with Adaptive Sleep Cycle in WDM EPON
NASA Astrophysics Data System (ADS)
Pajčin, Bojan; Matavulj, Petar; Radivojević, Mirjana
2018-05-01
In order to manage Quality of Service (QoS) and energy efficiency in the optical access network, an online Dynamic Bandwidth Allocation (DBA) algorithm with adaptive sleep cycle is presented. This DBA algorithm has the ability to allocate an additional bandwidth to the end user within a single sleep cycle whose duration changes depending on the current buffers occupancy. The purpose of this DBA algorithm is to tune the duration of the sleep cycle depending on the network load in order to provide service to the end user without violating strict QoS requests in all network operating conditions.
Blocking performance approximation in flexi-grid networks
NASA Astrophysics Data System (ADS)
Ge, Fei; Tan, Liansheng
2016-12-01
The blocking probability to the path requests is an important issue in flexible bandwidth optical communications. In this paper, we propose a blocking probability approximation method of path requests in flexi-grid networks. It models the bundled neighboring carrier allocation with a group of birth-death processes and provides a theoretical analysis to the blocking probability under variable bandwidth traffic. The numerical results show the effect of traffic parameters to the blocking probability of path requests. We use the first fit algorithm in network nodes to allocate neighboring carriers to path requests in simulations, and verify approximation results.
Bandwidth, Broadband, and Planning for Public Access
ERIC Educational Resources Information Center
Blowers, Helene
2012-01-01
Broadband and bandwidth allocation is an essential technology planning activity that libraries should address on a continual basis. There are five key factors that will impact your network's performance: 1. infrastructure, 2. network load, 3. workstation performance, 4. prioritization of services, and 5. network management. The author thinks it's…
Predictive Cache Modeling and Analysis
2011-11-01
metaheuristic /bin-packing algorithm to optimize task placement based on task communication characterization. Our previous work on task allocation showed...Cache Miss Minimization Technology To efficiently explore combinations and discover nearly-optimal task-assignment algorithms , we extended to our...it was possible to use our algorithmic techniques to decrease network bandwidth consumption by ~25%. In this effort, we adapted these existing
Multi-Robot Coalitions Formation with Deadlines: Complexity Analysis and Solutions
2017-01-01
Multi-robot task allocation is one of the main problems to address in order to design a multi-robot system, very especially when robots form coalitions that must carry out tasks before a deadline. A lot of factors affect the performance of these systems and among them, this paper is focused on the physical interference effect, produced when two or more robots want to access the same point simultaneously. To our best knowledge, this paper presents the first formal description of multi-robot task allocation that includes a model of interference. Thanks to this description, the complexity of the allocation problem is analyzed. Moreover, the main contribution of this paper is to provide the conditions under which the optimal solution of the aforementioned allocation problem can be obtained solving an integer linear problem. The optimal results are compared to previous allocation algorithms already proposed by the first two authors of this paper and with a new method proposed in this paper. The results obtained show how the new task allocation algorithms reach up more than an 80% of the median of the optimal solution, outperforming previous auction algorithms with a huge reduction of the execution time. PMID:28118384
Multi-Robot Coalitions Formation with Deadlines: Complexity Analysis and Solutions.
Guerrero, Jose; Oliver, Gabriel; Valero, Oscar
2017-01-01
Multi-robot task allocation is one of the main problems to address in order to design a multi-robot system, very especially when robots form coalitions that must carry out tasks before a deadline. A lot of factors affect the performance of these systems and among them, this paper is focused on the physical interference effect, produced when two or more robots want to access the same point simultaneously. To our best knowledge, this paper presents the first formal description of multi-robot task allocation that includes a model of interference. Thanks to this description, the complexity of the allocation problem is analyzed. Moreover, the main contribution of this paper is to provide the conditions under which the optimal solution of the aforementioned allocation problem can be obtained solving an integer linear problem. The optimal results are compared to previous allocation algorithms already proposed by the first two authors of this paper and with a new method proposed in this paper. The results obtained show how the new task allocation algorithms reach up more than an 80% of the median of the optimal solution, outperforming previous auction algorithms with a huge reduction of the execution time.
NASA Technical Reports Server (NTRS)
Peach, Robert; Malarky, Alastair
1990-01-01
Currently proposed mobile satellite communications systems require a high degree of flexibility in assignment of spectral capacity to different geographic locations. Conventionally this results in poor spectral efficiency which may be overcome by the use of bandwidth switchable filtering. Surface acoustic wave (SAW) technology makes it possible to provide banks of filters whose responses may be contiguously combined to form variable bandwidth filters with constant amplitude and phase responses across the entire band. The high selectivity possible with SAW filters, combined with the variable bandwidth capability, makes it possible to achieve spectral efficiencies over the allocated bandwidths of greater than 90 percent, while retaining full system flexibility. Bandwidth switchable SAW filtering (BSSF) achieves these gains with a negligible increase in hardware complexity.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Chassin, David P.; Posse, Christian; Malard, Joel M.
2004-08-01
Physical analogs have shown considerable promise for understanding the behavior of complex adaptive systems, including macroeconomics, biological systems, social networks, and electric power markets. Many of today’s most challenging technical and policy questions can be reduced to a distributed economic control problem. Indeed, economically-based control of large-scale systems is founded on the conjecture that the price-based regulation (e.g., auctions, markets) results in an optimal allocation of resources and emergent optimal system control. This paper explores the state of the art in the use physical analogs for understanding the behavior of some econophysical systems and to deriving stable and robust controlmore » strategies for them. In particular we review and discussion applications of some analytic methods based on the thermodynamic metaphor according to which the interplay between system entropy and conservation laws gives rise to intuitive and governing global properties of complex systems that cannot be otherwise understood.« less
An economic and feasible Quantum Sealed-bid Auction protocol
NASA Astrophysics Data System (ADS)
Zhang, Rui; Shi, Run-hua; Qin, Jia-qi; Peng, Zhen-wan
2018-02-01
We present an economic and feasible Quantum Sealed-bid Auction protocol using quantum secure direct communication based on single photons in both the polarization and the spatial-mode degrees of freedom, where each single photon can carry two bits of classical information. Compared with previous protocols, our protocol has higher efficiency. In addition, we propose a secure post-confirmation mechanism without quantum entanglement to guarantee the security and the fairness of the auction.
A Study on Partnering Mechanism in B to B EC Server for Global Supply Chain Management
NASA Astrophysics Data System (ADS)
Kaihara, Toshiya
B to B Electronic Commerce (EC) technology is now in progress and regarded as an information infrastructure for global business. As the number and diversity of EC participants grows at the agile environment, the complexity of purchasing from a vast and dynamic array of goods and services needs to be hidden from the end user. Putting the complexity into the EC system instead means providing flexible auction server for enabling commerce within different business units. Market mechanism could solve the product distribution problem in the auction server by allocating the scheduled resources according to market prices. In this paper, we propose a partnering mechanism for B to B EC with market-oriented programming that mediates amongst unspecified various companies in the trade, and demonstrate the applicability of the economic analysis to this framework after constructing a primitive EC server. The proposed mechanism facilitates sophisticated B to B EC, which conducts a Pareto optimal solution for all the participating business units in the coming agile era.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Hameed, Abdul; Khoshkbarforoushha, Alireza; Ranjan, Rajiv
In a cloud computing paradigm, energy efficient allocation of different virtualized ICT resources (servers, storage disks, and networks, and the like) is a complex problem due to the presence of heterogeneous application (e.g., content delivery networks, MapReduce, web applications, and the like) workloads having contentious allocation requirements in terms of ICT resource capacities (e.g., network bandwidth, processing speed, response time, etc.). Several recent papers have tried to address the issue of improving energy efficiency in allocating cloud resources to applications with varying degree of success. However, to the best of our knowledge there is no published literature on this subjectmore » that clearly articulates the research problem and provides research taxonomy for succinct classification of existing techniques. Hence, the main aim of this paper is to identify open challenges associated with energy efficient resource allocation. In this regard, the study, first, outlines the problem and existing hardware and software-based techniques available for this purpose. Furthermore, available techniques already presented in the literature are summarized based on the energy-efficient research dimension taxonomy. The advantages and disadvantages of the existing techniques are comprehensively analyzed against the proposed research dimension taxonomy namely: resource adaption policy, objective function, allocation method, allocation operation, and interoperability.« less
Cislan-2 extension final document by University of Twente (Netherlands)
NASA Astrophysics Data System (ADS)
Niemegeers, Ignas; Baumann, Frank; Beuwer, Wim; Jordense, Marcel; Pras, Aiko; Schutte, Leon; Tracey, Ian
1992-01-01
Results of worked performed under the so called Cislan extension contract are presented. The adaptation of the Cislan 2 prototype design to an environment of interconnected Local Area Networks (LAN's) instead of a single 802.5 token ring LAN is considered. In order to extend the network architecture, the Interconnection Function (IF) protocol layer was subdivided into two protocol layers: a new IF layer, and below the Medium Enhancement (ME) protocol layer. Some small enhancements to the distributed bandwidth allocation protocol were developed, which in fact are also applicable to the 'normal' Cislan 2 system. The new services and protocols are described together with some scenarios and requirements for the new internetting Cislan 2 system. How to overcome the degradation of the quality of speech due to packet loss on the LAN subsystem was studied. Experiments were planned in order to measure this speech quality degradation. Simulations were performed of two Cislan subsystems, the bandwidth allocation protocol and the clock synchronization mechanism. Results on both simulations, performed on SUN workstations using QNAP as a simulation tool, are given. Results of the simulations of the clock synchronization mechanism, and results of the simulation of the distributed bandwidth allocation protocol are given.
Design and implementation of location-based wireless targeted advertising
NASA Astrophysics Data System (ADS)
Li, Benjamin; Xu, Deyin
2001-10-01
As advertisements are time and location sensitive, a challenge for wireless marketing is to have advertisements delivered when and where they are most convenient. In this paper we introduce a two-stage auction model for location-based wireless targeted advertising. This system extends the notion of location-based service by using location information to target advertising, and does so specifically by enabling advertisers to specify their preferences and bid for advertisement delivery, where those preferences are then used in a subsequent automated auction of actual deliveries to wireless data users. The automated auction in the second stage is especially effective because it can use information about the individual user profile data, including customer relationship management system contents as well as location from the wireless system's location management service, including potentially location history such as current trajectory from recent history and longer-term historical trip records for that user. Through two-stage auction, real-time bidding by advertisers and matching ads contents to mobile users help advertising information reach maximal value.
Bidding Agents That Perpetrate Auction Fraud
NASA Astrophysics Data System (ADS)
Trevathan, Jarrod; McCabe, Alan; Read, Wayne
This paper presents a software bidding agent that inserts fake bids on the seller's behalf to inflate an auction's price. This behaviour is referred to as shill bidding. Shill bidding is strictly prohibited by online auctioneers, as it defrauds unsuspecting buyers by forcing them to pay more for the item. The malicious bidding agent was constructed to aid in developing shill detection techniques. We have previously documented a simple shill bidding agent that incrementally increases the auction price until it reaches the desired profit target, or it becomes too risky to continue bidding. This paper presents an adaptive shill bidding agent which when used over a series of auctions with substitutable items, can revise its strategy based on bidding behaviour in past auctions. The adaptive agent applies a novel prediction technique referred to as the Extremum Consistency (EC) algorithm, to determine the optimal price to aspire for. The EC algorithm has successfully been used in handwritten signature verification for determining the maximum and minimum values in an input stream. The agent's ability to inflate the price has been tested in a simulated marketplace and experimental results are presented.
C4I Community of Interest C2 Roadmap
2015-03-24
QoS -based services – Digital policy-based prioritization – Dynamic bandwidth allocation – Automated network management April 15 Slide 9...Co-Site Mitigation) NC-3 • LPD/LPI Comms NC-4 • Increased Range NC-7 • Increased Loss Tolerance & Recovery NC-7 • Mobile Ad Hoc Networking NC-8...Algorithms and Software • Systems and Processes Networks and Communications • Radios and Apertures • Networks • Information April 15 Slide 8
A survey and taxonomy on energy efficient resource allocation techniques for cloud computing systems
DOE Office of Scientific and Technical Information (OSTI.GOV)
Hameed, Abdul; Khoshkbarforoushha, Alireza; Ranjan, Rajiv
In a cloud computing paradigm, energy efficient allocation of different virtualized ICT resources (servers, storage disks, and networks, and the like) is a complex problem due to the presence of heterogeneous application (e.g., content delivery networks, MapReduce, web applications, and the like) workloads having contentious allocation requirements in terms of ICT resource capacities (e.g., network bandwidth, processing speed, response time, etc.). Several recent papers have tried to address the issue of improving energy efficiency in allocating cloud resources to applications with varying degree of success. However, to the best of our knowledge there is no published literature on this subjectmore » that clearly articulates the research problem and provides research taxonomy for succinct classification of existing techniques. Hence, the main aim of this paper is to identify open challenges associated with energy efficient resource allocation. In this regard, the study, first, outlines the problem and existing hardware and software-based techniques available for this purpose. Furthermore, available techniques already presented in the literature are summarized based on the energy-efficient research dimension taxonomy. The advantages and disadvantages of the existing techniques are comprehensively analyzed against the proposed research dimension taxonomy namely: resource adaption policy, objective function, allocation method, allocation operation, and interoperability.« less
Auction development for the price-based electric power industry
NASA Astrophysics Data System (ADS)
Dekrajangpetch, Somgiat
The restructuring of the electric power industry is to move away from the cost-based monopolistic environment of the past to the priced-based competitive environment. As the electric power industry is restructuring in many places, there are still many problems that need to be solved. The work in this dissertation contributes to solve some of the electric power auction problems. The majority of this work is aimed to help develop good markets. A LaGrangian relaxation (LR) Centralized Daily Commitment Auction (CDCA) has been implemented. It has been shown that the solution might not be optimal nor fair to some generation companies (GENCOs) when identical or similar generating units participate in a LR CDCA based auction. Supporting information for bidding strategies on how to change unit data to enhance the chances of bid acceptance has been developed. The majority of this work is based on Single Period Commodity Auction (SPCA). Alternative structures for the SPCA are outlined. Whether the optimal solution is degenerated is investigated. Good pricing criteria are summarized and the pricing method following good pricing criteria is developed. Electricity is generally considered as a homogeneous product. When availability level is used as additional characteristic to distinct electricity, electricity can be considered a heterogeneous product. The procedure to trade electricity as a heterogeneous product is developed. The SPCA is formulated as a linear program. The basic IPLP algorithm has been extended so that sensitivity analysis can be performed as in the simplex method. Sensitivity analysis is used to determine market reach. Additionally, sensitivity analysis is used in combination with the investigation of historical auction results to provide raw data for power system expansion. Market power is a critical issue in electric power deregulation. Firms with market power have an advantage over other competitor firms in terms of market reach. Various approaches to determine market power and market reach are to be investigated. How firms can acquire additional customers or additional transactions, given the auction results, is to be investigated. Additionally, how firms can utilize their market power to enhance their chances of success is to be investigated.
NASA Astrophysics Data System (ADS)
Chao, I.-Fen; Zhang, Tsung-Min
2015-06-01
Long-reach passive optical networks (LR-PONs) have been considered to be promising solutions for future access networks. In this paper, we propose a distributed medium access control (MAC) scheme over an advantageous LR-PON network architecture that reroutes the control information from and back to all ONUs through an (N + 1) × (N + 1) star coupler (SC) deployed near the ONUs, thereby overwhelming the extremely long propagation delay problem in LR-PONs. In the network, the control slot is designed to contain all bandwidth requirements of all ONUs and is in-band time-division-multiplexed with a number of data slots within a cycle. In the proposed MAC scheme, a novel profit-weight-based dynamic bandwidth allocation (P-DBA) scheme is presented. The algorithm is designed to efficiently and fairly distribute the amount of excess bandwidth based on a profit value derived from the excess bandwidth usage of each ONU, which resolves the problems of previously reported DBA schemes that are either unfair or inefficient. The simulation results show that the proposed decentralized algorithms exhibit a nearly three-order-of-magnitude improvement in delay performance compared to the centralized algorithms over LR-PONs. Moreover, the newly proposed P-DBA scheme guarantees low delay performance and fairness even when under attack by the malevolent ONU irrespective of traffic loads and burstiness.
Theoretically Founded Optimization of Auctioneer's Revenues in Expanding Auctions
NASA Astrophysics Data System (ADS)
Rabin, Jonathan; Shehory, Onn
The expanding auction is a multi-unit auction which provides the auctioneer with control over the outcome of the auction by means of dynamically adding items for sale. Previous research on the expanding auction has provided a numeric method to calculate a strategy that optimizes the auctioneer's revenue. In this paper, we analyze various theoretical properties of the expanding auction, and compare it to VCG, a multi-unit auction protocol known in the art. We examine the effects of errors in the auctioneer's estimation of the buyers' maximal bidding values and prove a theoretical bound on the ratio between the revenue yielded by the Informed Decision Strategy (IDS) and the post-optimal strategy. We also analyze the relationship between the auction step and the optimal revenue and introduce a method of computing this optimizing step. We further compare the revenues yielded by the use of IDS with an expanding auction to those of the VCG mechanism and determine the conditions under which the former outperforms the latter. Our work provides new insight into the properties of the expanding auction. It further provides theoretically founded means for optimizing the revenue of auctioneer.
Federal Register 2010, 2011, 2012, 2013, 2014
2011-01-07
... relating to Auction 92. A. Auction Structure i. Simultaneous Multiple-Round Auction Design 7. The Bureau proposes to auction all licenses included in Auction 92 using the Commission's standard simultaneous... competitiveness and economic efficiency of a simultaneous multiple-round auction may be enhanced if such...
VENI, video, VICI: The merging of computer and video technologies
NASA Technical Reports Server (NTRS)
Horowitz, Jay G.
1993-01-01
The topics covered include the following: High Definition Television (HDTV) milestones; visual information bandwidth; television frequency allocation and bandwidth; horizontal scanning; workstation RGB color domain; NTSC color domain; American HDTV time-table; HDTV image size; digital HDTV hierarchy; task force on digital image architecture; open architecture model; future displays; and the ULTIMATE imaging system.
A Truthful Incentive Mechanism for Online Recruitment in Mobile Crowd Sensing System.
Chen, Xiao; Liu, Min; Zhou, Yaqin; Li, Zhongcheng; Chen, Shuang; He, Xiangnan
2017-01-01
We investigate emerging mobile crowd sensing (MCS) systems, in which new cloud-based platforms sequentially allocate homogenous sensing jobs to dynamically-arriving users with uncertain service qualities. Given that human beings are selfish in nature, it is crucial yet challenging to design an efficient and truthful incentive mechanism to encourage users to participate. To address the challenge, we propose a novel truthful online auction mechanism that can efficiently learn to make irreversible online decisions on winner selections for new MCS systems without requiring previous knowledge of users. Moreover, we theoretically prove that our incentive possesses truthfulness, individual rationality and computational efficiency. Extensive simulation results under both real and synthetic traces demonstrate that our incentive mechanism can reduce the payment of the platform, increase the utility of the platform and social welfare.
Dynamic Resource Allocation for IEEE802.16e
NASA Astrophysics Data System (ADS)
Nascimento, Alberto; Rodriguez, Jonathan
Mobile communications has witnessed an exponential increase in the amount of users, services and applications. New high bandwidth consuming applications are targeted for B3G networks raising more stringent requirements for Dynamic Resource Allocation (DRA) architectures and packet schedulers that must be spectrum efficient and deliver QoS for heterogeneous applications and services. In this paper we propose a new cross layer-based architecture framework embedded in a newly designed DRA architecture for the Mobile WiMAX standard. System level simulation results show that the proposed architecture can be considered a viable candidate solution for supporting mixed services in a cost-effective manner in contrast to existing approaches.
Application for Single Price Auction Model (SPA) in AC Network
NASA Astrophysics Data System (ADS)
Wachi, Tsunehisa; Fukutome, Suguru; Chen, Luonan; Makino, Yoshinori; Koshimizu, Gentarou
This paper aims to develop a single price auction model with AC transmission network, based on the principle of maximizing social surplus of electricity market. Specifically, we first formulate the auction market as a nonlinear optimization problem, which has almost the same form as the conventional optimal power flow problem, and then propose an algorithm to derive both market clearing price and trade volume of each player even for the case of market-splitting. As indicated in the paper, the proposed approach can be used not only for the price evaluation of auction or bidding market but also for analysis of bidding strategy, congestion effect and other constraints or factors. Several numerical examples are used to demonstrate effectiveness of our method.
NASA Astrophysics Data System (ADS)
Wulansari, Dwi Ratna; Sutopo, Wahyudi; Hisjam, Muh.
2018-02-01
The empowering auction market for commodities in East Java Province is one of five auction market revitalization programs conducted by the Republic of Indonesia c.q. Ministry of Trading started in 2014. One of the districts in East Java Province, namely Magetan District utilizes the commodity auction market to improve the competitiveness of their agricultural industry by shortening the supply chain. The Magetan District needs to evaluate their support for farmers or farmer groups to participate in the forward auction market (FAM). Implementation of the FAM commodities is divided into three main processes, namely pre-auction, auction, and post-auction. The auction market is organized to shorten the trading chain. Implementation of the FAM requires good planning, among Seller (namely Farmer or Farmer Group), organizer of Auction (namely Commodity Auction Company), Buyer, and Local Government (namely the farmer facilitator). This article is aimed to develop the instrument of a Performance Measurement Model Using Important and Performance Analysis (IPA) for Improving the FAM Effectiveness of Agro Commodity from Magetan District with Supply Chain Management approach. IPA is implemented at pre-auction, auction, and post-auction. The IPA model results in the diagram to decide the strategies in improving the FAM effectiveness, and then it can encourage farmers to improve welfare and realize the competitiveness of the auctioneer.
Competitive bidding for health insurance contracts: lessons from the online HMO auctions.
Gupta, Alok; Parente, Stephen T; Sanyal, Pallab
2012-12-01
Healthcare is an important social and economic component of modern society, and the effective use of information technology in this industry is critical to its success. As health insurance premiums continue to rise, competitive bidding may be useful in generating stronger price competition and lower premium costs for employers and possibly, government agencies. In this paper, we assess an endeavor by several Fortune 500 companies to reduce healthcare procurement costs for their employees by having HMOs compete in open electronic auctions. Although the auctions were successful in generating significant cost savings for the companies in the first year, i.e., 1999, they failed to replicate the success and were eventually discontinued after two more years. Over the past decade since the failed auction experiment, effective utilization of information technologies have led to significant advances in the design of complex electronic markets. Using this knowledge, and data from the auctions, we point out several shortcomings of the auction design that, we believe, led to the discontinuation of the market after three years. Based on our analysis, we propose several actionable recommendations that policy makers can use to design a sustainable electronic market for procuring health insurance.
Huxley, Angie K; Finnegan, Michael
2004-01-01
Internet auction sites have become increasingly popular, with diverse items up for sale to the public worldwide. The purposes of this paper are to inform the forensic community that human skeletal remains, old and new, are for sale on the eBay internet auction site, and to advise forensic scientists that eBay does not use a forensic anthropologist to assess photographs of these materials. Over the last few years, this website was "surfed," with numerous auctions during this period. After contacting eBay by email, representatives responded that they adhere to Native American Grave Protection and Repatriation Act (NAGPRA) and that their website indicates that auctions must state that sale of human remains is for instructional purposes only. Based on the photographs, the remains appear to be of prehistoric and modern origin. An unfortunate consequence of such sale may generate interest in stealing remains from graves, mortuaries, hospitals, or county morgues worldwide.
On Revenue-Optimal Dynamic Auctions for Bidders with Interdependent Values
NASA Astrophysics Data System (ADS)
Constantin, Florin; Parkes, David C.
In a dynamic market, being able to update one's value based on information available to other bidders currently in the market can be critical to having profitable transactions. This is nicely captured by the model of interdependent values (IDV): a bidder's value can explicitly depend on the private information of other bidders. In this paper we present preliminary results about the revenue properties of dynamic auctions for IDV bidders. We adopt a computational approach to design single-item revenue-optimal dynamic auctions with known arrivals and departures but (private) signals that arrive online. In leveraging a characterization of truthful auctions, we present a mixed-integer programming formulation of the design problem. Although a discretization is imposed on bidder signals the solution is a mechanism applicable to continuous signals. The formulation size grows exponentially in the dependence of bidders' values on other bidders' signals. We highlight general properties of revenue-optimal dynamic auctions in a simple parametrized example and study the sensitivity of prices and revenue to model parameters.
31 CFR 356.23 - How are the auction results announced?
Code of Federal Regulations, 2014 CFR
2014-07-01
... 31 Money and Finance: Treasury 2 2014-07-01 2014-07-01 false How are the auction results announced...-93) Determination of Auction Awards; Settlement § 356.23 How are the auction results announced? (a) After the conclusion of the auction, we will announce the auction results through a press release that...
2013-03-30
Abstract: We study multi-robot routing problems (MR- LDR ) where a team of robots has to visit a set of given targets with linear decreasing rewards over...time, such as required for the delivery of goods to rescue sites after disasters. The objective of MR- LDR is to find an assignment of targets to...We develop a mixed integer program that solves MR- LDR optimally with a flow-type formulation and can be solved faster than the standard TSP-type
31 CFR 356.23 - How are the auction results announced?
Code of Federal Regulations, 2013 CFR
2013-07-01
... 31 Money and Finance:Treasury 2 2013-07-01 2013-07-01 false How are the auction results announced...) Determination of Auction Awards; Settlement § 356.23 How are the auction results announced? (a) After the conclusion of the auction, we will announce the auction results through a press release that is available on...
31 CFR 356.23 - How are the auction results announced?
Code of Federal Regulations, 2011 CFR
2011-07-01
... 31 Money and Finance:Treasury 2 2011-07-01 2011-07-01 false How are the auction results announced...) Determination of Auction Awards; Settlement § 356.23 How are the auction results announced? (a) After the conclusion of the auction, we will announce the auction results through a press release that is available on...
31 CFR 356.23 - How are the auction results announced?
Code of Federal Regulations, 2010 CFR
2010-07-01
... 31 Money and Finance: Treasury 2 2010-07-01 2010-07-01 false How are the auction results announced...) Determination of Auction Awards; Settlement § 356.23 How are the auction results announced? (a) After the conclusion of the auction, we will announce the auction results through a press release that is available on...
Federal Register 2010, 2011, 2012, 2013, 2014
2013-12-02
... Broadcast Construction Permits Scheduled for May 6, 2014; Comment Sought on Competitive Bidding Procedures... announces the auction of certain AM broadcast construction permits. Auction 84 will be a ``closed'' auction..., New York. II. Construction Permits In Auction 84 2. The Bureaus will proceed to auction for 22 new...
Tailoring Configuration to User’s Tasks under Uncertainty
2008-04-28
CARISMA is the problem being solved. CARISMA applies microeconom- ics and game theory to make runtime decisions about allocating scarce resources among...scarce resources, these applications are running on be- half of one user. Thus, our problem has no game theoretic aspects. 2.2 Task Oriented...prediction tool [15] is based on the RPS tool and allows prediction of bandwidth online . There is additional evidence (see, for example [49
Bandwidth Allocation to Interactive Users in DBS-Based Hybrid Internet
1998-01-01
policies 12 3.1 Framework for queuing analysis: ON/OFF source traffic model . 13 3.2 Service quality . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14...minimizing the queuing delay. In consequence, we were interested in ob- taining improvements in the service quality , as perceived by the users. A...the service quality as per- ceived by users. The merit of this approach, first introduced in [8], is the ability to capture the characteristics of the
Federal Register 2010, 2011, 2012, 2013, 2014
2013-07-29
... issues relating to the conduct of Auction 96. A. Auction Design i. Simultaneous Multiple-Round Auction--With or Without Package Bidding 14. The Bureau proposes to conduct Auction 96 using a simultaneous... incorporate provisions for a simple form of package bidding into the simultaneous multiple-round auction. In...
47 CFR 90.265 - Assignment and use of frequencies in the bands allocated for Federal use.
Code of Federal Regulations, 2010 CFR
2010-10-01
... bandwidth greater than 11.25 kHz until January 1, 2013. Such operations are limited by paragraphs (a)(6) and..., 2013, subject to the requirements of paragraphs (a)(6) and (a)(7) of this section. (b) The following..., 2005, and January 1, 2013, existing systems with an authorized bandwidth of greater than 11.25 kHz...
47 CFR 90.265 - Assignment and use of frequencies in the bands allocated for Federal use.
Code of Federal Regulations, 2011 CFR
2011-10-01
... bandwidth greater than 11.25 kHz until January 1, 2013. Such operations are limited by paragraphs (a)(6) and..., 2013, subject to the requirements of paragraphs (a)(6) and (a)(7) of this section. (b) The following..., 2005, and January 1, 2013, existing systems with an authorized bandwidth of greater than 11.25 kHz...
Real-time distributed scheduling algorithm for supporting QoS over WDM networks
NASA Astrophysics Data System (ADS)
Kam, Anthony C.; Siu, Kai-Yeung
1998-10-01
Most existing or proposed WDM networks employ circuit switching, typically with one session having exclusive use of one entire wavelength. Consequently they are not suitable for data applications involving bursty traffic patterns. The MIT AON Consortium has developed an all-optical LAN/MAN testbed which provides time-slotted WDM service and employs fast-tunable transceivers in each optical terminal. In this paper, we explore extensions of this service to achieve fine-grained statistical multiplexing with different virtual circuits time-sharing the wavelengths in a fair manner. In particular, we develop a real-time distributed protocol for best-effort traffic over this time-slotted WDM service with near-optical fairness and throughput characteristics. As an additional design feature, our protocol supports the allocation of guaranteed bandwidths to selected connections. This feature acts as a first step towards supporting integrated services and quality-of-service guarantees over WDM networks. To achieve high throughput, our approach is based on scheduling transmissions, as opposed to collision- based schemes. Our distributed protocol involves one MAN scheduler and several LAN schedulers (one per LAN) in a master-slave arrangement. Because of propagation delays and limits on control channel capacities, all schedulers are designed to work with partial, delayed traffic information. Our distributed protocol is of the `greedy' type to ensure fast execution in real-time in response to dynamic traffic changes. It employs a hybrid form of rate and credit control for resource allocation. We have performed extensive simulations, which show that our protocol allocates resources (transmitters, receivers, wavelengths) fairly with high throughput, and supports bandwidth guarantees.
Autonomous Distributed Congestion Control Scheme in WCDMA Network
NASA Astrophysics Data System (ADS)
Ahmad, Hafiz Farooq; Suguri, Hiroki; Choudhary, Muhammad Qaisar; Hassan, Ammar; Liaqat, Ali; Khan, Muhammad Umer
Wireless technology has become widely popular and an important means of communication. A key issue in delivering wireless services is the problem of congestion which has an adverse impact on the Quality of Service (QoS), especially timeliness. Although a lot of work has been done in the context of RRM (Radio Resource Management), the deliverance of quality service to the end user still remains a challenge. Therefore there is need for a system that provides real-time services to the users through high assurance. We propose an intelligent agent-based approach to guarantee a predefined Service Level Agreement (SLA) with heterogeneous user requirements for appropriate bandwidth allocation in QoS sensitive cellular networks. The proposed system architecture exploits Case Based Reasoning (CBR) technique to handle RRM process of congestion management. The system accomplishes predefined SLA through the use of Retrieval and Adaptation Algorithm based on CBR case library. The proposed intelligent agent architecture gives autonomy to Radio Network Controller (RNC) or Base Station (BS) in accepting, rejecting or buffering a connection request to manage system bandwidth. Instead of simply blocking the connection request as congestion hits the system, different buffering durations are allocated to diverse classes of users based on their SLA. This increases the opportunity of connection establishment and reduces the call blocking rate extensively in changing environment. We carry out simulation of the proposed system that verifies efficient performance for congestion handling. The results also show built-in dynamism of our system to cater for variety of SLA requirements.
Modeling Power Systems as Complex Adaptive Systems
DOE Office of Scientific and Technical Information (OSTI.GOV)
Chassin, David P.; Malard, Joel M.; Posse, Christian
2004-12-30
Physical analogs have shown considerable promise for understanding the behavior of complex adaptive systems, including macroeconomics, biological systems, social networks, and electric power markets. Many of today's most challenging technical and policy questions can be reduced to a distributed economic control problem. Indeed, economically based control of large-scale systems is founded on the conjecture that the price-based regulation (e.g., auctions, markets) results in an optimal allocation of resources and emergent optimal system control. This report explores the state-of-the-art physical analogs for understanding the behavior of some econophysical systems and deriving stable and robust control strategies for using them. We reviewmore » and discuss applications of some analytic methods based on a thermodynamic metaphor, according to which the interplay between system entropy and conservation laws gives rise to intuitive and governing global properties of complex systems that cannot be otherwise understood. We apply these methods to the question of how power markets can be expected to behave under a variety of conditions.« less
China's Land Market Auctions: Evidence of Corruption?
Cai, Hongbin; Henderson, J Vernon; Zhang, Qinghua
2013-01-01
This paper studies the urban land market in China in 2003-2007. In China, all urban land is owned by the state. Leasehold use rights for land for (re)development are sold by city governments and are a key source of city revenue. Leasehold sales are viewed as a major venue for corruption, prompting a number of reforms over the years. Reforms now require all leasehold rights be sold at public auction. There are two main types of auction: regular English auction and an unusual type which we call a "two stage auction". The latter type of auction seems more subject to corruption, and to side deals between potential bidders and the auctioneer. Absent corruption, theory suggests that two stage auctions would most likely maximize sales revenue for properties which are likely to have relatively few bidders, or are "cold", which would suggest negative selection on property unobservables into such auctions. However, if such auctions are more corruptible, that could involve positive selection as city officials divert hotter properties to a more corruptible auction form. The paper finds that, overall, sales prices are lower for two stage auctions, and there is strong evidence of positive selection. The price difference is explained primarily by the fact that two stage auctions typically have just one bidder, or no competition despite the vibrant land market in Chinese cities.
A Truthful Incentive Mechanism for Online Recruitment in Mobile Crowd Sensing System
Chen, Xiao; Liu, Min; Zhou, Yaqin; Li, Zhongcheng; Chen, Shuang; He, Xiangnan
2017-01-01
We investigate emerging mobile crowd sensing (MCS) systems, in which new cloud-based platforms sequentially allocate homogenous sensing jobs to dynamically-arriving users with uncertain service qualities. Given that human beings are selfish in nature, it is crucial yet challenging to design an efficient and truthful incentive mechanism to encourage users to participate. To address the challenge, we propose a novel truthful online auction mechanism that can efficiently learn to make irreversible online decisions on winner selections for new MCS systems without requiring previous knowledge of users. Moreover, we theoretically prove that our incentive possesses truthfulness, individual rationality and computational efficiency. Extensive simulation results under both real and synthetic traces demonstrate that our incentive mechanism can reduce the payment of the platform, increase the utility of the platform and social welfare. PMID:28045441
Economic model for QoS guarantee on the Internet
NASA Astrophysics Data System (ADS)
Zhang, Chi; Wei, Jiaolong
2001-09-01
This paper describes a QoS guarantee architecture suited for best-effort environments, based on ideas from microeconomics and non-cooperative game theory. First, an analytic model is developed for the study of the resource allocation in the Internet. Then we show that with a simple pricing mechanism (from network implementation and users' points-of-view), we were able to provide QoS guarantee at per flow level without resource allocation or complicated scheduling mechanisms or maintaining per flow state in the core network. Unlike the previous work on this area, we extend the basic model to support inelastic applications which require minimum bandwidth guarantees for a given time period by introducing derivative market.
Designing a Successful Bidding Strategy Using Fuzzy Sets and Agent Attitudes
NASA Astrophysics Data System (ADS)
Ma, Jun; Goyal, Madhu Lata
To be successful in a multi-attribute auction, agents must be capable of adapting to continuously changing bidding price. This chapter presents a novel fuzzy attitude-based bidding strategy (FA-Bid), which employs dual assessment technique, i.e., assessment of multiple attributes of the goods as well as assessment of agents' attitude (eagerness) to procure an item in automated auction. The assessment of attributes adapts the fuzzy sets technique to handle uncertainty of the bidding process as well use heuristic rules to determine the attitude of bidding agents in simulated auctions to procure goods. The overall assessment is used to determine a price range based on current bid, which finally selects the best one as the new bid.
Code of Federal Regulations, 2013 CFR
2013-01-01
... 7 Agriculture 2 2013-01-01 2013-01-01 false Auction sales. 46.25 Section 46.25 Agriculture... THAN RULES OF PRACTICE) UNDER THE PERISHABLE AGRICULTURAL COMMODITIES ACT, 1930 Auction Sales § 46.25 Auction sales. Commission merchants, dealers and brokers who offer produce for sale through auction...
Code of Federal Regulations, 2012 CFR
2012-01-01
... 7 Agriculture 2 2012-01-01 2012-01-01 false Auction sales. 46.25 Section 46.25 Agriculture... THAN RULES OF PRACTICE) UNDER THE PERISHABLE AGRICULTURAL COMMODITIES ACT, 1930 Auction Sales § 46.25 Auction sales. Commission merchants, dealers and brokers who offer produce for sale through auction...
Code of Federal Regulations, 2014 CFR
2014-01-01
... 7 Agriculture 2 2014-01-01 2014-01-01 false Auction sales. 46.25 Section 46.25 Agriculture... THAN RULES OF PRACTICE) UNDER THE PERISHABLE AGRICULTURAL COMMODITIES ACT, 1930 Auction Sales § 46.25 Auction sales. Commission merchants, dealers and brokers who offer produce for sale through auction...
Code of Federal Regulations, 2011 CFR
2011-01-01
... 7 Agriculture 2 2011-01-01 2011-01-01 false Auction sales. 46.25 Section 46.25 Agriculture... THAN RULES OF PRACTICE) UNDER THE PERISHABLE AGRICULTURAL COMMODITIES ACT, 1930 Auction Sales § 46.25 Auction sales. Commission merchants, dealers and brokers who offer produce for sale through auction...
29 CFR 780.617 - Adjunct livestock auction operations.
Code of Federal Regulations, 2010 CFR
2010-07-01
... 29 Labor 3 2010-07-01 2010-07-01 false Adjunct livestock auction operations. 780.617 Section 780... Employment in Agriculture and Livestock Auction Operations Under the Section 13(b)(13) Exemption Requirements for Exemption § 780.617 Adjunct livestock auction operations. The livestock auction operations...
Programmable bandwidth management in software-defined EPON architecture
NASA Astrophysics Data System (ADS)
Li, Chengjun; Guo, Wei; Wang, Wei; Hu, Weisheng; Xia, Ming
2016-07-01
This paper proposes a software-defined EPON architecture which replaces the hardware-implemented DBA module with reprogrammable DBA module. The DBA module allows pluggable bandwidth allocation algorithms among multiple ONUs adaptive to traffic profiles and network states. We also introduce a bandwidth management scheme executed at the controller to manage the customized DBA algorithms for all date queues of ONUs. Our performance investigation verifies the effectiveness of this new EPON architecture, and numerical results show that software-defined EPONs can achieve less traffic delay and provide better support to service differentiation in comparison with traditional EPONs.
8-PSK Signaling over non-linear satellite channels
NASA Technical Reports Server (NTRS)
Horan, Sheila B.; Caballero, Ruben B. Eng.
1996-01-01
Space agencies are under pressure to utilize better bandwidth-efficient communication methods due to the actual allocated frequency bands becoming more congested. Also budget reductions is another problem that the space agencies must deal with. This budget constraint results in simpler spacecraft carrying less communication capabilities and also the reduction in staff to capture data in the earth stations. It is then imperative that the most bandwidth efficient communication methods be utilized. This thesis presents a study of 8-ary Phase Shift Keying (8PSK) modulation with respect to bandwidth, power efficiency, spurious emissions and interference susceptibility over a non-linear satellite channel.
Optimal generator bidding strategies for power and ancillary services
NASA Astrophysics Data System (ADS)
Morinec, Allen G.
As the electric power industry transitions to a deregulated market, power transactions are made upon price rather than cost. Generator companies are interested in maximizing their profits rather than overall system efficiency. A method to equitably compensate generation providers for real power, and ancillary services such as reactive power and spinning reserve, will ensure a competitive market with an adequate number of suppliers. Optimizing the generation product mix during bidding is necessary to maximize a generator company's profits. The objective of this research work is to determine and formulate appropriate optimal bidding strategies for a generation company in both the energy and ancillary services markets. These strategies should incorporate the capability curves of their generators as constraints to define the optimal product mix and price offered in the day-ahead and real time spot markets. In order to achieve such a goal, a two-player model was composed to simulate market auctions for power generation. A dynamic game methodology was developed to identify Nash Equilibria and Mixed-Strategy Nash Equilibria solutions as optimal generation bidding strategies for two-player non-cooperative variable-sum matrix games with incomplete information. These games integrated the generation product mix of real power, reactive power, and spinning reserve with the generators's capability curves as constraints. The research includes simulations of market auctions, where strategies were tested for generators with different unit constraints, costs, types of competitors, strategies, and demand levels. Studies on the capability of large hydrogen cooled synchronous generators were utilized to derive useful equations that define the exact shape of the capability curve from the intersections of the arcs defined by the centers and radial vectors of the rotor, stator, and steady-state stability limits. The available reactive reserve and spinning reserve were calculated given a generator operating point in the P-Q plane. Four computer programs were developed to automatically perform the market auction simulations using the equal incremental cost rule. The software calculates the payoffs for the two competing competitors, dispatches six generators, and allocates ancillary services for 64 combinations of bidding strategies, three levels of system demand, and three different types of competitors. Matrix Game theory was utilized to calculate Nash Equilibrium solutions and mixed-strategy Nash solutions as the optimal generator bidding strategies. A method to incorporate ancillary services into the generation bidding strategy, to assure an adequate supply of ancillary services, and to allocate these necessary resources to the on-line units was devised. The optimal generator bid strategy in a power auction was shown to be the Nash Equilibrium solution found in two-player variable-sum matrix games.
Configuration of Wireless Cooperative/Sensor Networks
2008-05-25
WSN), the advantages of cooperation can be further exploited by optimally allocating the energy and bandwidth resources among users based on the... consumption and extend system lifetime [Sin98]. The implementation of a minimum energy routing protocol is discussed in [Dos02a, Dos02b]. An online...power consumption in the network given the required SER at the destination. For example, with source power Ps=20dB, the EP algorithm requires one relay
Federal Register 2010, 2011, 2012, 2013, 2014
2013-11-12
... Broker Dealers and adjust the Tiered Auction Transaction Fees for Initiating Participants based upon... Exchange proposes to increase the existing liquidity fees and credits for certain PIP Transactions within... Transaction \\5\\ fees for Professional Customers and Broker Dealers to $0.37 from $0.35. For Non-Auction...
China’s Land Market Auctions: Evidence of Corruption?
Cai, Hongbin; Henderson, J. Vernon; Zhang, Qinghua
2013-01-01
This paper studies the urban land market in China in 2003—2007. In China, all urban land is owned by the state. Leasehold use rights for land for (re)development are sold by city governments and are a key source of city revenue. Leasehold sales are viewed as a major venue for corruption, prompting a number of reforms over the years. Reforms now require all leasehold rights be sold at public auction. There are two main types of auction: regular English auction and an unusual type which we call a “two stage auction”. The latter type of auction seems more subject to corruption, and to side deals between potential bidders and the auctioneer. Absent corruption, theory suggests that two stage auctions would most likely maximize sales revenue for properties which are likely to have relatively few bidders, or are “cold”, which would suggest negative selection on property unobservables into such auctions. However, if such auctions are more corruptible, that could involve positive selection as city officials divert hotter properties to a more corruptible auction form. The paper finds that, overall, sales prices are lower for two stage auctions, and there is strong evidence of positive selection. The price difference is explained primarily by the fact that two stage auctions typically have just one bidder, or no competition despite the vibrant land market in Chinese cities. PMID:25506125
Energy-efficient routing, modulation and spectrum allocation in elastic optical networks
NASA Astrophysics Data System (ADS)
Tan, Yanxia; Gu, Rentao; Ji, Yuefeng
2017-07-01
With tremendous growth in bandwidth demand, energy consumption problem in elastic optical networks (EONs) becomes a hot topic with wide concern. The sliceable bandwidth-variable transponder in EON, which can transmit/receive multiple optical flows, was recently proposed to improve a transponder's flexibility and save energy. In this paper, energy-efficient routing, modulation and spectrum allocation (EE-RMSA) in EONs with sliceable bandwidth-variable transponder is studied. To decrease the energy consumption, we develop a Mixed Integer Linear Programming (MILP) model with corresponding EE-RMSA algorithm for EONs. The MILP model jointly considers the modulation format and optical grooming in the process of routing and spectrum allocation with the objective of minimizing the energy consumption. With the help of genetic operators, the EE-RMSA algorithm iteratively optimizes the feasible routing path, modulation format and spectrum resources solutions by explore the whole search space. In order to save energy, the optical-layer grooming strategy is designed to transmit the lightpath requests. Finally, simulation results verify that the proposed scheme is able to reduce the energy consumption of the network while maintaining the blocking probability (BP) performance compare with the existing First-Fit-KSP algorithm, Iterative Flipping algorithm and EAMGSP algorithm especially in large network topology. Our results also demonstrate that the proposed EE-RMSA algorithm achieves almost the same performance as MILP on an 8-node network.
9 CFR 11.20 - Responsibilities and liabilities of management.
Code of Federal Regulations, 2011 CFR
2011-01-01
... liabilities of management. (a) The management of any horse show, horse exhibition, or horse sale or auction..., horse exhibition, horse sale, or horse auction. Horses entered for sale or auction at a horse sale or... the sale or auction and prohibited from entering the sale or auction ring. Sore horses or horses...
9 CFR 11.20 - Responsibilities and liabilities of management.
Code of Federal Regulations, 2010 CFR
2010-01-01
... liabilities of management. (a) The management of any horse show, horse exhibition, or horse sale or auction..., horse exhibition, horse sale, or horse auction. Horses entered for sale or auction at a horse sale or... the sale or auction and prohibited from entering the sale or auction ring. Sore horses or horses...
Federal Register 2010, 2011, 2012, 2013, 2014
2010-10-06
... Construction Permits Scheduled for March 29, 2011; Comment Sought on Competitive Bidding Procedures for Auction... auction of certain FM construction permits scheduled to commence on March 29, 2011 (Auction 91). This... Telecommunications and the Media Bureaus (the Bureaus) announce an auction of certain FM Broadcast construction...
Analysis on trust influencing factors and trust model from multiple perspectives of online Auction
NASA Astrophysics Data System (ADS)
Yu, Wang
2017-10-01
Current reputation models lack the research on online auction trading completely so they cannot entirely reflect the reputation status of users and may cause problems on operability. To evaluate the user trust in online auction correctly, a trust computing model based on multiple influencing factors is established. It aims at overcoming the efficiency of current trust computing methods and the limitations of traditional theoretical trust models. The improved model comprehensively considers the trust degree evaluation factors of three types of participants according to different participation modes of online auctioneers, to improve the accuracy, effectiveness and robustness of the trust degree. The experiments test the efficiency and the performance of our model under different scale of malicious user, under environment like eBay and Sporas model. The experimental results analysis show the model proposed in this paper makes up the deficiency of existing model and it also has better feasibility.
Federal Register 2010, 2011, 2012, 2013, 2014
2011-09-30
... Construction Permits Scheduled for March 27, 2012; Comment Sought on Competitive Bidding Procedures for Auction... auction of certain FM broadcast construction permits scheduled to commence on March 27, 2012. This... construction permits and seek comment on the procedures to be used for this auction. This auction is scheduled...
OSLG: A new granting scheme in WDM Ethernet passive optical networks
NASA Astrophysics Data System (ADS)
Razmkhah, Ali; Rahbar, Akbar Ghaffarpour
2011-12-01
Several granting schemes have been proposed to grant transmission window and dynamic bandwidth allocation (DBA) in passive optical networks (PON). Generally, granting schemes suffer from bandwidth wastage of granted windows. Here, we propose a new granting scheme for WDM Ethernet PONs, called optical network unit (ONU) Side Limited Granting (OSLG) that conserves upstream bandwidth, thus resulting in decreasing queuing delay and packet drop ratio. In OSLG instead of optical line terminal (OLT), each ONU determines its transmission window. Two OSLG algorithms are proposed in this paper: the OSLG_GA algorithm that determines the size of its transmission window in such a way that the bandwidth wastage problem is relieved, and the OSLG_SC algorithm that saves unused bandwidth for more bandwidth utilization later on. The OSLG can be used as granting scheme of any DBA to provide better performance in the terms of packet drop ratio and queuing delay. Our performance evaluations show the effectiveness of OSLG in reducing packet drop ratio and queuing delay under different DBA techniques.
32 CFR 644.541 - Award of contract.
Code of Federal Regulations, 2011 CFR
2011-07-01
... auctioneers, are in a position to give other advice and assistance, and may authorize auction sales on behalf... auctioneers. Consideration should be given to auction sales when there is likely to be considerable interest...
The Resource Usage Aware Backfilling
NASA Astrophysics Data System (ADS)
Guim, Francesc; Rodero, Ivan; Corbalan, Julita
Job scheduling policies for HPC centers have been extensively studied in the last few years, especially backfilling based policies. Almost all of these studies have been done using simulation tools. All the existent simulators use the runtime (either estimated or real) provided in the workload as a basis of their simulations. In our previous work we analyzed the impact on system performance of considering the resource sharing (memory bandwidth) of running jobs including a new resource model in the Alvio simulator. Based on this studies we proposed the LessConsume and LessConsume Threshold resource selection policies. Both are oriented to reduce the saturation of the shared resources thus increasing the performance of the system. The results showed how both resource allocation policies shown how the performance of the system can be improved by considering where the jobs are finally allocated.
Smart Computer-Assisted Markets
NASA Astrophysics Data System (ADS)
McCabe, Kevin A.; Rassenti, Stephen J.; Smith, Vernon L.
1991-10-01
The deregulation movement has motivated the experimental study of auction markets designed for interdependent network industries such as natural gas pipelines or electric power systems. Decentralized agents submit bids to buy commodity and offers to sell transportation and commodity to a computerized dispatch center. Computer algorithms determine prices and allocations that maximize the gains from exchange in the system relative to the submitted bids and offers. The problem is important, because traditionally the scale and coordination economies in such industries were thought to require regulation. Laboratory experiments are used to study feasibility, limitations, incentives, and performance of proposed market designs for deregulation, providing motivation for new theory.
1980-04-15
orGrw e NJ 08540 DOT- FA79WA-43741_2P r i n c e t o n . O 0 5 0 v .o .. ., v , o ... pp.. p . e en.Covered12. Sponsoring Aogey Note and Address / Office of...local airport authorities. In April 1979 FAA Administrator Langhorne Bond proposed that the air carrier quota be reduced from 40 to 36 and the...rate, A the face value, N the time to maturity and P the market price of the bond (present value). Then, if only average values are considered (i.e., the
Federal Register 2010, 2011, 2012, 2013, 2014
2013-11-04
...This document announces the procedures, reserve price, and minimum opening bids for the upcoming auction of H Block licenses (Auction 96) and provides the revised schedule for Auction 96. This document is intended to familiarize prospective applicants with the procedures and other requirements for participation in the auction.
Federal Register 2010, 2011, 2012, 2013, 2014
2010-02-25
...: Wireless Telecommunications Bureau, Auctions and Spectrum Access Division: For legal questions: Scott...://wireless.fcc.gov/auctions/87/ . Due to the large number of licenses in Auction 87, the complete list of... ``Attachment A'' files at http://wireless.fcc.gov/auctions/87/ . A paper copy of the complete list of licenses...
Statistical Properties of Online Auctions
NASA Astrophysics Data System (ADS)
Namazi, Alireza; Schadschneider, Andreas
We characterize the statistical properties of a large number of online auctions run on eBay. Both stationary and dynamic properties, like distributions of prices, number of bids etc., as well as relations between these quantities are studied. The analysis of the data reveals surprisingly simple distributions and relations, typically of power-law form. Based on these findings we introduce a simple method to identify suspicious auctions that could be influenced by a form of fraud known as shill bidding. Furthermore the influence of bidding strategies is discussed. The results indicate that the observed behavior is related to a mixture of agents using a variety of strategies.
NASA Astrophysics Data System (ADS)
Lahaie, Sébastien; Parkes, David C.
We consider the problem of fair allocation in the package assignment model, where a set of indivisible items, held by single seller, must be efficiently allocated to agents with quasi-linear utilities. A fair assignment is one that is efficient and envy-free. We consider a model where bidders have superadditive valuations, meaning that items are pure complements. Our central result is that core outcomes are fair and even coalition-fair over this domain, while fair distributions may not even exist for general valuations. Of relevance to auction design, we also establish that the core is equivalent to the set of anonymous-price competitive equilibria, and that superadditive valuations are a maximal domain that guarantees the existence of anonymous-price competitive equilibrium. Our results are analogs of core equivalence results for linear prices in the standard assignment model, and for nonlinear, non-anonymous prices in the package assignment model with general valuations.
Evolutionary Dynamics of Biological Auctions
Chatterjee, Krishnendu; Reiter, Johannes G.; Nowak, Martin A.
2011-01-01
Many scenarios in the living world, where individual organisms compete for winning positions (or resources), have properties of auctions. Here we study the evolution of bids in biological auctions. For each auction n individuals are drawn at random from a population of size N. Each individual makes a bid which entails a cost. The winner obtains a benefit of a certain value. Costs and benefits are translated into reproductive success (fitness). Therefore, successful bidding strategies spread in the population. We compare two types of auctions. In “biological all-pay auctions” the costs are the bid for every participating individual. In “biological second price all-pay auctions” the cost for everyone other than the winner is the bid, but the cost for the winner is the second highest bid. Second price all-pay auctions are generalizations of the “war of attrition” introduced by Maynard Smith. We study evolutionary dynamics in both types of auctions. We calculate pairwise invasion plots and evolutionarily stable distributions over the continuous strategy space. We find that the average bid in second price all-pay auctions is higher than in all-pay auctions, but the average cost for the winner is similar in both auctions. In both cases the average bid is a declining function of the number of participants, n. The more individuals participate in an auction the smaller is the chance of winning, and thus expensive bids must be avoided. PMID:22120126
Jack, B Kelsey; Leimona, Beria; Ferraro, Paul J
2009-04-01
To supply ecosystem services, private landholders incur costs. Knowledge of these costs is critical for the design of conservation-payment programs. Estimating these costs accurately is difficult because the minimum acceptable payment to a potential supplier is private information. We describe how an auction of payment contracts can be designed to elicit this information during the design phase of a conservation-payment program. With an estimate of the ecosystem-service supply curve from a pilot auction, conservation planners can explore the financial, ecological, and socioeconomic consequences of alternative scaled-up programs. We demonstrate the potential of our approach in Indonesia, where soil erosion on coffee farms generates downstream ecological and economic costs. Bid data from a small-scale, uniform-price auction for soil-conservation contracts allowed estimates of the costs of a scaled-up program, the gain from integrating biophysical and economic data to target contracts, and the trade-offs between poverty alleviation and supply of ecosystem services. Our study illustrates an auction-based approach to revealing private information about the costs of supplying ecosystem services. Such information can improve the design of programs devised to protect and enhance ecosystem services.
Software defined multi-OLT passive optical network for flexible traffic allocation
NASA Astrophysics Data System (ADS)
Zhang, Shizong; Gu, Rentao; Ji, Yuefeng; Zhang, Jiawei; Li, Hui
2016-10-01
With the rapid growth of 4G mobile network and vehicular network services mobile terminal users have increasing demand on data sharing among different radio remote units (RRUs) and roadside units (RSUs). Meanwhile, commercial video-streaming, video/voice conference applications delivered through peer-to-peer (P2P) technology are still keep on stimulating the sharp increment of bandwidth demand in both business and residential subscribers. However, a significant issue is that, although wavelength division multiplexing (WDM) and orthogonal frequency division multiplexing (OFDM) technology have been proposed to fulfil the ever-increasing bandwidth demand in access network, the bandwidth of optical fiber is not unlimited due to the restriction of optical component properties and modulation/demodulation technology, and blindly increase the wavelength cannot meet the cost-sensitive characteristic of the access network. In this paper, we propose a software defined multi-OLT PON architecture to support efficient scheduling of access network traffic. By introducing software defined networking technology and wavelength selective switch into TWDM PON system in central office, multiple OLTs can be considered as a bandwidth resource pool and support flexible traffic allocation for optical network units (ONUs). Moreover, under the configuration of the control plane, ONUs have the capability of changing affiliation between different OLTs under different traffic situations, thus the inter-OLT traffic can be localized and the data exchange pressure of the core network can be released. Considering this architecture is designed to be maximum following the TWDM PON specification, the existing optical distribution network (ODN) investment can be saved and conventional EPON/GPON equipment can be compatible with the proposed architecture. What's more, based on this architecture, we propose a dynamic wavelength scheduling algorithm, which can be deployed as an application on control plane and achieve effective scheduling OLT wavelength resources between different OLTs based on various traffic situation. Simulation results show that, by using the scheduling algorithm, network traffic between different OLTs can be optimized effectively, and the wavelength utilization of the multi-OLT system can be improved due to the flexible wavelength scheduling.
Federal Register 2010, 2011, 2012, 2013, 2014
2012-09-17
... FEDERAL COMMUNICATIONS COMMISSION [AU Docket No. 12-25; DA 12-1446] Mobility Fund Phase I Auction... Mobility Fund Phase I support to be offered in Auction 901, which is to be held on September 27, 2012, and the change of the mock auction date from September 25, 2012 to September 21, 2012. DATES: The mock...
The Use of Reverse Auction Within the U.S. Army
2016-12-01
by conducting a literature review on auction theory and the economic principles surrounding open markets and competition. Books, magazine articles...economic principles within auction theory examine buyer and seller motivation. B. AUCTION THEORY Auction theory explains how market participants...that leverage the power of fluid market conditions through a dynamic pricing environment. This project examines the use of RAs within the Army
Federal Register 2010, 2011, 2012, 2013, 2014
2013-11-15
...) announce the rescheduling of Auction 902 and revise the dates and deadlines for the filing window for short...-auction deadlines for Auction 902. 2. The Auction 902 short-form application filing window opened at 12... short-form application (FCC Form 180) filing window will reopen on November 18, 2013, at 12:00 noon ET...
Technologies for network-centric C4ISR
NASA Astrophysics Data System (ADS)
Dunkelberger, Kirk A.
2003-07-01
Three technologies form the heart of any network-centric command, control, communication, intelligence, surveillance, and reconnaissance (C4ISR) system: distributed processing, reconfigurable networking, and distributed resource management. Distributed processing, enabled by automated federation, mobile code, intelligent process allocation, dynamic multiprocessing groups, check pointing, and other capabilities creates a virtual peer-to-peer computing network across the force. Reconfigurable networking, consisting of content-based information exchange, dynamic ad-hoc routing, information operations (perception management) and other component technologies forms the interconnect fabric for fault tolerant inter processor and node communication. Distributed resource management, which provides the means for distributed cooperative sensor management, foe sensor utilization, opportunistic collection, symbiotic inductive/deductive reasoning and other applications provides the canonical algorithms for network-centric enterprises and warfare. This paper introduces these three core technologies and briefly discusses a sampling of their component technologies and their individual contributions to network-centric enterprises and warfare. Based on the implied requirements, two new algorithms are defined and characterized which provide critical building blocks for network centricity: distributed asynchronous auctioning and predictive dynamic source routing. The first provides a reliable, efficient, effective approach for near-optimal assignment problems; the algorithm has been demonstrated to be a viable implementation for ad-hoc command and control, object/sensor pairing, and weapon/target assignment. The second is founded on traditional dynamic source routing (from mobile ad-hoc networking), but leverages the results of ad-hoc command and control (from the contributed auctioning algorithm) into significant increases in connection reliability through forward prediction. Emphasis is placed on the advantages gained from the closed-loop interaction of the multiple technologies in the network-centric application environment.
Resource allocation using ANN in LTE
NASA Astrophysics Data System (ADS)
Yigit, Tuncay; Ersoy, Mevlut
2017-07-01
LTE is the 4th generation wireless network technology, which provides flexible bandwidth, higher data speeds and lower delay. Difficulties may be experienced upon an increase in the number of users in LTE. The objective of this study is to ensure a faster solution to any such resource allocation problems which might arise upon an increase in the number of users. A fast and effective solution has been obtained by making use of Artificial Neural Network. As a result, fast working artificial intelligence methods may be used in resource allocation problems during operation.
Balancing Army and endangered species concerns: Green vs. Green.
McKee, M; Berrens, R P
2001-01-01
A number of endangered, threatened, or at-risk species have been identified on US Army training bases. Before further training is restricted or curtailed under provisions of the US Endangered Species Act (ESA), the Army can explore available proactive options for providing habitat protection and mitigation. This paper investigates the possibility of an Army habitat acquisition program to acquire (by lease or purchase) buffer zones of at-risk species' habitat around its bases and away from training. To identify the most cost-effective manner for acquiring habitat, auction market experiments are utilized for analyzing program design. Laboratory auction experiments provide a powerful and low-cost vehicle for investigating ex ante program design issues. We find the discriminative, as opposed to a uniform price, auction with a minimum quantity requirement to be the least-cost mechanism.
Multiple Power-Saving MSSs Scheduling Methods for IEEE802.16e Broadband Wireless Networks
2014-01-01
This work proposes two enhanced multiple mobile subscriber stations (MSSs) power-saving scheduling methods for IEEE802.16e broadband wireless networks. The proposed methods are designed for the Unsolicited Grant Service (UGS) of IEEE802.16e. To reduce the active periods of all power-saving MSSs, the base station (BS) allocates each MSS fewest possible transmission frames to retrieve its data from the BS. The BS interlaces the active periods of each MSS to increase the amount of scheduled MSSs and splits the overflowing transmission frames to maximize the bandwidth utilization. Simulation results reveal that interlacing the active periods of MSSs can increase the number of scheduled MSSs to more than four times of that in the Direct scheduling method. The bandwidth utilization can thus be improved by 60%–70%. Splitting the overflowing transmission frames can improve bandwidth utilization by more than 10% over that achieved using the method of interlacing active periods, with a sacrifice of only 1% of the sleep periods in the interlacing active period method. PMID:24523656
Rationality, irrationality and escalating behavior in lowest unique bid auctions.
Radicchi, Filippo; Baronchelli, Andrea; Amaral, Luís A N
2012-01-01
Information technology has revolutionized the traditional structure of markets. The removal of geographical and time constraints has fostered the growth of online auction markets, which now include millions of economic agents worldwide and annual transaction volumes in the billions of dollars. Here, we analyze bid histories of a little studied type of online auctions--lowest unique bid auctions. Similarly to what has been reported for foraging animals searching for scarce food, we find that agents adopt Lévy flight search strategies in their exploration of "bid space". The Lévy regime, which is characterized by a power-law decaying probability distribution of step lengths, holds over nearly three orders of magnitude. We develop a quantitative model for lowest unique bid online auctions that reveals that agents use nearly optimal bidding strategies. However, agents participating in these auctions do not optimize their financial gain. Indeed, as long as there are many auction participants, a rational profit optimizing agent would choose not to participate in these auction markets.
Rationality, Irrationality and Escalating Behavior in Lowest Unique Bid Auctions
Radicchi, Filippo; Baronchelli, Andrea; Amaral, Luís A. N.
2012-01-01
Information technology has revolutionized the traditional structure of markets. The removal of geographical and time constraints has fostered the growth of online auction markets, which now include millions of economic agents worldwide and annual transaction volumes in the billions of dollars. Here, we analyze bid histories of a little studied type of online auctions – lowest unique bid auctions. Similarly to what has been reported for foraging animals searching for scarce food, we find that agents adopt Lévy flight search strategies in their exploration of “bid space”. The Lévy regime, which is characterized by a power-law decaying probability distribution of step lengths, holds over nearly three orders of magnitude. We develop a quantitative model for lowest unique bid online auctions that reveals that agents use nearly optimal bidding strategies. However, agents participating in these auctions do not optimize their financial gain. Indeed, as long as there are many auction participants, a rational profit optimizing agent would choose not to participate in these auction markets. PMID:22279553
A new quantum sealed-bid auction protocol with secret order in post-confirmation
NASA Astrophysics Data System (ADS)
Wang, Jing-Tao; Chen, Xiu-Bo; Xu, Gang; Meng, Xiang-Hua; Yang, Yi-Xian
2015-10-01
A new security protocol for quantum sealed-bid auction is proposed to resist the collusion attack from some malicious bidders. The most significant feature of this protocol is that bidders prepare their particles with secret order in post-confirmation for encoding bids. In addition, a new theorem and its proof are given based on the theory of combinatorial mathematics, which can be used as evaluation criteria for the collusion attack. It is shown that the new protocol is immune to the collusion attack and meets the demand for a secure auction. Compared with those previous protocols, the security, efficiency and availability of the proposed protocol are largely improved.
Robust Multi-unit Auction Protocol against False-name Bids
NASA Astrophysics Data System (ADS)
Yokoo, Makoto; Sakurai, Yuko; Matsubara, Shigeo
This paper presents a new multi-unit auction protocol (IR protocol) that is robust against false-name bids. Internet auctions have become an integral part of Electronic Commerce and a promising field for applying agent and Artificial Intelligence technologies. Although the Internet provides an excellent infrastructure for executing auctions, the possibility of a new type of cheating called false-name bids has been pointed out. A false-name bid is a bid submitted under a fictitious name. A protocol called LDS has been developed for combinatorial auctions of multiple different items and has proven to be robust against false-name bids. Although we can modify the LDS protocol to handle multi-unit auctions, in which multiple units of an identical item are auctioned, the protocol is complicated and requires the auctioneer to carefully pre-determine the combination of bundles to obtain a high social surplus or revenue. For the auctioneer, our newly developed IR protocol is easier to use than the LDS, since the combination of bundles is automatically determined in a flexible manner according to the declared evaluation values of agents. The evaluation results show that the IR protocol can obtain a better social surplus than that obtained by the LDS protocol.
7 CFR 1955.148 - Auction sales.
Code of Federal Regulations, 2014 CFR
2014-01-01
... 7 Agriculture 14 2014-01-01 2014-01-01 false Auction sales. 1955.148 Section 1955.148 Agriculture... REGULATIONS (CONTINUED) PROPERTY MANAGEMENT Disposal of Inventory Property General § 1955.148 Auction sales. This section provides guidance on the sale of all inventory property by auction, except FSA real...
7 CFR 1955.148 - Auction sales.
Code of Federal Regulations, 2011 CFR
2011-01-01
... 7 Agriculture 14 2011-01-01 2011-01-01 false Auction sales. 1955.148 Section 1955.148 Agriculture... REGULATIONS (CONTINUED) PROPERTY MANAGEMENT Disposal of Inventory Property General § 1955.148 Auction sales. This section provides guidance on the sale of all inventory property by auction, except FSA real...
7 CFR 1955.148 - Auction sales.
Code of Federal Regulations, 2012 CFR
2012-01-01
... 7 Agriculture 14 2012-01-01 2012-01-01 false Auction sales. 1955.148 Section 1955.148 Agriculture... REGULATIONS (CONTINUED) PROPERTY MANAGEMENT Disposal of Inventory Property General § 1955.148 Auction sales. This section provides guidance on the sale of all inventory property by auction, except FSA real...
7 CFR 1955.148 - Auction sales.
Code of Federal Regulations, 2013 CFR
2013-01-01
... 7 Agriculture 14 2013-01-01 2013-01-01 false Auction sales. 1955.148 Section 1955.148 Agriculture... REGULATIONS (CONTINUED) PROPERTY MANAGEMENT Disposal of Inventory Property General § 1955.148 Auction sales. This section provides guidance on the sale of all inventory property by auction, except FSA real...
7 CFR 1955.148 - Auction sales.
Code of Federal Regulations, 2010 CFR
2010-01-01
... complexity of the sale. When the services of a professional auctioneer are advisable, the services will be... 7 Agriculture 14 2010-01-01 2009-01-01 true Auction sales. 1955.148 Section 1955.148 Agriculture... REGULATIONS (CONTINUED) PROPERTY MANAGEMENT Disposal of Inventory Property General § 1955.148 Auction sales...
Exploring Online Auction Behaviors and Motivations
ERIC Educational Resources Information Center
Jeon, Sua; Crutsinger, Christy; Kim, Haejung
2008-01-01
The availability and convenience of the Internet, combined with the variety of products available at any given time, have contributed to the success of online auctions.This exploratory study examined online auction behaviors among college students in an attempt to identify underlying dimensions of auction motivations. Questionnaires completed by…
NASA Astrophysics Data System (ADS)
Donier, J.; Bouchaud, J.-P.
2016-12-01
In standard Walrasian auctions, the price of a good is defined as the point where the supply and demand curves intersect. Since both curves are generically regular, the response to small perturbations is linearly small. However, a crucial ingredient is absent of the theory, namely transactions themselves. What happens after they occur? To answer the question, we develop a dynamic theory for supply and demand based on agents with heterogeneous beliefs. When the inter-auction time is infinitely long, the Walrasian mechanism is recovered. When transactions are allowed to happen in continuous time, a peculiar property emerges: close to the price, supply and demand vanish quadratically, which we empirically confirm on the Bitcoin. This explains why price impact in financial markets is universally observed to behave as the square root of the excess volume. The consequences are important, as they imply that the very fact of clearing the market makes prices hypersensitive to small fluctuations.
Deng, Xiaohong; Xu, Zhongmin
2015-01-01
Reducing information rents is an important task for government agencies wishing to purchase maximal environmental services with limited budgets. This paper reports on several green auction options for reducing information rents and improving the performance of the "Grain for Green" Payments for environmental services (PES) program implemented in northwestern China. In r experimental auctions and investigations, door-to-door interviews were conducted and bidding envelopes and survey questionnaires were used to determine the offers and the foregone profits of the participants. Three scenarios are analyzed in this paper: a uniform price auction, a discriminatory price auction, and an opportunity-cost system. The results show that compared to the uniform price auction system, the other auction systems can increase the cost-effectiveness of conservation contracting. Competitive bidding can reveal true opportunity costs and can reduce information rents extracted from the government by farmers using private information. The demographics and average bids of these auction types were also analyzed. "Perfect information" in the opportunity-cost offer system has the best performance but is very hard to implement in reality. The results of this research show that the auction is a valuable tool for purchasing conservation contracts in northwestern China, but that in the future, the performance of these auctions should be studied with relaxed model assumptions.
Deng, Xiaohong; Xu, Zhongmin
2015-01-01
Reducing information rents is an important task for government agencies wishing to purchase maximal environmental services with limited budgets. This paper reports on several green auction options for reducing information rents and improving the performance of the “Grain for Green” Payments for environmental services (PES) program implemented in northwestern China. In r experimental auctions and investigations, door-to-door interviews were conducted and bidding envelopes and survey questionnaires were used to determine the offers and the foregone profits of the participants. Three scenarios are analyzed in this paper: a uniform price auction, a discriminatory price auction, and an opportunity-cost system. The results show that compared to the uniform price auction system, the other auction systems can increase the cost-effectiveness of conservation contracting. Competitive bidding can reveal true opportunity costs and can reduce information rents extracted from the government by farmers using private information. The demographics and average bids of these auction types were also analyzed. “Perfect information” in the opportunity-cost offer system has the best performance but is very hard to implement in reality. The results of this research show that the auction is a valuable tool for purchasing conservation contracts in northwestern China, but that in the future, the performance of these auctions should be studied with relaxed model assumptions. PMID:25793263
Peak Satellite-to-Earth Data Rates Derived From Measurements of a 20 Gbps Bread-Board Modem
NASA Technical Reports Server (NTRS)
Landon, David G.; Simons, Rainee N.; Wintucky, Edwin G.; Sun, Jun Y.; Winn, James S.; Laraway, Stephen A.; McIntire, William K.; Metz, John L.; Smith, Francis J.
2011-01-01
A prototype data link using a Ka-band space qualified, high efficiency 200 W TWT amplifier and a bread-board modem emulator were created to explore the feasibility of very high speed communications in satellite-to-earth applications. Experiments were conducted using a DVB-S2-like waveform with modifications to support up to 20 Gbps through the addition of 128-Quadrature Amplitude Modulation (QAM). Limited by the bandwidth of the amplifier, a constant peak symbol rate of 3.2 Giga-symbols/sec was selected and the modulation order was varied to explore what peak data rate might be supported by an RF link through this amplifier. Using 128-QAM, an implementation loss of 3 dB was observed at 20 Gbps, and the loss decreased as data rate or bandwidth were reduced. Building on this measured data, realistic link budget calculations were completed. Low-Earth orbit (LEO) missions based on this TWTA with reasonable hardware assumptions and antenna sizing are found to be bandwidth-limited, rather than power-limited, making the spectral efficiency of 9/10-rate encoded 128-QAM very attractive. Assuming a bandwidth allocation of 1 GHz, these computations indicate that low-Earth orbit vehicles could achieve data rates up to 5 Gbps-an order of magnitude beyond the current state-of-practice, yet still within the processing power of a current FPGA-based software-defined modem. The measured performance results and a description of the experimental setup are presented to support these conclusions.
Internet Auction Sellers: Does Size Really Matter?
ERIC Educational Resources Information Center
Halstead, Diane; Becherer, Richard C.
2003-01-01
Examines the Internet auction phenomenon as it relates to the marketing mix of online auction sellers. The data indicate that, while there is great diversity among businesses that utilize online auctions, distinct cost leadership and differentiation marketing strategies are both evident. These two approaches are further distinguished in terms of…
Federal Register 2010, 2011, 2012, 2013, 2014
2011-12-29
... Construction Permits; Revised Construction Permit Number in Auction 93 AGENCY: Federal Communications Commission. ACTION: Notice. SUMMARY: This document announces a change to the construction permit number for one of the FM broadcast construction permits for Auction 93. FOR FURTHER INFORMATION CONTACT: Linda...
Competencies Needed by Livestock Sale Barn Employees.
ERIC Educational Resources Information Center
Reidel, Wallace Franklin, Jr.
To determine the competencies needed by managers, assistant managers, and auctioneers in the livestock auction sale business and to determine the implications for educational programs, a questionnaire of 20 competencies compiled from a survey of livestock auction businesses was sent to every livestock auction sale barn listed with the Iowa…
Auctioneering Training Certificate Program 93-1001. Final Report.
ERIC Educational Resources Information Center
Clark, Charles H.
A project was conducted to prepare a catalog of duties and tasks, performance objectives and guides, and instructional materials that would enable schools to develop instructional programs designed to prepare persons to enter the career of auctioneering. An occupational survey of auctioneers was conducted; a writing team of auctioneers prepared…
Zhao, Yongli; Chen, Zhendong; Zhang, Jie; Wang, Xinbo
2016-07-25
Driven by the forthcoming of 5G mobile communications, the all-IP architecture of mobile core networks, i.e. evolved packet core (EPC) proposed by 3GPP, has been greatly challenged by the users' demands for higher data rate and more reliable end-to-end connection, as well as operators' demands for low operational cost. These challenges can be potentially met by software defined optical networking (SDON), which enables dynamic resource allocation according to the users' requirement. In this article, a novel network architecture for mobile core network is proposed based on SDON. A software defined network (SDN) controller is designed to realize the coordinated control over different entities in EPC networks. We analyze the requirement of EPC-lightpath (EPCL) in data plane and propose an optical switch load balancing (OSLB) algorithm for resource allocation in optical layer. The procedure of establishment and adjustment of EPCLs is demonstrated on a SDON-based EPC testbed with extended OpenFlow protocol. We also evaluate the OSLB algorithm through simulation in terms of bandwidth blocking ratio, traffic load distribution, and resource utilization ratio compared with link-based load balancing (LLB) and MinHops algorithms.
Bandwidth characteristics of multimedia data traffic on a local area network
NASA Technical Reports Server (NTRS)
Chuang, Shery L.; Doubek, Sharon; Haines, Richard F.
1993-01-01
Limited spacecraft communication links call for users to investigate the potential use of video compression and multimedia technologies to optimize bandwidth allocations. The objective was to determine the transmission characteristics of multimedia data - motion video, text or bitmap graphics, and files transmitted independently and simultaneously over an ethernet local area network. Commercial desktop video teleconferencing hardware and software and Intel's proprietary Digital Video Interactive (DVI) video compression algorithm were used, and typical task scenarios were selected. The transmission time, packet size, number of packets, and network utilization of the data were recorded. Each data type - compressed motion video, text and/or bitmapped graphics, and a compressed image file - was first transmitted independently and its characteristics recorded. The results showed that an average bandwidth of 7.4 kilobits per second (kbps) was used to transmit graphics; an average bandwidth of 86.8 kbps was used to transmit an 18.9-kilobyte (kB) image file; a bandwidth of 728.9 kbps was used to transmit compressed motion video at 15 frames per second (fps); and a bandwidth of 75.9 kbps was used to transmit compressed motion video at 1.5 fps. Average packet sizes were 933 bytes for graphics, 498.5 bytes for the image file, 345.8 bytes for motion video at 15 fps, and 341.9 bytes for motion video at 1.5 fps. Simultaneous transmission of multimedia data types was also characterized. The multimedia packets used transmission bandwidths of 341.4 kbps and 105.8kbps. Bandwidth utilization varied according to the frame rate (frames per second) setting for the transmission of motion video. Packet size did not vary significantly between the data types. When these characteristics are applied to Space Station Freedom (SSF), the packet sizes fall within the maximum specified by the Consultative Committee for Space Data Systems (CCSDS). The uplink of imagery to SSF may be performed at minimal frame rates and/or within seconds of delay, depending on the user's allocated bandwidth. Further research to identify the acceptable delay interval and its impact on human performance is required. Additional studies in network performance using various video compression algorithms and integrated multimedia techniques are needed to determine the optimal design approach for utilizing SSF's data communications system.
Handling Qualities of a Large Civil Tiltrotor in Hover using Translational Rate Command
NASA Technical Reports Server (NTRS)
Malpica, Carlos A.; Theodore, Colin R.; Lawrence, Ben; Lindsey, James; Blanken, Chris
2012-01-01
A Translational Rate Command (TRC) control law has been developed to enable low speed maneuvering of a large civil tiltrotor with minimal pitch changes by means of automatic nacelle angle deflections for longitudinal velocity control. The nacelle actuator bandwidth required to achieve Level 1 handling qualities in hover and the feasibility of additional longitudinal cyclic control to augment low bandwidth nacelle actuation were investigated. A frequency-domain handling qualities criterion characterizing TRC response in terms of bandwidth and phase delay was proposed and validated against a piloted simulation conducted on the NASA-Ames Vertical Motion Simulator. Seven experimental test pilots completed evaluations in the ADS-33E-PRF Hover Mission Task Element (MTE) for a matrix of nacelle actuator bandwidths, equivalent rise times and control response sensitivities, and longitudinal cyclic control allocations. Evaluated against this task, longitudinal phase delay shows the Level 1 boundary is around 0.4 0.5 s. Accordingly, Level 1 handling qualities were achieved either with a nacelle actuator bandwidth greater than 4 rad/s, or by employing longitudinal cyclic control to augment low bandwidth nacelle actuation.
Design and implementation of the next generation Landsat satellite communications system
Mah, Grant R.; O'Brien, Michael; Garon, Howard; Mott, Claire; Ames, Alan; Dearth, Ken
2012-01-01
The next generation Landsat satellite, Landsat 8 (L8), also known as the Landsat Data Continuity Mission (LDCM), uses a highly spectrally efficient modulation and data formatting approach to provide large amounts of downlink (D/L) bandwidth in a limited X-Band spectrum allocation. In addition to purely data throughput and bandwidth considerations, there were a number of additional constraints based on operational considerations for prevention of interference with the NASA Deep-Space Network (DSN) band just above the L8 D/L band, minimization of jitter contributions to prevent impacts to instrument performance, and the need to provide an interface to the Landsat International Cooperator (IC) community. A series of trade studies were conducted to consider either X- or Ka-Band, modulation type, and antenna coverage type, prior to the release of the request for proposal (RFP) for the spacecraft. Through use of the spectrally efficient rate-7/8 Low-Density Parity-Check error-correction coding and novel filtering, an XBand frequency plan was developed that balances all the constraints and considerations, while providing world-class link performance, fitting 384 Mbits/sec of data into the 375 MHz X-Band allocation with bit-error rates better than 10-12 using an earth-coverage antenna.
Hinterleitner, Gernot; Leopold-Wildburger, Ulrike
2015-01-01
This paper deals with the market structure at the opening of the trading day and its influence on subsequent trading. We compare a single continuous double auction and two complement markets with different call auction designs as opening mechanisms in a unified experimental framework. The call auctions differ with respect to their levels of transparency. We find that a call auction not only improves market efficiency and liquidity at the beginning of the trading day when compared to the stand-alone continuous double auction, but also causes positive spillover effects on subsequent trading. Concerning the design of the opening call auction, we find no significant differences between the transparent and nontransparent specification with respect to opening prices and liquidity. In the course of subsequent continuous trading, however, market quality is slightly higher after a nontransparent call auction. PMID:26351653
Hinterleitner, Gernot; Leopold-Wildburger, Ulrike; Mestel, Roland; Palan, Stefan
2015-01-01
This paper deals with the market structure at the opening of the trading day and its influence on subsequent trading. We compare a single continuous double auction and two complement markets with different call auction designs as opening mechanisms in a unified experimental framework. The call auctions differ with respect to their levels of transparency. We find that a call auction not only improves market efficiency and liquidity at the beginning of the trading day when compared to the stand-alone continuous double auction, but also causes positive spillover effects on subsequent trading. Concerning the design of the opening call auction, we find no significant differences between the transparent and nontransparent specification with respect to opening prices and liquidity. In the course of subsequent continuous trading, however, market quality is slightly higher after a nontransparent call auction.
Federal Register 2010, 2011, 2012, 2013, 2014
2013-04-25
...This document announces the procedures and minimum opening bids for the upcoming auction of licenses in the lower and upper paging bands (Auction 95). This document is intended to familiarize prospective applicants with the procedures and other requirements for participation in the auction.
Federal Register 2010, 2011, 2012, 2013, 2014
2010-06-04
.... Each applicant also distributed preferred shares of Dutch Auction Rate Transferable Securities (``DARTS'') of the acquiring fund to holders of applicants' Auction Rate Preferred Shares, DARTS, or Auction... distributed Dutch Auction Rate Transferable Securities (``DARTS'') of the acquiring fund to the holders of...
29 CFR 780.619 - Work “in connection with” livestock auction operations.
Code of Federal Regulations, 2010 CFR
2010-07-01
... 29 Labor 3 2010-07-01 2010-07-01 false Work âin connection withâ livestock auction operations. 780... FAIR LABOR STANDARDS ACT Employment in Agriculture and Livestock Auction Operations Under the Section 13(b)(13) Exemption Requirements for Exemption § 780.619 Work “in connection with” livestock auction...
Federal Register 2010, 2011, 2012, 2013, 2014
2010-12-01
... Television Station Construction Permits Scheduled for February 15, 2011; Notice and Filing Requirements... upcoming auction of certain VHF commercial TV construction permits (Auction 90). This document is intended... December 15, 2010. Bidding for construction permits in Auction 90 is scheduled to begin on February 15...
Federal Register 2010, 2011, 2012, 2013, 2014
2010-02-23
... Construction Permits Scheduled for July 20, 2010; Auction 88 Applicants Must Provide Supplemental Information..., AM, and FM Translator construction permits scheduled to commence on July 20, 2010 (Auction 88). This.... Any envelopes must be disposed of before entering the building. Commercial overnight mail (other than...
77 FR 38803 - Mobility Fund Phase I Auction Updated Data For Auction 901
Federal Register 2010, 2011, 2012, 2013, 2014
2012-06-29
... FEDERAL COMMUNICATIONS COMMISSION [AU Docket No. 12-25; DA 12-990] Mobility Fund Phase I Auction Updated Data For Auction 901 AGENCY: Federal Communications Commission. ACTION: Notice. SUMMARY: In this... blocks. The map is a visual representation of data from the Attachment A files, which contain more...
Federal Register 2010, 2011, 2012, 2013, 2014
2013-05-14
... (2) a non-price specific commitment to auto-match all Auction responses received during the Auction... enhance competition in the Auctions and provide customers with additional opportunities for price... Auction processing, and specify (i) a single price at which it seeks to cross the Agency Order (with...
Competition strength influences individual preferences in an auction game
Toelch, Ulf; Jubera-Garcia, Esperanza; Kurth-Nelson, Zeb; Dolan, Raymond J.
2014-01-01
Competitive interactions between individuals are ubiquitous in human societies. Auctions represent an institutionalized context for these interactions, a context where individuals frequently make non-optimal decisions. In particular, competition in auctions can lead to overbidding, resulting in the so-called winner’s curse, often explained by invoking emotional arousal. In this study, we investigated an alternative possibility, namely that competitors’ bids are construed as a source of information about the good’s common value thereby influencing an individuals’ private value estimate. We tested this hypothesis by asking participants to bid in a repeated all-pay auction game for five different real items. Crucially, participants had to rank the auction items for their preference before and after the experiment. We observed a clear relation between auction dynamics and preference change. We found that low competition reduced preference while high competition increased preference. Our findings support a view that competitors’ bids in auction games are perceived as valid social signal for the common value of an item. We suggest that this influence of social information constitutes a major cause for the frequently observed deviations from optimality in auctions. PMID:25168161
Health Auctions: a Valuation Experiment (HAVE) study protocol.
Kularatna, Sanjeewa; Petrie, Dennis; Scuffham, Paul A; Byrnes, Joshua
2016-04-07
Quality-adjusted life years are derived using health state utility weights which adjust for the relative value of living in each health state compared with living in perfect health. Various techniques are used to estimate health state utility weights including time-trade-off and standard gamble. These methods have exhibited limitations in terms of complexity, validity and reliability. A new composite approach using experimental auctions to value health states is introduced in this protocol. A pilot study will test the feasibility and validity of using experimental auctions to value health states in monetary terms. A convenient sample (n=150) from a population of university staff and students will be invited to participate in 30 auction sets with a group of 5 people in each set. The 9 health states auctioned in each auction set will come from the commonly used EQ-5D-3L instrument. At most participants purchase 2 health states, and the participant who acquires the 2 'best' health states on average will keep the amount of money they do not spend in acquiring those health states. The value (highest bid and average bid) of each of the 24 health states will be compared across auctions to test for reliability across auction groups and across auctioneers. A test retest will be conducted for 10% of the sample to assess reliability of responses for health states auctions. Feasibility of conducting experimental auctions to value health states will also be examined. The validity of estimated health states values will be compared with published utility estimates from other methods. This pilot study will explore the feasibility, reliability and validity in using experimental auction for valuing health states. Ethical clearance was obtained from Griffith University ethics committee. The results will be disseminated in peer-reviewed journals and major international conferences. Published by the BMJ Publishing Group Limited. For permission to use (where not already granted under a licence) please go to http://www.bmj.com/company/products-services/rights-and-licensing/
Modal analysis and control of flexible manipulator arms. Ph.D. Thesis
NASA Technical Reports Server (NTRS)
Neto, O. M.
1974-01-01
The possibility of modeling and controlling flexible manipulator arms was examined. A modal approach was used for obtaining the mathematical model and control techniques. The arm model was represented mathematically by a state space description defined in terms of joint angles and mode amplitudes obtained from truncation on the distributed systems, and included the motion of a two link two joint arm. Three basic techniques were used for controlling the system: pole allocation with gains obtained from the rigid system with interjoint feedbacks, Simon-Mitter algorithm for pole allocation, and sensitivity analysis with respect to parameter variations. An improvement in arm bandwidth was obtained. Optimization of some geometric parameters was undertaken to maximize bandwidth for various payload sizes and programmed tasks. The controlled system is examined under constant gains and using the nonlinear model for simulations following a time varying state trajectory.
Federal Register 2010, 2011, 2012, 2013, 2014
2013-10-03
... Fund Phase I Auction (Auction 902); Short-Form Application Filing Window Rescheduled To Open on... rescheduling of the filing window for short-form applications and release an updated list of eligible areas for... Application Filing Window Rescheduled To Open on September 30, 2013 1. The Bureaus announce that the filing...
Federal Register 2010, 2011, 2012, 2013, 2014
2010-06-09
... licenses included in Auction 89 using the Commission's standard simultaneous multiple-round auction format... sequential bidding rounds. The initial bidding schedule will be announced in a public notice to be released.... For Auction 89, the Bureau proposes to employ a simultaneous stopping rule approach. A simultaneous...
DOE Office of Scientific and Technical Information (OSTI.GOV)
Marathe, Aniruddha P.; Harris, Rachel A.; Lowenthal, David K.
The use of clouds to execute high-performance computing (HPC) applications has greatly increased recently. Clouds provide several potential advantages over traditional supercomputers and in-house clusters. The most popular cloud is currently Amazon EC2, which provides fixed-cost and variable-cost, auction-based options. The auction market trades lower cost for potential interruptions that necessitate checkpointing; if the market price exceeds the bid price, a node is taken away from the user without warning. We explore techniques to maximize performance per dollar given a time constraint within which an application must complete. Specifically, we design and implement multiple techniques to reduce expected cost bymore » exploiting redundancy in the EC2 auction market. We then design an adaptive algorithm that selects a scheduling algorithm and determines the bid price. We show that our adaptive algorithm executes programs up to seven times cheaper than using the on-demand market and up to 44 percent cheaper than the best non-redundant, auction-market algorithm. We extend our adaptive algorithm to incorporate application scalability characteristics for further cost savings. In conclusion, we show that the adaptive algorithm informed with scalability characteristics of applications achieves up to 56 percent cost savings compared to the expected cost for the base adaptive algorithm run at a fixed, user-defined scale.« less
An Auction-Based Spectrum Leasing Mechanism for Mobile Macro-Femtocell Networks of IoT.
Chen, Xin; Xing, Lei; Qiu, Tie; Li, Zhuo
2017-02-16
The Internet of Things (IoT) is a vision of the upcoming society. It can provide pervasive communication between two or more entities using 4G-LTE (Long Term Evolution) communication technology. In 4G-LTE networks, there are two important problems: helping manage the spectrum demands of IoT devices and achieving much more revenue with the limited resource. This paper proposes a pricing framework to investigate the spectrum leasing in mobile heterogeneous networks with single macrocell and multiple femtocells. We modeled the leasing procedure between the macrocell service provider (MSP) and femtocell holders (FHs) as an auction to motivate the MSP to lease its spectrum resource. All FHs act as the bidders, and the monopolist MSP acts as the auctioneer. In the auction, FHs submit their bids to rent the spectrum resource so that they can make a profit by selling it to their subscribers. The MSP determines the spectrum leasing amount and chooses the winning FHs by solving the dynamic programming-based 0-1 knapsack problem. In our proposed framework, we focus on the spectrum pricing strategy and revenue maximization of the MSP. The simulation results show that the proposed scheme provides effective motivation for the MSP to lease the spectrum to FHs, and both the MSP and FHs can benefit from spectrum leasing.
Caldwell, B S
2000-09-01
AO-lU. Expedition-class missions are distinct from historical human presence in space in ways that significantly affect information flow and information technology designs for such missions. The centrality of Mission Control in these missions is challenged by the distances, associated communication delays, and durations of expeditions, all of which require crews to have more local resources available to manage on-board situations. The author's current research investigates how ground controllers effectively allocate communications bandwidth, cognitive resources, and knowledge sharing skills during time critical routine and non-routine situations. The research focus is on team-based information and communication technology (ICT) use to provide recommendations for improvements to support adaptive bandwidth allocations and improved sharing of data and knowledge in Mission Control contexts. In order to further improve communication and coordination between controllers and crew, additional ICT support resources will be needed to provide shared context knowledge and dynamic assessment of costs and benefits for accessing local information vs. remote expertise. Crew members will have critical needs to understand the goals, intentions, and situational constraints associated with mission information resources in order to use them most effectively in conditions where ground-based expertise is insufficient or requires more time to access and coordinate than local task demands permit. Results of this research will serve to improve the design and implementation of ICT systems to improve human performance capabilities and system operating tolerances for exploration missions. (Specific research data were not available at the time of publication.)
NASA Astrophysics Data System (ADS)
Zheng, Genrang; Lin, ZhengChun
The problem of winner determination in combinatorial auctions is a hotspot electronic business, and a NP hard problem. A Hybrid Artificial Fish Swarm Algorithm(HAFSA), which is combined with First Suite Heuristic Algorithm (FSHA) and Artificial Fish Swarm Algorithm (AFSA), is proposed to solve the problem after probing it base on the theories of AFSA. Experiment results show that the HAFSA is a rapidly and efficient algorithm for The problem of winner determining. Compared with Ant colony Optimization Algorithm, it has a good performance with broad and prosperous application.
ERIC Educational Resources Information Center
Cummings, Ronald G.; Holt, Charles A.; Laury, Susan K.
2004-01-01
In recent years, interest has been growing in policy applications of different auction systems. This paper reports a series of experiments that were used to design and implement an auction in a unique policymaking environment. In April 2000, the Georgia legislature passed a law that mandated that the state hold an auction in drought years to pay…
29 CFR 780.620 - Minimum wage for livestock auction work.
Code of Federal Regulations, 2010 CFR
2010-07-01
... minimum rate required by section 6(a)(1) of the Act for the time spent in livestock auction work. The exemption does not apply unless there is payment for all hours spent in livestock auction work at not less... 29 Labor 3 2010-07-01 2010-07-01 false Minimum wage for livestock auction work. 780.620 Section...
Code of Federal Regulations, 2010 CFR
2010-07-01
... 29 Labor 3 2010-07-01 2010-07-01 false Livestock auction employees exempt from overtime pay....13 Livestock auction employees exempt from overtime pay requirements under section 13(b)(13) of the... employee is employed both in agriculture and in connection with livestock auction operations: (a) The total...
Sequential Auctions in Uncertain Information Settings
NASA Astrophysics Data System (ADS)
Fatima, Shaheen; Wooldridge, Michael; Jennings, Nicholas R.
This paper analyzes sequential auctions for private value objects using second-price sealed-bid rules. Now, the equilibrium bids for such auctions depend on the information uncertainty of the bidders. Specifically, there are three key auction parameters that the bidders could be uncertain about: the valuations of the objects for sale, the number of objects for sale, and the number of participating bidders. We analyse the bidding behaviour for each of these three sources of uncertainty. For each setting, we first find the equilibrium bidding strategies for the individual auctions that comprise a series. Then we analyze the effect of these uncertainties on the computational and economic properties of the equilibrium solution. The former analysis is essential if we want to use software agents to bid on our behalf. The latter is essential because both the auctioneer and the bidders want to know how these uncertainties affect their profits. Thus we compare the outcomes for these settings from the perspective of the bidders (i.e., in terms of their profits), from the perspective of the auctioneer (i.e., in terms of his revenue), and from a global perspective (i.e., in terms of auction efficiency).
Improving the secrecy rate by turning foes to allies: An auction scheme
NASA Astrophysics Data System (ADS)
Ma, Ya-Yan; Wang, Bao-Yun
2015-09-01
Security against eavesdroppers is a critical issue in cognitive radio networks (CRNs). In this paper, a scenario consisting of one primary pair and multiple secondary pairs is considered. The secondary transmitters (STs) work in half-duplex mode and they are potential eavesdroppers on the primary transmission unless they are allowed to simultaneously transmit with the primary transmitter (PT). A modified second-price sealed-bid auction scheme is employed to model the interaction between the PT and STs. With the proposed auction scheme, the hostile relationship between the PT and STs is transformed into a cooperative relationship. An iterative algorithm based on the max-min criteria is proposed to find the optimal bidding power of the STs for an access chance in the presence of multiple eavesdroppers. Numerical results show that the proposed auction scheme not only improves the PT’s security but also increases the access opportunities of the STs. Project supported by the National Natural Science Foundation of China (Grant Nos. 61271232 and 61372126) and the University Postgraduate Research and Innovation Project in Jiangsu Province, China (Grant No. CXZZ12-0472).
Fletcher, Tim D; Walsh, Chistopher J; Bos, Darren; Nemes, Veronika; RossRakesh, Sharyn; Prosser, Toby; Hatt, Belinda; Birch, Rhiannon
2011-01-01
Urbanisation results in changes to runoff behaviour which, if not addressed, inevitably degrade receiving waters. To date, most stormwater management has focussed on the streetscape and public open space. Given that much of the catchment imperviousness is located on private land, we developed and tested a novel economic instrument (a uniform price auction) for encouraging allotment-scale stormwater retention. We evaluated bids using an integrated environmental benefit index (EBI), based on the ability of the proposed works to reduce runoff frequency, pollutant loads and to reduce potable water demand. The uniform price auction resulted in 1.4 ha of impervious areas being effectively 'disconnected' from the stormwater system. The EBI provided an objective and transparent method of comparing bids, which varied in the type of works proposed (e.g. rainwater tank, rain-garden), the cost and the resulting environmental benefit. Whilst the pilot auction was a success, the public subsidy of works undertaken was around 85%, meaning that property owners a relatively small private benefit in the works. Future auction rounds will be revised to (i) test an EBI which is more focussed on the protection of streams (assessing changes to runoff frequency, baseflow volumes and water quality) and (ii) provide an auction process which is simpler to understand, and provides greater practical support for landholders who wish to undertake works.
Genetic expression programming-based DBA for enhancing peer-assisted music-on-demand service in EPON
NASA Astrophysics Data System (ADS)
Liem, Andrew Tanny; Hwang, I.-Shyan; Nikoukar, AliAkbar; Lee, Jhong-Yue
2015-03-01
Today, the popularity of peer-assisted music-on-demand (MoD) has increased significantly worldwide. This service allows users to access large music library tracks, listen to music, and share their playlist with other users. Unlike the conventional voice traffic, such an application maintains music quality that ranges from 160 kbps to 320 kbps, which most likely consumes more bandwidth than other traffics. In the access network, Ethernet passive optical network (EPON) is one of the best candidates for delivering such a service because of being cost-effective and with high bandwidth. To maintain music quality, a stutter needs to be prevented because of either network effects or when the due user was not receiving enough resources to play in a timely manner. Therefore, in this paper, we propose two genetic expression programming (GEP)-based dynamic bandwidth allocations (DBAs). The first DBA is a generic DBA that aims to find an optimum formula for voice, video, and data services. The second DBA aims to find optimum formulas so that Optical Line Terminal (OLT) can satisfy not only the voice and Peer-to-Peer (P2P) MoD traffics but also reduce the stutter. Optical Network Unit (ONU) traits such as REPORT and GATE messages, cycle time, and mean packet delay are set to be predictor variables. Simulation results show that our proposed DBAs can satisfy the voice and P2P MoD services packet delay and monitor other overall system performances such as expedited forwarding (EF) jitter, packet loss, bandwidth waste, and system throughputs.
40 CFR 74.41 - Identifying allowances.
Code of Federal Regulations, 2010 CFR
2010-07-01
... for auction. (1) An authorized account representative may offer for sale in the spot auction under... compliance use date earlier than the year in which the spot auction is to be held and if the Administrator...
Vehicle Health Management Communications Requirements for AeroMACS
NASA Technical Reports Server (NTRS)
Kerczewski, Robert J.; Clements, Donna J.; Apaza, Rafael D.
2012-01-01
As the development of standards for the aeronautical mobile airport communications system (AeroMACS) progresses, the process of identifying and quantifying appropriate uses for the system is progressing. In addition to defining important elements of AeroMACS standards, indentifying the systems uses impacts AeroMACS bandwidth requirements. Although an initial 59 MHz spectrum allocation for AeroMACS was established in 2007, the allocation may be inadequate; studies have indicated that 100 MHz or more of spectrum may be required to support airport surface communications. Hence additional spectrum allocations have been proposed. Vehicle health management (VHM) systems, which can produce large volumes of vehicle health data, were not considered in the original bandwidth requirements analyses, and are therefore of interest in supporting proposals for additional AeroMACS spectrum. VHM systems are an emerging development in air vehicle safety, and preliminary estimates of the amount of data that will be produced and transmitted off an aircraft, both in flight and on the ground, have been prepared based on estimates of data produced by on-board vehicle health sensors and initial concepts of data processing approaches. This allowed an initial estimate of VHM data transmission requirements for the airport surface. More recently, vehicle-level systems designed to process and analyze VHM data and draw conclusions on the current state of vehicle health have been undergoing testing and evaluation. These systems make use of vehicle system data that is mostly different from VHM data considered previously for airport surface transmission, and produce processed system outputs that will be also need to be archived, thus generating additional data load for AeroMACS. This paper provides an analysis of airport surface data transmission requirements resulting from the vehicle level reasoning systems, within the context of overall VHM data requirements.
Marathe, Aniruddha P.; Harris, Rachel A.; Lowenthal, David K.; ...
2015-12-17
The use of clouds to execute high-performance computing (HPC) applications has greatly increased recently. Clouds provide several potential advantages over traditional supercomputers and in-house clusters. The most popular cloud is currently Amazon EC2, which provides fixed-cost and variable-cost, auction-based options. The auction market trades lower cost for potential interruptions that necessitate checkpointing; if the market price exceeds the bid price, a node is taken away from the user without warning. We explore techniques to maximize performance per dollar given a time constraint within which an application must complete. Specifically, we design and implement multiple techniques to reduce expected cost bymore » exploiting redundancy in the EC2 auction market. We then design an adaptive algorithm that selects a scheduling algorithm and determines the bid price. We show that our adaptive algorithm executes programs up to seven times cheaper than using the on-demand market and up to 44 percent cheaper than the best non-redundant, auction-market algorithm. We extend our adaptive algorithm to incorporate application scalability characteristics for further cost savings. In conclusion, we show that the adaptive algorithm informed with scalability characteristics of applications achieves up to 56 percent cost savings compared to the expected cost for the base adaptive algorithm run at a fixed, user-defined scale.« less
An Auction-Based Spectrum Leasing Mechanism for Mobile Macro-Femtocell Networks of IoT
Chen, Xin; Xing, Lei; Qiu, Tie; Li, Zhuo
2017-01-01
The Internet of Things (IoT) is a vision of the upcoming society. It can provide pervasive communication between two or more entities using 4G-LTE (Long Term Evolution) communication technology. In 4G-LTE networks, there are two important problems: helping manage the spectrum demands of IoT devices and achieving much more revenue with the limited resource. This paper proposes a pricing framework to investigate the spectrum leasing in mobile heterogeneous networks with single macrocell and multiple femtocells. We modeled the leasing procedure between the macrocell service provider (MSP) and femtocell holders (FHs) as an auction to motivate the MSP to lease its spectrum resource. All FHs act as the bidders, and the monopolist MSP acts as the auctioneer. In the auction, FHs submit their bids to rent the spectrum resource so that they can make a profit by selling it to their subscribers. The MSP determines the spectrum leasing amount and chooses the winning FHs by solving the dynamic programming-based 0–1 knapsack problem. In our proposed framework, we focus on the spectrum pricing strategy and revenue maximization of the MSP. The simulation results show that the proposed scheme provides effective motivation for the MSP to lease the spectrum to FHs, and both the MSP and FHs can benefit from spectrum leasing. PMID:28212317
47 CFR 1.8003 - Providing the FRN in Commission filings.
Code of Federal Regulations, 2011 CFR
2011-10-01
... subpart G of this part, anyone participating in a spectrum auction, making up-front payments or deposits in a spectrum auction, anyone making a payment on an auction loan, anyone making a contribution to...
47 CFR 1.8003 - Providing the FRN in Commission filings.
Code of Federal Regulations, 2010 CFR
2010-10-01
... subpart G of this part, anyone participating in a spectrum auction, making up-front payments or deposits in a spectrum auction, anyone making a payment on an auction loan, anyone making a contribution to...
47 CFR 1.8003 - Providing the FRN in Commission filings.
Code of Federal Regulations, 2013 CFR
2013-10-01
... from paying statutory charges under subpart G of this part, anyone participating in a spectrum auction, making up-front payments or deposits in a spectrum auction, anyone making a payment on an auction loan...
47 CFR 1.8003 - Providing the FRN in Commission filings.
Code of Federal Regulations, 2012 CFR
2012-10-01
... from paying statutory charges under subpart G of this part, anyone participating in a spectrum auction, making up-front payments or deposits in a spectrum auction, anyone making a payment on an auction loan...
Approximating the Qualitative Vickrey Auction by a Negotiation Protocol
NASA Astrophysics Data System (ADS)
Hindriks, Koen V.; Tykhonov, Dmytro; de Weerdt, Mathijs
A result of Bulow and Klemperer has suggested that auctions may be a better tool to obtain an efficient outcome than negotiation. For example, some auction mechanisms can be shown to be efficient and strategy-proof. However, they generally also require that the preferences of at least one side of the auction are publicly known. However, sometimes it is very costly, impossible, or undesirable to publicly announce such preferences. It thus is interesting to find methods that do not impose this constraint but still approximate the outcome of the auction. In this paper we show that a multi-round multi-party negotiation protocol may be used to this end if the negotiating agents are capable of learning opponent preferences. The latter condition can be met by current state of the art negotiation technology. We show that this protocol approximates the theoretical outcome predicted by a so-called Qualitative Vickrey auction mechanism (even) on a complex multi-issue domain.
Providing wireless bandwidth for high-speed rail operations : final report.
DOT National Transportation Integrated Search
2016-07-01
This project examined the possibility of providing wireless communication for train control systems on American high-speed trains. In this : study, the key issue is that the frequencies allocated for rail operations in the U.S. and the frequencies us...
Auction fever: exploring informational social influences on bidder choices.
Chen, Yi-Fen
2011-01-01
Previous investigations of herd behavior have identified the importance of informational social influences in consumer decision making. This research presents three studies examining herd behavior in online auctions. The three studies addressed the influence on bidder online choices of herd cues frequently found in online auctions, including bid number, feedback ratings, and number of questions and answers. This research also investigated the effect of different levels of herd cues on bidder online choices under high and low brand awareness in online auctions. The experimental results demonstrated that bidders use online herd cues when making decisions in online auctions. Additionally, different levels of herd cues influence bidder online choices in both high and low brand awareness product situations.
OTACT: ONU Turning with Adaptive Cycle Times in Long-Reach PONs
NASA Astrophysics Data System (ADS)
Zare, Sajjad; Ghaffarpour Rahbar, Akbar
2015-01-01
With the expansion of PON networks as Long-Reach PON (LR-PON) networks, the problem of degrading the efficiency of centralized bandwidth allocation algorithms threatens this network due to high propagation delay. This is because these algorithms are based on bandwidth negotiation messages frequently exchanged between the optical line terminal (OLT) in the Central Office and optical network units (ONUs) near the users, which become seriously delayed when the network is extended. To solve this problem, some decentralized algorithms are proposed based on bandwidth negotiation messages frequently exchanged between the Remote Node (RN)/Local Exchange (LX) and ONUs near the users. The network has a relatively high delay since there are relatively large distances between RN/LX and ONUs, and therefore, control messages should travel twice between ONUs and RN/LX in order to go from one ONU to another ONU. In this paper, we propose a novel framework, called ONU Turning with Adaptive Cycle Times (OTACT), that uses Power Line Communication (PLC) to connect two adjacent ONUs. Since there is a large population density in urban areas, ONUs are closer to each other. Thus, the efficiency of the proposed method is high. We investigate the performance of the proposed scheme in contrast with other decentralized schemes under the worst case conditions. Simulation results show that the average upstream packet delay can be decreased under the proposed scheme.
Auctions in Defense Acquisition: Theory and Experimental Evidence
2002-01-01
Department of Defense (DoD) has recently begun purchasing with online auctions — receiving offers from suppli- ers for things ranging from computers to...equipment for U.S. Navy vessels. The Navy was the first to try online auctions for procuring airplane and ship parts. The Army’s first venture into...system. The Air Force first tested the online auction waters in Au- gust 2000 to acquire computer equipment and saved about $88,000, or 27 percent of
Sequential Auctions with Partially Substitutable Goods
NASA Astrophysics Data System (ADS)
Vetsikas, Ioannis A.; Jennings, Nicholas R.
In this paper, we examine a setting in which a number of partially substitutable goods are sold in sequential single unit auctions. Each bidder needs to buy exactly one of these goods. In previous work, this setting has been simplified by assuming that bidders do not know their valuations for all items a priori, but rather are informed of their true valuation for each item right before the corresponding auction takes place. This assumption simplifies the strategies of bidders, as the expected revenue from future auctions is the same for all bidders due to the complete lack of private information. In our analysis we don't make this assumption. This complicates the computation of the equilibrium strategies significantly. We examine this setting both for first and second-price auction variants, initially when the closing prices are not announced, for which we prove that sequential first and second-price auctions are revenue equivalent. Then we assume that the prices are announced; because of the asymmetry in the announced prices between the two auction variants, revenue equivalence does not hold in this case. We finish the paper, by giving some initial results about the case when free disposal is allowed, and therefore a bidder can purchase more than one item.
Essays in financial transmission rights pricing
NASA Astrophysics Data System (ADS)
Posner, Barry
This work examines issues in the pricing of financial transmission rights in the PJM market region. The US federal government is advocating the creation of large-scale, not-for-profit regional transmission organizations to increase the efficiency of the transmission of electricity. As a non-profit entity, PJM needs to allocate excess revenues collected as congestion rents, and the participants in the transmission markets need to be able to hedge their exposure to congestion rents. For these purposes, PJM has developed an instrument known as the financial transmission right (FTR). This research, utilizing a new data set assembled by the author, looks at two aspects of the FTR market. The first chapter examines the problem of forecasting congestion in a transmission grid. In the PJM FTR system firms bid in a competitive auction for FTRs that cover a period of one month. The auctions take place in the middle of the previous month; therefore firms have to forecast congestion rents for the period two to six weeks after the auction. The common methods of forecasting congestion are either time-series models or full-information engineering studies. In this research, the author develops a forecasting system that is more economically grounded than a simple time-series model, but requires less information than an engineering model. This method is based upon the arbitrage-cost methodology, whereby congesting is calculated as the difference of two non-observable variables: the transmission price difference that would exist in the total absence of transmission capacity between two nodes, and the ability of the existing transmission to reduced that price difference. If the ability to reduce the price difference is greater than the price difference, then the cost of electricity at each node will be the same, and congestion rent will be zero. If transmission capacity limits are binding on the flow of power, then a price difference persists and congestion rents exist. Three transmission paths in the Delmarva Peninsula were examined. The maximum-likelihood two-way Tobit model developed in Chapter One consistently predicts the expected responses to the independent variables that have employed, but the model as defined here does a poor job of predicting prices. This is likely due to the inability to include system outages (i.e., short-term changes in the structure of the transmission grid) as variables in the estimation model. The second chapter addresses the behavior of firms in the monthly auctions for FTRs. FTRs are a claim to congestion rent revenues along a certain path within the PJM grid, and are awarded in a uniform-price divisible-goods auction. Firms typically submit a schedule of bids for different amounts of FTR at different prices, akin to a demand curve. A firm bidding too high a price may cause the clearing price of the FTR to be higher than the realized value of the FTR, creating a loss from ownership of the FTR. A firm bidding too low means that it wins no FTRs, depriving itself of the ability to profit from ownership or to hedge against congestion. Several questions concerning firm behavior are addressed in this study. It is found that firms adjust their bids in response to new information that is obtained from past auctions: they raise or lower bids in accordance with changes in recent FTR prices and payoffs. Firms consistently bid below the value of the FTR (i.e., shade their bids). This adds empirical evidence to the theoretically-posited notion that uniform-price auctions are not truth-telling, unlike the second-price auction for a non-divisible good. Firms employ greater bid-shading in response to increases in the volatility of both FTR clearing prices and realized FTR values. This validates the notion that firms are risk-averse. It is discovered that better-informed "insider" firms employ structurally different bidding strategies, but these differences do not lead to greater profits. However, profits do increase as firms gain more experience in these markets, lending credence to the notion that firms learn over time and that markets discipline poorly performing firms by either educating them or driving them out of the market. It is also found that firms that employ complicated bidding strategies enjoy greater profitability than firms which employ simple bidding strategies. A surprising corollary finding is that firm strategies do not converge to a common form, but that different firms continue to employ different strategies, and often move away from the seemingly dominant strategy. Firms can enter this market as either long-buyers or short-sellers, and it is discovered that long and short players display structurally divergent bidding strategies. This is perhaps unsurprising, given that long players can be either hedgers or speculators, but short players are overwhelmingly speculators.
47 CFR 1.2208 - Public notice of auction completion and auction results.
Code of Federal Regulations, 2014 CFR
2014-10-01
... PROCEDURE Grants by Random Selection Competitive Bidding Proceedings Broadcast Television Spectrum Reverse... broadcast television spectrum incentive auction conducted under section 6403 of the Spectrum Act, public... indicate that the reassignments of television channels and reallocations of broadcast television spectrum...
2008-03-01
and do not reflect the official policy or position of the Department of Defense or the U.S. Government. 12a. DISTRIBUTION / AVAILABILITY STATEMENT...auction is used to set salaries levels in a generic labor market scenario. The experimental results support the literature: a second-price auction...analyses an experiment where a sealed-bid, second-price auction is used to set salaries levels in a generic labor market scenario. The experimental
Torque blending and wheel slip control in EVs with in-wheel motors
NASA Astrophysics Data System (ADS)
de Castro, Ricardo; Araújo, Rui E.; Tanelli, Mara; Savaresi, Sergio M.; Freitas, Diamantino
2012-01-01
Among the many opportunities offered by electric vehicles (EVs), the design of power trains based on in-wheel electric motors represents, from the vehicle dynamics point of view, a very attractive prospect, mainly due to the torque-vectoring capabilities. However, this distributed propulsion also poses some practical challenges, owing to the constraints arising from motor installation in a confined space, to the increased unsprung mass weight and to the integration of the electric motor with the friction brakes. This last issue is the main theme of this work, which, in particular, focuses on the design of the anti-lock braking system (ABS). The proposed structure for the ABS is composed of a tyre slip controller, a wheel torque allocator and a braking supervisor. To address the slip regulation problem, an adaptive controller is devised, offering robustness to uncertainties in the tyre-road friction and featuring a gain-scheduling mechanism based on the vehicle velocity. Further, an optimisation framework is employed in the torque allocator to determine the optimal split between electric and friction brake torque based on energy performance metrics, actuator constraints and different actuators bandwidth. Finally, based on the EV working condition, the priorities of this allocation scheme are adapted by the braking supervisor unit. Simulation results obtained with the CarSim vehicle model, demonstrate the effectiveness of the overall approach.
Widely bandwidth-tunable silicon filter with an unlimited free-spectral range.
St-Yves, Jonathan; Bahrami, Hadi; Jean, Philippe; LaRochelle, Sophie; Shi, Wei
2015-12-01
Next-generation high-capacity optical networks require flexible allocation of spectrum resources, for which low-cost optical filters with an ultra-wide bandwidth tunability beyond 100 GHz are desired. We demonstrate an integrated band-pass filter with the bandwidth continuously tuned across 670 GHz (117-788 GHz) which, to the best of our knowledge, is the widest tuning span ever demonstrated on a silicon chip. The filter also features simultaneous wavelength tuning and an unlimited free spectral range. We measured an out-of-band contrast of up to 55 dB, low in-band ripples of less than 0.3 dB, and in-band group delay variation of less than 8 ps. This result was achieved using cascaded Bragg-grating-assisted contra-directional couplers and micro-heaters on the 220 nm silicon-on-insulator platform with a very compact footprint of less than 7000 μm2. Another design with the bandwidth continuously tunable from 50 GHz to 1 THz is also presented.
19 CFR 127.34 - Auctioneer's commissions.
Code of Federal Regulations, 2010 CFR
2010-04-01
... 19 Customs Duties 1 2010-04-01 2010-04-01 false Auctioneer's commissions. 127.34 Section 127.34 Customs Duties U.S. CUSTOMS AND BORDER PROTECTION, DEPARTMENT OF HOMELAND SECURITY; DEPARTMENT OF THE TREASURY GENERAL ORDER, UNCLAIMED, AND ABANDONED MERCHANDISE Proceeds of Sale § 127.34 Auctioneer's...
A Trustworthy Internet Auction Model with Verifiable Fairness.
ERIC Educational Resources Information Center
Liao, Gen-Yih; Hwang, Jing-Jang
2001-01-01
Describes an Internet auction model achieving verifiable fairness, a requirement aimed at enhancing the trust of bidders in auctioneers. Analysis results demonstrate that the proposed model satisfies various requirements regarding fairness and privacy. Moreover, in the proposed model, the losing bids remain sealed. (Author/AEF)
Code of Federal Regulations, 2010 CFR
2010-01-01
... 7 Agriculture 2 2010-01-01 2010-01-01 false Auction market. 29.36 Section 29.36 Agriculture Regulations of the Department of Agriculture AGRICULTURAL MARKETING SERVICE (Standards, Inspections, Marketing... INSPECTION Regulations Definitions § 29.36 Auction market. A place to which tobacco is delivered by the...
NASA Astrophysics Data System (ADS)
Yadav, Dharmendra Singh; Babu, Sarath; Manoj, B. S.
2018-03-01
Spectrum conflict during primary and backup routes assignment in elastic optical networks results in increased resource consumption as well as high Bandwidth Blocking Probability. In order to avoid such conflicts, we propose a new scheme, Quasi Path Restoration (QPR), where we divide the available spectrum into two: (1) primary spectrum (for primary routes allocation) and (2) backup spectrum (for rerouting the data on link failures). QPR exhibits three advantages over existing survivable strategies such as Shared Path Protection (SPP), Primary First Fit Backup Last Fit (PFFBLF), Jointly Releasing and re-establishment Defragmentation SPP (JRDSSPP), and Path Restoration (PR): (1) the conflict between primary and backup spectrum during route assignment is completely eliminated, (2) upon a link failure, connection recovery requires less backup resources compared to SPP, PFFBLF, and PR, and (3) availability of the same backup spectrum on each link improves the recovery guarantee. The performance of our scheme is analyzed with different primary backup spectrum partitions on varying connection-request demands and number of frequency slots. Our results show that QPR provides better connection recovery guarantee and Backup Resources Utilization (BRU) compared to bandwidth recovery of PR strategy. In addition, we compare QPR with Shared Path Protection and Primary First-Fit Backup Last Fit strategies in terms of Bandwidth Blocking Probability (BBP) and average frequency slots per connection request. Simulation results show that BBP of SPP, PFFBLF, and JRDSPP varies between 18.59% and 14.42%, while in QPR, BBP ranges from 2.55% to 17.76% for Cost239, NSFNET, and ARPANET topologies. Also, QPR provides bandwidth recovery between 93.61% and 100%, while in PR, the recovery ranges from 86.81% to 98.99%. It is evident from our analysis that QPR provides a reasonable trade-off between bandwidth blocking probability and connection recoverability.
Performance analysis of dynamic time-slot allocation system
NASA Astrophysics Data System (ADS)
Kong, Hongwei; Ruan, Fang; Feng, Chongxi
2001-10-01
Multi-service Access on the narrow-band DDN (Digital Data Network) leased lines to use the bandwidth more efficiently and reduce the cost has attracted much interest. In this paper, one novel multi-service multiplexing scheme based on DTSA (Dynamic Time-Slot Allocation) is given. This scheme can guarantee the QoS of the multiplexed services such as FAX, Voice and data and adapt to different link rates (64kb/s, 128kb/s, 256kb/s), A model is given in this paper to analyze the data behavior under this scheme. The simulation result and the model result have shown that the QoS guarantee to voice and FAX doesn't compromise the QoS of data service much in the meaning of delay and delay variance when the data load is not too high. The simulation result agrees with the model well when data load is not too high.
Frequency allocations for a new satellite service - Digital audio broadcasting
NASA Technical Reports Server (NTRS)
Reinhart, Edward E.
1992-01-01
The allocation in the range 500-3000 MHz for digital audio broadcasting (DAB) is described in terms of key issues such as the transmission-system architectures. Attention is given to the optimal amount of spectrum for allocation and the technological considerations relevant to downlink bands for satellite and terrestrial transmissions. Proposals for DAB allocations are compared, and reference is made to factors impinging on the provision of ground/satellite feeder links. The allocation proposals describe the implementation of 50-60-MHz bandwidths for broadcasting in the ranges near 800 MHz, below 1525 MHz, near 2350 MHz, and near 2600 MHz. Three specific proposals are examined in terms of characteristics such as service areas, coverage/beam, channels/satellite beam, and FCC license status. Several existing problems are identified including existing services crowded with systems, the need for new bands in the 1000-3000-MHz range, and variations in the nature and intensity of implementations of existing allocations that vary from country to country.
Seeger, Jon T; King, Michael E; Grotelueschen, Dale M; Rogers, Glenn M; Stokka, Gerald S
2011-08-15
To evaluate and update the previously quantified effects of management, marketing, and certified health programs on the sale price of beef calves sold through a livestock video auction service. Longitudinal study. 41,657 lots representing 5,042,272 beef calves sold from 1995 through 2009. Data describing each lot of beef calves marketed from 1995 through 2009 by a livestock video auction service were obtained from sale catalogues. For each year of the study, multiple regression analysis was used to quantify the effect of management, marketing, and certified health programs on sale price. Sale date, base sale weight, quadratic effect of base weight, sex of calf, region of origin, breed description, inclusion in a certified health program, and number of calves in the lot significantly affected sale price for every year of the study. Variation in body weight, flesh score, and number of days between sale and delivery date had significant effects on price in most of the years; frame score and calves with horns affected price in 7 of 15 years; age and source verification influenced sale price in every year since source verification was introduced in 2005; and the auction service's progressive genetics program increased price during the 1 year that program was available. Some management, marketing, and certified health initiatives have consistently increased the sale price of beef calves, and producers can increase the price of their calves by implementing these practices.
77 FR 9655 - Mobility Fund Phase I Auction Updated List of Potentially Eligible Census Blocks
Federal Register 2010, 2011, 2012, 2013, 2014
2012-02-17
... Updated List of Potentially Eligible Census Blocks AGENCY: Federal Communications Commission. ACTION... Bureaus provide an updated list of potentially eligible census blocks for Auction 901 scheduled to... summary of the Mobility Fund Phase I Auction Updated List of Potentially Eligible Census Blocks Public...
Federal Register 2010, 2011, 2012, 2013, 2014
2010-07-28
... currently collected and made transparent by the MSRB on municipal Auction Rate Securities (``ARS'') and... MSRB on municipal Auction Rate Securities (``ARS'') and Variable Rate Demand Obligations (``VRDOs... auction procedures and interest rate setting mechanisms for ARS and liquidity facilities for VRDOs...
Federal Register 2010, 2011, 2012, 2013, 2014
2010-08-27
... the MSRB on municipal Auction Rate Securities (``ARS'') and Variable Rate Demand Obligations (``VRDOs... information currently collected and made transparent by the MSRB on municipal Auction Rate Securities (``ARS... that define auction procedures and interest rate setting mechanisms for ARS and liquidity facilities...
47 CFR 90.903 - Competitive bidding mechanisms.
Code of Federal Regulations, 2014 CFR
2014-10-01
... Bureau will establish and may vary the sequence in which 800 MHz SMR licenses for Spectrum Blocks A through V will be auctioned. (b) Grouping. (1) All EA licenses for Spectrum Blocks A through V will be... the auction, an alternative method of grouping these licenses for auction. (2) Spectrum blocks D...
47 CFR 90.903 - Competitive bidding mechanisms.
Code of Federal Regulations, 2013 CFR
2013-10-01
... Bureau will establish and may vary the sequence in which 800 MHz SMR licenses for Spectrum Blocks A through V will be auctioned. (b) Grouping. (1) All EA licenses for Spectrum Blocks A through V will be... the auction, an alternative method of grouping these licenses for auction. (2) Spectrum blocks D...
47 CFR 90.903 - Competitive bidding mechanisms.
Code of Federal Regulations, 2011 CFR
2011-10-01
... Bureau will establish and may vary the sequence in which 800 MHz SMR licenses for Spectrum Blocks A through V will be auctioned. (b) Grouping. (1) All EA licenses for Spectrum Blocks A through V will be... the auction, an alternative method of grouping these licenses for auction. (2) Spectrum blocks D...
47 CFR 90.903 - Competitive bidding mechanisms.
Code of Federal Regulations, 2012 CFR
2012-10-01
... Bureau will establish and may vary the sequence in which 800 MHz SMR licenses for Spectrum Blocks A through V will be auctioned. (b) Grouping. (1) All EA licenses for Spectrum Blocks A through V will be... the auction, an alternative method of grouping these licenses for auction. (2) Spectrum blocks D...
Federal Register 2010, 2011, 2012, 2013, 2014
2010-09-16
... FEDERAL COMMUNICATIONS COMMISSION [AU Docket No. 10-107; DA 10-1630] Wireless Telecommunications... Auction 89. FOR FURTHER INFORMATION CONTACT: Wireless Telecommunications Bureau, Auctions and Spectrum... by the Chief, Wireless Telecommunications Bureau pursuant to authority delegated by 47 CFR 0.131...
Auction-theoretic analyses of the first offshore wind energy auction in Germany
NASA Astrophysics Data System (ADS)
Kreiss, J.; Ehrhart, K.-M.; Hanke, A.-K.
2017-11-01
The first offshore wind energy auction in Germany led to a striking result. The average award price was 0.44 ct/kWh and even more interesting, 3 out of 4 awarded projects had a strike price of 0.0 ct/kWh. That implies that those projects will only receive the actual wholesale market price for electricity as revenue. Although there has been a strong decline in costs of offshore wind projects, such a result is still surprising. We analyzed this result auction-theoretically and showed how the auction design and the market environment can explain part of the outcome. However, another aspect of the explanation is the high risk that the awarded bidders take regarding the future development of both the project costs and the wholesale market price.
Experimental demonstration of spectrum-sliced elastic optical path network (SLICE).
Kozicki, Bartłomiej; Takara, Hidehiko; Tsukishima, Yukio; Yoshimatsu, Toshihide; Yonenaga, Kazushige; Jinno, Masahiko
2010-10-11
We describe experimental demonstration of spectrum-sliced elastic optical path network (SLICE) architecture. We employ optical orthogonal frequency-division multiplexing (OFDM) modulation format and bandwidth-variable optical cross-connects (OXC) to generate, transmit and receive optical paths with bandwidths of up to 1 Tb/s. We experimentally demonstrate elastic optical path setup and spectrally-efficient transmission of multiple channels with bit rates ranging from 40 to 140 Gb/s between six nodes of a mesh network. We show dynamic bandwidth scalability for optical paths with bit rates of 40 to 440 Gb/s. Moreover, we demonstrate multihop transmission of a 1 Tb/s optical path over 400 km of standard single-mode fiber (SMF). Finally, we investigate the filtering properties and the required guard band width for spectrally-efficient allocation of optical paths in SLICE.
Essays on electricity transmission investment and financial transmission rights
NASA Astrophysics Data System (ADS)
Shang, Wenzhuo
The U.S. electric power industry has been going through fundamental restructuring and realignment since the 1990's. Many issues and problems have emerged during the transition, and both economists and engineers have been looking for the solutions fervently. In this dissertation, which consists primarily of three essays, we apply economics theory and techniques to the power industry and address two related issues, transmission investment and financial transmission rights (FTRs). The first essay takes the decentralized perspective and investigates the efficiency attribute of market-based transmission investment under perfect competition. We clarify, for the first time, the nature of the externality created by loop flows that causes transmission investment to be inefficient. Our findings have important implications for better understanding of transmission market design and creating incentives for efficient transmission investment. In the second essay, we define several rules for allocating transmission investment cost within the framework of cooperative game theory. These rules provide fair, stable or efficient cost allocations in theory and are good benchmarks against which the allocation mechanism in practice can be compared and improved upon. In the last essay, we make exploratory efforts in analyzing and assessing empirically the performance of the Midwest independent system operator (MISO) FTR auction market. We reveal some stylized facts about this young market and find that it is not efficient under the risk-neutrality assumption. We also point out and correct the drawbacks in previous related work and suggest about more complete empirical work in future. In all, this dissertation makes both theoretic and empirical analysis of the two hot issues related to the power industry and comes up with findings that have important implications for the development of this industry.
Packet Scheduling Mechanism to Improve Quality of Short Flows and Low-Rate Flows
NASA Astrophysics Data System (ADS)
Yokota, Kenji; Asaka, Takuya; Takahashi, Tatsuro
In recent years elephant flows are increasing by expansion of peer-to-peer (P2P) applications on the Internet. As a result, bandwidth is occupied by specific users triggering unfair resource allocation. The main packet-scheduling mechanism currently employed is first-in first-out (FIFO) where the available bandwidth of short flows is limited by elephant flows. Least attained service (LAS), which decides transfer priority of packets by the total amount of transferred data in all flows, was proposed to solve this problem. However, routers with LAS limit flows with large amount of transferred data even if they are low-rate. Therefore, it is necessary to improve the quality of low-rate flows with long holding times such as voice over Internet protocol (VoIP) applications. This paper proposes rate-based priority control (RBPC), which calculates the flow rate and control the priority by using it. Our proposed method can transfer short flows and low-rate flows in advance. Moreover, its fair performance is shown through simulations.
NASA Astrophysics Data System (ADS)
Xu, Chuanpei; Niu, Junhao; Ling, Jing; Wang, Suyan
2018-03-01
In this paper, we present a parallel test strategy for bandwidth division multiplexing under the test access mechanism bandwidth constraint. The Pareto solution set is combined with a cloud evolutionary algorithm to optimize the test time and power consumption of a three-dimensional network-on-chip (3D NoC). In the proposed method, all individuals in the population are sorted in non-dominated order and allocated to the corresponding level. Individuals with extreme and similar characteristics are then removed. To increase the diversity of the population and prevent the algorithm from becoming stuck around local optima, a competition strategy is designed for the individuals. Finally, we adopt an elite reservation strategy and update the individuals according to the cloud model. Experimental results show that the proposed algorithm converges to the optimal Pareto solution set rapidly and accurately. This not only obtains the shortest test time, but also optimizes the power consumption of the 3D NoC.
Optimized Autonomous Space In-situ Sensor-Web for volcano monitoring
Song, W.-Z.; Shirazi, B.; Kedar, S.; Chien, S.; Webb, F.; Tran, D.; Davis, A.; Pieri, D.; LaHusen, R.; Pallister, J.; Dzurisin, D.; Moran, S.; Lisowski, M.
2008-01-01
In response to NASA's announced requirement for Earth hazard monitoring sensor-web technology, a multidisciplinary team involving sensor-network experts (Washington State University), space scientists (JPL), and Earth scientists (USGS Cascade Volcano Observatory (CVO)), is developing a prototype dynamic and scaleable hazard monitoring sensor-web and applying it to volcano monitoring. The combined Optimized Autonomous Space -In-situ Sensor-web (OASIS) will have two-way communication capability between ground and space assets, use both space and ground data for optimal allocation of limited power and bandwidth resources on the ground, and use smart management of competing demands for limited space assets. It will also enable scalability and seamless infusion of future space and in-situ assets into the sensor-web. The prototype will be focused on volcano hazard monitoring at Mount St. Helens, which has been active since October 2004. The system is designed to be flexible and easily configurable for many other applications as well. The primary goals of the project are: 1) integrating complementary space (i.e., Earth Observing One (EO-1) satellite) and in-situ (ground-based) elements into an interactive, autonomous sensor-web; 2) advancing sensor-web power and communication resource management technology; and 3) enabling scalability for seamless infusion of future space and in-situ assets into the sensor-web. To meet these goals, we are developing: 1) a test-bed in-situ array with smart sensor nodes capable of making autonomous data acquisition decisions; 2) efficient self-organization algorithm of sensor-web topology to support efficient data communication and command control; 3) smart bandwidth allocation algorithms in which sensor nodes autonomously determine packet priorities based on mission needs and local bandwidth information in real-time; and 4) remote network management and reprogramming tools. The space and in-situ control components of the system will be integrated such that each element is capable of autonomously tasking the other. Sensor-web data acquisition and dissemination will be accomplished through the use of the Open Geospatial Consortium Sensorweb Enablement protocols. The three-year project will demonstrate end-to-end system performance with the in-situ test-bed at Mount St. Helens and NASA's EO-1 platform. ??2008 IEEE.
Trading a Problem-solving Task
NASA Astrophysics Data System (ADS)
Matsubara, Shigeo
This paper focuses on a task allocation problem, especially cases where the task is to find a solution in a search problem or a constraint satisfaction problem. If the search problem is hard to solve, a contractor may fail to find a solution. Here, the more computational resources such as the CPU time the contractor invests in solving the search problem, the more a solution is likely to be found. This brings about a new problem that a contractee has to find an appropriate level of the quality in a task achievement as well as to find an efficient allocation of a task among contractors. For example, if the contractee asks the contractor to find a solution with certainty, the payment from the contractee to the contractor may exceed the contractee's benefit from obtaining a solution, which discourages the contractee from trading a task. However, solving this problem is difficult because the contractee cannot ascertain the contractor's problem-solving ability such as the amount of available resources and knowledge (e.g. algorithms, heuristics) or monitor what amount of resources are actually invested in solving the allocated task. To solve this problem, we propose a task allocation mechanism that is able to choose an appropriate level of the quality in a task achievement and prove that this mechanism guarantees that each contractor reveals its true information. Moreover, we show that our mechanism can increase the contractee's utility compared with a simple auction mechanism by using computer simulation.
NASA Astrophysics Data System (ADS)
Intarasothonchun, Silada; Thipchaksurat, Sakchai; Varakulsiripunth, Ruttikorn; Onozato, Yoshikuni
In this paper, we propose a modified scheme of MSODB and PMS, called Predictive User Mobility Behavior (PUMB) to improve performance of resource reservation and call admission control for cellular networks. This algorithm is proposed in which bandwidth is allocated more efficiently to neighboring cells by key mobility parameters in order to provide QoS guarantees for transferring traffic. The probability is used to form a cluster of cells and the shadow cluster, where a mobile unit is likely to visit. When a mobile unit may change the direction and migrate to the cell that does not belong to its shadow cluster, we can support it by making efficient use of predicted nonconforming call. Concomitantly, to ensure continuity of on-going calls with better utilization of resources, bandwidth is borrowed from predicted nonconforming calls and existing adaptive calls without affecting the minimum QoS guarantees. The performance of the PUMB is demonstrated by simulation results in terms of new call blocking probability, handoff call dropping probability, bandwidth utilization, call successful probability, and overhead message transmission when arrival rate and speed of mobile units are varied. Our results show that PUMB provides the better performances comparing with those of MSODB and PMS under different traffic conditions.
Competition in decentralized electricity markets: Three papers on electricity auctions
NASA Astrophysics Data System (ADS)
Harbord, David William Cameron
This thesis consists of three self-contained papers on the analysis of electricity auctions written over a period of twelve years. The first paper models price competition in a decentralized wholesale market for electricity as a first-price, sealed-bid, multi-unit auction. In both the pure and mixed-strategy equilibria of the model, above marginal cost pricing and inefficient despatch of generating units occur. An alternative regulatory pricing rule is considered and it is shown that offering to supply at marginal cost can be induced as a dominant strategy for all firms. The second paper analyses strategic interaction between long-term contracts and price competition in the British electricity wholesale market, and confirms that forward contracts will tend to put downward pressure on spot market prices. A 'strategic commitment' motive for selling forward contracts is also identified: a generator may commit itself to bidding lower prices into the spot market in order to ensure that it will be despatched with its full capacity. The third paper characterizes bidding behavior and market outcomes in uniform and discriminatory electricity auctions. Uniform auctions result in higher average prices than discriminatory auctions, but the ranking in terms of productive efficiency is ambiguous. The comparative effects of other market design features, such as the number of steps in suppliers' bid functions, the duration of bids and the elasticity of demand are analyzed. The paper also clarifies some methodological issues in the analysis of electricity auctions. In particular we show that analogies with continuous share auctions are misplaced so long as firms are restricted to a finite number of bids.
Hatipkarasulu, Yilmaz; Gill, James H
2004-04-01
The increasing number of companies providing internet services and auction tools helped popularize the online reverse auction trend for purchasing commodities and services in the last decade. As a result, a number of owners, both public and private, accepted the online reverse auctions as the bidding technique for their construction projects. Owners, while trying to minimize their costs for construction projects, are also required to address their ethical responsibilities to the shareholders. In the case of online reverse auctions for construction projects, the ethical issues involved in the bidding technique directly reflects on the owner's ethical and social responsibilities to their shareholders. The goal of this paper is to identify the shareholder ethics and responsibilities in online reverse auctions for construction projects by analyzing the ethical issues for the parties involved in the process. The identification of the ethical issues and responsibilities requires clear definition and understanding of professional ethics and the roles of the involved parties. In this paper, first, the concept of professional ethics and social responsibility is described in a general form. To illustrate the ethical issues and responsibilities, a sample case of bidding for a construction project using online reverse auction techniques is presented in which the shareholders were actively involved in questioning the ethical issues. The issues involved in the bidding process and their reflection on the shareholder responsibilities are described and analyzed for each stage of the process. A brief discussion of the overall process is also included to address the general ethical issues involved in online reverse auctions.
Autonomous Guidance Strategy for Spacecraft Formations and Reconfiguration Maneuvers
NASA Astrophysics Data System (ADS)
Wahl, Theodore P.
A guidance strategy for autonomous spacecraft formation reconfiguration maneuvers is presented. The guidance strategy is presented as an algorithm that solves the linked assignment and delivery problems. The assignment problem is the task of assigning the member spacecraft of the formation to their new positions in the desired formation geometry. The guidance algorithm uses an auction process (also called an "auction algorithm''), presented in the dissertation, to solve the assignment problem. The auction uses the estimated maneuver and time of flight costs between the spacecraft and targets to create assignments which minimize a specific "expense'' function for the formation. The delivery problem is the task of delivering the spacecraft to their assigned positions, and it is addressed through one of two guidance schemes described in this work. The first is a delivery scheme based on artificial potential function (APF) guidance. APF guidance uses the relative distances between the spacecraft, targets, and any obstacles to design maneuvers based on gradients of potential fields. The second delivery scheme is based on model predictive control (MPC); this method uses a model of the system dynamics to plan a series of maneuvers designed to minimize a unique cost function. The guidance algorithm uses an analytic linearized approximation of the relative orbital dynamics, the Yamanaka-Ankersen state transition matrix, in the auction process and in both delivery methods. The proposed guidance strategy is successful, in simulations, in autonomously assigning the members of the formation to new positions and in delivering the spacecraft to these new positions safely using both delivery methods. This guidance algorithm can serve as the basis for future autonomous guidance strategies for spacecraft formation missions.
30 CFR 285.220 - What auction format may MMS use in a lease sale?
Code of Federal Regulations, 2010 CFR
2010-07-01
... OFFSHORE RENEWABLE ENERGY ALTERNATE USES OF EXISTING FACILITIES ON THE OUTER CONTINENTAL SHELF Issuance of OCS Renewable Energy Leases Competitive Lease Award Process § 285.220 What auction format may MMS use... renewable energy leases and will use one of the following auction formats, as determined through the lease...
30 CFR 285.220 - What auction format may MMS use in a lease sale?
Code of Federal Regulations, 2011 CFR
2011-07-01
... ENFORCEMENT, DEPARTMENT OF THE INTERIOR OFFSHORE RENEWABLE ENERGY ALTERNATE USES OF EXISTING FACILITIES ON THE OUTER CONTINENTAL SHELF Issuance of OCS Renewable Energy Leases Competitive Lease Award Process § 285... competitive auctions to award renewable energy leases and will use one of the following auction formats, as...
30 CFR 585.220 - What auction format may BOEM use in a lease sale?
Code of Federal Regulations, 2014 CFR
2014-07-01
... INTERIOR OFFSHORE RENEWABLE ENERGY AND ALTERNATE USES OF EXISTING FACILITIES ON THE OUTER CONTINENTAL SHELF Issuance of OCS Renewable Energy Leases Competitive Lease Award Process § 585.220 What auction format may... award renewable energy leases and will use one of the following auction formats, as determined through...
30 CFR 585.220 - What auction format may BOEM use in a lease sale?
Code of Federal Regulations, 2013 CFR
2013-07-01
... INTERIOR OFFSHORE RENEWABLE ENERGY AND ALTERNATE USES OF EXISTING FACILITIES ON THE OUTER CONTINENTAL SHELF Issuance of OCS Renewable Energy Leases Competitive Lease Award Process § 585.220 What auction format may... award renewable energy leases and will use one of the following auction formats, as determined through...
30 CFR 585.220 - What auction format may BOEM use in a lease sale?
Code of Federal Regulations, 2012 CFR
2012-07-01
... INTERIOR OFFSHORE RENEWABLE ENERGY AND ALTERNATE USES OF EXISTING FACILITIES ON THE OUTER CONTINENTAL SHELF Issuance of OCS Renewable Energy Leases Competitive Lease Award Process § 585.220 What auction format may... award renewable energy leases and will use one of the following auction formats, as determined through...
9 CFR 2.76 - Records: Operators of auction sales and brokers.
Code of Federal Regulations, 2011 CFR
2011-01-01
... 9 Animals and Animal Products 1 2011-01-01 2011-01-01 false Records: Operators of auction sales and brokers. 2.76 Section 2.76 Animals and Animal Products ANIMAL AND PLANT HEALTH INSPECTION SERVICE, DEPARTMENT OF AGRICULTURE ANIMAL WELFARE REGULATIONS Records § 2.76 Records: Operators of auction sales and...
9 CFR 2.76 - Records: Operators of auction sales and brokers.
Code of Federal Regulations, 2013 CFR
2013-01-01
... 9 Animals and Animal Products 1 2013-01-01 2013-01-01 false Records: Operators of auction sales and brokers. 2.76 Section 2.76 Animals and Animal Products ANIMAL AND PLANT HEALTH INSPECTION SERVICE, DEPARTMENT OF AGRICULTURE ANIMAL WELFARE REGULATIONS Records § 2.76 Records: Operators of auction sales and...
9 CFR 2.76 - Records: Operators of auction sales and brokers.
Code of Federal Regulations, 2012 CFR
2012-01-01
... 9 Animals and Animal Products 1 2012-01-01 2012-01-01 false Records: Operators of auction sales and brokers. 2.76 Section 2.76 Animals and Animal Products ANIMAL AND PLANT HEALTH INSPECTION SERVICE, DEPARTMENT OF AGRICULTURE ANIMAL WELFARE REGULATIONS Records § 2.76 Records: Operators of auction sales and...
Are Structural Estimates of Auction Models Reasonable? Evidence from Experimental Data
ERIC Educational Resources Information Center
Bajari, Patrick; Hortacsu, Ali
2005-01-01
Recently, economists have developed methods for structural estimation of auction models. Many researchers object to these methods because they find the strict rationality assumptions to be implausible. Using bid data from first-price auction experiments, we estimate four alternative structural models: (1) risk-neutral Bayes-Nash, (2) risk-averse…
Federal Register 2010, 2011, 2012, 2013, 2014
2012-09-17
... Change Relating to Complex Order Auctions September 11, 2012. Pursuant to Section 19(b)(1) of the... of the Proposed Rule Change The Exchange proposed to amend its Rules regarding complex order auctions... Exchange may activate the electronic complex order request for responses (``RFR'') auction (``COA''), which...
Sold! The Elementary Classroom Auction as Learning Tool of Communication and Economics
ERIC Educational Resources Information Center
Boyd, Josh; Boyd, Gina
2014-01-01
An auction, though an economic tool, is essentially a performance dependent on communication (Smith, 1989). The auctioneer dictates the pace, asks for bids, and acknowledges responses; the enterprise is controlled by a voice (Boyce, 2001). Bidders must listen and respond strategically to the communication of the people around them. An auction…
Federal Register 2010, 2011, 2012, 2013, 2014
2011-12-30
... (2) a non-price specific commitment to auto- match all Auction responses achieved during the Auction... price responses, leading to more robust competition in AIM. \\16\\ See supra note 3; see also Securities... enhance competition in the AIM Auctions and provide customers with additional opportunities for price...
ERIC Educational Resources Information Center
Williams, Jacqueline A.; Dobie, Kathryn
2011-01-01
Electronic reverse auctions are increasingly being used by firms to improve firm financial and operational performance. The described teaching innovation serves as a model for introducing electronic reverse auctions as a central element in a comprehensive negotiation exercise involving sales management and purchasing management students. Results…
Competitive Bidding in a Certain Class of Auctions
NASA Astrophysics Data System (ADS)
Johansson, Mathias
2006-11-01
We consider the problem of determining the amount to bid in a certain type of auctions in which customers submit one sealed bid. The bid reflects the price a customer is willing to pay for one unit of the offered goods. The auction is repeated and at each auction each customer requests a certain amount of goods, an amount that we call the capacity of the customer and that varies among customers and over time. At each auction, only the customer with the largest bid-capacity product obtains any goods. The price paid by the winner equals his/her bid-capacity product, and the amount of goods obtained in return equals the winner's capacity. The auction is repeated many times, with only limited information concerning winning bid-capacity products being announced to the customers. This situation is motivated in for example wireless communication networks in which a possible way of obtaining a desired service level is to use dynamic pricing and competitive bidding. In this application, the capacity is typically uncertain when the bid is made. We derive bidding rules and loss functions for a few typical service requirements.
NASA Astrophysics Data System (ADS)
Honari, Sina; Fos-Hati, Amin; Ebadi, Mojtaba; Gomrokchi, Maziar
As there is a growing tendency towards online auctions, online Multi Agent Systems for economic activities like stock exchanges is more in demand. CAT (CATallactics) competition has produced a great opportunity for researchers since 2007 to put their theories into practice in a real-time economic-based competition, combining traders and brokers. As one of participants, we evaluated our new accepting policy by putting it to challenge. In this paper we give a general overview of one of our policies in the market.
Ergodic Transition in a Simple Model of the Continuous Double Auction
Radivojević, Tijana; Anselmi, Jonatha; Scalas, Enrico
2014-01-01
We study a phenomenological model for the continuous double auction, whose aggregate order process is equivalent to two independent queues. The continuous double auction defines a continuous-time random walk for trade prices. The conditions for ergodicity of the auction are derived and, as a consequence, three possible regimes in the behavior of prices and logarithmic returns are observed. In the ergodic regime, prices are unstable and one can observe a heteroskedastic behavior in the logarithmic returns. On the contrary, non-ergodicity triggers stability of prices, even if two different regimes can be seen. PMID:24558377
Ergodic transition in a simple model of the continuous double auction.
Radivojević, Tijana; Anselmi, Jonatha; Scalas, Enrico
2014-01-01
We study a phenomenological model for the continuous double auction, whose aggregate order process is equivalent to two independent M/M/1 queues. The continuous double auction defines a continuous-time random walk for trade prices. The conditions for ergodicity of the auction are derived and, as a consequence, three possible regimes in the behavior of prices and logarithmic returns are observed. In the ergodic regime, prices are unstable and one can observe a heteroskedastic behavior in the logarithmic returns. On the contrary, non-ergodicity triggers stability of prices, even if two different regimes can be seen.
Emerging behavior in electronic bidding.
Yang, I; Jeong, H; Kahng, B; Barabási, A-L
2003-07-01
We characterize the statistical properties of a large number of agents on two major online auction sites. The measurements indicate that the total number of bids placed in a single category and the number of distinct auctions frequented by a given agent follow power-law distributions, implying that a few agents are responsible for a significant fraction of the total bidding activity on the online market. We find that these agents exert an unproportional influence on the final price of the auctioned items. This domination of online auctions by an unusually active minority may be a generic feature of all online mercantile processes.
Emerging behavior in electronic bidding
NASA Astrophysics Data System (ADS)
Yang, I.; Jeong, H.; Kahng, B.; Barabási, A.-L.
2003-07-01
We characterize the statistical properties of a large number of agents on two major online auction sites. The measurements indicate that the total number of bids placed in a single category and the number of distinct auctions frequented by a given agent follow power-law distributions, implying that a few agents are responsible for a significant fraction of the total bidding activity on the online market. We find that these agents exert an unproportional influence on the final price of the auctioned items. This domination of online auctions by an unusually active minority may be a generic feature of all online mercantile processes.
Least loaded and route fragmentation aware RSA strategies for elastic optical networks
NASA Astrophysics Data System (ADS)
Batham, Deepak; Yadav, Dharmendra Singh; Prakash, Shashi
2017-12-01
Elastic optical networks (EONs) provide flexibility to assign wide range of spectral resources to the connection requests. In this manuscript, we address two issues related to spectrum assignment in EONs: the non uniform spectrum assignment along different links of the route and the spectrum fragmentation in the network. To address these issues, two routing and spectrum assignment (RSA) strategies have been proposed: Least Loaded RSA (LLRSA) and Route Fragmentation Aware RSA (RFARSA). The LLRSA allocates spectrum homogeneously along different links in the network, where as RFARSA accords priority to the routes which are less fragmented. To highlight the salient features of the two strategies, two new metrics, route fragmentation index (RFI) and standard deviation (SD) are introduced. RFI is defined as the ratio of non-contiguous FSs to the total available free FSs on the route, and SD relates to the measure of non-uniformity in the allocation of resources on the links in the network. A simulation program has been developed to evaluate the performance of the proposed (LLRSA and RFARSA) strategies, and the existing strategies of shortest path RSA (SPRSA) and spectrum compactness based defragmentation (SCD) strategies, on the metric of RFI, bandwidth blocking probability (BBP), network capacity utilized, and SD. The variation in the metrics on the basis of number of requests and the bandwidth (number of FSs) requested has been studied. It has been conclusively established that the proposed strategies (LLRSA and RFARSA) outperform the existing strategies in terms of all the metrics.
Physiological and behavioral patterns of corruption
Jaber-López, Tarek; García-Gallego, Aurora; Perakakis, Pandelis; Georgantzis, Nikolaos
2014-01-01
We study the behavior and emotional arousal of the participants in an experimental auction, leading to an asymmetric social dilemma involving an auctioneer and two bidders. An antisocial transfer (bribe) which is beneficial for the auctioneer (official) is paid, if promised, by the winner of the auction. Some pro-social behavior on both the auctioneers' and the bidders' sides is observed even in the absence of any punishment mechanism (Baseline, Treatment 0). However, pro-social behavior is adopted by the vast majority of subjects when the loser of the auction can inspect the transaction between the winner and the auctioneer (Inspection, Treatment 1). The inspection and punishment mechanism is such that, if a bribe is (not) revealed, both corrupt agents (the denouncing bidder) lose(s) this period's payoffs. This renders the inspection option unprofitable for the loser and is rarely used, especially toward the end of the session, when pro-social behavior becomes pervasive. Subjects' emotional arousal was obtained through skin conductance responses. Generally speaking, our findings suggest that stronger emotions are associated with decisions deviating from pure monetary reward maximization, rather than with (un)ethical behavior per se. In fact, using response times as a measure of the subject's reflection during the decision-making process, we can associate emotional arousal with the conflict between primary or instinctive and secondary or contemplative motivations and, more specifically, with deviations from the subject's pure monetary interest. PMID:25566002
Physiological and behavioral patterns of corruption.
Jaber-López, Tarek; García-Gallego, Aurora; Perakakis, Pandelis; Georgantzis, Nikolaos
2014-01-01
We study the behavior and emotional arousal of the participants in an experimental auction, leading to an asymmetric social dilemma involving an auctioneer and two bidders. An antisocial transfer (bribe) which is beneficial for the auctioneer (official) is paid, if promised, by the winner of the auction. Some pro-social behavior on both the auctioneers' and the bidders' sides is observed even in the absence of any punishment mechanism (Baseline, Treatment 0). However, pro-social behavior is adopted by the vast majority of subjects when the loser of the auction can inspect the transaction between the winner and the auctioneer (Inspection, Treatment 1). The inspection and punishment mechanism is such that, if a bribe is (not) revealed, both corrupt agents (the denouncing bidder) lose(s) this period's payoffs. This renders the inspection option unprofitable for the loser and is rarely used, especially toward the end of the session, when pro-social behavior becomes pervasive. Subjects' emotional arousal was obtained through skin conductance responses. Generally speaking, our findings suggest that stronger emotions are associated with decisions deviating from pure monetary reward maximization, rather than with (un)ethical behavior per se. In fact, using response times as a measure of the subject's reflection during the decision-making process, we can associate emotional arousal with the conflict between primary or instinctive and secondary or contemplative motivations and, more specifically, with deviations from the subject's pure monetary interest.
Federal Register 2010, 2011, 2012, 2013, 2014
2012-04-16
... FEDERAL MARITIME COMMISSION [Docket No. 12-03] The Auction Block Company, an Alaska Corporation v. the City of Homer, a Municipal Corporation and Its Port of Homer; Notice of Filing of Complaint and...) by The Auction Block Company, an Alaska Corporation, hereinafter ``Complainant,'' against the City of...
Federal Register 2010, 2011, 2012, 2013, 2014
2011-06-07
..., specifically a Complex Order Live Auction (``COLA'').\\5\\ The Exchange is not amending the Rebate for Adding... (collectively ``Other Auctions''). \\5\\ COLA is the automated Complex Order Live Auction process. A COLA may take place upon identification of the existence of a COLA- eligible order either: (1) Following a COOP, or (2...
Federal Register 2010, 2011, 2012, 2013, 2014
2011-10-18
... Customers in Section 1c is $0.07 per executed contract for all non-PIP transactions. The Exchange proposes to amend Section 1c to expand this applicable fee to all non-Auction Transactions and define the term ``Auction Transactions'' to include all transactions executed through PIP, the Solicitation Auction...
Land Sales - Division of Mining, Land, and Water
to Alaska Land Sales Public Notices Residential Land Auction #484 Agricultural Land Auction #485 Over for sale Agricultural Land Auction (#485)Open until June 7th This program allows anyone (resident or non-resident) to bid on a parcel of agricultural land. Agricultural land has covenants and conditions
Federal Register 2010, 2011, 2012, 2013, 2014
2013-02-15
... investigating and evaluating all technical and marketplace factors that may have a bearing on the value of the... cooperate, collaborate, or communicate, including discussing bids, bidding strategies, or post-auction... schedule in order to foster an auction pace that reasonably balances speed with the bidders' need to study...
ERIC Educational Resources Information Center
Current, Cheris Brewer; Tillotson, Emily
2018-01-01
This paper follows one small, Christian university's five-year experience with student charity date auctions. The contemporary re-emergence of date auctions represents a backlash against gender and racial progress. Student leaders believe that in a post-racial and post-sexist society, race and gender are decontextualised neutral elements of…
Federal Register 2010, 2011, 2012, 2013, 2014
2012-10-30
... Relating to the Complex Order Auction Process October 24, 2012. I. Introduction On August 30, 2012, the... Complex Order RFR Auction,'' to: (i) Include the side of the market in the request for response (``RFR'') message sent to Trading Permit Holders at the start of a Complex Order Auction (``COA''); and (ii) require...
Understanding Overbidding: Using the Neural Circuitry of Reward to Design Economic Auctions
Delgado, Mauricio R.; Schotter, Andrew; Ozbay, Erkut Y.; Phelps, Elizabeth A.
2011-01-01
We take advantage of our knowledge of the neural circuitry of reward to investigate a puzzling economic phenomenon: Why do people overbid in auctions? Using functional magnetic resonance imaging (fMRI), we observed that the social competition inherent in an auction results in a more pronounced blood oxygen level–dependent (BOLD) response to loss in the striatum, with greater overbidding correlated with the magnitude of this response. Leveraging these neuroimaging results, we design a behavioral experiment that demonstrates that framing an experimental auction to emphasize loss increases overbidding. These results highlight a role for the contemplation of loss in understanding the tendency to bid “too high.” Current economic theories suggest overbidding may result from either “joy of winning” or risk aversion. By combining neuroeconomic and behavioral economic techniques, we find that another factor, namely loss contemplation in a social context, may mediate overbidding in auctions. PMID:18818362
Understanding overbidding: using the neural circuitry of reward to design economic auctions.
Delgado, Mauricio R; Schotter, Andrew; Ozbay, Erkut Y; Phelps, Elizabeth A
2008-09-26
We take advantage of our knowledge of the neural circuitry of reward to investigate a puzzling economic phenomenon: Why do people overbid in auctions? Using functional magnetic resonance imaging (fMRI), we observed that the social competition inherent in an auction results in a more pronounced blood oxygen level-dependent (BOLD) response to loss in the striatum, with greater overbidding correlated with the magnitude of this response. Leveraging these neuroimaging results, we design a behavioral experiment that demonstrates that framing an experimental auction to emphasize loss increases overbidding. These results highlight a role for the contemplation of loss in understanding the tendency to bid "too high." Current economic theories suggest overbidding may result from either "joy of winning" or risk aversion. By combining neuroeconomic and behavioral economic techniques, we find that another factor, namely loss contemplation in a social context, may mediate overbidding in auctions.
Zhuge, Qunbi; Morsy-Osman, Mohamed; Chagnon, Mathieu; Xu, Xian; Qiu, Meng; Plant, David V
2014-02-10
In this paper, we propose a low-complexity format-transparent digital signal processing (DSP) scheme for next generation flexible and energy-efficient transceiver. It employs QPSK symbols as the training and pilot symbols for the initialization and tracking stage of the receiver-side DSP, respectively, for various modulation formats. The performance is numerically and experimentally evaluated in a dual polarization (DP) 11 Gbaud 64QAM system. Employing the proposed DSP scheme, we conduct a system-level study of Tb/s bandwidth-adaptive superchannel transmissions with flexible modulation formats including QPSK, 8QAM and 16QAM. The spectrum bandwidth allocation is realized in the digital domain instead of turning on/off sub-channels, which improves the performance of higher order QAM. Various transmission distances ranging from 240 km to 6240 km are demonstrated with a colorless detection for hardware complexity reduction.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Ramamurthy, Byravamurthy
2014-05-05
In this project, developed scheduling frameworks for dynamic bandwidth demands for large-scale science applications. In particular, we developed scheduling algorithms for dynamic bandwidth demands in this project. Apart from theoretical approaches such as Integer Linear Programming, Tabu Search and Genetic Algorithm heuristics, we have utilized practical data from ESnet OSCARS project (from our DOE lab partners) to conduct realistic simulations of our approaches. We have disseminated our work through conference paper presentations and journal papers and a book chapter. In this project we addressed the problem of scheduling of lightpaths over optical wavelength division multiplexed (WDM) networks. We published severalmore » conference papers and journal papers on this topic. We also addressed the problems of joint allocation of computing, storage and networking resources in Grid/Cloud networks and proposed energy-efficient mechanisms for operatin optical WDM networks.« less
Multi-unit auctions with budget-constrained bidders
NASA Astrophysics Data System (ADS)
Ghosh, Gagan Pratap
In my dissertation, I investigate the effects of budget-constraints in multi-unit auctions. This is done in three parts. First, I analyze a case where all bidders have a common budget constraint. Precisely, I analyze an auction where two units of an object are sold at two simultaneous, sealed bid, first-price auctions, to bidders who have demand for both units. Bidders differ with respect to their valuations for the units. All bidders have an identical budget constraint which binds their ability to spend in the auction. I show that if valuation distribution is atom-less, then their does not exist any symmetric equilibrium in this auction game. In the second and third parts of my thesis, I analyze the sale of licenses for the right to drill for oil and natural gas in the Outer Continental Shelf (OCS) of the United States. These sales are conducted using simultaneous sealed-bid first-price auctions for multiple licenses, each representing a specific area (called a tract). Using aspects of observed bidding-behavior, I first make a prima facie case that bidders are budget-constrained in these auctions. In order to formalize this argument, I develop a simple extension of the standard model (where bidders differ in their valuations for the objects) by incorporating (random) budgets for the bidders. The auction-game then has a two-dimensional set of types for each player. I study the theoretical properties of this auction, assuming for simplicity that two units are being sold. I show that this game has an equilibrium in pure strategies that is symmetric with respect to the players and with respect to the units. The strategies are essentially pure in the sense that each bidder-type has a unique split (up to a permutation) of his budget between the two auctions. I then characterize the equilibrium in terms of the bid-distribution and iso-bid curves in the value-budget space. I derive various qualitative features of this equilibrium, among which are: (1) under mild assumptions, there always exist bidder-types who submit unequal bids in equilibrium, (2) the equilibrium is monotonic in the sense that bidders with higher valuations prefer more unequal splits of their budgets than bidders with lower valuations and the same budget-level. With a formal theory in place, I carry out a quantitative exercise, using data from the 1970 OCS auction. I show that the model is able to match many aspects of the data. (1) In the data, the number of tracts bidders submit bids on is positively correlated with budgets (an R2 of 0.84), even though this relationship is non-monotonic; my model is able to capture this non-monotonicity, while producing an R2 of 0.89 (2) In the data, the average number of bids per tract is 8.21; for the model, this number is 10.09. (3) Auction revenue in the data was 1.927 billion; the model produced a mean revenue of 1.944 billion.
Asynchronous Incremental Stochastic Dual Descent Algorithm for Network Resource Allocation
NASA Astrophysics Data System (ADS)
Bedi, Amrit Singh; Rajawat, Ketan
2018-05-01
Stochastic network optimization problems entail finding resource allocation policies that are optimum on an average but must be designed in an online fashion. Such problems are ubiquitous in communication networks, where resources such as energy and bandwidth are divided among nodes to satisfy certain long-term objectives. This paper proposes an asynchronous incremental dual decent resource allocation algorithm that utilizes delayed stochastic {gradients} for carrying out its updates. The proposed algorithm is well-suited to heterogeneous networks as it allows the computationally-challenged or energy-starved nodes to, at times, postpone the updates. The asymptotic analysis of the proposed algorithm is carried out, establishing dual convergence under both, constant and diminishing step sizes. It is also shown that with constant step size, the proposed resource allocation policy is asymptotically near-optimal. An application involving multi-cell coordinated beamforming is detailed, demonstrating the usefulness of the proposed algorithm.
75 FR 56494 - High-Cost Universal Service Support and Federal-State Joint Board on Universal Service
Federal Register 2010, 2011, 2012, 2013, 2014
2010-09-16
... Wireless Services. In 2008, the Commission conducted the auction of Advanced Wireless Services (``AWS'') licenses. This auction, which as designated as Auction 78, offered 35 licenses in the AWS 1710-1755 MHz and 2110-2155 MHz bands (``AWS-1''). The AWS-1 licenses were licenses for which there were no winning bids...
Model of Auctioneer Estimation of Swordtip Squid (Loligo edulis) Quality
NASA Astrophysics Data System (ADS)
Nakamura, Makoto; Matsumoto, Keisuke; Morimoto, Eiji; Ezoe, Satoru; Maeda, Toshimichi; Hirano, Takayuki
The knowledge of experienced auctioneers regarding the circulation of marine products is an essential skill and is necessary for evaluating product quality and managing aspects such as freshness. In the present study, the ability of an auctioneer to quickly evaluate the freshness of swordtip squid (Loligo edulis) at fish markets was analyzed. Evaluation characteristics used by an auctioneer were analyzed and developed using a fuzzy logic model. Forty boxes containing 247 swordtip squid with mantles measuring 220 mm that had been evaluated and assigned to one of five quality categories by an auctioneer were used for the analysis and the modeling. The relationships between the evaluations of appearance, body color, and muscle freshness were statistically analyzed. It was found that a total of four indexes of the epidermis color strongly reflected evaluations of appearance: dispersion ratio of the head, chroma on the head-end mantle and the difference in the chroma and brightness of the mantle. The fuzzy logic model used these indexes for the antecedent-part of the linguistic rules. The results of both simulation and evaluations demonstrate that the model is robust, with the predicted results corresponding with more than 96% of the quality assignments of the auctioneers.
Multiagent model and mean field theory of complex auction dynamics
NASA Astrophysics Data System (ADS)
Chen, Qinghua; Huang, Zi-Gang; Wang, Yougui; Lai, Ying-Cheng
2015-09-01
Recent years have witnessed a growing interest in analyzing a variety of socio-economic phenomena using methods from statistical and nonlinear physics. We study a class of complex systems arising from economics, the lowest unique bid auction (LUBA) systems, which is a recently emerged class of online auction game systems. Through analyzing large, empirical data sets of LUBA, we identify a general feature of the bid price distribution: an inverted J-shaped function with exponential decay in the large bid price region. To account for the distribution, we propose a multi-agent model in which each agent bids stochastically in the field of winner’s attractiveness, and develop a theoretical framework to obtain analytic solutions of the model based on mean field analysis. The theory produces bid-price distributions that are in excellent agreement with those from the real data. Our model and theory capture the essential features of human behaviors in the competitive environment as exemplified by LUBA, and may provide significant quantitative insights into complex socio-economic phenomena.
Federal Register 2010, 2011, 2012, 2013, 2014
2012-11-21
...In the Notice of Proposed Rulemaking, ``Expanding the Economic and Innovation Opportunities of Spectrum Through Incentive Auctions'' (NPRM), released October 2, 2012, the Commission considers matters related to the implementation of Congress's mandate to conduct an incentive auction of broadcast television spectrum as set forth in the Middle Class Tax Relief and Job Creation Act of 2012 (Spectrum Act).
Linking Internet strategy to high-quality, cost-effective managed care.
Beauregard, T R
2000-01-01
This article describes an experimental pilot project incorporating e-commerce and the Internet into the traditional process of health benefit negotiations through the utilization of an HMO Internet auction. The timeline and process of the auction are described, with the final auction taking place during the last week of negotiations. The results reveal an efficient and effective system to augment the traditional benefit negotiation process.
Multiparty Quantum English Auction Scheme Using Single Photons as Message Carrier
NASA Astrophysics Data System (ADS)
Liu, Ge; Zhang, Jian-Zhong; Xie, Shu-Cui
2018-03-01
In this paper, a secure and economic multiparty english auction protocol using the single photons as message carrier of bids is proposed. In order to achieve unconditional security, fairness, undeniability and so on, we adopt the decoy photon checking technique and quantum encryption algorithm. Analysis result shows that our protocol satisfies all the characteristics of traditional english auction, meanwhile, it can resist malicious attacks.
Rosen, Lara; Vining, Aidan R; Weimer, David L
2011-08-01
Transplantation is generally the treatment of choice for those suffering from kidney failure. Not only does transplantation offer improved quality of life and increased longevity relative to dialysis, it also reduces end-stage renal disease program expenditures, providing savings to Medicare. Unfortunately, the waiting list for kidney transplants is long, growing, and unlikely to be substantially reduced by increases in the recovery of cadaveric kidneys. Another approach is to obtain more kidneys through payment to living "donors," or vendors. Such direct commodification, in which a price is placed on kidneys, has generally been opposed by medical ethicists. Much of the ethical debate, however, has been in terms of commodification through market exchange. Recognizing that there are different ethical concerns associated with the purchase of kidneys and their allocation, it is possible to design a variety of institutional arrangements for the commodification of kidneys that pose different sets of ethical concerns. We specify three such alternatives in detail sufficient to allow an assessment of their likely consequences and we compare these alternatives to current policy in terms of the desirable goals of promoting human dignity, equity, efficiency, and fiscal advantage. This policy analysis leads us to recommend that kidneys be purchased at administered prices by a nonprofit organization and allocated to the transplant centers that can organize the longest chains of transplants involving willing-but-incompatible donor-patient dyads.
NASA Astrophysics Data System (ADS)
Zhang, Ke-Jia; Kwek, Leong-Chuan; Ma, Chun-Guang; Zhang, Long; Sun, Hong-Wei
2018-02-01
Quantum sealed-bid auction (QSA) has been widely studied in quantum cryptography. For a successful auction, post-confirmation is regarded as an important mechanism to make every bidder verify the identity of the winner after the auctioneer has announced the result. However, since the auctioneer may be dishonest and collude with malicious bidders in practice, some potential loopholes could exist. In this paper, we point out two types of collusion attacks for a particular post-confirmation technique with EPR pairs. And it is not difficult to see that there exists no unconditionally secure post-confirmation mechanism in the existing QSA model, if the dishonest participants have the ability to control multiparticle entanglement. In the view of this, we note that some secure implementation could exist if the participants are supposed to be semi-quantum, i.e., they can only control single photons. Finally, two potential methods to design post-confirmation mechanism are presented in this restricted scenario.
Bidding Behavior in a Multi-attribute First-price Auction
2010-01-01
of applying key features of the multi-unit auction to proxy buyer /seller marginal valuations of the attributes of a job. Two experiments were...compensation package show promise in ascertaining buyer /seller marginal valuations of a job. This research effort was supported by a grant from the...auctions observed in the goods market, as measured by maximizing consumer and producer surplus, are likely to have promising applications to labor markets
Combinatorial Market Processing for Multilateral Coordination
2005-09-01
8 In the classical auction theory literature, most of the attention is focused on one-sided, single-item auctions [86]. There is now a growing body of...Programming in Infinite-dimensional Spaces: Theory and Applications, Wiley, 1987. [3] K. J. Arrow, “An extension of the basic theorems of classical ...Commodities, Princeton University Press, 1969. [43] D. Friedman and J. Rust, The Double Auction Market: Institutions, Theories, and Evidence, Addison
NASA Technical Reports Server (NTRS)
Smith, E. K.; Reinhart, E. E.
1977-01-01
A study was carried out to identify the optimum uplink and downlink frequencies for audio-bandwidth channels for use by a satellite system distributing social services. The study considered functional-user-need models for five types of social services and identified a general baseline system that is appropriate for most of them. Technical aspects and costs of this system and of the frequency bands that it might use were reviewed, leading to the identification of the 620-790 MHz band as a perferred candidate for both uplink and downlink transmissions for nonmobile applications. The study also led to some ideas as to how to configure the satellite system.
Rizvi, Sanam Shahla; Chung, Tae-Sun
2010-01-01
Flash memory has become a more widespread storage medium for modern wireless devices because of its effective characteristics like non-volatility, small size, light weight, fast access speed, shock resistance, high reliability and low power consumption. Sensor nodes are highly resource constrained in terms of limited processing speed, runtime memory, persistent storage, communication bandwidth and finite energy. Therefore, for wireless sensor networks supporting sense, store, merge and send schemes, an efficient and reliable file system is highly required with consideration of sensor node constraints. In this paper, we propose a novel log structured external NAND flash memory based file system, called Proceeding to Intelligent service oriented memorY Allocation for flash based data centric Sensor devices in wireless sensor networks (PIYAS). This is the extended version of our previously proposed PIYA [1]. The main goals of the PIYAS scheme are to achieve instant mounting and reduced SRAM space by keeping memory mapping information to a very low size of and to provide high query response throughput by allocation of memory to the sensor data by network business rules. The scheme intelligently samples and stores the raw data and provides high in-network data availability by keeping the aggregate data for a longer period of time than any other scheme has done before. We propose effective garbage collection and wear-leveling schemes as well. The experimental results show that PIYAS is an optimized memory management scheme allowing high performance for wireless sensor networks.
Successes and Challenges in the Resale of Alternative Fuel Vehicles: July 2001 - March 2002
DOE Office of Scientific and Technical Information (OSTI.GOV)
Not Available
2002-05-01
This report provides the outcome of Dorfman & O'Neal's effort to examine the resale market for automobiles as it relates to the resale of late-model, original equipment manufacture (OEM), alternative fuel vehicles. Auctions provide an exceptionally rapid, effective, and efficient market for the transfer of property between buyers and sellers at reasonable prices. The first automobile auction in the United States was successful because used cars were in reasonably constant supply, were uniformly packaged, and were easily graded for quality. Also, the auction had sufficient volume to significantly lower the handling and transaction costs for wholesalers and dealers. To thismore » day, the automobile auction industry conducts business primarily with registered wholesalers and dealers. Except for the U.S. General Services Administration (GSA) auctions and some consignment auctions, nearly all automobile auctions are closed to the public. The auction system represents a near-perfect market, validated by the lack of statistical price differences in value of specific model cars between various regions of the country. However, specialty cars may be subject to arbitrage. The buyer purchases the vehicle believing that it can be sold immediately at a profit in another region. A variety of vehicle pricing services are available to serve the consumer and the wholesale automobile industry. Each has a different philosophy for collecting, analyzing, and reporting data. ''The Automobile Lease Guide'' (ALG) is clearly the authority on vehicle residual values. Auction companies continue to apply automated technologies to lower transaction costs. Automated technologies are the only way to track the increasing number of transactions in the growing industry. Nevertheless, people-to-people relationships remain critical to the success of all auction companies. Our assessment is that everyone in the secondary automobile market is aware of alternative fuel vehicles (AFVs) and is interested to watch how the wholesale market for these vehicles may develop. However, none of the industry representatives we interviewed appears to be willing to take a leadership role in this market. Exact figures are not publicly available, but the GSA is probably the largest reseller of bifuel and dedicated compressed natural gas vehicles. These vehicles number in the hundreds; the total number of vehicles disposed by GSA each year is more than 20,000. GSA representatives have stated that bi-fuel vehicles are selling at approximately 80% of Black Book'' national average and dedicated vehicles are selling at 60% of ''Black Book national average compared to gasoline-only vehicles.« less
Roth, Alvin E
2007-10-01
Traditionally, markets have been viewed as simply the confluence of supply and demand. But to function properly, they must be able to attract a sufficient number of buyers and sellers, induce participants to make their preferences clear, and overcome congestion by providing both enough time to make choices and a speedy means of registering them. Solutions to these challenges are the province of market design--a blend of game theory and experimental economics. Roth, a professor of both business and economics at Harvard, is a leading market designer. He and his colleagues have rescued failing markets by, for example, designing labor clearinghouses through which U.S. doctors get their first jobs and auctions through which the Federal Communications Commission sells licenses for parts of the radio broadcast spectrum. They have also created marketlike allocation procedures that involve neither prices nor an exchange of money; these include systems for assigning children to schools in Boston and New York and for facilitating exchanges of kidneys. Computers enable the design of "smart markets" that combine the inputs of users in complex ways: In kidney exchange, they run through every possible match of donors and recipients to arrange the greatest possible number of transplants. In the future, computers may make it possible to auction bundled goods, such as airport takeoff and landing slots. As online markets--like those for jobs and dating--proliferate, a growing understanding of markets in general will provide virtually limitless opportunities for market design.
Economic models for management of resources in peer-to-peer and grid computing
NASA Astrophysics Data System (ADS)
Buyya, Rajkumar; Stockinger, Heinz; Giddy, Jonathan; Abramson, David
2001-07-01
The accelerated development in Peer-to-Peer (P2P) and Grid computing has positioned them as promising next generation computing platforms. They enable the creation of Virtual Enterprises (VE) for sharing resources distributed across the world. However, resource management, application development and usage models in these environments is a complex undertaking. This is due to the geographic distribution of resources that are owned by different organizations or peers. The resource owners of each of these resources have different usage or access policies and cost models, and varying loads and availability. In order to address complex resource management issues, we have proposed a computational economy framework for resource allocation and for regulating supply and demand in Grid computing environments. The framework provides mechanisms for optimizing resource provider and consumer objective functions through trading and brokering services. In a real world market, there exist various economic models for setting the price for goods based on supply-and-demand and their value to the user. They include commodity market, posted price, tenders and auctions. In this paper, we discuss the use of these models for interaction between Grid components in deciding resource value and the necessary infrastructure to realize them. In addition to normal services offered by Grid computing systems, we need an infrastructure to support interaction protocols, allocation mechanisms, currency, secure banking, and enforcement services. Furthermore, we demonstrate the usage of some of these economic models in resource brokering through Nimrod/G deadline and cost-based scheduling for two different optimization strategies on the World Wide Grid (WWG) testbed that contains peer-to-peer resources located on five continents: Asia, Australia, Europe, North America, and South America.
Optical datacenter network employing slotted (TDMA) operation for dynamic resource allocation
NASA Astrophysics Data System (ADS)
Bakopoulos, P.; Tokas, K.; Spatharakis, C.; Patronas, I.; Landi, G.; Christodoulopoulos, K.; Capitani, M.; Kyriakos, A.; Aziz, M.; Reisis, D.; Varvarigos, E.; Zahavi, E.; Avramopoulos, H.
2018-02-01
The soaring traffic demands in datacenter networks (DCNs) are outpacing progresses in CMOS technology, challenging the bandwidth and energy scalability of currently established technologies. Optical switching is gaining traction as a promising path for sustaining the explosive growth of DCNs; however, its practical deployment necessitates extensive modifications to the network architecture and operation, tailored to the technological particularities of optical switches (i.e. no buffering, limitations in radix size and speed). European project NEPHELE is developing an optical network infrastructure that leverages optical switching within a software-defined networking (SDN) framework to overcome the bandwidth and energy scaling challenges of datacenter networks. An experimental validation of the NEPHELE data plane is reported based on commercial off-the-shelf optical components controlled by FPGA boards. To facilitate dynamic allocation of the network resources and perform collision-free routing in a lossless network environment, slotted operation is employed (i.e. using time-division multiple-access - TDMA). Error-free operation of the NEPHELE data plane is verified for 200 μs slots in various scenarios that involve communication between Ethernet hosts connected to custom-designed top-of-rack (ToR) switches, located in the same or in different datacenter pods. Control of the slotted data plane is obtained through an SDN framework comprising an OpenDaylight controller with appropriate add-ons. Communication between servers in the optical-ToR is demonstrated with various routing scenarios, concerning communication between hosts located in the same rack or in different racks, within the same or different datacenter pods. Error-free operation is confirmed for all evaluated scenarios, underpinning the feasibility of the NEPHELE architecture.
TACtic- A Multi Behavioral Agent for Trading Agent Competition
NASA Astrophysics Data System (ADS)
Khosravi, Hassan; Shiri, Mohammad E.; Khosravi, Hamid; Iranmanesh, Ehsan; Davoodi, Alireza
Software agents are increasingly being used to represent humans in online auctions. Such agents have the advantages of being able to systematically monitor a wide variety of auctions and then make rapid decisions about what bids to place in what auctions. They can do this continuously and repetitively without losing concentration. To provide a means of evaluating and comparing (benchmarking) research methods in this area the trading agent competition (TAC) was established. This paper describes the design, of TACtic. Our agent uses multi behavioral techniques at the heart of its decision making to make bidding decisions in the face of uncertainty, to make predictions about the likely outcomes of auctions, and to alter the agent's bidding strategy in response to the prevailing market conditions.
NASA Astrophysics Data System (ADS)
Dubuque, Shaun; Coffman, Thayne; McCarley, Paul; Bovik, A. C.; Thomas, C. William
2009-05-01
Foveated imaging has been explored for compression and tele-presence, but gaps exist in the study of foveated imaging applied to acquisition and tracking systems. Results are presented from two sets of experiments comparing simple foveated and uniform resolution targeting (acquisition and tracking) algorithms. The first experiments measure acquisition performance when locating Gabor wavelet targets in noise, with fovea placement driven by a mutual information measure. The foveated approach is shown to have lower detection delay than a notional uniform resolution approach when using video that consumes equivalent bandwidth. The second experiments compare the accuracy of target position estimates from foveated and uniform resolution tracking algorithms. A technique is developed to select foveation parameters that minimize error in Kalman filter state estimates. Foveated tracking is shown to consistently outperform uniform resolution tracking on an abstract multiple target task when using video that consumes equivalent bandwidth. Performance is also compared to uniform resolution processing without bandwidth limitations. In both experiments, superior performance is achieved at a given bandwidth by foveated processing because limited resources are allocated intelligently to maximize operational performance. These findings indicate the potential for operational performance improvements over uniform resolution systems in both acquisition and tracking tasks.
Designing Two-Layer Optical Networks with Statistical Multiplexing
NASA Astrophysics Data System (ADS)
Addis, B.; Capone, A.; Carello, G.; Malucelli, F.; Fumagalli, M.; Pedrin Elli, E.
The possibility of adding multi-protocol label switching (MPLS) support to transport networks is considered an important opportunity by telecom carriers that want to add packet services and applications to their networks. However, the question that arises is whether it is suitable to have MPLS nodes just at the edge of the network to collect packet traffic from users, or also to introduce MPLS facilities on a subset of the core nodes in order to exploit packet switching flexibility and multiplexing, thus providing induction of a better bandwidth allocation. In this article, we address this complex decisional problem with the support of a mathematical programming approach. We consider two-layer networks where MPLS is overlaid on top of transport networks-synchronous digital hierarchy (SDH) or wavelength division multiplexing (WDM)-depending on the required link speed. The discussions' decisions take into account the trade-off between the cost of adding MPLS support in the core nodes and the savings in the link bandwidth allocation due to the statistical multiplexing and the traffic grooming effects induced by MPLS nodes. The traffic matrix specifies for each point-to-point request a pair of values: a mean traffic value and an additional one. Using this traffic model, the effect of statistical multiplexing on a link allows the allocation of a capacity equal to the sum of all the mean values of the traffic demands routed on the link and only the highest additional one. The proposed approach is suitable to solve real instances in reasonable time.
NASA Astrophysics Data System (ADS)
Song, Fu-Tie; Zhou, Wei-Xing
2010-09-01
The private car license plates issued in Shanghai are bestowed the title of “the most expensive sheet iron all over the world”, more expensive than gold. A citizen has to bid in a monthly auction to obtain a license plate for his new private car. We perform statistical analysis to investigate the influence of the minimal price Pmin of the bidding winners, the quota N of private car license plates, the number N of bidders, as well as two external shocks including the legality debate of the auction in 2004 and the auction regime reform in January 2008 on the average price P of all bidding winners. It is found that the legality debate of the auction had marginal transient impact on the average price in a short time period. In contrast, the change of the auction rules has significant permanent influence on the average price, which reduces the price by about 3020 yuan Renminbi. It means that the average price exhibits nonlinear behaviors with a regime change. The evolution of the average price is independent of the number N of bidders in both regimes. In the early regime before January 2008, the average price P was influenced only by the minimal price Pmin in the preceding month with a positive correlation. In the current regime since January 2008, the average price is positively correlated with the minimal price and the quota in the preceding month and negatively correlated with the quota in the same month. We test the predictive power of the two models using 2-year and 3-year moving windows and find that the latter outperforms the former. It seems that the auction market becomes more efficient after the auction reform since the prediction error increases.
2015-03-01
the cm1·ent program has failed to meet targeted retention across conununities while ove1paying nearly $5,300,000 dming FY-2013, according to Eric...Kelso. This thesis examines the potential improvements of applying unif01m-price auction, Quality Adjusted Discount (QUAD), and Combinatorial Retention ...responses, we developed individual quality scores and reservation prices to apply three auction mechanisms to the retention goals and costs of the
NASA Astrophysics Data System (ADS)
Muslimin, B.; Suadi
2018-03-01
Responsible management of fishery resources has been a tradition of Ogan Komering Ilir (OKI) of South Sumatera for generations. It was recorded that since 1630 the Dutch Government had made auction policy for managing water territory in OKI Regency as an effort to preserve nature and to avoid the conflict of inland water ownership. Currently, the community-based management model has been adopted by local governments into formal regulations, known as Regional Regulation on Auction of Flood Water Swamp and Rivers (Lelang Lebak Lebung dan Sungai or L3S). This paper describes the success factors and the threats for the failure of the L3S management model in OKI Regency, based on a case study in Pangkalan Lampam District. The study showed that the management mechanism through the L3S system had been well instituted and become a well-established management practice. The management model is in line with the principle of co-management and the approach has become critical success factor in L3S management. However, ecological, economic and social aspects influence the sustainability of such fishery management model. Besides, L3S management model faces limited data and information related to fish stocks, which result in difficulties in determining the total allowable catch.
Modelling of auctioning mechanism for solar photovoltaic capacity
NASA Astrophysics Data System (ADS)
Poullikkas, Andreas
2016-10-01
In this work, a modified optimisation model for the integration of renewable energy sources for power-generation (RES-E) technologies in power-generation systems on a unit commitment basis is developed. The purpose of the modified optimisation procedure is to account for RES-E capacity auctions for different solar photovoltaic (PV) capacity electricity prices. The optimisation model developed uses a genetic algorithm (GA) technique for the calculation of the required RES-E levy (or green tax) in the electricity bills. Also, the procedure enables the estimation of the level of the adequate (or eligible) feed-in-tariff to be offered to future RES-E systems, which do not participate in the capacity auctioning procedure. In order to demonstrate the applicability of the optimisation procedure developed the case of PV capacity auctioning for commercial systems is examined. The results indicated that the required green tax, in order to promote the use of RES-E technologies, which is charged to the electricity customers through their electricity bills, is reduced with the reduction in the final auctioning price. This has a significant effect related to the reduction of electricity bills.
Wu, Wann-Yih; Huang, Po-Ching; Fu, Chen-Su
2011-06-01
Online auctions combine the conventional auction model with information technology. However, information asymmetry within such auctions causes risks and uncertainties that influence consumer purchase intentions. In this study, a 2 (product price: high vs. low) × 2 (e-retailer reputation: high vs. low) experimental design was used to understand whether the product price and e-retailer reputation will influence consumers' perceived risk, attitude toward the website and purchase intention. The results of this study indicate that perceived risk negatively influences consumer attitude toward the website and online purchase intention, while consumer attitude toward the website positively influences purchase intention. Moreover, involvement moderates the influence of product price and e-retailer reputation only on social risk but does not have a significant effect on consumer attitude toward the website. This study contributes to a more comprehensive understanding of online auction users' behavior. Finally, the managerial implications, limitations and future research directions are also provided. © 2011 The Authors. Scandinavian Journal of Psychology © 2011 The Scandinavian Psychological Associations.
Ordering competition: the interactional accomplishment of the sale of art and antiques at auction.
Heath, Christian; Luff, Paul
2007-03-01
Auctions provide an institutional solution to a social problem; they enable the legitimate pricing and exchange of goods where those goods are of uncertain value. In turn, auctions raise a number of social and organizational issues that are resolved within the interaction that arise in sales by auction. In this paper, we examine sales of fine art, antiques and objets d'art and explore the ways in which auctioneers mediate competition between buyers and establish a value for goods. In particular, we explore how bids are elicited, co-ordinated and revealed so as to rapidly escalate the price of goods in a transparent manner that enables the legitimate valuation and exchange of goods. In directing attention towards the significance of the social interaction, including talk, visual and material conduct, the paper contributes to the growing corpus of ethnographic studies of markets. It suggests that to understand the operation of markets and their outcomes, and to unpack issues of agency, trust and practice, we need to place the 'interaction order' at the heart of analytic agenda.
Anonymous, Yet Trustworthy Auctions
NASA Astrophysics Data System (ADS)
Chanda, Prasit Bikash; Naessens, Vincent; de Decker, Bart
An auction is an inevitable market mechanism to setup prices of goods or services in a competitive and dynamic environment. Anonymity of bidders is required to conceal their business strategies from competitors. However, it is also essential to provide the seller guarantees that a bidder is trustworthy and competent enough to perform certain tasks (e.g transports). This paper proposes an auction protocol where bidders will participate anonymously, yet prove to be trustworthy and competent and can be held accountable towards auctioneers and sellers. Moreover, the protocol introduces promises, bonuses and compensations to ensure the best price for the sellers, extra profit for bidders and opportunities for newcomers in the business. It also handles ties, and copes with last minute bidding. Finally, the auction’s fair proceedings and outcome can be verified by everyone.
Bidding process in online auctions and winning strategy: Rate equation approach
NASA Astrophysics Data System (ADS)
Yang, I.; Kahng, B.
2006-06-01
Online auctions have expanded rapidly over the last decade and have become a fascinating new type of business or commercial transaction in this digital era. Here we introduce a master equation for the bidding process that takes place in online auctions. We find that the number of distinct bidders who bid k times up to the t th bidding progresses, called the k -frequent bidder, seems to scale as nk(t)˜tk-2.4 . The successfully transmitted bidding rate by the k -frequent bidder is likely to scale as qk(t)˜k-1.4 , independent of t for large t . This theoretical prediction is close to empirical data. These results imply that bidding at the last moment is a rational and effective strategy to win in an eBay auction.
A Self-organized MIMO-OFDM-based Cellular Network
NASA Astrophysics Data System (ADS)
Grünheid, Rainer; Fellenberg, Christian
2012-05-01
This paper presents a system proposal for a self-organized cellular network, which is based on the MIMO-OFDM transmission technique. Multicarrier transmission, combined with appropriate beamforming concepts, yields high bandwidth-efficiency and shows a robust behavior in multipath radio channels. Moreover, it provides a fine and tuneable granularity of space-time-frequency resources. Using a TDD approach and interference measurements in each cell, the Base Stations (BSs) decide autonomously which of the space-time-frequency resource blocks are allocated to the Mobile Terminals (MTs) in the cell, in order to fulfil certain Quality of Service (QoS) parameters. Since a synchronized Single Frequency Network (SFN), i.e., a re-use factor of one is applied, the resource blocks can be shared adaptively and flexibly among the cells, which is very advantageous in the case of a non-uniform MT distribution.
Jim, G K; Booker, C W; Guichon, P T; Schunicht, O C; Wildman, B K; Johnson, J C; Lockwood, P W
1999-01-01
A field trial was performed under commercial feedlot conditions in western Canada to compare the efficacy of florfenicol and tilmicosin for the treatment of undifferentiated fever (UF) in calves that received metaphylactic tilmicosin upon arrival at the feedlot. One thousand and eighty recently weaned, auction market derived, crossbred beef calves suffering from UF were allocated to one of 2 experimental groups as follows: florfenicol, which was intramuscular (i.m.) florfenicol administered at the rate of 20 mg/kg body weight (BW) at the time of allocation (Day 0) and again 48 h later, or tilmicosin, which was subcutaneous (s.c.) tilmicosin administered once at the rate of 10 mg/kg BW on day 0. Five hundred and forty-four animals were allocated to the florfenicol group and 536 animals were allocated to the tilmicosin group. The chronicity, wastage, overall mortality, and bovine respiratory disease (BRD) mortality rates were significantly (P < 0.05) lower in the florfenicol group than in the tilmicosin group. There were no significant (P > or = 0.05) differences in first UF relapse, second UF relapse, hemophilosis mortality, or miscellaneous mortality rates between the florfenicol and tilmicosin groups. Average daily gain (ADG) from arrival at the feedlot to the time of implanting and ADG from allocation to the time of implanting were significantly (P < 0.05) lower in the florfenicol group as compared with the tilmicosin group. There were no significant (P > or = 0.05) differences in arrival weight, allocation weight, implanting weight, or ADG from arrival to allocation between the experimental groups. In the economic analysis, there was an advantage of $18.83 CDN per animal in the florfenicol group. The results of this study indicate that florfenicol is superior to tilmicosin for the treatment of UF because of lower chronicity, wastage, overall mortality, and BRD mortality rates. However, interpretation of these observations must take into consideration the fact that these calves received meta-phylactic tilmicosin upon arrival at the feedlot, which is a standard, cost-effective, management procedure utilized by feedlots in western Canada. PMID:10086218
Statistical Mechanics of Combinatorial Auctions
NASA Astrophysics Data System (ADS)
Galla, Tobias; Leone, Michele; Marsili, Matteo; Sellitto, Mauro; Weigt, Martin; Zecchina, Riccardo
2006-09-01
Combinatorial auctions are formulated as frustrated lattice gases on sparse random graphs, allowing the determination of the optimal revenue by methods of statistical physics. Transitions between computationally easy and hard regimes are found and interpreted in terms of the geometric structure of the space of solutions. We introduce an iterative algorithm to solve intermediate and large instances, and discuss competing states of optimal revenue and maximal number of satisfied bidders. The algorithm can be generalized to the hard phase and to more sophisticated auction protocols.
43 CFR 2546.4 - Public auctions.
Code of Federal Regulations, 2011 CFR
2011-10-01
..., DEPARTMENT OF THE INTERIOR LAND RESOURCE MANAGEMENT (2000) COLOR-OF-TITLE AND OMITTED LANDS Snake River... public auction any lands for which preference-claimants do not qualify for patents under the regulations...
NASA Astrophysics Data System (ADS)
Bernard, John Charles
The objective of this study was to compare the performance of five single sided auctions that could be used in restructured electric power markets across different market sizes in a multiple unit setting. Auction selection would profoundly influence an industry over $200 billion in size in the United States, and the consequences of implementing an inappropriate mechanism would be great. Experimental methods were selected to analyze the auctions. Two rounds of experiments were conducted, the first testing the sealed offer last accepted offer (LAO) and first rejected offer (FRO), and the clock English (ENG) and sealed offer English (SOE) in markets of sizes two and six. The FRO, SOE, and ENG used the same pricing rule. Second round testing was on the LAO, FRO, and the nonuniform price multiple unit Vickrey (MUV) in markets of sizes two, four, and six. Experiments lasted 23 and 75 periods for rounds 1 and 2 respectively. Analysis of variance and contrast analysis were used to examine the data. The four performance measures used were price, efficiency, profits per unit, and supply revelation. Five basic principles were also assessed: no sales at losses, all low cost capacity should be offered and sold, no high cost capacity should sell, and the market should clear. It was expected group size and auction type would affect performance. For all performance measures, group size was a significant variable, with smaller groups showing poorer performance. Auction type was significant only for the efficiency performance measure, where clock auctions outperformed the others. Clock auctions also proved superior for the first four principles. The FRO performed poorly in almost all situations, and should not be a preferred mechanism in any market. The ENG was highly efficient, but expensive for the buyer. The SOE appeared superior to the FRO and ENG. The clock improves efficiency over the FRO while less information kept prices under the ENG. The MUV was superior in revealing costs, but performed less well in other categories. While concerns existed for all the mechanisms investigated, the commonly proposed LAO was the best option for restructured electric power markets.
Learning Based Bidding Strategy for HVAC Systems in Double Auction Retail Energy Markets
DOE Office of Scientific and Technical Information (OSTI.GOV)
Sun, Yannan; Somani, Abhishek; Carroll, Thomas E.
In this paper, a bidding strategy is proposed using reinforcement learning for HVAC systems in a double auction market. The bidding strategy does not require a specific model-based representation of behavior, i.e., a functional form to translate indoor house temperatures into bid prices. The results from reinforcement learning based approach are compared with the HVAC bidding approach used in the AEP gridSMART® smart grid demonstration project and it is shown that the model-free (learning based) approach tracks well the results from the model-based behavior. Successful use of model-free approaches to represent device-level economic behavior may help develop similar approaches tomore » represent behavior of more complex devices or groups of diverse devices, such as in a building. Distributed control requires an understanding of decision making processes of intelligent agents so that appropriate mechanisms may be developed to control and coordinate their responses, and model-free approaches to represent behavior will be extremely useful in that quest.« less
Design and Analysis of Self-Adapted Task Scheduling Strategies in Wireless Sensor Networks
Guo, Wenzhong; Xiong, Naixue; Chao, Han-Chieh; Hussain, Sajid; Chen, Guolong
2011-01-01
In a wireless sensor network (WSN), the usage of resources is usually highly related to the execution of tasks which consume a certain amount of computing and communication bandwidth. Parallel processing among sensors is a promising solution to provide the demanded computation capacity in WSNs. Task allocation and scheduling is a typical problem in the area of high performance computing. Although task allocation and scheduling in wired processor networks has been well studied in the past, their counterparts for WSNs remain largely unexplored. Existing traditional high performance computing solutions cannot be directly implemented in WSNs due to the limitations of WSNs such as limited resource availability and the shared communication medium. In this paper, a self-adapted task scheduling strategy for WSNs is presented. First, a multi-agent-based architecture for WSNs is proposed and a mathematical model of dynamic alliance is constructed for the task allocation problem. Then an effective discrete particle swarm optimization (PSO) algorithm for the dynamic alliance (DPSO-DA) with a well-designed particle position code and fitness function is proposed. A mutation operator which can effectively improve the algorithm’s ability of global search and population diversity is also introduced in this algorithm. Finally, the simulation results show that the proposed solution can achieve significant better performance than other algorithms. PMID:22163971
The Modified Values Auction: A Data Analytic Classroom Game
ERIC Educational Resources Information Center
Miller, Larry D.
1978-01-01
Describes a modified values auction simulation game, reports on three levels of analysis employing actual classroom data (group, subgroup, and individual), and offers suggestions for utilizing values data in social research. (CMV)
DOE Office of Scientific and Technical Information (OSTI.GOV)
Yoo, S.J.Ben; Lauer, Gregory S.
Extreme-science drives the need for distributed exascale processing and communications that are carefully, yet flexibly, managed. Exponential growth of data for scientific simulations, experimental data, collaborative data analyses, remote visualization and GRID computing requirements of scientists in fields as diverse as high energy physics, climate change, genomics, fusion, synchrotron radiation, material science, medicine, and other scientific disciplines cannot be accommodated by simply applying existing transport protocols to faster pipes. Further, scientific challenges today demand diverse research teams, heightening the need for and increasing the complexity of collaboration. To address these issues within the network layer and physical layer, we havemore » performed a number of research activities surrounding effective allocation and management of elastic optical network (EON) resources, particularly focusing on FlexGrid transponders. FlexGrid transponders support the opportunity to build Layer-1 connections at a wide range of bandwidths and to reconfigure them rapidly. The new flexibility supports complex new ways of using the physical layer that must be carefully managed and hidden from the scientist end-users. FlexGrid networks utilize flexible (or elastic) spectral bandwidths for each data link without using fixed wavelength grids. The flexibility in spectrum allocation brings many appealing features to network operations. Current networks are designed for the worst case impairments in transmission performance and the assigned spectrum is over-provisioned. In contrast, the FlexGrid networks can operate with the highest spectral efficiency and minimum bandwidth for the given traffic demand while meeting the minimum quality of transmission (QoT) requirement. Two primary focuses of our research are: (1) resource and spectrum allocation (RSA) for IP traffic over EONs, and (2) RSA for cross-domain optical networks. Previous work concentrates primarily on large file transfers within a single domain. Adding support for IP traffic changes the nature of the RSA problem: instead of choosing to accept or deny each request for network support, IP traffic is inherently elastic and thus lends itself to a bandwidth maximization formulation. We developed a number of algorithms that could be easily deployed within existing and new FlexGrid networks, leading to networks that better support scientific collaboration. Cross-domain RSA research is essential to support large-scale FlexGrid networks, since configuration information is generally not shared or coordinated across domains. The results presented here are in their early stages. They are technically feasible and practical, but still require coordination among organizations and equipment owners and a higher-layer framework for managing network requests.« less
Understanding Financial Market States Using an Artificial Double Auction Market
2016-01-01
The ultimate value of theories describing the fundamental mechanisms behind asset prices in financial systems is reflected in the capacity of such theories to understand these systems. Although the models that explain the various states of financial markets offer substantial evidence from the fields of finance, mathematics, and even physics, previous theories that attempt to address the complexities of financial markets in full have been inadequate. We propose an artificial double auction market as an agent-based model to study the origin of complex states in financial markets by characterizing important parameters with an investment strategy that can cover the dynamics of the financial market. The investment strategies of chartist traders in response to new market information should reduce market stability based on the price fluctuations of risky assets. However, fundamentalist traders strategically submit orders based on fundamental value and, thereby stabilize the market. We construct a continuous double auction market and find that the market is controlled by the proportion of chartists, Pc. We show that mimicking the real state of financial markets, which emerges in real financial systems, is given within the range Pc = 0.40 to Pc = 0.85; however, we show that mimicking the efficient market hypothesis state can be generated with values less than Pc = 0.40. In particular, we observe that mimicking a market collapse state is created with values greater than Pc = 0.85, at which point a liquidity shortage occurs, and the phase transition behavior is described at Pc = 0.85. PMID:27031110
Understanding Financial Market States Using an Artificial Double Auction Market.
Yim, Kyubin; Oh, Gabjin; Kim, Seunghwan
2016-01-01
The ultimate value of theories describing the fundamental mechanisms behind asset prices in financial systems is reflected in the capacity of such theories to understand these systems. Although the models that explain the various states of financial markets offer substantial evidence from the fields of finance, mathematics, and even physics, previous theories that attempt to address the complexities of financial markets in full have been inadequate. We propose an artificial double auction market as an agent-based model to study the origin of complex states in financial markets by characterizing important parameters with an investment strategy that can cover the dynamics of the financial market. The investment strategies of chartist traders in response to new market information should reduce market stability based on the price fluctuations of risky assets. However, fundamentalist traders strategically submit orders based on fundamental value and, thereby stabilize the market. We construct a continuous double auction market and find that the market is controlled by the proportion of chartists, Pc. We show that mimicking the real state of financial markets, which emerges in real financial systems, is given within the range Pc = 0.40 to Pc = 0.85; however, we show that mimicking the efficient market hypothesis state can be generated with values less than Pc = 0.40. In particular, we observe that mimicking a market collapse state is created with values greater than Pc = 0.85, at which point a liquidity shortage occurs, and the phase transition behavior is described at Pc = 0.85.
Competition in the economic crisis: Analysis of procurement auctions.
Gugler, Klaus; Weichselbaumer, Michael; Zulehner, Christine
2015-01-01
We study the effects of the recent economic crisis on firms׳ bidding behavior and markups in sealed bid auctions. Using data from Austrian construction procurements, we estimate bidders׳ construction costs within a private value auction model. We find that markups of all bids submitted decrease by 1.5 percentage points in the recent economic crisis, markups of winning bids decrease by 3.3 percentage points. We also find that without the government stimulus package this decrease would have been larger. These two pieces of evidence point to pro-cyclical markups.
Mechanism Design for Multi-slot Ads Auction in Sponsored Search Markets
NASA Astrophysics Data System (ADS)
Deng, Xiaotie; Sun, Yang; Yin, Ming; Zhou, Yunhong
In this paper, we study pricing models for multi-slot advertisements, where advertisers can bid to place links to their sales webpages at one or multiple slots on a webpage, called the multi-slot AD auction problem. We develop and analyze several important mechanisms, including the VCG mechanism for multi-slot ads auction, the optimal social welfare solution, as well as two weighted GSP-like protocols (mixed and hybrid). Furthermore, we consider that forward-looking Nash equilibrium and prove its existence in the weighted GSP-like pricing protocols.
NASA Astrophysics Data System (ADS)
Wang, Yunyun; Li, Hui; Liu, Yuze; Ji, Yuefeng; Li, Hongfa
2017-10-01
With the development of large video services and cloud computing, the network is increasingly in the form of services. In SDON, the SDN controller holds the underlying physical resource information, thus allocating the appropriate resources and bandwidth to the VON service. However, for some services that require extremely strict QoT (quality of transmission), the shortest distance path algorithm is often unable to meet the requirements because it does not take the link spectrum resources into account. And in accordance with the choice of the most unoccupied links, there may be more spectrum fragments. So here we propose a new RMLSA (the routing, modulation Level, and spectrum allocation) algorithm to reduce the blocking probability. The results show about 40% less blocking probability than the shortest-distance algorithm and the minimum usage of the spectrum priority algorithm. This algorithm is used to satisfy strict request of QoT for demands.
Method and apparatus for telemetry adaptive bandwidth compression
NASA Technical Reports Server (NTRS)
Graham, Olin L.
1987-01-01
Methods and apparatus are provided for automatic and/or manual adaptive bandwidth compression of telemetry. An adaptive sampler samples a video signal from a scanning sensor and generates a sequence of sampled fields. Each field and range rate information from the sensor are hence sequentially transmitted to and stored in a multiple and adaptive field storage means. The field storage means then, in response to an automatic or manual control signal, transfers the stored sampled field signals to a video monitor in a form for sequential or simultaneous display of a desired number of stored signal fields. The sampling ratio of the adaptive sample, the relative proportion of available communication bandwidth allocated respectively to transmitted data and video information, and the number of fields simultaneously displayed are manually or automatically selectively adjustable in functional relationship to each other and detected range rate. In one embodiment, when relatively little or no scene motion is detected, the control signal maximizes sampling ratio and causes simultaneous display of all stored fields, thus maximizing resolution and bandwidth available for data transmission. When increased scene motion is detected, the control signal is adjusted accordingly to cause display of fewer fields. If greater resolution is desired, the control signal is adjusted to increase the sampling ratio.
Shrestha, Bharat; Hossain, Ekram; Camorlinga, Sergio
2011-09-01
In wireless personal area networks, such as wireless body-area sensor networks, stations or devices have different bandwidth requirements and, thus, create heterogeneous traffics. For such networks, the IEEE 802.15.4 medium access control (MAC) can be used in the beacon-enabled mode, which supports guaranteed time slot (GTS) allocation for time-critical data transmissions. This paper presents a general discrete-time Markov chain model for the IEEE 802.15.4-based networks taking into account the slotted carrier sense multiple access with collision avoidance and GTS transmission phenomena together in the heterogeneous traffic scenario and under nonsaturated condition. For this purpose, the standard GTS allocation scheme is modified. For each non-identical device, the Markov model is solved and the average service time and the service utilization factor are analyzed in the non-saturated mode. The analysis is validated by simulations using network simulator version 2.33. Also, the model is enhanced with a wireless propagation model and the performance of the MAC is evaluated in a wheelchair body-area sensor network scenario.
Code of Federal Regulations, 2010 CFR
2010-01-01
... 7 Agriculture 2 2010-01-01 2010-01-01 false Auction sales. 46.25 Section 46.25 Agriculture Regulations of the Department of Agriculture AGRICULTURAL MARKETING SERVICE (Standards, Inspections, Marketing Practices), DEPARTMENT OF AGRICULTURE MARKETING OF PERISHABLE AGRICULTURAL COMMODITIES REGULATIONS (OTHER...
7 CFR 29.73 - Designation of markets; termination of designation.
Code of Federal Regulations, 2010 CFR
2010-01-01
... markets; termination of designation. An auction market where tobacco bought or sold thereon at auction or... considered as a new market, as defined in § 29.1, and any future application for services shall be filed and...
Proposal for implementation of CCSDS standards for use with spacecraft engineering/housekeeping data
NASA Technical Reports Server (NTRS)
Welch, Dave
1994-01-01
Many of today's low earth orbiting spacecraft are using the Consultative Committee for Space Data Systems (CCSDS) protocol for better optimization of down link RF bandwidth and onboard storage space. However, most of the associated housekeeping data has continued to be generated and down linked in a synchronous, Time Division Multiplexed (TDM) fashion. There are many economies that the CCSDS protocol will allow to better utilize the available bandwidth and storage space in order to optimize the housekeeping data for use in operational trending and analysis work. By only outputting what is currently important or of interest, finer resolution of critical items can be obtained. This can be accomplished by better utilizing the normally allocated housekeeping data down link and storage areas rather than taking space reserved for science.
Proposal for implementation of CCSDS standards for use with spacecraft engineering/housekeeping data
NASA Astrophysics Data System (ADS)
Welch, Dave
1994-11-01
Many of today's low earth orbiting spacecraft are using the Consultative Committee for Space Data Systems (CCSDS) protocol for better optimization of down link RF bandwidth and onboard storage space. However, most of the associated housekeeping data has continued to be generated and down linked in a synchronous, Time Division Multiplexed (TDM) fashion. There are many economies that the CCSDS protocol will allow to better utilize the available bandwidth and storage space in order to optimize the housekeeping data for use in operational trending and analysis work. By only outputting what is currently important or of interest, finer resolution of critical items can be obtained. This can be accomplished by better utilizing the normally allocated housekeeping data down link and storage areas rather than taking space reserved for science.
Tang, Xiaolan; Hong, Donghui; Chen, Wenlong
2017-01-01
Existing studies on data acquisition in vehicular networks often take the mobile vehicular nodes as data carriers. However, their autonomous movements, limited resources and security risks impact the quality of services. In this article, we propose a data acquisition model using stable matching of bipartite graph in cooperative vehicle-infrastructure systems, namely, DAS. Contents are distributed to roadside units, while vehicular nodes support supplementary storage. The original distribution problem is formulated as a stable matching problem of bipartite graph, where the data and the storage cells compose two sides of vertices. Regarding the factors relevant with the access ratio and delay, the preference rankings for contents and roadside units are calculated, respectively. With a multi-replica preprocessing algorithm to handle the potential one-to-many mapping, the matching problem is addressed in polynomial time. In addition, vehicular nodes carry and forward assistant contents to deliver the failed packets because of bandwidth competition. Furthermore, an incentive strategy is put forward to boost the vehicle cooperation and to achieve a fair bandwidth allocation at roadside units. Experiments show that DAS achieves a high access ratio and a small storage cost with an acceptable delay. PMID:28594359
NASA Astrophysics Data System (ADS)
Shahverdi, Masood
The cost and fuel economy of hybrid electrical vehicles (HEVs) are significantly dependent on the power-train energy storage system (ESS). A series HEV with a minimal all-electric mode (AEM) permits minimizing the size and cost of the ESS. This manuscript, pursuing the minimal size tactic, introduces a bandwidth based methodology for designing an efficient ESS. First, for a mid-size reference vehicle, a parametric study is carried out over various minimal-size ESSs, both hybrid (HESS) and non-hybrid (ESS), for finding the highest fuel economy. The results show that a specific type of high power battery with 4.5 kWh capacity can be selected as the winning candidate to study for further minimization. In a second study, following the twin goals of maximizing Fuel Economy (FE) and improving consumer acceptance, a sports car class Series-HEV (SHEV) was considered as a potential application which requires even more ESS minimization. The challenge with this vehicle is to reduce the ESS size compared to 4.5 kWh, because the available space allocation is only one fourth of the allowed battery size in the mid-size study by volume. Therefore, an advanced bandwidth-based controller is developed that allows a hybridized Subaru BRZ model to be realized with a light ESS. The result allows a SHEV to be realized with 1.13 kWh ESS capacity. In a third study, the objective is to find optimum SHEV designs with minimal AEM assumption which cover the design space between the fuel economies in the mid-size car study and the sports car study. Maximizing FE while minimizing ESS cost is more aligned with customer acceptance in the current state of market. The techniques applied to manage the power flow between energy sources of the power-train significantly affect the results of this optimization. A Pareto Frontier, including ESS cost and FE, for a SHEV with limited AEM, is introduced using an advanced bandwidth-based control strategy teamed up with duty ratio control. This controller allows the series hybrid's advantage of tightly managing engine efficiency to be extended to lighter ESS, as compared to the size of the ESS in available products in the market.
10 CFR 452.5 - Bidding procedures.
Code of Federal Regulations, 2012 CFR
2012-01-01
... OF ENERGY ENERGY CONSERVATION PRODUCTION INCENTIVES FOR CELLULOSIC BIOFUELS § 452.5 Bidding... producer auction process open only to pre-auction eligible cellulosic biofuels producers. The following... cellulosic biofuels producers during the open window established in the solicitation. The open window shall...
10 CFR 452.5 - Bidding procedures.
Code of Federal Regulations, 2014 CFR
2014-01-01
... OF ENERGY ENERGY CONSERVATION PRODUCTION INCENTIVES FOR CELLULOSIC BIOFUELS § 452.5 Bidding... producer auction process open only to pre-auction eligible cellulosic biofuels producers. The following... cellulosic biofuels producers during the open window established in the solicitation. The open window shall...
10 CFR 452.5 - Bidding procedures.
Code of Federal Regulations, 2013 CFR
2013-01-01
... OF ENERGY ENERGY CONSERVATION PRODUCTION INCENTIVES FOR CELLULOSIC BIOFUELS § 452.5 Bidding... producer auction process open only to pre-auction eligible cellulosic biofuels producers. The following... cellulosic biofuels producers during the open window established in the solicitation. The open window shall...
10 CFR 452.5 - Bidding procedures.
Code of Federal Regulations, 2011 CFR
2011-01-01
... OF ENERGY ENERGY CONSERVATION PRODUCTION INCENTIVES FOR CELLULOSIC BIOFUELS § 452.5 Bidding... producer auction process open only to pre-auction eligible cellulosic biofuels producers. The following... cellulosic biofuels producers during the open window established in the solicitation. The open window shall...
9 CFR 2.76 - Records: Operators of auction sales and brokers.
Code of Federal Regulations, 2010 CFR
2010-01-01
..., DEPARTMENT OF AGRICULTURE ANIMAL WELFARE REGULATIONS Records § 2.76 Records: Operators of auction sales and... breed or type of animal; (ii) The sex of the animal; and (iii) The date of birth or approximate age; and...
The Balloon Popping Problem Revisited: Lower and Upper Bounds
NASA Astrophysics Data System (ADS)
Jung, Hyunwoo; Chwa, Kyung-Yong
We consider the balloon popping problem introduced by Immorlica et al. in 2007 [13]. This problem is directly related to the problem of profit maximization in online auctions, where an auctioneer is selling a collection of identical items to anonymous unit-demand bidders. The auctioneer has the full knowledge of bidders’ private valuations for the items and tries to maximize his profit. Compared with the profit of fixed price schemes, the competitive ratio of Immorlica et al.’s algorithm was in the range [1.64, 4.33]. In this paper, we narrow the gap to [1.659, 2].
Unmanned Aircraft System Control and ATC Communications Bandwidth Requirements
NASA Technical Reports Server (NTRS)
Henriksen, Steve
2008-01-01
There are significant activities taking place to establish the procedures and requirements for safe and routine operation of unmanned aircraft systems (UAS) in the National Airspace System (NAS). Among the barriers to overcome in achieving this goal is the lack of sufficient frequency spectrum necessary for the UAS control and air traffic control (ATC) communications links. This shortcoming is compounded by the fact that the UAS control communications links will likely be required to operate in protected frequency spectrum, just as ATC communications links are, because they relate to "safety and regularity of flight." To support future International Telecommunications Union (ITU) World Radio Conference (WRC) agenda items concerning new frequency allocations for UAS communications links, and to augment the Future Communications Study (FCS) Technology Evaluation Group efforts, NASA Glenn Research Center has sponsored a task to estimate the UAS control and ATC communications bandwidth requirements for safe, reliable, and routine operation of UAS in the NAS. This report describes the process and results of that task. The study focused on long-term bandwidth requirements for UAS approximately through 2030.
Performance Evaluation and Control of Distributed Computer Communication Networks.
1985-09-01
Zukerman, S. Katz, P. Rodriguez, R. Pazos , S. Resheff, Z. Tsai, Z. Zhang, L. Jong, V. Minh. Other participants are the following visiting... Pazos -Rangel "Bandwidth Allocation and Routing in ISDN’s," IEEE Communications Magazine, February 1984. Abstract The goal of communications network design...location and routing for integrated networks - is formulated, and efficient methods for its solution are presented. (2) R.A. Pazos -Rangel "Evaluation
Multifunction Multiband Airborne Radio Architecture Study.
1982-01-01
30 to 88, 108 to 156, and 255 to 400 MHz band allocations . (ii) On designated operating channels: two in the 225 to 400 MHz bandwidth, one in each of...altimeter, direction finding, and relay. 2.2 BASELINE SYSTEM APPROACH This subsection describes the TRW-proposed baseline design for the MFBARS system...problem and SINCGARS application. Major efforts were directed toward reducing the overall costs while retaining required performance. Significantly, cost
31 CFR 356.20 - How does the Treasury determine auction awards?
Code of Federal Regulations, 2010 CFR
2010-07-01
... and bond issues. We set the interest rate at a 1/8 of one percent increment. If a Treasury inflation-protected securities auction results in a negative or zero yield, the interest rate will be set at zero, and...
Federal Register 2010, 2011, 2012, 2013, 2014
2013-07-29
... on Proposed Rule Change Relating To Which Complex Orders Can Initiate a Complex Order Live Auction... Exchange to determine by order sender which complex orders can initiate a Complex Order Live Auction...
49 CFR 580.9 - Odometer record retention for auction companies.
Code of Federal Regulations, 2013 CFR
2013-10-01
... the buyer; (c) The vehicle identification number; and (d) The odometer reading on the date which the auction company took possession of the motor vehicle. ... permits systematic retrieval, for five years following the date of sale of each motor vehicle, the...
49 CFR 580.9 - Odometer record retention for auction companies.
Code of Federal Regulations, 2011 CFR
2011-10-01
... the buyer; (c) The vehicle identification number; and (d) The odometer reading on the date which the auction company took possession of the motor vehicle. ... permits systematic retrieval, for five years following the date of sale of each motor vehicle, the...
49 CFR 580.9 - Odometer record retention for auction companies.
Code of Federal Regulations, 2014 CFR
2014-10-01
... the buyer; (c) The vehicle identification number; and (d) The odometer reading on the date which the auction company took possession of the motor vehicle. ... permits systematic retrieval, for five years following the date of sale of each motor vehicle, the...
49 CFR 580.9 - Odometer record retention for auction companies.
Code of Federal Regulations, 2010 CFR
2010-10-01
... the buyer; (c) The vehicle identification number; and (d) The odometer reading on the date which the auction company took possession of the motor vehicle. ... permits systematic retrieval, for five years following the date of sale of each motor vehicle, the...
49 CFR 580.9 - Odometer record retention for auction companies.
Code of Federal Regulations, 2012 CFR
2012-10-01
... the buyer; (c) The vehicle identification number; and (d) The odometer reading on the date which the auction company took possession of the motor vehicle. ... permits systematic retrieval, for five years following the date of sale of each motor vehicle, the...
76 FR 4827 - High-Cost Universal Service Support and Federal-State Joint Board on Universal Service
Federal Register 2010, 2011, 2012, 2013, 2014
2011-01-27
... Wireless Services (``AWS'') licenses. This auction, which was designated as Auction 78, offered 35 licenses in the AWS 1710-1755 MHz and 2110-2155 MHz bands (``AWS-1''). The AWS-1 licenses were licenses for...
Code of Federal Regulations, 2014 CFR
2014-10-01
... Payment to auction contractor by credit card or check. (Public Notice will specify exact payment...) to same person or entity Payment to auction contractor by credit card or check. (Public Notice will...
Code of Federal Regulations, 2013 CFR
2013-10-01
... Payment to auction contractor by credit card or check. (Public Notice will specify exact payment...) to same person or entity Payment to auction contractor by credit card or check. (Public Notice will...
Code of Federal Regulations, 2012 CFR
2012-10-01
... Payment to auction contractor by credit card or check. (Public Notice will specify exact payment...) to same person or entity Payment to auction contractor by credit card or check. (Public Notice will...
47 CFR 1.2203 - Competitive bidding mechanisms.
Code of Federal Regulations, 2014 CFR
2014-10-01
... Random Selection Competitive Bidding Proceedings Broadcast Television Spectrum Reverse Auction § 1.2203... forward auction assigning new spectrum licenses will occur. (2) Reserve price. Reserve prices, either... winning bid. A winning bidder will relinquish spectrum usage rights pursuant to the terms of any winning...
McCreery, Ryan W; Stelmachowicz, Patricia G
2013-09-01
Understanding speech in acoustically degraded environments can place significant cognitive demands on school-age children who are developing the cognitive and linguistic skills needed to support this process. Previous studies suggest the speech understanding, word learning, and academic performance can be negatively impacted by background noise, but the effect of limited audibility on cognitive processes in children has not been directly studied. The aim of the present study was to evaluate the impact of limited audibility on speech understanding and working memory tasks in school-age children with normal hearing. Seventeen children with normal hearing between 6 and 12 years of age participated in the present study. Repetition of nonword consonant-vowel-consonant stimuli was measured under conditions with combinations of two different signal to noise ratios (SNRs; 3 and 9 dB) and two low-pass filter settings (3.2 and 5.6 kHz). Verbal processing time was calculated based on the time from the onset of the stimulus to the onset of the child's response. Monosyllabic word repetition and recall were also measured in conditions with a full bandwidth and 5.6 kHz low-pass cutoff. Nonword repetition scores decreased as audibility decreased. Verbal processing time increased as audibility decreased, consistent with predictions based on increased listening effort. Although monosyllabic word repetition did not vary between the full bandwidth and 5.6 kHz low-pass filter condition, recall was significantly poorer in the condition with limited bandwidth (low pass at 5.6 kHz). Age and expressive language scores predicted performance on word recall tasks, but did not predict nonword repetition accuracy or verbal processing time. Decreased audibility was associated with reduced accuracy for nonword repetition and increased verbal processing time in children with normal hearing. Deficits in free recall were observed even under conditions where word repetition was not affected. The negative effects of reduced audibility may occur even under conditions where speech repetition is not impacted. Limited stimulus audibility may result in greater cognitive effort for verbal rehearsal in working memory and may limit the availability of cognitive resources to allocate to working memory and other processes.
2011-08-01
level of responsibility for design activities and program management. He has authored or co-authored numerous papers on designs for space and radiation effects. Mr. Avery is a member of IEEE/ NPSS and AIAA.
A Highly Flexible and Efficient Passive Optical Network Employing Dynamic Wavelength Allocation
NASA Astrophysics Data System (ADS)
Hsueh, Yu-Li; Rogge, Matthew S.; Yamamoto, Shu; Kazovsky, Leonid G.
2005-01-01
A novel and high-performance passive optical network (PON), the SUCCESS-DWA PON, employs dynamic wavelength allocation to provide bandwidth sharing across multiple physical PONs. In the downstream, tunable lasers, an arrayed waveguide grating, and coarse/fine filtering combine to create a flexible new optical access solution. In the upstream, several distributed and centralized schemes are proposed and investigated. The network performance is compared to conventional TDM-PONs under different traffic models, including the self-similar traffic model and the transaction-oriented model. Broadcast support and deployment issues are addressed. The network's excellent scalability can bridge the gap between conventional TDM-PONs and WDM-PONs. The powerful architecture is a promising candidate for next generation optical access networks.
47 CFR 1.2207 - Two competing participants required.
Code of Federal Regulations, 2014 CFR
2014-10-01
... by Random Selection Competitive Bidding Proceedings Broadcast Television Spectrum Reverse Auction § 1... to relinquish spectrum usage rights in exchange for a share of the proceeds from the related forward auction assigning new spectrum licenses unless at least two competing licensees participate in the reverse...
47 CFR 1.2205 - Prohibition of certain communications.
Code of Federal Regulations, 2014 CFR
2014-10-01
... by Random Selection Competitive Bidding Proceedings Broadcast Television Spectrum Reverse Auction § 1... provided in paragraph (b)(2) of this section, in the broadcast television spectrum incentive auction conducted under section 6403 of the Spectrum Act, beginning on the deadline for submitting applications to...
AUCTION MECHANISMS FOR IMPLEMENTING TRADABLE NETWORK PERMIT MARKETS
NASA Astrophysics Data System (ADS)
Wada, Kentaro; Akamatsu, Takashi
This paper proposes a new auction mechanism for implementing the tradable network permit markets. Assuming that each user makes a trip from an origin to a destination along a path in a specific time period, we design an auction mechanism that enables each user to purchase a bundle of permits corresponding to a set of links in the user's preferred path. The objective of the proposed mechanism is to achieve a socially optimal state with minimal revelation of users' private information. In order to achieve this, the mechanism employs an evolutionary approach that has an auction phase and a path capacity adjustment phase, which are repeated on a day-to-day basis. We prove that the proposed mechanism has the following desirable properties: (1) truthful bidding is the dominant strategy for each user and (2) the proposed mechanism converges to an approximate socially optimal state in the sense that the achieved value of the social surplus reaches its maximum value when the number of users is large.
Rousu, Matthew C.; O'Connor, Richard; Thrasher, James F; June, Kristie; Bansal-Travers, Maansi; Pitcavage, James
2014-01-01
Introduction Epidemiological and toxicological evidence suggests lower risk of smokeless tobacco (ST) products compared to cigarettes. Less is known, however, about consumer perceptions and use of novel forms of ST, including snus and dissolvable tobacco. Methods In this study, we conducted in-person experimental auctions in Buffalo, NY, Columbia, SC, and Selinsgrove, PA with 571 smokers to test the impact of information and product trials on smokers’ preferences. Auctions were conducted between November 2010-November 2011. Results We found no evidence of an impact of product trials on demand in our auctions. Anti-ST information increased demand for cigarettes when presented alone, but when presented with Pro-ST information it decreased demand for cigarettes. It did not decrease demand for ST products. Anti-smoking information increased demand for ST products, but did not affect cigarette demand. Conclusions These findings suggest that credible and effective communications about tobacco harm reduction should reinforce the negative effects of smoking. PMID:24321456
Rousu, Matthew C; O'Connor, Richard J; Thrasher, James F; June, Kristie M; Bansal-Travers, Maansi; Pitcavage, James
2014-03-01
Epidemiological and toxicological evidence suggests lower risk of smokeless tobacco (ST) products compared to cigarettes. Less is known, however, about consumer perceptions and use of novel forms of ST, including snus and dissolvable tobacco. In this study, we conducted in-person experimental auctions in Buffalo, NY, Columbia, SC, and Selinsgrove, PA with 571 smokers to test the impact of information and product trials on smokers' preferences. Auctions were conducted between November 2010-November 2011. We found no evidence of an impact of product trials on demand in our auctions. Anti-ST information increased demand for cigarettes when presented alone, but when presented with pro-ST information it decreased demand for cigarettes. It did not decrease demand for ST products. Anti-smoking information increased demand for ST products, but did not affect cigarette demand. These findings suggest that credible and effective communications about tobacco harm reduction should reinforce the negative effects of smoking. Copyright © 2013 Elsevier Inc. All rights reserved.
A novel LTE scheduling algorithm for green technology in smart grid.
Hindia, Mohammad Nour; Reza, Ahmed Wasif; Noordin, Kamarul Ariffin; Chayon, Muhammad Hasibur Rashid
2015-01-01
Smart grid (SG) application is being used nowadays to meet the demand of increasing power consumption. SG application is considered as a perfect solution for combining renewable energy resources and electrical grid by means of creating a bidirectional communication channel between the two systems. In this paper, three SG applications applicable to renewable energy system, namely, distribution automation (DA), distributed energy system-storage (DER) and electrical vehicle (EV), are investigated in order to study their suitability in Long Term Evolution (LTE) network. To compensate the weakness in the existing scheduling algorithms, a novel bandwidth estimation and allocation technique and a new scheduling algorithm are proposed. The technique allocates available network resources based on application's priority, whereas the algorithm makes scheduling decision based on dynamic weighting factors of multi-criteria to satisfy the demands (delay, past average throughput and instantaneous transmission rate) of quality of service. Finally, the simulation results demonstrate that the proposed mechanism achieves higher throughput, lower delay and lower packet loss rate for DA and DER as well as provide a degree of service for EV. In terms of fairness, the proposed algorithm shows 3%, 7 % and 9% better performance compared to exponential rule (EXP-Rule), modified-largest weighted delay first (M-LWDF) and exponential/PF (EXP/PF), respectively.
A Novel LTE Scheduling Algorithm for Green Technology in Smart Grid
Hindia, Mohammad Nour; Reza, Ahmed Wasif; Noordin, Kamarul Ariffin; Chayon, Muhammad Hasibur Rashid
2015-01-01
Smart grid (SG) application is being used nowadays to meet the demand of increasing power consumption. SG application is considered as a perfect solution for combining renewable energy resources and electrical grid by means of creating a bidirectional communication channel between the two systems. In this paper, three SG applications applicable to renewable energy system, namely, distribution automation (DA), distributed energy system-storage (DER) and electrical vehicle (EV), are investigated in order to study their suitability in Long Term Evolution (LTE) network. To compensate the weakness in the existing scheduling algorithms, a novel bandwidth estimation and allocation technique and a new scheduling algorithm are proposed. The technique allocates available network resources based on application’s priority, whereas the algorithm makes scheduling decision based on dynamic weighting factors of multi-criteria to satisfy the demands (delay, past average throughput and instantaneous transmission rate) of quality of service. Finally, the simulation results demonstrate that the proposed mechanism achieves higher throughput, lower delay and lower packet loss rate for DA and DER as well as provide a degree of service for EV. In terms of fairness, the proposed algorithm shows 3%, 7 % and 9% better performance compared to exponential rule (EXP-Rule), modified-largest weighted delay first (M-LWDF) and exponential/PF (EXP/PF), respectively. PMID:25830703
Economics and computer science of a radio spectrum reallocation.
Leyton-Brown, Kevin; Milgrom, Paul; Segal, Ilya
2017-07-11
The recent "incentive auction" of the US Federal Communications Commission was the first auction to reallocate radio frequencies between two different kinds of uses: from broadcast television to wireless Internet access. The design challenge was not just to choose market rules to govern a fixed set of potential trades but also, to determine the broadcasters' property rights, the goods to be exchanged, the quantities to be traded, the computational procedures, and even some of the performance objectives. An essential and unusual challenge was to make the auction simple enough for human participants while still ensuring that the computations would be tractable and capable of delivering nearly efficient outcomes.
Code of Federal Regulations, 2014 CFR
2014-10-01
... include changes in ownership of the applicant that would constitute an assignment or transfer of control... Auctions and Spectrum Access Division, Wireless Telecommunications Bureau, by the most expeditious means... Auctions and Spectrum Access Division, Wireless Telecommunications Bureau, by the most expeditious means...
41 CFR 102-38.95 - What is an auction?
Code of Federal Regulations, 2010 CFR
2010-07-01
... 41 Public Contracts and Property Management 3 2010-07-01 2010-07-01 false What is an auction? 102-38.95 Section 102-38.95 Public Contracts and Property Management Federal Property Management Regulations System (Continued) FEDERAL MANAGEMENT REGULATION PERSONAL PROPERTY 38-SALE OF PERSONAL PROPERTY...
41 CFR 102-38.95 - What is an auction?
Code of Federal Regulations, 2014 CFR
2014-01-01
... 41 Public Contracts and Property Management 3 2014-01-01 2014-01-01 false What is an auction? 102-38.95 Section 102-38.95 Public Contracts and Property Management Federal Property Management Regulations System (Continued) FEDERAL MANAGEMENT REGULATION PERSONAL PROPERTY 38-SALE OF PERSONAL PROPERTY...
41 CFR 102-38.95 - What is an auction?
Code of Federal Regulations, 2013 CFR
2013-07-01
... 41 Public Contracts and Property Management 3 2013-07-01 2013-07-01 false What is an auction? 102-38.95 Section 102-38.95 Public Contracts and Property Management Federal Property Management Regulations System (Continued) FEDERAL MANAGEMENT REGULATION PERSONAL PROPERTY 38-SALE OF PERSONAL PROPERTY...
41 CFR 102-38.95 - What is an auction?
Code of Federal Regulations, 2012 CFR
2012-01-01
... 41 Public Contracts and Property Management 3 2012-01-01 2012-01-01 false What is an auction? 102-38.95 Section 102-38.95 Public Contracts and Property Management Federal Property Management Regulations System (Continued) FEDERAL MANAGEMENT REGULATION PERSONAL PROPERTY 38-SALE OF PERSONAL PROPERTY...
41 CFR 102-38.95 - What is an auction?
Code of Federal Regulations, 2011 CFR
2011-01-01
... 41 Public Contracts and Property Management 3 2011-01-01 2011-01-01 false What is an auction? 102-38.95 Section 102-38.95 Public Contracts and Property Management Federal Property Management Regulations System (Continued) FEDERAL MANAGEMENT REGULATION PERSONAL PROPERTY 38-SALE OF PERSONAL PROPERTY...
High-bandwidth prefetcher for high-bandwidth memory
DOE Office of Scientific and Technical Information (OSTI.GOV)
Mehta, Sanyam; Kohn, James Robert; Ernst, Daniel Jonathan
A method for prefetching data into a cache is provided. The method allocates an outstanding request buffer ("ORB"). The method stores in an address field of the ORB an address and a number of blocks. The method issues prefetch requests for a degree number of blocks starting at the address. When a prefetch response is received for all the prefetch requests, the method adjusts the address of the next block to prefetch and adjusts the number of blocks remaining to be retrieved and then issues prefetch requests for a degree number of blocks starting at the adjusted address. The prefetchingmore » pauses when a maximum distance between the reads of the prefetched blocks and the last prefetched block is reached. When a read request for a prefetched block is received, the method resumes prefetching when a resume criterion is satisfied.« less
Biological auctions with multiple rewards
Reiter, Johannes G.; Kanodia, Ayush; Gupta, Raghav; Nowak, Martin A.; Chatterjee, Krishnendu
2015-01-01
The competition for resources among cells, individuals or species is a fundamental characteristic of evolution. Biological all-pay auctions have been used to model situations where multiple individuals compete for a single resource. However, in many situations multiple resources with various values exist and single reward auctions are not applicable. We generalize the model to multiple rewards and study the evolution of strategies. In biological all-pay auctions the bid of an individual corresponds to its strategy and is equivalent to its payment in the auction. The decreasingly ordered rewards are distributed according to the decreasingly ordered bids of the participating individuals. The reproductive success of an individual is proportional to its fitness given by the sum of the rewards won minus its payments. Hence, successful bidding strategies spread in the population. We find that the results for the multiple reward case are very different from the single reward case. While the mixed strategy equilibrium in the single reward case with more than two players consists of mostly low-bidding individuals, we show that the equilibrium can convert to many high-bidding individuals and a few low-bidding individuals in the multiple reward case. Some reward values lead to a specialization among the individuals where one subpopulation competes for the rewards and the other subpopulation largely avoids costly competitions. Whether the mixed strategy equilibrium is an evolutionarily stable strategy (ESS) depends on the specific values of the rewards. PMID:26180069
Downhole drilling network using burst modulation techniques
Hall,; David R. , Fox; Joe, [Spanish Fork, UT
2007-04-03
A downhole drilling system is disclosed in one aspect of the present invention as including a drill string and a transmission line integrated into the drill string. Multiple network nodes are installed at selected intervals along the drill string and are adapted to communicate with one another through the transmission line. In order to efficiently allocate the available bandwidth, the network nodes are configured to use any of numerous burst modulation techniques to transmit data.
31 CFR 356.11 - How are bids submitted in an auction?
Code of Federal Regulations, 2012 CFR
2012-07-01
..., our computer time stamp will establish the receipt time. You are bound by your bids after the closing... failures or disruptions of equipment or communications facilities used for participating in Treasury auctions. (4) Submitters are responsible for bids submitted using computer equipment on their premises...
31 CFR 356.11 - How are bids submitted in an auction?
Code of Federal Regulations, 2011 CFR
2011-07-01
..., our computer time stamp will establish the receipt time. You are bound by your bids after the closing... failures or disruptions of equipment or communications facilities used for participating in Treasury auctions. (4) Submitters are responsible for bids submitted using computer equipment on their premises...
49 CFR 599.201 - Identification of salvage auctions and disposal facilities.
Code of Federal Regulations, 2010 CFR
2010-10-01
... facilities. 599.201 Section 599.201 Transportation Other Regulations Relating to Transportation (Continued... and Disposal Facilities § 599.201 Identification of salvage auctions and disposal facilities. (a... disposal facility identified in paragraph (a)(2) or (a)(3) of this section. (2) A disposal facility listed...
Federal Register 2010, 2011, 2012, 2013, 2014
2012-12-12
...] Expanding the Economic and Innovation Opportunities of Spectrum Through Incentive Auctions AGENCY: Federal... Media Bureau extends the deadline for filing comments and reply comments on the Notice of Proposed... delivery, by commercial overnight courier, or by first-class or overnight U.S. Postal Service mail...
Federal Register 2010, 2011, 2012, 2013, 2014
2011-04-13
... rates and descriptive information about Auction Rate Securities (``ARS'') and Variable Rate Demand... interest rate setting mechanisms for ARS and liquidity facilities for VDROs, information about orders submitted for an ARS auction, and additional information about VRDOs.\\5\\ To provide subscribers with access...
75 FR 78768 - Proposed Exemptions From Certain Prohibited Transaction Restrictions
Federal Register 2010, 2011, 2012, 2013, 2014
2010-12-16
... Securities, as discussed herein. 2. The Applicant describes Auction Rate Securities (or ARS) and the arrangement by which ARS are bought and sold as follows. Auction Rate Securities are preferred stock or bonds... to perpetuity. ARS interest rates or dividend yields are determined and periodically reset at...
Federal Register 2010, 2011, 2012, 2013, 2014
2011-03-02
... interest rates and descriptive information about Auction Rate Securities (``ARS'') and Variable Rate Demand... interest rate setting mechanisms for ARS and liquidity facilities for VRDOs, information about orders submitted for an ARS auction, and additional information about VRDOs.\\4\\ To provide subscribers with access...
Making Marketing Principles Tangible: Online Auctions as Living Case Studies
ERIC Educational Resources Information Center
Wood, Charles M.; Suter, Tracy A.
2004-01-01
This article presents an effective course supplement for Principles of Marketing classes. An experiential project involving online auctions is offered to instructors seeking to create a more participatory student environment and an interactive teaching style. A number of learning points are illustrated that allow instructors to use an auction…
Federal Register 2010, 2011, 2012, 2013, 2014
2011-12-19
... touch upon impermissible subject matters because they may convey pricing information and bidding... FCC auction does not constitute an endorsement by the FCC of any particular service, technology, or... habitats, historical or archaeological sites, Indian religious sites, floodplains, and surface features. In...
Federal Register 2010, 2011, 2012, 2013, 2014
2012-06-26
... FEDERAL COMMUNICATIONS COMMISSION [AU Docket No. 12-25; DA 12-947] Mobility Fund Phase I Auction Supplemental Short-Form Instructions and Other Information AGENCY: Federal Communications Commission. ACTION... number, for example, DA 12-947. The Supplemental Filing Instructions Public Notice and related documents...
Books at Auction: The Art of Deaccessioning.
ERIC Educational Resources Information Center
Model, Peter
1981-01-01
Lack of space and budget cuts force many libraries to weed out books and to be selective in accepting collection bequests. The approach for deciding which books to weed out and whether to dispose of these books through dealers or auctions are decisions private clubs and many libraries must make. (RBF)
NASA Astrophysics Data System (ADS)
Li, Xingfeng; Gan, Chaoqin; Liu, Zongkang; Yan, Yuqi; Qiao, HuBao
2018-01-01
In this paper, a novel architecture of hybrid PON for smart grid is proposed by introducing a wavelength-routing module (WRM). By using conventional optical passive components, a WRM with M ports is designed. The symmetry and passivity of the WRM makes it be easily integrated and very cheap in practice. Via the WRM, two types of network based on different ONU-interconnected manner can realize online access. Depending on optical switches and interconnecting fibers, full-fiber-fault protection and dynamic bandwidth allocation are realized in these networks. With the help of amplitude modulation, DPSK modulation and RSOA technology, wavelength triple-reuse is achieved. By means of injecting signals into left and right branches in access ring simultaneously, the transmission delay is decreased. Finally, the performance analysis and simulation of the network verifies the feasibility of the proposed architecture.
Information access in a dual-task context: testing a model of optimal strategy selection.
Wickens, C D; Seidler, K S
1997-09-01
Pilots were required to access information from a hierarchical aviation database by navigating under single-task conditions (Experiment 1) and when this task was time-shared with an altitude-monitoring task of varying bandwidth and priority (Experiment 2). In dual-task conditions, pilots had 2 viewports available, 1 always used for the information task and the other to be allocated to either task. Dual-task strategy, inferred from the decision of which task to allocate to the 2nd viewport, revealed that allocation was generally biased in favor of the monitoring task and was only partly sensitive to the difficulty of the 2 tasks and their relative priorities. Some dominant sources of navigational difficulties failed to adaptively influence selection strategy. The implications of the results are to provide tools for jumping to the top of the database, to provide 2 viewports into the common database, and to provide training as to the optimum viewport management strategy in a multitask environment.
Studies in integrated line-and packet-switched computer communication systems
NASA Astrophysics Data System (ADS)
Maglaris, B. S.
1980-06-01
The problem of efficiently allocating the bandwidth of a trunk to both types of traffic is handled for various system and traffic models. A performance analysis is carried out both for variable and fixed frame schemes. It is shown that variable frame schemes, adjusting the frame length according to the traffic variations, offer better trunk utilization at the cost of the additional hardware and software complexity needed because of the lack of synchronization. An optimization study on the fixed frame schemes follows. The problem of dynamically allocating the fixed frame to both types of traffic is formulated as a Markovian Decision process. It is shown that the movable boundary scheme, suggested for commercial implementations of integrated multiplexors, offers optimal or near optimal performance and simplicity of implementation. Finally, the behavior of the movable boundary integrated scheme is studied for tandem link connections. Under the assumptions made for the line-switched traffic, the forward allocation technique is found to offer the best alternative among different path set-up strategies.
Information access in a dual-task context: testing a model of optimal strategy selection
NASA Technical Reports Server (NTRS)
Wickens, C. D.; Seidler, K. S.
1997-01-01
Pilots were required to access information from a hierarchical aviation database by navigating under single-task conditions (Experiment 1) and when this task was time-shared with an altitude-monitoring task of varying bandwidth and priority (Experiment 2). In dual-task conditions, pilots had 2 viewports available, 1 always used for the information task and the other to be allocated to either task. Dual-task strategy, inferred from the decision of which task to allocate to the 2nd viewport, revealed that allocation was generally biased in favor of the monitoring task and was only partly sensitive to the difficulty of the 2 tasks and their relative priorities. Some dominant sources of navigational difficulties failed to adaptively influence selection strategy. The implications of the results are to provide tools for jumping to the top of the database, to provide 2 viewports into the common database, and to provide training as to the optimum viewport management strategy in a multitask environment.
Integrated consensus-based frameworks for unmanned vehicle routing and targeting assignment
NASA Astrophysics Data System (ADS)
Barnawi, Waleed T.
Unmanned aerial vehicles (UAVs) are increasingly deployed in complex and dynamic environments to perform multiple tasks cooperatively with other UAVs that contribute to overarching mission effectiveness. Studies by the Department of Defense (DoD) indicate future operations may include anti-access/area-denial (A2AD) environments which limit human teleoperator decision-making and control. This research addresses the problem of decentralized vehicle re-routing and task reassignments through consensus-based UAV decision-making. An Integrated Consensus-Based Framework (ICF) is formulated as a solution to the combined single task assignment problem and vehicle routing problem. The multiple assignment and vehicle routing problem is solved with the Integrated Consensus-Based Bundle Framework (ICBF). The frameworks are hierarchically decomposed into two levels. The bottom layer utilizes the renowned Dijkstra's Algorithm. The top layer addresses task assignment with two methods. The single assignment approach is called the Caravan Auction Algorithm (CarA) Algorithm. This technique extends the Consensus-Based Auction Algorithm (CBAA) to provide awareness for task completion by agents and adopt abandoned tasks. The multiple assignment approach called the Caravan Auction Bundle Algorithm (CarAB) extends the Consensus-Based Bundle Algorithm (CBBA) by providing awareness for lost resources, prioritizing remaining tasks, and adopting abandoned tasks. Research questions are investigated regarding the novelty and performance of the proposed frameworks. Conclusions regarding the research questions will be provided through hypothesis testing. Monte Carlo simulations will provide evidence to support conclusions regarding the research hypotheses for the proposed frameworks. The approach provided in this research addresses current and future military operations for unmanned aerial vehicles. However, the general framework implied by the proposed research is adaptable to any unmanned vehicle. Civil applications that involve missions where human observability would be limited could benefit from the independent UAV task assignment, such as exploration and fire surveillance are also notable uses for this approach.
Federal Register 2010, 2011, 2012, 2013, 2014
2013-12-10
... systemically enforced narrow-width bid-ask differential applicable to the auction process. Since the time of... narrow-width NBBO is received from OPRA. This is a systemic solution which renders the rules-based narrow...
Reciprocity in Online Markets: Empirical Studies of Auction and Barter Markets
ERIC Educational Resources Information Center
Ye, Shun
2013-01-01
My dissertation seeks to understand how reciprocity affects transaction outcomes and mechanism design in online markets. The first essay examines negative reciprocity illustrated as feedback-revoking behavior in the eBay auction market, focusing on its impact and implications for reputation system design. I utilize the biggest policy change of…
31 CFR 356.20 - How does the Treasury determine auction awards?
Code of Federal Regulations, 2012 CFR
2012-07-01
..., but not above, par when evaluated at the yield of awards to successful competitive bidders. (2... 31 Money and Finance:Treasury 2 2012-07-01 2012-07-01 false How does the Treasury determine... the yield or discount rate for the securities we are auctioning. (2) Accepting bids at the high yield...
31 CFR 356.20 - How does the Treasury determine auction awards?
Code of Federal Regulations, 2013 CFR
2013-07-01
..., but not above, par when evaluated at the yield of awards to successful competitive bidders. (2... 31 Money and Finance:Treasury 2 2013-07-01 2013-07-01 false How does the Treasury determine... the yield or discount rate for the securities we are auctioning. (2) Accepting bids at the high yield...
31 CFR 356.20 - How does the Treasury determine auction awards?
Code of Federal Regulations, 2011 CFR
2011-07-01
..., but not above, par when evaluated at the yield of awards to successful competitive bidders. (2... 31 Money and Finance:Treasury 2 2011-07-01 2011-07-01 false How does the Treasury determine... the yield or discount rate for the securities we are auctioning. (2) Accepting bids at the high yield...
30 CFR 285.308 - How will MMS conduct an auction for ROW grants and RUE grants?
Code of Federal Regulations, 2011 CFR
2011-07-01
... and RUE grants? 285.308 Section 285.308 Mineral Resources BUREAU OF OCEAN ENERGY MANAGEMENT, REGULATION, AND ENFORCEMENT, DEPARTMENT OF THE INTERIOR OFFSHORE RENEWABLE ENERGY ALTERNATE USES OF EXISTING... Renewable Energy Activities Obtaining Row Grants and Rue Grants § 285.308 How will MMS conduct an auction...
Federal Register 2010, 2011, 2012, 2013, 2014
2010-08-31
... Rule Change Relating to Routing Fees, the Monthly Cap and Electronic Auctions August 25, 2010. Pursuant... Monthly Cap on equity option transaction fees; and (iii) clarify language relating to electronic auctions...-105. The Exchange also proposes to amend its Monthly Cap assessed on Registered Options Traders...
Federal Register 2010, 2011, 2012, 2013, 2014
2013-03-18
... interests of investors to have lower Auction Transaction costs for non-Professional, Public Customers, and that the BOX fee structure will continue to attract this customer order flow to these auction... simple fact that price improvement occurs in the PIP. Since the PIP began in 2004, customers have...
78 FR 66955 - Exemptions From Certain Prohibited Transaction Restrictions
Federal Register 2010, 2011, 2012, 2013, 2014
2013-11-07
... Auction Rate Securities by UBS AG (ARS Rights) in connection with a Settlement Agreement, (b) the sale of an Auction Rate Security to UBS pursuant to such ARS Rights, where such sale (a Settlement Sale) is... the offer of ARS Rights (the ARS Rights Offer) are consistent with the requirements set forth in the...
76 FR 9366 - Proposed Exemptions From Certain Prohibited Transaction Restrictions
Federal Register 2010, 2011, 2012, 2013, 2014
2011-02-17
... Security'' or ``ARS'' means a security: (1) That is either a debt instrument (generally with a long-term... purchase of an ARS by Wachovia from a Plan. DATES: Effective Date: If granted, this proposed exemption will... describes Auction Rate Securities and the arrangement by which ARS are bought and sold as follows. Auction...
Federal Register 2010, 2011, 2012, 2013, 2014
2012-02-10
... application deadlines and other dates related to Auction 901 after considering comments provided in response... must file an application for support. Only after review of the application to confirm compliance with... for support to Tribal lands. 7. The USF/ICC Transformation Order established application, performance...
ERIC Educational Resources Information Center
Sanyal, Pallab
2009-01-01
Information Technology (IT) has spawned the growth of novel and innovative market mechanisms (such as online auctions) and associated businesses (such as eBay and Priceline) that were not feasible without the capabilities and reach of these modern information technologies. Previous studies on designing trading mechanisms for online markets…
78 FR 56874 - Comment Sought on Petition for Reconsideration of Auction 902 Procedures Public Notice
Federal Register 2010, 2011, 2012, 2013, 2014
2013-09-16
... FEDERAL COMMUNICATIONS COMMISSION [AU Docket No. 13-53; DA 13-1876] Comment Sought on Petition for Reconsideration of Auction 902 Procedures Public Notice AGENCY: Federal Communications Commission. ACTION: Notice. SUMMARY: This document announces that on September 6, 2013, Smith Bagley, Inc. (SBI) filed a petition...
Performance Evaluation and Control of Distributed Computer Communication Networks.
1984-09-01
including: L. Clare, L.A. De Moraes, J. Baker, M. Zuckerman, S. Katz, P. Rodrigues, R. Pazos , S. Resheff. Other participants are the following visiting...investigations have been reported in reference (1) and (2) below. References (1) M. Gerla, R. Pazos -Rangel "Bandwidth Allocation and Routing in ISDN’s," IEEE...and efficient methods for its solution are presented. (2) R.A. Pazos -Rangel "Evaluation and Design of Integrated Packet Switching and Circuit Switching
Integrated Services Digital Network (ISDN).
1985-06-01
U.S. Digital Networks," Telephony, February 6, 1984. Gerla, Mario and Pazos -Rangel, Rodolfo A ., "Bandwidth Allocation and Routing in ISDN’s," IEEE...111116o 1312. jf IL5 11111.4 MICROCOPY RESOLUTION TEST CHART NATIONAL BUREAU OF STANDARDS-1963 A • .4 i U-~ U. NAVAL POSTGRADUATE SCHOOL G ,.Monterey...Thesis Advisor: C. R. Jones P: A -nroved for nublic release; distribution unlimited 85o 09 s0 082 1--- S **. -: -* *.- -. ..-. * SECURITY CLASSIFICATION
Corley, K T T; Corley, M M B
2012-02-01
Many Thoroughbred foals are intended to be sold at public auction. The impact of disease conditions necessitating hospital treatment as a foal on future sales performance is unknown. To determine whether Thoroughbred horses that were treated in a hospital before age 125 days and presented to public auction sell for a different mean price than controls. Foals aged < 125 days, treated at a hospital in Ireland in 2007 or 2008 and presented for sale to a public auction recorded on a publicly accessible database were selected for inclusion in the study. The sales outcome of these subjects was compared to that of 6 controls for each subject, consisting of the 3 horses that were presented to the same sale immediately before and immediately after the subject. Results were controlled for the sale at which the animal presented and the sex of the subject and controls. Sixty-three subjects were presented to public auction: 19 at the foal sales, 39 at the yearling sales and 5 at the 2-year-old sales. Forty-five subjects were sold. There was no difference in the mean sales price (subjects Euros 38,207; controls Euros 35,026) or percentage of animals sold (subjects 71.4%; controls 66.4%) between subjects and controls. If Thoroughbred horses are presented for public auction following hospital treatment as a foal, there is no impact on sales outcome. This information may help commercial breeders of Thoroughbred foals make informed decisions about treatment of their foals.
NASA Astrophysics Data System (ADS)
Murshid, Syed; Alanzi, Saud; Hridoy, Arnob; Lovell, Gregory L.; Parhar, Gurinder; Chakravarty, Abhijit; Chowdhury, Bilas
2016-06-01
Spatial domain multiplexing/space division multiplexing (SDM) can increase the bandwidth of existing and futuristic optical fibers by an order of magnitude or more. In the SDM technique, we launch multiple single-mode pigtail laser sources of the same wavelength into a carrier multimode fiber at different angles. The launching angles decide the output of the carrier fiber by allocating separate spatial locations for each channel. Each channel follows a helical trajectory while traversing the length of the carrier fiber, thereby allowing spatial reuse of optical frequencies. We launch light from five different single-mode pigtail laser sources (of same wavelength) at different angles (with respect to the axis of the carrier fiber) into the carrier fiber. Owing to helical propagation, five distinct concentric donut-shaped rings with negligible crosstalk at the output end of the fiber were obtained. These SDM channels also exhibit orbital angular momentum (OAM), thereby adding an extradegree of photon freedom. We present the experimental data of five spatially multiplexed channels and compare them with simulated results to show that this technique can potentially improve the data capacity of optical fibers by an order of magnitude: A factor of five using SDM and another factor of two using OAM.
Anderson, Elizabeth S; Nelson, David A; Kreft, Heather; Nelson, Peggy B; Oxenham, Andrew J
2011-07-01
Spectral ripple discrimination thresholds were measured in 15 cochlear-implant users with broadband (350-5600 Hz) and octave-band noise stimuli. The results were compared with spatial tuning curve (STC) bandwidths previously obtained from the same subjects. Spatial tuning curve bandwidths did not correlate significantly with broadband spectral ripple discrimination thresholds but did correlate significantly with ripple discrimination thresholds when the rippled noise was confined to an octave-wide passband, centered on the STC's probe electrode frequency allocation. Ripple discrimination thresholds were also measured for octave-band stimuli in four contiguous octaves, with center frequencies from 500 Hz to 4000 Hz. Substantial variations in thresholds with center frequency were found in individuals, but no general trends of increasing or decreasing resolution from apex to base were observed in the pooled data. Neither ripple nor STC measures correlated consistently with speech measures in noise and quiet in the sample of subjects in this study. Overall, the results suggest that spectral ripple discrimination measures provide a reasonable measure of spectral resolution that correlates well with more direct, but more time-consuming, measures of spectral resolution, but that such measures do not always provide a clear and robust predictor of performance in speech perception tasks. © 2011 Acoustical Society of America
Anderson, Elizabeth S.; Nelson, David A.; Kreft, Heather; Nelson, Peggy B.; Oxenham, Andrew J.
2011-01-01
Spectral ripple discrimination thresholds were measured in 15 cochlear-implant users with broadband (350–5600 Hz) and octave-band noise stimuli. The results were compared with spatial tuning curve (STC) bandwidths previously obtained from the same subjects. Spatial tuning curve bandwidths did not correlate significantly with broadband spectral ripple discrimination thresholds but did correlate significantly with ripple discrimination thresholds when the rippled noise was confined to an octave-wide passband, centered on the STC’s probe electrode frequency allocation. Ripple discrimination thresholds were also measured for octave-band stimuli in four contiguous octaves, with center frequencies from 500 Hz to 4000 Hz. Substantial variations in thresholds with center frequency were found in individuals, but no general trends of increasing or decreasing resolution from apex to base were observed in the pooled data. Neither ripple nor STC measures correlated consistently with speech measures in noise and quiet in the sample of subjects in this study. Overall, the results suggest that spectral ripple discrimination measures provide a reasonable measure of spectral resolution that correlates well with more direct, but more time-consuming, measures of spectral resolution, but that such measures do not always provide a clear and robust predictor of performance in speech perception tasks. PMID:21786905
Price dynamics and market power in an agent-based power exchange
NASA Astrophysics Data System (ADS)
Cincotti, Silvano; Guerci, Eric; Raberto, Marco
2005-05-01
This paper presents an agent-based model of a power exchange. Supply of electric power is provided by competing generating companies, whereas demand is assumed to be inelastic with respect to price and is constant over time. The transmission network topology is assumed to be a fully connected graph and no transmission constraints are taken into account. The price formation process follows a common scheme for real power exchanges: a clearing house mechanism with uniform price, i.e., with price set equal across all matched buyer-seller pairs. A single class of generating companies is considered, characterized by linear cost function for each technology. Generating companies compete for the sale of electricity through repeated rounds of the uniform auction and determine their supply functions according to production costs. However, an individual reinforcement learning algorithm characterizes generating companies behaviors in order to attain the expected maximum possible profit in each auction round. The paper investigates how the market competitive equilibrium is affected by market microstructure and production costs.
Improving the design of competitive bidding in Medicare Advantage.
Cawley, John H; Whitford, Andrew B
2007-04-01
In 2003, Congress passed the Medicare Prescription Drug, Improvement, and Modernization Act, which required that in 2006 the Centers for Medicare and Medicaid Services (CMS) implement a system of competitive bids to set payments for the Medicare Advantage program. Managed care plans now bid for the right to enroll Medicare beneficiaries. Data from the first year of bidding suggest that imperfect competition is limiting the success of the bidding system. This article offers suggestions to improve this system based on findings from auction theory and previous government-run auctions. In particular, CMS can benefit by adjusting its system of competitive bids in four ways: credibly committing to regulations governing bidding; limiting the scope for collusion, entry deterrence, and predatory behavior among bidders; adjusting how benchmark reimbursement rates are set; and accounting for asymmetric information among bidders.
Flexible Multi agent Algorithm for Distributed Decision Making
2015-01-01
How, J. P. Consensus - Based Auction Approaches for Decentralized task Assignment. Proceedings of the AIAA Guidance, Navigation, and Control...G. ; Kim, Y. Market- based Decentralized Task Assignment for Cooperative UA V Mission Including Rendezvous. Proceedings of the AIAA Guidance...scalable and adaptable to a variety of specific mission tasks . Additionally, the algorithm could easily be adapted for use on land or sea- based systems
Federal Register 2010, 2011, 2012, 2013, 2014
2012-10-02
... Change Related to AIM and SAM September 26, 2012. Pursuant to Section 19(b)(1) of the Securities Exchange.... Under Rule 6.52, Solicitation Auction Mechanism (``SAM''), a Trading Permit Holder that represents... Agency Order for electronic execution into the SAM auction process, under which both the Agency Order and...
2008-12-01
NAVAL POSTGRADUATE SCHOOL MONTEREY, CALIFORNIA THESIS INTEGRATING MONETARY AND NON-MONETARY REENLISTMENT INCENTIVES UTILIZING THE...Monetary and Non- monetary Reenlistment Incentives Utilizing the Combinatorial Retention Auction Mechanism (CRAM) 6. AUTHOR(S) Brooke Zimmerman 5...iii Approved for public release; distribution is unlimited INTEGRATING MONETARY AND NON-MONETARY REENLISTMENT INCENTIVES UTILIZING THE
31 CFR 356.20 - How does the Treasury determine auction awards?
Code of Federal Regulations, 2014 CFR
2014-07-01
... 31 Money and Finance: Treasury 2 2014-07-01 2014-07-01 false How does the Treasury determine... margin for the securities we are auctioning. (2) Accepting bids at the high yield, discount rate, or... the remaining par amount needed to fill the offering amount by the par amount of the bids at the high...
34 CFR 682.302 - Payment of special allowance on FFEL loans.
Code of Federal Regulations, 2013 CFR
2013-07-01
... disbursement is made on or after January 1, 2000; or (B) The 91-day Treasury bills auctioned during the 3-month... the bond equivalent rate of the 91-day Treasury bills auctioned during that quarter, plus 3.1 percent... associated committees of such, the for-profit entity is authorized by law, agreement, or otherwise to approve...
See Art History in a New Light: Have an Art Auction
ERIC Educational Resources Information Center
Benter, Doris J.
2008-01-01
At Portledge School in Locust Valley, New York, ninth graders in their upper school study art history for one semester. The visual arts department has created a vigorous new syllabus culminating in an hour-long mock art auction. The department selects several art movements (e.g., Post-Impressionism, Cubism, Abstract Expressionism, Social Realism,…
Federal Register 2010, 2011, 2012, 2013, 2014
2012-12-20
... both sides would participate in an Exchange Auction, this proposed change would aid in price discovery... auction price. This proposed change would aid in price discovery and help to reduce the likelihood of... Sell Shares and, therefore, a User would never have complete knowledge of liquidity available on both...
Auctions to Reinforce Understanding
ERIC Educational Resources Information Center
Flores, Haynet Rivera
2018-01-01
An auction is a process of buying and selling goods or services by offering them up for bid, taking bids, and then selling each good or service to the highest bidder. Participants bid openly against one another; each bid must be higher than the previous bid. In the activity described rather than goods or services, English teachers sell sentences!…
Federal Register 2010, 2011, 2012, 2013, 2014
2012-04-30
... trades with final money calculations on the night of Auction Date, after the Treasury auction results... end of day netting process. However, when Interactive Messaging was implemented in 2000, this... efficiency, competition, and capital formation. See 15 U.S.C. 78c(f). \\9\\ 17 CFR 200.30-3(a)(12). For the...
76 FR 25711 - Proposed Exemptions from Certain Prohibited Transaction Restrictions
Federal Register 2010, 2011, 2012, 2013, 2014
2011-05-05
...)) of an Auction Rate Security (ARS, as defined in Section III(c)) to Northern Trust Corporation or an... of section 4975 of the Code. Section II. Conditions (a) The Plan acquired the ARS in connection with brokerage or advisory services provided by Northern to the Plan; (b) The last auction for the ARS was...
78 FR 43930 - Proposed Exemptions From Certain Prohibited Transaction Restrictions
Federal Register 2010, 2011, 2012, 2013, 2014
2013-07-22
...), of certain rights issued to owners of Auction Rate Securities by UBS AG (ARS Rights) in connection with a Settlement Agreement, (b) the sale of an Auction Rate Security to UBS pursuant to such ARS... in Section III (a) The terms and delivery of the offer of ARS Rights (the ARS Rights Offer) are...
Understanding Persuasive Online Sales Messages from eBay Auctions
ERIC Educational Resources Information Center
White, Barbara Jo; Clapper, Danial; Noel, Rita; Fortier, Jenny; Grabolosa, Pierre
2007-01-01
Online auctions are dominated by eBay, which started bringing together buyers and sellers in 1995. eBay product listings can easily be used in business communication courses to better understand online sales messages. One great advantage is that the vast majority of nearly 15 million listings a day are written and assembled by everyday consumers…
Federal Register 2010, 2011, 2012, 2013, 2014
2010-09-23
... technical and marketplace factors that may have a bearing on the value of the construction permits for... auction pace that reasonably balances speed with the bidders' need to study round results and adjust their... and other factors. The Bureaus seek comment on this proposal. Commenters may wish to address the role...
78 FR 46425 - Sale and Issue of Marketable Book-Entry Treasury Bills, Notes, and Bonds
Federal Register 2010, 2011, 2012, 2013, 2014
2013-07-31
... a simple-interest money market yield computed on an actual/360 basis, subject to an appropriate... 13-week Treasury bill auction High Rate (stop out rate) converted into a simple actual/360 interest...-week Treasury bill auction High Rate that has been translated into a simple-interest money market yield...
31 CFR 356.4 - What are the book-entry systems in which auctioned Treasury securities may be issued?
Code of Federal Regulations, 2010 CFR
2010-07-01
... in which auctioned Treasury securities may be issued? There are three book-entry securities systems... marketable Treasury securities. We maintain and transfer securities in these three book-entry systems at... inflation. Securities may be transferred from one system to the other, unless the securities are not...
Code of Federal Regulations, 2014 CFR
2014-10-01
... 49 Transportation 7 2014-10-01 2014-10-01 false Requirements and limitations for salvage auctions that are consigned trade-in vehicles under the CARS program. 599.402 Section 599.402 Transportation Other Regulations Relating to Transportation (Continued) NATIONAL HIGHWAY TRAFFIC SAFETY ADMINISTRATION, DEPARTMENT OF TRANSPORTATION (CONTINUED)...
Code of Federal Regulations, 2011 CFR
2011-10-01
... 49 Transportation 7 2011-10-01 2011-10-01 false Requirements and limitations for salvage auctions that are consigned trade-in vehicles under the CARS program. 599.402 Section 599.402 Transportation Other Regulations Relating to Transportation (Continued) NATIONAL HIGHWAY TRAFFIC SAFETY ADMINISTRATION, DEPARTMENT OF TRANSPORTATION (CONTINUED)...
Code of Federal Regulations, 2012 CFR
2012-10-01
... 49 Transportation 7 2012-10-01 2012-10-01 false Requirements and limitations for salvage auctions that are consigned trade-in vehicles under the CARS program. 599.402 Section 599.402 Transportation Other Regulations Relating to Transportation (Continued) NATIONAL HIGHWAY TRAFFIC SAFETY ADMINISTRATION, DEPARTMENT OF TRANSPORTATION (CONTINUED)...
Code of Federal Regulations, 2013 CFR
2013-10-01
... 49 Transportation 7 2013-10-01 2013-10-01 false Requirements and limitations for salvage auctions that are consigned trade-in vehicles under the CARS program. 599.402 Section 599.402 Transportation Other Regulations Relating to Transportation (Continued) NATIONAL HIGHWAY TRAFFIC SAFETY ADMINISTRATION, DEPARTMENT OF TRANSPORTATION (CONTINUED)...
Teaching Auction Strategy Using Experiments Administered Via the Internet
ERIC Educational Resources Information Center
Asker, John; Grosskopf, Brit; McKinney, C. Nicholas; Niederle, Muriel; Roth, Alvin E.; Weizsacker, Georg
2004-01-01
The authors present an experimental design used to teach concepts in the economics of auctions and implications for e-Business procurement. The experiment is easily administered and can be adapted to many different treatments. The chief innovation is that it does not require the use of a lab or class time. Instead, the design can be implemented on…
Federal Register 2010, 2011, 2012, 2013, 2014
2012-09-17
... Organizations; C2 Options Exchange, Incorporated; Notice of Filing of a Proposed Rule Change Relating to Complex... its Rules regarding complex order auctions. The text of the proposed rule change is available on the... basis, the Exchange may activate the electronic complex order request for responses (``RFR'') auction...
Federal Register 2010, 2011, 2012, 2013, 2014
2012-10-30
... Organizations; C2 Options Exchange, Incorporated; Order Approving Proposed Rule Change Relating to the Complex...,\\2\\ a proposed rule change to modify C2 Rule 6.13(c), ``Process for Complex Order RFR Auction,'' to... at the start of a Complex Order Auction (``COA''); and (ii) require responses to an RFR message...
Federal Register 2010, 2011, 2012, 2013, 2014
2012-02-16
...-032). Specifically, the Exchange proposes to amend several portions of Rule 11.23 to allow MOO, LOO, and LLOO orders to participate in IPO Auctions. Under the proposal, MOO orders would behave like... modifications to the definitions of MOO, LOO, and LLOO orders and to make clear that these Opening Auction...
He, Feng; Zhao, Lin; Li, Ershuai
2017-01-01
Ethernet-AVB/TSN (Audio Video Bridging/Time-Sensitive Networking) and AFDX (Avionics Full DupleX switched Ethernet) are switched Ethernet technologies, which are both candidates for real-time communication in the context of transportation systems. AFDX implements a fixed priority scheduling strategy with two priority levels. Ethernet-AVB/TSN supports a similar fixed priority scheduling with an additional Credit-Based Shaper (CBS) mechanism. Besides, TSN can support time-triggered scheduling strategy. One direct effect of CBS mechanism is to increase the delay of its flows while decreasing the delay of other priority ones. The former effect can be seen as the shaping restriction and the latter effect can be seen as the shaping benefit from CBS. The goal of this paper is to investigate the impact of CBS on different priority flows, especially on the intermediate priority ones, as well as the effect of CBS bandwidth allocation. It is based on a performance comparison of AVB/TSN and AFDX by simulation in an automotive case study. Furthermore, the shaping benefit is modeled based on integral operation from network calculus perspective. Combing with the analysis of shaping restriction and shaping benefit, some configuration suggestions on the setting of CBS bandwidth are given. Results show that the effect of CBS depends on flow loads and CBS configurations. A larger load of high priority flows in AVB tends to a better performance for the intermediate priority flows when compared with AFDX. Shaping benefit can be explained and calculated according to the changing from the permitted maximum burst. PMID:28531158
An All-Optical Access Metro Interface for Hybrid WDM/TDM PON Based on OBS
NASA Astrophysics Data System (ADS)
Segarra, Josep; Sales, Vicent; Prat, Josep
2007-04-01
A new all-optical access metro network interface based on optical burst switching (OBS) is proposed. A hybrid wavelength-division multiplexing/time-division multiplexing (WDM/TDM) access architecture with reflective optical network units (ONUs), an arrayed-waveguide-grating outside plant, and a tunable laser stack at the optical line terminal (OLT) is presented as a solution for the passive optical network. By means of OBS and a dynamic bandwidth allocation (DBA) protocol, which polls the ONUs, the available access bandwidth is managed. All the network intelligence and costly equipment is located at the OLT, where the DBA module is centrally implemented, providing quality of service (QoS). To scale this access network, an optical cross connect (OXC) is then used to attain a large number of ONUs by the same OLT. The hybrid WDM/TDM structure is also extended toward the metropolitan area network (MAN) by introducing the concept of OBS multiplexer (OBS-M). The network element OBS-M bridges the MAN and access networks by offering all-optical cross connection, wavelength conversion, and data signaling. The proposed innovative OBS-M node yields a full optical data network, interfacing access and metro with a geographically distributed access control. The resulting novel access metro architectures are nonblocking and, with an improved signaling, provide QoS, scalability, and very low latency. Finally, numerical analysis and simulations demonstrate the traffic performance of the proposed access scheme and all-optical access metro interface and architectures.
Root Raised Cosine (RRC) Filters and Pulse Shaping in Communication Systems
NASA Technical Reports Server (NTRS)
Cubukcu, Erkin
2012-01-01
This presentation briefly discusses application of the Root Raised Cosine (RRC) pulse shaping in the space telecommunication. Use of the RRC filtering (i.e., pulse shaping) is adopted in commercial communications, such as cellular technology, and used extensively. However, its use in space communication is still relatively new. This will possibly change as the crowding of the frequency spectrum used in the space communication becomes a problem. The two conflicting requirements in telecommunication are the demand for high data rates per channel (or user) and need for more channels, i.e., more users. Theoretically as the channel bandwidth is increased to provide higher data rates the number of channels allocated in a fixed spectrum must be reduced. Tackling these two conflicting requirements at the same time led to the development of the RRC filters. More channels with wider bandwidth might be tightly packed in the frequency spectrum achieving the desired goals. A link model with the RRC filters has been developed and simulated. Using 90% power Bandwidth (BW) measurement definition showed that the RRC filtering might improve spectrum efficiency by more than 75%. Furthermore using the matching RRC filters both in the transmitter and receiver provides the improved Bit Error Rate (BER) performance. In this presentation the theory of three related concepts, namely pulse shaping, Inter Symbol Interference (ISI), and Bandwidth (BW) will be touched upon. Additionally the concept of the RRC filtering and some facts about the RRC filters will be presented
A Feasibility Study on the Control of a Generic Air Vehicle Using Control Moment Gyros
NASA Technical Reports Server (NTRS)
Lim, Kyong B.; Moerder, Daniel D.
2006-01-01
This paper examines feasibility and performance issues in using Control Moment Gyroscopes (CMGs) to control the attitude of a fixed-wing aircraft. The paper describes a control system structure that permits allocating control authority and bandwidth between a CMG system and conventional aerodynamic control surfaces to stabilize a vehicle with neutral aerodynamic stability. A simulation study explores the interplay between aerodynamic and CMG effects, and indicates desirable physical characteristics for a CMG system to be used for aircraft attitude control.
Multi-Agent Task Negotiation Among UAVs to Defend Against Swarm Attacks
2012-03-01
are based on economic models [39]. Auction methods of task coordination also attempt to deal with agents dealing with noisy, dynamic environments...August 2006. [34] M. Alighanbari, “ Robust and decentralized task assignment algorithms for uavs,” Ph.D. dissertation, Massachusetts Institute of Technology...Implicit Coordination . . . . . . . . . . . . . 12 2.4 Decentralized Algorithm B - Market- Based . . . . . . . . . . . . . . . . 12 2.5 Decentralized
Drechsler, Martin
2017-02-01
Auctions have been proposed as alternatives to payments for environmental services when spatial interactions and costs are better known to landowners than to the conservation agency (asymmetric information). Recently, an auction scheme was proposed that delivers optimal conservation in the sense that social welfare is maximized. I examined the social welfare and the budget efficiency delivered by this scheme, where social welfare represents the difference between the monetized ecological benefit and the conservation cost incurred to the landowners and budget efficiency is defined as maximizing the ecological benefit for a given conservation budget. For the analysis, I considered a stylized landscape with land patches that can be used for agriculture or conservation. The ecological benefit was measured by an objective function that increases with increasing number and spatial aggregation of conserved land patches. I compared the social welfare and the budget efficiency of the auction scheme with an agglomeration payment, a policy scheme that considers spatial interactions and that was proposed recently. The auction delivered a higher level of social welfare than the agglomeration payment. However, the agglomeration payment was more efficient budgetarily than the auction, so the comparative performances of the 2 schemes depended on the chosen policy criterion-social welfare or budget efficiency. Both policy criteria are relevant for conservation. Which one should be chosen depends on the problem at hand, for example, whether social preferences should be taken into account in the decision of how much money to invest in conservation or whether the available conservation budget is strictly limited. © 2016 Society for Conservation Biology.
Ohtani, Hisakazu; Imaoka, Ayuko; Akiyoshi, Takeshi
2015-01-01
In Japan, it is illegal to sell pharmaceuticals on Internet auction sites, although a considerable number of pharmaceuticals are listed on such sites. We investigated the current situation regarding the illegal trade in pharmaceuticals on Japanese Internet auction sites and the responses of site administrators to such transactions. We searched for pharmaceuticals and "gray" items that were suspected of being pharmaceuticals on Yahoo-oku! (Yahoo! Auctions, Japan) over a 37-day period and then submitted violation reports indicating that selling pharmaceuticals is illegal or that the description of an item was insufficient. The reports were directed to the site administrators and forwarded to the sellers. One hundred and six pharmaceutical products and 34 gray items were identified during the study period. After the submission of the violation reports, only 28 of the pharmaceutical products and one of the gray items were deleted by the administrator, while 18 of the pharmaceutical products and 7 of the gray items were withdrawn by their sellers. However, 41 pharmaceuticals and 20 gray items were sold. Most of the gray items were listed using characteristic terms or abbreviations without photographic images. More than 70% of the identified pharmaceuticals had a contraindication(s) other than hypersensitivity. In conclusion, the illegal trade in pharmaceuticals on Internet auction sites remains a serious problem in Japan, and the responses of site administrators to such transactions are inadequate. The government and pharmaceutical industry may have to take measures such as providing public and administrative guidance to stop the illegal trade in pharmaceuticals on the Internet.
Solve the organ shortage: let the bidding begin!
Kevorkian, J
2001-01-01
Commercialization of transplantable human organs is the only sure way to end the crisis of their supply. This is best accomplished by implementing a free, non-profit, nationwide, ultimately global online auction market. It should be independent of the current United Network of Organ Sharing (UNOS) system dealing solely with altruistic donation, and of governmental, sectarian, academic, and other bureaucratic control. The operation of such an auction is described with a hypothetical example. An included provision guarantees equity for poor, uninsured, and indigent recipients. Money accrued can be substantial, and would be disbursed by established formula, with major portions going to donors' families and to special funds to be used to bid for the poor and to defray costs incurred by them. As the organ shortage eases, bid prices should drop, resulting perhaps in eventual altruistic donation. Objections to commericalization based on ethics, bodily sanctity, inequity, pecuniary greed, and the slippery slope tocsin are nullified by cogent arguments and examples. The current situation has worsened despite so-called required request laws, proposed token payments to cover funeral expenses for donor families, and extensive media advertising to spur altruistic donation. Prohibitive national and state laws must be rescinded for the sake of more than 60,000 patients now on lengthening waiting lists. A profession committed to saving lives is duty-bound to endorse, help implement, and participate in an auction system dedicated to that end.
31 CFR 356.5 - What types of securities does the Treasury auction?
Code of Federal Regulations, 2011 CFR
2011-07-01
... securities. (a) Treasury bills. (1) Are issued at a discount or at par, depending upon the auction results; (2) Are redeemed at their par amount at maturity; and (3) Have maturities of not more than one year... 31 Money and Finance:Treasury 2 2011-07-01 2011-07-01 false What types of securities does the...
31 CFR 356.5 - What types of securities does the Treasury auction?
Code of Federal Regulations, 2014 CFR
2014-07-01
... securities. (a) Treasury bills. (1) Are issued at a discount or at par, depending upon the auction results; (2) Are redeemed at their par amount at maturity; and (3) Have maturities of not more than one year... 31 Money and Finance: Treasury 2 2014-07-01 2014-07-01 false What types of securities does the...
31 CFR 356.5 - What types of securities does the Treasury auction?
Code of Federal Regulations, 2012 CFR
2012-07-01
... securities. (a) Treasury bills. (1) Are issued at a discount or at par, depending upon the auction results; (2) Are redeemed at their par amount at maturity; and (3) Have maturities of not more than one year... 31 Money and Finance:Treasury 2 2012-07-01 2012-07-01 false What types of securities does the...
31 CFR 356.5 - What types of securities does the Treasury auction?
Code of Federal Regulations, 2013 CFR
2013-07-01
... securities. (a) Treasury bills. (1) Are issued at a discount or at par, depending upon the auction results; (2) Are redeemed at their par amount at maturity; and (3) Have maturities of not more than one year... 31 Money and Finance:Treasury 2 2013-07-01 2013-07-01 false What types of securities does the...
34 CFR 685.202 - Charges for which Direct Loan Program borrowers are responsible.
Code of Federal Regulations, 2010 CFR
2010-07-01
... held prior to that June 1 plus 3.1 percentage points, but does not exceed 8.25 percent. (ii) Loans... plus 2.5 percentage points, but does not exceed 8.25 percent. (B) During all other periods. The...-day Treasury bills auctioned at the final auction held prior to that June 1 plus 3.1 percentage points...
Teaching Undergraduate Money and Banking: T-Bill Auctions and Stock Market Models
ERIC Educational Resources Information Center
Saros, Daniel E.
2009-01-01
The author offers innovative approaches to 3 topics that are typically only briefly mentioned (if at all) in money and banking courses. The first topic is a Treasury bill auction experiment in which students have an opportunity to participate directly. The results from a class of 14 money and banking students are used to explain how an instructor…
Federal Register 2010, 2011, 2012, 2013, 2014
2012-05-31
... Mobility Fund Phase I support they seek, including any agreements relating to post-auction market structure... FEDERAL COMMUNICATIONS COMMISSION [AU Docket No. 12-25; DA 12-641 and DA 12-721] Mobility Fund... million in one-time Mobility Fund Phase I support scheduled to commence on September 27, 2012. The Bureaus...
Federal Register 2010, 2011, 2012, 2013, 2014
2011-01-18
... DEPARTMENT OF THE INTERIOR Bureau of Land Management [LLNVS00560 L58530000.EU0000 241A; N-81926 et al.; 11-08807; TAS: 14X5232] Notice of Correction to Notice of Realty Action: Competitive Online Auction of Public Lands in Clark County, NV AGENCY: Bureau of Land Management, Interior. ACTION: Notice of...
Code of Federal Regulations, 2011 CFR
2011-01-01
... decides to sell acquired agricultural real estate at a public auction? 617.7620 Section 617.7620 Banks and... What should the System institution do when it decides to sell acquired agricultural real estate at a public auction? System institutions electing to sell or lease acquired agricultural real estate or a...
Code of Federal Regulations, 2010 CFR
2010-01-01
... decides to sell acquired agricultural real estate at a public auction? 617.7620 Section 617.7620 Banks and... What should the System institution do when it decides to sell acquired agricultural real estate at a public auction? System institutions electing to sell or lease acquired agricultural real estate or a...
Federal Register 2010, 2011, 2012, 2013, 2014
2011-01-21
.... The commenter also argues that, in the event that only one applicant places a bid on a permit, that...). The Commission makes no warranty whatsoever with respect to the FCC Auction System. In no event shall..., 2011 Short-Form Application (FCC Form 175) Filing Window Opens--January 31, 2011; 12 noon ET Short-Form...
25 CFR 215.4 - Leases to be sold at public auction.
Code of Federal Regulations, 2010 CFR
2010-04-01
... 25 Indians 1 2010-04-01 2010-04-01 false Leases to be sold at public auction. 215.4 Section 215.4 Indians BUREAU OF INDIAN AFFAIRS, DEPARTMENT OF THE INTERIOR ENERGY AND MINERALS LEAD AND ZINC MINING... provided in the regulations in this part, no lead and zinc mining lease under this part of restricted or...
25 CFR 215.4 - Leases to be sold at public auction.
Code of Federal Regulations, 2011 CFR
2011-04-01
... 25 Indians 1 2011-04-01 2011-04-01 false Leases to be sold at public auction. 215.4 Section 215.4 Indians BUREAU OF INDIAN AFFAIRS, DEPARTMENT OF THE INTERIOR ENERGY AND MINERALS LEAD AND ZINC MINING... provided in the regulations in this part, no lead and zinc mining lease under this part of restricted or...
75 FR 38545 - Notice of Realty Action: Competitive Auction of Public Lands in White Pine County, NV
Federal Register 2010, 2011, 2012, 2013, 2014
2010-07-02
... DEPARTMENT OF THE INTERIOR Bureau of Land Management [LLNVL01000 L14300000.EU0000 241A; N-86667; 10-08807; MO 4500012445; TAS: 14X5232] Notice of Realty Action: Competitive Auction of Public Lands..., cashier's check, certified check or U.S. postal money order, or any combination thereof, and made payable...
7 CFR 29.75a - Display of burley tobacco on auction warehouse floors in designated markets.
Code of Federal Regulations, 2010 CFR
2010-01-01
... in designated markets. 29.75a Section 29.75a Agriculture Regulations of the Department of Agriculture... § 29.75a Display of burley tobacco on auction warehouse floors in designated markets. (a)(1) Each lot... arrayed sequence of lots and rows of tobacco, shall have prior approval of the Set Work Leader or Circuit...
77 FR 15369 - Mobility Fund Phase I Auction GIS Data of Potentially Eligible Census Blocks
Federal Register 2010, 2011, 2012, 2013, 2014
2012-03-15
....fcc.gov/auctions/901/ , are the following: Downloadable shapefile Web mapping service MapBox map tiles... GIS software allows you to add this service as a layer to your session or project. 6. MapBox map tiles are cached map tiles of the data. With this open source software approach, these image tiles can be...
Rousu, Matthew C.; Thrasher, James F.
2014-01-01
Experimental and observational research often involves asking consumers to self-report the impact of some proposed option. Because self-reported responses involve no consequence to the respondent for falsely revealing how he or she feels about an issue, self-reports may be subject to social desirability and other influences that bias responses in important ways. In this article, we analyzed data from an experiment on the impact of cigarette packaging and pack warnings, comparing smokers’ self-reported impact (four-item scale) and the bids they placed in experimental auctions to estimate differences in demand. The results were consistent across methods; however, the estimated effect size associated with different warning labels was two times greater for the four-item self-reported response scale when compared to the change in demand as indicated by auction bids. Our study provides evidence that self-reported psychosocial responses provide a valid proxy for behavioral change as reflected by experimental auction bidding behavior. More research is needed to better understand the advantages and disadvantages of behavioral economic methods and traditional self-report approaches to evaluating health behavior change interventions. PMID:24399267
Bandwidth turbulence control based on flow community structure in the Internet
NASA Astrophysics Data System (ADS)
Wu, Xiaoyu; Gu, Rentao; Ji, Yuefeng
2016-10-01
Bursty flows vary rapidly in short period of time, and cause fierce bandwidth turbulence in the Internet. In this letter, we model the flow bandwidth turbulence process by constructing a flow interaction network (FIN network), with nodes representing flows and edges denoting bandwidth interactions among them. To restrain the bandwidth turbulence in FIN networks, an immune control strategy based on flow community structure is proposed. Flows in community boundary positions are immunized to cut off the inter-community turbulence spreading. By applying this control strategy in the first- and the second-level flow communities separately, 97.2% flows can effectively avoid bandwidth variations by immunizing 21% flows, and the average bandwidth variation degree reaches near zero. To achieve a similar result, about 70%-90% immune flows are needed with targeted control strategy based on flow degrees and random control strategy. Moreover, simulation results showed that the control effect of the proposed strategy improves significantly if the immune flow number is relatively smaller in each control step.
Analysis of blocking probability for OFDM-based variable bandwidth optical network
NASA Astrophysics Data System (ADS)
Gong, Lei; Zhang, Jie; Zhao, Yongli; Lin, Xuefeng; Wu, Yuyao; Gu, Wanyi
2011-12-01
Orthogonal Frequency Division Multiplexing (OFDM) has recently been proposed as a modulation technique. For optical networks, because of its good spectral efficiency, flexibility, and tolerance to impairments, optical OFDM is much more flexible compared to traditional WDM systems, enabling elastic bandwidth transmissions, and optical networking is the future trend of development. In OFDM-based optical network the research of blocking rate has very important significance for network assessment. Current research for WDM network is basically based on a fixed bandwidth, in order to accommodate the future business and the fast-changing development of optical network, our study is based on variable bandwidth OFDM-based optical networks. We apply the mathematical analysis and theoretical derivation, based on the existing theory and algorithms, research blocking probability of the variable bandwidth of optical network, and then we will build a model for blocking probability.
Effect of herd cues and product involvement on bidder online choices.
Chen, Yi-Fen; Wang, Ya-Ju
2010-08-01
Previous works have shown that consumers are influenced by others in decision making. Herd behavior is common in situations in which consumers infer product quality from other consumer choices and incorporate that information into their own decision making. This research presents two studies examining herd effect and the moderating role of product involvement on bidder choices in online auctions. The two studies addressed the influence on bidder online choices of herd cues frequently found in online auctions, including feedback ratings and number of questions and answers. The experimental results demonstrated that bidders use online herd cues when making decisions in online auctions. Additionally, the effects of herd cues on bidder online choices were stronger in high-involvement than low-involvement participants. Results and implications are discussed.
Low-traffic limit and first-passage times for a simple model of the continuous double auction
NASA Astrophysics Data System (ADS)
Scalas, Enrico; Rapallo, Fabio; Radivojević, Tijana
2017-11-01
We consider a simplified model of the continuous double auction where prices are integers varying from 1 to N with limit orders and market orders, but quantity per order limited to a single share. For this model, the order process is equivalent to two M / M / 1 queues. We study the behavior of the auction in the low-traffic limit where limit orders are immediately matched by market orders. In this limit, the distribution of prices can be computed exactly and gives a reasonable approximation of the price distribution when the ratio between the rate of order arrivals and the rate of order executions is below 1 / 2. This is further confirmed by the analysis of the first-passage time in 1 or N.
Maciejovsky, Boris; Budescu, David V
2007-05-01
There is strong evidence that groups perform better than individuals do on intellective tasks with demonstrably correct solutions. Typically, these studies assume that group members share common goals. The authors extend this line of research by replacing standard face-to-face group interactions with competitive auctions, allowing for conflicting individual incentives. In a series of studies involving the well-known Wason selection task, they demonstrate that competitive auctions induce learning effects equally impressive as those of standard group interactions, and they uncover specific and general knowledge transfers from these institutions to new reasoning problems. The authors identify payoff feedback and information pooling as the driving factors underlying these findings, and they explain these factors within the theoretical framework of collective induction. ((c) 2007 APA, all rights reserved).
Market-Based Multirobot Coordination: A Survey and Analysis
2005-04-01
observe new information about their surroundings. Market -based approaches can often seamlessly incorporate online tasks by auctioning new tasks as they... Market -Based Multirobot Coordination: A Survey and Analysis M. Bernardine Dias, Robert Zlot, Nidhi Kalra, and Anthony Stentz CMU-RI-TR-05-13 April...00-00-2005 to 00-00-2005 4. TITLE AND SUBTITLE Market -Based Multirobot Coordination: A Survey and Analysis 5a. CONTRACT NUMBER 5b. GRANT NUMBER
Orchestrating Bulk Data Movement in Grid Environments
DOE Office of Scientific and Technical Information (OSTI.GOV)
Vazhkudai, SS
2005-01-25
Data Grids provide a convenient environment for researchers to manage and access massively distributed bulk data by addressing several system and transfer challenges inherent to these environments. This work addresses issues involved in the efficient selection and access of replicated data in Grid environments in the context of the Globus Toolkit{trademark}, building middleware that (1) selects datasets in highly replicated environments, enabling efficient scheduling of data transfer requests; (2) predicts transfer times of bulk wide-area data transfers using extensive statistical analysis; and (3) co-allocates bulk data transfer requests, enabling parallel downloads from mirrored sites. These efforts have demonstrated a decentralizedmore » data scheduling architecture, a set of forecasting tools that predict bandwidth availability within 15% error and co-allocation architecture, and heuristics that expedites data downloads by up to 2 times.« less
Pyrrhic victories: the need for social status drives costly competitive behavior.
van den Bos, Wouter; Golka, Philipp J M; Effelsberg, David; McClure, Samuel M
2013-01-01
Competitive behavior is commonly defined as the decision to maximize one's payoffs relative to others. We argue instead that competitive drive derives from a desire for social status. We make use of a multi-player auction task in which subjects knowingly incur financial losses for the sake of winning auctions. First, we show that overbidding is increased when the task includes members of a rival out-group, suggesting that social identity is an important mediator of competitiveness. In addition, we show that the extent that individuals are willing to incur losses is related to affective responses to social comparisons but not to monetary outcomes. Second, we show that basal levels of testosterone predict overbidding, and that this effect of testosterone is mediated by affective responses to social comparisons. Based on these findings, we argue that competitive behavior should be conceptualized in terms of social motivations as opposed to just relative monetary payoffs.
Pyrrhic victories: the need for social status drives costly competitive behavior
van den Bos, Wouter; Golka, Philipp J. M.; Effelsberg, David; McClure, Samuel M.
2013-01-01
Competitive behavior is commonly defined as the decision to maximize one's payoffs relative to others. We argue instead that competitive drive derives from a desire for social status. We make use of a multi-player auction task in which subjects knowingly incur financial losses for the sake of winning auctions. First, we show that overbidding is increased when the task includes members of a rival out-group, suggesting that social identity is an important mediator of competitiveness. In addition, we show that the extent that individuals are willing to incur losses is related to affective responses to social comparisons but not to monetary outcomes. Second, we show that basal levels of testosterone predict overbidding, and that this effect of testosterone is mediated by affective responses to social comparisons. Based on these findings, we argue that competitive behavior should be conceptualized in terms of social motivations as opposed to just relative monetary payoffs. PMID:24167468
Effects of scarcity, aesthetics and ecology on wildlife auction prices of large African mammals.
Dalerum, Fredrik; Miranda, María; Muñiz, Cristina; Rodríguez, Plácido
2018-02-01
For successful integration of biological conservation into economic markets, economic processes need to capture ecological values. South African wildlife ranching is a tourist-based activity that generates unique information on the economic value of wildlife species. We used public data from South African wildlife auctions to evaluate if annual prices 1991-2012 related to species characteristics associated with scarcity, aesthetics and ecology of South African carnivores and ungulates. While none of the species characteristics influenced carnivore prices, ungulate prices were related to characteristics associated with novelty and aesthetics, which relative importance had increased over time. We raise both ecological and economic concerns for this apparent focus. Our results also suggest a potential importance of non-species-related factors, such as market and buyer characteristics. We encourage further evaluation of the relative influences of species characteristics versus factors that are intrinsically linked to economic processes on price variations in South African wildlife.
NASA Astrophysics Data System (ADS)
Zhang, Wei; Bi, Zhengzheng; Shen, Dehua
2017-02-01
This paper investigates the impact of investor structure on the price-volume relationship by simulating a continuous double auction market. Connected with the underlying mechanisms of the price-volume relationship, i.e., the Mixture of Distribution Hypothesis (MDH) and the Sequential Information Arrival Hypothesis (SIAH), the simulation results show that: (1) there exists a strong lead-lag relationship between the return volatility and trading volume when the number of informed investors is close to the number of uninformed investors in the market; (2) as more and more informed investors entering the market, the lead-lag relationship becomes weaker and weaker, while the contemporaneous relationship between the return volatility and trading volume becomes more prominent; (3) when the informed investors are in absolute majority, the market can achieve the new equilibrium immediately. Therefore, we can conclude that the investor structure is a key factor in affecting the price-volume relationship.
2009-03-01
homeport, geographic stability for two tours and compressed work week; homeport, lump sum SRB, and telecommuting ). The Monte Carlo simulation...Geographic stability 2 tours, and compressed work week). The Add 2 combination includes home port choice, lump sum SRB, and telecommuting ...VALUATION OF NON-MONETARY INCENTIVES: MOTIVATING AND IMPLEMENTING THE COMBINATORIAL RETENTION AUCTION MECHANISM by Jason Blake Ellis March 2009
Code of Federal Regulations, 2010 CFR
2010-07-01
... 31 Money and Finance: Treasury 2 2010-07-01 2010-07-01 false What could happen if someone does not... Finance: Treasury Regulations Relating to Money and Finance (Continued) FISCAL SERVICE, DEPARTMENT OF THE... person or entity from participating in future auctions under this part. We also may refer the matter to...
Code of Federal Regulations, 2011 CFR
2011-07-01
... 31 Money and Finance:Treasury 2 2011-07-01 2011-07-01 false What could happen if someone does not... Finance: Treasury Regulations Relating to Money and Finance (Continued) FISCAL SERVICE, DEPARTMENT OF THE... person or entity from participating in future auctions under this part. We also may refer the matter to...
Code of Federal Regulations, 2013 CFR
2013-07-01
... 31 Money and Finance:Treasury 2 2013-07-01 2013-07-01 false What could happen if someone does not... Finance: Treasury Regulations Relating to Money and Finance (Continued) FISCAL SERVICE, DEPARTMENT OF THE... person or entity from participating in future auctions under this part. We also may refer the matter to...
Code of Federal Regulations, 2014 CFR
2014-07-01
... 31 Money and Finance: Treasury 2 2014-07-01 2014-07-01 false What could happen if someone does not... Finance: Treasury Regulations Relating to Money and Finance (Continued) FISCAL SERVICE, DEPARTMENT OF THE... barring the person or entity from participating in future auctions under this part. We also may refer the...
Code of Federal Regulations, 2012 CFR
2012-07-01
... 31 Money and Finance:Treasury 2 2012-07-01 2012-07-01 false What could happen if someone does not... Finance: Treasury Regulations Relating to Money and Finance (Continued) FISCAL SERVICE, DEPARTMENT OF THE... person or entity from participating in future auctions under this part. We also may refer the matter to...
Federal Register 2010, 2011, 2012, 2013, 2014
2010-08-06
... the past sale of certain Auction Rate Securities (ARS) by the Four-Way Tool & Die, Inc. Profit Sharing... of section 4975 of the Code. (A) The subject ARS were acquired for the Plan by Citizens Bank Wealth...) The last auction for each of the ARS was unsuccessful; (C) The sale of the ARS was directly between...