{"title":"Bioinspired memory model for HTM face recognition","authors":"O. Krestinskaya, A. P. James","doi":"10.1109/ICACCI.2016.7732265","DOIUrl":"https://doi.org/10.1109/ICACCI.2016.7732265","url":null,"abstract":"Inspired from the working principle of human memory, we propose a new algorithm for storing HTM features detected from images. The resulting features from the training set require lower memory than existing HTM training set. The proposed features are tested in a face recognition problem using the benchmark AR dataset. the simulation results show that the proposed algorithm gives higher face recognition accuracy, in comparison to the conventional methods.","PeriodicalId":371328,"journal":{"name":"2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126184457","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":"Mid-infrared supercontinuum generation in Ge11.5As24Se64.5 based chalcogenide photonic crystal fiber","authors":"S. Vyas, T. Tanabe, M. Tiwari, G. Singh","doi":"10.1109/ICACCI.2016.7732436","DOIUrl":"https://doi.org/10.1109/ICACCI.2016.7732436","url":null,"abstract":"In this paper, we have numerically investigated a Ge<sub>11.5</sub>As<sub>24</sub>Se<sub>64.5</sub> based chalcogenide photonic crystal fiber and simulated 1-10 μm mid-infrared supercontinuum generation. This mid-infrared broadband supercontinuum is achieved for 100 mm long photonic crystal fiber pumped with 85 femtosecond laser pulses operated at 3.1 μm and peak power pulse is 3 kW. A broad and flat dispersion profile with two zero dispersion wavelengths of Ge<sub>11.5</sub>As<sub>24</sub>Se<sub>64.5</sub> photonic crystal fiber combined with the high nonlinearity and generate ultra flat broadband supercontinuum.","PeriodicalId":371328,"journal":{"name":"2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126227261","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":"Development of low cost EMG data acquisition system for arm activities recognition","authors":"Sidharth Pancholi, R. Agarwal","doi":"10.1109/ICACCI.2016.7732427","DOIUrl":"https://doi.org/10.1109/ICACCI.2016.7732427","url":null,"abstract":"Electromyography (EMG) signals are becoming continuously more important in many fields, including biomedical/clinical, prosthesis, human machine interaction and rehabilitation devices. In the present study, to meet the requisites of EMG data acquisition systems, a high resolution, and highly competitive eight channel system has been developed, which is cost efficient and compact as compared to commercially available systems. To validate the developed system, EMG signals have been acquired from various muscles for different arm activities and also machine learning techniques have been utilized for activity recognition. For the current study 8 Male and 4 Female healthy subjects have been selected. For classification purpose, various time and frequency domain features have been extracted and a comparative study of different classification techniques is presented. The classification accuracy ranges from 43.64% to 92.61% for different classification algorithms. For this piece of work MATLAB 15a is utilized for signal processing and machine learning.","PeriodicalId":371328,"journal":{"name":"2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131066930","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}
Ons Jallouli, Mohammed AbuTaha, S. E. Assad, M. Chetto, Audrey Queudet, O. Déforges
{"title":"Comparative study of two pseudo chaotic number generators for securing the IoT","authors":"Ons Jallouli, Mohammed AbuTaha, S. E. Assad, M. Chetto, Audrey Queudet, O. Déforges","doi":"10.1109/ICACCI.2016.7732234","DOIUrl":"https://doi.org/10.1109/ICACCI.2016.7732234","url":null,"abstract":"The extremely rapid development of the Internet of Things brings growing attention to the information security issue. Realization of cryptographically strong pseudo random number generators (PRNGs), is crucial in securing sensitive data. They play an important role in cryptography and in network security applications. In this paper, we realize a comparative study of two pseudo chaotic number generators (PCNGs). The First pseudo chaotic number generator (PCNG1) is based on two nonlinear recursive filters of order one using a Skew Tent map (STmap) and a Piece-Wise Linear Chaotic map (PWLCmap) as non linear functions. The second pseudo chaotic number generator (PCNG2) consists of four coupled chaotic maps, namely: PWLCmaps, STmap, Logistic map by means a binary diffusion matrix [D]. A comparative analysis of the performance in terms of computation time (Generation time, Bit rate and Number of needed cycles to generate one byte) and security of the two PCNGs is carried out.","PeriodicalId":371328,"journal":{"name":"2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131555450","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}
Sandipan Choudhuri, N. Das, Swarnendu Ghosh, M. Nasipuri
{"title":"A multi-cue information based approach to contour detection by utilizing superpixel segmentation","authors":"Sandipan Choudhuri, N. Das, Swarnendu Ghosh, M. Nasipuri","doi":"10.1109/ICACCI.2016.7732184","DOIUrl":"https://doi.org/10.1109/ICACCI.2016.7732184","url":null,"abstract":"Contour detection forms one of the primitive, yet inherent operations of computer vision systems. Owing to the significance of this fundamental task, a number of approaches have been proposed till date. This paper characterizes the functionality of a multi-scale feature-based edge detection strategy that exploits joint information from different feature-channels, modelled over a measure of spacial dispersion associated with structured discontinuities in an image. The issue of eliminating false edges is achieved by incorporating an iterative clustering procedure that divides the image into disjoint groups of perceptually semantic regions by constructing naturally adaptive region borders, thereby recovering precise object boundaries. From the experiments conducted on the BSDS300 dataset, it appears that the proposed detector achieves noteworthy performance by attaining promising detection results when compared to the state-of-the-art edge detection approaches.","PeriodicalId":371328,"journal":{"name":"2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114984973","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 FSM based methodology for interleaved and concurrent activity recognition","authors":"J. Kavya, M. Geetha","doi":"10.1109/ICACCI.2016.7732174","DOIUrl":"https://doi.org/10.1109/ICACCI.2016.7732174","url":null,"abstract":"Research on human activity recognition is one of the most promising research topic and is attracted attention towards a number of disciplines and application domains. Successful research has so far focused on recognizing sequential human activities. In real life people are performing actions not only in sequential but also in complex (concurrent or interleaved) manner. Recognizing complex activities remains a challenging and active area of research. Due to a high degree of freedom of human activities, it is difficult to have a model which can deal with interleaved and concurrent activities. We propose a method that uses automatically constructed finite state automata, stack and queue data structures for recognizing concurrent and interleaved activities.","PeriodicalId":371328,"journal":{"name":"2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115149096","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":"DEPTA: An efficient technique for web data extraction and alignment","authors":"Arati Manjaramkar, Rahul L Lokhande","doi":"10.1109/ICACCI.2016.7732397","DOIUrl":"https://doi.org/10.1109/ICACCI.2016.7732397","url":null,"abstract":"Many web databases contains the data in the form of structured, semi structured and in unstructured format. This paper studies the issue of extracting these data records from online web database. The main motto of this paper is to recognize the data region which contains the data records, divide these data records, mine the data value from them and keep these extracted record in a structured format. This arrangement of extracted data is useful for many application like knowledge discovery purpose etc. Existing system has some data records arrangement problem which does not arrange dynamically generated web data properly. The proposed system is based on identification of data records, extraction of data values and arranging these data values in a database. The proposed system uses the partial tree alignment method for giving the better alignment outcome.","PeriodicalId":371328,"journal":{"name":"2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115369716","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":"Automated classification of security requirements","authors":"Rajni Jindal, R. Malhotra, Abha Jain","doi":"10.1109/ICACCI.2016.7732349","DOIUrl":"https://doi.org/10.1109/ICACCI.2016.7732349","url":null,"abstract":"Requirement engineers are not able to elicit and analyze the security requirements clearly, that are essential for the development of secure and reliable software. Proper identification of security requirements present in the Software Requirement Specification (SRS) document has been a problem being faced by the developers. As a result, they are not able to deliver the software free from threats and vulnerabilities. Thus, in this paper, we intend to mine the descriptions of security requirements present in the SRS document and thereafter develop the classification models. The security-based descriptions are analyzed using text mining techniques and are then classified into four types of security requirements viz. authentication-authorization, access control, cryptography-encryption and data integrity using J48 decision tree method. Corresponding to each type of security requirement, a prediction model has been developed. The effectiveness of the prediction models is evaluated against requirement specifications collected from 15 projects which have been developed by MS students at DePaul University. The result analysis indicated that all the four models have performed very well in predicting their respective type of security requirements.","PeriodicalId":371328,"journal":{"name":"2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116668121","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":"A novel K-means based clustering algorithm for big data","authors":"Ankita Sinha, P. K. Jana","doi":"10.1109/ICACCI.2016.7732323","DOIUrl":"https://doi.org/10.1109/ICACCI.2016.7732323","url":null,"abstract":"Data generation has seen tremendous growth in the past decade. Managing such huge amount of data is a big challenge. Clustering can serve as a solution, it divides the data into smaller groups based on the level of similarity among the objects. K-Means is one of the most popular and robust clustering algorithm. However, the major drawback of K-Means is to input the number of clusters which is not known in advance particularly for real world data sets. In this paper, we propose a K-Means based clustering algorithm for big data in which we automate the number of clusters to deal with big data. The algorithm is implemented using Spark, a better programming framework than the MapReduce. The proposed algorithm is simulated extensively with large scale synthetic data set as well as real life data on a 4 node cluster. The simulated results demonstrate better performance of the proposed algorithm over the scalable K-Means++ implemented in MLLIB library of Spark.","PeriodicalId":371328,"journal":{"name":"2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116892797","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":"A synthesis approach for ESOP-based reversible circuit","authors":"Chandan Bandyopadhyay, Shalini Parekh, H. Rahaman","doi":"10.1109/ICACCI.2016.7732299","DOIUrl":"https://doi.org/10.1109/ICACCI.2016.7732299","url":null,"abstract":"In recent years, the design of reversible quantum circuits have received immense priorities in the nano scale industry and chip level implementation of such circuits is under investigation. Hence, the efficient synthesis scheme for reversible quantum circuits has gained significant challenges among the research community. In this work, we propose a reversible circuit synthesis scheme that finds best neighbor in the multiple output functions to share its own functional data with that neighbor and design improved circuits. This approach is basically suited for reversible circuits based on ESOP representation. We successfully tested our approach for large functions and significant improvement is achieved. Comparative analysis with related works is presented to validate the proposed scheme.","PeriodicalId":371328,"journal":{"name":"2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121058543","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}