2009 1st IEEE Symposium on Web Society最新文献_第6页

Study of incentive mechanism and internet behavior of virtual communities 虚拟社区的激励机制与网络行为研究

2009 1st IEEE Symposium on Web Society Pub Date : 2009-09-29 DOI: 10.1109/SWS.2009.5271797

Guofeng Deng, H. Zhou, P. Zhang

{"title":"Study of incentive mechanism and internet behavior of virtual communities","authors":"Guofeng Deng, H. Zhou, P. Zhang","doi":"10.1109/SWS.2009.5271797","DOIUrl":"https://doi.org/10.1109/SWS.2009.5271797","url":null,"abstract":"Developed from the electronic bulletin board (BBS) and news group, the virtual community has become an important model of the Internet gathering thousands of users in all kinds of virtual communities which have great impact on people's real life. In this paper, it is said that all virtual communities are established with the commercial or public service goals, and those goals can only be achieved through user's internet behavior in virtual community. Different internet behaviors have different value degrees and cost of consumption. Similarly, the same is true for the user's own. Virtual community guides the users to a favorable low-cost and high contribution internet behavior through setting the incentive mechanism, whose effectiveness directly determines the establishment of virtual communities to achieve the objectives, as well as how to achieve. However, such incentives could not produce the effect illimitably, only if the induced behavior allows the user to maximize the contribution it can last long. At the same time, this principle of setting of incentive mechanism can be applied to the educational technology, realizing the most valuable information can be browsed by the students as many as possible which is also helpful for student's thinking and moral education levels. This can be fully used in the current internet of young people to implement into the character development and moral education level.","PeriodicalId":241658,"journal":{"name":"2009 1st IEEE Symposium on Web Society","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115651597","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}

引用次数: 5

GCP: A load-balancing tool in e-Science environment GCP: e-Science环境下的负载平衡工具

2009 1st IEEE Symposium on Web Society Pub Date : 2009-09-29 DOI: 10.1109/SWS.2009.5271775

Shoubo Li, Jiazao Lin, Chenyang Zhao, Zhili Zhao, Li Liu, Lian Li

{"title":"GCP: A load-balancing tool in e-Science environment","authors":"Shoubo Li, Jiazao Lin, Chenyang Zhao, Zhili Zhao, Li Liu, Lian Li","doi":"10.1109/SWS.2009.5271775","DOIUrl":"https://doi.org/10.1109/SWS.2009.5271775","url":null,"abstract":"In e-Science environment researchers can submit complex tasks as scientific workflows. However, because the network may be blocked or even interrupted sometimes, it can hinder the researchers to submit tasks, as well as the overload on the server. Additionally, many tasks submitted by researchers may use the same resources, which may result in the overload of the specific resources. Meanwhile, some of tasks may be the same, so it is not necessary to waste the resources and spend extra time to execute the tasks again. Furthermore, it is difficult for the researchers to select the most appropriate resources from multitudinous resources in the e-Science environment. Therefore, in this paper we developed the Grid Computing Pool (GCP) to solve the problems. It contains Client Buffer Pool (CBP) and Server Computing Pool (SCP). CBP deployed on each client is used to save the tasks temporarily to relieve the server load. SCP deployed in grid platform is used to optimize the resource allocation and task execution according to the current condition of the environment. Finally it shows simulations to evaluate the availability and efficiency of the GCP.","PeriodicalId":241658,"journal":{"name":"2009 1st IEEE Symposium on Web Society","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122631576","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}

引用次数: 0

A workflow-based softswitching provisioning system 基于工作流的软交换发放系统

2009 1st IEEE Symposium on Web Society Pub Date : 2009-09-29 DOI: 10.1109/SWS.2009.5271724

Huimin Li, Shufen Liu, Yongchang Cui

引用次数: 0

A publish/subscribe system based on distributed broker management in e-science environment 电子科学环境下基于分布式代理管理的发布/订阅系统

2009 1st IEEE Symposium on Web Society Pub Date : 2009-08-01 DOI: 10.1109/SWS.2009.5271726

Chenyang Zhao, Shoubo Li, Zhiwei Liu, Li Liu, Lian Li

引用次数: 0

Linking via social similarity: The emergence of community structure in scale-free network 通过社会相似性连接:无标度网络中社区结构的出现

2009 1st IEEE Symposium on Web Society Pub Date : 2009-08-01 DOI: 10.1109/SWS.2009.5271769

Yixiao Li, Xiaogang Jin, Fansheng Kong, Jiming Li

{"title":"Linking via social similarity: The emergence of community structure in scale-free network","authors":"Yixiao Li, Xiaogang Jin, Fansheng Kong, Jiming Li","doi":"10.1109/SWS.2009.5271769","DOIUrl":"https://doi.org/10.1109/SWS.2009.5271769","url":null,"abstract":"We propose a simplified model which exhibits community structure, power-law degree distribution and high clustering. Every vertex is a social one with a social identity. The preferential attachment of Barabási-Albert model is incorporated with social similarity. When a newly added vertex makes a new link, it first selects a certain group of vertices with a probability by considering the social distances between it and all existing vertices. This is the linking mechanism via social similarity, simply known as the attraction of homogeneity. Then, in the group, a new edge links the new one to another one using preferential attachment. Via this mechanism, community structure emerges in scale-free networks. Theoretical calculation and implementing a community-finding algorithm both show that the measure of generated community structure increases with the strength of linking via social similarity. Furthermore, we introduce “triad formation” into our model to reproduce a high clustering. Our model is elegant for modeling large-scale social networks with community structure and has potential applications in studying dynamics on networks with community structure.","PeriodicalId":241658,"journal":{"name":"2009 1st IEEE Symposium on Web Society","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121373390","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}

引用次数: 8

The structure of adolescents' online game behaviours 青少年网络游戏行为的结构

2009 1st IEEE Symposium on Web Society Pub Date : 2009-08-01 DOI: 10.1109/SWS.2009.5271808

Shaohua Huang

引用次数: 0