2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery最新文献

{"title":"Secure mobile agent protocol by using signcryption schemes","authors":"Zhang Chuanrong, Z. Yuqing","doi":"10.1109/CYBERC.2009.5342190","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342190","url":null,"abstract":"Mobile agent technology has emerged as a promising paradigm for a number of applications. However, an autonomous agent running on hosts may suffer attacks if the hosts are malicious. Possible targets of attacks include the collected messages and agents' route message. In this paper, by using a novel cryptographic technique signcryption, a new protocol for protecting a mobile agent from malicious hosts is proposed. Due to the use of SL multi-signcryption scheme, our proposed protocol can efficiently provide message confidentiality, message integrity, user authentication and non-repudiation; at the same time, owing to using the domain-verifiable signcryption scheme, our protocol hides the route messages of the mobile agent in such a way that only the agent owner knows all hosts to be visited. Specifically, our protocol can detect tampering situations, and possibly identify the responsible hosts. This is very suitable for protecting a mobile agent from malicious hosts in the electronic commerce web site that searches the best price of the products.","PeriodicalId":222874,"journal":{"name":"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134591028","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":"Column-based RLE in row-oriented database","authors":"Mingyuan An","doi":"10.1109/CYBERC.2009.5342213","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342213","url":null,"abstract":"In database systems, disk I/O performance is usually the bottleneck of the whole query processing. Among many techniques, compression is one of the most important ones to reduce disk accesses so to improve system performance. RLE (Run-Length Encoding) is one light-weight compression algorithm which incurs negligible CPU cost. A lot of work show that, although RLE is one of the most effective compression techniques in column-oriented systems, it is very hard to use due to bad value locality in row-oriented systems where values from multiple attributes are stored in the same page. We propose CRLE (Column-based RLE), one compression algorithm to apply RLE to row-oriented data storage. On row-oriented storage page, CRLE can exploit value locality in individual column and encode values from the same column in run-length format. Experiments show that CRLE can lead to very good compression ratio and performance in spite of row-oriented data storage.","PeriodicalId":222874,"journal":{"name":"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125157707","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 effective multi-classifier strategy for attributes matching in heterogeneous databases","authors":"Baohua Qiang, Tinglei Huang","doi":"10.1109/CYBERC.2009.5342147","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342147","url":null,"abstract":"Attributes matching is crucial to implement data sharing and interoperability across heterogeneous databases. In order to lay a theoretical foundation for our multi-classifier strategy, we analyze the limitations that use a single trained neural network to determine the corresponding attributes. The analyzed result demonstrates the theoretical possibility that different input vectors map the same output vector by a single-trained neural network. This could result in mismatching and consequently decrease the matching accuracy. Based on the theoretical result and instance analysis, an effective multi-classifier algorithm for attributes matching is proposed in this paper. We verify the correctness of our analysis and proposed multi-classifier strategy by using our previous experimental results.","PeriodicalId":222874,"journal":{"name":"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116021340","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 design and implementation of multi-channel video play system for AVI","authors":"Zhao Ren-tao, Z. Zhifang, Tie Jun","doi":"10.1109/CYBERC.2009.5342188","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342188","url":null,"abstract":"To realize the synchronization play of the AVI video files based on the concept of 3D virtual scene and the theory of drawing and display in the Multi-channel scene simulation technology. The system introduces the key technologies, such as the real-time reading of AVI video stream and creating the dynamic texture, Multi-channel scene incision and plotting and edge amalgamation etc. Its design implements five real-time play modes and three display modes in the Multi-Channel Video Play System.","PeriodicalId":222874,"journal":{"name":"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"420 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116529174","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 adaptive rate control for congestion avoidance in wireless body area networks","authors":"Young-mi Baek, Byung-hwa Lee, Jilong Li, Qin Shu, Jihun Han, K. Han","doi":"10.1109/CYBERC.2009.5342200","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342200","url":null,"abstract":"The convergent feature of traffic in wireless body area networks (WBANs) makes congestion in certain areas which are the place of events and/or the location of sensor nodes near a sink. Congestion brings packet loss, retransmission, and delay at the node and it also causes the consumption of additional energy. Therefore there is no doubt that congestion needs to be controlled efficiently. In this paper, we suggest an adaptive rate control for congestion avoidance in WBANs. Our scheme performs rate control dynamically each node based on a predication model which uses rate function including congestion risk degree and valuation function, without requiring congestion detection and congestion notification steps. We carry out the operation of our scheme between the network layer and the data link layer and have demonstrated our rate control to be efficient. We also show that the negative effects from network congestion can be greatly mitigated as compared with a no rate control mechanism.","PeriodicalId":222874,"journal":{"name":"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121529659","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 hierarchical clustering algorithm based on PRAM model","authors":"Yantao Zhou, Zhengguo Wu","doi":"10.1109/CYBERC.2009.5342145","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342145","url":null,"abstract":"An adaptive parallel algorithm for hierarchical clustering based on PRAM model was presented. Performing the data preprocessing depended on “90-10” rule to decrease the numbers of data set, performing the parallel algorithm for creating Euclid Minimum Spanning Trees on absolute graph, performing the algorithm for finding the disjoining strategies and non-collision memory, data set was clustered optimizedly. Data set was clustered on the conditions of non-collision memory, lowest-cost and weakest PRAM-EREW model. N data sets were clustered in O((λn)2/p) time (0.1≤λ≤0.3) performing this algorithm on p processors (1≤p≤n/log(n)). The parallel clustering algorithm based on PRAM model is an adaptive non-collision memory parallel hierarchical clustering algorithm. The calculating time will be greatly reduced after original inputing data are effectually preprocessed through improved preprocessing methods of this thesis.","PeriodicalId":222874,"journal":{"name":"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116771786","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":"PadSpace: A software architecture for the ad hoc federation of distributed visual components and Web resources","authors":"D. Lkhamsuren, Y. Tanaka","doi":"10.1109/CYBERC.2009.5342180","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342180","url":null,"abstract":"In this paper we will propose an extension of a typical Linda-like coordination model (tuplespace) to provide mechanisms for the cooperation of Web applications, Web services and end users' local resources. This new model assumes that all these different types of resources are wrapped into visual components called pads before their cooperation. Pads are defined based on the meme media architecture. This new Linda-like coordination model is called a PadSpace. A PadSpace uses an XML-tuplespace as its core coordination model. The XML-tuplespace is a distributed coordination model that extends the Linda coordination model with the ability to carry XML documents in tuple fields. We call each tuple an XML-tuple. A PadSpace uses the 2D meme media system IntelligentPad as its platform. Linda represents all the available services as tuples and stores them in its tuplespace. It also represents each service request as a tuple, and matches this requesting tuple with a compatible registered tuple representing a service. Similarly, a PadSpace represents Web applications, Web services, and end users' local resources as XML-tuples, and stores these XML-tuples in its core XML-tuplespace. In IntelligentPad, we represent every compound object as a pad. Therefore, we want to represent a service request also as a pad even before it is matched with a specific service, so that we can define a composite application pad using this service request pad without instantiating it to one candidate of the requested service. This service request pad, when matched with some service, works as a proxy of this service. A PadSpace represents such a service request pad as a requesting XML-tuple, and matches this XML-tuple with an appropriate service XML-tuple stored in its core XML-tuplespace. It establishes a connection between this service request pad and the matched service, and makes the service request pad to work as the proxy pad of this service. Using these mechanisms, a PadSpace provides an end user tool for the service composition of Web resources and local resources. This tool enables end users to register Web resources and local application resources into the core XML-tuplespace and to use those shared resources in combination with their own local resources by defining service compositions in the IntelligentPad architecture without writing any program codes.","PeriodicalId":222874,"journal":{"name":"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114584569","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 online clustering algorithm for Chinese web snippets based on Generalized Suffix Array","authors":"Zhang Hui, Wang Han, Yang Gao, Zhou Jingmin","doi":"10.1109/CYBERC.2009.5342183","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342183","url":null,"abstract":"As the information on the Internet increases dramatically, the web search engine has become an indispensable tool to search and locate the required information. Web snippets clustering can classify the search results and help users to narrow the search scope. This paper presents an online clustering algorithm for Chinese web snippets using common substrings. The algorithm firstly preprocesses the results of a search engine and extracts common substrings using Generalized Suffix Array. Then it builds a snippet-snippet similarity matrix by calculating similarities between every two snippets using common substring-based dimensional model. At last, the algorithm groups the web snippets using an improved hierarchical clustering algorithm. Theoretical analysis and experiments show that compared to traditional Chinese web snippet clustering algorithms based on Chinese word segmentation, our algorithm performs better both in the efficiency of clustering and the readability of the generated cluster labels.","PeriodicalId":222874,"journal":{"name":"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124939606","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":"On the impact of erasure coding parameters to the reliability of distributed brick storage systems","authors":"Xiangyu Luo, Yun Wang, Zhuowei Shen","doi":"10.1109/CYBERC.2009.5342197","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342197","url":null,"abstract":"For a given amount of storage overhead, erasure coding offers a higher degree of survivability than pure replication. Consequently, erasure coding attracts much attention these years in the research area of reliable distributed storage systems. Although numerous erasure codes have been put forward, how to choose erasure coding parameters to maximize system reliability has not yet been sufficiently investigated. Erasure coding parameters greatly affect not only system survivability with multiple concurrent failures, but also data repair speed. We propose a method that can quantitatively evaluate these effects. Based on the method, the issue of determining erasure coding parameters is solved. Besides, relationships among other reliability-affecting factors such as storage overhead, repair bandwidth and single brick's properties are also investigated.","PeriodicalId":222874,"journal":{"name":"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122143261","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 attribute reduction algorithm dealing with the incomplete information system","authors":"Jin Zhou, E. Xu, Yanhong Li, Zhuo Wang, Zhixu Liu, Xiangyu Bai, Xuyong Huang, Di Yang","doi":"10.1109/CYBERC.2009.5342171","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342171","url":null,"abstract":"To deal with attribute reduction in incomplete information systems, this paper proposed a direct method of attribute relative reduction based on rough set theory. This reduction algorithm gives the concept of tolerance relationship similar matrix via extending equivalence relationship of rough set theory, which is called tolerance relationship. It introduces the generalized decision function to solve the problem of inconsistency in the incomplete information system. This algorithm uses the tolerance relationship similar matrix to calculate the core attributes of incomplete information systems. It applies attribute significance, which this paper puts forward based on attribute frequency in the tolerance relationship similar matrix, as the heuristic knowledge. And it makes use of binsearch heuristic algorithm to calculate the candidate attribute expansion so that it can reduce the expansion times to speed up reduction. Experiment results show that the algorithm is simple and effective.","PeriodicalId":222874,"journal":{"name":"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131052570","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}