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

2010 IEEE 7th International Conference on Mobile Adhoc and Sensor Systems, MASS 2010

作者： Chen, Wenping Zhu, Sencun Li, Deying School of Information Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China Beijing China Department of Computer Science and Engineering Pennsylvania State University University Park PA United States

ISBN: (纸本)9781424474882

Traffic congestion is a very serious problem in large cities. With the number of vehicles increasing rapidly, especially in cities whose economy is booming, the situation is getting even worse. In this paper, by leveraging the techniques of Vehicular Ad hoc Networks (VANETs) we present a dynamic navigation protocol called VAN for individual vehicles to find the shortest-time paths toward their given destinations. Specifically, a vehicle initiates a number of queries, which are routed by VANETs along different paths toward its destination. During query forwarding, the real-time road traffic information in each road segment is aggregated from multiple participating vehicles and returned to the source after the query reaches the destination. This information enables the source to calculate the shortest-time path. We also propose two forwarding optimization methods to reduce communication costs and an error handling mechanism to deal with abnormal circumstances. To evaluate its performance, we use the real traffic data of Beijing, including 2,308 road segments at two different times. Our simulation results demonstrate that our protocol, on average, could save around 30% driving time, compared to traveling along the shortest distance paths. ©2010 IEEE.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

Intelligent social semantic collaborative filtering tools in an E-learning contexts

Intelligent social semantic collaborative filtering tools in...

引用

2010 International Conference on Artificial Intelligence, ICAI 2010

作者： Zhuhadar, Leyla Kruk, Sebastian Ryszard Knowledge Discovery and Web Mining Lab. Department of Computer Engineering and Computer Science University of Louisville Louisville KY 40292 United States Knowledge Hives sp. z o.o. Rokitnikowa 11 81-589 Gdynia Poland

ISBN: (纸本)9781601321480

This paper presents the usage of the Semantic Digital Library platform, JeromeDL, as knowledge representation of an open-source learning objects repository at Western Kentucky University. The synergistic approach between the Semantic Digital Library and E-learning provides users (online learners) with enhanced information discovery features for learning objects (lectures). In addition, the platform serves as an environment to (a) author learning objects;(b) classify each learning object using proper taxonomy among different libraries, such as DMOZ, ACM, UDC, LOC, or DDC;(c) bookmark sharing and collaborative filtering;and (d) providing natural language query templates. In this study, we discuss our findings with respect to the usability of the platform by online users. This platform is currently running at WKU as a pilot project and has been experimented with online users.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Complete 3D model reconstruction using a depth sensor

Complete 3D model reconstruction using a depth sensor

引用

2010 IEEE International Conference on Intelligent Computing and Integrated Systems, ICISS2010

作者： Mu, Guangyu Liao, Miao Yang, Ruigang Ouyang, Dantong Xu, Zhiwen Guo, Xiaoxin Department of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of MOE Changchun China Department of Engineering University of Kentucky Center for Visualization and Virtual Environment Lexington United States

ISBN: (纸本)9781424468355

We propose a fast and simple application system of 3D model reconstruction. We acquire range images by using a combination of a regular camera and a depth sensor. The reconstruction of a 3D model consists of four key steps: (i) Initial alignment either feature tracking or the 4-points congruent sets algorithm is used to align surfaces captured at different frames. (ii)The iterative closest point (ICP) method is applied to further align the piecewise surfaces from the last step. (iii) The surfaces are merged into a whole 3D model by the volumetric method. (iv) In the refinement step, we fill holes and produce a complete 3D model that approximates the original model with robust repair of polygonal models. At last, we present the experimental results which show that the errors between our reconstructed model and the ground truth are less than 1 %. © 2010 IEEE.

关键词： Three dimensional computer graphics

来源：评论

学校读者我要写书评

暂无评论

Parallel SimRank computation on large graphs with iterative aggregation

Parallel SimRank computation on large graphs with iterative ...

引用

16th ACM SIGKDD International Conference on knowledge Discovery and Data Mining, KDD-2010

作者： He, Guoming Feng, Haijun Li, Cuiping Chen, Hong Key Lab. of Data Engineering and Knowledge Engineering of Ministry of Education China Department of Computer Science Renmin University of China China No. 59 Zhongguancun Street Haidian District Beijing China

