Seyedali Mirjalili et al. (2014) introduced a completely unique metaheuristic technique particula... more Seyedali Mirjalili et al. (2014) introduced a completely unique metaheuristic technique particularly grey wolf optimization (GWO). This algorithm mimics the social behavior of grey wolves whereas it follows the leadership hierarchy and attacking strategy. The rising issue in wireless sensor network (WSN) is localization problem. The objective of this problem is to search out the geographical position of unknown nodes with the help of anchor nodes in WSN. In this work, GWO algorithm is incorporated to spot the correct position of unknown nodes, so as to handle the node localization problem. The proposed work is implemented using MATLAB 8.2 whereas nodes are deployed in a random location within the desired network area. The parameters like computation time, percentage of localized node, and minimum localization error measures are utilized to analyse the potency of GWO rule with other variants of metaheuristics algorithms such as particle swarm optimization (PSO) and modified bat algor...
Advances in Intelligent Systems and Computing, 2012
ABSTRACT Cloud computing represents the latest phase in the evolution of Internet-based computing... more ABSTRACT Cloud computing represents the latest phase in the evolution of Internet-based computing. In spite of the attractive properties it provides, security and privacy issues loom large for cloud computing. In this paper, we concentrate on the security threats involved in cloud by providing an Authenticated Key Exchange Protocol (AKExP). In this protocol, we make use of the identity management scheme and symmetric key encryption algorithm so that unauthorized users cannot get access to the sensitive data stored in the cloud. This proposed approach minimizes the computation cost and communication cost when compared with another authentication protocol, Identity-based Authentication Protocol. This paper provides an efficient and secure way to authenticate the user in the cloud both by the owner and cloud service provider.
Background/Objectives: To analyze the functions and merits of web service composition and provide... more Background/Objectives: To analyze the functions and merits of web service composition and provide services to many number of users at a time. Methods/Statistical Analysis: The standard-based approach whichused to connects the web service to create the business processes which are of higher level. There are various approaches for composing the web services.Web service integrates various web applications by using languages namely WSDL, XML, WSFL etc. Findings: In this research, Web Service Composition (WSC) aims to organize numerous services to fulfill the user needs. It is one of the flexible way of integration of applications and resource sharing. The algorithm used by web service composition are Evolutionary algorithm, Ant Colony Optimization, Genetic algorithm, Particle Swarm algorithm, Branch and Bound for Execution Plan Selection (BB4EPS) algorithm, Join-Idle-Queue (JIQ) algorithm and Two-phase algorithm. Through the web service leads to provide services to more than single user. Applications/Improvements: When solving the web service composition problem, composing a sequence of web services is converted into finding a chain of actions. Automated planning technique uses two steps for web service composition dynamically. In this approach, WSC problem is taken as input and translated into WSC planning problem. Web service composition explore their functions through the online process and business needs.
Page 1. Jayanthi Manicassamy et al /International Journal on Computer Science and Engineering Vol... more Page 1. Jayanthi Manicassamy et al /International Journal on Computer Science and Engineering Vol.1(3), 2009, 122-126 122 ... Acquaintance For Viruses Jayanthi Manicassamy Department of Computer Science Pondicherry University Pondicherry, India. jmanic2@yahoo.com ...
International Journal of Computer Science and Applications
... Systems R. Srinivasa Perumal Department of Computer Science Pondicherry University, Pondicher... more ... Systems R. Srinivasa Perumal Department of Computer Science Pondicherry University, Pondicherry, India. sriperl_saro@yahoo.com P. Dhavachelvan Department of Computer Science, Pondicherry University, Pondicherry, India. pd_chelvoume@yahoo.co.in ...
As we know daily thousands of new service providers register their services in the UDDI. The numb... more As we know daily thousands of new service providers register their services in the UDDI. The number of service providers providing the same functionality increases day by day. So it is very difficult for the service requester to choose the best service provider for their requirements from the UDDI. Hence web service selection plays a huge role in providing the best web services to the service requester’s. Most contemporary web service selection research is based on the functional and nonfunctional attributes of web services. In this paper, we have successfully demonstrated a more efficient web service selection model based on user preferences. In this model we have implemented a new web service selection approach based on the user preferred QoS. This proposed model demonstrates in much more effective web service selection compare to the present approaches. We have also successfully shown the difference between the two models
Accurate effort estimation is the state of art of the Software Engineering activities and of cour... more Accurate effort estimation is the state of art of the Software Engineering activities and of course it is a complex process. On the other hand, it is also widely accepted that due to the inherent uncertainty in software development requirements and activities, it is unrealistic to expect very accurate effort estimates over the software development processes. Among the diversified effort estimation models, empirical estimation models are found to be possibly accurate compared to other estimation schemes. The work reported in this paper aims at improving the accuracy of one of the popular effort estimation models, COCOMO II. Since the accuracy of the COCOMO II stands over the cost derives and scale factor, this work investigates the influence of the cost drives and scale factor to improve the accuracy of the effort estimation. It is proved that, with a set of possible modifications in scale factor and cost drives, the overall accuracy of the COCOMO II can be improved. The improvement ...
Current research in Web Service discovery is towards building Context Aware Pervasive Systems tha... more Current research in Web Service discovery is towards building Context Aware Pervasive Systems that give appropriate results based on users interests, but it is not completely discussed how far the retrieved services are actually relevant to the user. Also, the current context aware systems confine themselves to giving best results for user’s queries based on their profiles, which assume user to query based only on the interests which are listed or acquired by the context sensor. But this system can’t be validated in the cases where users search for services beyond their interests. In this paper we discuss context based on two aspects namely service context and user’s context. Also we discuss how the capabilities of UDDI can be extended to organize Web Services based on Conceptual Clustering so as to provide user with better results. Also we discuss how we achieve relevant services using clustering, context and user chosen QoS. In this paper we introduce an improvised model of COBWEB...
Proceedings of the 2015 International Conference on Advanced Research in Computer Science Engineering & Technology (ICARCSET 2015) - ICARCSET '15, 2015
Peer-to-Peer (p2p) is a distributing computer network has the technologies gained popularity mech... more Peer-to-Peer (p2p) is a distributing computer network has the technologies gained popularity mechanisms for the file sharing in the decentralized servers. A p2p network is the self-organization and a distributed control communication. This network is scalable mechanism on which used to find the nodes anywhere in the network without the high routing [18] state. Each node connected in the p2p network [13] the capacity of system increases. But this network has the issues in searching [1] of files in the nodes and the usage of high bandwidth which increased the network traffic. This study presents an optimizing the issues of peer-to-peer network using the effective metaheuristic [6] algorithm called Krill Herd Algorithm which inspires the behavior of Krill Herd [3] proposed by Gandomi and Alavi.
Proceedings of the 2015 International Conference on Advanced Research in Computer Science Engineering & Technology (ICARCSET 2015) - ICARCSET '15, 2015
Seyedali Mirjalili et al. (2014) introduced a completely unique metaheuristic technique particula... more Seyedali Mirjalili et al. (2014) introduced a completely unique metaheuristic technique particularly grey wolf optimization (GWO). This algorithm mimics the social behavior of grey wolves whereas it follows the leadership hierarchy and attacking strategy. The rising issue in wireless sensor network (WSN) is localization problem. The objective of this problem is to search out the geographical position of unknown nodes with the help of anchor nodes in WSN. In this work, GWO algorithm is incorporated to spot the correct position of unknown nodes, so as to handle the node localization problem. The proposed work is implemented using MATLAB 8.2 whereas nodes are deployed in a random location within the desired network area. The parameters like computation time, percentage of localized node, and minimum localization error measures are utilized to analyse the potency of GWO rule with other variants of metaheuristics algorithms such as particle swarm optimization (PSO) and modified bat algor...
Advances in Intelligent Systems and Computing, 2012
ABSTRACT Cloud computing represents the latest phase in the evolution of Internet-based computing... more ABSTRACT Cloud computing represents the latest phase in the evolution of Internet-based computing. In spite of the attractive properties it provides, security and privacy issues loom large for cloud computing. In this paper, we concentrate on the security threats involved in cloud by providing an Authenticated Key Exchange Protocol (AKExP). In this protocol, we make use of the identity management scheme and symmetric key encryption algorithm so that unauthorized users cannot get access to the sensitive data stored in the cloud. This proposed approach minimizes the computation cost and communication cost when compared with another authentication protocol, Identity-based Authentication Protocol. This paper provides an efficient and secure way to authenticate the user in the cloud both by the owner and cloud service provider.
Background/Objectives: To analyze the functions and merits of web service composition and provide... more Background/Objectives: To analyze the functions and merits of web service composition and provide services to many number of users at a time. Methods/Statistical Analysis: The standard-based approach whichused to connects the web service to create the business processes which are of higher level. There are various approaches for composing the web services.Web service integrates various web applications by using languages namely WSDL, XML, WSFL etc. Findings: In this research, Web Service Composition (WSC) aims to organize numerous services to fulfill the user needs. It is one of the flexible way of integration of applications and resource sharing. The algorithm used by web service composition are Evolutionary algorithm, Ant Colony Optimization, Genetic algorithm, Particle Swarm algorithm, Branch and Bound for Execution Plan Selection (BB4EPS) algorithm, Join-Idle-Queue (JIQ) algorithm and Two-phase algorithm. Through the web service leads to provide services to more than single user. Applications/Improvements: When solving the web service composition problem, composing a sequence of web services is converted into finding a chain of actions. Automated planning technique uses two steps for web service composition dynamically. In this approach, WSC problem is taken as input and translated into WSC planning problem. Web service composition explore their functions through the online process and business needs.
Page 1. Jayanthi Manicassamy et al /International Journal on Computer Science and Engineering Vol... more Page 1. Jayanthi Manicassamy et al /International Journal on Computer Science and Engineering Vol.1(3), 2009, 122-126 122 ... Acquaintance For Viruses Jayanthi Manicassamy Department of Computer Science Pondicherry University Pondicherry, India. jmanic2@yahoo.com ...
International Journal of Computer Science and Applications
... Systems R. Srinivasa Perumal Department of Computer Science Pondicherry University, Pondicher... more ... Systems R. Srinivasa Perumal Department of Computer Science Pondicherry University, Pondicherry, India. sriperl_saro@yahoo.com P. Dhavachelvan Department of Computer Science, Pondicherry University, Pondicherry, India. pd_chelvoume@yahoo.co.in ...
As we know daily thousands of new service providers register their services in the UDDI. The numb... more As we know daily thousands of new service providers register their services in the UDDI. The number of service providers providing the same functionality increases day by day. So it is very difficult for the service requester to choose the best service provider for their requirements from the UDDI. Hence web service selection plays a huge role in providing the best web services to the service requester’s. Most contemporary web service selection research is based on the functional and nonfunctional attributes of web services. In this paper, we have successfully demonstrated a more efficient web service selection model based on user preferences. In this model we have implemented a new web service selection approach based on the user preferred QoS. This proposed model demonstrates in much more effective web service selection compare to the present approaches. We have also successfully shown the difference between the two models
Accurate effort estimation is the state of art of the Software Engineering activities and of cour... more Accurate effort estimation is the state of art of the Software Engineering activities and of course it is a complex process. On the other hand, it is also widely accepted that due to the inherent uncertainty in software development requirements and activities, it is unrealistic to expect very accurate effort estimates over the software development processes. Among the diversified effort estimation models, empirical estimation models are found to be possibly accurate compared to other estimation schemes. The work reported in this paper aims at improving the accuracy of one of the popular effort estimation models, COCOMO II. Since the accuracy of the COCOMO II stands over the cost derives and scale factor, this work investigates the influence of the cost drives and scale factor to improve the accuracy of the effort estimation. It is proved that, with a set of possible modifications in scale factor and cost drives, the overall accuracy of the COCOMO II can be improved. The improvement ...
Current research in Web Service discovery is towards building Context Aware Pervasive Systems tha... more Current research in Web Service discovery is towards building Context Aware Pervasive Systems that give appropriate results based on users interests, but it is not completely discussed how far the retrieved services are actually relevant to the user. Also, the current context aware systems confine themselves to giving best results for user’s queries based on their profiles, which assume user to query based only on the interests which are listed or acquired by the context sensor. But this system can’t be validated in the cases where users search for services beyond their interests. In this paper we discuss context based on two aspects namely service context and user’s context. Also we discuss how the capabilities of UDDI can be extended to organize Web Services based on Conceptual Clustering so as to provide user with better results. Also we discuss how we achieve relevant services using clustering, context and user chosen QoS. In this paper we introduce an improvised model of COBWEB...
Proceedings of the 2015 International Conference on Advanced Research in Computer Science Engineering & Technology (ICARCSET 2015) - ICARCSET '15, 2015
Peer-to-Peer (p2p) is a distributing computer network has the technologies gained popularity mech... more Peer-to-Peer (p2p) is a distributing computer network has the technologies gained popularity mechanisms for the file sharing in the decentralized servers. A p2p network is the self-organization and a distributed control communication. This network is scalable mechanism on which used to find the nodes anywhere in the network without the high routing [18] state. Each node connected in the p2p network [13] the capacity of system increases. But this network has the issues in searching [1] of files in the nodes and the usage of high bandwidth which increased the network traffic. This study presents an optimizing the issues of peer-to-peer network using the effective metaheuristic [6] algorithm called Krill Herd Algorithm which inspires the behavior of Krill Herd [3] proposed by Gandomi and Alavi.
Proceedings of the 2015 International Conference on Advanced Research in Computer Science Engineering & Technology (ICARCSET 2015) - ICARCSET '15, 2015
Uploads