oalib

Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99

Submit

Any time

2019 ( 190 )

2018 ( 288 )

2017 ( 313 )

2016 ( 388 )

Custom range...

Search Results: 1 - 10 of 138808 matches for " K. Guna Sekaran "
All listed articles are free for downloading (OA Articles)
Page 1 /138808
Display every page Item
Design and Development of Temperature Control System in Induction Furnace using LPC2148 and XBee
U. Rajkanna,K. Guna Sekaran,D. Manivannan,A. Umamakeswari
Journal of Artificial Intelligence , 2012,
Abstract: In forging and rolling industries, the furnace is used for melting. The temperature of the furnace is controlled by supplying air-fuel combination, flow of electron, inflow of coal etc. Depends on the type of furnace it will vary. The temperature is measured by using pyrometer type sensors or any contact type sensors. Fully automated furnace, temperature is measured and transmitted to control room through a wired connection. Similarly control on furnace also carried out by wired connections from the control room. In wired network, transmission between control room and furnace and vice versa needs lengthy and confusing wire connections. Installation cost is also high. In this proposed study, the amplified value of the temperature sensor is transmitted to the controller unit by radio frequency waves. For transmission highly secured XBee is used. The controller unit receives the temperature serially by using another XBee module. The controller unit displays the temperature locally. Controlling value of the flow of electrons is transmitted to another controller using the XBee module. So that temperature of the furnace is maintained with ±1°C. In the entire process LPC2148 processor is used. By implementing this technique accident due to operator carelessness can be reduced. This technique is easy to implement and also acquired at low cost.
“Q-Feed”—An Effective Solution for the Free-Riding Problem in Unstructured P2P Networks
Sabu M. Thampi,Chandra Sekaran K
International Journal of Digital Multimedia Broadcasting , 2010, DOI: 10.1155/2010/793591
Abstract: This paper presents a solution for reducing the ill effects of free-riders in decentralised unstructured P2P networks. An autonomous replication scheme is proposed to improve the availability and enhance system performance. Q-learning is widely employed in different situations to improve the accuracy in decision making by each peer. Based on the performance of neighbours of a peer, every neighbour is awarded different levels of ranks. At the same time a low-performing node is allowed to improve its rank in different ways. Simulation results show that Q-learning-based free riding control mechanism effectively limits the services received by free-riders and also encourages the low-performing neighbours to improve their position. The popular files are autonomously replicated to nodes possessing required parameters. Due to this improvement of quantity of popular files, free riders are given opportunity to lift their position for active participation in the network for sharing files. Q-feed effectively manages queries from free riders and reduces network traffic significantly. 1. Introduction A P2P network serves the content among the associate nodes rather than focussing it at a single central server. The barriers to starting and growing such systems are low, since they usually do not require any special administrative or financial arrangements, unlike with centralised facilities. P2P systems recommend an approach to aggregate and make use of the incredible computation and storage resources that otherwise just sit idle on computers across the internet when they are unused. P2P systems are widely used for file-sharing. The fundamental idea of file sharing is to utilise the idle disk space for storage and the existing network bandwidth for search and download [1]. A major benefit of P2P file sharing is that these systems are fully scalable—each additional user brings extra capacity to the system. In a P2P system, participating nodes mark at least part of their resources as “shared”, allowing other contributing peers to access these resources. Thus, if node A publishes something and node B downloads it, then when node C asks for the same information, it can access it from either node A or node B. As a result, as new users access a particular file, the system’s capability to provide that file increases [2]. There are mainly three different architectures for P2P systems: centralized, decentralized structured, and decentralized unstructured. In the centralized model, such as Napster [3], central index servers are used to maintain a directory of shared files
Survey of Search and Replication Schemes in Unstructured P2P Networks
Sabu M. Thampi,Chandra Sekaran. K
Network Protocols and Algorithms , 2010,
Abstract: P2P computing lifts taxing issues in various areas of computer science. The largely used decentralized unstructured P2P systems are ad hoc in nature and present a number of research challenges. In this paper, we provide a comprehensive theoretical survey of various state-of-the-art search and replication schemes in unstructured P2P networks for file-sharing applications. The classifications of search and replication techniques and their advantages and disadvantages are briefly explained. Finally, the various issues on searching and replication for unstructured P2P networks are discussed.
Survey of Search and Replication Schemes in Unstructured P2P Networks
Sabu M. Thampi,Chandra Sekaran K
Computer Science , 2010,
Abstract: P2P computing lifts taxing issues in various areas of computer science. The largely used decentralized unstructured P2P systems are ad hoc in nature and present a number of research challenges. In this paper, we provide a comprehensive theoretical survey of various state-of-the-art search and replication schemes in unstructured P2P networks for file-sharing applications. The classifications of search and replication techniques and their advantages and disadvantages are briefly explained. Finally, the various issues on searching and replication for unstructured P2P networks are discussed.
Protocols for Bio-Inspired Resource Discovery and Erasure Coded Replication in P2P Networks
Sabu M. Thampi,K Chandra Sekaran
Computer Science , 2010,
Abstract: Efficient resource discovery and availability improvement are very important issues in unstructured P2P networks. In this paper, a bio-inspired resource discovery scheme inspired by the principle of elephants migration is proposed. A replication scheme based on Q-learning and erasure codes is also introduced. Simulation results show that the proposed schemes significantly increases query success rate and availability, and reduces the network traffic as the resources are effectively distributed to well-performing nodes.
An Enhanced Search Technique for Managing Partial Coverage and Free Riding in P2P Networks
Sabu M. Thampi,Chandra Sekaran K
Computer Science , 2010,
Abstract: This paper presents a Q-learning based scheme for managing the partial coverage problem and the ill-effects of free riding in unstructured P2P networks. Based on various parameter values collected during query routing, reward for the actions are computed and these rewards are used for updating the corresponding Q-values of peers. Thus, the routing is done through only nodes which have shown high performance in the past. Simulation experiments are conducted in several times and the results are plotted. Results show that the proposed scheme effectively manages free riders, generates high hit ratio, reduces network traffic and manages partial coverage problem.
Review of Replication Schemes for Unstructured P2P Networks
Sabu M. Thampi,K. Chandra Sekaran
Computer Science , 2009,
Abstract: To improve unstructured P2P system performance, one wants to minimize the number of peers that have to be probed for the shortening of the search time. A solution to the problem is to employ a replication scheme, which provides high hit rate for target files. Replication can also provide load balancing and reduce access latency if the file is accessed by a large population of users. This paper briefly describes various replication schemes that have appeared in the literature and also focuses on a novel replication technique called Q-replication to increase availability of objects in unstructured P2P networks. The Q-replication technique replicates objects autonomously to suitable sites based on object popularity and site selection logic by extensively employing Q-learning concept.
Mobile Agents for Content-Based WWW Distributed Image Retrieval
Sabu M. Thampi,K. Chandra Sekaran
Computer Science , 2008,
Abstract: At present, the de-facto standard for providing contents in the Internet is the World Wide Web. A technology, which is now emerging on the Web, is Content-Based Image Retrieval (CBIR). CBIR applies methods and algorithms from computer science to analyse and index images based on their visual content. Mobile agents push the flexibility of distributed systems to their limits since not only computations are dynamically distributed but also the code that performs them. The current commercial applet-based methodologies for accessing image database systems offer limited flexibility, scalability and robustness. In this paper the author proposes a new framework for content-based WWW distributed image retrieval based on Java-based mobile agents. The implementation of the framework shows that its performance is comparable to, and in some cases outperforms, the current approach.
Content Based Image Retrieval with Mobile Agents and Steganography
Sabu . M Thampi,K. Chandra Sekaran
Computer Science , 2004,
Abstract: In this paper we present an image retrieval system based on Gabor texture features, steganography, and mobile agents.. By employing the information hiding technique, the image attributes can be hidden in an image without degrading the image quality. Thus the image retrieval process becomes simple. Java based mobile agents manage the query phase of the system. Based on the simulation results, the proposed system not only shows the efficiency in hiding the attributes but also provides other advantages such as: (1) fast transmission of the retrieval image to the receiver, (2) searching made easy.
A System for Predicting Subcellular Localization of Yeast Genome Using Neural Network
Sabu M. Thampi,K. Chandra Sekaran
Computer Science , 2007,
Abstract: The subcellular location of a protein can provide valuable information about its function. With the rapid increase of sequenced genomic data, the need for an automated and accurate tool to predict subcellular localization becomes increasingly important. Many efforts have been made to predict protein subcellular localization. This paper aims to merge the artificial neural networks and bioinformatics to predict the location of protein in yeast genome. We introduce a new subcellular prediction method based on a backpropagation neural network. The results show that the prediction within an error limit of 5 to 10 percentage can be achieved with the system.
Page 1 /138808
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.