Comparison of Multiclass SVM Classification Methods to Use in a Supportive System for Distance Relay Coordination

This paper aims at evaluating the methods of multiclass support vector machines (SVMs) for effective use in distance relay coordination. Also, it describes a strategy of supportive systems to aid the conventional protection philosophy in combating situations where protection systems have maloperated and/or information is missing and provide selective and secure coordinations. SVMs have considerable potential as zone classifiers of distance relay coordination. This typically requires a multiclass SVM classifier to effectively analyze/build the underlying concept between reach of different zones and the apparent impedance trajectory during fault. Several methods have been proposed for multiclass classification where typically several binary SVM classifiers are combined together. Some authors have extended binary SVM classification to one-step single optimization operation considering all classes at once. In this paper, one-step multiclass classification, one-against-all, and one-against-one multiclass methods are compared for their performance with respect to accuracy, number of iterations, number of support vectors, training, and testing time. The performance analysis of these three methods is presented on three data sets belonging to training and testing patterns of three supportive systems for a region and part of a network, which is an equivalent 526-bus system of the practical Indian Western grid.

Hardness of approximation results for the problem of finding the stopping distance in Tanner graphs

Tanner Graph representation of linear block codes is widely used by iterative decoding algorithms for recovering data transmitted across a noisy communication channel from errors and erasures introduced by the channel. The stopping distance of a Tanner graph T for a binary linear block code C determines the number of erasures correctable using iterative decoding on the Tanner graph T when data is transmitted across a binary erasure channel using the code C. We show that the problem of finding the stopping distance of a Tanner graph is hard to approximate within any positive constant approximation ratio in polynomial time unless P = NP. It is also shown as a consequence that there can be no approximation algorithm for the problem achieving an approximation ratio of 2(log n)(1-epsilon) for any epsilon > 0 unless NP subset of DTIME(n(poly(log n))).

Comparative study of filter-bank mean-energy distance for automated segmentation of speech signals

This paper describes a method of automated segmentation of speech assuming the signal is continuously time varying rather than the traditional short time stationary model. It has been shown that this representation gives comparable if not marginally better results than the other techniques for automated segmentation. A formulation of the 'Bach' (music semitonal) frequency scale filter-bank is proposed. A comparative study has been made of the performances using Mel, Bark and Bach scale filter banks considering this model. The preliminary results show up to 80 % matches within 20 ms of the manually segmented data, without any information of the content of the text and without any language dependence. 'Bach' filters are seen to marginally outperform the other filters.

Correlations between frequency of infra-red active vibrational modes and copper-oxygen distance in copper oxides. Application to superconductors

The infra-red spectra of a large number of ternary Cu(II) oxides with at least a quasi square-planar coordination of oxygen around the copper ions have been studied. The frequency of the bands with the highest frequency,v max, is found to correlate extremely well with the shortest Cu–O distance.v max increases at an impressive rate of sim20 cm–1 per 0.01 Å when the Cu–O distance becomes less than 1.97 Å, which is the Cu2+–O2– distance in square-planar CuO4 complexes as obtained from empirical ionic radii considerations. The marked sensitivity may be used as a ldquotitrationrdquo procedure not only to assign bands but also to obtain diagnostic information about local coordination in compounds derived, for example, from the YBa2Cu3O7–d structure such as LaCaBaCu3O7–d . The only example where this correlation fails is in the two-layer non-superconducting oxides derived from La2(Ca, Sr)Cu2O6. The significance of this result is discussed. The marked dependence of frequency on the bond-distance is qualitatively examined in terms of an increased electron-phonon coupling to account for the observed tendency of the superconducting transition temperature to go through a maximum as the average basal plane Cu–O distance is decreased.

Covalent attachment of two important dicopper(II) systems in a one-dimensional polymeric chain: An x-ray structure of [Cu2(en)2(OH)2·Cu2(O2CMe)4](PF6)2·0.5EtOH]α showing the shortest Cucdots, three dots, centeredCu Distance in the tetraacetato core

Reaction of Cu2(O2CMe)4(H2O)2 with 1,2-diaminoethane(en) in ethanol, followed by the addition of NH4PF6, led to the formation of a covalently linked 1D polymeric copper(II) title complex showing alternating [Cu2(en)2(OH)22+] and [Cu2(O2CMe)4] units in the chain and the shortest Cucdots, three dots, centeredCu separation of 2.558(2) Ã… in the tetraacetato core.

NUcache: A Multicore Cache Organization Based on Next-Use Distance

