Conference Papers
Permanent URI for this collectionhttps://idr.nitk.ac.in/handle/123456789/28506
Browse
166 results
Search Results
Item Meta-level constructs in content personalization of a web application(2010) Annappa, B.; Chandrasekaran, K.; Shet, K.C.In today's business environment, web applications become more and more complex but they still need to be flexible for changes, easy to maintain and the development life cycle need to be short. A reflective technique seems to be the best way to achieve flexibility of the web applications when adding the personalization features like recommendations, special offers, etc. Most of the algorithms help to achieve personalization; but, little attention has been paid to the design and modeling process of internet applications. Personalization will help to cope with increasing complexity of Business Enterprise level Applications. High-level, cleanly layered solutions open up promising possibilities to overcome these difficulties. This paper gives an insight into the content personalization of a web application using meta-level constructs. ©2010 IEEE.Item Horizontal component of electric field due to lightning return strokes(2011) Chandrasekaran, K.; Punekar, G.S.Lightning generated horizontal electric field above the ground have been computed and reported for a typical height of 10 m (above the ground plane), at a radial distance of 750 m from the striking point. The results are presented for typical first and subsequent return strokes of lightning involving two cases, (i) perfectly conducting ground (ii) finitely conducting ground (ω g=0.0001 S/m). The ground conductivity effects on the horizontal electric field components (static, induction and radiation) are studied. A comparison is made on the basis of computed results with typical first and subsequent strokes. © 2011 IEEE.Item Analyzing design patterns for extensibility(2011) Annappa, B.; Rajendran, R.; Chandrasekaran, K.; Shet, K.C.A system is said to be extensible, if any changes can be made to any of the existing system functionalities and/or addition of new functionalities with minimum impact. To achieve extensibility, it has to be planned properly starting from the initial stage of the application development. Keeping in mind all the possible future changes to be made, the designer should select the proper design patterns and finish the design for the application. Once the application design is finished, it should be analyzed to make sure that the application is extensible. © Springer-Verlag Berlin Heidelberg 2011.Item IT service provisioning by passing hints in module interfaces(2012) Naik, N.N.; Veigas, J.P.; Chandrasekaran, K.Communication is a crucial aspect in the domain of IT service provisioning, where data is being transmitted from the sending entity to the receiving entity by the interaction of applications via an interface. When the data is transferred, large amount of time is consumed for its computation by the service at the receiving side. When two applications interact via an interface the communication can be made effective by enhancing the IT service provisioning system with inclusion of web services by some faster means. In this paper we discuss how IT service provisioning can be handled by making use of hints using web services that can be passed by the modules within the application via interfaces from a client to the service, which can avoid expensive computation by the service. The hint is passed in its request and if correct, a service can avoid the computation and communication overhead leading to better system performance. If the message or hint is incorrect it leads to erroneous computations. Passing hints between the modules within an application should take place in an effective, non-erroneous way by imparting quality and less computation by the service involved between two communicating entities contributing towards the promises of services provided by cloud computing. © 2012 IEEE.Item Key update mechanism in PKI: Study & a new approach(IEEE Computer Society help@computer.org, 2013) Spoorthi, V.; Rajendran, B.; Chandrasekaran, K.Public-Key Infrastructure (PKI) provides robust and scalable security services like authentication and non-repudiation using digital certificates. An efficient key management is necessary for a long term implementation of PKI. As a part of key management, key pair of all the entities within the PKI system is updated regularly to minimize overuse of keys and to comply with the organization's policies. In a hierarchical PKI system, root Certificate Authority (CA) is the highest trust anchor and hence updating its key pair is a challenging task. It requires proper authentication of certificate issuing entities to its subordinates and storage of keys for future reference. This paper discusses the various mechanisms available for updating root CA key pairs and brings out pros and cons in each. Considering the shortcomings of these methods, a new method for key pair update has been proposed, which is less complex and easy to implement. In addition, some of the open-source tools available to implement these techniques and open challenges which need to be addressed to have been highlighted. © 2013 IEEE.Item Tutorial: Resource management in cloud computing(IEEE Computer Society help@computer.org, 2013) Chandrasekaran, K.Resource management in cloud computing is to mean the efficient use of heterogeneous and geographically distributed resources for client requests for cloud service provisioning. Since the resources spread across multiple organizations with different policy of usages, the management of these is really a big challenge. The tutorial introduces the notions of resources and resource management in a cloud computing environment and, introduces the research in this domain with some interesting approaches and results. © 2013 IEEE.Item Energy-efficient edge-based network partitioning scheme for wireless sensor networks(2013) Muni, V.K.; Kandasamy, A.; Chandrasekaran, K.The easy use of Wireless Sensor Networks has attracted applications from various fields. Day to day rise in wireless sensor network applications introduce new challenges to researchers. One such critical challenge is, optimal usage of network resources. Energy is one of the most important concerns in wireless sensor networks. Even though there has been an extensive research work done on this issue, the problem is still open with new requirements emerging every day. Exchange of control information consumes most of network resources to carry out network operations. An attempt has been made in the recent past to avoid this wastage of resources, by exploiting the properties of resource abundant sources in the network. Base station is one such source in wireless sensor network. The base station is resource abundant and less constrained network component in wireless sensor networks. The recent research works have focused more in this direction to explore the benefits of base station characteristics. In this perspective, a novel network partitioning mechanism is proposed here, to build energy efficient wireless sensor networks. The system proposed, distributes network load uniformly with little control overhead on energy resources in the network. The uniform distribution of sensor nodes in every part helps the network to distribute the load uniformly. From simulation results, it is noted that, the proposed system elevates the average lifetime of sensor nodes. © 2013 IEEE.Item Improving the efficiency of genetic algorithm approach to virtual machine allocation(Institute of Electrical and Electronics Engineers Inc., 2014) Joseph, C.T.; Chandrasekaran, K.; Cyriac, R.Virtual machine (VM) allocation is the process of allocating virtual machines to suitable hosts. This problem is an NP-Hard problem. It can be considered as a variation of the bin-packing problem. Among various solutions that attempt to solve this problem, several approaches that apply Genetic Algorithm have been proposed. This paper proposes a method to improve the efficiency of such approaches. Implementation of the proposed approach shows significant improvements in the runtime, memory used, energy efficiency and SLA violations. © 2014 IEEE.Item A green greedy process scheduler for cloud data centers(Institute of Electrical and Electronics Engineers Inc., 2014) Karthik, C.; Gupta, A.; Chandrasekaran, K.In this paper we have addressed a major problem in current day data centers- power consumption. Power consumption in data centers has become a major problem these days, both from economic and environmental perspective. Various factors affect the power consumption, one of them being the scheduling of tasks on the data center servers. Basically we achieved a real-time simulation of two cloud scheduling algorithms and compared the power efficiency of the two algorithms in terms of two main temperature parameters of the servers-idle temperature and critical temperature. We assumed that we were given all the task parameters such as running time etc. and then we calculated a final temperature that a system will reach on running that particular task. Then we decided which system could accommodate that task based on that systems critical temperature and chose the best system among those based on a score proposed in the paper. © 2014 IEEE.Item A game theoretic approach to a self managing MOOC based distributed system(Institute of Electrical and Electronics Engineers Inc., 2014) Sharath, N.; Parikh, S.S.; Chandrasekaran, K.The need to introduce an e learning platform in a campus such as ours is significant. In order to cater to the needs of nearly 7000 active users within the campus, a distributed system that is formulated. This system is required to to be as efficient as possible. This paper gives a topology for the system that is required and introduces self-managing properties that will add to the increased performance of the system in terms of speed, accuracy and security. With the aid of software agents continuously monitoring the progress of the entities in the system, we are able to introduce several self managing properties that govern the performance of the system as a whole. The software agents are modeled to be rational thinkers since every entity has a motive of performing its best. A game is simulated between two non cooperative agents as a case study and it is shown that the decision to move towards Nash Equilibrium serves better than any other random strategy. © 2014 IEEE.