{"title":"Research and Design for IPSec Architecture on Kernel","authors":"Jiang Hanping, Yan Jun","doi":"10.1109/WKDD.2008.75","DOIUrl":"https://doi.org/10.1109/WKDD.2008.75","url":null,"abstract":"Networks are evolving to deliver a flexible mix of data, voice and video content. Application delivery mandates the need to process intelligent layer 2 to layer 7 data and content at line rate. These characteristics demand an improvement high- performance software architecture based on multi-core network processor. It implements the \"low-layer processing\" strategy to design an efficient and flexible kernel performance. The paper design control plane/data plane and fast path /slow path on kernel to implement IPSec.","PeriodicalId":101656,"journal":{"name":"First International Workshop on Knowledge Discovery and Data Mining (WKDD 2008)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123875274","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":"The Components and Practice of Information Technology Governance","authors":"Wei Tu, Jinlong Zhang","doi":"10.1109/WKDD.2008.18","DOIUrl":"https://doi.org/10.1109/WKDD.2008.18","url":null,"abstract":"Previous studies primarily focused on the IT decision allocation in information technology governance, this paper propose that IT governance is part of corporate governance, it is IT related decision making, motivation and constraint mechanism to work out the asymmetric information problem between shareholders and managers and to maximize IT revenue designed by shareholders-centered stakeholders. IT governance is the combine mechanism of the motivation mechanism, constraint mechanism and decision-making mechanism. This paper also investigate 11 companies around Wuhan , China, and find IT governance exists and in the initial stage.","PeriodicalId":101656,"journal":{"name":"First International Workshop on Knowledge Discovery and Data Mining (WKDD 2008)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129980589","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":"Average Fuzzy Direction Based Handwritten Chinese Characters Recognition Approach","authors":"Weiping Zhu, W. Liu, Zhuqing Huang","doi":"10.1109/WKDD.2008.52","DOIUrl":"https://doi.org/10.1109/WKDD.2008.52","url":null,"abstract":"Since handwritten Chinese characters' style is uncertain and differs as people differ, this article brings forward a new Average Fuzzy Direction Code based on weight, so as to conquer traditional fuzzy arithmetic's shortcoming that is without enough generalization capability; At the same time it improves association rules in data mining and applies it to the process of handwritten Chinese characters' generalization and picking up of their abstract attributes. Thus exact denotation of handwritten Chinese characters is resolved, and simultaneously it picks up the handwritten Chinese characters' characteristic and mines improved association rules, and further achieves the purpose of handwritten Chinese characters' quick recognition. Therefore it resolves traditional pattern identification's problem of poor adaptability.","PeriodicalId":101656,"journal":{"name":"First International Workshop on Knowledge Discovery and Data Mining (WKDD 2008)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125076523","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 the eXpressDSP-Compliant Algorithms","authors":"Yun Wu, Yong Zhao, Jianshi Li","doi":"10.1109/WKDD.2008.132","DOIUrl":"https://doi.org/10.1109/WKDD.2008.132","url":null,"abstract":"Digital signal processor (DSP) algorithms are sets of rules that specifies the order and form of arithmetic operations that are used on specified sets of data. The implementation of these DSP algorithms is often very different from one application system to another because systems have, for example, different memory management policies and I/O handling mechanisms. This paper targets these algorithms and assists the reader with making the algorithms compliant with the TMS320 DSP algorithm standard which is part of TI's eXpressDSPTM technology initiative. Finally, the authors briefly introduced DSP architecture optimization for DSP algorithms.","PeriodicalId":101656,"journal":{"name":"First International Workshop on Knowledge Discovery and Data Mining (WKDD 2008)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130544537","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 on the Design of CRM System Based on Business Intelligence","authors":"Li He, Guan Xin, Gong Yufeng","doi":"10.1109/WKDD.2008.107","DOIUrl":"https://doi.org/10.1109/WKDD.2008.107","url":null,"abstract":"This article concerns on analyzing the application of CRM which based on database warehouse, data investigating, data analyzing and processing.lt integrates with CRM system requirements, creating a new system model which is based on commercial intelligent technology.This system will improve enterprises customer recourse, optimize enterprise management mode, integrate the functions of management information system, and unify customer management platform. The system has the important significance in actual application.","PeriodicalId":101656,"journal":{"name":"First International Workshop on Knowledge Discovery and Data Mining (WKDD 2008)","volume":"3995 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127623201","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 the Learning Model Based on Improved ID3 Algorithm","authors":"Ding Rongtao, Ji Xinhao, Zhu Linting, Ren Wei","doi":"10.1109/WKDD.2008.68","DOIUrl":"https://doi.org/10.1109/WKDD.2008.68","url":null,"abstract":"The network learning behavior intelligence analysis system can collect the information of learner's psychology, behavior, methods and effectiveness in the learning process, and classify learners by using the ID3 algorithm based on the internal factors and personality characteristics of learners that influence the learning effect. In order to correct the shortcomings that the ID3 algorithm more inclined to the attributes that have more values in the classification process, we introduce user interest, which used to distinguish the dependence between different information attributes. At the same time, we introduce parameters to reduce the redundancy between attributes, and accelerate the pace of information entropy reducing, then construct a general, expandable senior vocational student model in the intelligence-learning environment.","PeriodicalId":101656,"journal":{"name":"First International Workshop on Knowledge Discovery and Data Mining (WKDD 2008)","volume":"255 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115865794","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 Mining Algorithm Based on Frequent Item Sets","authors":"Wen Yun","doi":"10.1109/WKDD.2008.86","DOIUrl":"https://doi.org/10.1109/WKDD.2008.86","url":null,"abstract":"A new mining algorithm has been put in this paper base on frequent item sets. When affair database and minimum support has changed, this new algorithm can get the new frequent item sets by scanning the undirected item set graph only one time. Its execute efficiency is improved distinctly compared to the traditional algorithm.","PeriodicalId":101656,"journal":{"name":"First International Workshop on Knowledge Discovery and Data Mining (WKDD 2008)","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120939150","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}
X. Feng, Yuanpeng Liu, Haodong Luo, H. Tang, Cai Liu
{"title":"Numerical Simulation during Expansion for Hot Rolling Sheet Strip","authors":"X. Feng, Yuanpeng Liu, Haodong Luo, H. Tang, Cai Liu","doi":"10.1109/WKDD.2008.11","DOIUrl":"https://doi.org/10.1109/WKDD.2008.11","url":null,"abstract":"In order to analyze the procedure of hot rolling sheet strip, the model of expansion of coiler was simulated during sheet strip coiling with FEM. The base of conditions of hot rolling sheet strip coiling regulations, and studying the rules of displacement change law of sheet stripes nodes along coiler innermost layer during coiler expansion with different layer, layer of minimum and safety was yield, when the loop of sheet strip coiled was 2 or 3 layers, its head had the rather larger displacement, and when the loop was 4 or 5, its displacement was nearly a constant value. The studying results were references vales to constitute the least layer before coiler expansion for technicians in field engineering and increase coiling speed.","PeriodicalId":101656,"journal":{"name":"First International Workshop on Knowledge Discovery and Data Mining (WKDD 2008)","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116387491","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":"New ID-Based Signatures without Trusted PKG","authors":"Lingling Xu, Mingqiang Wang","doi":"10.1109/WKDD.2008.93","DOIUrl":"https://doi.org/10.1109/WKDD.2008.93","url":null,"abstract":"In this paper, from bilinear pairings, we propose two ID-based signatures without trusted PKG, which solve the key escrow problem. In the schemes, the PKG is prevented forging a legal user's signature for its traceability. Under random oracle model, our schemes are both proved secure against existential forgery on adoptively chosen message and ID attack, assuming the Computational Diffie-Hellman Problem (CDHP) in Diffie-Hellman group is intractable. By comparison, our schemes have higher efficiency than the existing schemes.","PeriodicalId":101656,"journal":{"name":"First International Workshop on Knowledge Discovery and Data Mining (WKDD 2008)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115180350","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":"The MARS-Based Research about Reliability Judgement of Members of Supply Chain Alliance","authors":"Jiashan Song, Yong Li, Feng Ji, Haoying Sun, Ying Zhu, Cheng Peng","doi":"10.1109/WKDD.2008.114","DOIUrl":"https://doi.org/10.1109/WKDD.2008.114","url":null,"abstract":"Supply chain alliance (SCA) is becoming an important origin for enterprises to win competitive advantages.How to judge reliability of members in SCA is an essential problem for SCA, and is also one of the key problems for members to keep long-term collaboration. The paper constructs a model to judge the members'reliability by multivariate adaptive regression splines (MARS) for the first time. MARS has the attributes of objectivity, effectivity and robust, and it could avoid dependency on subjective factors to some extent, which contributes to a scientific, integrated judgement system,and thus helps the SCA operate steadily and effectively.","PeriodicalId":101656,"journal":{"name":"First International Workshop on Knowledge Discovery and Data Mining (WKDD 2008)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115470782","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}