(SoE) School of Engineering

<p>Shiv Nadar University is a comprehensive, multidisciplinary, research-focused, and student-centric University offering a full range of academic programs at the undergraduate, postgraduate and doctoral level. With state-of-the-art infrastructure, the University comprises of academic wings, sophisticated labs, international standard sports facilities, amphitheaters, auditorium, conference rooms and smart classrooms. The University&rsquo;s goal is to become internationally recognized for the quality of its research and creative endeavors and their applicability to improving quality of life, generating new insights and expanding the boundaries of human knowledge creativity. Committed to excellence in teaching, research and service, the University aims to serve the higher education needs of India and the world beyond.</p>

Shiv Nadar University

Let G(V, E) be an unweighted undirected graph on |V| = n vertices. Let δ(u, v) denote the shortest distance between vertices u, v ∈ V. An algorithm is said to compute all-pairs t-approximate shortestpaths/distances, for some t ≥ 1, if for each pair of vertices u, v ∈ V, the path/distance reported by the algorithm is not longer/greater than t δ(u, v). This paper presents two randomized algorithms for computing all-pairs nearly 2-approximate distances. The first algorithm takes expected O(m2/3n log n+n2) time, and for any u, v ∈ V reports distance no greater than 2δ(u, v) + 1. Our second algorithm requires expected O(n2 log3/2) time, and for any it, v ∈ V reports distance bounded by 2δ(u, v) + 3. This paper also presents the first expected O(n 2) time algorithm to compute all-pairs 3-approximate distances. © Springer-Verlag Berlin Heidelberg 2005.

World University root node

Lecture Notes in Computer Science

All-pairs nearly 2-approximate shortest-paths in O(n2 polylogn) time

In this paper, increase in data rate is achieved by removing the cyclic prefix between the OFDM symbols. The intersymbol interference and intercarrier interference caused by the removal of cyclic prefix are removed by equalization. We propose two methods of equalization. In the first method, the zero frequency domain equalization (ZF-FEQ) is done by making use of spill over in the unused carriers. The pre-FFT time domain Equalizer minimizes the noise amplification caused by ZF-FEQ. In the second method, the Inter Symbol Interference and Inter Carrier Interference are removed at the transmitter itself by transmitting data in the unused carriers, which is the combination of data in the used carriers. The requirement of power in the unused carriers increases as the length of the channel increases. Using the TEQ, the effective length of the channel is reduced to minimum. The simulation results are presented in support of these two methods.

Electrical Engineering

IEEE Region 10 Annual International Conference, Proceedings/TENCON

Enhancing data efficiency in IEEE- 802.11a using frequency and time domain equalization

Chemical Engineering

Journal of Hazardous Materials

Bhopal gas tragedy and its effects on process safety International Conference on the 20th Anniversary of the Bhopal gas tragedy, December 1-3, 2004, Indian Institute of Technology, Kanpur

It has been proved beyond doubt that in almost all the large cities of the world, air pollution is a major problem for the physical and mental health of the people. Air pollution can cause significant morbidity and mortality along with deficits in pulmonary function and cardiovascular and neurobehavioral effects of living species including human population are affected. The mobile source emissions are estimated to comprise the single largest source of risk of air toxin from air borne toxic pollutants. The primary pollutants generally present in the exhaust emissions are nitrogen oxides (NOx), carbon monoxide (CO), hydrocarbons (HC), lead (Pb) and dark smokes. In the present study, health survey has been carried out to substantiate the hypothesis that correlation between air pollution and respiratory health exists.

Civil Engineering

National Academy Science Letters

Assessment of health effects due to urban vehicular traffic - A case study

The aim of this paper is to provide an efficient input feature selection algorithm for modeling of systems based on modified definition of fuzzy-rough sets. Some of the critical issues concerning the complexity and convergence of the feature selection algorithm are discussed in detail. Based on some natural properties of fuzzy t-norm and t-conorm operators, the concept of fuzzy-rough sets on compact computational domain is put forward, which is then utilized to construct improved Fuzzy-Rough Feature Selection algorithm. Various mathematical properties of this new definition of fuzzy-rough sets are discussed from pattern classification viewpoint. Speedup factor as high as 622 has been achieved with proposed algorithm compared to recently proposed FRSAR, with improved model performance on selected set of features. © 2005 Taylor & Francis.

International Journal of General Systems

Improved feature selection algorithm with fuzzy-rough sets on compact computational domain

The objective of this paper is to present an optimal design of Fuzzy Logic Controllers (FLCs) by Genetic Algorithms (GAs). As part of this objective, the design of input and output Membership Functions (mfs) of FLC is carried out simultaneously with input and output Scaling Factors (sfs). FLC since can be subjected to a range of set points, so the step size for mutation of alleles, and fitness function are adapted based upon Set Point Change (SPCs) commands, and besides, bounds of either input and output mfs or else of sfs are SPC-adapted; the latter two adaptations are demonstrated to be equivalent. Tuning is based upon maximization of a comprehensive fitness function constructed as inverse of a weighted-average of Integral Square Error (ISE), Peak Overshoot (Mp), Rise Time (tr) and Settling Time (ts), wherein weights for ISE and Mp are adapted. GA-evolved FLC (henceforth GAFLC) shows better closed-loop performance on linear and nonlinear stable and unstable systems as compared to a hand-designed FLC and a GA-designed PID (Proportional-Integral- Derivative Controller). This performance is almost fully preserved by GAFLC, under a wide range of SPCs, for linear systems (and the PID is demonstrated to share this property) and is better preserved by GAFLC than by PID for nonlinear systems. Some future directions are listed.

IETE Journal of Research

Evolving optimal fuzzy logic controllers by genetic algorithms

We present the first linear time (1 + ε)-approximation algorithm for the k-means problem for fixed k and ε. Our algorithm runs in O(nd) time, which is linear in the size of the input. Another feature of our algorithm is its simplicity - the only technique involved is random sampling. © 2004 IEEE.

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

A simple linear time (1 + ε)-approximation algorithm for k-means clustering in any dimensions

The light emission process from a p-n junction in the forward-bias region is slow to respond to modulation signals due to the indirect band structure of silicon. Experimental results for a reverse-bias region showing light modulation in the range of tens of gigahertz are observed for the first time. For such a light emitter, the limiting speed of light modulation is shown to be determined by the transit time of the minority carriers across the junction during the filament formation of breakdown currents, which has been demonstrated by simulation of the propagation of a shockwave-like pattern in the breakdown field. © 2004 IEEE.

IEEE Electron Device Letters

High-speed light modulation in avalanche breakdown mode for Si diodes

Environmental Health Perspectives

Bhopal: No silver linings [2]

Let G(V, E) be an undirected weighted graph with |V| = n, |E| = m. Recently Thorup and Zwick introduced a remarkable data-structure that stores all-pairs approximate distance information implicitly in o(n 2) space, and yet answers any approximate distance query in constant time. They named this data-structure approximate distance oracle because of this feature. Given an integer k &gt; 1, a (2k - 1)-approximate distance oracle requires O(kn 1+1/k) space and answers a (2k - 1)-approximate distance query in O(k) time. Thorup and Zwick showed that a (2k - 1)-approximate distance oracle can be computed in O(kmn 1/k) time, and posed the following question : Can (2k - 1)-approximate distance oracle be computed in Õ(n 2) time? In this paper, we answer their question in affirmative for unweighted graphs. We present an algorithm that computes (2k - 1)-approximate distance oracle for a given unweighted graph in Õ(n 2) time. One of the new ideas used in the improved algorithm also leads to the first linear time algorithm for computing an optimal size (2, 1)-spanner of an unweighted graph.