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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

170 篇 会议
65 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

158 篇 工学
- 132 篇 计算机科学与技术...
- 110 篇 软件工程
- 40 篇 信息与通信工程
- 14 篇 生物工程
- 11 篇 控制科学与工程
- 8 篇 电子科学与技术（可...
- 7 篇 仪器科学与技术
- 6 篇 生物医学工程（可授...
- 5 篇 动力工程及工程热...
- 5 篇 化学工程与技术
- 4 篇 机械工程
- 4 篇 光学工程
- 3 篇 力学（可授工学、理...
- 3 篇 电气工程
- 3 篇 交通运输工程
- 2 篇 建筑学
- 2 篇 土木工程
60 篇 理学
- 36 篇 数学
- 14 篇 生物学
- 10 篇 物理学
- 10 篇 统计学（可授理学、...
- 5 篇 化学
- 4 篇 系统科学
53 篇 管理学
- 35 篇 图书情报与档案管...
- 21 篇 管理科学与工程(可...
- 3 篇 工商管理
7 篇 法学
- 6 篇 社会学
3 篇 医学
- 3 篇 临床医学
- 2 篇 基础医学(可授医学...
2 篇 教育学
- 2 篇 教育学
1 篇 经济学
1 篇 农学

主题

11 篇 data engineering
10 篇 laboratories
10 篇 semantics
9 篇 data mining
8 篇 knowledge engine...
8 篇 wireless sensor ...
7 篇 query processing
6 篇 search engines
6 篇 costs
6 篇 information retr...
5 篇 xml
5 篇 knowledge manage...
4 篇 helium
4 篇 indexes
4 篇 graphics process...
4 篇 signal encoding
4 篇 ontologies
4 篇 algorithm design...
3 篇 text categorizat...
3 篇 collaborative fi...

机构

86 篇 school of inform...
49 篇 key laboratory o...
19 篇 key laboratory o...
18 篇 key lab of data ...
11 篇 key laboratory o...
10 篇 gaoling school o...
10 篇 beijing key labo...
9 篇 engineering rese...
9 篇 department of ma...
7 篇 renmin universit...
7 篇 key laboratory o...
7 篇 key lab of data ...
6 篇 key laboratory o...
5 篇 moe key lab of d...
5 篇 key laboratory o...
5 篇 university of ch...
5 篇 school of comput...
4 篇 information scho...
4 篇 college of compu...
4 篇 renmin universit...

作者

35 篇 du xiaoyong
30 篇 chen hong
30 篇 li xirong
20 篇 li cuiping
20 篇 xiaoyong du
15 篇 hong chen
13 篇 he jun
12 篇 yang gang
11 篇 liu hongyan
11 篇 wang shan
9 篇 dou zhicheng
8 篇 wen ji-rong
8 篇 cuiping li
7 篇 liu tao
7 篇 chen jinchuan
6 篇 zhao suyun
6 篇 shan wang
6 篇 cao juan
6 篇 feng zhang
6 篇 fan zhaoxin

语言

225 篇 英文
6 篇 其他
4 篇 中文

检索条件"机构=Key Lab of Data Engineering and Knowledge Engineering of MOE Renmin"

共 235 条记录，以下是201-210 订阅

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

详细简洁

排序：

Evolving Sequential Patterns Mining Model over Click Stream with Levenshtein-Automata

Evolving Sequential Patterns Mining Model over Click Stream ...

引用

International Conference on Innovative Computing, Information and Control (ICICIC)

作者： Haifeng Li Hong Chen School of Information Key Laboratory of Data Engineering and Knowledge Engineering MOEMOE Renmin University of China Beijing China

Sequential pattern mining is an important problem in continuous, fast, dynamic and unlimited stream mining. Recently approximate mining algorithms are proposed which spend too many system resources and can only obtain the partial feature of stream. In this paper, a multi-level evolving sequential pattern mining model ESPMM is presented to address this problem thus the mostly entire stream feature is obtained. Furthermore, because of the smaller support of sequential patterns in each level, a mining method BMLA based on Levenshtein-Automata is proposed which builds state conversion model to compute sequences' similarity in linear time. The experiment results show this model is effective and efficient.

关键词： Distance measurement data mining Runtime Automata Computational modeling Evolution (biology) data models

来源：评论

学校读者我要写书评

暂无评论

CRO: A system for online review structurization

CRO: A system for online review structurization

引用

14th ACM SIGKDD International Conference on knowledge Discovery and data Mining, KDD 2008

作者： Liu, Hongyan Yang, Hui Li, Wenbo Wei, Wei He, Jun Du, Xiaoyong School of Economics and Management Tsinghua University Beijing 100084 China Information School Renmin University of China Beijing 100872 China School of Computer Science and Engineering Beihang University Beijing 100083 China Key Labs. of Data Engineering and Knowledge Engineering MOE Renmin University of China Beijing 100872 China

ISBN: (纸本)9781605581934

In this paper, we present a system called CRO (Chinese Review Observer) for online product review structurization. By Structurization, we mean identifying, extracting and summarizing information from unstructured review text to a structured table. The core tasks include review collection, product feature and user opinion extraction, and polarity analysis of opinions. Existing research in this area is mainly English text oriented. To deal with Chinese effectively, we propose several novel approaches for fulfilling the core tasks. Then we integrated these approaches and implement the whole procedure of review structurization in the system CRO. Running results for reviews of real products show its performance is satisfactory.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

A Parallel Recovery Scheme for Update Intensive Main Memory database Systems

A Parallel Recovery Scheme for Update Intensive Main Memory ...

引用

IEEE International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)

作者： Xiongpai Qin Yanqin Xiao Wei Cao Shan Wang Key Laboratory of Data Engineering and Knowledge Engineering MOE Beijing China Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China Beijing P.R. China

In update intensive applications, main memory database systems produce large volume of log records, it is critical to write out the log records efficiently to speedup transaction processing. We propose a parallel recovery scheme based on XOR differential logging for main memory database systems in such environments. Some NVRAM is used to temporarily hold log records and decouple transaction committing from disk writes, inherited parallelism properties of differential logging are exploited to accelerate log flushing by using multiple log disks. During recovery, log records are loaded from multiple log disks and applied to data partition in time without the need of reordering according to serialization order, total recovery time is cut down. The scheme employs a data partition based consistent checkpointing method. The log records are classified according to IDs of data partitions accessed. data partitions are recovered according to loading priorities computed from update frequencies and transaction waiting times, data access demands of new transactions coming after failure recovery are given attention immediately, thus the scheme provides system availability during recovery, which is of importance for large scale main memory database systems.

关键词： database systems data engineering Large-scale systems Random access memory Checkpointing Communication industry Defense industry Distributed computing laboratories knowledge engineering

来源：评论

学校读者我要写书评

暂无评论

In-Network Execution of External Join for Sensor Networks

In-Network Execution of External Join for Sensor Networks

引用

International Conference on Web-Age Information Management Workshops (WAIM)

作者： Yongxuan Lai Yilong Chen Hong Chen School of Information Key Laboratory of Data Engineering and Knowledge Engineering MOE Renmin University of China Beijing China

ISBN: (纸本)9781424432004;9780769531854

Recently there have been growing interests in the applications of wireless sensor networks such as traffic tracking, environmental surveillance, and network monitoring. In these applications, the exploration of the relationship and linkage of sensing data with other data sources can be naturally expressed by the external join, where the sensory tuples join with an external table at the base station. However, executing such kind of join queries in a highly distributed and resource-constraint sensor network is a challenging task. In this paper, we propose a partition-based algorithm called NEJA (in-network external join algorithm) for the external join processing in sensor networks. NEJA organizes the sensory data of the network through an optimized "value-to-storage" mapping, according to which each storage point stores the tuples that belong to the same subrange on the joint attribute. Then the subrange of each storage point is further partitioned into unit ranges, and tuples in the same unit range wisely choose their joining point that incurs the least communication cost based on a cost metric according to the latest historical statistics. Also, NEJA adopts some optimization techniques to handle the changes of sensory data and uses approximate approaches to cut down the maintenance cost of the mechanism. The experimental results indicate that our scheme is effective in reducing the amount of transmissions for the real time external join processing, especially when the external table has a relatively large size.

关键词： Base stations Joints Wireless sensor networks Sensors Partitioning algorithms Distributed databases Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Research on Web Services Selection Model Based on AHP

Research on Web Services Selection Model Based on AHP

引用

2008 IEEE International Conference on Service Operations and Logistics, and Informatics(IEEE/SOLI’2008)(IEEE服务运作、物流与信息年会)

作者： Bei Wu Meiyun Zuo Shijuan Wang Information School and Key Laboratory of Data Engineering and Knowledge Engineering MOE Renmin University of China BeijingChina

This paper focuses on the problem that how to select the optimal service among many Web services which all meet the functional needs,establishes an index system for Web services products selection from four aspects,namely the supply side,the user,product and *** on this,we collect the views of 30 experts by Analytic Hierarchy Process (AHP) method and calculate the weight of each index at all levels based on the data collected from questionnaire *** the overall sample data analysis,we put two types of sample data namely business operation experts and academics for comparative *** Web services selection model proposed in this article can provide the reference to Web services managers when they selecting Web services,and also contributes to in-depth research on the adoption of Web services based information system.

关键词： web services selection model analytic hierarchy process information system

来源：评论

学校读者我要写书评

暂无评论

Improve Frequent Closed Itemsets Mining over data Stream with Bitmap

Improve Frequent Closed Itemsets Mining over Data Stream wit...

引用

ACIS International Conference on Software engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD)

