{"title":"Research of Automatic Marking on SQL Server Skill Assessment Based on XML","authors":"Y. Chen, Huantong Chen","doi":"10.1109/WISM.2010.45","DOIUrl":"https://doi.org/10.1109/WISM.2010.45","url":null,"abstract":"Aiming at the lack of SQL Server skill assessment system at present, in this paper a model of automatic marking on SQL Server skill operation based on XML is proposed after analyzing the existing logically formalized automatic marking technology. And the implementation principles and processes are introduced with focuses on two critical technical links: XML formalized expression and XML formalized automatic marking. It is proved that automatic marking on SQL Server skill operation based on XML is superior to manual marking in marking effectiveness.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"29 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133618079","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}
Wandui Mao, Shi Yin, Lihua Wang, Changxin Shao, Y. Qu
{"title":"Expert-Application Grouping and Matching Algorithm","authors":"Wandui Mao, Shi Yin, Lihua Wang, Changxin Shao, Y. Qu","doi":"10.1109/WISM.2010.108","DOIUrl":"https://doi.org/10.1109/WISM.2010.108","url":null,"abstract":"Objects grouping and matching simultaneously is an important means in grouping heterogeneous objects. In order to group and match the experts and applications in project-reviewing, the Expert-Application Algorithm is proposed in this paper, which is based on the co-clustering using Bipartite Spectral Graph Partitioning. In this algorithm, the number of the expert and application are configured at first. And then, the relationship between experts and applications are depicted as a bipartite graph model. The edge-weight is calculated by the relationship weight calculating formula witch is proposed in this paper. After decomposing the matrix witch is formed by the edge-weight, we get eigenvectors. At last, experts and applications are grouped and matched through mapping to the groups of the eigenvectors which are created by k-means grouping algorithm.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130448865","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 Study on the Dynamic Web Service Composition Based on Stochastic Petri Net","authors":"Xianwen Fang, Jinpeng Zhang, Zhixiang Yin","doi":"10.1109/WISM.2010.49","DOIUrl":"https://doi.org/10.1109/WISM.2010.49","url":null,"abstract":"In order to improve the utilization rate of network resource, an approach of selecting the optimal web service composition based on stochastic Petri net was proposed. According to the user requirements, Incidence matrix was obtained, then using the basic solutions of nonhomogeneous linear equation set, all potential plans of service composition were gained. And the generalized stochastic Petri net (GSPN) was employed to analyze the performance of the plan. This presented method takes full advantages of Petri nets in the description, analysis and evaluation of the distributed systems, can obtain the optimal plan of web service composition, so it has very good practical value. Theoretical analysis and experimental results indicate that this method owns both lower computation cost and higher success ratio of service composition.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130998271","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 Research of Multi-information Dissemination Models and Simulation","authors":"Shujing Li, Fengjing Shao, Rencheng Sun, Yi Sui","doi":"10.1109/WISM.2010.89","DOIUrl":"https://doi.org/10.1109/WISM.2010.89","url":null,"abstract":"Many phenomena can be regarded as multi-information dissemination existing simultaneously in nature and society, and interaction exists in the course of different information dissemination. Taking complex network as system model complex network dynamics theories are adopted. Multi-information dissemination models are researched and explored in the same system in which multi-information dissemination exists simultaneously. For the process of multi-information dissemination simultaneously existing, there are some problems about dissemination states, such as diversity and complexity. Expression methods and state transition models are given in the interaction of different multi-information dissemination. And the formal description of node states is also given. The rules and regulations of multi-information dissemination, interaction and infection are defined. In the end, three kinds of information dissemination existing simultaneously in a BA complex network as an example, model simulation and analysis are given.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132556590","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":"Algorithm of the Text Copy Detection Based on Topic Bag","authors":"Sen Wang, Yu Wang","doi":"10.1109/WISM.2010.159","DOIUrl":"https://doi.org/10.1109/WISM.2010.159","url":null,"abstract":"In order to resolve the current problem about seriously academic plagiarism in the web environment, this article proposes an algorithm of the text copy detection on the topic bag and the algorithm uses the idea of semantic clustering and multi-instance learning. Firstly, a paper is divided into three layers construction tree: a leaf node denotes a sentence; a branch node represents a topic bag, and the topic bag formed by semantic clustering of several paragraphs; the uppermost a root node is a text. Secondly, the similarities of topic bags are calculated by the similarities of sentences; then we can get the similarity of two papers by similarities and weights of topic bags. Experiments show that the proposed algorithm has higher accuracy.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"3 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132125234","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 Study on the Dynamic Mechanism of Group Investment and Local Economic Development","authors":"Weixiang Xu, Zhigang Zhang","doi":"10.1109/WISM.2010.52","DOIUrl":"https://doi.org/10.1109/WISM.2010.52","url":null,"abstract":"The relationship of the group investment and local economic development is not simply influenced, but the relationship of dynamic correlation which can mutually influence and promote each other. This paper establishes a system dynamic model of group investment and local economic development by applying the system dynamics, and analyzes typical cases. The result shows that group investment promotes local economic development, and the local economic development and the improvement of industrial environment also attract more group investment, these two sides form a virtuous cycle that can improve each other.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"6 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133913918","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 Hybrid Algorithm for the Circular Packing Problem with Constraint of Equilibrium","authors":"Jinmin Wang, Yang Qi, Yong-gang Li","doi":"10.1109/WISM.2010.172","DOIUrl":"https://doi.org/10.1109/WISM.2010.172","url":null,"abstract":"The circular packing problem is widely found in applications such as production, shipbuilding and aerospace. By combining simulated annealing with particle swarm optimization, a hybrid algorithm for the circular packing problem with constraint of equilibrium is presented. In order to enhance algorithm’s search ability and get out of local minima, some strategies can be used such as eliminating overlapping, inner attraction, exterior press, twice cycle. The computated results of example are provided and compared with that of some other algorithms.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122609482","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":"Chinese Web Information Retrieval Based on Shallow Parsing","authors":"Zhi-qun Chen, Qili Zhou, Rong-bo Wang","doi":"10.1109/WISM.2010.133","DOIUrl":"https://doi.org/10.1109/WISM.2010.133","url":null,"abstract":"To improve the retrieval performance, shallow parsing technique for text was introduced for Chinese Web information retrieval. Firstly, predicate, prepositive nominal component and succedent nominal component close to the predicate were extracted from Chinese sentence. Then, semantic vector of Chinese text was acquired based on converting predicate and nominal component to conception. An algorithm was presented for similarity calculating of semantic vector, and a Chinese Web information retrieval model was designed. The model evaluates the matching degree between indexed documents and users’ interests based on semantic similarity calculating. Users’ interests were expressed by delivering representative documents. Experimental results show that the precision is improved observably compared with the popular Web search engine.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122901604","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 Intelligent Topic Web Crawler Based on DTB","authors":"Ming-sheng Zhao, Peng Zhu, Tianchi He","doi":"10.1109/WISM.2010.155","DOIUrl":"https://doi.org/10.1109/WISM.2010.155","url":null,"abstract":"Web crawling is a fundamental step in many Web applications, such as search engine and data mining. This paper proposes an intelligent topic Web crawler based on DTB (dynamic topic base), which through studying on Web crawlers which filter URLs based on different methods. This Web crawler can update the topic base automatically and improve the accuracy of URL filtering. Experimental results show that the proposed Web crawler can fetch more topic relevant Web pages by crawling less Web space and in less time.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127759200","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 Cluster Routing Strategy Based on ZigBee","authors":"Rui Liu, Q. Guo, Yong Fu, Xianglong Kong","doi":"10.1109/WISM.2010.143","DOIUrl":"https://doi.org/10.1109/WISM.2010.143","url":null,"abstract":"Zigbee is a wireless technology as an open global standard used in many applications such as interconnecting sensors, monitoring and automating home, medical, industrial, and agricultural systems where low power consumption are needed. Based on the ZigBee network, a good routing protocol has to be scalable and adaptive to the changes in the network topology. Thus protocols must perform well as the network grows larger or as the workload increases. In this paper we improved a new cluster routing protocol(called AODV Cluster). Fistly, AODV Cluster divides the ZigBee network topology into one or more logical clusters, A cluster label uses the ZigBee address allocation, the one cluster can share a new routing, which saved on energy of the network and reduced communication quantity. Simulation results shows that this protocol not only keep the AODV merit, but also advanced the scalability. Especially in dense network, performance is superior than AODV.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121278783","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}