Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)最新文献

筛选
英文 中文
Coverage and Energy Efficient Information Gathering Protocol in Wireless Sensor Networks 无线传感器网络中的覆盖和节能信息采集协议
Xiangwen Liu, Huifeng Hou, Jinya Yang, Hongyi Yu, Hanying Hu
{"title":"Coverage and Energy Efficient Information Gathering Protocol in Wireless Sensor Networks","authors":"Xiangwen Liu, Huifeng Hou, Jinya Yang, Hongyi Yu, Hanying Hu","doi":"10.1109/PDCAT.2005.108","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.108","url":null,"abstract":"Coverage and energy efficiency are two important concerns in wireless sensor networks. In this paper, a coverage and energy efficient (CEE) task assigning strategy is presented. The basic idea of CEE is to assign tasks according to node’s coverage degree and remaining energy. Based on this idea, grid-based coverage and energy efficient (GCEE) information gathering protocol is designed. GCEE is simulated with NS-2. How the various parameters affect the fraction of the survived nodes and the area energy balancing of the network is shown in simulation results.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123194788","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}
引用次数: 1
A Genetic Algorithm Optimized New Structured Neural Network for Multistage Decision-Making Problem 多阶段决策问题的遗传算法优化的新型结构化神经网络
Lei Yang, Yu Dai, Bin Zhang, Yanxiang Gao
{"title":"A Genetic Algorithm Optimized New Structured Neural Network for Multistage Decision-Making Problem","authors":"Lei Yang, Yu Dai, Bin Zhang, Yanxiang Gao","doi":"10.1109/PDCAT.2005.13","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.13","url":null,"abstract":"For the widely use of multistage decision-making problem in our normal life such as in the new research area of dynamic selection of composite web services, this paper exerts all its effort on proposing a new approach to solve such problem. Motivated by neural networks’ high parallel performance and Genetic Algorithm’s powerful computation, a novel Genetic Algorithm optimized neural network is proposed in this paper for this task. In order to make this algorithm more adaptable for multistage decision-making problem, a new neural network structure for implementing the algorithm is proposed which is a modification to the one used by Thomopoulos or Rauch and Winarske.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125716054","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}
引用次数: 2
Design and Implementation of Grid Monitoring System Based on GMA 基于GMA的电网监控系统的设计与实现
Jianwei Liao, Hongbin Cai, P. Jiang, Meirong Chen
{"title":"Design and Implementation of Grid Monitoring System Based on GMA","authors":"Jianwei Liao, Hongbin Cai, P. Jiang, Meirong Chen","doi":"10.1109/PDCAT.2005.118","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.118","url":null,"abstract":"Grid requires scalable mechanisms that can be used to obtain the information of resources in Grid environment. In this paper, we analyzed the aims and main tasks of Grid Monitoring and the advantage of GMA (Grid monitoring Architecture), then proposed a java-based design pattern of Grid Monitoring System (JGMS) on the basis of GMA. The JGMS use special agents to complete the communication between Producer and Consumer in the different grid nodes. So, it can work on different platforms, pass through firewalls and be easy to deploy and use.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114247480","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}
引用次数: 7
A QoS Multicast Routing Algorithm Based on Shrinking-chaotic-mutation Evolutionary Algorithm in IP/DWDM Optical Internet IP/DWDM光互联网中基于收缩混沌突变进化算法的QoS组播路由算法
Xingwei Wang, Pengcheng Liu, Min Huang
{"title":"A QoS Multicast Routing Algorithm Based on Shrinking-chaotic-mutation Evolutionary Algorithm in IP/DWDM Optical Internet","authors":"Xingwei Wang, Pengcheng Liu, Min Huang","doi":"10.1109/PDCAT.2005.39","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.39","url":null,"abstract":"In this paper, a QoS multicast routing algorithm in IP/DWDM optical Internet is proposed. Given a user QoS multicast request, a bandwidth, delay, delay jitter and error rate bounded and cost optimized QoS multicast routing tree is constructed based on the shrinking-chaotic-mutation evolutionary algorithm with the network load balance considered. Simulation results have shown that the proposed algorithm is both feasible and effective to the QoS multicast routing in IP/DWDM optical Internet with the improved search ability and convergence speed to the optimal solution over its counterpart based on the traditional genetic algorithm.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120976111","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}
引用次数: 2
AVS Generic Audio Coding AVS通用音频编码
Ruimin Hu, Shuixian Chen, Haojun Ai, Naixue Xiong
{"title":"AVS Generic Audio Coding","authors":"Ruimin Hu, Shuixian Chen, Haojun Ai, Naixue Xiong","doi":"10.1109/PDCAT.2005.97","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.97","url":null,"abstract":"AVS Audio Coding Standard is the first standard for Hi-Fi audio in China. The framework of AVS Audio was introduced. Many key technologies are described in details, including long/short window switch decision based on energy and unpredictability, integer MDCT for lossless time-frequency transform, square polar stereo coding, and context-dependent bitplane coding for scalable entropy coding. The informal subject test result is given between AVS audio codec and several dominating audio codecs. It is shown that AVS audio codec is enough for Hi-Fi audio applications.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121053017","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}
引用次数: 4
The Research on Decision Approach of Data Dependence in Dynamic Workflow System 动态工作流系统中数据依赖性决策方法研究
Shaomin Zhang, Baoyi Wang
{"title":"The Research on Decision Approach of Data Dependence in Dynamic Workflow System","authors":"Shaomin Zhang, Baoyi Wang","doi":"10.1109/PDCAT.2005.237","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.237","url":null,"abstract":"Aiming at the main defect of typically dynamic workflow systems that is not able to decide automatically the dependences among data in workflows, the Petri-Net is used to model data dependence for the dynamic workflows, the data structure of dynamic workflow denoted by Petri-Net is described in detail. Based on the model and data structure a decision algorithm of data dependence of workflow is proposed, and the complexity of the algorithm is analyzed. The basic idea of the algorithm is to suppose if a workflow can be dealt with normally ( i.e. conform to data dependence ), then there must be a state in the reachable states of DataFlow in which a mark will appear in the postposition place of data transition. Lastly, by a computing example the decision algorithm of dynamic workflow based on Petri-Net is proved to be practical, effective and feasible.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121810041","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}
引用次数: 4
Authentication with controlled anonymity in P2P systems P2P系统中具有受控匿名的身份验证
A. Wierzbicki, A. Zwierko, Z. Kotulski
{"title":"Authentication with controlled anonymity in P2P systems","authors":"A. Wierzbicki, A. Zwierko, Z. Kotulski","doi":"10.1109/PDCAT.2005.95","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.95","url":null,"abstract":"This paper describes a new protocol for authentication in Peer-to-Peer systems. The protocol has been designed to meet specialized requirements of P2P systems, such as lack of direct communication between peers or requirements for controlled anonymity. At the same time, a P2P authentication protocol must be resistant to spoofing, eavesdropping and playback, and man-in-the-middle attacks. The protocol is studied for a model P2P storage system that needs to implement file access rights.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124909950","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}
引用次数: 9
Performance Study of Nonrigid Registration Algorithm for Investigating Lung Disease on Clusters 非刚性配准算法在聚类上调查肺部疾病的性能研究
Fumihiko Ino, Yuya Tanaka, K. Hagihara, H. Kitaoka
{"title":"Performance Study of Nonrigid Registration Algorithm for Investigating Lung Disease on Clusters","authors":"Fumihiko Ino, Yuya Tanaka, K. Hagihara, H. Kitaoka","doi":"10.1109/PDCAT.2005.188","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.188","url":null,"abstract":"This paper presents a performance study of a nonrigid registration algorithm for investigating lung disease on clusters. Our algorithm combines two conventional acceleration techniques in order to achieve fast registration: a data-parallel processing technique for accelerating the registration procedure; and a precomputation technique for reducing the computational complexity. We perform some experiments on three clusters with different CPU and network performance in order to make clear what kinds of acceleration techniques and computing environments provide higher performance. The results show that a cluster with Gigabit Ethernet (GbE) network is the most cost effective solution that reduces registration time from ten hours to ten minutes with a linear speedup.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"195 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122520029","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}
引用次数: 6
An Efficient Topology Maintenance Algorithm Based on Shortest Path Tree for Wireless Sensor Networks 一种基于最短路径树的无线传感器网络拓扑维护算法
Zhong Shen, Yilin Chang, Xin Zhang, Can Cui
{"title":"An Efficient Topology Maintenance Algorithm Based on Shortest Path Tree for Wireless Sensor Networks","authors":"Zhong Shen, Yilin Chang, Xin Zhang, Can Cui","doi":"10.1109/PDCAT.2005.81","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.81","url":null,"abstract":"The topology of a wireless sensor network has a significant effect on the network performance. Although topology control algorithms can optimize the network topology, the resultant topology is usually changeable. In this paper, we focus on how to maintain the network connectivity while reducing the maintenance overhead as some nodes fail. A distributed topology maintenance algorithm based on the shortest path tree is proposed. In this algorithm, nodes in immediate surroundings of a faulty node are first triggered to respond, and if they couldn’t ensure that the network is connected, the other related nodes are further triggered. Simulation results show that the proposed scheme can efficiently maintain the network connectivity with significant reduction in the overhead for topology maintenance.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131195377","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}
引用次数: 3
Wavelength Assignment for Parallel FFT Communication Pattern on Linear Arrays by Lattice Embedding 基于点阵嵌入的线性阵列并行FFT通信方向图波长分配
Yawen Chen, Hong Shen
{"title":"Wavelength Assignment for Parallel FFT Communication Pattern on Linear Arrays by Lattice Embedding","authors":"Yawen Chen, Hong Shen","doi":"10.1109/PDCAT.2005.250","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.250","url":null,"abstract":"Fast Fourier Transform(FFT) represents a common communication pattern shared by a large class of scientific and engineering problems and wavelength assignment is a key issue to increase efficiency and reduce cost in Wavelength Division Multiplexing (WDM) optical networks. In this paper, we propose a new scheme for the wavelength assignment of parallel FFT communication pattern on WDM linear arrays. By lattice embedding, the number of wavelengths required to realize parallel FFT communication pattern on WDM linear arrays significantly improves the known result. Our proposed embedding method also provides a new approach to the hypercube layout problem considering connections dimension by dimension rather than all connections as in the traditional approach.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131537001","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}
引用次数: 7
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书