作者： Haifeng Li Hong Chen Key Laboratory of Data Engineering and Knowledge Engineering MOESchool of Information Renmin University of China Beijing China

ISBN: (纸本)9780769532639

Frequent itemsets mining is an important problem in data mining. Frequent closed itemsets mining provides complete and condensed information for frequent pattern analysis thus reduces the memory cost without accuracy loss. More research focus on stream mining with the more application of stream. Stream is fast and unlimited thus data had to be stored in limited memory, how to save running time and memory usage is the most important target. In this paper, we propose an improved frequent closed itemsets mining method based on traditional stream mining algorithm CFI-stream with bitmap coding named CLIMB (closed itemset mining with bitmap) over stream's sliding window. The distinct items are maintained in memory in lexicographic order and each itemset is coded to bit-sequence with the order of items, moreover, the bit-sequence is split into sections to be recoded to reduce the memory cost. The experimental results on real-life show that CLIMB algorithm is effective and efficient.

关键词： Itemsets data mining Encoding Decoding data structures Runtime Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

DSOSW: A Deleting Strategy in Mining Frequent Itemsets over Sliding Window of Stream

DSOSW: A Deleting Strategy in Mining Frequent Itemsets over ...

引用

International Symposiums on Information Processing (ISIP)

作者： Haifeng Li Hong Chen Key Laboratory of Data Engineering and Knowledge Engineering MOE Renmin University of China Beijing China Renmin University of China Beijing CN

