{"title":"AM-Trie: An OC-192 Parallel Multidimensional Packet Classification Algorithm","authors":"Bo Zheng, Chuang Lin, Xuehai Peng","doi":"10.1109/IMSCCS.2006.28","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.28","url":null,"abstract":"Nowadays, many high-speed Internet services and applications require high-speed multidimensional packet classification, but current high-speed classification often use expensive and power-slurping hardware (such as TCAM and FPGA). In this paper, we presented a novel algorithm, called AM-Trie (asymmetrical multi-bit Trie). Our algorithm creatively use redundant expression to reduce the height of Trie; use compression to reduce the storage cost and eliminate the trace back to enhance the search speed further. Moreover, AM-Trie is a parallel algorithm and very fit for the \"multi-thread and multi-core\" features of network processor; it has good scalability, the increase of policy number influences little to its performance. A heuristic field division algorithm is also presented, we proved in theoretical that there exists a minimum storage cost dividing solution when the height of the AM-Tire is given. Finally, a prototype is implemented based on Intel IXP2800 network processor. The performance testing result proves that AM-Trie is high-speed and scalable, the throughput of the TCP/IP 6-tuple classification achieves OC-192 (10 Gbps, 64 bytes per packet, i.e.20 Mpps) wire-speed in all situations","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123930722","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":"CSP-based Study on Distributed PDM and Consistency Control Technique for Aero-Subcontract Production","authors":"Zhi-qiang Jiang, Xi-lan Feng, Z. Hu","doi":"10.1109/IMSCCS.2006.51","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.51","url":null,"abstract":"The distributed product data management (DPDM) is the key effectively of the remote collaborative designing and manufacturing for complex product. A study project on DPDM and consistency control techniques based on collaborative service platform (CSP) in aero subcontract production (aero-SP) is put forwarded. First, in order to settle the problem of data exchange and share, collaborative workflow management among multiple PDM systems are critical processes for geographically distributed design and manufacturing systems. A distributed and open integrated product data management framework was developed based on a collaborative service platform by analyzing the technical performance of distributed product data management. The data communication method and safety assurance mechanism are also discussed. A simple portal is provided Web-based accessing for collaborative manufacturing enterprise, and actualized expediently the data exchange, share, querying and process collaborative management. Second, in order to settle the problem of product data consistency in remote environment among dynamic alliance enterprises in aero-SP, the distributed store strategy of product data based on original and duplicate data cooperation technique is designed and the coordinate process structure based on multi-server cooperation is setup according to the creating position and using attribute of product data. Further more, the initiative and automatic check between the central and secondary product databases among dynamic alliance enterprises is implemented by top-down product data consistency checking technique. All key enabling techniques were practiced in aero-SP of aviation project and the consistency controlling approach was verified","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"18 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120917270","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":"Hill Climbing-Based Decentralized Job Scheduling on Computational Grids","authors":"Qingjiang Wang, Yun Gao, Peishun Liu","doi":"10.1109/IMSCCS.2006.75","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.75","url":null,"abstract":"De-centralized job scheduling is implemented by job migrations between neighboring grid nodes. To optimize node selection of a new-submitted job, the job may be migrated many times. Here, the hill climbing method is used to determine the migration route. Experiments simulate de-centralized job scheduling, including node adjacencies, local scheduling of grid nodes, and grid workload. Compared with k-distributed and auction methods, hill climbing-based scheduling usually can enhance processor utilization, and can reduce bounded slowdown","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132000871","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":"Point Set Surfaces Representations Based on Hierarchical Geometry Images","authors":"G. Mo, S. Zhang","doi":"10.1109/IMSCCS.2006.105","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.105","url":null,"abstract":"Point set surface is attracting more and more attentions in computer graphics and CAD industry, and gradually becoming one of the main 3D model representations. This paper presents a new method for multi-resolution representations of point set surface that is transformed into a set of hierarchical geometry images. The original 3D model can be reconstructed from multi-resolution images step by step. These multi-resolution representations can be applied to progressive network transmission of point set surfaces","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131084568","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":"Tiger HRE Finder - A Tool for Identification of Hormone Receptor Binding Sites in Query Sequences","authors":"M. Stepanova, Lin Feng, V. Lin","doi":"10.1109/IMSCCS.2006.134","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.134","url":null,"abstract":"Prediction of transcription factor binding sites is a crucial challenge in investigation of mechanisms of gene expression regulation. Due to high diversity of different types of transcription factors and their DNA binding preferences, it is difficult to establish an accurate model for recognition of functional regulatory elements in promoters of eukaryotic genes. Here we present a tool for precise prediction of a large group of transcription factor binding sites - steroid hormone response elements. The tool uses large training set of experimentally confirmed steroid hormone response elements, and adapts sequence-based statistic method of position weight matrix, for identification of the binding sites of the query sequences. Accuracy level (considering trade-off sensitivity vs. specificity) is a user-defined parameter and a table of correspondence of the above values is collected from a number of independent tests","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127359212","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":"Ontology Construction for Scientific Visualization","authors":"Lijun Xie, Yao Zheng, Bin Shen","doi":"10.1109/IMSCCS.2006.96","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.96","url":null,"abstract":"Ontology for scientific visualization is constructed in our laboratory. Its framework, construction method and design trade-off decision are presented in this paper. The ontology is composed of four main pillars: dataset, filter, device and pipeline, and they are then further decomposed into many sub-components. Using this concept of ontology can help scientists and engineers in various aspects such as communicating and sharing, quick learning, knowledge reusing, etc. As an application, we developed a semantic grid service for scientific visualization based on this ontology","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115015882","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 Parallel Multi-Class Classification Support Vector Machine Based on Sequential Minimal Optimization","authors":"Jing Yang, Xue Yang, Jianpei Zhang","doi":"10.1109/IMSCCS.2006.20","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.20","url":null,"abstract":"Support vector machine (SVM) is originally developed for binary classification problems. In order to solve practical multi-class problems, various approaches such as one-against-rest (1-a-r), one-against-one (1-a-1) and decision trees based SVM have been presented. The disadvantages of the existing methods of SVM multi-class classification are analyzed and compared in this paper, such as 1-a-r is difficult to train and the classifying speed of 1-a-1 is slow. To solve these problems, a parallel multi-class SVM based on sequential minimal optimization (SMO) is proposed in this paper. This method combines SMO, parallel technology, DTSVM and cluster. Experiments have been made on University of California-Irvine (UCI) database, in which five benchmark datasets have been selected for testing. The experiments are executed to compare 1-a-r, 1-a-1 and this method on training and testing time. The result shows that the speeds of training and classifying are improved remarkably","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122647320","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}
Yunjiao Xue, Leqiu Qian, Ru-zhi Xu, Bin Tang, Xin Peng
{"title":"An Adaptive Agent-Based Network for Distributed Component Repositories","authors":"Yunjiao Xue, Leqiu Qian, Ru-zhi Xu, Bin Tang, Xin Peng","doi":"10.1109/IMSCCS.2006.29","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.29","url":null,"abstract":"The application of component repository has become more and more popular in the practice of component-based software development. Most of the repositories are physically isolated and vary in the classification and specification mechanisms, forming a distributed and heterogeneous network, which hinders the share and reusability of component resource. Therefore, it is important to integrate the distributed component repositories into a logically unified architecture. This paper adopts the intelligent agent-based technique to achieve the adaptive and extensible integration. The network architecture and the structural design of the agents are proposed. Some key issues in the design are discussed further","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129667830","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":"Intelligent Decision Making for Agreement-based Grid Resource Management","authors":"R. Liu, Weimin Zheng, Yongwei Wu","doi":"10.1109/IMSCCS.2006.80","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.80","url":null,"abstract":"Agreement-based resource management is becoming the foundation of grid system. Since the grid resource management encompasses a wide range of different scenarios, the decision making for service level agreement is a complicated procedure. Traditional resource management can not meet the new requirements. In this paper, we analyze and categorize the situations of resource availabilities and requirements. Then, we model each category with fuzzy constraints and propose an algorithm for incremental decision making. We also propose a resource reallocation mechanism for reducing agreement violation. Its efficiency is shown by experiment results","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125283115","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 Apparatus Realizing Switch of Computing Device Status","authors":"Ling Wang, Tong Shao, Shumei Wang, Gongxuan Zhang","doi":"10.1109/IMSCCS.2006.30","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.30","url":null,"abstract":"This paper presents an apparatus to facilitate a switch system of the computing device status. The apparatus includes a memory device to store previous and present computer statuses, a requisition device, and switch control device. By achieving and retrieving all the information about alterable status registers, the apparatus can recognize each switch of operating system status. It can also process multioperating systems in a single compute unit. It functions to recognize rapidly and safely status exchanges between internal and external networks","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131577691","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}