{"title":"Design of the Electronic Tags in a Container RFID System","authors":"Guo Xing, Wang Guoxian, Xiao Hanbin","doi":"10.1109/DCABES.2010.159","DOIUrl":"https://doi.org/10.1109/DCABES.2010.159","url":null,"abstract":"This paper presents a case study to apply the RFID (Radio Frequency Identification) technology to dynamically track miscellaneous logistics information of the shipping containers to improve the container transportation management and digitalization level. The system architecture and configuration of the RFID system are illustrated and the requirements of the container RFID system are characterized. The hardware circuit of the electronic tags in an active RFID system is designed. The tags designed are of small volume and low power consumption with an identification sensitive distance up to 20m. The anti-collision mechanism for the electronic tags is discussed and an adaptive anti-collision algorithm based on the slotted ALOHA algorithm is proposed. The proposed algorithm proves that it is effective to improve the message channel utilization rate and the tag identification","PeriodicalId":415246,"journal":{"name":"2010 Ninth International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127284495","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":"Reliability Analysis and Life Prediction of Beam Bridge Based on More Failure Method","authors":"Wang Xiangyang, Z. Pei","doi":"10.1109/DCABES.2010.136","DOIUrl":"https://doi.org/10.1109/DCABES.2010.136","url":null,"abstract":"Structural reliability refers to the probability of structure perform its required functions under stated conditions for a specified period of time, Monte Carlo method and response surface method are used to analyze the structural reliability combine with a example, the feasibility of analyzing reliability with ANSYS software is verified, advantage of response surface method is shown by comparison. Taking a standard long-span prestressed girder bridge for the analysis object, this paper analyzed reliability of structural system in a variety of failure modes and the sensitivity of factors. Further considering the resistance of bridge declined over time, analyzed the time-dependent reliability of bridge system and predicted service life of bridges.","PeriodicalId":415246,"journal":{"name":"2010 Ninth International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"486 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123560655","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":"Image Restoration Based on Parallel GA and Hopfield NN","authors":"Tingting Sun, Xisheng Wu","doi":"10.1109/DCABES.2010.120","DOIUrl":"https://doi.org/10.1109/DCABES.2010.120","url":null,"abstract":"There is distortion phenomenon in image emerge, transmit and record. Image restoration is a process which recover bad image into original image. When we use genetic algorithm for image restoration, there will be premature problem. The paper discusses a new algorithm for image restoration based on combination of parallel genetic algorithm with Hopfield neural network, take the advantage of parallel GA parameter selection and then use Hopfield NN to train sample efficiently. Experiments demonstrate that this optimization method in this paper will overcome premature problem and run more rapidly, as a result obtain a better recovery image.","PeriodicalId":415246,"journal":{"name":"2010 Ninth International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122628875","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":"Residue-Weighted Number Conversion with Moduli Set {2^p-1, 2^p+1, 2^{2p}+1, 2^p} Using Signed-Digit Number Arithmetic","authors":"Changjun Jiang, Shugang Wei","doi":"10.1109/DCABES.2010.132","DOIUrl":"https://doi.org/10.1109/DCABES.2010.132","url":null,"abstract":"By introducing a signed-digit (SD) number arithmetic into a residue number system (RNS), arithmetic operations can be performed efficiently. In this study, an algorithm for residue-to-binary with four moduli set {2^p− 1, 2^p +1, 2^{2p}+1, 2^p} using the SD number high-speed residue addition is proposed. Based on the proposed algorithm, the converters are designed with 2-level binary tree structure of SD number residue additions. The comparison of the new converter using SD number arithmetic and the converter using binary arithmetic yields reductions in delays of 22% and 40% for p=4 and p=8, respectively.","PeriodicalId":415246,"journal":{"name":"2010 Ninth International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114159101","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":"Energy-Efficient Distributed Clustering Algorithm Based on Coverage","authors":"Xu Yi, Xu Yong-qiang","doi":"10.1109/DCABES.2010.13","DOIUrl":"https://doi.org/10.1109/DCABES.2010.13","url":null,"abstract":"Abstract—In the field of wireless sensor network, it is one of the hottest issues of current research that how to maintain the quality of network coverage and balance nodes' energy consumption to optimize the network lifetime. This paper analyzed LEACH (low energy adaptive clustering hierarchy) and proposed an energy-efficient distributed clustering algorithm on coverage (ECAC). In the algorithm, the redundancy degree of coverage and node’s rest energy are considered. Moreover, the distribution of cluster head is more reasonable. Simulation results show that: the improved algorithm can efficiently reduce the network energy consumption and improve the quality of coverage.","PeriodicalId":415246,"journal":{"name":"2010 Ninth International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128770615","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 Node-disjoint Multipath Routing Protocol Based on AODV","authors":"Shunli Ding, Liping Liu","doi":"10.1109/DCABES.2010.70","DOIUrl":"https://doi.org/10.1109/DCABES.2010.70","url":null,"abstract":"Mobile ad hoc networks are typically characterized by high mobility and frequent link failures, so routing protocol is crucially important. Multipath routing can be utilized so that alternate paths are available to reduce link failure. A node-disjoint multipath routing protocol based on AODV was proposed in the paper. The main goal is to discover multiple node-disjoint paths with a low routing overhead during a route discovery. We also pay attention to residuary energy of nodes. Simulation results show that the proposed protocol results in significant performance improvement.","PeriodicalId":415246,"journal":{"name":"2010 Ninth International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124691274","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":"ZigBee Tree Routing Optimize Based on Energy-balanced","authors":"Li Tao, Chai Qiao-lin, Wang Deng-di, Ban Yan-li","doi":"10.1109/DCABES.2010.68","DOIUrl":"https://doi.org/10.1109/DCABES.2010.68","url":null,"abstract":"Aiming at the problem of ZigBee tree routing algorithm in which the solution may not be optimal and some nodes may exhaust the energy as a result of heavy transmissions, an optimized ZigBee tree routing algorithm based on the energy-balance. The optimized algorithm imports neighbor-table and the depth of nodes to make sure the routing local optimal in routing hops. This paper also considers the residual energy of nodes to avoid selecting nodes with low residual energy in routing selection. The simulation result indicates that this improved algorithm can reduce the energy consumption efficiently, maximize the lifetime of the whole network.","PeriodicalId":415246,"journal":{"name":"2010 Ninth International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"201202 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116500663","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":"Distributed Management of Scientific Workflows in SWIMS","authors":"M. El-Gayyar, Y. Leng, A. Cremers","doi":"10.1109/DCABES.2010.73","DOIUrl":"https://doi.org/10.1109/DCABES.2010.73","url":null,"abstract":"Scientific workflows are emerging as a dominant approach for scientists to assemble highly-specialized applications, and to exchange large heterogeneous datasets to automate the accomplishment of complex scientific tasks. Several Scientific Workflow Management Systems (SWfMS) have already been designed so as to support the execution, and monitoring of scientific workflows. Even though, there are still some additional requirements and challenges must be met in order to provide a fully distributed and efficient SWfMS. SWIMS (Scientific Workflow Management and Integration System) environment has been developed trying to examine the nature of these challenges and to accommodate the missing requirements. In this paper we are going to highlight these requirements and show how the workflow management in SWIMS fulfills them.","PeriodicalId":415246,"journal":{"name":"2010 Ninth International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126465447","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":"Performance Comparison of LEACH and LEACH-C Protocols by NS2","authors":"Xinhua Wu, W. Sheng","doi":"10.1109/DCABES.2010.58","DOIUrl":"https://doi.org/10.1109/DCABES.2010.58","url":null,"abstract":"In this work, performance evaluation of LEACH and LEACH-C protocols based on NS2 is depicted, which helps to reveal the regularity how performances of these two routing protocols change with the sink locations. For a more accurate description of this regularity, two novel concepts are proposed, i.e., Sensor Node Distribution Gravity and Distance Metric between sink and Gravity. Simulation results show that a distance threshold area, which is a key factor for choosing between LEACH and LEACH-C protocols, can be achieved.","PeriodicalId":415246,"journal":{"name":"2010 Ninth International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126530246","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}
Jingjing Qi, Qingping Guo, Jiansheng Lin, Ming Zhou, Shesheng Zhang
{"title":"Parallel Particle Swarm Optimization Algorithm of Inverse Heat Conduction Problem","authors":"Jingjing Qi, Qingping Guo, Jiansheng Lin, Ming Zhou, Shesheng Zhang","doi":"10.1109/DCABES.2010.154","DOIUrl":"https://doi.org/10.1109/DCABES.2010.154","url":null,"abstract":"—Inverse heat conduction problem can be found in many engineering fields, and has the characteristics of non-linearity, ill-posedness and massive-computation. In this paper, a parallel Particle Swarm Optimization (PSO) algorithm is proposed to solve inverse heat conduction problem, after choosing parameters determining condition. The numeric results show that the algorithm has high accuracy and can be used in practice.","PeriodicalId":415246,"journal":{"name":"2010 Ninth International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126570136","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}