Anti-negation method for handling negation words in question answering system

The question answer (QA) system for a reading comprehension task tries to answer the question by retrieving the needed phrase from the given content. Precise answering is the key role of a QA system. An ambiguity is developed when we need to answer a negative question with a positive reply. The negation words change the polarity of the sentence, and hence, the scope of negation words is notable. This has paved the way for studying the role of ‘negation’ in the natural language processing (NLP) task. The handling of these words is considered a major part of our proposed methodology. In this paper, we propose an algorithm to retrieve and replace the negation words present in the content and query. A comparative study is done for performing word embedding over these words using various state-of-the-art methods. In earlier works when handling the negation the semantics of the sentences are changed. Hence, in this paper we try to maintain the semantics through our proposed methodology. The updated content is embedded into the bi-directional long short-term memory (Bi-LSTM) and thus makes the retrieving of an answer for a question answer system easier. The proposed work has been carried over the Stanford Negation, and the SQuAD dataset with a higher precision value of 96.2% has been achieved in retrieving the answers that are given in the dataset.

     

Proof-of-Improved-Participation: A New Consensus Protocol for Blockchain Technology

The Internet of Things (IoT) is converting today’s physical world into a complex and sophisticated network of connected devices on an enormous scale. The existing malicious node detection mechanism in traditional approaches lacks in transparency, availability, or traceability of the detection phase. To overcome these concerns, we provide a decentralized technique using blockchain technology. Despite the fact that blockchain technology is applicable to create that type of models, existing harmony set of instructions are susceptible to do violence to such as DoS and Sybil, making blockchain systems unfeasible. Here, a new Proof-of-Improved-Participation (PoIP) harmony instruction was suggested that benefits the participation rules to select honest peers for mining while limiting malicious peers. Under an evaluation the PoIP outperforms the Proof-of-Work (PoW) instructions are demonstrated, Proof of Stake (PoS) instructions in terms of energy consumption, accuracy, and bandwidth. To compare the three consensus protocols with respect to efficiency, we build a lightweight mining model and find that PoIP consensus has greater efficiency than PoW and PoS. PoIP has 25% lower attack risk than existing consensus. As a consequence, our suggested methodology can provide the needed security with minimal attack risk and high accuracy, according to the analysis results. As a result, suggested consensus is more efficient than existing methods in terms of block generation time. Hence we suggest that suggested consensus is very suitable for IoT-based applications especially in healthcare.     

Analytical model for Binding Refresh Request to reduce storage and communication overhead in MIPv6 network

Home agent is a key component of MIPv6 functionality that comprises binding cache to hold the mobile nodes current point of attachment to the Internet. This paper is concerned with binding cache support for home agents within MIPv6 network. Existing binding cache of home agent supports weak cache consistency by using fixed contract length for Binding Refresh Request, which functions reasonably well in normal situations. However, maintaining a strong binding cache consistency in home agent as a crucial exceptional handling mechanism has become more demanding for the following objectives: (i) to adapt increasingly frequent change of care‐of address due to mobile nodes movement detection update; (ii) to provide fine‐grain controls to balance the binding cache load distributions for better delivery services; and (iii) to reduce the overhead allowances around the binding cache. In this paper, we have first verified the effectiveness of Binding Refresh Request contract length, and on the basis of that, two dynamic contract algorithms are suggested to reduce the storage and communication overhead allowances in binding cache. We have also compared our technique with the existing fixed Binding Refresh Request contract length, and our simulation results reveals that the proposed approach provides an effective performance to reduce overhead within the network. Copyright © 2014 John Wiley & Sons, Ltd.     

Cost Effective Decentralized Key Management Framework for IoT

Security is a primary concern in communication for reliable transfer of information between the authenticated members, which becomes more complex in a network of Internet of Things (IoT). To provide security for group communication a key management scheme incorporating Bilinear pairing technique with Multicast and Unicast key management protocol (BMU-IOT) for decentralized networks has been proposed. The first part of the proposed work is to divide the network into clusters where sensors are connected to and is administered by cluster head. Each sensor securely shares its secret keys with the cluster head using unicast. Based on these decryption keys, the cluster head generates a common encryption key using bilinear pairing. Any sensor in the subgroup can decrypt the message, which is encrypted by the common encryption key. The remaining part focuses to reduce communication, computation and storage costs of the proposed framework and the resilience against various attacks. The implementation is carried out and results are compared with the existing schemes that have given considerably better results. Thus, the lightweight devices of IoT can provide efficiency and security by reducing their overhead in terms of complexity.     

Parallelization of a graph‐cut based algorithm for hierarchical clustering of web documents

We propose a parallelization scheme for an existing algorithm for constructing a web‐directory, that contains categories of web documents organized hierarchically. The clustering algorithm automatically infers the number of clusters using a quality function based on graph cuts. A parallel implementation of the algorithm has been developed to run on a cluster of multi‐core processors interconnected by an intranet. The effect of the well‐known Latent Semantic Indexing on the performance of the clustering algorithm is also considered. The parallelized graph‐cut based clustering algorithm achieves an F‐measure in the range [0.69,0.91] for the generated leaf‐level clusters while yielding a precision‐recall performance in the range [0.66,0.84] for the entire hierarchy of the generated clusters. As measured via empirical observations, the parallel algorithm achieves an average speedup of 7.38 over its sequential variant, at the same time yielding a better clustering performance than the sequential algorithm in terms of F‐measure. Copyright © 2015 John Wiley & Sons, Ltd.     

A Lightweight Scalable and Secure Blockchain Based IoT Using Fuzzy Logic

Wireless Personal Communications - The Blockchain mechanism usually transacts the data between the blocks but there exists a restriction of total transaction within a local ledger. This often may...     

Wormhole-Free Routing and DoS Attack Defense in Wireless Mesh Networks

Owing to the growth in several applications, Wireless Mesh Networks (WMN) is emerging as a vital technology for future wireless networks. Wormhole attack is one of the major security threats, which can disturb majority of routing communications, even when placed strategically. Therefore, a technique that can find wormhole-free routes in the network is required. In order to achieve this, in this paper, we propose a Monitoring Technique for Wormhole-Free Routing and DoS Attack Defense in WMNs. Initially, finite state model is applied where the node keeps the information about its sender and neighborhood receiver. Then, wormhole-aware secure routing is implemented to find wormhole free routes in the network. Finally, the priority mechanism is applied where the data packets are transmitted based on their priority. Based on the finite state model and priority mechanism, the malicious or wormhole nodes in the network are removed.