Institution
National Institute of Technology, Raipur
Education•Raipur, Chhattisgarh, India•
About: National Institute of Technology, Raipur is a education organization based out in Raipur, Chhattisgarh, India. It is known for research contribution in the topics: Computer science & Fault (power engineering). The organization has 1549 authors who have published 3229 publications receiving 25258 citations. The organization is also known as: NIT Raipur & Govt. College of Mining & Metallurgy.
Topics: Computer science, Fault (power engineering), Wireless sensor network, Fault detection and isolation, Support vector machine
Papers published on a yearly basis
Papers
More filters
••
TL;DR: Results show that demand ratio plays an important role in the identification of the optimal design with respect to the three objectives considered, which takes sustainability into consideration by formulating economic, environmental and social objectives.
15 citations
••
TL;DR: This review summarizes the recent trends in the biosynthesis of nanoparticles using microorganisms and highlights different parameters affecting the biosynthetic process identified in previous research in this field.
Abstract: The emergence of nanoscience and nanotechnology has explored various protocols to identify many hidden dimensions of matter, modified existing laws, and principles of nature. Synthesis of nanodimen...
15 citations
••
TL;DR: Neighbour based TLBO (NTLBO) and differential mutation are introduced to improve the convergence solution after each run of experiment and the result shows that the proposed NTLBO gives the superior performance over recent meta-heuristic algorithms.
Abstract: In the recent era, evolutionary meta-heuristic algorithms is popular research area in engineering and scientific field. One of the intelligent evolutionary meta-heuristic algorithms is Teaching Learning Based Optimization (TLBO). The basic TLBO algorithm follows the isolated learning strategy for the whole population. This invariable learning strategy may cause the misconception of knowledge for a specific learner, which makes it unable to deal with different complex situations. For solving the complex non-linear optimization problems, local optimum frequently happens in the generating process. To resolve these kinds of problem, this paper introduces Neighbour based TLBO (NTLBO) and differential mutation. The concept of neighbour learning and differential mutation is introduced to improve the convergence solution after each run of experiment. Neighbour learning method maintains the explorative and exploitation search of the population and discourages the premature convergence. The efficiency of the proposed algorithm is evaluated on eight benchmark functions of Congress on Evolutionary Computation (CEC) 2006. The proposed NTLBO present extensive comparative study with the state-of-theart forms of the meta-heuristic algorithms for standard benchmark functions. The result shows that the proposed NTLBO gives the superior performance over recent meta-heuristic algorithms.
15 citations
••
01 Nov 2013TL;DR: In this work a methodology is presented to find the taxonomic terms using Latent Dirichlet Allocation (LDA) for software bug classification.
Abstract: Discovering categorical (taxonomic) terms in text classification is an important and complex problem Development of a good text classifier depends on the method of identification and generation of proper taxonomic terms Software bug indicates improper behavior of the functionalities given during the requirements These bugs are tracked with the help of bug tracking systems (BTS) where the bug information is presented using several attributes out of which some important attributes are textual for example summary and description For effective classification of the software bugs a good text classifying mechanism is required for which proper taxonomic terms are required to be identified In this work a methodology is presented to find the taxonomic terms using Latent Dirichlet Allocation (LDA) for software bug classification
15 citations
••
TL;DR: This article presents cyber-attack resilient design of wide-area power system stabilizers (WAPSSs) for damping low-frequency oscillations considering practical communication constraints and simple and time-efficient techniques are proposed to compensate time-delay and to predict input signals in case of data drops and attacks.
Abstract: This article presents cyber-attack resilient design of wide-area power system stabilizers (WAPSSs) for damping low-frequency oscillations considering practical communication constraints. The measurements estimated by phasor measurement units (PMUs) are inherent to communication constraints such as time-delay, packet drops, and cyber-attacks. In this article, the generator terminal bus frequencies (approximately representing respective rotor speeds) are estimated by PMUs and their differences are considered as input control signals to WAPSSs. In case if the communication constraints associated with transfer of estimated frequencies are not addressed properly then they may reduce the damping capability of WAPSSs. In this context, simple and time-efficient techniques are proposed to compensate time-delay and to predict input signals in case of data drops and attacks for improving the performance of WAPSSs. A cryptographic security by means of hashed algorithms is provided to remote signals for the detection of occurrence and period of cyber-attack. The parameters of WAPSSs are tuned using a hybrid optimization algorithm. The efficacy of proposed technique is validated on IEEE 39-bus system operating under different conditions.
15 citations
Authors
Showing all 1625 results
Name | H-index | Papers | Citations |
---|---|---|---|
Shyam Sundar | 86 | 614 | 30289 |
Arun Kumar | 81 | 384 | 26259 |
Yogesh Sharma | 59 | 261 | 12027 |
Anil Kumar | 44 | 1411 | 11378 |
Xiangliang Pan | 43 | 227 | 5699 |
Rajesh Kumar | 37 | 525 | 6193 |
Subhamoy Bhattacharya | 33 | 198 | 3469 |
Vinod Kumar Singh | 32 | 186 | 3797 |
Kamlesh Shrivas | 26 | 98 | 2120 |
Varun Bajaj | 26 | 132 | 2791 |
Manoranjan Dash | 24 | 72 | 7720 |
Awanish Kumar | 24 | 141 | 2064 |
Anup Sharma | 23 | 99 | 3301 |
Manish Mishra | 22 | 56 | 1275 |
Pradeep Kumar Singh | 22 | 234 | 1720 |