In this paper, a modified Rao-2 (MRao-2) algorithm is proposed to solve the problem of optimal power flow (OPF) in system incorporating renewable energy sources (RES). Quasi-oppositional and Levy flight methods are used improve performance Rao algorithm. To demonstrate effectiveness MRao-2 technique, it tested on two standard test systems: an IEEE 30-bus 118-bus system. The objective function O...

This paper compares the performance of several tests for stochastic dominance up to order three using Monte Carlo methods. The tests considered are the Davidson and Duclos (2000) test, the Anderson test (1996) and the Kaur, Rao and Singh (1994) test. Only unpaired samples of independent observations are considered, as this is a restriction for both the Anderson and Kaur-Rao-Singh tests. We find...

The aim was to detect the presence of polymorphisms at exons 1, 2, 3 and 4 of the Spi2 gene, and evaluate a possible association between them and recurrent airway obstruction (RAO) or inflammatory airway disease (IAD) in thoroughbred horses, through single-strand conformational-polymorphism (SSCP) screening. Although polymorphism was not detected in exons 1, 2 and 3, three alleles and six genot...

At the outset, I would like to express my deep gratitude to the distinguished membership of the Indian Psychiatric Society for giving me an opportunity to deliver Dr D L N Murthy Rao Oration. Dr Murthy Rao was one of the foremost psychiatrist in our country and as a Professor and Director of the National Institute of Mental Health and Neuro-Sciences, Bangalore, he not only trained many eminent ...

We present an algorithm to compute the Weierstrass semigroup at a point P together with functions for each value in the semigroup, provided P is the only branch at infinity of a singular plane model for the curve. As a byproduct, the method also provides us with a basis for the spaces L(mP ) and the computation of the Feng-Rao distance for the corresponding array of geometric Goppa codes. A gen...

Leighton and Rao use multicommodity flow results to design the first polynomial time approximation algorithms for well known NP-Hard optimization problems. Such problems include graph partitioning, crossing number, VLSI layout, and many more. Furthermore, Leighton and Rao are responsible for establishing the max-flow min-cut theorems on multicommodity flow problems, which lead to the algorithms...