In this work, we propose a new organization for the last level shared cache of a rnulticore system. Our design is based on the observation that the Next-Use distance, measured in terms of intervening misses between the eviction of a line and its next use, for lines brought in by a given delinquent PC falls within a predictable range of values. We exploit this correlation to improve the performance of shared caches in multi-core architectures by proposing the NUcache organization.

On Computation of Minimum Distance of Linear Block Codes Above 1/2 Rate Coding

The minimum distance of linear block codes is one of the important parameter that indicates the error performance of the code. When the code rate is less than 1/2, efficient algorithms are available for finding minimum distance using the concept of information sets. When the code rate is greater than 1/2, only one information set is available and efficiency suffers. In this paper, we investigate and propose a novel algorithm to find the minimum distance of linear block codes with the code rate greater than 1/2. We propose to reverse the roles of information set and parity set to get virtually another information set to improve the efficiency. This method is 67.7 times faster than the minimum distance algorithm implemented in MAGMA Computational Algebra System for a (80, 45) linear block code.

Distance measures on intersecting objects and their applications

Let A and B be two objects. We define measures to characterize the penetration of A and B when A boolean AND B not equal 0. We then present properties of the measures and efficient algorithms to compute them for planar and polyhedral objects. We explore applications of the measures and present some experimental results.

Potential-distance relationships of clay-water systems considering the Stern theory

This paper deals with the use of Stem theory as applied to a clay-water electrolyte system, which is more realistic to understand the force system at micro level man the Gouy-Chapman theory. The influence of the Stern layer on potential-distance relationship has been presented quantitatively for certain specified clay-water systems and the results are compared with the Gouy-Chapman model. A detailed parametric study concerning the number of adsorption spots on the clay platelet, the thickness of the Stern layer, specific adsorption potential and the value of dielectric constant of the pore fluid in the Stern layer, was carried out. This study investigates that the potential obtained at any distance using the Stern theory is higher than that obtained by the Gouy-Chapman theory. The hydrated size of the ion is found to have a significant influence on the potential-distance relationship for a given clay, pore fluid characteristics and valence of the exchangeable ion.

Photophysical and electrochemical redox properties of fixed distance porphyrin-quinone systems

A few fixed distance covalently linked porphyrin-quinone molecules have been synthesized in which a benzoquinone is directly attached to a meso/beta-pyrrole position of tri(phenyl/pentafluorophenyl)/tetraphenylporphyrins. The choice of fluoroarylporphyrins permit modulation of Delta G(ET) values for photoinduced electron-transfer reactions in these systems. All short distance porphyrin-quinone molecules showed efficient quenching of the porphyrin singlet excited state. The electrochemical redox data coupled with the steady-state and time-resolved singlet emission data are analysed to evaluate the dependence of Delta G(ET) values on the rate of electron transfer (k(ET)) in these systems. The meso-trifluoroarylporphyrin-quinones are found to be sensitive probes of the surrounding dielectric environment. Varying solvent polarity on the mechanism of fluorescence quenching and k(ET) values revealed that short donor-acceptor distance and the solvent dielectric relaxation properties play a dominant role. (C) 1999 Elsevier Science S.A. All rights reserved.

Performance issues of distance relays for shunt FACTS compensated transmission lines

In this paper, the performance of distance relays when applied to transmission system equipped with shunt FACTS device, Static Synchronous Compensator (STATCOM) is described. The aim of the proposed study is to evaluate the performance of distance relays when STATCOM is incorporated at the mid point of transmission lines for voltage control. A detailed model of STATCOM and its control strategy is presented. The presence of these devices significantly affects apparent impedance seen by the distance relays due to their rapid response to different power system configurations. The distance relay is evaluated for different loading conditions and for different fault locations. The faults are created during various pre-fault loading conditions. The studies are performed on 400KV and 132KV systems and the results are presented. Simulation studies are carried out using transient simulation software, PSCAD/EMTDC.

An Approach for Distance Relay Co-ordination using Support Vector Machines

In this paper, an approach to enhance the Extra High Voltage (EHV) Transmission system distance protection is presented. The scheme depends on the apparent impedance seen by the distance relay during the disturbance. In a distance relay,the impedance seen at the relay location is calculated from the fundamental frequency component of the voltage and current signals. Support Vector Machines (SVMs) are a new learning-byexample are employed in discriminating zone settings (Zone-1,Zone-2 and Zone-3) using the signals to be used by the relay.Studies on 265-bus system, an equivalent of practical Indian Western grid are presented for illustrating the proposed scheme.