16046081
A method for classifying offer strategies observed in an electricity market
The idea that large-scale generating units will operate at marginal cost when given the ability to offer their power for sale in a uniform price auction is at best wishful thinking. In fact, both real and experimental data show that the more uncertainty a supplier faces (e.g., load uncertainty, uncertainty of other suppliers, etc.), the more they will hedge their profits through higher than marginal cost offers and through withholding units if permitted. This makes predicting unit commitment and dispatch ahead of time difficult. This paper explores characteristics of software agents that were designed based on the outcome of human subject experiments on a uniform price auction with stochastic load. The agent behavior is compared to the behavior of the subjects. Both subject and agent behavior is classified based on the data. Differences and similarities are noted and explained. Based on the result of the simulation, a model was suggested to explain an offer submitted in deregulated markets based on double layer diffusion.
6798576
Locational pricing and scheduling for an integrated energy-reserve market
It is well known that given a network that can become constrained on voltage or real power flows, reserves must also be spatially located in order to handle all credible contingencies. However, to date, there is no credible science-based method for assigning and pricing reserves in this way. Presented in this paper is a new scheduling algorithm incorporating constraints imposed by grid security considerations, which include one base case (intact system) and a list of possible contingencies (line-out, unit-lost, and load-growth) of the system. By following a cost-minimizing co-optimization procedure, both power and reserve are allocated spatially for the combined energy and reserve markets. With the Lagrange multipliers (dual variables) obtained, the scheduling algorithm also reveals the locational shadow prices for the reserve and energy requirements. Unlike other pricing and scheduling methods in use, which are usually ad-hoc and are based on engineering judgment and experience, this proposed formulation is likely to perform better in restructured markets when market power is a potential problem. An illustrative example of a modified IEEE 30-bus system is used to introduce concepts and present results.
6233472
Underlying technical issues in electricity deregulation
This paper reports on the results of an attempt by the Power Systems Engineering Research Center (Pserc) and EPRI to determine the technical tools missing in currently unfolding electric power restructuring scenarios. Needed tools have been divided into the functional categories of generation, transmission and distribution. In each category, there seems to be a common need to interface existing technical tools with the new economic unbundling.
17884360
Experimental results for single period auctions
The objective of the paper is to present experimental results for testing the performance of different auction mechanisms related to the introduction of competitive markets for the generation of electricity. The research is based on the concept of smart markets introduced by Vernon Smith (K.A. McCabe et al., 1991) and a simulation model (PowerWeb) of a realistic bulk power system. There are unique physical aspects associated with the supply of electricity (e.g. required instantaneous matching of supply and demand, unintended congestion of parallel transmission routes and maintenance of system stability in response to disturbances). As a result, traditional theories of efficient markets and auction structures developed for other commodities may not be efficient if applied without alteration to markets for electricity. Conversely, current utility rules of operation developed for a centrally planned regime may not be appropriate in a competitive environment. The research does not address the issues of multiperiod operations (unit commitment) and multidimensional markets (ancillary services), and considers only real power in a single time period. The main objective is to test three alternative auction mechanisms when market power is a potential problem. This situation occurs when limits on transmission lines are binding to form a load pocket in which demand is met by a few (in this case two) generators.
10283778
An Internet-based platform for testing generation scheduling auctions
The paper describes the uses and architecture of a network-centered computing-rich software platform called PowerWeb. PowerWeb was designed and built as a simulation environment for experimentally testing various power exchange auction markets through tournaments. It is designed to host simulations of a competitive "day-ahead" electric energy market in the content of a restructured electric power industry. The PowerWeb environment is meant to be flexible so as to accommodate different "rules of the game". The authors describe its interactive, distributed and Web-based character.
10032152
Parallel processing implementation of the unit commitment problem with full AC power flow constraints
The authors describe a parallel implementation of the Lagrangian Relaxation Algorithm with variable duplication for the thermal unit commitment problem. The formulation was previously reported by the authors and allows inclusion of the full nonlinear AC network power flow model, which permits addressing voltage limits, as well as more realistic branch flow limits than is possible with a linear DC flow model. Thus, potential VAr production can be used as another criterion for commitment of otherwise expensive generators in strategic locations. The algorithm is highly parallelizable, and the authors have taken advantage of this in a version currently being developed for the Cornell Theory Center's Velocity AC3 NT cluster.
7527272
On possible counterexamples to Negami's planar cover conjecture
A simple graph H is a cover of a graph G if there exists a mapping φ from H onto G such that φ maps the neighbors of every vertex v in H bijectively to the neighbors of φ(v) in G. Negami conjectured in 1986 that a connected graph has a finite planar cover if and only if it embeds in the projective plane. The conjecture is still open. It follows from the results of Archdeacon, Fellows, Negami, and the first author that the conjecture holds as long as the graph K1,2,2,2 has no finite planar cover. However, those results seem to say little about counterexamples if the conjecture was not true. We show that there are, up to obvious constructions, at most 16 possible counterexamples to Negami’s conjecture. Moreover, we exhibit a finite list of sets of graphs such that the set of excluded minors for the property of having finite planar cover is one of the sets in our list.
21521950
A new proof of the independence ratio of triangle-free cubic graphs
Abstract Staton proved that every triangle-free graph on n vertices with maximum degree 3 has an independent set of size at least 5 n /14. A simpler proof was found by Jones. We give a yet simpler proof, and use it to design a linear-time algorithm to find such an independent set.
6336074
Developing Case Studies to Enhance Student Learning
In this paper we describe the cases developed in response to the multifaceted challenges we faced in educating IT professionals in intermediate-level programming. The challenges included: the practical nature of the subject, the level of skill attained, preparing students for the workplace and class size. We implemented Problem-Based Learning (PBL) as the teaching and learning method to meet these challenges by helping first-year university students learn programming while simultaneously developing graduate capabilities. This necessitated redevelopment of the curriculum and the way it was taught. We combined software engineering and information systems approaches in real-world scenarios. The cases were designed to help students come to terms with the human side of information technology through the context and method of teaching and learning as they worked through the cases.
36594745
A Distributed Usage Monitoring System
We are developing a distributed computer system that supports usability and interaction studies, by handling the collection, storage and analysis of usage data, such as that generated by user-computer interaction and associated sensing devices (e.g., cameras). Data sources may be distributed as may be the data repositories and data consumers (other computer processes and human investigators). The system supports dynamic configuration of the entire process, including changes in the goals of the investigation itself. In this paper we describe the system’s key features, including a generic and evolvable data transport and processing network, a set of tools for capturing and cleaning usage data, a tool for instrumenting software for data capture, and a system for managing the entire process. We also report on several trials of the system, identifying successes, failures, lessons learned and areas for future development.
9403384
A pilot study of teaching the strategic use of common computer applications
Many users do not progress from a basic use of computer applications to more efficient usage. A strategic approach to training that focuses on teaching efficient strategies in addition to commands was successfully developed by Bhavnani and John at Carnegie Mellon University. A controlled experiment comparing this method of teaching to traditional command-based instruction was performed at the University of Western Australia. We found the teaching method is transferable to the Australian context and it appears to be remarkably robust in terms of delivery, student prior experience levels and motivation. The results clearly indicate that students can be taught to use common computer applications more efficiently than they would otherwise achieve.