{"title":"Harnessing healthcare data security in cloud","authors":"R. Aiswarya, R. Divya, D. Sangeetha, V. Vaidehi","doi":"10.1109/ICRTIT.2013.6844251","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844251","url":null,"abstract":"Healthcare sector has a large volume of information like health records of patients that needs to be collected and stored. These Patient Health Records when equipped digitally become Electronic Health Records (EHRs). This large amount of data collected as EHRs has to be stored, processed and updated frequently. Also the data of the patients has to be available whenever and wherever necessary. Cloud provides the necessary infrastructure now-a-days at low cost and better quality. Cloud computing when used in Healthcare sector lowers the cost of storing, processing and updating with improved quality. But the security of data in the cloud is of concern today. The electronic health records consist of images of patients which are of high security concern. The EHRs include the patient scan images, x-rays etc. which are the patient's private data. Providing security for a large volume of data with efficiency is required. In this paper we present a novel mechanism by which the EHR images are secured efficiently and the privacy of the patient's data is preserved. Since the most confidential data of the patients are in the form of images, more care must be taken to secure the images. This is done by reducing the images into pixels and then encrypting the pixels using Paillier Cryptosystem. After the encryption it is stored in the cloud. The original data can be decrypted from the cloud with the private key. The key can be made available to the physicians and other specialists as required by the hospital.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"177 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124380036","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":"FuzzifiedPSO and K-Harmonic means algorithm for electrical data clustering","authors":"A. Rani, Latha Parthipan","doi":"10.1109/ICRTIT.2013.6844261","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844261","url":null,"abstract":"This paper proposed Fuzzified Particle Swarm Optimization and K-Harmonic Means algorithm (FPSO+KHM) for clustering the Electrical data systems. Thepartitioned clustering algorithms are more suitable for clustering large datasets. The K-Harmonic means algorithm is center based clustering algorithm and very insensitive to the selection of initial partition usingbuilt in boost function, but easily convergence in local optima. The proposed algorithm uses Fuzzified PSO and K-harmonic means algorithm to generate more accurate, robust, better clustering results, best solution in few number of iterations, avoid trapping in local optima and get faster convergence when compare to K-Harmonic Meansand hybrid PSO+ K-Harmonic Means algorithms. This algorithm is applied for two different set of IEEE bus electrical data systems.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121472981","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}
R. Thirukural, M. Pradeep, K. Sengottuvel, P. Bhuvaneswari
{"title":"Remote access of home appliances using Humanoid robot","authors":"R. Thirukural, M. Pradeep, K. Sengottuvel, P. Bhuvaneswari","doi":"10.1109/ICRTIT.2013.6844287","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844287","url":null,"abstract":"This paper demonstrates a novel method which enable client to control their home appliances and systems from remote using a Humanoid robot named Nao. The novelty involved in the proposed method is the usage of Humanoid. With the advent of human-like information processing in humanoid, when compared to other existing technologies, reliability in task execution is ensured. This paper present the results of controlling television remotely using Infra-Red sensors embedded in Nao. The televisions that are non-compatible with the IR sensors of Nao are controlled using their remote controllers by making Nao identify the correct remote and operate it with pre-defined limb movements. Thus by integrating the concepts of image processing and behavioral simulation, we intend to create a smart home assistant.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121479209","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":"Partial image encryption for smart camera","authors":"S. Naveenkumar, H. Panduranga, Kiran","doi":"10.1109/ICRTIT.2013.6844192","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844192","url":null,"abstract":"Smartness of camera can be increased by adding extra feature to it. Selective encryption employs portion of original image in encryption process, but there is no control over amount of encryption. Novelty of this proposed two-stage Hill cipher method includes selection of square blocks to manipulate self invertible matrix. Which leads to control the amount of encryption with step size of 12.5% with respect to number of pixel changing rate (NPCR). This paper describes the lossless partial image encryption in two ways. First method uses two-stage Hill cipher to produce partially encrypted image. Here Latin Square Image Cipher technique is used to generate basic block of self invertible matrix which is used in hill cipher. Second method uses four stage Hill cipher (Two two-stage Hill cipher) to produce partially encrypted image. Decryption follows the reverse process of encryption. The analysis and experimental results show that the proposed scheme can achieve the concept of partial encryption.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123612705","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":"Failure-aware scheduling in grid considering Weibull failure distribution","authors":"Manjeet Singh, R. Garg","doi":"10.1109/ICRTIT.2013.6844183","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844183","url":null,"abstract":"In Grid computing environment, as the resources are more heterogeneous, geographically distributed, complex and owned by different organizations, they are more prone to failures. Application scheduling in such a environment is very crucial. Generally, during application/job scheduling only performance factor of resources are considered. But if a node with high computational power also have high failure rate, then there is no such benefit of allocating task to that node because every time a failure occurs it needs recovery and in turn costs in term of time. Thus, failure increases make-span for the job and decreases system/node performance. A node with comparatively lower computational capacity and lower failure rate may give better performance and reduced make-span. So it would be a great idea if we take into consideration failure rate and computational capacity of resources during scheduling. In this paper we have proposed an approach for scheduling the tasks. We recalculate the computational capacity of resources by finding the expected wasted time due to presence of failure and then the tasks are scheduled according to this new computational capacity. Here the failure of nodes is treated as to follow Weibull distribution.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129556807","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 AI controller for Infinite Mario Bros using evolution strategy","authors":"S. Pandian","doi":"10.1109/ICRTIT.2013.6844289","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844289","url":null,"abstract":"The Mario AI Benchmark software based on Infinite Mario Bros which is in turn, a public domain clone of Nintendo's classic platform game Super Mario Bros. Competitions that have been held during 2009 and 2010 based on successive versions of the Mario AI Benchmark have received considerable attention and reasonable submissions. A rule based reactive controller trained using [μ+λ] evolutionary strategy has been developed within the rule set of the Mario AI competition using the Mario AI Benchmark. The controller developed is then compared to rule based controllers that have not gone through evolutionary process and thus find that evolution alongside heuristics is able to increase the chances of success in this platform games environment. The learning curve of the controller is steep but learning quickly still surpasses the basic rule-based and hardcoded controllers.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129676951","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 collaborative tagging system with formal concept analysis","authors":"Sanjana Babu, V. Gowtham, L. Sophia, P. Pabitha","doi":"10.1109/ICRTIT.2013.6844171","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844171","url":null,"abstract":"Tags can be used to annotate resources on the web. This enables users to share or browse the resources or retrieve them in future. Collaborative Tagging systems or folksonomies have the potential to become an integral part of Web 2.0. Formal Concept Analysis (FCA) is a powerful tool commonly used in Artificial Intelligence, Data Mining and with the Semantic Web. FCA has been used in online document and resource management systems. In this case the resources are treated as objects and tags as attributes. FCA groups these resources hierarchically in a lattice structure thereby providing multiple dimensions to information retrieval. Objects are grouped with a set of attributes common to all of them. These groups are called concepts and are the building blocks of FCA lattices. A system is discussed that models objects and their tags with Formal Concept Analysis. A user's query for objects with certain attributes can be mapped to a particular concept. The objects of this concept can be returned as results. Further related and relevant results can be provided by finding the concepts most similar to the result concept and returning their objects to the user as well. Thus, an information retrieval system can be implemented. Further automation can be investigated with machine learning or artificial intelligence techniques.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124874274","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 survey on XML security","authors":"A. El-Aziz, A. Kannan","doi":"10.1109/ICRTIT.2013.6844275","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844275","url":null,"abstract":"In this paper, we present a survey of the state of the art in XML XML security. This survey will support the future research and development work as well as to raise the awareness for the presented approaches. In this survey, we present the different articles that describe the XML security standards specifically XML encryption, XML signature, and XACML, and we introduce the different approaches for access control for XML documents. This survey will support the future research and development work as well as to raise the awareness for the presented approaches.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"43 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120909186","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":"Comparison of variance based fusion and a model of centralised Kalman filter in target tracking","authors":"Deepa Elizabeth George, Senthil C. Singh","doi":"10.1109/ICRTIT.2013.6844208","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844208","url":null,"abstract":"Multi sensor target tracking is well known to have advantages over single sensor target tracking in many applications. Observational data from sensors, may be fused at different levels, ranging from the raw data level to feature level, or at decision level. This paper presents an experimental comparison of an averaging model of Kalman filter fusion and variance based fusion in estimating the position of a moving target. The target is assumed to follow a uniform velocity model. The performance of the two fusion techniques have been experimented in detail for various cases of noise variances and initial estimate of target's position. The sensors are assumed to be sensor suites, having autonomy and sufficient computational power. Accordingly, the variances of state estimate are assumed to be available from an EKF, where one EKF is running independently for each sensor suites. The mean square error in estimation for both techniques have been simulated in matlab and compared.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126527303","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":"Dynamic complex event processing — Adaptive rule engine","authors":"R. Bhargavi, Ravi Pathak, V. Vaidehi","doi":"10.1109/ICRTIT.2013.6844203","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844203","url":null,"abstract":"Recently Complex Event Processing has emerged as a lightweight way to monitor multiple data streams to identify events or patterns of interest. Complex Event Processing is a rule based technology. Rules which represent the patterns of interest are defined by domain experts. Existing CEP engines have limitation on addition, deletion and modification of rules. Rules are configured initially once and are not changed later. Some of the engines support initial configuration and occasionally support addition of rules at runtime using the polling mechanism. This paper proposes a dynamic CEP by making the rule engine adaptive by using Event driven or push based approach for updating the rules dynamically in the Complex Event Processing System at runtime. Event driven approach facilitates Knowledgebase to update rules without polling or observing any resource and hence enhances the system performance. The resulting CEP engine with dynamic infrastructure facilitates easy addition and deletion of the rules in an easy and efficient way.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122276830","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}