检索结果-内蒙古大学图书馆

18th International Conference on Database Systems for Advanced Applications, DASFAA 2013

作者： Zhang, Yinglong Li, Cuiping Chen, Hong Sheng, Likun Key Lab of Data Engineering and Knowledge Engineering of Ministry of Education And Department of Computer Science Renmin University of China China JiangXi Agricultural University China

ISBN: (纸本)9783642374494

There are many real-world applications based on similarity between objects, such as clustering, similarity query processing, information retrieval and recommendation systems. SimRank is a promising measure of similarity based on random surfers model. However, the computational complexity of SimRank is high and several optimization techniques have been proposed. In the paper optimization issue of Sim-Rank computation in disk-resident graphs is our primary focus. First we suggest a new approach to compute *** we propose optimization techniques that improve the time cost of the new approach from O (kN2 D2) to O (kNL), where k is the number of iteration, N is the number of nodes, L is the number of edges, and D is the average degree of nodes. Meanwhile, a threshold sieving method is presented to reduce storage and computational cost. On this basis, an external algorithm computing SimRank in disk-resident graphs is introduced. In the experiments, our algorithm outperforms its opponent whose computation complexity also is O (kNL). © Springer-Verlag 2013.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

ExerSync: Facilitating interpersonal synchrony in social exergames 13

ExerSync: Facilitating interpersonal synchrony in social exe...

引用

2013 2nd ACM Conference on computer Supported Cooperative Work, CSCW 2013

作者： Park, Taiwoo Lee, Uichin Lee, Bupjae Lee, Haechan Son, Sanghun Song, Seokyoung Song, Junehwa Department of Computer Science KAIST Daejeon 305-701 Korea Republic of Department of Knowledge Service Engineering KAIST Daejeon 305-701 Korea Republic of

ISBN: (纸本)9781450313315

Social exergames provide immersive experiences of social interaction via online multiplayer games, ranging from simple group exercises (e.g., virtual cycling/rowing) to more structured multiplayer games (e.g., cooperative boat racing). In exergame design, interpersonal synchrony plays an important role as it enhances social rapport and prosocial behavior. In this paper, we build ExerSync platform that supports various assistive mechanisms for facilitating interpersonal synchrony even with heterogeneous exercise modalities. We consider a rhythm of body movements in repetitive aerobic exercises and explore the design space of incorporating rhythm into exergames. We build a prototype system and comparatively evaluate the effectiveness of various assistive mechanisms. The experiment results show that rhythm significantly lowers the perceived workloads and provides better competence and engagement, but the accuracy of interpersonal synchrony is not dependent on the use of rhythm. Copyright 2013 ACM.

关键词： Interactive computer systems

来源：评论

学校读者我要写书评

暂无评论

Semantic interpretation of mobile phone records exploiting background knowledge 12

Semantic interpretation of mobile phone records exploiting b...

引用

12th International Semantic Web Conference, ISWC 2013

作者： Dashdorj, Zolzaya Serafini, Luciano Semantic and Knowledge Innovation Lab. Telecom Italia Italy Department of Information Engineering and Computer Science University of Trento Italy Data and Knowledge Management Unit Fondazione Bruno Kessler Italy

The increasing availability of massive mobile phone call data records (CDR) has opened new opportunities for analyzing and understanding real-life social phenomena and human dynamics. In order to better interpret this enormous amount of data it is useful to contextualize them with information about the circumstances under which they has been generated. Nowadays, linked open data initiative provide access to a huge amount of geo-time referenced knowledge about territory and events that happen in the territory. These informations can be used to characterize the aforementioned context. The aim of this Ph.D is to investigate on the intercorrelations between CDR, contexts, and human behaviors. The ultimate goal is to build a stochastic model, that can be used to predict semantic (qualitative) behavioral patterns on the basis of CDR traffic and context and identify and explain anomalous situations on the basis of deviations from standard CDR patterns.

关键词： knowledge management

来源：评论

学校读者我要写书评

暂无评论

Convergence of Monte Carlo tree search in simultaneous move games

Convergence of Monte Carlo tree search in simultaneous move ...

引用

27th Annual Conference on Neural Information Processing Systems, NIPS 2013

作者： Lisý, Viliam Kovařík, Vojtěch Lanctot, Marc Bošanský, Branislav Agent Technology Center Dept. of Computer Science and Engineering FEE Czech Technical University in Prague Czech Republic Department of Knowledge Engineering Maastricht University Netherlands

