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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

357 篇 期刊文献
316 篇 会议
1 册 图书

馆藏范围

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

日期分布

学科分类号

453 篇 工学
- 349 篇 计算机科学与技术...
- 300 篇 软件工程
- 96 篇 信息与通信工程
- 50 篇 电气工程
- 45 篇 控制科学与工程
- 44 篇 生物工程
- 39 篇 化学工程与技术
- 30 篇 生物医学工程（可授...
- 27 篇 电子科学与技术（可...
- 24 篇 机械工程
- 17 篇 光学工程
- 16 篇 航空宇航科学与技...
- 15 篇 建筑学
- 13 篇 交通运输工程
- 12 篇 仪器科学与技术
- 12 篇 土木工程
- 11 篇 动力工程及工程热...
200 篇 理学
- 116 篇 数学
- 50 篇 生物学
- 43 篇 统计学（可授理学、...
- 34 篇 物理学
- 25 篇 化学
- 15 篇 系统科学
144 篇 管理学
- 88 篇 管理科学与工程(可...
- 68 篇 图书情报与档案管...
- 29 篇 工商管理
31 篇 医学
- 24 篇 临床医学
- 20 篇 基础医学(可授医学...
- 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...
87 篇 school of comput...
32 篇 college of compu...
31 篇 key laboratory o...
24 篇 key laboratory o...
24 篇 key laboratory o...
22 篇 key laboratory o...
21 篇 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
24 篇 xindong wu
23 篇 sun geng
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
15 篇 chenyang bu
14 篇 he jun
13 篇 meng wang
13 篇 hong chen
13 篇 zhao zhang

语言

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

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

共 674 条记录，以下是631-640 订阅

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

详细简洁

排序：

Local methods for estimating SimRank score

Local methods for estimating SimRank score

引用

12th International Asia Pacific Web Conference, APWeb 2010

作者： Jia, Xu Liu, Hongyan Zou, Li He, Jun Du, Xiaoyong Cai, Yuanzhe Key Labs of Data Engineering and Knowledge Engineering Ministry of Education China Department of Computer Science Renmin University of China 100872 China Department of Management Science and Engineering Tsinghua University 100084 China Department of Computer Science University of Texas Arlington TX 76019 United States

ISBN: (纸本)9780769540122

SimRank is a well known algorithm which conducts link analysis to measure similarity between each pair of nodes (nodepair). But it suffers from high computational cost, limiting its usage in large-scale datasets. Moreover, Links between nodes are changing over time. It may be desirable to quickly approximate the similarity score between certain nodepair without performing a large-scale computation on the entire graph. In our approach we propose a method to efficiently estimate the similarity score using only a small subgraph of the entire graph. We call this novel algorithm "Local-SimRank". The experimental results conducted on real datasets and synthetic dataset show that our algorithm efficiently produces good approximations to the global SimRank scores. Meanwhile, we prove that the Local-SimRank score LS(a, b) is always less than original SimRank score S(a, b) mathematically. © 2010 IEEE.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Law Text Clustering Based on Referential Relations

Law Text Clustering Based on Referential Relations

引用

ChinaGrid Annual Conference (ChinaGrid)

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

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.

关键词： Clustering algorithms Heuristic algorithms databases Algorithm design and analysis Resource description framework data mining Semantics

来源：评论

学校读者我要写书评

暂无评论

Query-Aware Complex Object Buffer Management in XML Information Retrieval

Query-Aware Complex Object Buffer Management in XML Informat...

引用

International Asia-Pacific Web Conference (APWEB)

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

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.

关键词： Information management XML Information retrieval Tree data structures Indexing Prediction algorithms Algorithm design and analysis Frequency data analysis Information analysis

来源：评论

学校读者我要写书评

暂无评论

ParaCube: A Scalable OLAP Model Based on Distributed Aggregate Computing with Sibling Cubes

ParaCube: A Scalable OLAP Model Based on Distributed Aggrega...

引用

International Asia-Pacific Web Conference (APWEB)

作者： Yansong Zhang Shan Wang Wei Huang Key Laboratory of Ministry of Education of Data Engineering and Knowledge Engineering Beijing China School of Information Renmin University of China Beijing China

The requirements of OLAP applications increase rapidly by dramatically increased data volume, users, query volume and query complexity. The requirement for shortening update period in data warehouse is another crucial factor for a scalable OLAP application. In this paper, we propose a scalable OLAP prototype to support the query processing with increasing data volume by distributing the whole fact tuples to multiple servers to construct a set of sibling cubes which can be merged together to obtain the whole cube. We employ a light weight distribution policy with fully duplicated dimension tables in each sibling server on the observation of very low proportion of space cost for dimension tables. OLAP query with distributed aggregate functions can be transformed into queries to be performed parallel in sibling servers. For non-distributed computing aggregate functions, such as median, the optimized median aggregate computing algorithm is proposed to reduce transmission volume between servers while computing the global median values. We also present a three-level framework in data warehouse to meet the requirement of shorter update period in "operational business intelligence". An asynchronous tunnel model is proposed to reduce update latency by pre-fetching updated tuples to OLAP processing server. Finally, we set up prototype system ParaCube to evaluate performance in SN (shared-nothing) system and multi-core platforms.

关键词： Aggregates Distributed computing Concurrent computing data warehouses Merging Application software Prototypes Query processing Acceleration Material storage

来源：评论

学校读者我要写书评

暂无评论

Notice of Retraction: System Formulation of knowledge Sharing and Exchange in the Organization

Notice of Retraction: System Formulation of Knowledge Sharin...

引用

International Conference on Management and Service Science, MASS

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

This article has been retracted by the publisher.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An Integration Management System for Managing Business Continuity, Records and knowledge

An Integration Management System for Managing Business Conti...

引用

International Forum on Information Technology and Applications, IFITA

作者： Xiaomi An Lemen Chao Liuqi Ye Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Renmin University of China Beijing China Economic Management School Beijing Institute of Petrochemical and Technology Beijing China

Developing an integration management system for business continuity, records and knowledge (IMS of BRK) is beneficial to the collaboration, optimization and innovation of business continuity management system (BCMS), records management system (RMS) and knowledge management system (KMS) for organization. Comprehensive research and development requirements along with a cogent framework, however, have not been proposed for integrating three of them, which were proposed independently. Based on situational analysis of cross boundaries integration feasibilities in terms of common understandings, general principles and best practice frameworks from relevant national and international standards, this paper proposes integration thinking to combine the advantages of the three paradigms to sustainable competitive advantages; supported by international best practices, the authors propose an integration route covering five levels of integration framework, two integration approaches and three integration controls for dynamic accumulation, sharing and exchange of evidence, memory and knowledge in digital world and global competition.

关键词： Process control Organizations Best practices ISO standards Standards organizations Business continuity

来源：评论

学校读者我要写书评

暂无评论

The Integrated Use of Business Continuity Management Systems, Records Management Systems and knowledge Management Systems

The Integrated Use of Business Continuity Management Systems...

引用

International Conference on Management and Service Science, MASS

作者： Xiaomi An Wang Wang Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Renmin University of China Beijing China School of Information Resource Management Renmin University of China Beijing China

Much research has been done on integrated use of ISO management system standards. Integrated use of management systems is identified to have shared values of varied integration impacts on resources efficiency building and sustainable development of business processes. However, little research has been done on integrated use of business continuity management systems (BCMS), records management systems (RMS) and knowledge management systems (KMS). This paper proposes a holistic integration management approach for collaboration, optimization and innovation of the three management systems through mapping/building/operationalizing cycle for supply of efficiency building strategy to the dynamic accumulation, sharing, and exchanges of memory, evidence and knowledge of organization.

关键词： ISO standards Collaboration knowledge management Standards organizations Organizations

来源：评论

学校读者我要写书评

暂无评论

Efficient Common Items Extraction from Multiple Sorted Lists

Efficient Common Items Extraction from Multiple Sorted Lists

引用

International Asia-Pacific Web Conference (APWEB)

作者： Wei Lu Chuitian Rong Jinchuan Chen Xiaoyong Du Gabriel Pui Cheong Fung Xiaofang Zhou Ministry of Education Key Laboratories of Data Engineering and Knowledge Engineering China School of Information Renmin University of China China School of Computing Informatics Arizona State University USA School of ITEE University of Queensland Australia

Given a set of lists, where items of each list are sorted by the ascending order of their values, the objective of this paper is to figure out the common items that appear in all of the lists efficiently. This problem is sometimes known as common items extraction from sorted lists. To solve this problem, one common approach is to scan all items of all lists sequentially in parallel until one of the lists is exhausted. However, we observe that if the overlap of items across all lists is not high, such sequential access approach can be significantly improved. In this paper, we propose two algorithms, MergeSkip and MergeESkip, to solve this problem by taking the idea of skipping as many items of lists as possible. As a result, a large number of comparisons among items can be saved, and hence the efficiency can be improved. We conduct extensive analysis of our proposed algorithms on one real dataset and two synthetic datasets with different data distributions. We report all our findings in this paper.

关键词： data mining data engineering knowledge engineering Informatics Algorithm design and analysis Computer science Application software Information retrieval

来源：评论

学校读者我要写书评

暂无评论

Local Methods for Estimating SimRank Score

Local Methods for Estimating SimRank Score

引用

International Asia-Pacific Web Conference (APWEB)

作者： Xu Jia Hongyan Liu Li Zou Jun He Xiaoyong Du Yuanzhe Cai Ministry of Education Key Laboratories of Data Engineering and Knowledge Engineering China Department of Computer Science Renmin University of China China Department of Management Science and Engineering Tsinghua University China Department of Computer Science University of Texas Arlington TX USA

SimRank is a well known algorithm which conducts link analysis to measure similarity between each pair of nodes (nodepair). But it suffers from high computational cost, limiting its usage in large-scale datasets. Moreover, Links between nodes are changing over time. It may be desirable to quickly approximate the similarity score between certain nodepair without performing a large-scale computation on the entire graph. In our approach we propose a method to efficiently estimate the similarity score using only a small subgraph of the entire graph. We call this novel algorithm “Local-SimRank”. The experimental results conducted on real datasets and synthetic dataset show that our algorithm efficiently produces good approximations to the global SimRank scores. Meanwhile, we prove that the Local-SimRank score LS(a, b) is always less than original SimRank score S(a, b) mathematically.

关键词： Computer science Application software Web pages data engineering knowledge engineering Algorithm design and analysis Large-scale systems Computer science education Conference management knowledge management

来源：评论

学校读者我要写书评

暂无评论

Study in retrieval visibility and optical thickness of fog with MODTRAN

Study in retrieval visibility and optical thickness of fog w...

引用

International Conference on Multimedia Technology

作者： Zhang, Wengang Wei, Ming Yu, Tao Wang, Gengke Lai, Jibao Wang, Yuqing Key Laboratory of Meteorological Disaster of Ministry of Education Earth System Remote Sensing Institute Nanjing University of Information Science and Technology Nanjing 210044 China Center for National Space-borne Demonstration Beijing 100101 China Institute of Data and Knowledge Engineering Henan University Kaifeng Henan 475001 China Binjiang College Nanjing University of Information Science and Technology Nanjing 210044 China

ISBN: (纸本)9781424478743

In recent years, many scientists have done some work in monitoring the fog, and achieved fruitful results. Now we want to conduct more in-depth study. In this paper, we utilize MODTRAN to simulate the relationship between transmittance and visibility, height of fog. By fitting the relationship between them, we get the formula that calculates visibility of fog using transmittance and height of fog. The correlation coefficient of this formula is very high, so it can be regarded as an accuracy one. The height of fog can be calculated by top temperature of fog, surface temperature and vertical lapse rate. The transmittance of the fog can be measured by using special instrument. Therefore, the visibility and optical thickness can be retrieved by this method. ©2010 IEEE.

关键词： Visibility

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：