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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

635 篇 会议
467 篇 期刊文献
4 册 图书

馆藏范围

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

日期分布

学科分类号

713 篇 工学
- 584 篇 计算机科学与技术...
- 481 篇 软件工程
- 165 篇 信息与通信工程
- 68 篇 控制科学与工程
- 67 篇 生物工程
- 55 篇 电气工程
- 39 篇 电子科学与技术（可...
- 37 篇 化学工程与技术
- 36 篇 机械工程
- 31 篇 生物医学工程（可授...
- 23 篇 仪器科学与技术
- 23 篇 动力工程及工程热...
- 19 篇 光学工程
- 19 篇 建筑学
- 17 篇 交通运输工程
- 17 篇 航空宇航科学与技...
302 篇 管理学
- 184 篇 图书情报与档案管...
- 146 篇 管理科学与工程(可...
- 49 篇 工商管理
292 篇 理学
- 176 篇 数学
- 67 篇 生物学
- 55 篇 统计学（可授理学、...
- 51 篇 物理学
- 41 篇 化学
- 22 篇 系统科学
39 篇 法学
- 33 篇 社会学
30 篇 医学
- 26 篇 临床医学
- 20 篇 基础医学(可授医学...
- 14 篇 药学(可授医学、理...
22 篇 经济学
- 22 篇 应用经济学
7 篇 教育学
6 篇 文学
5 篇 农学
1 篇 军事学
1 篇 艺术学

主题

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

机构

195 篇 school of inform...
105 篇 school of comput...
52 篇 key laboratory o...
49 篇 key laboratory o...
33 篇 school of inform...
32 篇 jiangxi key labo...
31 篇 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
38 篇 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
20 篇 niyato dusit
19 篇 huang qingming
19 篇 hong richang
18 篇 shan wang
18 篇 liu jun
18 篇 xu qianqian

语言

1,035 篇 英文
47 篇 其他
24 篇 中文

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

共 1106 条记录，以下是941-950 订阅

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

详细简洁

排序：

ParaCube: A scalable OLAP model based on distributed aggregate computing with sibling cubes

ParaCube: A scalable OLAP model based on distributed aggrega...

引用

12th International Asia Pacific Web Conference, APWeb 2010

作者： Zhang, Yansong Wang, Shan Huang, Wei Key Laboratory of the Ministry of Education for Data Engineering and Knowledge Engineering Beijing 100872 China School of Information Renmin University of China Beijing 100872 China Department of Computer Harbin Financial College Harbin Helongjiang 150030 China

ISBN: (纸本)9780769540122

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. © 2010 IEEE.

关键词： data warehouses

来源：评论

学校读者我要写书评

暂无评论

Towards comprehensive integration management of business continuity, records and knowledge

Towards comprehensive integration management of business con...

引用

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

ISBN: (纸本)9788988678251

Many of management systems for business continuity, records and knowledge (BRK) are standalone. Connections and networks of business continuity management systems (BCMS), records management systems (RMS) and knowledge management systems (KMS) are expected to study for facing challenges from evidence-based collaborations in a networked working environment, in terms of control of documented information for business efficiency;guarantee of evidentiality and quality of documented information for organizational effectiveness;and sharing, protecting and increasing values of records as business and knowledge assets for knowledge economy. Based on review of ideas of integration management thinking, best practice frameworks of business continuity management, records management and knowledge management, management models of BCMS, RMS and KMS, an architecture framework towards comprehensive integration management of BRK is proposed by vertical integration design and crosswise integration operations. Case studies demonstrate that such architecture framework has implications to enhance controls of efficiency, effectiveness, and economy of organizational resources and assets adaptable to complex global competition;to improve quality assurance of documented information for supporting evidence-based governance adaptable to dynamic changing of information and communication technologies;to consistent accumulation, sharing and exchanging evidence, memory and knowledge along e-business processes to promote collaboration, optimization and innovation of BCMS, RMS and KMS.

关键词： knowledge management

来源：评论

学校读者我要写书评

暂无评论

Interference and power constrained broadcast and multicast routing in wireless ad hoc networks using directional antennas

Interference and power constrained broadcast and multicast r...

引用

作者： Li, Zheng Li, Deying Liu, Ming School of Information Renmin University of China Beijing 100872 China Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE Beijing 100872 China School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu 610054 China

In this paper, we address the interference and power constrained broadcast/multicast routing problem (D-IPCB/M) in wireless ad hoc networks using directional antenna as a starting point, which jointly considers low-interference and energy-efficiency issues. Then we study the delay-bounded interference and power constrained broadcast/multicast routing problem (DB-D-IPCB/M). An approximation algorithm and a heuristic algorithm with low time complexity are proposed for the D-IPCB/M and DB-D-IPCB/M problem, respectively. Finally, we explore and investigate the multi-constrained subgraph optimization (MCSO) problem. We prove its NP-hard and propose an approximation scheme with theoretical performance guarantee for this class of optimization problems. This is a general result originated from the study of D-IPCB/M and DB-D-IPCB/M problems, which can be applicable to solve different optimization problems such as the multi-constrained broadcast/multicast routing problems. Broadcast/multicast message by using the routing trees found by our algorithms tends to not only have less channel collisions but also save energy to extend network lifetime. The theoretical results are evaluated by simulation studies. © 2010 Elsevier B.V. All rights reserved.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

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)

来源：评论

学校读者我要写书评

暂无评论

Managing a Large Shared Bank of Unstructured data by Using Free-Table

Managing a Large Shared Bank of Unstructured Data by Using F...

引用

International Asia-Pacific Web Conference (APWEB)

作者： Xiao Zhang Xiaoyong Du Jinchuan Chen Shan Wang Key Laboratory of Data Engineering and Knowledge Engineering MOE Renmin University of China Beijing China

This paper presents a reference framework, called BUD, to manage a large shared bank of unstructured data. This paper lists several important issues on managing or maintaining the unstructured data in BUD. BUD stores and manages the ever-growing unstructured data by introducing a novel technique called free-table, which is a conceptual view for end-users and a physical entity maintained by transactional storage manager of BUD. Free-table is cell-oriented but not column-oriented as relational table. It can store various types of unstructured data in cell with different versions. Additionally, we study two cases, VMP and PXRDB, to show that our proposal is feasible and tractable.

关键词： data models Conference management knowledge management engineering management data engineering Proposals Maintenance engineering knowledge engineering data mining Relational databases

来源：评论

学校读者我要写书评

暂无评论

Vulnerabilities static detection for Web applications with false positive suppression

Vulnerabilities static detection for Web applications with f...

引用

2010 IEEE International Conference on Information Theory and Information Security, ICITIS 2010

作者： Huang, Jianjun Liang, Bin Zhong, Jiagui Wang, Qianqian Cai, Jingjing 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 Beijing Venustech Cybervision Co. Ltd Beijing 100094 China

ISBN: (纸本)9781424469406

Web applications become more and more important, and the corresponding security problems have been concerned about. This paper presents TASA, an ASP static analyzer, which employs a path-sensitive, inter-procedural and context-sensitive data flow analysis, mainly concerning the taint propagation and sanitization. This paper also discusses some techniques used in TASA, such as sanitization routines modeling, ASP specific features, alias analysis and path-related routines modeling, to prune false positives. Experiments on four open source applications show that TASA has a rate of false positive of 4.98% and it can avoid certain false warnings owing to the proposed approaches. © 2010 IEEE.

关键词： data flow analysis

来源：评论

学校读者我要写书评

暂无评论

SWEE: Approximately searching web service with keywords effectively and efficiently

SWEE: Approximately searching web service with keywords effe...

引用

The 2nd IEEE International Conference on Advanced Computer Control(第二届先进计算机控制国际会议 ICACC 2010)

作者： Zuoyan Qin Peng Li Qing Zhu Chao Tian Key Laboratory of Data Engineering and Knowledge Engineering School of Information Renmin University of China Beijing 100872

ISBN: (纸本)9781424458455;9781424458486;9781424458479;9781424458462

With the wide use of web services over the world, an effective and efficient search engine becomes necessary. In this paper, we analyzed the limitation of search method using traditional UDDI, and make it in LR-sryle and take advantage of approximate string matching. Motivated by the feature of WSDL files which define the interfaces of web services, we make operations defined in WSDL files which compose web services as the base units for searching and organize all information of operations and corresponding components as documents, which will facilitate IRStyle keyword searching. In order to improve the precision of searching, we enable users to specify weights in their queries. By defining our ranking function, we sort all the results and present top n ones to users. We also build inverted indexes on operations and corresponding documents to improve query efficiency. In addition, we carry out simple semantic analysis on WSDL files. to acquire better accuracy. At last, not only have we tested the efficiency of query after introducing approximate string matching, but also have we verified the effectiveness of the query results.

关键词： Web Service Search engines String matching fundamental units Consumers Search methods Searches keyWORD Surgery

来源：评论

学校读者我要写书评

暂无评论

Geometric Routing Precluding Loops and Dead Ends in 3-D Wireless Sensor Networks

Geometric Routing Precluding Loops and Dead Ends in 3-D Wire...

引用

2010 IEEE Global Telecommunications Conference GLOBECOM 2010

作者： Jun Duan Deying Li Wenping Chen Key Laboratory of Data Engineering and Knowledge Engineering MOE School of Information Renmin University of China Beijing China

Numerous algorithms on geometric networks has been studied, and most of them were based on 2-dimensional networks. But 2-dimensional geometric routing algorithms cannot be directly adapted to the 3-dimensional networks. In this paper, we propose routing algorithms based on the iteration of specific angles on the networks of Delaunay Triangulation in 3D space, and prove the certainty of data transmission of our routing algorithms. In the algorithms, the messages only need to carry information of O(1) nodes and each node just keeps 1-hop neighbors' information.

关键词： Routing Peer to peer computing Three dimensional displays Algorithm design and analysis Compass Wireless sensor networks Relays

来源：评论

学校读者我要写书评

暂无评论

Trust Service Discovery by Opinions Classification on Virtual Communities

Trust Service Discovery by Opinions Classification on Virtua...

引用

International Conference on Networks Security, Wireless Communications and Trusted Computing, NSWCTC

作者： Qing Zhu Department of Computer Science Information School Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China Beijing China

ISBN: (纸本)9781424465972;9780769540115

Internet has become an excellent ecommerce platform for bringing together large numbers of buyers and sellers across wide geographic regions. Trust and reputation systems represent a. significant trend in decision support for Internet mediated service provision. However, most existing work assumes that all users have the same trust metrics, but in real life different users often have different preference of product attributes. This paper proposes trusted query navigation model by analyzing online customer reviews of trustworthiness of websites. The first step analyzes counting history feedback in the system offline and generates dynamic trust model by opinion classification. The second step presents trust evaluation ranking to help the user can easily discovery trust service of matching his needs. The experimental evaluation shows that the trusted query evaluation ranking has high trading efficiency, quick learning ability and satisfactory performance.

关键词： Business Feedback Portals History Web services Computer security data security Information security Wireless communication Computer networks

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共111页 << < 91 92 93 94 95 96 97 98 99 100 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：