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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

218 篇 会议
139 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

228 篇 工学
- 190 篇 计算机科学与技术...
- 159 篇 软件工程
- 52 篇 信息与通信工程
- 22 篇 生物工程
- 14 篇 控制科学与工程
- 13 篇 生物医学工程（可授...
- 10 篇 化学工程与技术
- 9 篇 光学工程
- 9 篇 电子科学与技术（可...
- 8 篇 电气工程
- 7 篇 机械工程
- 7 篇 仪器科学与技术
- 6 篇 动力工程及工程热...
- 4 篇 力学（可授工学、理...
- 4 篇 交通运输工程
- 3 篇 建筑学
105 篇 理学
- 57 篇 数学
- 26 篇 生物学
- 22 篇 物理学
- 18 篇 统计学（可授理学、...
- 10 篇 化学
- 7 篇 系统科学
78 篇 管理学
- 54 篇 图书情报与档案管...
- 30 篇 管理科学与工程(可...
- 6 篇 工商管理
12 篇 医学
- 11 篇 临床医学
- 8 篇 基础医学(可授医学...
- 5 篇 药学(可授医学、理...
10 篇 法学
- 9 篇 社会学
3 篇 教育学
- 3 篇 教育学
2 篇 经济学
2 篇 文学
2 篇 农学

主题

17 篇 semantics
11 篇 data engineering
10 篇 laboratories
10 篇 data mining
9 篇 training
8 篇 knowledge engine...
8 篇 wireless sensor ...
8 篇 machine learning
7 篇 query processing
7 篇 information retr...
7 篇 forecasting
6 篇 object detection
6 篇 knowledge manage...
6 篇 search engines
6 篇 costs
6 篇 feature extracti...
5 篇 xml
5 篇 contrastive lear...
5 篇 embeddings
5 篇 data models

机构

86 篇 school of inform...
49 篇 key laboratory o...
18 篇 key lab of data ...
18 篇 key laboratory o...
11 篇 key laboratory o...
10 篇 gaoling school o...
10 篇 beijing key labo...
9 篇 engineering rese...
9 篇 department of ma...
8 篇 peng cheng labor...
8 篇 key laboratory o...
8 篇 shenzhen researc...
7 篇 key lab. of inte...
7 篇 school of comput...
7 篇 renmin universit...
7 篇 key laboratory o...
7 篇 university of ch...
7 篇 school of comput...
7 篇 school of cyber ...
7 篇 key lab of big d...

作者

35 篇 du xiaoyong
30 篇 chen hong
30 篇 li xirong
20 篇 li cuiping
20 篇 xiaoyong du
16 篇 hong chen
13 篇 he jun
11 篇 liu hongyan
11 篇 yang gang
11 篇 wang shan
10 篇 wang shuai
10 篇 liu jun
9 篇 dou zhicheng
9 篇 cuiping li
8 篇 wen ji-rong
8 篇 shan wang
8 篇 huang qingming
8 篇 xu qianqian
7 篇 liu tao
7 篇 cao xiaochun

语言

343 篇 英文
12 篇 其他
5 篇 中文

检索条件"机构=The MoE Key Lab of Data Engineering and Knowledge Engineering"

共 360 条记录，以下是81-90 订阅

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

详细简洁

排序：

Extracting multi-records from web pages

Extracting multi-records from web pages

引用

4th International Conference on Semantics, knowledge, and Grid, SKG 2008

作者： Tian, Xia Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE Beijing 100872 China School of Information Resource Management Renmin University of China Beijing 100872 China

ISBN: (纸本)9780769534015

Extracting multi-records from web pages is useful, it allows us to integrate information from multiple sources to provide value-added services. Existing techniques still have some limitations because of their several restrictions and accuracy. This paper proposes a new method to perform multi-records extraction task automatically. Firstly, the HTML tag tree is build based on an embedded browser interface to solve the AJAX problem. Secondly, data regions are found out by data chunk comparison, and simple tree matching method is proposed to compute the chunk similarity. Finally, the main data region is determined and the multi-records are extracted out. Experimental results show that our method dramatically outperforms other existing methods, and it can extract multi-records from pages very accurately. © 2008 IEEE.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Implementation and performance of VoIP interception based on SIP session border controller

Implementation and performance of VoIP interception based on...

引用

作者： Yang, Menghui Liu, Hua Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE Beijing 100872 China School of Information Resources Management Renmin University of China Beijing 100872 China

In an effort to provide lawful interception for session initiation protocol (SIP) voice over Internet protocol (VoIP), an interception architecture using session border controller (SBC) is proposed. Moreover, a prototype based on the proposed architecture is implemented. A testbed is set up and tests are carried out in order to analyze the performance and the capability of function entities and interfaces in the proposed architecture. Test results show that SBC interception capability in SIP signaling is superior to that in real-time transport protocol (RTP) media stream. In order to eliminate the possible bottleneck of RTP packets interception in SBC, an analytic model is proposed to investigate the mechanism in which RTP packet's traffics are shared among different SBC media functions. Analysis results show that multiple SBC media functions can share the RTP packets arrival and can significantly decrease RTP packets service time in SBC. Test results also show that delivery function, collect function and their interfaces in the proposed interception architecture have corresponding interception performance and capability with SBC. © 2013 Springer Science+Business Media New York.

关键词： Controllers

来源：评论

学校读者我要写书评

暂无评论

Location selection for utility maximization with capacity constraints 12

Location selection for utility maximization with capacity co...

引用

21st ACM International Conference on Information and knowledge Management, CIKM 2012

作者： Sun, Yu Huang, Jin Chen, Yueguo Zhang, Rui Du, Xiaoyong School of Information Renmin University of China Beijing China University of Melbourne Melbourne VIC Australia Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE China

ISBN: (纸本)9781450311564

Given a set of client locations, a set of facility locations where each facility has a service capacity, and the assumptions that: (i) a client seeks service from its nearest facility;(ii) a facility provides service to clients in the order of their proximity, we study the problem of selecting all possible locations such that setting up a new facility with a given capacity at these locations will maximize the number of served clients. This problem has wide applications in practice, such as setting up new distribution centers for online sales business and building additional base stations for mobile subscribers. We formulate the problem as location selection query for utility maximization. After applying three pruning rules to a baseline solution,we obtain an efficient algorithm to answer the query. Extensive experiments confirm the efficiency of our proposed algorithm. © 2012 ACM.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

Finding top-k min-cost connected trees in databases

Finding top-k min-cost connected trees in databases

引用

23rd International Conference on data engineering, ICDE 2007

作者： Ding, Bolin Yu, Jeffrey Xu Wang, Shan Qin, Lu Zhang, Xiao Lin, Xuemin Chinese University of Hong Kong Hong Kong Key Laboratory of Data Engineering and Knowledge Engineering MOE of China Renmin University of China China University of New South Wales NICTA Australia

ISBN: (纸本)1424408032

It widely realized that the integration of database and information retrieval techniques will provide users with a wide range of high quality services. In this paper, we study processing an l-keyword query, p1, p2, , p1, against a relational database which can be modeled as a weighted graph, G(V, E). Here V is a set of nodes (tuples) and E is a set of edges representing foreign key references between tuples. Let Vi⊆7 V be a set of nodes that contain the keyword pi. We study finding top-k minimum cost connected trees that contain at least one node in every subset Vi, and denote our problem as GST-k When k = 1, it is known as a minimum cost group Steiner tree problem which is NP-Complete. We observe that the number of keywords, l, is small, and propose a novel parameterized solution, with l as a parameter, to find the optimal GST-1, in time complexity O(3ln + 2l ((l + log n)n + m)), where n and m are the numbers of nodes and edges in graph G. Our solution can handle graphs with a large number of nodes. Our GST-1 solution can be easily extended to support GST-k, which outperforms the existing GST-k solutions over both weighted undirected/directed graphs. We conducted extensive experimental studies, and report our finding. © 2007 IEEE.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Fuzzy associative classifier for probabilistic numerical data 7

Fuzzy associative classifier for probabilistic numerical dat...

引用

7th International Conference on Intelligent Systems and knowledge engineering, ISKE 2012 with 1st International Conference on Cognitive Systems and Information Processing, CSIP 2012

作者： Pei, Bin Zhao, Tingting Zhao, Suyun Chen, Hong Key Laboratory of Data Engineering and Knowledge Engineering MOE Beijing China School of Information Renmin University of China Beijing China New Star Research Institute of Applied Tech Hefei China

ISBN: (纸本)9783642378287

Recently, a number of advanced data collection and processing methodologies have led to the proliferation of uncertain data. When discovering from such uncertain data, we should handle these uncertainties with caution, because classical mining algorithms may not be appropriate for uncertain tasks. This paper proposes a generic framework of fuzzy associative classifier for probabilistic numerical data, which is prevalent in the real-world applications, such as sensor networks and GPS-based location. In this paper, we first introduce an Aprioribased algorithm for mining fuzzy association rules from a probabilistic numerical dataset based on novel support and confidence measures suitable for such dataset. Then, we give fuzzy rules redundancy pruning strategy and database coverage method to build a compact fuzzy associative classifier in removing redundant rules and thus improving the accuracy of the classifier. We also redefine multiple fuzzy rules classification method for classifying new instances. Extensive experimental results show the effectiveness and efficiency of our algorithm. © Springer-Verlag Berlin Heidelberg 2014.

关键词： Fuzzy rules

来源：评论

学校读者我要写书评

暂无评论

Towards structured semantic embedding of multimedia 15

Towards structured semantic embedding of multimedia

引用

7th International Conference on Internet Multimedia Computing and Service, ICIMCS 2015

作者： Li, Xirong Huo, Yujia Lan, Weiyu He, Xixi Liao, Shuai Key Lab of Data Engineering and Knowledge Engineering Renmin University of China 100872 China Multimedia Computing Lab School of Information Renmin University of China 100872 China

ISBN: (纸本)9781450335287

This abstract paper sketches our research towards Struc-tured Semantic Embedding of multimedia data. Though a tag may have multiple senses with completely different visual imagery, current semantic embedding methods represent the tag by a single vector regardless of its senses. We challenge this convention, arguing the importance of adding seman-tic structures into semantic embedding. In particular, we develop Hierarchical Semantic Embedding, a simple model that exploits the WordNet hierarchy to make the semantic embedding structured to some extent. We demonstrate the viability of structured semantic embedding for tag disam-biguation and zero-shot image tagging. © 2015 ACM.

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

Fuzzy Rough Based Decision Tree Constructing

Fuzzy Rough Based Decision Tree Constructing

引用

第十二届中国Rough集与软计算学术会议、第六届中国Web智能学术研讨会及第六届中国粒计算学术研讨会联合学术会议

作者： CHEN Wei ZHAO Su-yun CHEN Hong LI Cui-ping Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of ChinaMOE Beijin Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of ChinaMOE Beijin

Decision tree and fuzzy rough set are two distinct but complementary *** tree is a simple and easy-understandable rule-based classifier,whereas the tool of fuzzy rough sets are effective on attribute and sample *** is promising to propose an approach to integrate these two rule based classification tools to construct a novel decision tree based on fuzzy rough *** this paper,based on the basic concept of fuzzy rough sets,i.e.,consistence degree,we propose a fuzzy rough decision tree which is completely different from the existing classification *** three key basic elements of decision tree,i.e.,node,branch and leaf,are designed in a new way by using the notions in fuzzy rough *** then one algorithm to build fuzzy rough tree classifier is ***,experimental results show that the proposed algorithm is readily comprehensible and effective.

关键词： Fuzzy rough sets Decision tree Consistence degree Rule-based classifier

来源：评论

学校读者我要写书评

暂无评论

Fast SimRank computation over disk-resident graphs

Fast SimRank computation over disk-resident graphs

引用

18th International Conference on database Systems for Advanced Applications, DASFAA 2013

作者： Zhang, Yinglong Li, Cuiping Chen, Hong Sheng, Likun Key Lab of Data Engineering and Knowledge Engineering of Ministry of Education And Department of Computer Science Renmin University of China China JiangXi Agricultural University China

ISBN: (纸本)9783642374494

There are many real-world applications based on similarity between objects, such as clustering, similarity query processing, information retrieval and recommendation systems. SimRank is a promising measure of similarity based on random surfers model. However, the computational complexity of SimRank is high and several optimization techniques have been proposed. In the paper optimization issue of Sim-Rank computation in disk-resident graphs is our primary focus. First we suggest a new approach to compute *** we propose optimization techniques that improve the time cost of the new approach from O (kN2 D2) to O (kNL), where k is the number of iteration, N is the number of nodes, L is the number of edges, and D is the average degree of nodes. Meanwhile, a threshold sieving method is presented to reduce storage and computational cost. On this basis, an external algorithm computing SimRank in disk-resident graphs is introduced. In the experiments, our algorithm outperforms its opponent whose computation complexity also is O (kNL). © Springer-Verlag 2013.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Overview of the INEX 2011 data-centric track

Overview of the INEX 2011 data-centric track

引用

Lecture Notes in Computer Science

作者： Wang, Qiuyue Ramírez, Georgina Marx, Maarten Theobald, Martin Kamps, Jaap School of Information Renmin University of China China Key Lab. of Data Engineering and Knowledge Engineering MOE China Universitat Pompeu Fabra Spain University of Amsterdam Netherlands Max-Planck-Institut für Informatik Germany

ISBN: (纸本)9783642357336

This paper presents an overview of the INEX 2011 data-Centric Track. Having the ad hoc search task running its second year, we introduced a new task, faceted search task, whose goal is to provide the infrastructure to investigate and evaluate different techniques and strategies of recommending facet-values to aid the user to navigate through a large set of query results and quickly identify the results of interest. The same IMDB collection as last year was used for both tasks. A total of 9 active participants contributed a total of 60 topics for both tasks and submitted 35 ad hoc search runs and 13 faceted search runs. A total of 38 ad hoc search topics were assessed, which included 18 subtopics for 13 faceted search topics. We discuss the setup for both tasks and the results obtained by their participants. © Springer-Verlag 2012.

关键词： XML

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共36页 << < 5 6 7 8 9 10 11 12 13 14 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：