{"title":"Identification of causal relationships among clinical variables for cancer diagnosis using multi-tenancy","authors":"M. K. Sai, Gopala Krishna, Sanjay Singh","doi":"10.1109/ICACCI.2016.7732262","DOIUrl":"https://doi.org/10.1109/ICACCI.2016.7732262","url":null,"abstract":"Cancer causing more deaths than AIDS, tuberculosis and malaria combined. Especially breast cancer killing more than 40,000 women and 440 men every year in U.S.A. Over many years various data mining studies have tried to predict the cancer. There are only few studies on finding causal relationship among clinical variables causing cancer. They also provide theoretical guidance for cancer diagnosis and treatment. As there are many classifiers, learners and techniques to find causal relationships, it is very difficult to find attributes with very strong positive relation that are causing cancer. In this paper, we have applied Multi-Tenancy strategy based on logical databases, where whole database is divided into four tenants and proposed a graphical structure of key-dependency attributes which are causing cancer. We have used Pearson Product Moment Correlation Coefficient (PPMCC) to measure the strength of linear relationship between attributes and kappa analysis for finding the efficiency of each tenant. The tenant with highest kappa measure is treated as more efficient tenant. The proposed algorithm applies searching algorithm on conditional mutual information matrix to identify attributes which are dependent. This method represents relationships between attributes by using directed acyclic graph. Thus instead of finding general relationships, it is very useful to find very strong positive relationships which improves the accuracy in diagnosing cancer causing attributes.","PeriodicalId":371328,"journal":{"name":"2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","volume":"4 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":"123909015","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 adaptive distributed approach of a self organizing map model for document clustering using ring topology","authors":"M. Ajeissh, Sandhya Harikumar","doi":"10.1109/ICACCI.2016.7732140","DOIUrl":"https://doi.org/10.1109/ICACCI.2016.7732140","url":null,"abstract":"Document clustering aims at grouping the documents that are coherent internally with substantial difference amongst different groups. Due to huge availability of documents, the clustering face scalability and accuracy issues. Moreover, there is a dearth for a tool that performs clustering of such voluminous data efficiently. Conventional models focus either on fully centralized or fully distributed approach for document clustering. Hence, this paper proposes a novel approach to perform document clustering by modifying the conventional Self Organizing Map (SOM). The contribution of this work is threefold. The first is a distributed approach to pre-process the documents; the second being an adaptive bottom-up approach towards document clustering and the third being a neighbourhood model suitable for Ring Topology for document clustering. Experimentation on real datasets and comparison with traditional SOM show the efficacy of the proposed approach.","PeriodicalId":371328,"journal":{"name":"2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","volume":"8 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":"123952211","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}
Amit Hanamakkanavar, Vidya S. Handur, Venkatesh Kareti, Priti Ranadive
{"title":"Power aware scheduling on real-time multi-core systems","authors":"Amit Hanamakkanavar, Vidya S. Handur, Venkatesh Kareti, Priti Ranadive","doi":"10.1109/ICACCI.2016.7732454","DOIUrl":"https://doi.org/10.1109/ICACCI.2016.7732454","url":null,"abstract":"Multi-core systems are being used in many real-time systems for fast computation and with increasing complexity of real-time systems, effective management of power is becoming a challenge. To address this challenge, scheduling strategy becomes an important factor to utilize power efficiently. This paper proposes a new priority (NP) calculation for task scheduling based on task parameters such as user priority, duration, deadline and slack. Considering multi-core system with each core assigned to different frequencies, two scheduling algorithms are proposed: Slowest Cores Available (SCA) and Fastest Cores Available (FCA). Algorithms are analyzed in terms of execution time, idle time, power consumption and processor utilization.","PeriodicalId":371328,"journal":{"name":"2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","volume":"150 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":"126168465","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}
P. K. Dalela, Arun Yadav, Smriti Sachdev, Anurag Yadav, Saurabh Basu, V. Tyagi
{"title":"Alarm notification to tower monitoring system in oneM2M based IoT networks","authors":"P. K. Dalela, Arun Yadav, Smriti Sachdev, Anurag Yadav, Saurabh Basu, V. Tyagi","doi":"10.1109/ICACCI.2016.7732416","DOIUrl":"https://doi.org/10.1109/ICACCI.2016.7732416","url":null,"abstract":"Internet of Things (IoT) is a new paradigm of connected devices. IoT architecture ensures that devices are connected to each other and able to communicate as and when required. Centre for the Development of Telematics (C-DoT) developed Tower Monitoring Solution (TMS) [1] which monitors status of different sources of power in Telecom Towers. Standard oneM2M is one of the standards of IoT that defines the architecture of connected devices. TMS is now being updated according to oneM2M standard since C-DoT is part of Telecommunications Standards Development Society, India (TSDSI) which is involved in development of oneM2M standard. Under this new architecture, bidirectional connection is required to send data and alarm notification from centralized server/gateway to TMS devices. However, in GSM-GPRS SIM based devices, IP address of the device changes every time they are connected to the network, so the server is not aware of the current device IP address and cannot send data to the device. Also, in our oneM2M network, devices of different capabilities are connected, so a single approach does not work for all the devices. In this paper we have discussed about different methods which can be used by GSM-GPRS devices & devices of different capabilities to establish two way communication with centralized server. In this paper we have proposed an algorithm based solution for this challenge. This is innovative algorithmic solution that enables low cost devices to be operated centrally eliminating the need to replace those devices with high end devices.","PeriodicalId":371328,"journal":{"name":"2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","volume":"51 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":"126175667","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":"Feasibility assessment of neural network based expert system prototype for evaluating motivational strategies","authors":"Viral Nagori, Bhushan Trivedi","doi":"10.1109/ICACCI.2016.7732319","DOIUrl":"https://doi.org/10.1109/ICACCI.2016.7732319","url":null,"abstract":"The main objective of the study is to check the feasibility of design and implementation of neural network based expert system for evaluating motivational strategies from employees' perspectives on ICT human resource. If feasibility exists, then the secondary objective of the study is to provide a proof of concept that such full-fledged development of an expert system can be carried out with desired results. The reason to do the study is that very few expert systems are built for HR domain and there is no existing expert system we came across for the domain we are targeting. To check the operation feasibility, we initially implemented the prototype with C++. After the initial success of prototype, we decided to switch over to MATLAB to provide a proof of concept. The reasons for switching over to MATLAB from C++ are mentioned in the paper. We used back propagation algorithm to implement neural network based expert system. We provided comparison of the results for prototype implemented in C++ and MATLAB. Based on the comparison, we decided to develop and implement the full-fledged prototype of our neural network based expert system in MATLAB. We have been able to successfully implement the prototype in two different computer languages. This proves that there exists operational and technical feasibility for the development of neural network based expert system prototype. The proposed prototype showcase that the approach we choose can help HR managers to determine right set of employees centric motivational strategies and may help them to reduce attrition rate.","PeriodicalId":371328,"journal":{"name":"2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","volume":"145 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":"129768465","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}
N. Dutta, Z. Pólkowski, C. Savulescu, Sunil Pathak
{"title":"An approach to signaling cost reduction in Proxy MIPv6 for mobility management","authors":"N. Dutta, Z. Pólkowski, C. Savulescu, Sunil Pathak","doi":"10.1109/ICACCI.2016.7732285","DOIUrl":"https://doi.org/10.1109/ICACCI.2016.7732285","url":null,"abstract":"Proxy Mobile IPv6 (PMIPv6)is gaining popularity asa Network based mobility management scheme in the recent years. It manages mobility of nodes through Local Mobility Anchor(LMA) that works in co-operation with Mobile Anchor Gateways (MAGs). The original PMIPv6 suggests to collocate MAG with Access Router (AR) in the PMIPv6 architecture. However, this architecture leads to generation of large signaling cost for mobility management. Because, for movement of mobile host (MH) (or mobile node (MN)) even to nearby cells mobility management signals need to traverse to LMA. In this paper, we propose an enhancement to PMIPv6 by re-arranging AR and MAG and allowing single MAG to cover multiple ARs. Further, the protocol tunnels leftover packet of MH directlyfrom old to new MAGA to reduce packet delivery cost. A mathematical analysis is carried out to realize the benefits of the proposed scheme. We analyze signaling cost of the proposed model and compare with PMIPv6 basic version and Dynamic Mobility Anchoring (DMA) scheme. The impact of few input parameters on the signaling cost are investigated. The result reveals that proposed scheme outperforms both PMIPv6 basic and DMA.","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":"129798863","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":"Effective web personalization system based on time and semantic relatedness","authors":"G. Sajeev, P. Ramya","doi":"10.1109/ICACCI.2016.7732242","DOIUrl":"https://doi.org/10.1109/ICACCI.2016.7732242","url":null,"abstract":"The key aspect in building a Web personalization system is the user's navigational pattern. However, the navigational pattern alone is insufficient to capture the user's interest and behavior. This paper proposes a novel web personalization system that accepts the timing information, semantic information along with the navigational pattern, and classifies the users according their interest and behavior on the site. The proposed model is validated by constructing a Web personalization model using the real and synthetic data and the results are promising.","PeriodicalId":371328,"journal":{"name":"2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","volume":"39 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":"129905984","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}
Aishwarya Palaiah, Akshata Prabhu, Reetika Agrawal, S. Natarajan
{"title":"Clustering using Cuckoo search levy flight","authors":"Aishwarya Palaiah, Akshata Prabhu, Reetika Agrawal, S. Natarajan","doi":"10.1109/ICACCI.2016.7732106","DOIUrl":"https://doi.org/10.1109/ICACCI.2016.7732106","url":null,"abstract":"Clustering of Web document has become a vital task, due to the tremendous amount of information that is available on web today. The task of finding suitable information with less time has become a big challenge in information retrieval. So, it's very much necessary to adopt a method that can be used organize the information well. This is possible only when good document groups are formed, which in turn can be achieved when effective and optimized cluster heads are identified. Our concern is to apply an algorithm for web document clustering. The algorithm proposed in this paper is, Cuckoo Search based on Levy Flight. Efficient cluster heads can be located using proposed Cuckoo Search algorithm. And Levy Flight helps us to speed up the local search which also ensures that it covers output domain efficiently. This algorithm is simple, efficient and it is easy to implement. A relative study of the proposed Cuckoo Search based on Levy Flight and K-means algorithm is carried out. The obtained result shows that good performance can be achieved when Cuckoo Search based on Levy Flight algorithm is used for clustering of web documents.","PeriodicalId":371328,"journal":{"name":"2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","volume":"9 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":"128564223","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":"LAWI: A load balanced architecture for wireless network on chip","authors":"P. Mitra","doi":"10.1109/ICACCI.2016.7732071","DOIUrl":"https://doi.org/10.1109/ICACCI.2016.7732071","url":null,"abstract":"The advancement in the designing of multicores system-on-chip pose the requirement of communication infrastructure which provides target performance to meet the computation requirement of gigascale processors. Thus a promising solution called LAWI, a Load balanced Architecture for Wireless Network on chip, has been proposed to bridge the widening gap between the communication efficiency and computation requirements of gigascale system-on-chip devices. It comprise of intelligent router that balances the traffic load across long distance transmission and reduces the congestion delay. An efficient low-cost deadlock-free routing scheme LAWIXY has been proposed that reduces the network congestion and hence improves performance of wireless network on chip. It is demonstrated that LAWI outperforms its counterpart network architectures and improves performance for larger system size.","PeriodicalId":371328,"journal":{"name":"2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","volume":"117 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":"127111803","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":"Challenge-response generation using RO-PUF with reduced hardware","authors":"Abhishek Kumar, R. Mishra, K. R. Kashwan","doi":"10.1109/ICACCI.2016.7732227","DOIUrl":"https://doi.org/10.1109/ICACCI.2016.7732227","url":null,"abstract":"Cryptography looks forward to generate secrete key from integrated circuit. A silicon based device having uncontrollable feature in term of measurable output can turned into physically unclonable function (PUF). Multiplexer based PUF works on unpredictable delay difference between two parallel paths, while Ring oscillator based PUF works on frequency deviation generated due to random variation of CMOS fabrication process. Hardware based intrinsic features must include to generate a random response which fuzzified to generate a reliable secret key. Our design incorporates PUF based on circuit variation instead of process variation, PISO shift register reduce the hardware compared to existing RO-OUF. A 4-bit challenge generates 16-bit random response with measured reliability in term of intra hamming distance approx to mid value.","PeriodicalId":371328,"journal":{"name":"2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","volume":"67 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":"127259815","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}