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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

637 篇 会议
476 篇 期刊文献
4 册 图书

馆藏范围

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

日期分布

学科分类号

718 篇 工学
- 584 篇 计算机科学与技术...
- 481 篇 软件工程
- 169 篇 信息与通信工程
- 68 篇 控制科学与工程
- 66 篇 生物工程
- 58 篇 电气工程
- 41 篇 电子科学与技术（可...
- 38 篇 化学工程与技术
- 35 篇 机械工程
- 28 篇 生物医学工程（可授...
- 24 篇 仪器科学与技术
- 23 篇 动力工程及工程热...
- 18 篇 建筑学
- 17 篇 光学工程
- 17 篇 交通运输工程
- 17 篇 航空宇航科学与技...
- 14 篇 土木工程
301 篇 理学
- 183 篇 数学
- 66 篇 生物学
- 58 篇 统计学（可授理学、...
- 52 篇 物理学
- 40 篇 化学
- 23 篇 系统科学
299 篇 管理学
- 183 篇 图书情报与档案管...
- 143 篇 管理科学与工程(可...
- 46 篇 工商管理
39 篇 法学
- 33 篇 社会学
30 篇 医学
- 27 篇 临床医学
- 20 篇 基础医学(可授医学...
19 篇 经济学
- 19 篇 应用经济学
7 篇 教育学
6 篇 文学
5 篇 农学
1 篇 军事学
1 篇 艺术学

主题

61 篇 semantics
39 篇 knowledge engine...
37 篇 data mining
30 篇 training
25 篇 feature extracti...
23 篇 data engineering
20 篇 xml
20 篇 laboratories
20 篇 computational mo...
20 篇 information retr...
19 篇 conferences
19 篇 task analysis
19 篇 big data
18 篇 knowledge manage...
18 篇 data models
17 篇 visualization
16 篇 databases
15 篇 search engines
15 篇 algorithm design...
14 篇 query processing

机构

194 篇 school of inform...
105 篇 school of comput...
52 篇 key laboratory o...
49 篇 key laboratory o...
33 篇 school of inform...
32 篇 jiangxi key labo...
30 篇 key laboratory o...
29 篇 college of compu...
29 篇 key laboratory o...
28 篇 department of ma...
25 篇 key laboratory o...
25 篇 key laboratory o...
24 篇 school of econom...
23 篇 key laboratory o...
21 篇 school of inform...
20 篇 key laboratory o...
18 篇 key laboratory o...
18 篇 key lab of data ...
18 篇 key laboratory o...
18 篇 key laboratory o...

作者

71 篇 du xiaoyong
60 篇 chen hong
38 篇 li cuiping
37 篇 xiaoyong du
34 篇 wu xindong
33 篇 he jun
33 篇 wang meng
31 篇 liu hongyan
30 篇 li xirong
29 篇 hong chen
29 篇 wang shan
28 篇 zhang jing
26 篇 xindong wu
23 篇 sun geng
21 篇 niyato dusit
19 篇 huang qingming
19 篇 hong richang
18 篇 shan wang
18 篇 liu jun
18 篇 xu qianqian

语言

1,043 篇 英文
49 篇 其他
25 篇 中文

检索条件"机构=Key Laboratories of Data Engineering and Knowledge Engineering"

共 1117 条记录，以下是1001-1010 订阅

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

详细简洁

排序：

Deprank: A probabilistic measure of dependence via heterogeneous links

Deprank: A probabilistic measure of dependence via heterogen...

引用

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

作者： Li, Pei Hu, Bo Liu, Hongyan He, Jun Du, Xiaoyong 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

ISBN: (纸本)9783642006715

Dependence is a common relationship between objects. Many works have paid their attentions on dependence, but many of them mainly focus on constructing or exploiting dependence graphs on some specific domain. In this paper, we give a generic definition of dependence and make equivalence to the situation of graphs, and propose an algorithm called DepRank, which quantifies the dependence degree of a node pair based on probabilities of all dependence paths. Empirical study shows that DepRank method has reasonable results and maintains a well balance between accuracy and efficiency. © Springer-Verlag Berlin Heidelberg 2009.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

9th IEEE International Conference on data Mining

作者： Cai, Yuanzhe Cong, Gao Jia, Xu Liu, Hongyan He, Jun Lu, Jiaheng 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 Computer Science Aalborg University Denmark Department of Management Science and Engineering Tsinghua University China

ISBN: (纸本)9781424452422

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.

关键词： Similarity Calculation SimRank Graph Mining

来源：评论

学校读者我要写书评

暂无评论

MrCAR: A Multi-relational Classification Algorithm based on Association Rules

MrCAR: A Multi-relational Classification Algorithm based on ...

引用

International Conference on Web Information Systems and Mining

作者： Gu, Yingqin Liu, Hongyan He, Jun Hu, Bo Du, Xiaoyong Key Labs. of Data Engineering and Knowledge Engineering MOE China Information School Renmin University of China Beijing 100872 China School of Economics and Management Tsinghua University Beijing 100084 China

ISBN: (纸本)9780769538174

Classification is an important subject in data mining and machine learning, which has been studied extensively and has a wide range of applications. Classification based on association rules is one of the most effective classification method, whose accuracy is higher and discovered rules are easier to understand comparing with classical classification methods. However, current algorithms for classification based on association rules is single table oriented, which means they can only apply to the data stored in a single relational table. Directly applying these algorithms in multi-relational data environment will result in many problems. This paper proposes a novel algorithm MrCAR for classification based on association rules in multi-relational data environment. MrCAR mines relevant features in each table to predict the class label. Close itemsets technique and Tuple ID Propagation method are used to improve the performance of the algorithm. Experimental results show that MrCAR has higher accuracy and better understandability comparing with a typical existing multirelational classification algorithm.

关键词： Association rules

来源：评论

学校读者我要写书评

暂无评论

An apparel trade quotation architecture based on BPM and SOA

An apparel trade quotation architecture based on BPM and SOA

引用

13th Pacific Asia Conference on Information Systems: IT Services in a Global Environment, PACIS 2009

作者： Li, Qian Chen, Yu Zhang, Lan Fang Information School Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China Beijing 100872 China School of Information Management Science and Engineering Renmin University of China Beijing 100872 China

Based on the analysis of problems and difficulties in apparel quotation system, this paper puts forward the combination of BPM and SOA as a new idea for analysis of apparel quotation system, according to their advantages in business goals and requirements analysis, and the corresponding services' definition, extraction, optimization and integration. Through the combination, system flexibility, rapidity and accuracy could be achieved. The establishment of Service Repository according to the business requirements, is a crucial part in the architecture, however there are no definite rules for service extraction. In this paper, the detailed activities and steps, as well as a specific establishment case is illustrated. At last, architecture based on BPM and SOA for the apparel trade quotation is put forward, and its composition and implement are also analyzed.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

Services analysis in apparel quotation system based on SOA

Services analysis in apparel quotation system based on SOA

引用

International Conference on Management and Service Science, MASS 2009

作者： Li, Qian Chen, Yu Lanfang, Zhang Information School and Key Laboratory of Data Engineering and Knowledge Engineering School of Information Renmin University of China Beijing China School of Information Renmin University of China Beijing China

ISBN: (纸本)9781424446391

Based on the analysis of quote business processes, as well as the characteristics of SOA, a quotation system is brought forward based on SOA for apparel international trade, in order to enhance the Quote's diversity, accuracy as well as efficiency. This paper puts great importance on analyzing how to define, extract, as well as implement services, not only for needs from quotation business process, but also from quotation business goals. Based on the analysis of services, finally, an apparel quotation architecture is described in details. ©2009 IEEE.

关键词： International trade

来源：评论

学校读者我要写书评

暂无评论

DB Facade: A web cache with improved data freshness

DB Facade: A web cache with improved data freshness

引用

2nd International Symposium on Electronic Commerce and Security, ISECS 2009

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

ISBN: (纸本)9780769536439

Traditional web database cache techniques have a major disadvantage, namely poor data freshness, because they employ an asynchronous data refresh strategy. A novel web database cache, DB Façade, is proposed in this paper. DB Facade uses a main memory database to cache result sets of previous queries for subsequent reusing. Updates on backend database system are managed by delta tables, and then propagated to web database cache in a near real-time manner, hence guarantee the freshness of data. DB Facade offloads query burden from backend database systems, and exploits the power of main memory database system to boost query performance. TPC-W testing result shows that the system's performance increases by about 17 percent. © 2009 IEEE.

关键词： Facades

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Rapid resynchronization method for replication in-memory databases supporting mobile communication applications

Rapid resynchronization method for replication in-memory dat...

引用

2009 WRI World Congress on Computer Science and Information engineering, CSIE 2009

作者： Guoqiong, Liao Jing, Li School of Information Technology Jiangxi University of Finance and Economics Nanchang 330013 Thailand Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang 330013 Thailand

ISBN: (纸本)9780769535074

In this paper, a rapid resynchronization method using intent logs is suggested for replication In-memory databases supporting mobile communication applications. Both the identifiers of unsynchronized segments and the identifiers of the slaves who have missed the updates in the segments are recorded in the intent logs. When receiving a resynchronization request from a slave, the master will scan the intent logs to find the unsynchronized segments for the salve, and then send the segments gotten directly from its memory to the slave. The performance results shown the intent logs method can reduce resynchronization time than methods using transaction logs. © 2008 IEEE.

关键词： Mobile telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

Efficient Computation of Reverse Skyline on data Stream

Efficient Computation of Reverse Skyline on Data Stream

引用

The Second International Joint Conference on Computational Science and Optimization(CSO 2009)(2009 国际计算科学与优化会议)

作者： Ling Zhu Cuiping Li Hong Chen School of Information Renmin University of China Key Lab of Data Engineering and Knowledge Engineering of MOE

Reverse Skyline Queries have been proved very useful in business location, environmental monitoring and some other applications. In this paper, we consider reverse skyline queries processing on data stream, which provides continuous, high-speed data elements. Specifically, we consider the latest objects in the sliding window. The challenge is that it is difficult to maintain a multidimensional index (for example, R-tree) in a dynamic dataset. Focusing on this challenge, we propose an algorithm with a DC-Tree as index and effective pruning methods to reduce the search space of query processing and the cost of index maintaining. Extensive experiments show that our algorithms are efficient and effective for on-line reverse skyline query.

关键词： Monitoring Query processing Costs data engineering knowledge engineering Multidimensional systems

来源：评论

学校读者我要写书评

暂无评论

Efficient processing of global Top-k aggregate queries in uncertain database

Efficient processing of global Top-k aggregate queries in un...

引用

2009 International Conference on Information engineering and Computer Science, ICIECS 2009

作者： Xing, Xianli Liu, Dexi Principal's Office Jiangxi University of Finance and Economics Nanchang China School of Information Technology Jiangxi University of Finance and Economics Jiangxi Key Laboratory of Data and Knowledge Engineering Nanchang China

ISBN: (纸本)9781424449941

Top-k queries in uncertain databases are quite popular and useful due to its wide application usage. However, compared to Top-k in traditional databases, queries over uncertain database are more complicated because of the existence of exponential possible worlds. A Top-k aggregate query ranks groups of tuples by their aggregate values, sum or average for example, and returns k groups with the highest aggregate values. As a powerful semantic of Top-k, Global Top-k, returns k highest-ranked tuples according to their probabilities of being in the Top-k answers in possible worlds. We propose a dynamic programming based method to process Global Top-k aggregate queries in uncertain database, where the number of retrieved tuples and group states generated on these tuples are minimized. Experiment results show that our algorithm is effective. ©2009 IEEE.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共112页 << < 97 98 99 100 101 102 103 104 105 106 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：