{"title":"Handheld Device Oriented Adaptation Disposal for Web Access","authors":"L. Baolin, Xin Shuai, A. Liang, Tieshuai Li","doi":"10.1109/NPC.2007.94","DOIUrl":"https://doi.org/10.1109/NPC.2007.94","url":null,"abstract":"In mobile environment, because of the handheld devices' capability limitation and diversity, content adaptation becomes an essential technology for web services. In this paper, adaptation for handheld device 's web access is studied. For solving the JSP resource-wrapping problem, a document type definition (DTD) is given for device independent page markup language (DIML)[1]. The problem for collecting the properties and the environment context of devices is solved by defining DTK! (Device logical traits modeling). Finally we describe the adaptation- processing algorithm by using DIML and DTM, and solve the problem for adaptation of massive HTMI pages of Java-based web servers.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"22 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":"121859425","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}
Gong Yue, Wang Yuzhuo, Xu Zhanbo, Ge Shan, Zhao Xin, Fu Huixia
{"title":"The Task Distribution and Scheduling of The Parallel Delivery System for Massive Databases","authors":"Gong Yue, Wang Yuzhuo, Xu Zhanbo, Ge Shan, Zhao Xin, Fu Huixia","doi":"10.1109/NPC.2007.9","DOIUrl":"https://doi.org/10.1109/NPC.2007.9","url":null,"abstract":"A dynamic task distribution and scheduling technology of a message middleware for parallel data delivery on massive database systems is presented. The techniques of computer cluster and parallel processing are used to implement the task definition and distribution, processor scheduling, parallel data delivery for massive different structure databases. It implements the massive data parallel exchange between isomerism databases on a large-scale network and multi layer networks, with the method of database synchronization mechanism , configuration technique.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"18 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":"124460739","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":"Scheduling the Asynchronous Fixed-Priority tasks with Preemption Threshold","authors":"Xiaochuan He, Yan Jia","doi":"10.1109/NPC.2007.114","DOIUrl":"https://doi.org/10.1109/NPC.2007.114","url":null,"abstract":"Fixed-priority with preemption threshold (FPPT) is an important form of real-time scheduling algorithm. However, most of current research works concerning FPPT assume the task priorities are predefined and have a task model which constraints all tasks are released simultaneously. This presumption is too pessimistic. The major contribution of this paper is an appropriate schedulability analysis, based on response time analysis, for supporting FPPT scheduling on asynchronous task set in hard real-time systems. The simulation result illustrate that our approach can improve the breakdown utilization of asynchronous task set by 5%-27%.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"18 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":"121567603","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":"Content-based Search using Term Aggregation and Classification over Hybrid Peer-to-Peer Systems","authors":"Aoying Zhou, Rong Zhang, Q. Vu, Weining Qian","doi":"10.1109/NPC.2007.158","DOIUrl":"https://doi.org/10.1109/NPC.2007.158","url":null,"abstract":"In this paper, we propose a method to support content-based search, one of the challenges in Peer-to-Peer file sharing system. The proposed method is based on a hybrid structure, which is a combination of a Chord ring and a balanced tree. The tree is used to aggregate and classify terms while the Chord ring is used to index terms of nodes in the tree. At every node in the tree, the system classifies terms as either important or unimportant. Important terms of a node, which can distinguish the node from its neighbor nodes, are indexed in the Chord ring while unimportant terms that are either popular or rare terms are aggregated to higher level nodes. Based on the classification, the system can process queries on the fly without the need of global knowledge. Therefore, our system can avoid the problem of bottleneck at nodes keeping global knowledge and the expensive cost of synchronization global knowledge among these nodes. We have done extensive experiments to validate the effectiveness and efficiency of our proposal.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"76 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":"126216786","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":"Querying Graph-Structured Data","authors":"Jiefeng Cheng, Jeffrey Xu Yu","doi":"10.1109/NPC.2007.166","DOIUrl":"https://doi.org/10.1109/NPC.2007.166","url":null,"abstract":"Graphs have great expressive power to describe the complex relationships among data objects, and there are large graph datasets available such as Web data, semi-structured data and XML data. In this paper, we describe our work on querying graph-structured data, including graph labeling methods, reachability joins, and graph pattern matching. We show that we can base on the graph labeling of complex XML and semi-structured data to process path queries and we devise join primitives for matching graph patterns. Novel aspects about using such join primitives for graph pattern matching are addressed.","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":"126035122","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 on Usage Control Model with Delegation Characteristics Based on OM-AM Methodology","authors":"Zhiyong Zhang, Lin Yang, Qingqi Pei, Jianfeng Ma","doi":"10.1109/NPC.2007.103","DOIUrl":"https://doi.org/10.1109/NPC.2007.103","url":null,"abstract":"UCONABC is a basic framework of next generation access control policy Usage Control that is composed of Authorization-oBlige-Condition components, but so far it lacks of important delegation characteristic. The paper analyses the behaviors of delegation in UCON based on OM-AM engineering principles, presents a formalized usage control model with delegation features using BNF Extensions, called as UCOND, and further articulates its hybrid architecture based on Client & Server Delegation Reference Monitors and relative key protocol functions. UCOND is an extension model of UCONABC in the aspect of delegation authorization, and it resolves the delegation question of Usage Control Model. Moreover, we specify delegation procedure of an application for Digital Medium Resource Distribution System.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"17 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":"125262483","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":"DoS Evading Mechanism upon Service Hopping","authors":"Leyi Shi, Chunfu Jia, Shuwang Lu","doi":"10.1109/NPC.2007.59","DOIUrl":"https://doi.org/10.1109/NPC.2007.59","url":null,"abstract":"Motivated by frequency hopping for military environment, this paper introduces a DoS/DDoS evading paradigm through service hopping technique, which changes the service information such as port number or network address pseudo-randomly. A skeleton of DoS evading is established upon hopping tactic. Thereafter, theoretical analysis of evading performance is carried out; experimental validation is well performed on a centralized hopping prototype and a distributed system. Our study shows that faster tactic of port and address hopping can be able to provide better service under DoS attacks; however, excessively faster scheme would cause much service problem because of transmission delay and traffic jam.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"122 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":"128162235","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":"Key Feature and Rule-based Intrusion Detection for Wireless Sensor Networks","authors":"Haiguang Chen, Huafeng Wu, Xiaoping Zhou, Chuanshan Gao","doi":"10.1109/NPC.2007.23","DOIUrl":"https://doi.org/10.1109/NPC.2007.23","url":null,"abstract":"Wireless sensor networks (WSNs) have a wide application. However, they are of interest to adversaries and are susceptible to some types of attacks for they are deployed in unprotected environments. In this paper we use key feature and rule-based intrusions detection for WSNs. In our scheme, we investigate different defense rules and key features in WSNs to build efficient, accurate and effective intrusion detection systems (IDSs). We also propose a moving window function method to gather the current activity data. The scheme fits the demands and restrictions of WSNs. The scheme does not need any cooperation among other monitor nodes. Simulation results show that we proposed IDSs is efficient and accurate.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"15 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":"131964140","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":"Real-time Performance Analysis for Wireless Sensor Networks","authors":"Qiang Zhou, Huagang Xiong, Hengqing Lin","doi":"10.1109/NPC.2007.80","DOIUrl":"https://doi.org/10.1109/NPC.2007.80","url":null,"abstract":"In this paper, an optimal time slot allocation scheme (O-TDMA) supporting hard real-time communication in wireless sensor networks (WSNs) is studied. In mission-critical system, O-TDMA scheme based on TDMA protocol and a real-time performance analysis method based on WCAU (the worst case achievable utilization) are proposed. Analytical proof that O-TDMA has better performance than other schemes is given. Finally simulative examples are presented to promote the conclusion.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"50 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":"128019989","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 Log Analysis Audit Model Based on Optimized Clustering Algorithm","authors":"Hui-qun Yu, Xingjian Shi","doi":"10.1109/NPC.2007.116","DOIUrl":"https://doi.org/10.1109/NPC.2007.116","url":null,"abstract":"In view of the problem how to detect the network unknown attacks, a security log analysis audit model based on optimized clustering algorithm is proposed in this paper. Since the main question which influence the clustering algorithm application in the log analysis is uneasy to determine the network attack type and the cluster number, so we bring forward an optimized cluster algorithm to solve this problem. By means of simulated experiments, this algorithm is proved feasible, efficient and extensible for unknown intrusion detection.","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":"125123334","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}