{"title":"Hybrid connectivity restoration approach for WSANs","authors":"Harinder Kaur","doi":"10.1109/IICIP.2016.7975306","DOIUrl":"https://doi.org/10.1109/IICIP.2016.7975306","url":null,"abstract":"Wireless Sensor and Actor Networks (WSAN) have been very popular from the research community because of their suitability for real time systems. To maintain inter-actor connectivity is crucial in real time situations where actors have to quickly take corrective actions to detected events. Failure of actor and sensors partitions the inter-actor network into disjoint segments, and thus disrupt the network connectivity. Various approaches have been proposed to restore the connectivity of the network. This paper proposes the node failure recovery scheme known as hybrid connectivity restoration approach that works in a distributed manner for detecting partitions in a network and restore the connectivity. This approach may involve relocation of multiple sensors and actor nodes on the path and also analyze the energy consumption of each node before selecting them as a backup node. Thus, reducing the message overhead, less data backup energy consumption, and improves network connectivity. The effectiveness of this hybridization is validated through various simulation experiments.","PeriodicalId":220344,"journal":{"name":"2016 1st India International Conference on Information Processing (IICIP)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122796887","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Studying daily behavior patterns using fuzzy networks","authors":"N. Garg, J. Lather, S. K. Dhurandher","doi":"10.1109/IICIP.2016.7975312","DOIUrl":"https://doi.org/10.1109/IICIP.2016.7975312","url":null,"abstract":"Ubiquitous systems use context information and observed human patterns to dynamically change appliance behavior to human needs in today's world. We would like to comment that resources, infrastructures and applications supporting these two, keep on changing as per dynamic changes in environment. We have tried to cover reasoning patterns and after watching carefully some happening events, to predict something in future about the user that is being observed and monitored. We may get surprising welcome results, if the appliance can make an idea about the user's desires and acts proactively. Although it, is very difficult to deduce future desires of an individual, looking back at his/her life logging details, despite the fact that this deduction also intrudes into privacy aspects. Our pervasive computing framework, Behavior Context Memory(BCM), will allow different observations to get shaped as well as to reason about uncertain situations in today's world using fuzzy logic. The outcome of our framework, Behavior Context Memory(BCM), is given in terms of some fuzzy service model for a person observing different people nearby and keeping in mind some noticeable events.","PeriodicalId":220344,"journal":{"name":"2016 1st India International Conference on Information Processing (IICIP)","volume":"30 11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123155626","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Implementation of phonetic level speech recognition system for Punjabi language","authors":"Shama Mittal, Rupinderdeep Kaur","doi":"10.1109/IICIP.2016.7975338","DOIUrl":"https://doi.org/10.1109/IICIP.2016.7975338","url":null,"abstract":"This paper explains the implementation of the phonetic level speech recognition system for Punjabi language because it is a highly prosodic language. Here Hidden Markov Toolkit (HTK) is used. First step is data collection and nine hours data is collected in read speech mode. Second step is data preparation, in which hmmlist, grammar and dictionary files are created. Once the data is prepared, 75% and 25% of data is used for training and testing respectively. The experimental results show that the accuracy of the system increases from 49.95% to 59.38% as number of phonetic unit's increases from 30 to 34 and data increases from 3 hours to 6 hours respectively.","PeriodicalId":220344,"journal":{"name":"2016 1st India International Conference on Information Processing (IICIP)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114354136","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Implementation of improved fractional order capacitor approximations in analog circuits","authors":"Maneesha Gupta, R. Yadav, Gull Kaur","doi":"10.1109/IICIP.2016.7975395","DOIUrl":"https://doi.org/10.1109/IICIP.2016.7975395","url":null,"abstract":"The paper aims at various techniques to approximate fractional capacitor using passive elements. The fractional capacitors have been used to implement an astable multivibrator, sinusoidal oscillator, function generator and filters. PSPICE simulation results have been shown for the circuits both with and without using the fractional capacitors. By comparing the simulation results, it can be shown that on employing a fractional capacitor, the frequency of the multivibrator and oscillators as well as the bandwidth of the filters have improved by a factor as high as 1000 compared to if a normal capacitor of the same value is employed.","PeriodicalId":220344,"journal":{"name":"2016 1st India International Conference on Information Processing (IICIP)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114806652","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An efficient compression technique for ITU-T group 3 coded images using variable length codes with reduced average length","authors":"T. Kavitha, David A. Huffman","doi":"10.1109/IICIP.2016.7975340","DOIUrl":"https://doi.org/10.1109/IICIP.2016.7975340","url":null,"abstract":"In this paper a set of variable Length codes are designed for source coding of data. The designed codes satisfy the properties of being uniquely decodable, prefix free codes and satisfy Kraft McMillan inequality. The designed prefix codes are used for compressing binary Image for Facsimile Transmission. The proposed Codewords have achieved reduced average length and increase in coding efficiency when applied to the set of standard CCITT images. The proposed codes have average length of 7.7 which is less compared to 8.63 of standard Modified Huffman codes used for CCITT Group3 compression. An improvement of up to 10.4% in coding efficiency and reduced average length of 1.24 bits/symbol is achieved for a particular CCITT image. The proposed scheme has less number of Codewords 71 compared to that of CCITT Group 3 standard codes which are 183 in number. The proposed Codewords requires less memory for encoding and decoding using lookup tables and as well as less CPU time for processing.","PeriodicalId":220344,"journal":{"name":"2016 1st India International Conference on Information Processing (IICIP)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134346023","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Class/aspect level mutation operators in aspect-oriented software systems","authors":"Vasundhara Bhatia, Abhishek Singhal","doi":"10.1109/IICIP.2016.7975397","DOIUrl":"https://doi.org/10.1109/IICIP.2016.7975397","url":null,"abstract":"Software testing is a significant phase in the development of any software. So, it becomes necessary that appropriate software testing techniques are used. Mutation testing is one of the techniques, which are present for testing. The testing is achieved here by offering faults into a program. These faults help to examine the test suite's efficiency. These faults are known as mutant. The focus of this paper is on mutants for aspect-oriented software. Aspect-oriented approach aims to provide modularity, higher cohesion and separation of concerns. The programs are modularized by separating the crosscutting concerns from the base class by introducing a new module known as aspect. Mutation operators can be introduced at both the base class as well as the aspect level. In this paper, we have proposed 21 mutation operators for aspect-oriented systems at the base class and the aspect level. A mutation score is calculated by applying these operators on two applications.","PeriodicalId":220344,"journal":{"name":"2016 1st India International Conference on Information Processing (IICIP)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129336860","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Low cost implementation of concurrent decision feedback equalizer using distributed arithmetic","authors":"M. T. Khan, Shaik Rafi Ahamed","doi":"10.1109/IICIP.2016.7975352","DOIUrl":"https://doi.org/10.1109/IICIP.2016.7975352","url":null,"abstract":"This paper presents an architecture of decision feedback equalizer (DFE) based on concurrent lookahead technique using distributed arithmetic (DA) for low cost implementation. For multi-gigabit design, concurrent lookahead technique opens up the loop and provides throughput which is proportional to parallelization factor using multi-input finite impulse response (MI-FIR) filter. We employed DA approach in our scheme for both in pre-lookahead filter and post-lookahead filter by deriving its weight vectors, which could be pre-computed and stored in look-up table (LUT). This results in saving significant chip area with filters of high order and can be used in high speed applications with more parallelization since it maintains the concurrent nature. We have carried out synthesis in cadence RTL compiler using UMC 180 nm CMOS technology for feedback filter of order N = 3, 6 and 9 and found that our scheme provides low area compared to existing schemes.","PeriodicalId":220344,"journal":{"name":"2016 1st India International Conference on Information Processing (IICIP)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122131568","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
V. Pandey, Ahsaas Bajaj, Jyotsna Singh, H. Parthasarathy
{"title":"Image analysis using Bateman moment","authors":"V. Pandey, Ahsaas Bajaj, Jyotsna Singh, H. Parthasarathy","doi":"10.1109/IICIP.2016.7975396","DOIUrl":"https://doi.org/10.1109/IICIP.2016.7975396","url":null,"abstract":"This paper proposes a new set of moments based on Bateman polynomial which is orthogonal in nature. The translation and scale invariant of Bateman moment has also derived using the linear combination of invariants of geometric moments. Bateman moment takes less order of moment to reconstruct an image. The results have shown that the proposed moment works better than Legendre moment.","PeriodicalId":220344,"journal":{"name":"2016 1st India International Conference on Information Processing (IICIP)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125568637","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"JOSN: JAVA oriented question-answering system combining semantic web and natural language processing techniques","authors":"S. Garg, Suresh Kumar","doi":"10.1109/IICIP.2016.7975361","DOIUrl":"https://doi.org/10.1109/IICIP.2016.7975361","url":null,"abstract":"Question-Answering (QA) system is improved version of search engines or can be stated as specific Search engines because search engines deliver data in the form of URLs whereas Question-Answering system produces direct answer to the query asked. That's why more focus has been put on developing better Question Answering systems that could respond to large variety of user query. Semantic Web Technology has aided to the development of such systems from past many years because it could add meaning to the query being asked. Such systems are more efficient than the systems developed in other languages. In this paper, we have proposed a QA system of JAVA Programming Language, where knowledge will be represented in the form of Ontology and based on relations derived from domain knowledge to obtained final answer. Information present in Ontology is represented in the form of tables to feed in knowledge base. It combines the techniques of Natural Language Processing and Semantic Web.","PeriodicalId":220344,"journal":{"name":"2016 1st India International Conference on Information Processing (IICIP)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124176761","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
D. Sharma, S. K. Dhurandher, Amit Gupta, Ashray Anand
{"title":"Centrality based congestion controlled routing protocol for social opportunistic networks","authors":"D. Sharma, S. K. Dhurandher, Amit Gupta, Ashray Anand","doi":"10.1109/IICIP.2016.7975388","DOIUrl":"https://doi.org/10.1109/IICIP.2016.7975388","url":null,"abstract":"Opportunistic networks (Oppnets) use the Store, Carry, and Forward technique for routing of messages. This technique can increase the prospects of message delivery but it is resource intensive as messages are kept in node's buffer until an appropriate next hop node is find out. This may lead to increased overhead and buffer overflow that causes congestion. In view of this, a scheme based on centrality and message parameters named as Centrality based Congestion Controlled Routing Protocol (CCCRP) has been proposed in this paper. It allows a receiver node to accept the message of a sender node whose centrality is high and to-be-sent message carries an \"importance\" as compared to others from a set of neighbouring sender nodes. The CCCRP is compared with Epidemic protocol in respect of messages dropped and overhead ratio parameters. Results obtained indicate that CCCRP outperforms Epidemic protocol in terms of the aforementioned parameters.","PeriodicalId":220344,"journal":{"name":"2016 1st India International Conference on Information Processing (IICIP)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128072737","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}