Fault-Diagnostic System using Support Vector Machines for Power Transmission Systems

This paper presents an approach for identifying the faulted line section and fault location on transmission systems using support vector machines (SVMs) for diagnosis/post-fault analysis purpose. Power system disturbances are often caused by faults on transmission lines. When fault occurs on a transmission system, the protective relay detects the fault and initiates the tripping operation, which isolates the affected part from the rest of the power system. Based on the fault section identified, rapid and corrective restoration procedures can thus be taken to minimize the power interruption and limit the impact of outage on the system. The approach is particularly important for post-fault diagnosis of any mal-operation of relays following a disturbance in the neighboring line connected to the same substation. This may help in improving the fault monitoring/diagnosis process, thus assuring secure operation of the power systems. In this paper we compare SVMs with radial basis function neural networks (RBFNN) in data sets corresponding to different faults on a transmission system. Classification and regression accuracy is reported for both strategies. Studies on a practical 24-Bus equivalent EHV transmission system of the Indian Southern region is presented for indicating the improved generalization with the large margin classifiers in enhancing the efficacy of the chosen model.

Fault-tolerant Video on Demand in RSerPool Architecture

With the advent of Internet, video over IP is gaining popularity. In such an environment, scalability and fault tolerance will be the key issues. Existing video on demand (VoD) service systems are usually neither scalable nor tolerant to server faults and hence fail to comply to multi-user, failure-prone networks such as the Internet. Current research areas concerning VoD often focus on increasing the throughput and reliability of single server, but rarely addresses the smooth provision of service during server as well as network failures. Reliable Server Pooling (RSerPool), being capable of providing high availability by using multiple redundant servers as single source point, can be a solution to overcome the above failures. During a possible server failure, the continuity of service is retained by another server. In order to achieve transparent failover, efficient state sharing is an important requirement. In this paper, we present an elegant, simple, efficient and scalable approach which has been developed to facilitate the transfer of state by the client itself, using extended cookie mechanism, which ensures that there is no noticeable change in disruption or the video quality.

On Convergence of Differential Evolution Over a Class of Continuous Functions With Unique Global Optimum

Differential evolution (DE) is arguably one of the most powerful stochastic real-parameter optimization algorithms of current interest. Since its inception in the mid 1990s, DE has been finding many successful applications in real-world optimization problems from diverse domains of science and engineering. This paper takes a first significant step toward the convergence analysis of a canonical DE (DE/rand/1/bin) algorithm. It first deduces a time-recursive relationship for the probability density function (PDF) of the trial solutions, taking into consideration the DE-type mutation, crossover, and selection mechanisms. Then, by applying the concepts of Lyapunov stability theorems, it shows that as time approaches infinity, the PDF of the trial solutions concentrates narrowly around the global optimum of the objective function, assuming the shape of a Dirac delta distribution. Asymptotic convergence behavior of the population PDF is established by constructing a Lyapunov functional based on the PDF and showing that it monotonically decreases with time. The analysis is applicable to a class of continuous and real-valued objective functions that possesses a unique global optimum (but may have multiple local optima). Theoretical results have been substantiated with relevant computer simulations.

Robust Observer Design with Application to Fault Detection

A new scheme for robust estimation of the partial state of linear time-invariant multivariable systems is presented, and it is shown how this may be used for the detection of sensor faults in such systems. We consider an observer to be robust if it generates a faithful estimate of the plant state in the face of modelling uncertainty or plant perturbations. Using the Stable Factorization approach we formulate the problem of optimal robust observer design by minimizing an appropriate norm on the estimation error. A logical candidate is the 2-norm, corresponding to an H�¿ optimization problem, for which solutions are readily available. In the special case of a stable plant, the optimal fault diagnosis scheme reduces to an internal model control architecture.

Performance analysis for geometrical attack on digital image watermarking

We present a technique for irreversible watermarking approach robust to affine transform attacks in camera, biomedical and satellite images stored in the form of monochrome bitmap images. The watermarking approach is based on image normalisation in which both watermark embedding and extraction are carried out with respect to an image normalised to meet a set of predefined moment criteria. The normalisation procedure is invariant to affine transform attacks. The result of watermarking scheme is suitable for public watermarking applications, where the original image is not available for watermark extraction. Here, direct-sequence code division multiple access approach is used to embed multibit text information in DCT and DWT transform domains. The proposed watermarking schemes are robust against various types of attacks such as Gaussian noise, shearing, scaling, rotation, flipping, affine transform, signal processing and JPEG compression. Performance analysis results are measured using image processing metrics.

Ground-fault-arc suppression on series-and shunt-compensated lines

An extension of Rizk's analysis to cover any type of switching is presented for calculating the residual current and recovery voltage in a singlephase switched transmission system. Equations for the determination of the current and voltage are shown, and the method has been used for the analysis of a series- and shunt-compensated line.Three possible switching methods for the effective control of the recovery voltage and residual current are discussed: normal switching, switching at the ends of the line and switching of the series capacitors.

Evidence for a thermally reversing window in bulk Ge–Te–Si glasses revealed by alternating differential scanning calorimetry

