{"title":"Hybrid Particle Swarm Optimization scheduling for cloud computing","authors":"M. Sridhar, G. M. Babu","doi":"10.1109/IADCC.2015.7154892","DOIUrl":"https://doi.org/10.1109/IADCC.2015.7154892","url":null,"abstract":"Cloud computing is revolutionizing on how information technology is used by organizations and individuals. Cloud computing provides dynamic services with virtualized resources over the Internet. It ensures facilities to develop, deploy, and manage applications `on the cloud' for end users entailing resources virtualization that maintains and manages itself. Scheduling is a task performed to get maximum profit to increase cloud computing work load efficiency. Its objective is using resources properly and managing load between resources with minimum execution time. High communication cost incurs in clouds prevent task schedulers from being applied in a large scale distributed environment. This study proposes a hybrid Particle Swarm Optimization (PSO) which performs better in execution ratio and average schedule length.","PeriodicalId":123908,"journal":{"name":"2015 IEEE International Advance Computing Conference (IACC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129834968","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 an algorithm for online pulse discrimination in micro-EDM using current and voltage sensors and their comparison","authors":"C. K. Nirala, P. Saha","doi":"10.1109/IADCC.2015.7154758","DOIUrl":"https://doi.org/10.1109/IADCC.2015.7154758","url":null,"abstract":"Voltage pulse or current pulse can be used as the main monitoring parameter of the sparks that occur in micro electrical discharge machining (μEDM) process. The spark gap should be monitored for many purposes including study of material removal characteristics, which can be followed by tool wear monitoring and compensation. The system which fulfils the requirements of monitoring spark gap by using gap waveforms is called pulse discriminating (PD) system. The purpose of this research is to compare the capability of effective pulse discrimination using voltage and current pulses by online application of an algorithm written in LABVIEW separately. The comparison is based on the evaluation of the following responses - effective counting of total number of pulses and percentage of different kind of pulses that exist in μEDM.","PeriodicalId":123908,"journal":{"name":"2015 IEEE International Advance Computing Conference (IACC)","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129042994","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":"Detection of Red lesions in diabetic retinopathy affected fundus images","authors":"V. Mane, Ramish B. Kawadiwale, D. Jadhav","doi":"10.1109/IADCC.2015.7154668","DOIUrl":"https://doi.org/10.1109/IADCC.2015.7154668","url":null,"abstract":"Computer based automated system is one of the important diagnostic tools in medical field. Diabetic Retinopathy is an eye disorder in which red lesions due to blood leakages can be spotted on retinal surface. This disease is commonly observed in long term diabetic patients. Ignorance to this disease can result into permanent blindness. Early stage signs of diabetic retinopathy are called as Red lesions viz. microaneurysms and hemorrhages. This paper presents a unique methodology for automatic detection of red lesions in fundus images. Proposed methodology employs modified approach to matched filtering for extraction of retinal vasculature and detection of candidate lesions. Features of all candidate lesions are extracted and are used to train Support Vector Machine classifier. In turn support Vector Machine classifies input image object into lesion or non-lesion category. The method is tested on 89 fundus images from DIARETDB1 database. The proposed algorithm gives performance as sensitivity 96.42%, specificity 100% and accuracy 96.62%.","PeriodicalId":123908,"journal":{"name":"2015 IEEE International Advance Computing Conference (IACC)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125671499","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 network configuration and Virtual management protocol for open switch in cloud environment","authors":"P. Rekha, M. Dakshayini","doi":"10.1109/IADCC.2015.7154687","DOIUrl":"https://doi.org/10.1109/IADCC.2015.7154687","url":null,"abstract":"Cloud data center have to accommodate many users with isolated and independent networks in the distributed environment to support multi-tenant network and integrity. User applications are stored separately in virtual network. To support huge network traffic data center networks require software to change physically connected devices into virtual networks. Software defined networking is a new paradigm allows networks easily programmable that helps in controlling and managing virtual network devices. Flow decisions are made based upon real-time analysis of network consumption statistics with software defined networking. Managing these virtual networks is the real challenge for the network administrators. In this paper, we propose a novel network management approach between the controller and virtual switches and provide QoS of virtual LAN in the distributed cloud environment. This approach provides a protocol to deploy in Cloud Data center network environments using OpenFlow architecture in switches. Our approach delivers two different features, dynamic network configuration and Virtual management protocol between controller and open vswitch. This technique is very useful for cloud network administrators to provide better network services in cloud data center to multi-tenant users quickly.","PeriodicalId":123908,"journal":{"name":"2015 IEEE International Advance Computing Conference (IACC)","volume":"164 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131018095","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":"Exploiting Geo Distributed datacenters of a cloud for load balancing","authors":"J. Srinivas, A. Qyser, B.Eswara Reddy","doi":"10.1109/IADCC.2015.7154780","DOIUrl":"https://doi.org/10.1109/IADCC.2015.7154780","url":null,"abstract":"Cloud based services have become an integral part of our life. These services are based on infrastructure known as a data Center. As the demand for cloud based services increases the load on the data centers also increases and if this load is not properly managed the overall performance of the cloud degrades. This paper proposes a dynamic approach for load balancing a cloud that exploits the presence of datacenters globally. The proposed approach applies a strategy based on inter data center load migration. The approach illustrated in the paper tries to improve overall performance of the cloud by minimizing service delay.","PeriodicalId":123908,"journal":{"name":"2015 IEEE International Advance Computing Conference (IACC)","volume":"226 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127878795","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 way of ICON based authentication methods","authors":"P. Devaki, R. Rao","doi":"10.1109/IADCC.2015.7154748","DOIUrl":"https://doi.org/10.1109/IADCC.2015.7154748","url":null,"abstract":"Authentication is one of the important security aspects to secure the critical or sensitive information in a system. The authentication system must allow only the authorized users to access the critical information. So it must be strong enough to identify only the valid users and at the same time it should be user friendly. There are many authentication systems designed and used, but most commonly used authentication system is login-password. But this suffers with the attack called shoulder surfing, and brute force method of password guessing. The work carried out to explore the strengths of different graphical based password system to avoid the attack of shoulder surfing and enhance the security in terms of authentication. Also we have proposed a new graphical based authentication system.","PeriodicalId":123908,"journal":{"name":"2015 IEEE International Advance Computing Conference (IACC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125407514","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 multi-step recommendation engine for efficient indirect procurement","authors":"Subhashini Nandeesh, Rajkumar Mylvaganan, Sheela Siddappa","doi":"10.1109/IADCC.2015.7154734","DOIUrl":"https://doi.org/10.1109/IADCC.2015.7154734","url":null,"abstract":"The proliferation of data mining techniques is common across various corporate functions in an organization to discover deeper insights for making better decisions. One such opportunity emerges in the procurement function to streamline the process of procuring indirect materials. This paper proposes a two-step approach 1) adaption of association rule mining to derive the associated materials and 2) identification of right set of supplier(s) for the associated materials based on supplier selection methodology - Data Envelopment Analysis (DEA). The two step approach is used in the purchase requisition process, as a recommendation engine to assist the requester (user who request for materials) with a list of associated materials that can be requested together and also recommend the right supplier(s) for the associated materials. This significantly reduces the number of purchase requests (PR), and thus reduces the man hours in the procure-to-pay cycle and optimizes the supplier base. This is implemented on a sample dataset and a case study is provided for illustration.","PeriodicalId":123908,"journal":{"name":"2015 IEEE International Advance Computing Conference (IACC)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125552493","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}
Namratha B. Gowda, Reema Sharma, Navin Kumar, T. Srinivas
{"title":"Dynamic benefit-weighted scheduling scheme in multi service networks","authors":"Namratha B. Gowda, Reema Sharma, Navin Kumar, T. Srinivas","doi":"10.1109/IADCC.2015.7154745","DOIUrl":"https://doi.org/10.1109/IADCC.2015.7154745","url":null,"abstract":"This paper proposes a new dynamic packet scheduling scheme which guarantees the delay and jitter properties of differentiated services (DiffServ) network for both real time and non-real time traffics. The proposed dynamic packet scheduling algorithm uses a new weighted computation scheme known as dynamic benefit weighted scheduling (DB-WS) which is loosely based on weighted round robin (WRR) or fair queuing policy. The novelty of this scheduler is that it predicts the weight required by expedited forwarding (EF) service for current time slot (t) based on two factors: (i) previous weight allocated to it at time slot (t-1), and (ii) average increase in weights of EF traffic in consecutive time slots. This prediction provides smoother and balanced bandwidth allocation to EF, assured forwarding (AF) and best effort (BE) packets by not allocating all the resources to EF and also ensuring minimal packet losses for EF service. Adopting such a dynamic resource allocation effectively achieves reduction in packet loss, end to end delay and delay jitter. The algorithm is tested with different data rates and found to outperform other existing methods in terms of packet loss and end to end delay.","PeriodicalId":123908,"journal":{"name":"2015 IEEE International Advance Computing Conference (IACC)","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126880106","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":"Identification of influential nodes from social networks based on Enhanced Degree Centrality Measure","authors":"A. Srinivas, R. Scholar, R. Leela Velusamy","doi":"10.1109/IADCC.2015.7154889","DOIUrl":"https://doi.org/10.1109/IADCC.2015.7154889","url":null,"abstract":"A social network is a set of relationships and interactions among social entities such as individuals, organizations, and groups. The social network analysis is one of the major topics in the ongoing research field. The major problem regarding the social network is finding the most influential objects or persons. Identification of most influential nodes in a social network is a tedious task as large numbers of new users join the network every day. The most commonly used method is to consider the social network as a graph and find the most influential nodes by analyzing it. The degree centrality method is node based and has the advantage of easy identification of most influential nodes. In this paper a method called “Enhanced Degree Centrality Measure” is proposed which integrates clustering co-efficient value along with node based degree centrality. The enhanced degree centrality measure is applied to three different datasets which are obtained from the Facebook to analyze the performance. The response obtained is compared with existing methods such as degree centrality method and SPIN algorithm. By comparison, it is found that highest number of active nodes identified by the proposed method is 64 when compared with SPIN algorithm which identifies only 55.","PeriodicalId":123908,"journal":{"name":"2015 IEEE International Advance Computing Conference (IACC)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123265034","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}
Priyanka Pawar, Supriya M. Pharande, P. Wani, A. Patki
{"title":"Implementation of Hurst parameter on DSP processor TMS320C6713 platform using wavelet analysis","authors":"Priyanka Pawar, Supriya M. Pharande, P. Wani, A. Patki","doi":"10.1109/IADCC.2015.7154833","DOIUrl":"https://doi.org/10.1109/IADCC.2015.7154833","url":null,"abstract":"Over the last 20 years, analysis, modeling and simulation of network traffic in different networks adopted techniques based on statistics and probability theory. We bring out the limitations of these approaches and implement alternative approach using the long range dependence and self-similarity in the network traffic focused around wavelet analysis method. Hurst (H) parameter estimates amount of self similarity is evaluated using this proposed method. The algorithm is implemented in C programming language. The synthetic self similar traffic with predefined H parameter is used as an input. Real-time implementation of the proposed algorithm using C programming language is implemented in TMS320C6713 processor.","PeriodicalId":123908,"journal":{"name":"2015 IEEE International Advance Computing Conference (IACC)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123106984","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}