{"title":"Aggregating Content and Connectivity based Techniques for Measure of Web Search Quality","authors":"R. Ali, M. Beg","doi":"10.1109/ADCOM.2006.4289853","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289853","url":null,"abstract":"Web Searching is very much popular among the Internet users. A large number of public search engines are available for this purpose. So, there must be some procedure to measure the quality of web search. In this paper, classical content-based retrieval techniques such as Vector Space Model and Boolean Similarity Measures are combined with connectivity-based techniques such as PageRank for measure of web search quality. These techniques are combined using Modified Shimura technique of Rank aggregation. The aggregated ranking obtained in the process is compared with the original ranking given by the search engine. The correlation coefficient thus obtained is averaged for a set of queries. We show our experimental results pertaining to seven public search engines and fifteen queries.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126770720","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 Secure and Scalable Framework for Group Communication","authors":"Annappa, G. Rani","doi":"10.1109/ADCOM.2006.4289883","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289883","url":null,"abstract":"Critical networking issues in group communication involve security, scalability and dynamic membership changes. Security provides confidentiality, authenticity, and integrity of messages exchanged between group members. Tree Group Diffie Hellman is an efficient key agreement protocol for peer groups. But, it is not scalable beyond 100 members. On the other hand, large multicast groups don't support dynamic membership changes. In this Paper, we propose a new framework, which addresses the problems of scalability and dynamic membership change.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128453278","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":"Remote Control Of Process Parameters Using Embedded Web Technology","authors":"Y. Sonawane, P. Patil, N. Sonawane, G.D. Sonawane","doi":"10.1109/ADCOM.2006.4289977","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289977","url":null,"abstract":"The aim of this paper is to present the importance of energy conservation and management, Remote monitoring & Controlling of process parameters using advanced embedded web technology which is not in practices in various Indian industry. This work is done by monitoring various industries. As demand of electricity increasing tremendously there need of additional 1,57,107MW in 2012 (India) i.e. at rate of about 8,000MW/year. Due to increasing cost of power generation and cost of T & D System, it is important to know the scope of energy conservation and its management & its Remote monitoring. This work has been aimed at monitoring and controlling the parameters using TCP/IP and PIC16F87A7 and to setup a client-server model. The connection is through the serial port, which communicates using SLIP (Serial Line IP). The parameters like Temperature, Pressure, Energy etc are sensed by a sensor. The Embedded Processor receives this value from the sensor. The values are sent to the computer. The software running in the computer will read the Digitized values & remote user sends a request to the embedded web server through Internet, The request is received and forwarded to the web server as SLIP packets. The UART for the serial communication is simulated in the Microchip itself. The data is transferred to the Internet protocol layer and to the TCP stack. Through this TCP/IP the data are collected from the associated hardware depending upon the request received. These are routed to the remote user to the network for further monitoring & controlling with required security, speed & quality.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128474621","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":"Web-Based Counselling System","authors":"S. Palaniappan, Tang Jun-e","doi":"10.1109/ADCOM.2006.4289854","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289854","url":null,"abstract":"This paper introduces a Web-based counselling system (hereafter called E-Counsellor), a non-profit online counselling Web portal that was built to provide a platform for counsellors to reach out to the general public. We examine the background that induced the conceptualization of the portal, the system's architecture and design as well as the implementation of the working system. The paper closes with an evaluation of the system.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127340227","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":"Network Intrusion Detection via a Hybrid of Genetic Algorithms and Principal Component Analysis","authors":"N. Nalini, R. Raghavendra","doi":"10.1109/ADCOM.2006.4289877","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289877","url":null,"abstract":"In recent years network intrusion has been a problem of great concern to the design of secure computing systems. To detect an intrusion and the type of intrusion, it is desired to characterize an intrusion by its features so that future intrusions can be classified based on these features. In this paper, we present a novel method driven by the genetic algorithms and principal component analysis. This hybrid approach detects intrusions with an accuracy better than the best available till date, for several simulated tests conducted. It is hoped that this technique can also be used to detect the class of intrusion.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132051603","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 System Of Operations On Sliding Windows","authors":"A. Dani, J. Getta","doi":"10.1109/ADCOM.2006.4289961","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289961","url":null,"abstract":"One of the distinguishing characteristics of a data stream system is 'a continuous query operating on dynamic data' as opposed to 'static data processed by instantaneous query' in DBMS. In this paper, we propose a system of operators to process a continuous query on sliding windows over streaming data. We use the pre-defined notion of sliding windows over a data stream and provide an abstraction for a system of operations that supports evaluation of a continuous query on sliding windows. The model consists of a basic data window, a set of transition operations, a set of processing operations and the operation of binding number of streams together before processing.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134571353","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":"Computationally Efficient MCTF for Scalable Video Coding","authors":"A. K. Karunakar, M. M. Manohara Pai","doi":"10.1109/ADCOM.2006.4289941","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289941","url":null,"abstract":"The discrete wavelet transforms (DWTs) applied temporally under motion compensation (MC) has recently become a very powerful tool in scalable video compression, especially when implemented through lifting. Due to bidirectional motion estimation in Motion Compensated Temporal Filtering (MCTF) framework the scalable encoder turns out to be very slow. Temporal filtering without motion compensation produces blur in the low frequency frames wherever there is a motion hence does not support temporal scalability. This paper proposes a technique that does temporal filtering without motion compensation to produce high frequency frame. The motion blocks are identified using the content of the high frequency frame and MCTF is applied only to those blocks. By applying motion estimation only to the selected blocks the technique significantly improves the speed of the encoder. In slow motion test video sequences the proposed technique performs well without compromising the quality of the video and in remaining classes of videos its complexity is reduced compared to the conventional MCTF.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125623275","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":"Ant colony Optimization for Feature Selection and Classification of Microcalcifications in Digital Mammograms","authors":"M. Karnan, K. Thangavel, R. Sivakuar, K. Geetha","doi":"10.1109/ADCOM.2006.4289903","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289903","url":null,"abstract":"Genetic algorithm (GA) and Ant colony optimization (ACO) algorithm are proposed for feature selection, and their performance is compared. The spatial gray level dependence method (SGLDM) is used for feature extraction. The selected features are fed to a three-layer backpropagation network hybrid with ant colony optimization (BPN-ACO) for classification. And the receiver operating characteristic (ROC) analysis is performed to evaluate the performance of the feature selection methods with their classification results. The proposed algorithms are tested with 114 abnormal images from the Mammography Image Analysis Society (MIAS) database.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130401038","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-Algorithmic Face Recognition System","authors":"Soumitra Kar, Swati Hiremath, Dilip G. Joshi, Vinod.K. Chadda, Apurva Bajpai","doi":"10.1109/ADCOM.2006.4289908","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289908","url":null,"abstract":"The importance of utilising biometrics to establish personal authenticity and to detect impostors is growing in the present scenario of global security concern. Development of a biometric system for personal identification, which fulfills the requirements for access control of secured areas and other applications like identity validation for social welfare, crime detection, ATM access, computer security, etc. is felt to be the need of the day. Face recognition has been evolving as a convenient biometric mode for human authentication for more than last two decades. Several vendors around the world claim the successful working of their face recognition systems. However, the Face Recognition Vendor Test (FRVT) conducted by the National Institute of Standards and Technology (NISI), USA, indicates that the commercial face recognition systems do not perform up to the mark under the variations ubiquitously present in a real-life situation. Availability of a largely accepted robust face recognition system has proved elusive so far. Keeping in view the importance of indigenous development of biometric systems to cater to the requirements at BARC and elsewhere in the country, the work was started on the development of a face-based biometric authentication system. In this paper, we discuss our efforts in developing a face recognition system that functions successfully under a reasonably constrained set-up for facial image acquisition. The prototype system built in our lab finds facial match by utilizing multi-algorithmic multi-biometric technique, combining gray level statistical correlation method with Principal Component Analysis (PCA) or Discrete Cosine Transform (DCT) techniques in order to boost our system performance. After automatic detection of the face in the image and its gross scale correction, its PCA and DCT signatures are extracted. Based on a comparison of the extracted signature with the set of references, the set of top five hits are selected. Exact scale of the face is ascertained w.r.t. each of these hits by first locating the eyes employing template matching technique and then finding the inter-ocular distance. After interpolating the face to the exact scale, matching scores are computed based on gray level correlation of a number of features on the face. Final identification decision is taken amongst this set of five faces, depending on the highest score. We have tested the technique on a set of 109 images belonging to 43 subjects, both male and female. The result on this image-set indicates 89% success rate of our technique.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114982385","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":"Secure Autonomic Communication using RSA Algorithm","authors":"A. Chittala, P. Mummini, P. Verma","doi":"10.1109/ADCOM.2006.4289860","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289860","url":null,"abstract":"The goal of autonomic computing is to make systems work smarter, not harder. Using biological systems as inspiration, autonomic computing takes the nervous system as a systemic model. The autonomic system reacts instantly to changing demands, environments, threats, and injuries in appropriate ways. And it does precisely what is required in these specific circumstances without the need for conscious recognition or action. IBM's autonomic computing initiative seeks to apply this model to the ways system and application vendors design computing solutions, removing or drastically reducing the need for human intervention. In this paper we studied and analyzed RSA algorithm for autonomic Communication over a secure channel.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115663285","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}