Experiments on Ge15Te85− x Si x glasses (2 ≤ x ≤ 12) using alternating differential scanning calorimetry (ADSC) indicate that these glasses exhibit one glass transition and two crystallization reactions upon heating. The glass transition temperature has been found to increase almost linearly with silicon content, in the entire composition tie-line. The first crystallization temperature (T c1) exhibits an increase with silicon content for x < 5; T c1 remains almost a constant in the composition range 5 < x ≤ 10 and it increases comparatively more sharply with silicon content thereafter. The specific heat change (ΔC p) is found to decrease with an increase in silicon content, exhibiting a minimum at x = 5 (average coordination number, r = 2.4); a continuous increase is seen in ΔC p with silicon concentration above x = 5. The effects seen in the variation with composition of T c1 and ΔC p at x = 5, are the specific signatures of the mean-field stiffness threshold at r = 2.4. Furthermore, a broad trough is seen in the enthalpy change (ΔH NR), which is indicative of a thermally reversing window in Ge15Te85− x Si x glasses in the composition range 2 ≤ x ≤ 6 (2.34 ≤ r ≤ 2.42).

Seismic hazard map of Coimbatore using subsurface fault rupture

This study presents the future seismic hazard map of Coimbatore city, India, by considering rupture phenomenon. Seismotectonic map for Coimbatore has been generated using past earthquakes and seismic sources within 300 km radius around the city. The region experienced a largest earthquake of moment magnitude 6.3 in 1900. Available earthquakes are divided into two categories: one includes events having moment magnitude of 5.0 and above, i.e., damaging earthquakes in the region and the other includes the remaining, i.e., minor earthquakes. Subsurface rupture character of the region has been established by considering the damaging earthquakes and total length of seismic source. Magnitudes of each source are estimated by assuming the subsurface rupture length in terms of percentage of total length of sources and matched with reported earthquake. Estimated magnitudes match well with the reported earthquakes for a RLD of 5.2% of the total length of source. Zone of influence circles is also marked in the seismotectonic map by considering subsurface rupture length of fault associated with these earthquakes. As earthquakes relive strain energy that builds up on faults, it is assumed that all the earthquakes close to damaging earthquake have released the entire strain energy and it would take some time for the rebuilding of strain energy to cause a similar earthquake in the same location/fault. Area free from influence circles has potential for future earthquake, if there is seismogenic source and minor earthquake in the last 20 years. Based on this rupture phenomenon, eight probable locations have been identified and these locations might have the potential for the future earthquakes. Characteristic earthquake moment magnitude (M-w) of 6.4 is estimated for the seismic study area considering seismic sources close to probable zones and 15% increased regional rupture character. The city is divided into several grid points at spacing of 0.01 degrees and the peak ground acceleration (PGA) due to each probable earthquake is calculated at every grid point in city by using the regional attenuation model. The maximum of all these eight PGAs is taken for each grid point and the final PGA map is arrived. This map is compared to the PGA map developed based on the conventional deterministic seismic hazard analysis (DSHA) approach. The probable future rupture earthquakes gave less PGA than that of DSHA approach. The occurrence of any earthquake may be expected in near future in these eight zones, as these eight places have been experiencing minor earthquakes and are located in well-defined seismogenic sources.

Differential Reaction Kinetics, Cleavage Complex Formation, and Nonamer Binding Domain Dependence Dictate the Structure-Specific and Sequence-Specific Nuclease Activity of RAGs

During V(D)J recombination, RAG (recombination-activating gene) complex cleaves DNA based on sequence specificity. Besides its physiological function, RAG has been shown to act as a structure-specific nuclease. Recently, we showed that the presence of cytosine within the single-stranded region of heteroduplex DNA is important when RAGs cleave on DNA structures. In the present study, we report that heteroduplex DNA containing a bubble region can be cleaved efficiently when present along with a recombination signal sequence (RSS) in cis or trans configuration. The sequence of the bubble region influences RAG cleavage at RSS when present in cis. We also find that the kinetics of RAG cleavage differs between RSS and bubble, wherein RSS cleavage reaches maximum efficiency faster than bubble cleavage. In addition, unlike RSS, RAG cleavage at bubbles does not lead to cleavage complex formation. Finally, we show that the ``nonamer binding region,'' which regulates RAG cleavage on RSS, is not important during RAG activity in non-B DNA structures. Therefore, in the current study, we identify the possible mechanism by which RAG cleavage is regulated when it acts as a structure-specific nuclease. (C) 2011 Elsevier Ltd. All rights reserved.

mRegistry: a registry representation for fault diagnosis

Microsoft Windows uses the notion of registry to store all configuration information. The registry entries have associations and dependencies. For example, the paths to executables may be relative to some home directories. The registry being designed with faster access as one of the objectives does not explicitly capture these relations. In this paper, we explore a representation that captures the dependencies more explicitly using shared and unifying variables. This representation, called mRegistry exploits the tree-structured hierarchical nature of the registry, is concept-based and obtained in multiple stages. mRegistry captures intra-block, inter-block and ancestor-children dependencies (all leaf entries of a parent key in a registry put together as an entity constitute a block thereby making the block as the only child of the parent). In addition, it learns the generalized concepts of dependencies in the form of rules. We show that mRegistry has several applications: fault diagnosis, prediction, comparison, compression etc.

A computational procedure to generate difference equations from differential equations

In this paper we have developed methods to compute maps from differential equations. We take two examples. First is the case of the harmonic oscillator and the second is the case of Duffing's equation. First we convert these equations to a canonical form. This is slightly nontrivial for the Duffing's equation. Then we show a method to extend these differential equations. In the second case, symbolic algebra needs to be used. Once the extensions are accomplished, various maps are generated. The Poincare sections are seen as a special case of such generated maps. Other applications are also discussed.