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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

550 篇 会议
548 篇 期刊文献

馆藏范围

1,098 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

737 篇 工学
- 566 篇 计算机科学与技术...
- 478 篇 软件工程
- 129 篇 信息与通信工程
- 102 篇 生物工程
- 86 篇 生物医学工程（可授...
- 83 篇 控制科学与工程
- 78 篇 电气工程
- 75 篇 光学工程
- 57 篇 电子科学与技术（可...
- 45 篇 建筑学
- 44 篇 土木工程
- 34 篇 化学工程与技术
- 30 篇 机械工程
- 20 篇 交通运输工程
- 19 篇 动力工程及工程热...
- 16 篇 航空宇航科学与技...
414 篇 理学
- 202 篇 数学
- 115 篇 生物学
- 103 篇 物理学
- 76 篇 统计学（可授理学、...
- 41 篇 化学
- 41 篇 系统科学
262 篇 管理学
- 156 篇 图书情报与档案管...
- 113 篇 管理科学与工程(可...
- 56 篇 工商管理
101 篇 医学
- 85 篇 临床医学
- 71 篇 基础医学(可授医学...
- 47 篇 药学(可授医学、理...
- 29 篇 公共卫生与预防医...
29 篇 法学
- 26 篇 社会学
20 篇 农学
16 篇 教育学
12 篇 经济学
6 篇 文学
4 篇 军事学
2 篇 哲学
2 篇 历史学

主题

36 篇 semantics
34 篇 computer science
25 篇 training
24 篇 deep learning
23 篇 knowledge engine...
23 篇 computational mo...
22 篇 data mining
17 篇 knowledge manage...
17 篇 accuracy
16 篇 magnetic resonan...
16 篇 data engineering
16 篇 machine learning
14 篇 recommender syst...
14 篇 ontologies
14 篇 visualization
14 篇 artificial intel...
13 篇 image segmentati...
12 篇 resource managem...
12 篇 data models
11 篇 neural networks

机构

21 篇 knowledge and da...
21 篇 school of comput...
20 篇 alibaba group
15 篇 college of compu...
15 篇 data and knowled...
13 篇 school of inform...
13 篇 faculty of compu...
13 篇 department of ma...
11 篇 center for behav...
11 篇 biomedical magne...
10 篇 german center fo...
10 篇 genomics researc...
10 篇 key laboratory o...
10 篇 department of da...
10 篇 college of compu...
9 篇 department of co...
9 篇 centre for behav...
8 篇 department of el...
8 篇 institute for me...
7 篇 department of co...

作者

46 篇 nürnberger andre...
24 篇 chatterjee soumi...
20 篇 speck oliver
18 篇 o'sullivan decla...
18 篇 wade vincent
17 篇 sun geng
16 篇 niyato dusit
16 篇 brennan rob
11 篇 he jun
11 篇 noor jannatun
11 篇 wu xindong
11 篇 du xiaoyong
11 篇 li jiahui
10 篇 liu hongyan
10 篇 wang jiacheng
9 篇 lewis david
9 篇 rose georg
9 篇 andreas nürnberg...
8 篇 declan o'sulliva...
8 篇 zopf markus

语言

1,055 篇 英文
39 篇 其他
5 篇 中文
1 篇 德文
1 篇 法文

检索条件"机构=Knowledge and Data Engineering Group Computer Science Department"

共 1098 条记录，以下是921-930 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Towards explanation-aware social software: Applying the mining and analysis continuum of explaining

Towards explanation-aware social software: Applying the mini...

引用

5th International Workshop on Explanation-Aware Computing, ExaCt 2010

作者： Atzmueller, Martin Roth-Berghofer, Thomas University of Kassel Knowledge and Data Engineering Group Wilhelmshöher Allee 73 34121 Kassel Germany GmbH Trippstadter Straße 122 67663 Kaiserslautern Germany Knowledge-Based Systems Group Department of Computer Science University of Kaiserslautern P.O. Box 3049 67653 Kaiserslautern Germany

data mining methods build patterns or models. When presenting these, all or part of the result needs to be explained to the user in order to be understandable and for increasing the user acceptance of the patterns. In doing that, a variety of dimensions in the Mining and Analysis Continuum of Explaining (MACE) needs to be considered, e.g., from concrete to more abstract explanations. This paper discusses the application of the MACE in the context of social software. We consider applications of the proposed approaches in three social software systems, and show how the data mining results can seamlessly be analysed on the presented continuous dimensions and levels.

关键词： Application programs

来源：评论

学校读者我要写书评

暂无评论

VAN: Vehicle-assisted shortest-time path navigation

VAN: Vehicle-assisted shortest-time path navigation

引用

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

来源：评论

学校读者我要写书评

暂无评论

Ubiquitous data

Ubiquitous data

引用

作者： Hotho, Andreas Pedersen, Rasmus Ulslev Wurst, Michael University Kassel Depart. of Electrical Engineering/Computer Science Knowledge and Data Engineering Group Germany Copenhagen Business School Dept. of Informatics Embedded Software Lab. Copenhagen Denmark Technical University Dortmund Computer Science LS8 44221 Dortmund Germany

ISBN: (纸本)3642163912

Ubiquitous knowledge discovery systems must be captured from many different perspectives. In earlier chapters, aspects like machine learning, underlying network technologies etc. were described. An essential component, which we shall discuss now, is still missing: Ubiquitous data. While data themselves are a central part of the knowledge discovery process, in a ubiquitous setting new challenges arise. In this context, the emergence of data itself plays a large role, therefore we label this part of KDubiq systems ubiquitous data. It clarifies the KDubiq challenges related to the multitude of available data and what we must do before we can tap into this rich information source. © 2010 Springer-Verlag.

关键词： Taps

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Multi-facet exploration of image collections with an adaptive multi-focus zoomable interface

Multi-facet exploration of image collections with an adaptiv...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Sebastian Stober Christian Hentschel Andreas Nürnberger Data & Knowledge Engineering Group of the Faculty of Computer Science Otto-von-Guericke-University Magdeburg Germany

Sometimes it is not possible for a user to state a retrieval goal explicitly a priori. One common way to support such exploratory retrieval scenarios is to give an overview using a neighborhood-preserving projection of the collection onto two dimensions. However, neighborhood cannot always be preserved in the projection because of the dimensionality reduction. Further, there is usually more than one way to look at a collection of images - and diversity grows with the number of features that can be extracted. We describe an adaptive zoomable interface for exploration that addresses both problems: It makes use of a complex non-linear multi-focal zoom lens that exploits the distorted neighborhood relations introduced by the projection. We further introduce the concept of facet distances representing different aspects of image similarity. Given user-specific weightings of these aspects, the system can adapt to the user's way of exploring the collection by manipulation of the neighborhoods as well as the projection.

关键词： Measurement Visualization Feature extraction Image color analysis Indexing Lenses Nonlinear distortion

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Extending a knowledge-based network to support temporal event reasoning

Extending a knowledge-based network to support temporal even...

引用

IEEE Symposium on Network Operations and Management

作者： John Keeney Clay Stevens Declan O'Sullivan Knowledge & Data Engineering Group & FAME School of Computer Science & Statistics Trinity College Dublin Dublin Ireland

ISBN: (纸本)9781424453665

While the polling or request/response paradigm adopted by many network and systems management approaches form the backbone of modern monitoring and management systems, the most important and interesting events, faults, alerts and log messages arrive at the management agent in a push-based asynchronous manner. However, in the management infrastructure itself, at the point where events are initially processed and matched to subscribers, there have been few attempts to identify relationships or dependencies between events. This means that most of this burden is placed on the management application, or indeed the managers themselves. This research investigates enhancing the expressiveness of a knowledge-based networking middleware with the addition of three temporal operators to be used in subscriptions to select matching events. A prototype design is presented and a number of implementations are compared. The approach is also motivated using two scenarios for temporal correlation of warnings and faults in managed networks. The effect on the scalability of the extended knowledge-based network system is also evaluated.

关键词： Subscriptions knowledge management Middleware Scalability engineering management Filtering computer network management Routing Matched filters data engineering

来源：评论

学校读者我要写书评

暂无评论

Performance study on logging to another main memory database

Performance study on logging to another main memory database

引用

作者： Qin, Xiongpai Xiaoyun, Zhou Key Laboratory of Data Engineering and Knowledge Engineering School of Information Renmin University of China Beijing 100872 China Department of Computer Science and Technology Xuzhou Normal University Xuzhou Jiangsu 221008 China

ISBN: (纸本)9788988678183

In update intensive main memory database applications, huge volume of log records is generated, to maintain the ACID properties of the database system, the log records should be persistent efficiently. Delegating logging of one main memory database to another main memory database is proposed. The scheme is elaborated in detail in terms of architecture, logging & safeness levels, checkpointing, and recovery. Strict durability and relax durability are provided. When some form of non-volatile memory is used to temporarily holding log records, not only logging efficiency is improved, but also the scheme could guarantee full ACID of the system. We also propose using parallel logging to speedup log persistence by writing logs to multiple disks in parallel. Since interconnection network techniques progress by leaps and bounds, the scheme eliminates the concern about whether the system's overall performance may be slowed down by bandwidth and latency limitations. Experiment results demonstrate the feasibility of the proposal.

关键词： Interconnection networks (circuit switching)

来源：评论

学校读者我要写书评

暂无评论

A trust model for capability delegation in federated policy systems

A trust model for capability delegation in federated policy ...

引用

International Conference on Network and Service Management

作者： Kevin Feeney Rob Brennan Simon N. Foley FAME and Knowledge & Data Engineering Group Trinity College Dublin Ireland FAME and Department of Computer Science University College Cork Ireland

Federated policy systems are required to support the complexity and organizational heterogeneity of the modern marketplace. The Community-based Policy Management System (CBPMS) is such a distributed policy management approach. It utilizes a tree-based capability authority model to partition and delegate federated capabilities. However CBPMS delegation chains have limitations such as: performance overheads due to distributed rule evaluation, threats from malformed or malicious federated principals and a lack of flexibility with respect to delegation chain reduction or capability authority re-partitioning. In this paper we introduce a trust management model for CBPMS that addresses all of these issues.. A brief security analysis is presented and a telecommunications service management use case described.

关键词： Conferences Authorization Organizations Public key Telecommunications

来源：评论

学校读者我要写书评

暂无评论

Intelligent hybrid architecture for tourism services

引用

作者： Almeida, Ana Coelho, Bruno Martins, Constantino GECAD Knowledge Engineering and Decision Support Group Australia Computer Science Department Institute of Engineering Polytechnic of Porto R. Dr. António Bernardino de Almeida 431 Porto 4200-072 Portugal

ISBN: (纸本)3642152856

This paper presents an artificial intelligence-based architecture to be used in various tourism services, namely the user modeling and recommender system components. Through the use of several machine learning techniques, such as linear models, neural networks, classification and even text mining, a hybrid and complete approach at understanding tourism application users is attained. To assess the advantages of the model, a specific prototype was created, including a complex user modeling process and an advanced and innovative recommender system. The system was tested in the scope of Oporto city, in Portugal. © 2010 IFIP.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共110页 << < 89 90 91 92 93 94 95 96 97 98 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：