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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

352 篇 期刊文献
315 篇 会议

馆藏范围

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

日期分布

学科分类号

449 篇 工学
- 347 篇 计算机科学与技术...
- 300 篇 软件工程
- 96 篇 信息与通信工程
- 50 篇 电气工程
- 45 篇 控制科学与工程
- 44 篇 生物工程
- 39 篇 化学工程与技术
- 29 篇 生物医学工程（可授...
- 26 篇 电子科学与技术（可...
- 24 篇 机械工程
- 17 篇 光学工程
- 16 篇 航空宇航科学与技...
- 15 篇 建筑学
- 13 篇 交通运输工程
- 12 篇 仪器科学与技术
- 12 篇 土木工程
- 11 篇 动力工程及工程热...
199 篇 理学
- 116 篇 数学
- 50 篇 生物学
- 43 篇 统计学（可授理学、...
- 34 篇 物理学
- 25 篇 化学
- 14 篇 系统科学
144 篇 管理学
- 88 篇 管理科学与工程(可...
- 68 篇 图书情报与档案管...
- 29 篇 工商管理
30 篇 医学
- 24 篇 临床医学
- 19 篇 基础医学(可授医学...
- 12 篇 药学(可授医学、理...
15 篇 法学
- 13 篇 社会学
10 篇 农学
9 篇 经济学
3 篇 教育学
3 篇 文学
2 篇 艺术学

主题

35 篇 semantics
21 篇 knowledge engine...
21 篇 training
20 篇 conferences
20 篇 data mining
18 篇 feature extracti...
15 篇 task analysis
14 篇 deep learning
12 篇 data models
11 篇 big data
11 篇 machine learning
10 篇 computational mo...
10 篇 visualization
9 篇 object detection
9 篇 knowledge graph
8 篇 computer science
8 篇 knowledge manage...
8 篇 convolution
8 篇 contrastive lear...
8 篇 predictive model...

机构

89 篇 school of inform...
86 篇 school of comput...
32 篇 college of compu...
31 篇 key laboratory o...
24 篇 key laboratory o...
24 篇 key laboratory o...
22 篇 key laboratory o...
20 篇 key laboratory o...
18 篇 key laboratory o...
14 篇 key labs of data...
14 篇 key laboratory o...
14 篇 key laboratory o...
13 篇 college of compu...
13 篇 pazhou lab
13 篇 department of ma...
12 篇 key laboratory o...
12 篇 key laboratory o...
12 篇 key laboratory o...
11 篇 school of softwa...
10 篇 mininglamp acade...

作者

32 篇 wu xindong
29 篇 du xiaoyong
28 篇 chen hong
23 篇 sun geng
22 篇 xindong wu
21 篇 li cuiping
20 篇 niyato dusit
17 篇 wang meng
17 篇 zhang jing
17 篇 xiaoyong du
15 篇 liu hongyan
15 篇 xuegang hu
15 篇 wang yang
15 篇 li jiahui
15 篇 wang jiacheng
14 篇 he jun
14 篇 chenyang bu
13 篇 meng wang
13 篇 hong chen
13 篇 zhao zhang

语言

611 篇 英文
43 篇 其他
13 篇 中文

检索条件"机构=Key Lab of Data Engineering and Knowledge Engineering of Ministry of Education"

共 667 条记录，以下是611-620 订阅

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

详细简洁

排序：

FlexTable: Using a Dynamic Relation Model to Store RDF data

FlexTable: Using a Dynamic Relation Model to Store RDF Data

引用

15th International Conference on database Systems for Advanced Applications

作者： Wang, Yan Du, Xiaoyong Lu, Jiaheng Wang, Xiaofang Key Labs of Data Engineering and Knowledge Engineering Ministry of Education China Information School Renmin University of China China

ISBN: (纸本)9783642120251

Efficient management of RDF data is an important factor in realizing the Semantic Web vision. The existing approaches store RDF data based on triples instead of a relation model. In this paper, we propose a system called FlexTable, where all triples of an instance are coalesced into one tuple and all tuples are stored in relation schemas. The main technical challenge is how to partition all the triples into several tables, i.e. it is needed to design an effective and dynamic schema structure to store RDF triples. To deal with this challenge, we firstly propose a schema evolution method called LBA, which is based on a lattice structure to automatically evolve schemas while new triples are inserted. Secondly, we propose a novel page layout with an interpreted storage format to reduce the physical adjustment cost during schema evolution. Finally we perform comprehensive experiments on two practical RDF data sets to demonstrate that FlexTable is superior to the state-of-the-art approaches.

关键词： FlexTable RDF data dynamic relational model Lattice

来源：评论

学校读者我要写书评

暂无评论

SeCCX: Semantics-based fine granular concurrency control for XML data

SeCCX: Semantics-based fine granular concurrency control for...

引用

1st International Workshop on Graph database, IWGD 2010, 1st International Workshop on Advanced Techniques on XML data Management, XMLDM 2010, 2nd International Workshop on WCMT 2010, Held in Conj. with WAIM 2010

作者： Rong, Chuitian Lu, Wei Zhang, Xiao Liu, Zhen Du, Xiaoyong Key Labs. of Data Engineering and Knowledge Engineering Ministry of Education China School of Information Renmin University of China China

ISBN: (纸本)3642167195

This paper proposes a new locking protocol, SeCCX, for isolation of concurrent transactions on XML data. This protocol adopts the semantics of operations issued by users. Comparing with previous XML locking protocols, SeCCX has some new features, like richer lock modes, finer granular, lower lock confliction and dynamic lock escalation. The importance is that it locks the objects according to the semantics of user's operation and sets different restrictions on different objects. It provides finer granular concurrency control such that the overall system performance can be improved. We prove that the SeCCX protocol is conflict serializability. We also compare it with other protocols to demonstrate the advantages of SeCCX. © 2010 Springer-Verlag.

关键词： Locks (fasteners)

来源：评论

学校读者我要写书评

暂无评论

Law text clustering based on referential relations

Law text clustering based on referential relations

引用

5th Annual ChinaGrid Conference, ChinaGrid 2010

作者： Fan, Biao Liu, Tao Hu, He Du, Xiaoyong Key Labs of Data Engineering and Knowledge Engineering Ministry of Education China School of Information Renmin University of China Beijing China

ISBN: (纸本)9780769541068

This paper proposes a new method to cluster law texts based on referential relation of laws. We extract law entities (an entity represents a law) and their referential relation from law texts. Then SimRank algorithm is applied to calculate law entity's similarity through referential relation and law clustering is carried out based on the SimRank similarity. This is the first time to apply SimRank algorithm in the domain of Law and use it to carry out text clustering. Prototype and experiments show that our solution is feasible. We also publish the extracted data as Linked Law data with RDF data model, which forms the first open semantic web database in Law domain. Linked Law data enables user to access law data with rich data links and query web data by application interface of Semantic Web. © 2010 IEEE.

关键词： Cluster analysis

来源：评论

学校读者我要写书评

暂无评论

Query-aware complex object buffer management in XML information retrieval

Query-aware complex object buffer management in XML informat...

引用

12th International Asia Pacific Web Conference, APWeb 2010

作者： Li, Qiushi Wang, Qiuyue Wang, Shan Key Laboratory of the Ministry of Education for Data Engineering and Knowledge Engineering China School of Information Renmin University of China Beijing 100872 China

ISBN: (纸本)9780769540122

in this paper, we analyse the data access characteristics of a typical XML information retrieval system and propose a new query aware buffer replacement algorithm based on prediction of Minimum Reuse Distance (MRD for short). The algorithm predicts an object's next reference distance according to the retrieval system's running status and replaces the objects that have maximum reuse distances. The factors considered in the replacement algorithm include the access frequency, creation cost, and size of objects, as well as the queries being executed. By taking into account the queries currently running or queuing in the system, MRD algorithm can predict more accurately the reuse distances of index data objects. © 2010 IEEE.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

Detecting Hot Events from Web Search Logs

Detecting Hot Events from Web Search Logs

引用

11th International Conference on Web-Age Information Management (WAIM 2010)

作者： Gu, Yingqin Cui, Jianwei Liu, Hongyan Jiang, Xuan He, Jun Du, Xiaoyong Li, Zhixu Key Labs. of Data Engineering and Knowledge Engineering Ministry of Education China School of Information Renmin University of China Beijing 100872 China Department of Management Science and Engineering Tsinghua University Beijing 100084 China

ISBN: (纸本)9783642142451

Detecting events from web resources is a challenging task, attracting many attentions in recent years. Web search log is an important data source for event detection because the information it contains reflects users' activities and interestingness to various real world events. There are three major issues for event detection from web search logs: effectiveness, efficiency and the organization of detected events. In this paper, we develop a novel Topic and Event Detection method, TED, to address these issues. We first divide the whole data into topics for efficiency consideration, and then incorporate link information, temporal information and query content to ensure the quality of detected events. Finally, events detected are organized through the proposed interestingness measure as well as topics they belong to. Experiments are conducted on a commercial search engine log. The results demonstrate that our method can effectively and efficiently detect hot events and give a meaningful organization of them.

关键词： Event detection click-through data efficient algorithm

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Optimizing queries with expensive video predicates based on estimation of attribute cardinality

Optimizing queries with expensive video predicates based on ...

引用

International Conference on Multimedia Information Networking and Security

作者： Yu, Lisheng Zhang, Jianmei Wang, Shan Key Laboratory of 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

ISBN: (纸本)9780769542584

With rapid advances in video processing technologies, video data increased rapidly and becomes popular in our daily life for both professional and consumer applications, e.g., surveillance, education, entertainment. Such needs require the data management system not only can store and access the video content, but also able to optimize the queries with expensive video predications in an effective and efficient way. In previous research literature, query optimizations in relational database systems (RDBMS) are often based on disk I/O cost of involved operations. However, for a query that contains expensive video predicates, traditional cost estimation model does not work well. Although researchers have proposed some approaches which can solve the problem in certain situations, there are still some unresolved issues, and it needs further optimization. In this paper, motivate from a real-world large supermarket's business data and video surveillance data management scenario, through considering the characteristics of video data and its expensive processing, we propose a novel query optimization approach that caches operators' results and reconstructs the join order based estimation for attribute cardinality. This approach reduces the invoking times of expensive video predicate in a greater degree and gives a better solution for mixed query optimization which contains traditional data types and large object operations. The experiment result is satisfactory while compare with existing expensive predicates query optimization methods. © 2010 IEEE.

关键词： Relational database systems

来源：评论

学校读者我要写书评

暂无评论

RETRACTED ARTICLE: Studies of knowledge management methods from literature

RETRACTED ARTICLE: Studies of knowledge management methods f...

引用

作者： Zhang, Jing Ye, Liuqi Business School of Hohai University Nanjing Jiangsu 210098 China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Renmin University of China Beijing 100872 China

ISBN: (纸本)9781424469291

knowledge management methods reflect ways to undertake knowledge management objectives and actions taken for implementation. However, little has been written on the topic. The paper summarizes main topics of knowledge management methods from literature, including research contents, management methods, main types, objects involved, study domains, perspectives, objectives and tasks, school and achieving channels, developing trends and knowledge management methodology and etc. © 2010 IEEE.

关键词： knowledge management

来源：评论

学校读者我要写书评

暂无评论

The internet of things and personal privacy protection

The internet of things and personal privacy protection

引用

2010 International Conference of Logistics engineering and Management: Logistics for Sustained Economic Development - Infrastructure, Information, Integration, ICLEM 2010

作者： Zhang, Jing Ye, Liuqi Business School Hohai University Nanjing Jiangsu 210098 China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Renmin University of China Beijing 100872 China

ISBN: (纸本)9780784411391

Protecting personal privacy and its right are a respect for the human rights, the necessary condition for healthy development of a democratic society and the important criteria of maintaining the basic dignity to be human. The internet of things with its ubiquitous data-aware and intelligent information processing capabilities, improves social efficiency and severe challenges for information security and privacy. In this environment, how to ensure information security and privacy are a major breakthrough in one of the obstacles and an important issue that must be addressed and resolved in the developing process of the internet of things. Thus, in the development of it, we should follow the basic principles of protecting personal privacy such as the entire management, legal compliance, security, adding information, balance and accountability, and establish such models of protecting personal privacy as laws, industry self-regulation and technology to fully protect the inviolability of personal privacy, and remove obstacles and barriers for the applications of the internet of things. © 2010 ASCE.

关键词： Logistics

来源：评论

学校读者我要写书评

暂无评论

A support vector machine based method for credit risk assessment

A support vector machine based method for credit risk assess...

引用

International Workshop on Cloud Services-Platform Accelerating E-Business

作者： Xu, Wei Zhou, Shenghu Duan, Dongmei Chen, Yanhui Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China Ministry of Education Beijing 100872 China School of Information Renmin University of China Beijing 100872 China

ISBN: (纸本)9780769542270

The credit card industry has been growing rapidly in recent years, and credit risk assessment becomes critically important for financial companies. In this paper, a novel support vector machine (SVM) based ensemble model is proposed for credit risk assessment. In the proposed method, principles component analysis (PCA) is firstly employed for credit feature selection. Secondly, SVMs with different kernels are trained by using genetic algorithm (GA) to optimize the parameters, and the corresponding assessment results are obtained. Thirdly, all results produced by different SVMs are combined by several ensemble strategies. Finally, an optimal ensemble strategy is selected for credit scoring. For validation, two real world credit datasets are used to test the effectiveness and efficiency of our proposed method. The experiment results find that our proposed ensemble model outperforms commonly used credit scoring tools. The findings of the study reveal the support vector machine based ensemble method to be a promising alternative for credit scoring. © 2010 IEEE.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共67页 << < 58 59 60 61 62 63 64 65 66 67 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：