Narula Institute of Technology

About: Narula Institute of Technology is a based out in . It is known for research contribution in the topics: Quantum dot cellular automaton & Cognitive radio. The organization has 288 authors who have published 490 publications receiving 2258 citations. The organization is also known as: NiT.

Determination of window size for baseline estimation of fetal heart rate using CTG

Abstract: One of the major features of fetal heart rate (FHR) is its baseline, the accurate classification of which is of utmost importance as all the other parameters of cardiotography (CTG) rely on it. Though guidelines for interpretation had been put forward by different organizations, they not only lack uniformity, but also are not definite, hence, difficult to implement in automated systems. We aim to propose a standardized baseline estimation algorithm addressing these issues. Baseline was calculated within continuous sliding window of duration 10 minutes and varying slide-lengths. The best slide-length is chosen and the corresponding baseline value is compared with the one obtained with discreet window as suggested by NICHD [1] and the estimate given by three experienced physicians. The results are analyzed using standard statistical methods such as confidence level, error margin, standard error etc. at a Confidence Level of 95%. The results of the algorithm and mathematical calculations incorporated in this work is found encouraging. Thus the proposed algorithm can not only be used to easily estimate the baseline using overlapping window but can also be adopted in an automated system for the interpretation of CTG.

Using Genetic Algorithm for Solving Linear Multilevel Programming Problems via Fuzzy Goal Programming

Abstract: This article presents a fuzzy goal programming (FGP) procedure for modeling and solving multilevel programming (MLP) problems by using genetic algorithm (GA) in a large hierarchical decision making system.

Emergency Restoration Based on Priority of Load Importance Using Floyd–Warshall Shortest Path Algorithm

Abstract: This work presents a novel algorithm for service restoration with an aim to provide power to each important load by the black-start generator during emergency after an immediate blackout. In this process of the restoration, total network must be clustered satisfying all of the electrical constraints based on load priority. To achieve the above objectives, priority-based Floyd–Warshall all-pair shortest path algorithm (FWA) has been utilized. This algorithm will provide the shortest distance between all the pairs of the buses (i.e., vertices in graph theory). Simulation on IEEE 14 bus system has been carried out. The result shows that the proposed method can effectively determine the cluster by means of shortest path algorithm for the reenergizing network after the blackout satisfying all constraints in a very small operating time.