Distance Relay Co-ordination Using Support Vector Machines in Power Transmission System

In this paper, a new approach to enhance the transmission system distance relay co-ordination is presented. The approach depends on the apparent impedance loci seen by the distance relay during all possible disturbances. In a distance relay, the impedance loci seen at the relay location is obtained by extensive transient stability studies. Support vector machines (SVMs), a class of patterns classifiers are used in discriminating zone settings (zone-1, zone-2 and zone-3) using the signals to be used by the relay. Studies on a sample 9-bus are presented for illustrating the proposed scheme.

Jer. (Jerusalem) - Women's Sewing Class

Digital image

Minimization of Incompletely Specified Sequential Machines

A simple yet efficient method for the minimization of incompletely specified sequential machines (ISSMs) is proposed. Precise theorems are developed, as a consequence of which several compatibles can be deleted from consideration at the very first stage in the search for a minimal closed cover. Thus, the computational work is significantly reduced. Initial cardinality of the minimal closed cover is further reduced by a consideration of the maximal compatibles (MC's) only; as a result the method converges to the solution faster than the existing procedures. "Rank" of a compatible is defined. It is shown that ordering the compatibles, in accordance with their rank, reduces the number of comparisons to be made in the search for exclusion of compatibles. The new method is simple, systematic, and programmable. It does not involve any heuristics or intuitive procedures. For small- and medium-sized machines, it canle used for hand computation as well. For one of the illustrative examples used in this paper, 30 out of 40 compatibles can be ignored in accordance with the proposed rules and the remaining 10 compatibles only need be considered for obtaining a minimal solution.

State Minimization of Incompletely Specified Sequential Machines

A simple procedure for the state minimization of an incompletely specified sequential machine whose number of internal states is not very large is presented. It introduces the concept of a compatibility graph from which the set of maximal compatibles of the machine can be very conveniently derived. Primary and secondary implication trees associated with each maximal compatible are then constructed. The minimal state machine covering the incompletely specified machine is then obtained from these implication trees.

Cluster based training for scaling non-linear support vector machines

Support Vector Machines(SVMs) are hyperplane classifiers defined in a kernel induced feature space. The data size dependent training time complexity of SVMs usually prohibits its use in applications involving more than a few thousands of data points. In this paper we propose a novel kernel based incremental data clustering approach and its use for scaling Non-linear Support Vector Machines to handle large data sets. The clustering method introduced can find cluster abstractions of the training data in a kernel induced feature space. These cluster abstractions are then used for selective sampling based training of Support Vector Machines to reduce the training time without compromising the generalization performance. Experiments done with real world datasets show that this approach gives good generalization performance at reasonable computational expense.

Selective dissemination of XML documents based on genetically learned user model and Support Vector Machines

Extensible Markup Language ( XML) has emerged as a medium for interoperability over the Internet. As the number of documents published in the form of XML is increasing, there is a need for selective dissemination of XML documents based on user interests. In the proposed technique, a combination of Adaptive Genetic Algorithms and multi class Support Vector Machine ( SVM) is used to learn a user model. Based on the feedback from the users, the system automatically adapts to the user's preference and interests. The user model and a similarity metric are used for selective dissemination of a continuous stream of XML documents. Experimental evaluations performed over a wide range of XML documents, indicate that the proposed approach significantly improves the performance of the selective dissemination task, with respect to accuracy and efficiency.

Selective dissemination of XML documents based on genetically learned user model and Support Vector Machines

Extensible Markup Language ( XML) has emerged as a medium for interoperability over the Internet. As the number of documents published in the form of XML is increasing, there is a need for selective dissemination of XML documents based on user interests. In the proposed technique, a combination of Adaptive Genetic Algorithms and multi class Support Vector Machine ( SVM) is used to learn a user model. Based on the feedback from the users, the system automatically adapts to the user's preference and interests. The user model and a similarity metric are used for selective dissemination of a continuous stream of XML documents. Experimental evaluations performed over a wide range of XML documents, indicate that the proposed approach significantly improves the performance of the selective dissemination task, with respect to accuracy and efficiency.

Real-Time Simulation of Electrical Machines on FPGA Platform

This paper presents real-time simulation models of electrical machines on FPGA platform. Implementation of the real-time numerical integration methods with digital logic elements is discussed. Several numerical integrations are presented. A real-time simulation of DC machine is carried out on this FPGA platform and important transient results are presented. These results are compared to simulation results obtained through a commercial off-line simulation software

An intelligent approach using support vector machines for monitoring and identification of faults on transmission systems

Power system disturbances are often caused by faults on transmission lines. When faults occur in a power system, the protective relays detect the fault and initiate tripping of appropriate circuit breakers, which isolate the affected part from the rest of the power system. Generally Extra High Voltage (EHV) transmission substations in power systems are connected with multiple transmission lines to neighboring substations. In some cases mal-operation of relays can happen under varying operating conditions, because of inappropriate coordination of relay settings. Due to these actions the power system margins for contingencies are decreasing. Hence, power system protective relaying reliability becomes increasingly important. In this paper an approach is presented using Support Vector Machine (SVM) as an intelligent tool for identifying the faulted line that is emanating from a substation and finding the distance from the substation. Results on 24-bus equivalent EHV system, part of Indian southern grid, are presented for illustration purpose. This approach is particularly important to avoid mal-operation of relays following a disturbance in the neighboring line connected to the same substation and assuring secure operation of the power systems.

Bacteria colonizing paper machines

Bacteria growing in paper machines can cause several problems. Biofilms detaching from paper machine surfaces may lead to holes and spots in the end product or even break the paper web leading to expensive delays in production. Heat stable endospores will remain viable through the drying section of paper machine, increasing the microbial contamination of paper and board. Of the bacterial species regularly found in the end products, Bacillus cereus is the only one classified as a pathogen. Certain B. cereus strains produce cereulide, the toxin that causes vomiting disease in food poisonings connected to B. cereus. The first aim of this thesis was to identify harmful bacterial species colonizing paper machines and to assess the role of bacteria in the formation of end product defects. We developed quantitative PCR methods for detecting Meiothermus spp. and Pseudoxanthomonas taiwanensis. Using these methods I showed that Meiothermus spp. and Psx. taiwanensis are major biofoulers in paper machines. I was the first to be able to show the connection between end product defects and biofilms in the wet-end of paper machines. I isolated 48 strains of primary-biofilm forming bacteria from paper machines. Based on one of them, strain K4.1T, I described a novel bacterial genus Deinobacterium with Deinobacterium chartae as the type species. I measured the transfer of Bacillus cereus spores from packaging paper into food. To do this, we constructed a green fluorescent protein (GFP) labelled derivative of Bacillus thuringiensis and prepared paper containing spores of this strain. Chocolate and rice were the recipient foods when transfer of the labelled spores from the packaging paper to food was examined. I showed that only minority of the Bacillus cereus spores transferred into food from packaging paper and that this amount is very low compared to the amount of B. cereus naturally occurring in foods. Thus the microbiological risk caused by packaging papers is very low. Until now, the biological function of cereulide for the producer cell has remained unknown. I showed that B. cereus can use cereulide to take up K+ from environment where K+ is scarce: cereulide binds K+ ions outside the cell with high affinity and transports these ions across cell membrane into the cytoplasm. Externally added cereulide increased the growth rate of cereulide producing strains in medium where potassium was growth limiting. In addition, cereulide producing strains outcompeted cereulide non-producing B. cereus in potassium deficient environment, but not when the potassium concentration was high. I also showed that cereulide enhances biofilm formation of B. cereus.

Easily Diagnosable Sequential Machines

This correspondence throws some light into the area of easily diagnosable machines. Given the behavior of a sequential machine in terms of a state table it explores the possibilities of designing a structure, that facilitates easy diagnosis of faults. The objective is achieved through structural decomposition which has already claimed to produce simpler physical realization.

Minimizing total completion time on batch processing machines

We study the problem of minimizing total completion time on single and parallel batch processing machines. A batch processing machine is one which can process up to B jobs simultaneously. The processing time of a batch is equal to the largest processing time among all jobs in the batch. This problem is motivated by burn-in operations in the final testing stage of semiconductor manufacturing and is expected to occur in other production environments. We provide an exact solution procedure for the single-machine problem and heuristic algorithms for both single and parallel machine problems. While the exact algorithms have limited applicability due to high computational requirements, extensive experiments show that the heuristics are capable of consistently obtaining near-optimal solutions in very reasonable CPU times.