Motilal Nehru National Institute of Technology Allahabad

About: Motilal Nehru National Institute of Technology Allahabad is a education organization based out in Allahabad, Uttar Pradesh, India. It is known for research contribution in the topics: Computer science & Control theory. The organization has 2475 authors who have published 5067 publications receiving 61891 citations. The organization is also known as: NIT Allahabad & Motilal Nehru Regional Engineering College.

Buckling analysis of a beam–column using multilayer perceptron neural network technique

Abstract: We present the mathematical model and an artificial neural network method for calculating the buckling load of a beam column with different end conditions. A trial solution of the beam column equation is written as a sum of two parts, in which first part satisfies the boundary conditions and the second part represents the feed forward neural network containing adjustable parameters, weights and biases. We prepared the Error function by using the beam column equation and its boundary conditions, which is used in the back propagation method with deflection term to update the network parameters. It is found that the artificial neural network method is capable for calculating deflection of a beam column as a part of the training process. To ascertain the soundness, efficiency and accuracy of the proposed method the results are compared to the Euler critical load.

ECDLP-based certificateless proxy signature scheme with message recovery

Abstract: Certificateless public key cryptography PKC eliminates the use of certificates in traditional PKC and the key escrow problem in identity-based PKC. Up to now, a number of certificateless proxy signature CLPS schemes have been proposed. However, only a little attention has been paid to the construction of CLPS schemes with message recovery. Recently, Singh and Verma proposed a CLPS scheme with message recovery from bilinear pairings. Total computation cost of a pairing is higher than that of elliptic curve-based scalar multiplication over elliptic curve group. So, schemes without pairings would be more appealing in terms of efficiency. To the best of our knowledge, there is no provable secure CLPS scheme with message recovery based on elliptic curve discrete log problem. We first propose such CLPS scheme. Our scheme is secure against existential forgery under adaptive chosen message and ID attacks. Furthermore, it is more efficient than Singh and Verma's scheme for practical applications. Copyright © 2012 John Wiley & Sons, Ltd.

Islanding detection in distributed generation system using intrinsic time decomposition

Abstract: This study introduces the implementation of intrinsic time decomposition (ITD) based passive islanding detection technique for distributed generation (DG) system. The proposed method utilises voltage signals and decomposes it into a baseline signal and residual signal. The performance index in terms of energy computed from baseline signal is defined to discriminate between islanding and non-islanding events. The proposed ITD based technique for islanding detection has been analysed on different types of DGs connected to the system. The performance of the proposed technique is validated via simulation of distribution system modelled in EMTDC/PSCAD. The different critical operating conditions: lower end active and reactive power mismatch and events like capacitor switching, load switching, inception of fault, have been simulated to test the performance of the proposed scheme. The obtained results suggest that the proposed technique exhibits high reliability and has quick response time to detect islanding situation as compared to other passive islanding detection methods.

Security Attacks in Named Data Networking: A Review and Research Directions

Abstract: Contents such as audios, videos, and images, contribute most of the Internet traffic in the current paradigm. Secure content sharing is a tedious issue. The existing security solutions do not secure data but secure the communicating endpoints. Named data networking (NDN) secures the data by enforcing the data publisher to sign the data. Any user can verify the data by using the public key of the publisher. NDN is resilient to most of the probable security attacks in the TCP/IP model due to its new architecture. However, new types of attacks are possible in NDN. This article surveys the most significant security attacks in NDN such as interest flooding attacks, cache privacy attacks, cache pollution attacks, and content poisoning attacks. Each attack is classified according to their behavior and discussed for their detection techniques, countermeasures, and the affected parameters. The article is an attempt to help new researchers in this area to gather the domain knowledge of NDN. The article also provides open research issues that could be addressed by researchers.