We study Monte Carlo tree search (MCTS) in zero-sum extensive-form games with perfect information and simultaneous moves. We present a general template of MCTS algorithms for these games, which can be instantiated by various selection methods. We formally prove that if a selection method is Ε-Hannan consistent in a matrix game and satisfies additional requirements on exploration, then the MCTS algorithm eventually converges to an approximate Nash equilibrium (NE) of the extensive-form game. We empirically evaluate this claim using regret matching and Exp3 as the selection methods on randomly generated games and empirically selected worst case games. We confirm the formal result and show that additional MCTS variants also converge to approximate NE on the evaluated games.

关键词： Monte Carlo methods

来源：评论

学校读者我要写书评

暂无评论

CHC-TSCM:A Trustworthy Service Composition Method Based on an Improved CHC Genetic Algorithm

引用

China Communications 2013年第12期10卷 77-91页

作者：曹步清刘建勋 Xiaoqing(Frank) LIU 李兵周栋康国胜 Key Laboratory of Knowledge Processing and Networked Manufacture School of Computer Science and EngineeringHunan University of Science and Technology Department of Computer Science Missouri University of Science and Technology State Key Laboratory of Software Engineering School of ComputerWuhan University

Trustworthy service composition is an extremely important task when service composition becomes infeasible or even fails in an environment which is open,autonomic,uncertain and *** paper presents a trustworthy service composition method based on an improved Cross generation elitist selection,Heterogeneous recombination,Catacly-smic mutation(CHC) Trustworthy Service Composition Method(CHC-TSCM) genetic *** firstly obtains the total trust degree of the individual service using a trust degree measurement and evaluation model proposed in previous *** combination and computation then are performed according to the structural relation of the composite ***,the optimal trustworthy service composition is acquired by the improved CHC genetic *** results show that CHC-TSCM can effectively solve the trustworthy service composition *** with GODSS and TOCSS,this new method has several advantages:1) a higher service composition successrate;2) a smaller decline trend of the service composition success-rate,and 3) enhanced stability.

关键词： QoS service trust model CHC gen-etic algorithm trustworthy service composition

来源：评论

学校读者我要写书评

暂无评论

Teachers' views on the use of empathic robotic tutors in the classroom

Teachers' views on the use of empathic robotic tutors in the...

引用

IEEE International Workshop on Robot and Human Communication (ROMAN)

作者： Sofia Serholt Wolmet Barendregt Iolanda Leite Helen Hastie Aidan Jones Ana Paiva Asimina Vasalou Ginevra Castellano Department of Applied Information Technology University of Gothenburg Gothenburg Sweden GAIPS Instituto Superior Tecnico Lisboa Portugal Social Robotics Lab Yale University New Haven CT USA School of Mathematical and Computer Science Heriot-Watt University Edinburgh UK School of Electronic Electrical and Computer Engineering University of Birmingham Birmingham UK London Knowledge Lab Institute of Education London UK

ISBN: (纸本)9781479967667

In this paper, we describe the results of an interview study conducted across several European countries on teachers' views on the use of empathic robotic tutors in the classroom. The main goals of the study were to elicit teachers' thoughts on the integration of the robotic tutors in the daily school practice, understanding the main roles that these robots could play and gather teachers' main concerns about this type of technology. Teachers' concerns were much related to the fairness of access to the technology, robustness of the robot in students' hands and disruption of other classroom activities. They saw a role for the tutor in acting as an engaging tool for all, preferably in groups, and gathering information about students' learning progress without taking over the teachers' responsibility for the actual assessment. The implications of these results are discussed in relation to teacher acceptance of ubiquitous technologies in general and robots in particular.

关键词： Educational institutions Interviews Robot sensing systems Service robots Europe

来源：评论

学校读者我要写书评

暂无评论

A fast and simple graph kernel for RDF

A fast and simple graph kernel for RDF

引用

International Workshop on Data Mining on Linked Data, with Linked Data Mining Challenge, DMoLD 2013 - Collocated with the European Conference on Machine Learning and Principles and Practice of knowledge Discovery in Databases, ECMLPKDD 2013

作者： De Vries, Gerben Klaas Dirk De Rooij, Steven System and Network Engineering Group Informatics Institute University of Amsterdam Netherlands Knowledge Representation and Reasoning Group Department of Computer Science VU University Amsterdam Netherlands

In this paper we study a graph kernel for RDF based on constructing a tree for each instance and counting the number of paths in that tree. In our experiments this kernel shows comparable classification performance to the previously introduced intersection subtree kernel, but is significantly faster in terms of computation time. Prediction performance is worse than the state-of-the-art Weisfeiler Lehman RDF kernel, but our kernel is a factor 10 faster to compute. Thus, we consider this kernel a very suitable baseline for learning from RDF data. Furthermore, we extend this kernel to handle RDF literals as bag-of-words feature vectors, which increases performance in two of the four experiments.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

Efficient querying of correlated uncertain data with cached results

