15th International Conference on Advanced Computing and Communications (ADCOM 2007)最新文献

{"title":"Adaptive Shrinkage Function Optimization by Differential Evolution","authors":"K. K. Gupta, R. Gupta","doi":"10.1109/ADCOM.2007.31","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.31","url":null,"abstract":"In this paper, a new wavelet shrinkage denoising algorithm is presented. The algorithm uses wavelet transform (WT) to extract information about sharp variation in multiresolution images and applies shrinkage function adapting the image features. The features are detected by energy of neighboring pixels, whereas in standard wavelet methods, the empirical wavelet coefficients shrink pixel by pixel, on the basis of their individual magnitude. The shrinkage function is optimized by differential Evolution (DE).","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"1 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":"130264796","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":"Load Balancing on Dynamic Network Using Mobile Process Groups","authors":"A. Vatsa, Punam Bedi","doi":"10.1109/ADCOM.2007.85","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.85","url":null,"abstract":"For efficient utilization of the resources and enhancing the performance of the distributed systems, load balancing is used. Two prevalent algorithms used for load balancing are: Dimension Exchange algorithms and diffusion algorithms. This paper proposes a modified version of diffusion algorithm for load balancing on dynamic networks. We have used the framework of mobile agent groups for reliable and coordinated communication amongst the agents participating in load balancing. Also load balancing is done on priority basis and implicit resource reservation. The proposed scheme can be exactly mapped to the grid computing environment where the grid resources have to be reserved for foreign access and local grid members are to be given higher priority than foreign members. The concept of overlapping groups provides connectivity on the network that is required in the grid for making it sharable and accessible, even in the case of communication failures and broken links.","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":"125281448","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 Flow Control: An Extension to Delayed Fast Recovery","authors":"N. Kothari, Bhavika Gambhava, K. Dasgupta","doi":"10.1109/ADCOM.2007.29","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.29","url":null,"abstract":"The integration of wireless links (terrestrial and satellite) with terrestrial wired networks has been a subject of extensive research keeping in view the performance issues of TCP with wireless links. Performance improvement in SACK TCP has been shown earlier by delaying fast recovery. However, the technique of delayed fast recovery just avoids flow control in case of random loss. If congestion cannot be ruled out, the technique triggers fast recovery and reduces congestion window conventionally without considering degree of congestion in the network. In this paper, an extension to delayed fast recovery algorithm is presented, which determines TCP flow depending on the estimation of congestion. The proposed scheme preserves conventional loss recovery and decouples TCP flow control, which depends on the displacement between two consecutive losses. Simulation based experiments demonstrate noticeable performance improvement with modified SACK TCP on large delay erroneous links. However, the performance is comparable in case of conventional terrestrial wired networks where losses due to congestion are common.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"15 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":"126067910","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":"Fair Routing and Related Optimization Problems","authors":"M. Pióro","doi":"10.1109/ADCOM.2007.121","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.121","url":null,"abstract":"Routing of elastic traffic in the Internet should be fair in terms of bandwidth allocated to individual traffic demands. One fairness principle that can be applied is called max-min fairness (MMF) and requires that the worst bandwidth allocation is maximized and the solution is then extended with maximization of the second worst allocation, the third one, and so on. In this paper we discuss solution algorithms for basic MMF optimization problems related to fair routing in communications networks. Due to lexicographic maximization of ordered quantities, the MMF solution concept cannot be tackled by the standard optimization model, i.e., a mathematical programme. However, one can formulate a sequential lexicographic optimization procedure. The basic procedure is applicable only for convex models, thus it allows to deal with relatively simple routing problems but fails if practical discrete restrictions commonly arising in the communications network context are to be taken into account. Then, however, alternative sequential approaches allowing to solve non-convex MMF problems can be used.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"84 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":"127144482","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 Neural Network Approach to Dynamic Frequency Scaling","authors":"A. Lahiri, N. Bussa, P. Saraswat","doi":"10.1109/ADCOM.2007.15","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.15","url":null,"abstract":"An intelligent dynamic frequency scaling strategy has been proposed in this paper. The technique uses a neural network model to predict the future computational load of the system and uses this information for taking decisions related to frequency scaling. The mentioned policy is highly effective for applications with complex behavior and drastically varying computational load.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"31 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":"122364701","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":"C2WSN: A Two-Tier Chord Overlay Serving for Efficient Queries in Large-Scale Wireless Sensor Networks","authors":"Jiguo Yu, Wenjun Liu, Jingjing Song","doi":"10.1109/ADCOM.2007.51","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.51","url":null,"abstract":"Efficiently locate data is a fundamental problem for future applications of wireless sensor networks (WSNs). It is known that distributed hash table (DHT) based Internet peer-to-peer (P2P) protocols provide near-optimum data lookup times for queries made on networks of distributed nodes. In this paper we propose a novel two-tier Chord based network protocol for serving efficient queries in WSNs (C2WSN), which has a <3(log M+log lambdai) bounded times for data lookup, where M is the number of cluster and lambdai is the maximal number of sensor nodes within a cluster, respectively. Furthermore, in C2WSN a new dynamic rotation mechanism of cluster head is presented, which increases the network lifetime greatly.","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":"123916224","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":"Notice of Violation of IEEE Publication PrinciplesA Dynamic Distributed Diagnosis Algorithm for an Arbitrary Network Topology with Unreliable Nodes and Links","authors":"P. M. Khilar, S. Mahapatra","doi":"10.1109/ADCOM.2007.8","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.8","url":null,"abstract":"This paper presents a distributed network diagnosis (DND) algorithm for an arbitrary network topology where every node needs to record the status of every other nodes and links assuming the nodes and links are subjected to crash and value faults in a dynamic fault environment (the node's or link's status may change during execution of algorithm). The algorithm operates correctly in each connected component if the network is partitioned due to a set of faulty links or faulty nodes. The worst-case bounds for diagnostic latency is at most O(td) rounds where t is the number of dissemination trees and d is the diameter of the network. The proposed approach uses non-broadcasting method of message dissemination that has similar diagnostic latency with flooding [4] and similar message complexity with Chinese Agent [14] method of message dissemination respectively.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"46 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":"124177089","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":"Enhanced Shape Context for Object Recognition","authors":"L.B. Singh, S. Hazarika","doi":"10.1109/ADCOM.2007.67","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.67","url":null,"abstract":"This paper presents an enhanced approach to recognize objects based on a similarity measure obtained from shape context. Typically, shape context computation samples at regular interval on the contour of an object without regard to landmarks. Corner points of an object being landmarks on the contour; set of corner points is a good descriptor of shape. The paper explores the possibility of computing shape context by sampling the corner points using arch height. Sampling on this boundary feature of the object considerably reduces the number of points. Landmark based shape context provides a stricter algorithm on similarity. Shape context based object recognition being an iterative process involving comparisons and transformations, the reduction in the number of sample points provides a basis for faster recognition of similar objects.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"73 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":"114416933","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 Bio-inspired Interpolation Kernel for Medical Image Processing Implemented on DSP Processor","authors":"S. Sarkar, Kuntal Ghosh, K. Bhaumik","doi":"10.1109/ADCOM.2007.6","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.6","url":null,"abstract":"Post processing of medical images often needs interpolation. Taking cues from human visual system, we propose here an interpolation kernel consisting of linear combination of Gaussians at different scales. We compare the efficacy of the proposed kernel with other interpolation kernels, particularly in the processing of medical images. The basic algorithm has been implemented on a TI DM642 based hardware platform for realtime filtering and programmed for post-processing of ultrasound video frames (20 fames/s) from the commercially available Siemens medical ultrasound scanner.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"55 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":"127551869","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":"Using Multimedia Annotation Tool for the Instructional Cues and Explanations","authors":"Jenq-Muh Hsu, Yen-Shou Lai, Pao-Ta Yu","doi":"10.1109/ADCOM.2007.133","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.133","url":null,"abstract":"This paper extends the idea of presenting multimedia information through presentation by developing a PowerPoint Annotation Tool (PPAT) for teachers to insert various annotations into PowerPoint slides. The tool is built on multi-monitor technologies, aiming to make the presentations more instructional. Many studies have shown that annotations can support remembering, thinking, and clarifying to promote learning. In this paper, we use the PPAT to build up the referential connections of visual and verbal learning contents in PowerPoint presentation. Thus, learners can easily comprehend the learning contents through those additional annotations embedded into the slideshow of PowerPoint presentation. In fact, The PPAT is a teaching-aided tool that can extend the comment features of PowerPoint presentation and it also provides a multi-monitor mechanism to display teaching materials and annotations on the same projection screen or the different projection screens according to instructional arrangement for reaching the desired learning effectiveness. The PPAT supports two operational modes: one is authoring mode and the other is presentation mode. A teacher can insert various annotations containing some instructional purposes into a well-designed PowerPoint file in authoring mode, and then the teacher operates presentation mode to present this PowerPoint file. Those annotations will be orderly displayed on PowerPoint presentation among the desired instructional arrangements during authoring mode. From the information displaying viewpoints of PowerPoint presentation by using the PPAT, there are two different displaying views, a teaching view and a learning view, to show teaching contents and learning contents for teacher and students respectively. In the teaching view, the teacher can control all of the thumbnails of PowerPoint slides and their embedded annotations on his/her computer monitor, and display the PowerPoint slides and their embedded annotations in sequence or in parallel on the projection screen. In the learning view, students can see the slides and annotations, if needed, in learning activity. Through the cognitive connection between main learning contents shown by PowerPoint slides and various annotation illustrating instructional comments on the slides, learners can easily and quickly comprehend the learning content to enhance the teaching and learning effectiveness. Keywords: Instructional Cues, Learning Annotation, Multi-Purpose Annotations","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":"128190270","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}