{"title":"A Novel Clustering Algorithm for Prefix-Coded Data Stream Based upon Median-Tree","authors":"Guangsheng Feng, Huiqiang Wang, Qian Zhao, Ying Liang","doi":"10.1109/ICICSE.2008.103","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.103","url":null,"abstract":"In actual data streams, there are lots of prefix-coded data, which widely existed in applications. What leads to non-ideal performance and clustering result is that the special treatment of these prefix-coded data structure is not considered in traditional clustering algorithm. To deal with this problem, a new concept of median-tree as well as a method of calculating the coding distance is proposed in this paper. Based upon this, a simple algorithm-dfCluster is put forward, which is capable of dealing with the prefix-coded data streams efficiently. Also, the algorithm analysis is presented in depth. At last, the designed experiment demonstrates that dfCluster is more efficient than the naive algorithm to cluster those kinds of data streams, and meanwhile, the performance of our algorithm is not limited by the specified value of k just as in algorithm k-means.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117129986","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 Comprehensive Assessment Method for Network Survivability","authors":"Huiqiang Wang, Jian Wang, Guo-sheng Zhao","doi":"10.1109/ICICSE.2008.85","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.85","url":null,"abstract":"Quantifying survivability for network system helps to give more accurate evaluation and compare different system or monitor the change of system survivability. This paper puts forward a new method that combines uncertain AHP with fuzzy comprehensive assessment technology to build an assessment model for network survivability. Using uncertain AHP acquire the weight value of each factor, and then the comment scores are fuzzed through membership function of fuzzy theory and construct fuzzy matrix, finally we will obtain the quantities evaluating result by adopting fuzzy comprehensive assessment technology. An instance is given to prove the validity and feasibility of using the method for network survivability assessment.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127270458","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 Fast and Efficiency Character Model Method for 3D Game","authors":"Liwei Wang, J. Zhang","doi":"10.1109/ICICSE.2008.57","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.57","url":null,"abstract":"Creating realistic virtual actors is still a great challenge in 3D software environment. In 3D games ,there are many ways for building character model, but the defect of model by these methods is the faces excessive , running too slow and not in line with the requirements of the game. Through practice, I put forward a very effective method. Using this method, we can create a good character model with few faces. My method is summing up several methods and with other orders base on the complex model is already finish. Using my method, we can simulate a model which very similar to the complex model. What important is that it reach the game design requirements.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125291174","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":"Performance Analysis of Rollback Recovery Schemes for the Mobile Computing Environment","authors":"Chaoguang Men, Zhenpeng Xu","doi":"10.1109/ICICSE.2008.8","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.8","url":null,"abstract":"Different from the wired distributed system, the mobile computing system has certain new characteristics, which impact on its checkpointing- rollback recovery schemes. The performance of these schemes primarily depends on the heterogeneous processing speeds, link bandwidth, message arrival ratio and fault rate of mobile hosts. Another special factor that should be considered is handoff which often occurs in mobile networks. New adaptations of well- known recovery schemes had been presented for the mobile environment. However the analysis shows that there is no single recovery scheme that performs well for all mobile environments. In this paper, we analysis how checkpointing and handoff schemes affect performance and effectiveness metrics, and then determine mobile environments where a particular recovery scheme is best suited. We get the optimal checkpointing interval function for minimizing the total execution time in the Logging recovery scheme. Our model allows a fault of mobile host during its recovery procedure.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125551919","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":"Evaluation of Meta-Search Engine Merge Algorithms","authors":"Chunshuang Liu, Zhiqiang Zhang, Xiaoqin Xie, Tingting Liang","doi":"10.1109/ICICSE.2008.38","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.38","url":null,"abstract":"The result integration algorithm is the core of mete-search engine. This paper focuses on evaluating the integration algorithms of meta-search engine, and compares meta-search engine to the general search engine by experiments. An experiment method to determine the priority of participant of meta-search engine is also proposed. The experiment result proved that the meta-search engine could get higher quality searching result on average.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122115102","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 Hyper Topology Hierarchical Trust Model in Professional Grid","authors":"Baoyi Wang","doi":"10.1109/ICICSE.2008.106","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.106","url":null,"abstract":"PKI (public key infrastructures), as a part of GSI (grid security infrastructures), offers basic service for authentication for grid entities. The characteristic of professional grid lies in that the standard is unified and the layer structure is clear. Aiming at the characteristics of professional grid, a hyper topology hierarchical trust model HTHM is proposed. In HTHM, a CA is treated as a hyper topology node, which can extend up and down easily by two kinds of certificates, one is node certificate and the other is root certificate. The model characterizes expandability, sturdy, fine alternation, fault tolerance, etc. Theory and experiments all show that the model can provide high efficiency trusted verification service for grid. At last we give an application example of applying hyper topology hierarchical trust model to electric power grid.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128801848","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 Invalidation Cache Model Based on Ant Colony Algorithm in Mobile Databases","authors":"Yan Chu, Jianpei Zhang, Jing Yang","doi":"10.1109/ICICSE.2008.25","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.25","url":null,"abstract":"Mobile databases are always the core technique of the dynamic data management. Cache technique, as one of the key techniques in mobile databases, is able to reduce the contention of bandwidth and save the power energy. As the character of ant colony algorithm is choice, update, cooperation mechanism, which is accorded with the mobile agent. An invalidation cache model based on ant colony algorithm is proposed. Mobile agents are looked as different ants which are able to divide the work. Thus, the optimum result is received. The experimental results indicate that the enhancement is practical.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126678608","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":"Rapidly Product and Optimize Facial Animation Methods for 3D Game","authors":"Ming Zhao, J. Zhang","doi":"10.1109/ICICSE.2008.15","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.15","url":null,"abstract":"In order to solve the bottlenecks and problems of the complex facial animation of the 3Dgame, a few methods are put forward that include selectively realizing facial animation details of the role in the 3Dgame expressed; using of manual adjustment technology method and morpher animation method to produce role model; use MultiRes method and normal mapping method of animation optimization to solve this problem for more rapid and convenient. Focus on study how to rapidly product and optimize facial animation for 3Dgame. These methods have provided a new way of thinking and achieved good results in the research field.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114759501","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":"Secure Files Management System in Intranet","authors":"Hua Zhang, Jun-feng Diao, Q. Wen","doi":"10.1109/ICICSE.2008.100","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.100","url":null,"abstract":"Documents and source codes is the core assets in an enterprise. For preventing the dates to be leaked, some enterprises don't allow them to be transmitted or copied. This results in the rigid workflows. Others just adopt the software. This results in the compromise of the files. In this paper, a system is proposed based on access control, encryption and digital watermark. The system can prevent the leakage of files in intranets, and avoid rigid workflows. In the system, two digital watermarks are embedded in a file. The first watermark prevents the file to be tampered. The second watermark denotes the security level of the file. Only the file that is embedded second watermark can be transmitted or copied. The file which first watermark is embedded in, is encrypted before the second watermark is embedded. Thus only the authorized users can decrypt the file and read it.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131356301","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 Multiple Patterns Matching Method Based on Added Information","authors":"Lu Jun, Liu Daxin, Han XuJie","doi":"10.1109/ICICSE.2008.56","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.56","url":null,"abstract":"The multiple patterns matching algorithm based on added information is advanced in this paper. It can overcome language problem in some patterns matching algorithm. To reduce collision, the information of multiple continuous bytes is used in matched text. It adopts AVL tree managing index to reduce average searching times. The algorithm also makes use of specifically character of pattern collection to eliminate more collision. It adapts to matching on bigger pattern collection. This algorithm is easy to be translated into parallel pattern matching algorithm.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130230187","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}