(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

In this paper, a Hamilton-Jacobi-Bellman (HJB) equation based optimal control algorithm for robust controller design, is proposed for a nonlinear system. Utilizing the Lyapunov direct method, controller is shown to be optimal with respect to a cost functional that includes maximum bound on system uncertainty. Controller is continuous and requires the knowledge of the upper bound of system uncertainty. In the proposed algorithm, Neural Network (NN) is used to find approximate solution of HJB equation. Proposed algorithm has been applied on a nonlinear uncertain system. © 2009 IEEE.

World University root node

Electrical Engineering

Proceedings of the 7th International Conference on Advances in Pattern Recognition, ICAPR 2009

Optimal control approach to robust control of nonlinear systems using neural network based HJB solution

A power transformer, when energized at no-load, may have transient currents up to 100 times that of the steady state magnetizing current. This inrush current has several detrimental effects on power quality and may damage sensitive equipment connected to the system. In this paper, a power electronic based control circuit is developed, which estimates the last remnant and, utilizing this data, it controls the next re-energization instant to achieve inrush free switching. An equivalent circuit model of a transformer is also presented to simulate the transient dynamic performance of a transformer for any arbitrary switching operation. © 2009 The Berkeley Electronic Press. All rights reserved.

Fulltext

International Journal of Emerging Electric Power Systems

Magnetizing switching inrush: Estimation and a novel circuitry for inrush elimination

The multiplex polymerase chain reaction (MP-PCR) is a quick and inexpensive technique in molecular biology for amplifying multiple DNA loci in a single Polymerase Chain Reaction (PCR). One of the criteria to achieve highly specific reaction products is to keep the concentration of the amplification primers low. In research, the dilemma associated with primer minimization for MP-PCR reactions has been formulated as the Multiple Degenerate Primer Selection Problem (MDPSP). MDPSP is related to the earlier Degenerate Primer Design (DPD) problem that has proven to be NP-complete. This paper formulates a new, so far, unexplored variant, the Multiple Degenerate Primer Selection Problem with Errors (MDPSPE) and introduces new algorithms for solving this new version. Furthermore, we implement an exact algorithm, DPS-HDR for solving the earlier MDPSP and compare the algorithm's performance on randomly generated data sets with DPS-HD, thus far the most efficient algorithm for solving MDPSP introduced in [2]. We expect to reduce the execution time of the algorithm in comparison to DPS-HD. © 2009 IEEE.

Computer Science and Engineering

2009 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology, CIBCB 2009 - Proceedings

Degenerate primer selection algorithms1

Solid-state electronics

Drain current model for nanoscale double-gate MOSFETs

Math-based models developed by the MSU/CAVS team have considered both the compaction and sintering processes. Due to the very large number of input variables for the compaction model it is helpful to understand how sensitive the model output is to small changes in these input variables in order to better apply the model to real world processes. Using numerical methods both uncertainty and sensitivity analysis can be applied to the model and the most significant terms identified. Through further numerical analysis the output of the compaction model can be optimized for one or more output parameters, e.g. least density variation, lowest mass, minimal part thickness. These techniques will be illustrated using a well-established automotive PM product, the main bearing cap.

Mechanical Engineering

Advances in Powder Metallurgy and Particulate Materials - 2009, Proceedings of the 2009 International Conference on Powder Metallurgy and Particulate Materials, PowderMet 2009

Process modeling: Use of uncertainty, sensitivity and optimization techniques for improved understanding of compaction model outputs

Methyl ethyl ketone peroxide (MEKPO) is an unstable material above certain limits of temperature, decomposing into chain reactions by radicals. The influence of runaway reactions on this basic characteristic was assessed by evaluating kinetic parameters, such as activation energy (E a ), frequency factor (A), etc., by thermal activity monitor III (TAM III). This was done under three isothermal conditions of 70, 80, and 90 °C, with MEKPO 31 mass% combined with nitric acid (HNO3 6 N) and sodium nitrate (NaNO3 6 N). Nitric acid mixed with MEKPO gave the maximum heat of reaction (δH d ) and also induced serious reactions in the initial stage of exothermic process under the three isothermal temperatures. The time to maximum rate (TMR) also decreased when HNO3 was mixed with MEKPO. Thus, MEKPO combined with HNO3 6 N forms a very hazardous mixture. Results of this study will be provided to relevant plants for alerting their staff on adopting best practices in emergency response or accident control. © 2009 Akadémiai Kiadó, Budapest, Hungary.

Chemical Engineering

Journal of Thermal Analysis and Calorimetry

Runaway effects of nitric acid on methyl ethyl ketone peroxide by TAM III tests

Selected Mapping (SLM) technique is one of the promising PAPR reduction techniques for Orthogonal Frequency Division Multiplexing (OFDM). But this reduction technique results in a huge amount of computation complexity which is costly and time consuming. In this paper, Riemann sequences are used as a phase vectors along with the thresholding of the power amplifier(PA). The default index of the phase sequence is used to reduce the computational complexity of SLM technique. The default index of a phase sequence refers to the starting index for the phase vectors in the SLM scheme. This index is derived from the experimentation results. The Matlab simulations show that the complexity has been reduced by 98 percent if the threshold value of PA is around 3.0dB.

Proceedings of INDICON 2009 - An IEEE India Council Conference

A low complexity SLM technique for PAPR reduction in OFDM using Riemann sequence and thresholding of power amplifier

For Reed-Solomon codes with block length n and dimension k, the Johnson theorem states that for a Hamming ball of radius smaller than n - sqrt(n k), there can be at most O (n2) codewords. It was not known whether for larger radius, the number of codewords is polynomial. The best known list decoding algorithm for Reed-Solomon codes due to Guruswami and Sudan [Venkatesan Guruswami, Madhu Sudan, Improved decoding of Reed-Solomon and algebraic-geometry codes, IEEE Transactions on Information Theory 45 (6) (1999) 1757-1767] is also known to work in polynomial time only within this radius. In this paper we prove that when k &lt; α n for any constant 0 &lt; α &lt; 1, we can overcome the barrier of the Johnson bound for list decoding of Reed-Solomon codes (even if the field size is exponential). More specifically in such a case, we prove that for Hamming ball of radius n - sqrt(n k) + c (for any c &gt; 0) there can be at most O (nc frac(2 sqrt(α), (1 - sqrt(α))2) + c + 2) number of codewords. For any constant c, we describe a polynomial time algorithm for enumerating all of them, thereby also improving on the Guruswami-Sudan algorithm. Although the improvement is modest, this provides evidence for the first time that the n - sqrt(n k) bound is not sacrosanct for such a high rate. We apply our method to obtain sharper bounds on a list recovery problem introduced by Guruswami and Rudra [Venkatesan Guruswami, Atri Rudra, Limits to list decoding Reed-Solomon codes, IEEE Transactions on Information Theory 52 (8) (2006) 3642-3649] where they establish super-polynomial lower bounds on the output size when the list size exceeds ⌈ frac(n, k) ⌉. We show that even for larger list sizes the problem can be solved in polynomial time for certain values of k. © 2008 Elsevier B.V. All rights reserved.

Discrete Applied Mathematics

Improvements on the Johnson bound for Reed-Solomon codes

AlN films were grown on silicon by DC reactive magnetron sputtering and Al/AlN/Si structures were fabricated to study the influence of post metalization annealing (PMA) and UV light. Thereafter, the samples were annealed at 350 oC for 30 minutes in presence of argon gas. Reduction of hysteresis as well as interface state density was observed as a result of PMA. On the other hand, a ledge appeared in C-V curves, which became prominent with light intensity. The leakage current increased significantly as a result of photo generated charge carriers.

Optoelectronics and Advanced Materials, Rapid Communications

Opto-electrical properties of sputtered AlN films

We have studied surface and structural properties of micro/nanoporous silicon, synthesized by electrochemical etching of ptype Si (100) with different etching conditions. SEM studies reveal tunable pore sizes from 200 nm to 1.5 μm for etching time 5 to 30 min, and the thickness of pore walls decreases upto 20 nm for 30 min etching. AFM investigations reveal increase in roughness of the porous structure with increase in etching time and saturate around 250 nm at higher etching time. X-ray diffractogram of porous Si surface for etching time 20 min shows the appearance of two peaks at 2θ = 69.13° and 69.33°. For 30 min etching time a broad peak is observed at 2θ = 69.39°. The broadening may due to the size distributions of pore walls, and up ward shifts may due to relaxation of strain in the porous structure. FTIR investigations show the presence of Si-H bending in Si3-SiH groups at 624 cm-1, Si-O stretching in O-Si-O in between 1056-1160 cm -1. The bands at 2958, 2927, and 2856 cm-lare related to C-H stretching of CH3, CH2, and CH groups, which probably come from residual of HF-dimethylformamide.