{"title":"Exception Handling Policies for Composite Web Services and their Formal Description","authors":"Qin Lu, Weishi Zhang, Bo Su, Xiuguo Zhang","doi":"10.1109/NPC.2007.13","DOIUrl":"https://doi.org/10.1109/NPC.2007.13","url":null,"abstract":"This paper presents seven exception handling policies for composite Web services and their formal description method, which aims to formally describe events, conditions and states associated with exception handling during composite Web services execution, further to facilitate the implementation of exception handling for composite Web services. The description method is based on the predication logic and statechart. Predication is used to define concepts and statechart is used to describe the execution process of composite Web services. The exception handling policies are described formally according to how and when the exception handling actions are executed. ECA (event-condition-action) rules are used to express the events, conditions and exception handling actions during exception handling. An application case is presented to show how to describe the exception handling policies using our description method.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116603825","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 Reliable Approach of Establishing Trust for Wireless Sensor Networks","authors":"Guangjie Han, Deokjai Choi, Wontaek Lim","doi":"10.1109/NPC.2007.84","DOIUrl":"https://doi.org/10.1109/NPC.2007.84","url":null,"abstract":"Wireless sensor networks (WSNs), which consist of spatially distributed autonomous sensing and computing devices to monitor physical conditions such as temperature and motion. Under a hostile military environment, sensor networks can be easily attacked by malicious nodes and hostile nodes using the natural cooperation of WSNs. In this paper, we introduce the trust mechanism in the human society into WSNs and propose a more overall trust model without a central trust authority, which provides a reliable approach to establish trust for WSNs. The approach combines all kinds of trust values together, including the direct trust and indirect trust value of nodes. The simulation results show that our trust model can efficiently defend against the attacks of the malicious nodes.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"64 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117037284","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}
Hongwei Zhang, Wan Huang, Jizhong Han, Jin He, Lisheng Zhang
{"title":"A Performance Study of Java Communication Stacks over InfiniBand and Giga-bit Ethernet","authors":"Hongwei Zhang, Wan Huang, Jizhong Han, Jin He, Lisheng Zhang","doi":"10.1109/NPC.2007.113","DOIUrl":"https://doi.org/10.1109/NPC.2007.113","url":null,"abstract":"With the popularity of Java programming language and the progress on Java compiler techniques, people have been trying to use Java to develop applications where C/C++ ruled before. However, to deliver comparable overall run-time performance with C/C++, Java I/O must also keep up with that of C/C++. In this paper, we studied comprehensively the performances of Java communication stacks over InfiniBand and giga-bit Ethernet, and compared them with those of benchmarks written in C. We found the network performance of current version of Sun Java run-time could be parallel with C over giga-bit Ethernet. But for higher performance InfiniBand network, the current communication stacks, mainly the TCP/IP emulation layers, showed rather poor performances. It can be concluded it's necessary to invent new approach to support InfiniBand in Java applications.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128549468","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 Immune Algorithm Based Node Scheduling Scheme of Minimum Power Consumption and No Collision for Wireless Sensor Networks","authors":"Weilian Xue, Zhongxian Chi","doi":"10.1109/NPC.2007.161","DOIUrl":"https://doi.org/10.1109/NPC.2007.161","url":null,"abstract":"The wireless sensor network and artificial immune system are both self-managed distributed systems. This paper aims at finding a better solution to the global optimization problem of power consumption of the sensor network. First, this paper sums up the node scheduling scheme of minimum power consumption and no collision for wireless sensor network into the flexible scheduling problem. Then regard one data transmission at a certain moment as an antigen, and potential routes as antibody, and the power consumption by the node sequence as the fitness, respectively. Finally, the proposed algorithm eliminates the disabled nodes using the immune stabilization to reconstruct the network topology structure and builds the vaccine library by the secondary reaction of artificial immune. The simulation results show that the proposed algorithm can not only avoid the collision among sensor nodes when forwarding data packets, but also solve the global optimization problem of power consumption with fast convergence speed.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128670026","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":"Collaborative Computational Chemical Grid Based on CGSP","authors":"Ying Zhao, Xuelin Shi","doi":"10.1109/NPC.2007.21","DOIUrl":"https://doi.org/10.1109/NPC.2007.21","url":null,"abstract":"Chemical engineering involves the design and manufacturing of new chemical compounds and materials, the analysis of chemical reaction, the simulation of computational fluid dynamics (CFD), and so on. It is complex, time consuming, and expensive. To lower costs and improve efficiency, grid computing is increasingly employed in the chemical engineering. In this paper, we propose a collaborative grid framework for chemical engineering, chemical grid based on China grid support platform (CGSP). It provides a grid computing environment for various chemical applications. This paper also describes the architecture of chemical grid platform and its security service based on virtual organization (VO). At last the applications of chemical grid are presented.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130388760","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 Correctness Criterion for Transaction Management in Loosely Coupled System","authors":"Yubin Guo, Jianqing Xi, Deyou Tang, Ximing Li","doi":"10.1109/NPC.2007.136","DOIUrl":"https://doi.org/10.1109/NPC.2007.136","url":null,"abstract":"At present, most distributed system are loosely coupled. They are usually composed of components by invocation temporarily. Their components are often autonomic and execute independently. As to concurrency control, parallelism in there systems are more than in traditional distributed ones. So that serializability is too strict a correctness criterion to them. This paper divided transactions into atomic units according to semantic information. And interleaving between atomic units of different transactions is permitted to heighten parallelism. This newly proposed correctness criterion is named as weakly serializability. Weakly serializable schedule is non- serializable, but preserves data consistency at a higher level of semantics. Necessary and sufficient Condition of Weakly serializable schedule is presented and proved. Accordingly a distributed algorithm for concurrency control is given also.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126687673","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":"IIPS-ICC: An Intelligent IP-Surveillance Platform Using Interactive Camera-handoff Control","authors":"Chung-Ming Huang, Chia-Ching Yang, Chung-Wei Lin","doi":"10.1109/NPC.2007.121","DOIUrl":"https://doi.org/10.1109/NPC.2007.121","url":null,"abstract":"In this paper, we develop an intelligent IP-surveillance platform using interactive camera-handoff control, which is called IIPS-ICC. In addition to fundamental tele-surveillance functions, the emerging techniques adopted in IIPS-ICC contain flexible surveillance description language, scalable video coding and intelligent data fusion. The proposed camera-handoff control is used to assist client applications in changing a monitoring connection automatically when tracked people move among multiple cameras in a large-scale surveillance environment, e.g., hospital. According to experimental results, IIPS-ICC would be a feasible solution to provide more reliable and scalable surveillance services in the next-generation IP surveillance system.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123884064","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 Web Page Segmentation Algorithm Based on Iterated Dividing and Shrinking","authors":"Cao Jiuxin, Mao Bo, Luo Junzhou","doi":"10.1109/NPC.2007.63","DOIUrl":"https://doi.org/10.1109/NPC.2007.63","url":null,"abstract":"Based on image processing technology and the web page special characteristics, a new web page segmentation algorithm - Iterated Dividing and Shrinking Algorithm is proposed. Image dividing conditions are introduced, and the dividing zone concept is given. Based on that, the web page is first transformed into image, and then by shrinking and splitting repeatedly, the image is divided into sub- images which are consentaneous in vision. Experiments show that the algorithm is suitable for web page segmentation, and does well in expansibility and performance.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"5 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114122562","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":"Decision Tree Algorithm based on Sampling","authors":"Xudong Song, Xiaolan Cheng","doi":"10.1109/NPC.2007.133","DOIUrl":"https://doi.org/10.1109/NPC.2007.133","url":null,"abstract":"As the size of the database increases, data mining algorithm faces more demanding requirements for efficiency and accuracy. Data mining for large data sets require large amounts of time and physical resources. Sampling is introduced as an effective method. Facing large data sets, a new decision tree algorithm based on sampling is put forward. It can select small initial samples with similar distribution to the original data sets to study, and stop sampling according to the time complexity requirements and convergence criteria. Comparing with the existing flexible decision tree algorithm, the algorithm can reduce the computation time and I/O complexity, while maintaining the accuracy of the tree.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124076175","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":"Research of the Apriority Policy-based Multi-hop BFS Search Algorithm in P2P Network","authors":"Zhe Chen, Shize Guo, Yixian Yang, K. Zheng","doi":"10.1109/NPC.2007.15","DOIUrl":"https://doi.org/10.1109/NPC.2007.15","url":null,"abstract":"Peer-to-Peer (P2P) network is a fast developing branch of Computer Science and many researchers are developing new algorithms for such systems. After the success of systems like Napster, Kazza, the use of such networks became a necessity. This paper analyses the reason of the redundant search packets in the area of resource discovery and search of the P2P system, details in the Multi-hop BFS algorithm and the apriority policy-based model, puts forward the apriority policy-based multi-hop BFS search algorithm and gives the correctness proof of APM-MHBFS.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132059198","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}