2013 Ninth International Conference on Semantics, Knowledge and Grids最新文献_第2页

An Improved Genetic Algorithm for Cost-Effective Data-Intensive Service Composition 基于改进遗传算法的高效数据密集型业务组合

2013 Ninth International Conference on Semantics, Knowledge and Grids Pub Date : 2013-10-03 DOI: 10.1109/SKG.2013.19

Lijuan Wang, Jun Shen, Junzhou Luo, Fang Dong

{"title":"An Improved Genetic Algorithm for Cost-Effective Data-Intensive Service Composition","authors":"Lijuan Wang, Jun Shen, Junzhou Luo, Fang Dong","doi":"10.1109/SKG.2013.19","DOIUrl":"https://doi.org/10.1109/SKG.2013.19","url":null,"abstract":"The explosion of digital data and the dependence on data-intensive services have been recognized as the most significant characteristics of IT trends in the current decade. Designing workflow of data-intensive services requires data analysis from multiple sources to get required composite services. Composing such services requires effective transfer of large data. Thus many new challenges are posed to control the cost and revenue of the whole composition. This paper addresses the data-intensive service composition and presents an innovative data-intensive service selection algorithm based on a modified genetic algorithm. The performance of this new algorithm is also tested by simulations and compared against other traditional approaches, such as mix integer programming. The contributions of this paper are three folds: 1) An economical model for data-intensive service provision is proposed, 2) An extensible QoS model is also proposed to calculate the QoS values of data-intensive services, 3) Finally, a modified genetic algorithm-based approach is introduced to compose data-intensive services. A local selection method with modifications of crossover and mutation operators is adopted for this algorithm. The results of experiments will demonstrate the scalability and effectiveness of our proposed algorithm.","PeriodicalId":368828,"journal":{"name":"2013 Ninth International Conference on Semantics, Knowledge and Grids","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121673702","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}

引用次数: 22

Designing a Hierarchical Graph Kernel for Semantic Link Network 面向语义链路网络的分层图核设计

2013 Ninth International Conference on Semantics, Knowledge and Grids Pub Date : 2013-10-03 DOI: 10.1109/SKG.2013.33

Zhiying Zhang, Li Peng, Zhixing Huang

引用次数: 0

Query Expansion Based on the Distance Constraint Activation of Human Memory 基于人类记忆距离约束激活的查询扩展

2013 Ninth International Conference on Semantics, Knowledge and Grids Pub Date : 2013-10-03 DOI: 10.1109/SKG.2013.17

Xiaoyu Zhao, Xiangfeng Luo

{"title":"Query Expansion Based on the Distance Constraint Activation of Human Memory","authors":"Xiaoyu Zhao, Xiangfeng Luo","doi":"10.1109/SKG.2013.17","DOIUrl":"https://doi.org/10.1109/SKG.2013.17","url":null,"abstract":"Query Expansion is usually used to enhance user's query in document retrieval and knowledge recommender system. It aims to help user extend the original query to resolve the problems of user's fuzzy demand and limited domain knowledge when user faces complex knowledge demand. Current researches extend user's query mainly based on statistical method while the characteristics of human memory retrieval process are seldom taken into account. However, the process of human memory retrieval has good ability of extending the query when human faces fuzzy demand and limited domain knowledge. In this paper, we put forward a new model for Query Expansion based on the Distance Constraint Activation model of human memory. We build up the ALN (Association Link Network) of documents corpus to imitate human memory network and do the Distance Constraint Activation process on it in order to offer user Query Expansion service in accordance with the pattern of human memory retrieval process. Comparing with the traditional Query Expansion methods, our method is able to provide the semantic relation expansion and the semantic community expansion to the user. All these expansions aim to help user understand his/her demand or extend his/her knowledge in the domain corpus more easily. Several examples given in the experiments show that the semantic-close terms our method provides make the expansion terms more semantic coherent. And the semantic relations and semantic communities can give user a brief description of the knowledge to further understand his/her demand and extend his/her domain knowledge.","PeriodicalId":368828,"journal":{"name":"2013 Ninth International Conference on Semantics, Knowledge and Grids","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122995993","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}

引用次数: 1

Rule Based Faceted Navigation on Semantic Link Network 基于规则的语义链接网络分面导航

2013 Ninth International Conference on Semantics, Knowledge and Grids Pub Date : 2013-10-03 DOI: 10.1109/SKG.2013.40

Bei Xu, H. Zhuge

引用次数: 1

3-Hop: A Novel Hop-Based Reachability Index 3-Hop:一种新的基于跳数的可达性指标

2013 Ninth International Conference on Semantics, Knowledge and Grids Pub Date : 2013-10-03 DOI: 10.1109/SKG.2013.21

Xiaorui Jiang, Xiaoping Sun, Qiang Zeng, H. Zhuge

{"title":"3-Hop: A Novel Hop-Based Reachability Index","authors":"Xiaorui Jiang, Xiaoping Sun, Qiang Zeng, H. Zhuge","doi":"10.1109/SKG.2013.21","DOIUrl":"https://doi.org/10.1109/SKG.2013.21","url":null,"abstract":"A reachability query is to ask whether there exists a path between two nodes in a directed graph. To build a compact index for efficiently handling reachability queries, most existing approaches label the nodes of a small induced subgraph as the base index to cover a portion of transitive information and then either explicitly store or encode the remaining transitive information into a complementary index. Although hop-based methods have the most compact index size, they inevitably suffer from big index construction costs in terms of long indexing time and huge memory consumption. This paper proposes a new hop-based indexing scheme 3-Hop* that greatly reduces index construction costs than state-of-the-art hop-based indices. 3-Hop* first extracts a planar induces subgraph which consists of a spanning tree and the set of short non-tree edges to label graph nodes for covering more reachability information in the base index as well as providing more hop choices for building the complementary index. Then, an efficient labeling algorithm is proposed for encoding the remaining transitive information with a smaller index size based on the up-per-bound density heuristic and early-stop hop selection strategy. Extensive experiments over real and synthetic datasets show that 3-Hop* is the most efficient and effective hop-based reachability indexing method scalable for large sparse graphs.","PeriodicalId":368828,"journal":{"name":"2013 Ninth International Conference on Semantics, Knowledge and Grids","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134352064","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

Dynamic Description Logic Based Semantics Web Service Composition 基于语义的动态描述逻辑Web服务组合

2013 Ninth International Conference on Semantics, Knowledge and Grids Pub Date : 2013-10-03 DOI: 10.1109/SKG.2013.27

Jianhua Zhang, Wenjie Wang, Zhongzhi Shi, Jinpeng Yue, Bo Zhang

引用次数: 0

PaaS-Independent Approach to Provision Appropriate Cloud Resources for SCA-based Applications Deployment 为基于sca的应用程序部署提供适当云资源的独立于paas的方法

2013 Ninth International Conference on Semantics, Knowledge and Grids Pub Date : 2013-10-03 DOI: 10.1109/SKG.2013.34

Sami Yangui, M. Nasrallah, S. Tata

引用次数: 5

Research on the Social Acquaintance Network Oriented Group Buying 面向社会熟人网络的团购研究

2013 Ninth International Conference on Semantics, Knowledge and Grids Pub Date : 2013-10-03 DOI: 10.1109/SKG.2013.32

Yiping Wen, Jianxun Liu, Zhigang Chen

引用次数: 0

Exploring Citation-Based Knowledge Flow in Scientific Research 科学研究中基于引文的知识流动初探

2013 Ninth International Conference on Semantics, Knowledge and Grids Pub Date : 2013-10-03 DOI: 10.1109/SKG.2013.22

Junsheng Zhang, Huilin Wang, Yunchuan Sun

引用次数: 3

Recommendation Techniques Based on Off-Line Data Processing a Multifaceted Survey 基于离线数据处理的多面调查推荐技术

2013 Ninth International Conference on Semantics, Knowledge and Grids Pub Date : 2013-10-03 DOI: 10.1109/SKG.2013.23

Yongli Ren, Gang Li, Wanlei Zhou

引用次数: 0