Most traditional mining approaches of frequent item sets consider mainly on databases and thus can use the second storage and need multiple scans which are not adapted to mining of stream. Some new algorithms over stream's sliding window are presented recently, which perform addition and deletion over stream independently, so the common deleting strategy which removes the earliest transaction is used when the window slides. This paper considers both operations together to reduce the computation cost, consequently, three deleting strategies are proposed to improve the performance with little precision loss. The experimental results show that these strategies over current method are effective and efficient.

关键词： data mining Itemsets Writing laboratories data engineering knowledge engineering Transaction databases Information processing Computational efficiency Performance loss

来源：评论

学校读者我要写书评

暂无评论

Influence of Product's Characters on Supply Chain Coordination

Influence of Product's Characters on Supply Chain Coordinati...

引用

2008 IEEE International Conference on Service Operations and Logistics, and Informatics(IEEE/SOLI’2008)(IEEE服务运作、物流与信息年会)

作者： Li Qian Information School and Key Laboratory of Data Engineering and Knowledge Engineering MOE Renmin University of ChinaBeijing 100872China

In the research field of supply chain coordination,many coordination contracts have been well *** chain members still feel confused about which contract should be chosen for their specific needs and *** paper starts from the essential analysis of supply chain coordination,and summaries four important affecting factors as well as the attributes in coordination,including market demand,competitors' relationship,supply chain structure,and decisions *** importantly this paper studies the related products' characters,such as storage life,customer's loyalty,etc,which are seldom discussed in coordination before,and analyzes the influence in *** on these research,the chain members could analyze their specific product's characters and affecting factors,then choose the proper coordination contracts.

关键词： coordination contract market demand,competitors' relationship supply chain structure product’s influencing character

来源：评论

学校读者我要写书评

暂无评论

A New Dynamic Hash Index for Flash-Based Storage

A New Dynamic Hash Index for Flash-Based Storage

引用

International Conference on Web-Age Information Management Workshops (WAIM)

作者： Xiang Li Zhou Da Xiaofeng Meng Renmin University of China Beijing CN Key Laboratory of Data Engineering and Knowledge Engineering MOE School of Information Renmin University of China China

Compared with traditional magnetic disks, flash memory has many advantages and has been used as external storage media for a wide spectrum of electronic devices (such as PDA, MP3, digital camera and mobile phone). As the capacity increases and price drops, it looks like a perfect alternative for magnetic disks. However, due to hardware limitations of flash memory, techniques including storage subsystem and indexing originally designed for magnetic disks can not run smoothly in a flash memory without any modification. In this paper we explore problems of indexing flash-resided data and present a new dynamical hash index for flash memory in two schemas. The analysis and experimental results validate the efficiency of our design.

关键词： Indexes Flash memory Algorithm design and analysis Writing Tuning Indexing Arrays

来源：评论

学校读者我要写书评

暂无评论

Energy Efficient Multicast Routing for Discrete Power Levels in Ad Hoc Sensor Networks

Energy Efficient Multicast Routing for Discrete Power Levels...

引用

The 4th International Conference on Wireless Communications, Networking and Mobile Computing(第四届IEEE无线通信、网络技术及移动计算国际会议)

作者： Deying Li Qinghua Zhu Zheng Li Key Laboratory of Data Engineering and Knowledge Engineering (Renmin University of China) MOE Scho School of Information Renmin University of China Beijing 100872 P.R.China

In this paper, we discuss the energy efficient multicast problem for discrete power levels in ad hoc sensor wireless networks. The problem of our concern is: given n nodes and each node v has l(v) transmission power levels and a multicast request (s, D), how to find a multicast tree rooted at s and spanning all destinations in D such that the total energy cost of the multicast tree is minimized. This problem is NP-hard. We propose a NWM_DST algorithm which has a theoretical guaranteed approximation performance ratio, and two efficient heuristics MNJT and g-D-MIP for multicast tree problem. Simulation results have shown efficiency of our proposed algorithms.

关键词： wireless sensor network energy efficiency approzimation algorithm multicast routing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共24页 << < 15 16 17 18 19 20 21 22 23 24 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：