{"title":"Exploring concept of QR code and its benefits in digital education system","authors":"Saroj Goyal, Surendra Yadav, M. Mathuria","doi":"10.1109/ICACCI.2016.7732198","DOIUrl":"https://doi.org/10.1109/ICACCI.2016.7732198","url":null,"abstract":"This research paper concentrates on the concept of Digital Authentication using QR Code in Digital Education System. This paper aimed to provide a better solution to the Digital Security. There are two challenges of the work i.e. first one is to explore the usability of QR Code in general life and second is to incorporate QR Code technology with an educational document for security to avoid duplicity. The literature review is done to synthesis digital encoding and decoding technique as well as basics of Bar Code and QR Code. The implementation of QRC (Quick Response Code) for verification is presented where web environment, programming logics, and URL embedding are discussed. The result analysis and testing of experiment are done in the sense to get best quality of QR Code though the information embedded should not affected and the QR Code must easily be decoded the embedded information from common tools. The goal of this research paper is to explore and analyze the best image under the testing of Error Correction Level and Matrix Point Size parameters by calculating the PSNR and MSE values for QR Code images with different image file format (PNG and JPG). The calculated values are compared and the final conclusion of the work found which state that the PNG image with Error Correction Level-L and Matrix Point Size 1 are the best to generate quality QR Code. The testing and result are presented which state that the QR Code is the best way to compose the identical information of any entity to quickly figure out the originality.","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":"127527592","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":"Checkpoint based multi-version concurrency control mechanism for remote healthcare system","authors":"Ammlan Ghosh, R. Chaki, N. Chaki","doi":"10.1109/ICACCI.2016.7732076","DOIUrl":"https://doi.org/10.1109/ICACCI.2016.7732076","url":null,"abstract":"This paper addresses the synchronization aspect for multiple concurrent threads in a Remote Healthcare System (RHS) under development. Resources like data files are shared by multiple stakeholders and users including doctors, trained paramedic staff, patient party or even Government agencies collecting statistical and demographic data. In the system under trial, medical kiosks are setup at distant places where patients visit and their complaints are recorded by trained caregivers. Later, doctor accesses such data from the system, makes a diagnosis and suggests prescriptions accordingly. In such a set-up, it is quite often that more than one users access the same shared resource simultaneously. In conventional lock-based process synchronization, such concurrent processes are blocked by the process holding a lock over the files. The major contribution of this paper is to use checkpoint-based multi-versioning Software Transactional Memory for our application domain to achieve non-blocking process synchronization. With help of multi-versioning technique the proposed method is also able to reduce number of expensive remote validations as well as transactional aborts. Experimental verification finds that proposed method yields higher throughput in comparison to clairvoyant type multi-version concurrency control mechanism.","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":"130059410","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":"DoS attack detection technique using back propagation neural network","authors":"Monika Khandelwal, D. Gupta, Pradeepkumar Bhale","doi":"10.1109/ICACCI.2016.7732185","DOIUrl":"https://doi.org/10.1109/ICACCI.2016.7732185","url":null,"abstract":"Denial of Service attack is an endeavor to make a gadget or framework resources occupied to its proposed clients. DoS attack expends casualty's framework assets, for example, data transfer capacity, memory, CPU by sending gigantic number of fake requests so that the intended user cannot obtain services and denial of service happens. This paper presents an intelligent technique for the detection of denial of service attack. This technique can easily detect DoS attack by using back-propagation neural network (BPNN). The parameters used in this technique are CPU usage, frame length and flow rate. In this technique, analysis of server assets and network traffic for training and testing the ability of detection method and the results shows that the proposed method can detect DoS attack with 96.2% accuracy.","PeriodicalId":371328,"journal":{"name":"2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","volume":"20 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":"130207204","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":"Removal of random-valued impulse noise using detection filters and group sparse modeling","authors":"D. Velayudhan, S. Paul","doi":"10.1109/ICACCI.2016.7732314","DOIUrl":"https://doi.org/10.1109/ICACCI.2016.7732314","url":null,"abstract":"High quality noise-free images constitute an integral part of all image processing applications. Image acquisition and transmission stages often result in corruption of images with impulse noise, which is of two main types: salt-and-pepper noise and random-valued noise. Among the two types, random-valued noise is the most difficult to be removed due to its randomness and this problem is addressed in the paper. The proposed method for random-valued impulse noise removal takes advantage of two important properties of images - local sparsity and non-local self-similarity. The technique for random-valued impulse noise removal has two stages. The first stage called Impulse Detection stage identifies the outlier candidates affected by impulse noise. The second stage called Inpainting-based Reconstruction stage reconstructs the image from the unaffected partial random samples. A robust split Bregman iterative algorithm is used to solve the optimization problem. Experimental results support the effectiveness of the algorithm.","PeriodicalId":371328,"journal":{"name":"2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","volume":"139 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":"123727416","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}
B. Pillai, M. Mounika, P. J. Rao, Padmamala Sriram
{"title":"Image steganography method using K-means clustering and encryption techniques","authors":"B. Pillai, M. Mounika, P. J. Rao, Padmamala Sriram","doi":"10.1109/ICACCI.2016.7732209","DOIUrl":"https://doi.org/10.1109/ICACCI.2016.7732209","url":null,"abstract":"Steganography involves hiding of text, image or any sensitive information inside another image, video or audio in such a way that an attacker will not be able to detect its presence. Steganography is, many times, confused with cryptography as both the techniques are used to secure information. The difference lies in the fact that steganography hides the data so that nothing appears out of ordinary while cryptography encrypts the text, making it difficult for an outsider to infer anything from it even if they do attain the encrypted text. Both of them are combined to increase the security against various malicious attacks. Image Steganography uses an image as the cover media to hide the secret message. In this paper, we propose an image steganography method which clusters the image into various segments and hides data in each of the segment. Various clustering algorithms can be used for image segmentation. Segmentation involves huge set of data in the form of pixels, where each pixel further has three components namely red, green and blue. K-means clustering technique is used to get accurate results. Therefore, we use K-means clustering technique to get accurate results in a small time period.","PeriodicalId":371328,"journal":{"name":"2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","volume":"38 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":"130985305","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":"Lbest Gbest Artificial Bee Colony algorithm","authors":"Harish Sharma, Sonal Sharma, Sandeep Kumar","doi":"10.1109/ICACCI.2016.7732158","DOIUrl":"https://doi.org/10.1109/ICACCI.2016.7732158","url":null,"abstract":"Artificial Bee Colony (ABC) algorithm is the most popular add-on to class of swarm intelligence based meta-heuristic which is evolved to resolve the complex real world optimization problems. Most of the swarm intelligence based algorithms face the problem of stagnation, and premature convergence and ABC is not an exception. To reduce the chance of these problems as well as to control equilibrium between intensification and diversification capabilities of ABC, a unique variant of ABC is intended. In this intended variant, the employed bee stage, as well as onlooker bee stage of ABC algorithm is modified by taking inspiration from a local best candidate as well as the global best candidate. The intended ABC variant is named as Lbest Gbest ABC (LGABC) algorithm. The accuracy and efficiency of LGABC have examined over 12 benchmark functions and evaluated with the basic ABC, best so far ABC, Gbest ABC and Modified ABC and found that it may be an efficient contender in the field of swarm intelligence based algorithms.","PeriodicalId":371328,"journal":{"name":"2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","volume":"276 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":"132980515","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":"Compute-intensive workflow scheduling in multi-cloud environment","authors":"Indrajeet Gupta, M. Kumar, P. K. Jana","doi":"10.1109/ICACCI.2016.7732066","DOIUrl":"https://doi.org/10.1109/ICACCI.2016.7732066","url":null,"abstract":"Workflow scheduling is recognized as well-known NP-complete problem in the perspective of cloud computing environment. Workflow applications always need high compute-intensive operations because of the presence of precedence-constrains. The scheduling objective is to map the workflow application to the VMs pool at available cloud datacenters such that the overall processing time (makespan) is to be minimized and average cloud utilization is maximized. In this paper, we propose a two phase workflow scheduling algorithm with a new priority scheme. It considers the ratio of average communication cost to the average computation cost of the task node as a part of prioritization process in the first phase. Prioritized tasks are mapped to suitable virtual machines in the second phase. Proposed algorithm is capable of scheduling large size workflows in heterogeneous multi-cloud environment. The proposed algorithm is simulated rigorously on standard scientific workflows and simulated results are compared with the existing dependent task scheduling algorithms as per the assumed cloud model. The results remarkably show that the proposed algorithm supercedes the existing algorithms in terms of makespan, speed-up, schedule length ratio and average cloud utilization.","PeriodicalId":371328,"journal":{"name":"2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","volume":"53 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":"132038842","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":"Interference-fault free transmission schedule in tree-structured WSN","authors":"B. A. Begum, S. V. Nandury","doi":"10.1109/ICACCI.2016.7732069","DOIUrl":"https://doi.org/10.1109/ICACCI.2016.7732069","url":null,"abstract":"Interference due to concurrent link transmissions has for long been recognized as a major cause for issues like packet retransmissions, distorted signal strength and communication link failures in WSN. The two best known approaches to model interference, namely the Protocol Interference (PrI) and Physical Interference models, fail to identify all Potential Interferers (PIs) to a given link. Therefore, the two models have limited utility in determining an Interference-Fault Free Transmission (IFFT) schedule for all active links in the network. This leads to serious repercussions, especially in tree-structured WSNs, where data aggregation is hierarchical. In a pioneering work done earlier, we have developed Composite Interference Mapping (CIM) model, which succeeds in identifying the PIs of all active links in a network. In this paper, we implement the CIM model to map PIs of all transmission links in a tree-structured WSN. We develop an IFFT-Tree algorithm to obtain an IFFT schedule for all links in an aggregation tree, and analytically prove that the algorithm is both optimal and complete. To support our analytical studies, we implement the IFFT-Tree algorithm and carry out extensive simulations to show that the algorithm minimizes the number of time slots required to schedule all active links. We introduce three new performance metrics to study the performance of IFFT-Tree algorithm, and to compare the efficacy of the CIM model with PrI model. The results of the simulations prove that the PrI model identifies only a small subset of total PIs identified by the CIM model. This finding highlights the threat to the credibility of data being aggregated along the tree, if interference-faults arising due to PIs which are not identified by the PrI model, proliferate into the tree-structured WSN.","PeriodicalId":371328,"journal":{"name":"2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","volume":"5 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":"131000996","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":"Online reviews: Determining the perceived quality of information","authors":"Gobinath J, Deepak Gupta","doi":"10.1109/ICACCI.2016.7732080","DOIUrl":"https://doi.org/10.1109/ICACCI.2016.7732080","url":null,"abstract":"The technology scape has undergone tremendous changes in the last couple of decades. With increased changes in technology a lot of changes have occurred in the way consumers behave. One major change area is in the way consumers gather information about the products to make purchase decisions. Online reviews have become the major source of information and have taken over many traditional sources that existed earlier. The quality of information obtained from any source plays a major role in the consumer decision making. In this study the factors that influence the consumer perception of information quality of online reviews are identified. For this purpose a conceptual model was developed by reviewing literature in the following areas, online reviews, electronic word of mouth, and information quality. The model was tested using a pan India survey. The sample size included 155 online consumer review readers in their product purchase to identify the impact of various factors on perceived quality of information. The data was analyzed using ordered logistic regression. This study identified that factors such as Perceived Informativeness, Perceived Persuasiveness, Source Credibility, and Attitude towards Online Reviews have significant positive impact on the consumer's perception of quality of information obtained from online reviews.","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":"130447223","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}
B. K. S. Prasad, A. Manjunath, Hariharan Ramasangu
{"title":"Multi-agent trajectory control under faulty leader: Energy-level based leader election under constant velocity","authors":"B. K. S. Prasad, A. Manjunath, Hariharan Ramasangu","doi":"10.1109/ICACCI.2016.7732370","DOIUrl":"https://doi.org/10.1109/ICACCI.2016.7732370","url":null,"abstract":"A multi-agent flocking control algorithm consisting of leader and agents moving at constant velocity with a method for leader election is proposed in this paper. Due to a faulty leader, connectivity lost between itself and the agents, leading to divergence from trajectory path. Hence, leader election algorithm is developed to replace a faulty leader, thereby regain control of the path of the agents. This leader election algorithm utilizes energy level of each agent. All agents and leader have a certain energy based on theoretical and measured control inputs. This energy represents the degree of deviation from desired path, hence, the agent with least utilised energy, will be elected leader.","PeriodicalId":371328,"journal":{"name":"2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","volume":"14 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":"131698413","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}