This paper presents part of the work ComEd and Quanta Technology have performed to quantify the locational and temporal value of DER to avoid distribution grid upgrade investments. It focuses on the formulation of a robust and efficient algorithm for DER optimal dispatch on a distribution feeder to mitigate the violation of current and voltage limits using the allocated cost of capacity and locational marginal value of real and reactive DER injection/withdrawal. 相似文献
The Early Career Awards recognize the large number of excellent young psychologists. Recipients of this award may not have held a PhD for more than nine years. The areas considered in 1991 were animal learning and behavior, developmental, and personality. The winners for 1991 were Kent C. Berridge, Susan A. Gelman, and Randy J. Larsen. For each winner a citation, biography, and selected bibliography of their works are presented. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
This paper concerns the following problem: given a set of multi-attribute records, a fixed number of buckets and a two-disk system, arrange the records into the buckets and then store the buckets between the disks in such a way that, over all possible orthogonal range queries (ORQs), the disk access concurrency is maximized. We shall adopt the multiple key hashing (MKH) method for arranging records into buckets and use the disk modulo (DM) allocation method for storing buckets onto disks. Since the DM allocation method has been shown to be superior to any other allocation methods for allocating an MKH file onto a two-disk system for answering ORQs, the real issue is knowing how to determine an optimal way for organizing the records into buckets based upon the MKH concept.
A performance formula that can be used to evaluate the average response time, over all possible ORQs, of an MKH file in a two-disk system using the DM allocation method is first presented. Based upon this formula, it is shown that our design problem is related to a notoriously difficult problem, namely the Prime Number Problem. Then a performance lower bound and an efficient algorithm for designing optimal MKH files in certain cases are presented. It is pointed out that in some cases the optimal MKH file for ORQs in a two-disk system using the DM allocation method is identical to the optimal MKH file for ORQs in a single-disk system and the optimal average response time in a two-disk system is slightly greater than one half of that in a single-disk system. 相似文献
Solubility of dimethyl-2,6-naphthalene dicarboxylate in acetic acid, N,N-dimethylfonnamide, N,N-dimethyl acetamide, dimethyl sulphoxide, and N-methyl-2-ketopyrrolidine were determined using a dynamic method. The measured systems were correlated by UNIFAC group contribution method. A new main group (aromatic ester, ACCOO) was defined to express the activity coefficients of the aromatic ester. New interaction parameters of the ACCOO group were expressed as the first-order function of temperature and were determined from the experimental data. The calculated results for the new interaction parameters were satisfactory. The measured systems were also correlated with the Wilson and 2-h models, and the results were compared with those of the UNIFAC model. 相似文献
Viscosities of several mono-, di-, and trialkylamines have been measured in the temperature range 298 to 333 K. It is observed that viscosities are highly dependent on shape, size, and association through H-bond or through dipole. Following the transition state theory, energy, Gibbs free energy, and entropy of activation of viscous flow have been calculated. The values of expansion energy for these liquids have also been calculated using free volume theory, and subsequently amines have been classified as volume-restrained or energy-restrained liquids. The group contribution method of Van Velzen, Cardozo, and Langenkamp for estimating viscosity has been examined with the present and literature data, and the new group contribution increments Ni and Bi for amines have been evaluated. 相似文献
Vapor-liquid equilibrium data for the binary systems methyl butanoate/ethanol and methyl butanoate/propan-l-ol at pressures of 114.66 and 127.99 kPa are presented. Both mixtures yield an azeotrope, the compositions (ester) of which decrease quasi-linearly as the pressure increases. The experimental data for all the binary mixtures were fitted to a suitable equation and then used for comparison with predictions by ASOG and UNIFAC methods. These group contribution models give a good estimation of activity coefficients with an overall mean error less than 5% for all cases. 相似文献
This paper introduces a certain graphical coalitional game where the internal topology of the coalition depends on a prescribed communication graph structure among the agents. The game Value Function is required to satisfy four Axioms of Value. These axioms make it possible to provide a refined study of coalition structures on graphs by defining a formal graphical game and by assigning a Positional Advantage, based on the Shapley value, to each agent in a coalition based on its connectivity properties within the graph. Using the Axioms of Value the graphical coalitional game can be shown to satisfy properties such as convexity, fairness, cohesiveness, and full cooperativeness. Three measures of the contributions of agents to a coalition are introduced: marginal contribution, competitive contribution, and altruistic contribution. The mathematical framework given here is used to establish results regarding the dependence of these three types of contributions on the graph topology, and changes in these contributions due to changes in graph topology. Based on these different contributions, three online sequential decision games are defined on top of the graphical coalitional game, and the stable graphs under each of these sequential decision games are studied. It is shown that the stable graphs under the objective of maximizing the marginal contribution are any connected graph. The stable graphs under the objective of maximizing the competitive contribution are the complete graph. The stable graphs under the objective of maximizing the altruistic contribution are any tree. 相似文献