52 resultados para Reactive power scheduling
em Consorci de Serveis Universitaris de Catalunya (CSUC), Spain
Resumo:
We present a polyhedral framework for establishing general structural properties on optimal solutions of stochastic scheduling problems, where multiple job classes vie for service resources: the existence of an optimal priority policy in a given family, characterized by a greedoid (whose feasible class subsets may receive higher priority), where optimal priorities are determined by class-ranking indices, under restricted linear performance objectives (partial indexability). This framework extends that of Bertsimas and Niño-Mora (1996), which explained the optimality of priority-index policies under all linear objectives (general indexability). We show that, if performance measures satisfy partial conservation laws (with respect to the greedoid), which extend previous generalized conservation laws, then the problem admits a strong LP relaxation over a so-called extended greedoid polytope, which has strong structural and algorithmic properties. We present an adaptive-greedy algorithm (which extends Klimov's) taking as input the linear objective coefficients, which (1) determines whether the optimal LP solution is achievable by a policy in the given family; and (2) if so, computes a set of class-ranking indices that characterize optimal priority policies in the family. In the special case of project scheduling, we show that, under additional conditions, the optimal indices can be computed separately for each project (index decomposition). We further apply the framework to the important restless bandit model (two-action Markov decision chains), obtaining new index policies, that extend Whittle's (1988), and simple sufficient conditions for their validity. These results highlight the power of polyhedral methods (the so-called achievable region approach) in dynamic and stochastic optimization.
Resumo:
We present a polyhedral framework for establishing general structural properties on optimal solutions of stochastic scheduling problems, where multiple job classes vie for service resources: the existence of an optimal priority policy in a given family, characterized by a greedoid(whose feasible class subsets may receive higher priority), where optimal priorities are determined by class-ranking indices, under restricted linear performance objectives (partial indexability). This framework extends that of Bertsimas and Niño-Mora (1996), which explained the optimality of priority-index policies under all linear objectives (general indexability). We show that, if performance measures satisfy partial conservation laws (with respect to the greedoid), which extend previous generalized conservation laws, then theproblem admits a strong LP relaxation over a so-called extended greedoid polytope, which has strong structural and algorithmic properties. We present an adaptive-greedy algorithm (which extends Klimov's) taking as input the linear objective coefficients, which (1) determines whether the optimal LP solution is achievable by a policy in the given family; and (2) if so, computes a set of class-ranking indices that characterize optimal priority policies in the family. In the special case of project scheduling, we show that, under additional conditions, the optimal indices can be computed separately for each project (index decomposition). We further apply the framework to the important restless bandit model (two-action Markov decision chains), obtaining new index policies, that extend Whittle's (1988), and simple sufficient conditions for their validity. These results highlight the power of polyhedral methods (the so-called achievable region approach) in dynamic and stochastic optimization.
Resumo:
The influence of radio frequency (rf) power and pressure on deposition rate and structural properties of hydrogenated amorphous silicon (a-Si:H) thin films, prepared by rf glow discharge decomposition of silane, have been studied by phase modulated ellipsometry and Fourier transform infrared spectroscopy. It has been found two pressure regions separated by a threshold value around 20 Pa where the deposition rate increases suddenly. This behavior is more marked as rf power rises and reflects the transition between two rf discharges regimes. The best quality films have been obtained at low pressure and at low rf power but with deposition rates below 0.2 nm/s. In the high pressure region, the enhancement of deposition rate as rf power increases first gives rise to a reduction of film density and an increase of content of hydrogen bonded in polyhydride form because of plasma polymerization reactions. Further rise of rf power leads to a decrease of polyhydride bonding and the material density remains unchanged, thus allowing the growth of a-Si:H films at deposition rates above 1 nm/s without any important detriment of material quality. This overcoming of deposition rate limitation has been ascribed to the beneficial effects of ion bombardment on the a-Si:H growing surface by enhancing the surface mobility of adsorbed reactive species and by eliminating hydrogen bonded in polyhydride configurations.
Resumo:
We consider the collective incentives of buyers and sellers to form cartels in markets where trade is realized through decentralized pairwise bargaining. Cartels are coalitions of buyers or sellers that limit market participation and compensate inactive members for abstaining from trade. In a stable market outcome, cartels set Nash equilibrium quantities and cartel memberships are immune to defections. We prove that the set of stable market outcomes is non-empty and we provide its full characterization. Stable market outcomes are of two types: (i) at least one cartel actively restrains trade and the levels of market participation are balanced, or (ii) only one cartel, eventually the cartel that forms on the long side of the market, is active and it reduces trade slightly below the opponent's.
Resumo:
We study whether selection affects motivation. In our experiment subjects first answer a personality questionnaire. They then play a 3-person game. One of the three players decides between an outside option assigning him a positive amount, but leaving the two others empty-handed and allowing one of the other two players to distribute a pie. Treatments differ in the procedure by which distributive power is assigned: to a randomly determined or to a knowingly selected partner. Before making her decision the selecting player could consult the personality questionnaire of the other two players. Results show that knowingly selected players keep less for themselves than randomly selected ones and reward the selecting player more generously.
Resumo:
In this paper we check whether generator's bid behavior at the Spanish whosale electricity market is consistent with the hypothesis of profit maximization on their residual demands. Using OMEL data, we find the arc-elacticity of the residual demand around the system marginal price. The results suggest thet the larger firms are not actually profit-msximization. We argue how the regulatory environment may drive these results. Finally, we repeat the analysis for the first session of the intra-day market where presumably firms may not have the same incentives as in the day-ahead market.
Resumo:
"Vegeu el resum a l'inici del fitxer adjunt."
Resumo:
Recently there has been a great deal of work on noncommutative algebraic cryptography. This involves the use of noncommutative algebraic objects as the platforms for encryption systems. Most of this work, such as the Anshel-Anshel-Goldfeld scheme, the Ko-Lee scheme and the Baumslag-Fine-Xu Modular group scheme use nonabelian groups as the basic algebraic object. Some of these encryption methods have been successful and some have been broken. It has been suggested that at this point further pure group theoretic research, with an eye towards cryptographic applications, is necessary.In the present study we attempt to extend the class of noncommutative algebraic objects to be used in cryptography. In particular we explore several different methods to use a formal power series ring R && x1; :::; xn && in noncommuting variables x1; :::; xn as a base to develop cryptosystems. Although R can be any ring we have in mind formal power series rings over the rationals Q. We use in particular a result of Magnus that a finitely generated free group F has a faithful representation in a quotient of the formal power series ring in noncommuting variables.
Resumo:
This article provides a fresh methodological and empirical approach for assessing price level convergence and its relation to purchasing power parity (PPP) using annual price data for seventeen US cities. We suggest a new procedure that can handle a wide range of PPP concepts in the presence of multiple structural breaks using all possible pairs of real exchange rates. To deal with cross-sectional dependence, we use both cross-sectional demeaned data and a parametric bootstrap approach. In general, we find more evidence for stationarity when the parity restriction is not imposed, while imposing parity restriction provides leads toward the rejection of the panel stationar- ity. Our results can be embedded on the view of the Balassa-Samuelson approach, but where the slope of the time trend is allowed to change in the long-run. The median half-life point estimate are found to be lower than the consensus view regardless of the parity restriction.
Resumo:
This work investigates applying introspective reasoning to improve the performance of Case-Based Reasoning (CBR) systems, in both reactive and proactive fashion, by guiding learning to improve how a CBR system applies its cases and by identifying possible future system deficiencies. First we present our reactive approach, a new introspective reasoning model which enables CBR systems to autonomously learn to improve multiple facets of their reasoning processes in response to poor quality solutions. We illustrate our model’s benefits with experimental results from tests in an industrial design application. Then as for our proactive approach, we introduce a novel method for identifying regions in a case-base where the system gives low confidence solutions to possible future problems. Experimentation is provided for Zoology and Robo-Soccer domains and we argue how encountered regions of dubiosity help us to analyze the case-bases of a given CBR system.
Resumo:
Report for the scientific sojourn at the University of California at Berkeley between September 2007 to February 2008. The globalization combined with the success of containerization has brought about tremendous increases in the transportation of containers across the world. This leads to an increasing size of container ships which causes higher demands on seaport container terminals and their equipment. In this situation, the success of container terminals resides in a fast transhipment process with reduced costs. For these reasons it is necessary to optimize the terminal’s processes. There are three main logistic processes in a seaport container terminal: loading and unloading of containerships, storage, and reception/deliver of containers from/to the hinterland. Moreover there is an additional process that ensures the interconnection between previous logistic activities: the internal transport subsystem. The aim of this paper is to optimize the internal transport cycle in a marine container terminal managed by straddle carriers, one of the most used container transfer technologies. Three sub-systems are analyzed in detail: the landside transportation, the storage of containers in the yard, and the quayside transportation. The conflicts and decisions that arise from these three subsystems are analytically investigated, and optimization algorithms are proposed. Moreover, simulation has been applied to TCB (Barcelona Container Terminal) to test these algorithms and compare different straddle carrier’s operation strategies, such as single cycle versus double cycle, and different sizes of the handling equipment fleet. The simulation model is explained in detail and the main decision-making algorithms from the model are presented and formulated.
Resumo:
This article investigates the history of land and water transformations in Matadepera, a wealthy suburb of metropolitan Barcelona. Analysis is informed by theories of political ecology and methods of environmental history; although very relevant, these have received relatively little attention within ecological economics. Empirical material includes communications from the City Archives of Matadepera (1919-1979), 17 interviews with locals born between 1913 and 1958, and an exhaustive review of grey historical literature. Existing water histories of Barcelona and its outskirts portray a battle against natural water scarcity, hard won by heroic engineers and politicians acting for the good of the community. Our research in Matadepera tells a very different story. We reveal the production of a highly uneven landscape and waterscape through fierce political and power struggles. The evolution of Matadepera from a small rural village to an elite suburb was anything but spontaneous or peaceful. It was a socio-environmental project well intended by landowning elites and heavily fought by others. The struggle for the control of water went hand in hand with the land and political struggles that culminated – and were violently resolved - in the Spanish Civil War. The displacement of the economic and environmental costs of water use from few to many continues to this day and is constitutive of Matadepera’s uneven and unsustainable landscape. By unravelling the relations of power that are inscribed in the urbanization of nature (Swyngedouw, 2004), we question the perceived wisdoms of contemporary water policy debates, particularly the notion of a natural scarcity that merits a technical or economic response. We argue that the water question is fundamentally a political question of environmental justice; it is about negotiating alternative visions of the future and deciding whose visions will be produced.
Resumo:
"Vegeu el resum a l'inici del document del fitxer adjunt."
Resumo:
We analyze the statistics of rain-event sizes, rain-event durations, and dry-spell durations in a network of 20 rain gauges scattered in an area situated close to the NW Mediterranean coast. Power-law distributions emerge clearly for the dryspell durations, with an exponent around 1.50 ± 0.05, although for event sizes and durations the power-law ranges are rather limited, in some cases. Deviations from power-law behavior are attributed to finite-size effects. A scaling analysis helps to elucidate the situation, providing support for the existence of scale invariance in these distributions. It is remarkable that rain data of not very high resolution yield findings in agreement with self-organized critical phenomena.