ISBN: (纸本)9781450300551

Recently there has been a lot of interest in graph-based analysis. One of the most important aspects of graph-based analysis is to measure similarity between nodes in a graph. SimRank is a simple and influential measure of this kind, based on a solid graph theoretical model. However, existing methods on SimRank computation suffer from two limitations: 1) the computing cost can be very high in practice;and 2) they can only be applied on static graphs. In this paper, we exploit the inherent parallelism and high memory bandwidth of graphics processing units (GPU) to accelerate the computation of SimRank on large graphs. Furthermore, based on the observation that SimRank is essentially a first-order Markov Chain, we propose to utilize the iterative aggregation techniques for uncoupling Markov chains to compute SimRank scores in parallel for large graphs. The iterative aggregation method can be applied on dynamic graphs. Moreover, it can handle not only the link-updating problem but also the node-updating problem. Extensive experiments on synthetic and real data sets verify that the proposed methods are efficient and effective. © 2010 ACM.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

The multiple scale analysis of the coupled van der Pol equation system and its error estimation

引用

Theoretical and Applied Mechanics Japan 2010年 58卷 89-98页

作者： Nohara, Ben T. Arimoto, Akio Department of Computer Science Faculty of Knowledge Engineering Tokyo City University Tokyo Japan

The approximated solutions of the coupled van der Pol equation system are obtained by the multiple scale method. We find that three type of solutions exist in the coupled van der Polequation system. The solutions are categorized as two periodic solutions: the in-phase and out-of-phase solution, and periodic or non-periodic solution depending on a value of the coupled parameter. We also show that the error between the exact solution and the approximated solution is bounded and its value is evaluated.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A multi-heuristic cooperative ant colony system for optimizing elimination ordering of Bayesian networks

A multi-heuristic cooperative ant colony system for optimizi...

引用

2010 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2010

作者： Dong, Xuchu Ouyang, Dantong Ye, Yuxin Yu, Haihong Zhang, Yonggang Department of Computer Science and Technology Jilin University Changchun Jilin 130012 China Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Changchun Jilin 130012 China

ISBN: (纸本)9780769541914

To solve the problem of searching for an optimal elimination ordering of Bayesian networks, a novel effective heuristic, MinSumWeight, and an ACS approach incorporated with multi-heuristic mechanism are proposed. The ACS approach named MHC-ACS utilizes a set of heuristics to direct the ants moving in the search space. The cooperation of multiple heuristics helps ants explore more regions. Moreover, the most appropriate heuristic will be identified and be reinforced with the evolution of the whole system. Experiments demonstrate that MHC-ACS has a better performance than other swarm intelligence methods. © 2010 IEEE.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

Two novel semantics of top-k queries processing in uncertain database

Two novel semantics of top-k queries processing in uncertain...

引用

10th IEEE International Conference on computer and Information Technology, CIT-2010, 7th IEEE International Conference on Embedded Software and Systems, ICESS-2010, 10th IEEE Int. Conf. Scalable Computing and Communications, ScalCom-2010

作者： Liu, Dexi Wan, Changxuan Xiong, N. Yang, Laurence T. Chen, Lei 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 St. Francis Xavier University Antigonish NS Canada Department of Computer Science HK University of Science and Technology Hong Kong Hong Kong

ISBN: (纸本)9780769541082

Top-k query is a powerful technique in uncertain databases because of the existence of exponential possible worlds, and it is necessary to combine score and confidence of tuples to derive top k answers. Different semantics, the combination methods of score and confidence, lead to different results. U-kRanks and Global Top-k are two semantics of Topk queries in uncertain database, which consider every alternative in x-tuple as single one and return the tuple which has the highest probability appearing at top k or a given rank. However, no matter which alternative (tuple) of an x-tuple appears in a possible world, it undoubtedly believes that this xtuple appears in the same possible world accordingly. Thus, instead of ranking every individual tuple, we define two novel Top-k queries semantics in uncertain database, Uncertain xkRanks queries (U-x-kRanks) and Global x-Top-k queries (Gx- Top-k), which return k entities according to the score and the confidence of alternatives in x-tuple, respectively. In order to reduce the search space, we present an efficient algorithm to process U-x-kRanks queries and G-x-Top-k queries. Comprehensive experiments on different data sets demonstrate the effectiveness of the proposed solutions. © 2010 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Mitigation of large-scale RDF data loading with the employment of a cloud computing service

