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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

264 篇 会议
254 篇 期刊文献

馆藏范围

518 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

355 篇 工学
- 282 篇 计算机科学与技术...
- 239 篇 软件工程
- 82 篇 信息与通信工程
- 59 篇 生物工程
- 42 篇 电气工程
- 35 篇 生物医学工程（可授...
- 33 篇 控制科学与工程
- 29 篇 光学工程
- 22 篇 建筑学
- 21 篇 电子科学与技术（可...
- 20 篇 土木工程
- 17 篇 化学工程与技术
- 13 篇 机械工程
- 12 篇 航空宇航科学与技...
- 11 篇 动力工程及工程热...
231 篇 理学
- 146 篇 数学
- 66 篇 统计学（可授理学、...
- 62 篇 生物学
- 52 篇 物理学
- 25 篇 系统科学
- 17 篇 化学
- 15 篇 大气科学
108 篇 管理学
- 63 篇 图书情报与档案管...
- 42 篇 管理科学与工程(可...
- 21 篇 工商管理
46 篇 医学
- 41 篇 临床医学
- 31 篇 基础医学(可授医学...
- 22 篇 药学(可授医学、理...
- 14 篇 公共卫生与预防医...
14 篇 法学
- 13 篇 社会学
6 篇 农学
5 篇 经济学
3 篇 教育学
1 篇 哲学
1 篇 文学
1 篇 历史学

主题

14 篇 data mining
12 篇 computer science
12 篇 training
11 篇 semantics
10 篇 knowledge engine...
10 篇 knowledge manage...
10 篇 data engineering
10 篇 standards
9 篇 convolution
9 篇 feature extracti...
8 篇 generative adver...
8 篇 electrocardiogra...
7 篇 magnetic resonan...
7 篇 ontologies
7 篇 machine learning
7 篇 artificial intel...
7 篇 accuracy
7 篇 games
6 篇 reinforcement le...
6 篇 deep learning

机构

56 篇 department of da...
54 篇 department of da...
27 篇 department of ma...
21 篇 school of inform...
21 篇 school of comput...
14 篇 key laboratory o...
14 篇 college of compu...
10 篇 college of compu...
8 篇 key labs of data...
8 篇 key laboratory o...
7 篇 department of co...
7 篇 maastricht unive...
7 篇 key laboratory o...
5 篇 university centr...
5 篇 department of pu...
5 篇 key laboratory o...
5 篇 school of econom...
5 篇 amity institute ...
5 篇 lovely professio...
5 篇 genomics researc...

作者

24 篇 he jun
23 篇 liu hongyan
22 篇 du xiaoyong
21 篇 spanakis gerasim...
18 篇 browne cameron
18 篇 mehrkanoon siama...
17 篇 sun geng
17 篇 soemers dennis j...
17 篇 stephenson matth...
17 篇 nürnberger andre...
16 篇 niyato dusit
13 篇 wang jiacheng
13 篇 niehues jan
12 篇 wu xindong
12 篇 li jiahui
12 篇 chatterjee soumi...
12 篇 piette éric
10 篇 speck oliver
9 篇 bonizzi pietro
8 篇 chen hong

语言

499 篇 英文
15 篇 其他
4 篇 中文

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

共 518 条记录，以下是461-470 订阅

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

详细简洁

排序：

From subjects to concept clouds-Why semantic mapping is necessary

From subjects to concept clouds-Why semantic mapping is nece...

引用

1st International Workshop on knowledge Federation 2008

作者： Thomas, Hendrik Markscheffel, Bernd Redmann, Tobias Department of Information-and Knowledge Management TechnischeUniversität Ilmenau P.O. Box 100565 98693 Ilmenau Germany Knowledge / Data Engineering Group School of Computer Science and Statistics Trinity College Dublin Ireland

To realize the vision of the semantic web it is essential to be able to exchange formal modeled knowledge between applications and humans without loss of meaning. In this paper, we focus on questions relating to meaning, interpretation and subject identity in modern semantic web languages. Based on the semiotic triangle we show that topics as well as RDF resources are symbols, representing concepts and not referents as the common term "subject" would indicate. A subject can not be represented as a single entity, but rather as a complex and evolving system of different concepts. Based on this insight we explain how the resulting plurality and uncertainness of the interpretation of symbols can be handled using semantic mappings. By defining transformation rules, the exchange and integration of knowledge from different semantic models becomes possible. Concluding we define recommendations and design guidelines for a semantic mapping management system, which is needed to support users and applications in creating, reusing, managing and applying such semantic mappings.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

IRank: A term-based innovation ranking system for conferences and scholars

IRank: A term-based innovation ranking system for conference...

引用

Joint International Conference on Advances in data and Web Management, APWeb/WAIM 2009

作者： Li, Zhixu Du, Xiaoyong Liu, Hongyan He, Jun Zhou, Xiaofang Key Labs of Data Engineering and Knowledge Engineering Ministry of Education China School of Information Renmin University of China Beijing China Department of Management Science and Engineering Tsinghua University Beijing China University of Queensland QLD Australia

ISBN: (纸本)9783642006715

Since the proposition of Journal Impact Factor [1] in 1963, the classical citation-based ranking scheme has been a standard criterion to rank journals and conferences. However, the reference of a paper cannot list all relevant publications and the citation relationships are not always available especially when related to copyright problem. Besides, we cannot evaluate a newly published paper before it is cited by others. Therefore, we propose an alternative method, term-based evaluation scheme which can evaluate publications by terms they use. Then we can rank conferences, journals and scholars accordingly. We think this term-based ranking scheme can be used to evaluate innovation quality for conferences and scholars. To evaluate our scheme and to facilitate its application, we develop an innovation ranking system called IRank to rank conferences and authors in the field of database Systems. The performance of IRank demonstrates the effectiveness of our scheme. © Springer-Verlag Berlin Heidelberg 2009.

关键词： Quality control

来源：评论

学校读者我要写书评

暂无评论

Incremental computation for MEDIAN cubes in what-if analysis

Incremental computation for MEDIAN cubes in what-if analysis

引用

Joint International Conference on Advances in data and Web Management, APWeb/WAIM 2009

作者： Xiao, Yanqin Zhang, Yansong Wang, Shan Chen, Hong Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE Beijing 100872 China School of Information Renmin University of China Beijing 100872 China Computer Center Hebei University Baoding Hebei 071002 China Department of Computer Science Harbin Finance College Harbin 150030 China

ISBN: (纸本)9783642006715

What-if analysis is an important type of DSS analysis processing procedure. It analyzes hypothetical scenarios based on historical data. The data cube view must be updated when the what-if condition is changed. Since source data must be kept in order to compute the new aggregate value when new tuples are inserted or deleted, in what-if analysis, incrementally computing a data cube for holistic aggregation functions is a difficult problem. In this paper, we adopt delta cube strategy and work area technique to incrementally compute data cube for MEDIAN function. The size of work area has important influence on the efficiency of the incremental computing. This paper optimizes the size of work area based on the number and the cardinality of dimension attributes of the cuboid. Performance study shows that our algorithms are effective over large databases. © Springer-Verlag Berlin Heidelberg 2009.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

Efficient incremental computation of CUBE in multiple versions what-if analysis

Efficient incremental computation of CUBE in multiple versio...

引用

Joint International Conference on Advances in data and Web Management, APWeb/WAIM 2009

ISBN: (纸本)9783642006715

What-if analysis is an important method to analyze the hypothetical scenarios based on the historical data. It provides useful information for the decision- maker. Multiple versions are critical to what-if analysis. In this paper, we analyze the problem of multiple versions data processing and the incremental computation of cubes in what-if analysis, proposing a strategy to process multiple versions of what-if data. Our solution can adopt different data processing methods according to the type of aggregate functions, the efficiency of multiple versions data processing is improved. Furthermore, we proposes an algorithm of incremental computation of CUBE for max(min) function to reduce the access time of fact table, and the experimental results showed that the performance is improved about 10%. © Springer-Verlag Berlin Heidelberg 2009.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

Efficient Algorithm for Computing Link-Based Similarity in Real World Networks

Efficient Algorithm for Computing Link-Based Similarity in R...

引用

IEEE International Conference on data Mining (ICDM)

作者： Yuanzhe Cai Gao Cong Xu Jia Hongyan Liu Jun He Jiaheng Lu Xiaoyong Du Key Laboratories of Data Engineering and Knowledge Engineering Ministry of Education China Department of Computer Science Renmin University of China China Department of Computer Science University of Aalborg Denmark Department of Management Science and Engineering Tsinghua University China

Similarity calculation has many applications, such as information retrieval, and collaborative filtering, among many others. It has been shown that link-based similarity measure, such as SimRank, is very effective in characterizing the object similarities in networks, such as the Web, by exploiting the object-to-object relationship. Unfortunately, it is prohibitively expensive to compute the link-based similarity in a relatively large graph. In this paper, based on the observation that link-based similarity scores of real world graphs follow the power-law distribution, we propose a new approximate algorithm, namely Power-SimRank, with guaranteed error bound to efficiently compute link-based similarity measure. We also prove the convergence of the proposed algorithm. Extensive experiments conducted on real world datasets and synthetic datasets show that the proposed algorithm outperforms SimRank by four-five times in terms of efficiency while the error generated by the approximation is small.

关键词： Computer networks Collaboration data engineering knowledge engineering Computer science Iterative algorithms Filtering data mining Helium Computer science education

来源：评论

学校读者我要写书评

暂无评论

The tradeoff of delta table merging and re-writing algorithms in what-if analysis application

The tradeoff of delta table merging and re-writing algorithm...

引用

Joint International Conference on Advances in data and Web Management, APWeb/WAIM 2009

作者： Zhang, Yansong Zhang, Yu Xiao, Yanqin Wang, Shan Chen, Hong Key Laboratory of the Ministry of Education for Data Engineering and Knowledge Engineering Renmin University of China Beijing 100872 China School of Information Renmin University of China Beijing 100872 China Department of Computer Science Harbin Finance College Harbin 150030 China Computer Center Hebei University Baoding Hebei 071002 China

ISBN: (纸本)9783642006715

What-if analysis can provide more meaningful information than classical OLAP. Multi-scenario hypothesis based on historical data needs efficient what-if data view support. In general, delta table for what-if analysis is more general than other solutions such as query re-writing prototype of Sesame. Delta table is independent of base table and is more suitable to represent complex hypothetical updates and multi-version hypothetical updates. Due to low efficiency of traditional delta table merging algorithm which is based on set operation, there are few researches focus on delta table merging algorithm but on query re-writing algorithm. By analyzing the difference between what-if query and what-if analysis and improving the delta table merging algorithm, we propose novel algorithms without set operation of difference. Considering the feature of aggregate operations in OLAP analysis, pre-merge algorithm is presented without the generation of what if data view before group-bys in the scenario of SUM, AVERAGE and COUNT function OLAP queries. In our experiments, the pre-merge algorithm greatly improved the efficiency of delta table merging procedure which is close to base group-by statement and superior to the re-writing algorithm. A complete comparison between all candidate delta table merging algorithms and re-writing algorithm with different what-if update conditions of update, deletion, insertion and mixed what-if updates is exhibited in our experiments, the policy of what-if analysis among different types is also discussed. © Springer-Verlag Berlin Heidelberg 2009.

关键词： Merging

来源：评论

学校读者我要写书评

暂无评论

Assessing the influence probability between objects: A random walker approach

Assessing the influence probability between objects: A rando...

引用

IEEE Symposium on Computational Intelligence and data Mining (CIDM)

作者： Pei Li Zhixu Li Jun He Xiaoyong Du Hongyan Liu Key Laboratories of Data Engineering and Knowledge Engineering MOE China & School of Information Renmin University of China Beijing China Department of Management Science and Engineering Tsinghua University Beijing China

Influence between objects needs to be assessed in many applications. Lots of measures have been proposed, but a domain-independent method is still expected. In this paper, we give a probabilistic definition of influence based on the random walker model on graphs. Two approaches, linear systems method and Basic InfRank algorithm, are shown and return equal results, but Basic InfRank is more efficient by iterative computation. Two variants on bipartite graphs and star graphs are discussed. Experiments show InfRank algorithms have good accuracy, fast convergent rate and high performance.

关键词： data engineering knowledge engineering Iterative algorithms Attenuation measurement Helium knowledge management engineering management Linear systems Iterative methods Bipartite graph

来源：评论

学校读者我要写书评

暂无评论

S-SimRank: Combining Content and Link Information to Cluster Papers Effectively and Efficiently

S-SimRank: Combining Content and Link Information to Cluster...

引用

4th International Conference on Advanced data Mining and Applications

作者： Cai, Yuanzhe Li, Pei Liu, Hongyan He, Jun Du, Xiaoyong Key Labs of Data Engineering and Knowledge Engineering Ministry of Education China Department of Computer Science Renmin University of China China Department of Management Science and Engineering Tsinghua University China

ISBN: (纸本)9783540881919

Both Content analysis and link, analysis have its advantages in measuring relationships among documents. In this paper. we propose a new method to combine these two methods to compute the similarity of research papers so that we can do clustering of these papers more accurately. In order to improve the efficiency of similarity calculation, we develop a strategy to deal with the relationship graph separately, without affecting the accuracy. We also design an approach to assign different weights to different links to the papers, which can enhance the accuracy of similarity calculation. The experimental results conducted oil ACM data Set show that our new algorithm. S-SimRank, outperforms other algorithms.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

SimCon: A tool for modeling context sources for rapid evaluation of pervasive applications using virtual reality 5

SimCon: A tool for modeling context sources for rapid evalua...

引用

5th International ICST Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, MobiQuitous 2008

作者： McGlinn, Kris O'Neill, Eleanor Lewis, David Knowledge and Data Engineering Group Department of Computer Science Trinity College Dublin Dublin 2 Ireland

Here we present the SimCon tool to enable evaluators of pervasive applications to rapidly place and configure context sources within a Virtual Reality Environment to conduct repeatable evaluations early in the develop... 详细信息

ISBN: (纸本)9789639799219

关键词： Ubiquitous computing

来源：评论

学校读者我要写书评

暂无评论

GTMalpha - Towards a graphical notation for topic maps

GTMalpha - Towards a graphical notation for topic maps

引用

4th International Conference on Topic Maps Research and Applications, TMRA 2008

作者： Thomas, Hendrik Redmann, Tobias Pressler, Maik Markscheffel, Bernd Knowledge and Data Engineering Group School of Computer Science and Statistics Trinity College Dublin Ireland Department of Information and Knowledge Management Faculty of Economic Sciences Ilmenau University of Technology Germany

ISBN: (纸本)9783941152052

In the last years several drafts, recommendations and concepts for a graphical notation for Topic Maps have been published, but till today no graphical notation is generally approved and used in the Topic Maps community. In this paper we present GTMalpha as a conceptual new notation for a graphical representation of Topic Maps. Our objective is, to provide a practical usable notation, which allows a complete, consistent as well as easy to use graphical representation of any given topic map draft. GTMalpha provides a domain as well as a subject centric view and most important it considers the unique characteristics of the Topic Maps paradigm. This paper serves as a user oriented GTMalpha manual for ontology designers, domain experts as well as users.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共52页 << < 43 44 45 46 47 48 49 50 51 52 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：