{"title":"A Selfish-SCM Based Scheme for Node Clustering in Decentralized Peer-to-Peer Networks","authors":"Yanxiang He, Haowen Liu","doi":"10.1109/ICICSE.2008.17","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.17","url":null,"abstract":"Node clustering has wide ranging applications in decentralized peer-to-peer (P2P) networks such as P2P file sharing systems, mobile ad-hoc networks, P2P sensor networks and so forth. We are interested in the dynamic cluster formation process and effective strategy designs of the nodes in a network. In this work, We propose a completely distributed approach for node clustering that based on the scaled coverage measure (SCM), a measure of the accuracy of the partition of the network into clusters. The novelty of our approach is to allow simultaneous adjustment by each node in joining a new cluster if it sees an immediate benefit from such a change. The acceptance of the new node in the cluster is determined by the improvement of the cluster in its SCM value. Simulation study shows that our approach derives a more accurate partition with less orphan nodes, and converges faster than previously proposed methods, for both random topologies and power law topologies.","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":"122905622","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}
Jie Shen, Yan Zhu, Hui Zhang, Chen Chen, Rong-shuang Sun, Fa-yan Xu
{"title":"A Content-Based Algorithm for Blog Ranking","authors":"Jie Shen, Yan Zhu, Hui Zhang, Chen Chen, Rong-shuang Sun, Fa-yan Xu","doi":"10.1109/ICICSE.2008.11","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.11","url":null,"abstract":"Due to the different structure and content character of blogs, the traditional ranking algorithm of Web page turns to be insufficient. To solve this problem, a novel ranking algorithm of blog is presented. The algorithm considers both the link analysis and the content analysis of the blog, It helps mining more implicit features of blog, such as common topics, to improve the satisfaction of the users. The experimental results show that the proposed method can improve retrieval performance obviously.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"67 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":"116143728","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 Semantic Trust Modeling Method for Service Composition","authors":"Xiaoqin Xie, Bailing Du, Miao Hu, Zhiqiang Zhang","doi":"10.1109/ICICSE.2008.19","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.19","url":null,"abstract":"This paper presents a semantic trust modeling method and SCTM model for service composition. The idea of social network is used in modeling and the issues of trust are analyzed from the service composition perspectives. How to calculate the multidimensional trust value of a service is illustrated also. Finally the implementation framework of the corresponding modeling tool is given.","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":"126822788","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}
Zesheng Wang, RuiLin Xu, Kang-Kang Zhang, Dali Feng
{"title":"Design and Implementation of RAS-Based Reusable Asset Management Tool","authors":"Zesheng Wang, RuiLin Xu, Kang-Kang Zhang, Dali Feng","doi":"10.1109/ICICSE.2008.63","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.63","url":null,"abstract":"In order to manage asset library effectively, this paper represents an approach of RAS-based asset management. The paper firstly extends the default component profile of RAS to improve software reuse, and then present tool's architecture based on the extended RAS, which is divided into main system and assistant system according to the function of every part of the tool. Finally, the tool is implemented to show that this solution is feasible and effective.","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":"128159554","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":"xIR: Logic Inference-Based Retrieval Method for XML","authors":"Peiguang Lin, Guangyan Liu, Kangkang Zhang, Zhizheng Zhou","doi":"10.1109/ICICSE.2008.71","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.71","url":null,"abstract":"In order to improve the precision and recall of XML documents retrieval method, xIR (logic inference-based retrieval method for XML), a new retrieval method and a xIR-based retrieval model were presented. xIR convertes the XML documents into ontology-based knowledge base firstly, so that we can carry out the retrieval by use of the ability of ontology's inference. This method not only was convenient for common user but made full use of the tree structure of XML document and the ability of ontology's inference. The experiment indicated that this method can promote the performance of XML retrieval.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"205 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":"131856527","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 Autonomic Evaluation Model of Complex Software","authors":"Haitao Zhang, H. Whang, R. Zheng","doi":"10.1109/ICICSE.2008.30","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.30","url":null,"abstract":"Based on the conception and characteristics of autonomic computing, the relation between complexity and autonomic characteristics is discussed. Adopting AHP, an autonomic evaluation model of complex software is proposed, which has three levels: complexity, autonomic characteristics and quality of software. In this model, fuzzy transformation matrix and weight matrix of each hierarchy in factor metrics are given, by which, evaluation result of each hierarchy and the final comprehensive evaluation result can be calculated. According to the result, autonomic maturity test of complex software system has the significance of application and practice.","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":"132039414","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}
Yunfa Li, Hai Jin, Deqing Zou, Sanmin Liu, Zongfen Han
{"title":"An Authenticated Encryption Mechanism for Secure Group Communication in Grid","authors":"Yunfa Li, Hai Jin, Deqing Zou, Sanmin Liu, Zongfen Han","doi":"10.1109/ICICSE.2008.80","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.80","url":null,"abstract":"In grid computing, group communication is an important strategy to realize large-scale information resource sharing. However, it is very difficult to ensure the security of group communication in large-scale grid environment. In this paper, based on the basic theories of threshold signature and the basic characteristics of group communication in grid, we present four algorithms, including keys generating, individual signature generating and verifying, group signature generating and encrypting, decrypting and group signature verifying, which constitute the authenticated encryption mechanism for group communication in grid. Finally, we validate the correctness of the authenticated encryption mechanism proposed in this paper and analyze its security. In addition, the validity of this mechanism is verified by the experiments. The results show that it is efficient to ensure the security of group communication in grid.","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":"129374061","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":"Forecasting Day Ahead Spot Electricity Prices Based on GASVM","authors":"Wei Sun, Jie Zhang","doi":"10.1109/ICICSE.2008.50","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.50","url":null,"abstract":"Price is the key index to evaluate the market competition efficiency and reflects the operation condition of electricity market for electricity market decision-making. This paper illustrates the characteristics and methods of the electricity price forecast. In this article, we forecast electricity spot prices at a daily frequency based on one new classification techniques: genetic algorithm improved least square support vector machines (LSSVM). As a benchmark, an artificial intelligence neural network is used as specification. We find that in forecasting of the electricity price, in general ANN is not good enough, but the improved nonlinear regression of LSSVM forecasts are more accurate than the corresponding individual forecasts. Based on the characteristics and contributing factors of electricity price, this paper introduce a better method for electricity price forecasting, Finally, key issues in the electricity price forecasting are discussed whilst some hot topics for further work are also presented.","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":"114068509","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 of a New Trust Model Grep-1 for Peer-to-Peer Networks","authors":"Shaomin Zhang","doi":"10.1109/ICICSE.2008.108","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.108","url":null,"abstract":"Based on analyzing the existing trust model in P2P networks, especially the trust model-Grep thoroughly, aiming at the shortcomings of Grep model, this paper proposes a new trust model,-Grep-1 which realizes the dynamic changes of the peer's reputation as well as determines trust level of peers based on the importance of trade. Then we also designs an introducer protocol in the Grep-1 model that is used by peers to find an appropriate to build trust relationship with the peer he does not know before, which can transmit the trust farther. At last, we deal with the implementation of Grep-1 model. The corresponding theory proves that the Grep-1 model is more effucient and objective to P2P E-commerce translations.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"8 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":"123936212","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":"Optimization of Flow Control Mechanism in iSCSI","authors":"Nianmin Yao, Shaozhen Wang, Jianming Zhao","doi":"10.1109/ICICSE.2008.22","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.22","url":null,"abstract":"This paper presents a method to improve the performance of the storage network. There are two parameters which are very important to the performance of the storage network. They are congestion window in the TCP layer and max burst length in the iSCSI layer. They both have the similar function that controls the flow of the network. When the network is busy, they both become smaller and vise versa. But because the TCP layer is lower than the network storage layer, it can detect the network state earlier. The time to change these parameters is different and the max burst length is always changed later. So there is a period in which the max burst length is not match the network state perfectly which can diminish the utilization of network bandwidth. The method which changes these two parameters simultaneously is presented in this paper and its results are proved by the experiments. This optimization can be applied in most of the network storage system in the market.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"20 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":"124888250","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}