Mitigation of large-scale RDF data loading with the employme...

引用

作者： Namgoong, Hyun Kumar, Harshit Kim, Hong-Gee Biomedical Knowledge Engineering Lab. Seoul National University Seoul Korea Republic of Department of Computer Science University of Suwon Hwaseong Korea Republic of

ISBN: (纸本)9789898425294

An expanding need for interoperability and structuralization of web data has made use of RDF (Resource Description Framework) plentiful. To guarantee a common usage of the data within various applications, several RDF stores providing data management services have been developed. Here, we represent a systematic approach to solve a late latency problem of data loading of the stores. It enables a fast loading performance for very large size of RDF data, and it is proven with an existing RDF store. This approach employs a cloud computing service and delegates preparation works to the machines which are temporarily borrowed at little payment. Our implementation for a native version of the Sesame RDF Repository was tested on LUBM 1000 University data (138 million triples), and it showed a local store loading time of 16.2 minutes with additional preparation time on a cloud service taking approximately an hour, which can be reduced by adding supplemental machines to the cluster.

关键词： Data warehouses

来源：评论

学校读者我要写书评

暂无评论

SPARQL2XQuery 2.0: Supporting semantic-based queries over XML data

SPARQL2XQuery 2.0: Supporting semantic-based queries over XM...

引用

5th International Workshop on Semantic Media Adaptation and Personalization, SMAP 2010

作者： Stavrakantonakis, Ioannis Tsinaraki, Chrisa Bikakis, Nikos Gioldasis, Nektarios Christodoulakis, Stavros MUSIC TUC Technical University of Crete Greece Department of Information Engineering and Computer Science University of Trento Italy Knowledge and Database Systems Laboratory National Technical University of Athens Greece

ISBN: (纸本)9781424486007

The dominant standards in multimedia content and service description, namely the MPEG-7 and the MPEG-21, have been expressed in XML Schema syntax. In addition, ontologies that capture the semantics of these standards have been developed using the semantic web languages. Since different communities in the industry and the academia work and are familiar with the Semantic Web environment or the XML environment, a Schema mapping framework and a Query mapping framework are needed that will allow querying multimedia content and service descriptions in a uniform way in both the XML and Semantic Web environments. We present in this paper SPARQL2XQuery 2.0, a framework that allows expressing semantic queries on top of XML data through the translation of SPARQL queries in XQuery syntax. SPARQL2XQuery 2.0 may work with both existing ontologies and with automatically produced ones, formed according to our XS2OWL 2.0 transformation model. XS2-OWL 2.0 exploits the OWL 2.0 semantics and supports the new XML constructs introduced by XML Schema 1.1. © 2010 IEEE.

关键词： XML

来源：评论

学校读者我要写书评

暂无评论

Complete 3D model reconstruction using two types of depth sensors

Complete 3D model reconstruction using two types of depth se...

引用

2010 IEEE International Conference on Intelligent Computing and Intelligent Systems, ICIS 2010

作者： Mu, Guangyu Liao, Miao Yang, Ruigang Ouyang, Dantong Xu, Zhiwen Guo, Xiaoxin Department of Computer Science and Technology Jilin University Changchun China College of Information Jilin University of Finance and Economics Changchun China Department of Engineering University of Kentucky Center for Visualization and Virtual Environment Lexington KY United States Department of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of MOE Changchun China

ISBN: (纸本)9781424465835

We propose a fast and simple application system of 3D model reconstruction. We acquire range images by using a combination of a regular camera and two types of depth sensors. The reconstruction of a 3D model consists of four key steps: (i) Initial alignment either feature tracking or the 4-points congruent sets algorithm is used to align surfaces captured at different frames. (ii)The iterative closest point (ICP) method is applied to further align the piecewise surfaces from the last step. (iii) The surfaces are merged into a whole 3D model by the volumetric method. (iv) In the refinement step, we fill holes and produce a complete 3D model that approximates the original model with robust repair of polygonal models. At last, we present the experimental results which show that the errors between our reconstructed model and the ground truth are less than 1%. ©2010 IEEE.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：