A critical comparison of approaches to resource name management within the IEC common information model

Copyright @ 2012 IEEEElectricity network resources are frequently identified within different power systems by inhomogeneous names and identities due to the legacy of their administration by different utility business domains. The IEC 61970 Common Information Model (CIM) enables network modeling to reflect the reality of multiple names for unique network resources. However this issue presents a serious challenge to the integrity of a shared CIM repository that has the task of maintaining a resource manifest, linking network resources to master identities, when unique network resources may have multiple names and identities derived from different power system models and other power system applications. The current approach, using CIM 15, is to manage multiple resource names within a singular CIM namespace utilizing the CIM “IdentifiedObject” and “Name” classes. We compare this approach to one using additional namespaces relating to different power systems, similar to the practice used in CIM extensions, in order to more clearly identify the genealogy of a network resource, provide faster model import times and a simpler means of supporting the relationship between multiple resource names and identities and a master resource identity.This study is supported by the UK National Grid and Brunel University

NETMAT: A knowledge-based grid system analysis tool

The increasing expansion of electric power systems renders the power system operator's task increasingly complex. The integration into energy management systems of further analytical algorithms implies that more data has to be analysed by the control engineer. For these reasons and many others, more sophisticated tools are required by power engineers to ease the pressure under which they perform their task. The advent of knowledge-based systems has led to a new approach to the problem. The combination of expert systems and numerical algorithms can be advantageously exploited to assist the power system engineer in operating the system. This paper presents the development of a knowledge-based tool for grid system analysis. The tool, NETMAT (NETwork Modelling AssistanT) , is to be used to analyse the impact of grid system maintenance and modification procedures and of new generating plants on power utilities, and in particular on their ability to generate and sell electricity. NE TMAT consists of a number of numerical applications interfaced to an expert system shell through specific problem domain knowledge bases. Results are presented based on the use of the IEEE-30 busbar network as a test network

Strong stability in the Hospitals/Residents problem

We study a version of the well-known Hospitals/Residents problem in which participants' preferences may involve ties or other forms of indifference. In this context, we investigate the concept of strong stability, arguing that this may be the most appropriate and desirable form of stability in many practical situations. When the indifference is in the form of ties, we describe an O(a^2) algorithm to find a strongly stable matching, if one exists, where a is the number of mutually acceptable resident-hospital pairs. We also show a lower bound in this case in terms of the complexity of determining whether a bipartite graph contains a perfect matching. By way of contrast, we prove that it becomes NP-complete to determine whether a strongly stable matching exists if the preferences are allowed to be arbitrary partial orders

The hospitals/residents problem with ties

The hospitals/residents problem is an extensively-studied many-one stable matching problem. Here, we consider the hospitals/residents problem where ties are allowed in the preference lists. In this extended setting, a number of natural definitions for a stable matching arise. We present the first linear-time algorithm for the problem under the strongest of these criteria, so-called super-stability . Our new results have applications to large-scale matching schemes, such as the National Resident Matching Program in the US, and similar schemes elsewhere

VLSI single-chip (255,223) Reed-Solomon encoder with interleaver

The invention relates to a concatenated Reed-Solomon/convolutional encoding system consisting of a Reed-Solomon outer code and a convolutional inner code for downlink telemetry in space missions, and more particularly to a Reed-Solomon encoder with programmable interleaving of the information symbols and code correction symbols to combat error bursts in the Viterbi decoder

InP homojunction solar cell performance on the LIPS 3 flight experiment

Performance data for the NASA Lewis Research Center indium phosphide n+p homojunction solar cell module on the LIPS 3 Flight Experiment is presented. The objective of the experiment is to measure the performance of InP cells in the natural radiation environment of the 1100 km altitude, 60+ deg inclination orbit. Analysis of flight data indicates that the performance of the four cells throughout the first year is near expected values. No degradation in short-circuit current was seen, as was expected from radiation tolerance studies of similar cells. Details of the cell structure and flight module design are discussed. The results of the temperature dependency and radiation tolerance studies necessary for normalization and analysis of the data are included

The Stable Roommates problem with short lists

We consider two variants of the classical Stable Roommates problem with Incomplete (but strictly ordered) preference lists SRI that are degree constrained, i.e., preference lists are of bounded length. The first variant, EGAL d-SRI, involves finding an egalitarian stable matching in solvable instances of SRI with preference lists of length at most d. We show that this problem is NP-hard even if d=3. On the positive side we give a (2d+3)/7-approximation algorithm for d={3,4,5} which improves on the known bound of 2 for the unbounded preference list case. In the second variant of SRI, called d-SRTI, preference lists can include ties and are of length at most d. We show that the problem of deciding whether an instance of d-SRTI admits a stable matching is NP-complete even if d=3. We also consider the "most stable" version of this problem and prove a strong inapproximability bound for the d=3 case. However for d=2 we show that the latter problem can be solved in polynomial time.Comment: short version appeared at SAGT 201