{"title":"A Resource Price-adjusting Mechanism for Supply and Demand Balance in Grid Computing","authors":"Lulai Yuan, Guosun Zeng, Xiongwei Mao","doi":"10.1109/PDCAT.2005.42","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.42","url":null,"abstract":"By leveraging economic principles, we present the conception about the supply and demand balance of Grid resources, and propose a price-adjusting mechanism. The mechanism focuses on adjusting the unreasonable prices of both isolated resources and dependent resources, so as to achieve equilibrium prices and promote the global balance of the supply and demand.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"241 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":"121319887","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":"Optimization of Intrusion Detection through Fast Hybrid Feature Selection","authors":"K. Shazzad, Jong Sou Park","doi":"10.1109/PDCAT.2005.181","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.181","url":null,"abstract":"Existing intrusion detection techniques emphasize on building intrusion detection model based on all features provided. But all features are not relevant and some of them are redundant and useless. In this paper, we propose and investigate a fast hybrid feature selection method - a fusion of Correlation-based Feature Selection, Support Vector Machine and Genetic Algorithm - to determine an optimal feature set. An appropriate feature set helps to build efficient decision model as well as reduced feature set lights up the training and testing process considerably. We have examined the feasibility of our approach by conducting several experiments using KDD 1999 CUP intrusion dataset. Experimental results indicate the reduction of training and testing time by an order of magnitude while maintaining the detection accuracy within tolerable range.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"83 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":"124365292","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":"Workflow-based Remote-Sensing Image Processing Application in ImageGrid","authors":"Ran Zheng, Hai Jin, Qin Zhang, Ying Li","doi":"10.1109/PDCAT.2005.254","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.254","url":null,"abstract":"Remote-sensing image processing applications demand large-scale, collaborative processing and storage capabilities. Computational grid can provide abundant powerful computational resources with sharing and cooperation in grid environment. This paper gives an introduction to a collaborative processing mechanism based on workflow technology implemented in ImageGrid. The main idea is to encapsulate all parallel algorithms of remote-sensing image processing into grid services and recombine them with grid workflow to satisfy more and more complex remote-sensing image processing applications. In particular, we describe the architecture of the workflow-based grid system and the processing flow. We also give out the algorithm classification and an example of remote-sensing image processing grid application.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"32 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":"124489694","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 New Tunnel Scheme for Multimedia Communications Traversing NAT/Firewall in NGN","authors":"Gengsheng Zheng, Zhiping Xie, Bo Wang, Guiming He","doi":"10.1109/PDCAT.2005.29","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.29","url":null,"abstract":"A new tunnel scheme for multimedia traversing NAT/Firewall in NGN (next generation network) is presented, which is improved on the basis of MASMCT (Multi-agent System for Multimedia Communications Traversing NAT/Firewall). In this new scheme, we move the controlling agent into private network and incorporate the function of signaling agent in public network into the Softswitch, but we still keep the multiagent architecture. The design can not only speed up the call signaling process but also offer the controlling agent component with protection provided by the firewall. Finally, the performance evaluation of the system is also given based on SIP protocol and G.723.1 coding standard.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"60 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":"127912966","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":"Study of Channel Characteristics of Power Line Communications Networks","authors":"Zhai Mingyue, Li Chunying, Bian Haiying","doi":"10.1109/PDCAT.2005.229","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.229","url":null,"abstract":"Channel characteristics of Power line is very important because power line is not designed for data transmission and hostile for communications. This paper presents the testing results of channel properties of power line communications networks in China. According to the nature of distribution networks, office blocks and residential buildings are tested respectively. The testing results show that the main reason influencing the reliable communication of highspeed data of power line is the attenuation of the highfrequency signal, which exhibits more obviously in the branch of power line. For the multi-layer building, it is almost impossible to use the frequency range from 2MHz to 20MHz to realize the reliable communication from distribution transformer to each user, and it must be solved with the aid of such means as the repeater etc. Considering the signal’s attenuation, the lower frequency range is more suitable for the high-speed data communication of power line. So the frequency range of 2MHz-10MHz is suitable for the high-speed data access system of power line. For the question of attenuation, it can be solved with the aid of relaying technique.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"32 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":"115828603","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 Dataflow Information to Improve Inter-Workflow Instance Concurrency","authors":"Yang Wang, P. Lu","doi":"10.1109/PDCAT.2005.246","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.246","url":null,"abstract":"The control-flow-based design of traditional batch scheduling systems (i.e., Job A must finish before Job B is started) can constrain the concurrency in schedulers for high-performance computing (HPC) workloads. There are two main problems. First, the control-flow graph, representing the workflow, may be inherently limited in its degree of concurrency. Second, if the naming strategy of the input and output files of jobs is simplistic, there may be a filename conflict problem when multiple instances of the same workflow run concurrently.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"11 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":"115901339","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 Coevolutionary Model Based on Dynamic Combination of Genetic Algorithm and Ant Colony Algorithm","authors":"Ming Chen, Qiang Lu","doi":"10.1109/PDCAT.2005.4","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.4","url":null,"abstract":"Precocity, stagnation and phenomenon of long time convergence often emerge from classical genetic algorithm or ant colony algorithm. At the same time, they have different features of convergence in each algorithm. So, a coevolutionary model is presented based on genetic algorithm and ant colony algorithm, which runs one of the above two algorithm and exchanges another by estimating the state of their running. In order to search optimal result of problem, genetic algorithm and ant colony algorithm can run conjunctly in the model. Through the experimentation on symmetric and asymmetric TSP, the outcome shows that compared with other algorithm, the algorithm of the model takes a great improvement in the convergent speed, result optimization and also the avoidance of the precocity and stagnation.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"2 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":"132219351","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":"Parallel Algorithm for Computing Reversal Distance","authors":"Yi-Fei Shen, Guo-Liang Chen","doi":"10.1109/PDCAT.2005.183","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.183","url":null,"abstract":"Computing reversal distance of two signed permutations has gained increasing attention over the last decade with the study of genome rearrangements in computational molecular biology. In this paper, we present a parallel algorithm to computing reversal distance of two signed permutations. Our algorithm consists three parts and runs in O(lg2(n)) time using O(n2) processors in SIMD-CREW model.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"4 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":"132409324","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 Dual-Channel Routing Scheme in Ad Hoc Networks","authors":"Qinghui Wang, Junsuo Sun, Guang-xing Wang","doi":"10.1109/PDCAT.2005.12","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.12","url":null,"abstract":"This paper proposes an on-demand routing scheme called Dual-Channel Routing (DCR) for ad hoc wireless networks that utilizes dual channels dynamically to improve performance. By exploiting dual channels, we can achieve a higher network throughput than using one channel, because dual transmissions can take place without interfering. The IEEE 802.11 standard allows for the use of multiple channels available at the physical layer, but its MAC protocol is designed only for a single channel. Our scheme establishes and utilizes two routes of maximally disjoint paths and distributes them into two different channels respectively. Even if only one of the two routes of the session is invalidated, the source uses the remaining valid route to deliver data packets in two channels alternately. The results of simulation show that our scheme has better network performance.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"14 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":"134422877","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 Balance Heuristics for Synchronous Iterative Applications on Heterogeneous Cluster Systems","authors":"Weizhe Zhang, Mingzeng Hu, Hongli Zhang","doi":"10.1109/PDCAT.2005.162","DOIUrl":"https://doi.org/10.1109/PDCAT.2005.162","url":null,"abstract":"Heterogeneous computing systems are emerging as a computing infrastructure that will enable the use of distributed heterogeneous clusters for a variety of challenging applications. The actual challenge is the load balance for tightly-coupled applications. In this paper, we focus on the important subclass of tightlycoupled applications, synchronous iterative applications and formally define their load balance problem. Two novel static meta heuristic algorithms are proposed for the load distribution: a genetic tabu hybrid search (GTHS) algorithm and a host clustering based iterative search (HCIS) algorithm, when different communication computation ratios are considered. To this end, the analysis and experiment results demonstrate the effectiveness of heuristic algorithms.","PeriodicalId":152233,"journal":{"name":"Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)","volume":"38 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":"134322377","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}