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.

A Microprocessor-Based Pulse-Height Analyzer

Need to analyze particles in a flow? This system takes electrical pulses from acoustical or optical sensors and groups them into bands representing ranges of particle sizes.

Optimal Interconnections in the Design of Microprocessors and Digital Systems

This paper recasts the multiple data path assignment problem solved by Torng and Wilhelm by the dynamic programming method [1] into a minimal covering problem following a switching theoretic approach. The concept of bus compatibility for the data transfers is used to obtain the various ways of interconnecting the circuit modules with the minimum number of buses that allow concurrent data transfers. These have been called the feasible solutions of the problem. The minimal cost solutions are obtained by assigning weights to the bus-compatible sets present in the feasible solutions. Minimization of the cost of the solution by increasing the number of buses is also discussed.

Modified Lu-Lee cryptosystem

A modified Lu-Lee cryptosystem is proposed which appears to be resistant to the cryptanalytic attacks on the original Lu-Lee scheme. The data expansion due to encryption is moderate, and the size of the public key is also quite small.

Divide-and-Correct Algorithm for Division in a Negative Base

A divide-and-correct algorithm is described for multiple-precision division in the negative base number system. In this algorithm an initial quotient estimate is obtained from suitable segmented operands; this is then corrected by simple rules to arrive at the true quotient.

Superpropagator for a Nonpolynomial Field

By using a method originally due to Okubo we calculate the momentum-space superpropagator for a nonpolynomial field U(x)=1 / [1+fφ(x)] both for a massless and a massive neutral scalar φ(x) field. For the massless case we obtain a representation that resembles the weighted superposition of propagators for the exchange of a group of scalar fields φ(x) as is intuitively expected. The exact equivalence of this representation with the propagator function which has been obtained earlier through the use of the Fourier transform of a generalized function is established. For the massive case we determine the asymptotic form of the superpropagator.

Ternary Barker codes

Certain ternary codes having good autocorrelation properties akin to Barker codes are described.

Microprocessor Based Sinusoidal PWM Inverter by DMA Transfer

The implementation of three-phase sinusoidal pulse-width-modulated inverter control strategy using microprocessor is discussed in this paper. To save CPU time, the DMA technique is used for transferring the switching pattern from memory to the pulse amplifier and isolation circuits of individual thyristors in the inverter bridge. The method of controlling both voltage and frequency is discussed here.

On a generalized dynamic model of bi-state social interaction processes

A non-linear model, construed as a generalized version of the models put forth earlier for the study of bi-state social interaction processes, is proposed in this study. The feasibility of deriving the dynamics of such processes is demonstrated by establishing equivalence between the non-linear model and a higher order linear model.

Time-domain criteria for theL_{2}-stability of nonstationary feedback systems

Criteria for the L2-stability of linear and nonlinear time-varying feedback systems are given. These are conditions in the time domain involving the solution of certain associated matrix Riccati equations and permitting the use of a very general class of L2-operators as multipliers.

Periodic oscillations in feedback systems with combined pulse modulation

This paper presents a systematic method of investigating the existence of limit cycle oscillations in feedback systems with combined integral pulse frequency-pulse width (IPF-P/V) modulation. The method is based on the non-linear discrete equivalence of the continuous feedback system containing the IPF-PW modulator.

Random vibration of a second order non-linear elastic system

A method is presented for obtaining, approximately, the response covariance and probability distribution of a non-linear oscillator under a Gaussian excitation. The method has similarities with the hierarchy closure and the equivalent linearization approaches, but is different. A Gaussianization technique is used to arrive at the output autocorrelation and the input-output cross-correlation. This along with an energy equivalence criterion is used to estimate the response distribution function. The method is applicable in both the transient and steady state response analysis under either stationary or non-stationary excitations. Good comparison has been observed between the predicted and the exact steady state probability distribution of a Duffing oscillator under a white noise input.

A differential transformation technique for the analysis of a class of non-linear time varying systems

The scope of the differential transformation technique, developed earlier for the study of non-linear, time invariant systems, has been extended to the domain of time-varying systems by modifications to the differential transformation laws proposed therein. Equivalence of a class of second-order, non-linear, non-autonomous systems with a linear autonomous model of second order is established through these transformation laws. The feasibility of application of this technique in obtaining the response of such non-linear time-varying systems is discussed.

An Optimal Mechanism for Sponsored Search Auctions on the Web and Comparison With Other Mechanisms

In this paper, we first describe a framework to model the sponsored search auction on the web as a mechanism design problem. Using this framework, we describe two well-known mechanisms for sponsored search auction-Generalized Second Price (GSP) and Vickrey-Clarke-Groves (VCG). We then derive a new mechanism for sponsored search auction which we call optimal (OPT) mechanism. The OPT mechanism maximizes the search engine's expected revenue, while achieving Bayesian incentive compatibility and individual rationality of the advertisers. We then undertake a detailed comparative study of the mechanisms GSP, VCG, and OPT. We compute and compare the expected revenue earned by the search engine under the three mechanisms when the advertisers are symmetric and some special conditions are satisfied. We also compare the three mechanisms in terms of incentive compatibility, individual rationality, and computational complexity. Note to Practitioners-The advertiser-supported web site is one of the successful business models in the emerging web landscape. When an Internet user enters a keyword (i.e., a search phrase) into a search engine, the user gets back a page with results, containing the links most relevant to the query and also sponsored links, (also called paid advertisement links). When a sponsored link is clicked, the user is directed to the corresponding advertiser's web page. The advertiser pays the search engine in some appropriate manner for sending the user to its web page. Against every search performed by any user on any keyword, the search engine faces the problem of matching a set of advertisers to the sponsored slots. In addition, the search engine also needs to decide on a price to be charged to each advertiser. Due to increasing demands for Internet advertising space, most search engines currently use auction mechanisms for this purpose. These are called sponsored search auctions. A significant percentage of the revenue of Internet giants such as Google, Yahoo!, MSN, etc., comes from sponsored search auctions. In this paper, we study two auction mechanisms, GSP and VCG, which are quite popular in the sponsored auction context, and pursue the objective of designing a mechanism that is superior to these two mechanisms. In particular, we propose a new mechanism which we call the OPT mechanism. This mechanism maximizes the search engine's expected revenue subject to achieving Bayesian incentive compatibility and individual rationality. Bayesian incentive compatibility guarantees that it is optimal for each advertiser to bid his/her true value provided that all other agents also bid their respective true values. Individual rationality ensures that the agents participate voluntarily in the auction since they are assured of gaining a non-negative payoff by doing so.