INTERACT-2010最新文献

{"title":"Cell phone operated robot","authors":"D. Manikandan, Pankaj Pareek, P. Ramesh","doi":"10.1109/INTERACT.2010.5706222","DOIUrl":"https://doi.org/10.1109/INTERACT.2010.5706222","url":null,"abstract":"A robot is an automatically guided machine which is able to do tasks on its own, almost always due to electronically ogrammed instructions Radio control (often abbreviated to R/C or simply RC) is the use of radio signals to remotely control a device. This is often a radio control device, cable between control and vehicle, or an infrared controller. Our paper focus on operating robots by cell phone in order to simplify the contro of robots. Methodology used is DTMF (Dual Tone Multi-Frequency). All over it is used frequently to refer to the control of model vehicles from a hand-held radio transmitter. Industrial, military, and scientific research organizations make [traffic] use of radio-controlled vehicles as well.","PeriodicalId":201931,"journal":{"name":"INTERACT-2010","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133450675","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":"Design and implementation of navigation algorithm for intelligent racing car","authors":"Saurav Singh, Devesh Kumar Singh, Rakendra Thapa, Rishabh Khurana","doi":"10.1109/INTERACT.2010.5706166","DOIUrl":"https://doi.org/10.1109/INTERACT.2010.5706166","url":null,"abstract":"Design and implementation of navigation algorithm for intelligent racing car. The paper describes the implementation of intelligent racing car that can recognize the track automatically to run on the specifically designed complex racing track. The objective is to recognize, understand and modify the actual performance of the movements of the car during its pathway by getting information in real time from IR sensors implemented in the system. The travel trajectory consists of continuous black line of about 25 millimeters in width, on a white background in order to have acceptable functioning. Analyzing of the sensor readings was done during the travel, capturing data at the fixed sampling rate and this data was used as inputs to the algorithm to achieve corrections on the decision speed and control movements. A microcontroller assigns the required movement turn and speeds to optimize the performance in order to get a closer behavior as humans could do it without a vision system to catch its environment. The task of this work was to develop an efficient navigation algorithm and it has been successfully implemented in a Motorola S12X 16-bit microcontroller.","PeriodicalId":201931,"journal":{"name":"INTERACT-2010","volume":"197 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131361401","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":"Autonomous arecanut tree climbing and pruning robot","authors":"P. Devang, N. Gokul, M. Ranjana, S. Swaminathan, B. N. Binoy","doi":"10.1109/INTERACT.2010.5706160","DOIUrl":"https://doi.org/10.1109/INTERACT.2010.5706160","url":null,"abstract":"This paper presents the design and development of a versatile autonomous tree climbing & pruning robot for arecanut farming. The robot has a linear frictional force based non-linear self-regulatory system with 9 DOF that adapts itself to changing trunk diameter. The robot chassis is made rigid and light-weight. An on-board battery is the power source. The motion is provided by two DC motors fitted to spiked wheels. A 5 DOF PUMA arm is mounted on the robot for cutting and pruning purpose. The intelligence is based on Digital Image Processing using Object Recognition techniques. Machine vision is through a guiding camera mounted over the Robotic Arm that feeds the OMAP 32bit Micro-controller made of ARM CORTEX-M3 and Da Vinci processor which has Wavelet based JPEG compression and noise elimination module. A manual override with a display screen allows user to view and control the robot when necessary.","PeriodicalId":201931,"journal":{"name":"INTERACT-2010","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114865861","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":"Use of nanorobots in heart transplantation","authors":"R. M. Merina","doi":"10.1109/INTERACT.2010.5706155","DOIUrl":"https://doi.org/10.1109/INTERACT.2010.5706155","url":null,"abstract":"Nanotechnology is a fascinating science and it offers many challenges. One such challenge is Nanorobots, which once thought to be a fantasy has come into reality now. The proposed application of nanorobots can range from common cold to dreadful disease like cancer. Some such examples can be Pharmacyte, Respirocyte, Microbivores, Chromallocyte and many more. The study of nanorobots has lead to the field of Nanomedicine. Nanomedicine offers the prospect of powerful new tools for the treatment of human diseases and the improvement of human biological systems.","PeriodicalId":201931,"journal":{"name":"INTERACT-2010","volume":" 16","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132158381","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 efficient routing algorithm for improving the QoS in Internet","authors":"G. Vincent, T. Sasipraba","doi":"10.1109/INTERACT.2010.5706184","DOIUrl":"https://doi.org/10.1109/INTERACT.2010.5706184","url":null,"abstract":"QoS Routing Algorithm is a routing algorithm for finding the shortest path that satisfies the QoS requirements of the end users. While finding the shortest path this uses some of improved ideas for effectively finding the shortest path with required QoS measures. Exactly the QoS routing algorithm is a kind of multi constrained routing algorithm where more than one link components are taken into considerations. The path, which is considered as shortest path in this situation, is the one that has minimal value in all case of the components. As a multi constrained algorithm it may suffer to NP complete problem in which the solution space increases exponentially when the problem parameter increases. To make an ideal solution for these kinds of problems this algorithm has some improvements. The first preventive measure is defining a non — linear path length for the shortest path. Then for reducing the polynomial time of the solution driving procedure the problem space is reduced by the introduction of k — shortest path where the queue size is varied at different nodes based on the resource availability and the node requirements. We can also reduce the queue capacity by deleting the non — dominated paths. To increase the speed of algorithm look ahead concept is also bound so that instead of finding the next path to next node a wider range of prior decision is taking place about the path to destination. In this paper, we have concerns only on the state space reduction or also called as multi constrained relaxation in which the queue size is reduced by eliminating the dominated paths from the queue where they are not capable of being the sub path for the shortest path. After that some sorts of modules, where the dominated paths are identified and removed from the queue, analyze the queue. At the last the modified queue is returned to the caller for further usage of the queue. While modifying the queue modules takes one parameter that is a threshold value. When the link components are compared this value is used as reference where if the difference between the link components exceeds then it is considered that it is not further required and marked for removal. The difference is calculated by comparing the link components.","PeriodicalId":201931,"journal":{"name":"INTERACT-2010","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128333583","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":"Steganalytic attack for an adaptive steganography using support vector machine","authors":"B. Yamini, R. Sabitha","doi":"10.1109/INTERACT.2010.5706194","DOIUrl":"https://doi.org/10.1109/INTERACT.2010.5706194","url":null,"abstract":"Steganographic techniques have been used for centuries. Using steganography, secret messages can be embedded inside a piece of unsuspicious information and sending it without anyone's knowledge about the existence of the secret message. Steganalysis is the mechanism of detecting the presence of hidden information in the stego media and it can lead to the prevention of disastrous security incidents. Steganalysis can be a targeted steganalysis or a blind steganalysis. In the existing method, adaptive steganography algorithm is used to provide larger embedding capacity based on image contrast. In this paper, a new technique is implemented to calculate the length of embedded message using Support Vector Machine to classify the cover and stego images with extremely low computational cost of comparing the bit positions.","PeriodicalId":201931,"journal":{"name":"INTERACT-2010","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134126508","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":"Design and analysis using Distributed Interactive Simulation (DIS) concept for Armoured Fighting Vehicle training simulators","authors":"B. Jayaprakash, A. Shenbagamoorthy","doi":"10.1109/INTERACT.2010.5706142","DOIUrl":"https://doi.org/10.1109/INTERACT.2010.5706142","url":null,"abstract":"A new approach of Armoured Fighting Vehicle (AFV) simulation is being presented in this research work. Combat Vehicles Research and Development Establishment (CVRDE) is planning to incorporate the concept of Distributed Interactive Simulation (DIS) for Armoured fighting vehicle training simulators. DIS is an open standard for conducting real-time platform-level war gaming across multiple host computers. This is used worldwide, especially by military organizations and other agencies such as those involved in space exploration and medicine. In a Distributed Interactive scenario, there is a need for a centre node to forward data to the receivers based on their respective priorities. A protocol called Predict-and-Quantize for Priority with directed minimum Spanning Tree (PQPST) is used effectively to predict priorities for the receivers. The predicted priorities are quantized to build a significant distribution trees for effective utilization of network bandwidth. A case study was attempted by CVRDE using the existing Troop training simulator architecture to compare the performance analysis of PST and PQPST algorithms and the results are present in this paper. This study reveals that PQPST algorithm is more suited for utilizing the network bandwidth and reduces the latency to achieve the real time response in the training simulator. This study also helps for the robotic applications to select the appropriate route in an intelligent manner from the network distribution graph.","PeriodicalId":201931,"journal":{"name":"INTERACT-2010","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116418589","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":"Design and analysis of conveyor chain for automatic ammunition loading machine","authors":"Atirek Wribhu, Md. Sanaullah Siddiqui, S. Samal, S. Sathyamurthy","doi":"10.1109/INTERACT.2010.5706147","DOIUrl":"https://doi.org/10.1109/INTERACT.2010.5706147","url":null,"abstract":"An ammunition loading system will have four main parts namely Bin, Rounds, Conveyor and driving motor. In this paper we will explore the scope of new type of loading conveyor that will accommodate twenty four rounds. Conveyor will be designed, considering the space constraints inside the tank and should be suitable for automatic loading and unloading. Design will also support the high rate of rounds being fired reliably. These rounds will consist of four different types of projectiles. The conveyor will be designed using CAD modeling software and same will be analyzed to check and validate the design.","PeriodicalId":201931,"journal":{"name":"INTERACT-2010","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121871334","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 explosives and disaster prevention using intelligent robots","authors":"S. Prabakaran, S. Rosy, S. Grace","doi":"10.1109/INTERACT.2010.5706228","DOIUrl":"https://doi.org/10.1109/INTERACT.2010.5706228","url":null,"abstract":"In the present scenario, it is very much inevitable to protect the human force with high level of intelligent gadgets that could ensure peace and harmony from fatal and collateral damages happening day-to-day. This paper attempts to ensure one such measure towards reinforcing peace and security through smart and intelligent technologies. The main objective of this initiative is to avoid the human loss of life and also other collateral damages caused by explosions. Here, Explosion is referred as bomb explosion. The secured locations are interconnected in an Artificial Neural Network (ANN) with special sensors so that every single movement is observed and classified. The result of this will lead to trigger subsequent alarming signals to contact the control room and deploy intelligent robots to diffuse or confiscate the explosive materials from the carriers. This idea may be possible for implementation with technical feasibilities and availability of the devices which need to be conformed to the expected standards.","PeriodicalId":201931,"journal":{"name":"INTERACT-2010","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125771148","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":"Implementation of NOSQL for robotics","authors":"S. Vijaykumar, S. Saravanakumar","doi":"10.1109/INTERACT.2010.5706225","DOIUrl":"https://doi.org/10.1109/INTERACT.2010.5706225","url":null,"abstract":"This paper reveals the secret of NOSQL. What is NOSQL? It breaks the long history of relational database and a massive implementation of NOSQL on humanoid. NOSQL data store did not have proper table schemas and join operation so no limitation to store data and we can able to form a graph of information from that we can achieve very fast data retrieval. Map reduce concept also give a hand to increase processing speed. So this future generation NOSQL database will change the current trend of robotics and give a way for humanoids.","PeriodicalId":201931,"journal":{"name":"INTERACT-2010","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127809652","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}