{"title":"Text Mining for Finding Acronym-Definition Pairs from Biomedical Text Using Pattern Matching Method with Space Reduction Heuristics","authors":"P. C. Rafeeque, K. A. Abdul Nazeer","doi":"10.1109/ADCOM.2007.118","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.118","url":null,"abstract":"This paper deals with the problem of mining acronyms and their definitions from biomedical text. We propose an effective text mining system by using pattern matching method. Different stages of the design have been explained with pseudo code. We used space reduction heuristic constraints (D. Nadeau and P. Turney, 2005) which will increase the precision by reducing the number of candidate definitions and will include most of the true cases. The pattern matching method does not require training data to run as in the case of learning techniques. This will make the process simple and fast. Evaluation has been done by using three metrics - recall (measure of how much relevant information the system has extracted from text), precision (measure of how much information returned by the system is actually correct) and f-factor (combined value of recall and precision). Experimental results achieved 92% recall and 97.2% precision.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"29 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114026574","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 Feature Set for Handwritten Digit Recognition","authors":"N. Garg, S. Jindal","doi":"10.1109/ADCOM.2007.39","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.39","url":null,"abstract":"In this paper, we have discussed the new feature set for handwritten digit recognition. The feature set is very small and simple. The features are extracted using pixel counting technique and contour following techniques. No preprocessing except binarization and thinning is done on the data. The purpose of this paper is two fold. Firstly, we explained by experiments that slant invariant and size invariant features help in developing general software, which is free from some of the pre-processing steps. Secondly, we confirm that pixel counting technique is very useful for deformed images than contour following technique. SVM and Tree classifier are used for classification.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115551390","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":"DTM: A Macro Level Tool and Measure for Message Passing Libraries","authors":"N. Pandey, D. Samanta","doi":"10.1109/ADCOM.2007.64","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.64","url":null,"abstract":"In clusters containing heterogeneous systems for harnessing the computing and other resources, distributed computing tools are employed. Task is submitted to a tool and the actual execution is carried out on aggregated network resources. Tools take care of scheduling, distributing sub-tasks and gathering results along with synchronization and message exchange requirements. They need initialization and synchronization routines for the submitted task. These tools also provide features like transparency, fault tolerance and load balancing. The aim of tool designers should be to provide quality performance with add on request initialization and feature provision. Initialization routines and special features provision take their own time over core distributed computing. In this paper, a tool DTM is implemented. DTM serves to achieve macro level parallelization. It may also be used for placing other distributed computing tools on a performance index, judging their start-up and performance.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"27 23","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113976568","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 a Resource Broker for Efficient Resource Management in Grid Environment","authors":"Sarbani Roy, M. Sarkar, N. Mukherjee","doi":"10.1109/ADCOM.2007.79","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.79","url":null,"abstract":"A resource broker is an essential component in a Grid environment that can assist in the selection of a right resource provider for a job in all aspects. In this paper we present the design and implementation of different phases of resource brokering strategies within a multi- agent framework. These strategies help in finding out an optimal usage of resources for executing multiple concurrent jobs in a Grid environment. The paper also presents preliminary results and demonstrates the effectiveness of our strategies.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121366516","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":"Quick Addition of Decimals Using Reversible Conservative Logic","authors":"R. K. James, T. Shahana, K. Jacob, S. Sasi","doi":"10.1109/ADCOM.2007.108","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.108","url":null,"abstract":"In recent years, reversible logic has emerged as one of the most important approaches for power optimization with its application in low power CMOS, nanotechnology and quantum computing. This research proposes quick addition of decimals (QAD) suitable for multi-digit BCD addition, using reversible conservative logic. The design makes use of reversible fault tolerant Fredkin gates only. The implementation strategy is to reduce the number of levels of delay there by increasing the speed, which is the most important factor for high speed circuits.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121789386","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":"Biclustering Expression Data Using Node Addition Algorithm","authors":"B. Borah, D. Bhattacharyya","doi":"10.1109/ADCOM.2007.50","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.50","url":null,"abstract":"Biclustering algorithms simultaneously cluster both rows and columns. This type of algorithms are applied to gene expression data analysis to find a subset of genes that exhibit similar expression pattern under a subset of conditions. Cheng and Church introduced the mean squared residue measure to capture the coherence of a subset of genes over a subset of conditions. They provided a set of heuristic algorithms based primarily on node deletion to find one bicluster or a set of biclusters after masking discovered biclusters with random values. Masking of discovered biclusters with random values interferes with discovery of high quality biclusters. We provide an efficient node addition algorithm to find a set of biclusters without the need of masking discovered biclusters. Initialized with a gene and a subset of conditions, a bicluster is extended by adding more genes and conditions. Thus it provides facility to study individual genes, besides generating a large number of biclusters with different initializations. Biclusters with lower or higher scores within a specified limit can be generated by parameter setting. Use of incremental method of computing score makes the algorithm faster.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124464670","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":"Adaptive Granularity Algorithm for Effective Distributed Load Balancing and Implementation in Multiprotocol Label Switching Networks","authors":"G. Murugesan, J. Jebarani, A. Natarajan","doi":"10.1109/ADCOM.2007.30","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.30","url":null,"abstract":"Multiprotocol label switching (MPLS) is an extension to the existing Internet protocol (IP) architecture. Explicit routing of MPLS facilitates balancing the load by splitting traffic and moving from a congested part of the network to some other part in a well controlled way. To avoid harmful oscillations, splitting ratios are varied only with finer granularity steps. However, finer granularity increases the number of iterations to reach the steady state optimal solutions. To overcome this problem we are proposing an adaptive granularity algorithm for MPLS networks. A numerical method is developed to evaluate the performance of the algorithm. The results show that the link utilization and the mean delay obtained in a reasonable number of iterations are very close to the optimal values and the throughput is improved in MPLS network. The network simulator ns2 version ns2.31 is used for simulation.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123492855","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":"Mathematical Modelling and Simulation of a Buffered Fault Tolerant Double Tree Network","authors":"Sanjay Kumar","doi":"10.1109/ADCOM.2007.89","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.89","url":null,"abstract":"Many Interconnection Networks for large-scale multiprocessor computer systems have been proposed. Of them Multistage Interconnection Networks (MINs) compose a large subset. Multistage Interconnection Networks (MINs) are used to connect processors and memories in large scale scalable multiprocessor systems. MINs have also been proposed as switching fabrics in ATM networks in future broadband ISDN networks. A lot of research and development is reported in the area of Multistage Interconnection Networks of regular architecture, but Multistage Interconnection Networks of irregular architecture are largely ignored. Fault Tolerant Double Tree Network is a Multistage Interconnection Network of irregular architecture. In this paper a new mathematical model is proposed for performance evaluation of the buffered Fault Tolerant Double tree packet switching network under uniform traffic condition. An algorithm to implement this model is also presented and results obtained are compared with the results of simulation. It is shown that as the size of network increases, throughput decreases and delay increases.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130859453","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":"Multimedia Ready Handoff Technique for 802.11 Networks","authors":"Gurpal Singh, Ajay Pal, Singh Atwal, B. S. Sohi","doi":"10.1109/ADCOM.2007.95","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.95","url":null,"abstract":"IEEE 802.11 wireless networks have caught the fancy of wireless service providers and are being very commonly deployed for providing internet access and real time services at public places like airports, hotels and university campuses. We have proposed and implemented a practical handoff technique aimed at reducing handoff latency to less than 10ms. Handoff latency has been reduced by decoupling scanning from handoff execution process. Effect of the proposed scheme on commercial VoIP client, Skype has been evaluated. Effect of the proposed handoff and optimized Background Scan on audio and video streaming has also been investigated. Results show that the proposed handoff scheme casts minimal effect on multimedia VoIP and audio/video streaming traffic and is multimedia ready.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125262901","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 Two-layer Architecture of Mobile Sinks and Static Sensors","authors":"N. Meghanathan, G. Skelton","doi":"10.1109/ADCOM.2007.27","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.27","url":null,"abstract":"We propose a two-layer mobile sink and static sensor network (MSSSN) architecture for large scale wireless sensor networks. The top layer is a mobile ad hoc network of resource-rich sink nodes while the bottom layer is a network of static resource- constrained sensor nodes. The MSSSN architecture can be implemented at a lower cost with the currently available IEEE 802.11 devices that only use a single half-duplex transceiver. Each sink node is assigned a particular region to monitor and collect data. A sink node moves to the vicinity of the sensor nodes (within a few hops) to collect data. The collected data is exchanged with peer mobile sinks. Thus, the MSSSN architecture provides scalability, extends sensor lifetime by letting them operate with limited transmission range and provides connectivity between isolated regions of sensor nodes. In order to provide fault tolerance, more than one mobile sink could be collecting data from a given region or a mobile sink could collect data from more than one region. In the later half of the paper, we discuss several open research issues that need to be addressed while implementing the MSSSN architecture.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"1991 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125516100","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}