Efficient querying of correlated uncertain data with cached ...

引用

18th International Conference on Database Systems for Advanced Applications, DASFAA 2013

作者： Chen, Jinchuan Zhang, Min Xie, Xike Du, Xiaoyong Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE China School of Information Renmin University of China China Department of Computer Science Aalborg University Denmark

ISBN: (纸本)9783642374869

Although there have been many efforts for management of uncertain data, evaluating probabilistic inference queries, a known NP-hard problem, is still a big challenge, especially for querying data with highly correlations. The state-of-art exact algorithms for accelerating the evaluation of inference queries are based on special indices. Besides, with the observation of the existence of many frequent queries, some researchers try to improve efficiency by reusing previously queried results. Indexing depends on the static properties like data distributions, whereas caching is in favor of the dynamic features like query workload. In this paper we propose a new approach for speeding up the evaluation of inference queries by caching frequent results in a junction tree-based hierarchical index. To the best of our knowledge, this is the first effort on utilizing both the static (data) and dynamic (query workload) properties to efficiently evaluate probabilistic inference queries. Moreover, according to our experience, different caching strategies may significantly affect the query performance. Basically a good caching strategy needs to have high cache hit ratio with limited space *** on these considerations, we propose a novel caching approach, called FVEC, and present corresponding algorithms for efficiently querying correlated uncertain data. We further conduct a series of extensive experiments on large uncertain datasets in order to illustrate the effectiveness and efficiency of our proposed approaches. As illustrated by the results, compared with previous solutions, our method could greatly improve the query performance. © Springer-Verlag 2013.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Empowered service delegation with attribute encryption for distributed cloud computing

Empowered service delegation with attribute encryption for d...

引用

International Conference on Current Trends in engineering and Technology (ICCTET)

作者： S. S. Aravinth B. Rajkumar M. Ramkumar M. Anitha S. Elangodi Department of Computer Science and Engineering Knowledge Institute of Technology India

Cloud computing has emerged as one of the most influential paradigms in the IT industry. In this, new computing technology requires users to entrust their valuable data to cloud providers, there have been increasing security and privacy concerns on outsourced data. Several schemes employing attribute-based encryption (ABE) have been proposed for access control of outsourced data in cloud computing. The most[1][2] of them suffer from inflexibility in implementing complex access control policies. In this paper, allowing cloud service providers (CSPs), which are not in the same trusted domains as enterprise users, to take care of confidential data, may raise potential security and privacy issues. To keep the sensitive user data confidential against untrusted CSPs, a Natural way is to apply cryptographic approaches, by disclosing Decryption keys only to authorized users. But also provide full delegation, and scalability, so as to best serve the needs of accessing data anytime and anywhere, delegating within enterprises, and achieving a dynamic set of users. [3][4]HASBE employs multiple value assignments for access expiration time to deal with user revocation more efficiently than existing schemes. It can be providefine-grained access control and full delegation. Finally, we propose a scalable revocation scheme by delegating to the CSP most of the computing tasks in revocation, to achieve a dynamic set of users efficiently.

关键词： Access control Cloud computing Encryption Ciphers computer science

来源：评论

学校读者我要写书评

暂无评论

Top-k entities query processing on uncertainly fused multi-sensory data

Top-k entities query processing on uncertainly fused multi-s...

引用

作者： Liu, Dexi Wan, Changxuan Xiong, Naixue Park, Jong Hyuk Rho, Seungmin Jiangxi Key Laboratory of Data and Knowledge Engineering School of Information Technology Jiangxi University of Finance and Economics Nanchang China Department of Computer Science Georgia State University Atlanta GA United States Department of Computer Science and Engineering Seoul National University of Science and Technology Seoul Korea Republic of School of Electrical Engineering Korea University Seoul Korea Republic of

Sensor fusion is the combining of sensory data from disparate sources such that the resulting information is in some sense better than would be possible when these sources were used individually. The natural uncertainty exists in these data because sensors are not precise enough. Hence, the intuitive method to store this kind of data is using uncertain database. Finding the top-k entities according to one or more attributes is a powerful technique when the uncertain database contains large quantity of data. However, compared to top-k in traditional databases, queries over uncertain database are more complicated because of the existence of exponential possible worlds. We propose a method to process entity-based global top-k aggregate queries in uncertain database, which returns the top-k entities that have the highest aggregate value. Our method has two levels, entity state generation and G-topk-E query processing. In the former level, entity states, which satisfy the properties of x-tuple, are generated one after the other according to their aggregate values, while in the latter level, dynamic programming-based global top-k entity query processing is employed to return the answers. Comprehensive experiments on different data sets demonstrate the effectiveness of the proposed solutions. © 2012 Springer-Verlag London Limited.

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：