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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,451 篇 期刊文献
2,176 篇 会议
2 册 图书

馆藏范围

4,629 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

3,132 篇 工学
- 2,251 篇 计算机科学与技术...
- 1,851 篇 软件工程
- 800 篇 信息与通信工程
- 434 篇 电气工程
- 408 篇 生物工程
- 332 篇 控制科学与工程
- 288 篇 电子科学与技术（可...
- 239 篇 光学工程
- 211 篇 生物医学工程（可授...
- 200 篇 机械工程
- 192 篇 化学工程与技术
- 113 篇 交通运输工程
- 108 篇 动力工程及工程热...
- 107 篇 仪器科学与技术
- 102 篇 建筑学
- 95 篇 土木工程
- 91 篇 网络空间安全
- 83 篇 安全科学与工程
1,674 篇 理学
- 882 篇 数学
- 478 篇 生物学
- 407 篇 物理学
- 282 篇 统计学（可授理学、...
- 201 篇 化学
- 112 篇 系统科学
918 篇 管理学
- 523 篇 管理科学与工程(可...
- 448 篇 图书情报与档案管...
- 186 篇 工商管理
209 篇 医学
- 178 篇 临床医学
- 137 篇 基础医学(可授医学...
147 篇 法学
- 115 篇 社会学
82 篇 农学
79 篇 经济学
38 篇 教育学
18 篇 文学
11 篇 军事学
4 篇 艺术学

主题

144 篇 semantics
136 篇 feature extracti...
127 篇 deep learning
119 篇 training
84 篇 computational mo...
68 篇 data mining
68 篇 data models
67 篇 convolution
67 篇 machine learning
59 篇 predictive model...
58 篇 accuracy
55 篇 object detection
48 篇 task analysis
47 篇 neural networks
46 篇 graph neural net...
43 篇 visualization
42 篇 forecasting
42 篇 adaptation model...
41 篇 federated learni...
40 篇 convolutional ne...

机构

164 篇 school of inform...
99 篇 school of comput...
75 篇 school of comput...
73 篇 school of comput...
70 篇 henan key labora...
70 篇 fujian provincia...
66 篇 guangdong key la...
60 篇 shandong provinc...
54 篇 school of comput...
53 篇 key laboratory o...
52 篇 school of econom...
52 篇 school of inform...
50 篇 peng cheng labor...
46 篇 shandong enginee...
46 篇 school of inform...
45 篇 national enginee...
43 篇 key laboratory o...
43 篇 key laboratory o...
42 篇 university of ch...
41 篇 state key labora...

作者

39 篇 niyato dusit
39 篇 zhang rui
39 篇 chen hong
37 篇 chang kuo-chi
33 篇 wang meng
31 篇 du xiaoyong
31 篇 zhang jing
30 篇 wu xindong
30 篇 pan jeng-shyang
29 篇 liu yang
27 篇 liu jun
27 篇 li cuiping
25 篇 wen ji-rong
25 篇 chu kai-chun
24 篇 huang qingming
24 篇 jin hai
22 篇 yong shi
22 篇 wang shan
21 篇 meng wang
21 篇 xindong wu

语言

4,332 篇 英文
222 篇 其他
83 篇 中文
1 篇 德文
1 篇 法文

检索条件"机构=Key Laboratory of Knowledge Engineering with Big Data School of Computer and Information"

共 4629 条记录，以下是4521-4530 订阅

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

详细简洁

排序：

COP: Privacy-preserving multidimensional partition in DAS paradigm 09

COP: Privacy-preserving multidimensional partition in DAS pa...

引用

2009 International Conference on Extending database Technology/International Conference on database Theory Workshops, EDBT/ICDT '09

作者： Wang, Jieping Du, Xiaoyong Wang, Haocong Yang, Pingping Key Laboratory of Data Engineering and Knowledge Engineering MOE China School of Information Renmin University of China Beijing 100872 China

ISBN: (纸本)9781605586502

database-as-a-Service (DAS) is an emerging database management paradigm wherein partition based index is an effective way to querying encrypted data. However, previous research either focuses on one-dimensional partition or ignores multidimensional data distribution characteristic, especially sparsity and locality. In this paper, we propose Cluster based Onion Partition (COP), which is designed to decrease both false positive and dead space at the same time. Basically, COP is composed of two steps. First, it partition covered space level by level, which is like peeling of onion;second, at each level, a clustering algorithm based on local density is proposed to achieve local optimal secure partition. Extensive experiments on real dataset and synthetic dataset show that COP is a secure multidimensional partition with much less efficiency loss than previous top down or bottom up counterparts. Copyright 2009 ACM.

关键词： database systems

来源：评论

学校读者我要写书评

暂无评论

Fault-tolerant routing: κ-inconnected many-to-one routing in wireless networks

Fault-tolerant routing: κ-inconnected many-to-one routing i...

引用

3rd International Conference on Combinatorial Optimization and Applications, COCOA 2009

作者： Li, Deying Zhu, Qinghua Yang, Huiqiang School of Information Renmin University of China Beijing China Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE China

ISBN: (纸本)3642020259

This paper addresses the problem of fault-tolerant many-to-one routing in static wireless networks with asymmetric links, which is important in both theoretical and practical aspects. The problem is to find a minimum energy subgraph for a given subset and a destination node such that there are κ node-disjoint paths from each node in the subset to the destination node in the subgraph. We prove that the problem is NP-hard, and propose two efficient heuristic approaches, namely, the minimum weight κ node-disjoint paths based (MWkNDPB) approach and the minimum energy κ node-disjoint paths based (MEkNDPB) approach. Extensive simulations have been conducted to show that proposed algorithms are efficient. © 2009 Springer Berlin Heidelberg.

关键词： Wireless networks

来源：评论

学校读者我要写书评

暂无评论

An apparel trade quotation architecture based on BPM and SOA

An apparel trade quotation architecture based on BPM and SOA

引用

13th Pacific Asia Conference on information Systems: IT Services in a Global Environment, PACIS 2009

作者： Li, Qian Chen, Yu Zhang, Lan Fang Information School Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China Beijing 100872 China School of Information Management Science and Engineering Renmin University of China Beijing 100872 China

Based on the analysis of problems and difficulties in apparel quotation system, this paper puts forward the combination of BPM and SOA as a new idea for analysis of apparel quotation system, according to their advantages in business goals and requirements analysis, and the corresponding services' definition, extraction, optimization and integration. Through the combination, system flexibility, rapidity and accuracy could be achieved. The establishment of Service Repository according to the business requirements, is a crucial part in the architecture, however there are no definite rules for service extraction. In this paper, the detailed activities and steps, as well as a specific establishment case is illustrated. At last, architecture based on BPM and SOA for the apparel trade quotation is put forward, and its composition and implement are also analyzed.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

DB Facade: A web cache with improved data freshness

DB Facade: A web cache with improved data freshness

引用

2nd International Symposium on Electronic Commerce and Security, ISECS 2009

作者： Xiongpai, Qin Zhou, Xiaoyun Key Laboratory of Data Engineering and Knowledge Engineering School of Information Renmin University of China Beijing 100872 China School of Information and Electrical Engineering China University of Mining Technology Xuzhou Jiangsu 221008 China

ISBN: (纸本)9780769536439

Traditional web database cache techniques have a major disadvantage, namely poor data freshness, because they employ an asynchronous data refresh strategy. A novel web database cache, DB Façade, is proposed in this paper. DB Facade uses a main memory database to cache result sets of previous queries for subsequent reusing. Updates on backend database system are managed by delta tables, and then propagated to web database cache in a near real-time manner, hence guarantee the freshness of data. DB Facade offloads query burden from backend database systems, and exploits the power of main memory database system to boost query performance. TPC-W testing result shows that the system's performance increases by about 17 percent. © 2009 IEEE.

关键词： Facades

来源：评论

学校读者我要写书评

暂无评论

Rapid resynchronization method for replication in-memory databases supporting mobile communication applications

Rapid resynchronization method for replication in-memory dat...

引用

2009 WRI World Congress on computer Science and information engineering, CSIE 2009

作者： Guoqiong, Liao Jing, Li School of Information Technology Jiangxi University of Finance and Economics Nanchang 330013 Thailand Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang 330013 Thailand

ISBN: (纸本)9780769535074

In this paper, a rapid resynchronization method using intent logs is suggested for replication In-memory databases supporting mobile communication applications. Both the identifiers of unsynchronized segments and the identifiers of the slaves who have missed the updates in the segments are recorded in the intent logs. When receiving a resynchronization request from a slave, the master will scan the intent logs to find the unsynchronized segments for the salve, and then send the segments gotten directly from its memory to the slave. The performance results shown the intent logs method can reduce resynchronization time than methods using transaction logs. © 2008 IEEE.

关键词： Mobile telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

Efficient processing of global Top-k aggregate queries in uncertain database

Efficient processing of global Top-k aggregate queries in un...

引用

2009 International Conference on information engineering and computer Science, ICIECS 2009

作者： Xing, Xianli Liu, Dexi Principal's Office Jiangxi University of Finance and Economics Nanchang China School of Information Technology Jiangxi University of Finance and Economics Jiangxi Key Laboratory of Data and Knowledge Engineering Nanchang China

ISBN: (纸本)9781424449941

Top-k queries in uncertain databases are quite popular and useful due to its wide application usage. However, compared to Top-k in traditional databases, queries over uncertain database are more complicated because of the existence of exponential possible worlds. A Top-k aggregate query ranks groups of tuples by their aggregate values, sum or average for example, and returns k groups with the highest aggregate values. As a powerful semantic of Top-k, Global Top-k, returns k highest-ranked tuples according to their probabilities of being in the Top-k answers in possible worlds. We propose a dynamic programming based method to process Global Top-k aggregate queries in uncertain database, where the number of retrieved tuples and group states generated on these tuples are minimized. Experiment results show that our algorithm is effective. ©2009 IEEE.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Incremental computation for MEDIAN cubes in what-if analysis

Incremental computation for MEDIAN cubes in what-if analysis

引用

Joint International Conference on Advances in data and Web Management, APWeb/WAIM 2009

作者： Xiao, Yanqin Zhang, Yansong Wang, Shan Chen, Hong 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 Computer Center Hebei University Baoding Hebei 071002 China Department of Computer Science Harbin Finance College Harbin 150030 China

ISBN: (纸本)9783642006715

What-if analysis is an important type of DSS analysis processing procedure. It analyzes hypothetical scenarios based on historical data. The data cube view must be updated when the what-if condition is changed. Since source data must be kept in order to compute the new aggregate value when new tuples are inserted or deleted, in what-if analysis, incrementally computing a data cube for holistic aggregation functions is a difficult problem. In this paper, we adopt delta cube strategy and work area technique to incrementally compute data cube for MEDIAN function. The size of work area has important influence on the efficiency of the incremental computing. This paper optimizes the size of work area based on the number and the cardinality of dimension attributes of the cuboid. Performance study shows that our algorithms are effective over large databases. © Springer-Verlag Berlin Heidelberg 2009.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

Efficient incremental computation of CUBE in multiple versions what-if analysis

Efficient incremental computation of CUBE in multiple versio...

引用

Joint International Conference on Advances in data and Web Management, APWeb/WAIM 2009

ISBN: (纸本)9783642006715

What-if analysis is an important method to analyze the hypothetical scenarios based on the historical data. It provides useful information for the decision- maker. Multiple versions are critical to what-if analysis. In this paper, we analyze the problem of multiple versions data processing and the incremental computation of cubes in what-if analysis, proposing a strategy to process multiple versions of what-if data. Our solution can adopt different data processing methods according to the type of aggregate functions, the efficiency of multiple versions data processing is improved. Furthermore, we proposes an algorithm of incremental computation of CUBE for max(min) function to reduce the access time of fact table, and the experimental results showed that the performance is improved about 10%. © Springer-Verlag Berlin Heidelberg 2009.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

The tradeoff of delta table merging and re-writing algorithms in what-if analysis application

The tradeoff of delta table merging and re-writing algorithm...

引用

Joint International Conference on Advances in data and Web Management, APWeb/WAIM 2009

作者： Zhang, Yansong Zhang, Yu Xiao, Yanqin Wang, Shan Chen, Hong Key Laboratory of the 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 Department of Computer Science Harbin Finance College Harbin 150030 China Computer Center Hebei University Baoding Hebei 071002 China

ISBN: (纸本)9783642006715

What-if analysis can provide more meaningful information than classical OLAP. Multi-scenario hypothesis based on historical data needs efficient what-if data view support. In general, delta table for what-if analysis is more general than other solutions such as query re-writing prototype of Sesame. Delta table is independent of base table and is more suitable to represent complex hypothetical updates and multi-version hypothetical updates. Due to low efficiency of traditional delta table merging algorithm which is based on set operation, there are few researches focus on delta table merging algorithm but on query re-writing algorithm. By analyzing the difference between what-if query and what-if analysis and improving the delta table merging algorithm, we propose novel algorithms without set operation of difference. Considering the feature of aggregate operations in OLAP analysis, pre-merge algorithm is presented without the generation of what if data view before group-bys in the scenario of SUM, AVERAGE and COUNT function OLAP queries. In our experiments, the pre-merge algorithm greatly improved the efficiency of delta table merging procedure which is close to base group-by statement and superior to the re-writing algorithm. A complete comparison between all candidate delta table merging algorithms and re-writing algorithm with different what-if update conditions of update, deletion, insertion and mixed what-if updates is exhibited in our experiments, the policy of what-if analysis among different types is also discussed. © Springer-Verlag Berlin Heidelberg 2009.

关键词： Merging

来源：评论

学校读者我要写书评

暂无评论

Extracting Structured data from Ajax Site

Extracting Structured Data from Ajax Site

引用

International Workshop on database Technology and Applications

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

Ajax is an important approach for improving rich interactivity between Web server and end users during Web 2.0 eras. At the same time, the structured data in AJAX Web pages can not be extracted easily due to its asynchronous loading. In this paper, we propose a technique for extracting the structured data from the AJAX based Web pages. Firstly, an AjaxFetcher component is created to fetch the dynamic page content by using an embedded browser. Secondly, two different strategies are used to extract the structured data from the obtained page contents. Especially for the page that contains multi-records, an automatic approach to determine each possible record is proposed. Experimental results show that fetching Ajax pages and extracting the structured data from them is feasible.

关键词： data mining Web pages databases Uniform resource locators Laboratories data engineering knowledge engineering information resources information management knowledge management

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共463页 << < 449 450 451 452 453 454 455 456 457 458 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：