A joint energy and transmission rights auction: proposal and properties

An auction-based process is proposed that allows power market participants to acquire and reconfigure financial transmission rights. The process simultaneously accommodates flowgate and point-to-point options and obligations, along with energy production and consumption futures. A sequence of auctions is held during which participants can buy and sell rights, which are then settled in a day-ahead or real-time auction, at which time all rights are cashed out. By allowing flowgate and point-to-point obligations and options to be reconfigured and exchanged, the market can decide what combination of financial rights are most useful to power generators, consumers, and traders. Rights can be specified not only for capacity of individual flowgates, but also for more complex transmission constraints, such as nomograms. Under certain conditions, we prove that the auction is revenue adequate for the market operator, in that payments to rights holders cannot exceed congestion revenues. We present a linearized (DC) auction along with a numerical illustration.     

Routing electric meter readers

Electric utility companies employ a crew of workers who periodically visit and read the electric meters of each customer in their service area. Each reader is transported by auto from a central office to the first customer on his work list. At the end of his work shift time limit the reader is free to leave the area possibly returning home or to the central office by public bus. Taking a graph that corresponds to the city network of streets meter readers must traverse each street while moving from house to house. It is possible that dead heading may be required—back tracking over a street that has already been covered. A working tour is an open path whose reading time plus deadheading time does not exceed the work limit. The problem is to find the minimum number of working tours. Stating the problem in this manner gives us an optimization problem closely related to the M-Chinese postman problem—an edge oriented routing problem. After presenting some background on this type of problem a heuristic procedure is used to solve an example from the City of Beersheva. The solution provides a 40% reduction in the number of working tours. The paper ends with a discussion of the solution, and provides conditions under which the algorithm should have practical utility.     

Protecting data privacy through hard-to-reverse negative databases

A set DB of data elements can be represented in terms of its complement set, known as a negative database. That is, all of the elements not in DB are represented, and DB itself is not explicitly stored. This method of representing data has certain properties that are relevant for privacy enhancing applications. The paper reviews the negative database (NDB) representation scheme for storing a negative image compactly, and proposes using a collection of NDBs to represent a single DB, that is, one NDB is assigned for each record in DB. This method has the advantage of producing negative databases that are hard to reverse in practice, i.e., from which it is hard to obtain DB. This result is obtained by adapting a technique for generating hard-to-solve 3-SAT formulas. Finally we suggest potential avenues of application.     

Validation of the driver behaviour questionnaire using behavioural data from an instrumented vehicle and high-fidelity driving simulator

Data from two previously published studies were used to examine the correlations between scores on the violation, error and lapse sub-scales of the driver behaviour questionnaire, and observed driving speed. One dataset utilised data from an instrumented vehicle, which recorded driver speed on bends on a rural road. The other utilised data from a driving simulator study. Generally in both datasets the DBQ violation subscale was associated with objectively-measured speed, while the error and lapse sub-scales were not. These findings are consistent with the idea that the DBQ is a valid measure of observed behaviour in real driving (its original intended use) and also in simulated driving. The fact that associations were the same in real and simulated driving lends further support to the relative validity of driving simulation. The need for larger and more focused studies examining the role of different motivations in different driving situations is discussed.     

Design of Efficient Generation Markets

The design of spot markets for generation services, such as energy, regulation,and operating reserves, and longer term markets for capacity, remain in evolution in many countries. Market design includes definition of the service, bid, or offer requirements, and rules for pricing and financial settlement. In the United States, most organized regional markets have converged on similar elements of spot market design. The design of capacity markets remains influx. Market power mitigation is currently a regulatory requirement in the United States, and experience with different methods shows that it must be carefully aligned with market design to ensure both efficient pricing and efficient investment. This paper surveys these topics and their relationships to each other and identifies researchable issues.     

A formal framework for positive and negative detection schemes.

In anomaly detection, the normal behavior of a process is characterized by a model, and deviations from the model are called anomalies. In behavior-based approaches to anomaly detection, the model of normal behavior is constructed from an observed sample of normally occurring patterns. Models of normal behavior can represent either the set of allowed patterns (positive detection) or the set of anomalous patterns (negative detection). A formal framework is given for analyzing the tradeoffs between positive and negative detection schemes in terms of the number of detectors needed to maximize coverage. For realistically sized problems, the universe of possible patterns is too large to represent exactly (in either the positive or negative scheme). Partial matching rules generalize the set of allowable (or unallowable) patterns, and the choice of matching rule affects the tradeoff between positive and negative detection. A new match rule is introduced, called r-chunks, and the generalizations induced by different partial matching rules are characterized in terms of the crossover closure. Permutations of the representation can be used to achieve more precise discrimination between normal and anomalous patterns. Quantitative results are given for the recognition ability of contiguous-bits matching together with permutations.     

Dispatchable transmission in RTO markets

We consider transmission owners that bid capacity, under appropriate Regional Transmission Organization (RTO) market rules, at a positive price into forward and spot (dispatch) auctions to derive congestion revenues. This can encompass daily, monthly, or multimonthly auctions, allowing for commitment of transmission to reflect market needs in different time periods, e.g., seasons. We provide two and three node examples and a general formulation of the auction model.     

Statistical foundations of audit trail analysis for the detectionof computer misuse

We model computer transactions as generated by two stationary stochastic processes, the legitimate (normal) process N and the misuse process M. We define misuse (anomaly) detection to be the identification of transactions most likely to have been generated by M. We formally demonstrate that the accuracy of misuse detectors is bounded by a function of the difference of the densities of the processes N and M over the space of transactions. In practice, detection accuracy can be far below this bound, and generally improves with increasing sample size of historical (training) data. Careful selection of transaction attributes also can improve detection accuracy; we suggest several criteria for attribute selection, including adequate sampling rate and separation between models. We demonstrate that exactly optimizing even the simplest of these criteria is NP-hard, thus motivating a heuristic approach. We further differentiate between modeling (density estimation) and nonmodeling approaches     

Insulin-like growth factor II and PAX3-FKHR cooperate in the oncogenesis of rhabdomyosarcoma

The mouse myoblast C2C12 cell line transfected singly with cDNA for Pax-3, PAX3-FKHR, or insulin-like growth factor (IGF) II or cotransfected with IGF-II plus Pax-3 or with IGF-II plus PAX3-FKHR genes showed an altered morphology, a lack of differentiation, and higher proliferation rates in vitro. On s.c. injection into nude mice, tumors grew from transfected cell lines but not from cells transfected with the empty vector. Tumors derived from IGF-II/PAX3-FKHR- and IGF-II-transfected cells grew most rapidly. Cotransfection of IGF-II plus Pax-3 induced tumors comprised highly differentiated striated muscle cells; Pax-3, PAX3-FKHR, or IGF-II transfection produced tumors at varying stages of differentiation. Tumors derived from IGF-II plus PAX3-FKHR-cotransfected cells were composed of undifferentiated cells. This was the only tumor type to infiltrate the underlying muscle. The most angiogenesis and the least apoptosis were observed in the latter tumors. These results support the hypothesis that PAX3-FKHR interacts with IGF-II to play a critical role in the oncogenesis of rhabdomyosarcoma.