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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

134 篇 会议
130 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

186 篇 工学
- 156 篇 计算机科学与技术...
- 98 篇 软件工程
- 37 篇 信息与通信工程
- 15 篇 电气工程
- 12 篇 化学工程与技术
- 9 篇 生物工程
- 8 篇 交通运输工程
- 6 篇 电子科学与技术（可...
- 6 篇 控制科学与工程
- 5 篇 机械工程
- 4 篇 光学工程
- 4 篇 材料科学与工程（可...
- 4 篇 建筑学
- 4 篇 环境科学与工程（可...
- 4 篇 生物医学工程（可授...
- 3 篇 网络空间安全
67 篇 管理学
- 47 篇 图书情报与档案管...
- 26 篇 管理科学与工程(可...
- 9 篇 工商管理
58 篇 理学
- 36 篇 数学
- 12 篇 化学
- 12 篇 统计学（可授理学、...
- 9 篇 生物学
- 7 篇 物理学
- 3 篇 系统科学
8 篇 法学
- 6 篇 社会学
6 篇 医学
- 6 篇 临床医学
- 3 篇 基础医学(可授医学...
4 篇 经济学
- 4 篇 应用经济学
3 篇 文学
- 3 篇 新闻传播学
1 篇 教育学
1 篇 农学

主题

18 篇 xml
15 篇 semantics
6 篇 knowledge engine...
5 篇 query processing
5 篇 dynamic programm...
5 篇 forecasting
4 篇 object detection
4 篇 finance
4 篇 contrastive lear...
4 篇 feature extracti...
4 篇 extraction
4 篇 clustering algor...
4 篇 data models
4 篇 training
4 篇 multi-attribute ...
4 篇 heuristic algori...
3 篇 collaborative fi...
3 篇 adversarial lear...
3 篇 zero-shot learni...
3 篇 graphics process...

机构

33 篇 school of inform...
32 篇 jiangxi key labo...
22 篇 school of inform...
18 篇 key lab of data ...
16 篇 jiangxi univ fin...
11 篇 jiangxi key labo...
10 篇 jiangxi univ fin...
8 篇 jiangxi univ fin...
8 篇 school of inform...
8 篇 key laboratory o...
7 篇 key lab. of inte...
7 篇 school of comput...
7 篇 university of ch...
7 篇 jiangxi univ fin...
7 篇 peng cheng labor...
7 篇 school of comput...
7 篇 school of cyber ...
7 篇 key lab of big d...
7 篇 key lab of data ...
6 篇 school of inform...

作者

33 篇 wan changxuan
29 篇 li xirong
28 篇 liu dexi
18 篇 liu xiping
17 篇 chen hong
15 篇 li cuiping
15 篇 liao guoqiong
12 篇 huang qingming
12 篇 xu qianqian
11 篇 yang gang
11 篇 cao xiaochun
11 篇 wan qizhi
10 篇 liu jun
9 篇 xiao keli
7 篇 hu rong
6 篇 dexi liu
6 篇 cao juan
6 篇 changxuan wan
6 篇 hong chen
6 篇 zhang lingling

语言

252 篇 英文
8 篇 其他
5 篇 中文

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

共 265 条记录，以下是61-70 订阅

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

详细简洁

排序：

Parallel hybrid join algorithm on GPU 21

Parallel hybrid join algorithm on GPU

引用

21st IEEE International Conference on High Performance Computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on data Science and Systems, HPCC/SmartCity/DSS 2019

作者： Guo, Chengxin Chen, Hong Zhang, Feng Li, Cuiping Key Lab of Data Engineering and Knowledge Engineering Ministry of Education School of Information Renmin University of China Beijing China

ISBN: (纸本)9781728120584

In data analytics applications, join is a general and time consuming operation. Optimizing join algorithms can benefit the query processing significantly. The emerging of GPUs provides a massive parallelism solution for improving the performance of the join operation. The hash join (HJ) and sort merge join (SMJ), which are two widely used join algorithms, have been proved effective for efficient join processing on the GPUs. Both algorithms have their own advantages and drawbacks, offering the chance of combining the advantages of HJ and SMJ on GPUs. In processing join operation on GPUs, data need to be transmitted between the CPU and the GPU due to the discrete GPU memory design, which causes performance degradation because of the high PCIe data transfer overhead. As GPUs are becoming more powerful than before, the performance gap between data transmission and GPU execution increases, which makes it even harder to implement an efficient join on GPUs. In this paper, we focus on the optimization of join algorithms on GPUs. We propose the Parallel Hybrid Join algorithm on GPUs(PHYJ) to combine the advantages of HJ and SMJ, and overlap the data communication and GPU execution with a pipeline mechanism. In our evaluation, the PHYJ shows up to 1.72X and 1.55X speedup over the up-to-date HJ and SMJ algorithms respectively on a NVIDIA GTX 1080ti-Pascal GPU. On the TitanV-Volta GPU, up to 1.54X and 1.42X improvements can be achieved over the baseline HJ and SMJ algorithms respectively. © 2019 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Classifier Belief Optimization for Visual Categorization 27th

Classifier Belief Optimization for Visual Categorization

引用

27th International Conference on MultiMedia Modeling, MMM 2021

作者： Yang, Gang Li, Xirong Key Lab of Data Engineering and Knowledge Engineering Beijing China School of Information Renmin University of China Beijing China

ISBN: (纸本)9783030678319

Classifier belief represents the confidence of a classifier making judgment about a special instance. Based on classifier belief, we propose an approach to realize classifier belief optimization. Through enriching prior knowledge and thus reducing the scope of candidate classes, our approach improves classification accuracy. A feature perturbation strategy containing an objective optimization is developed to automatically generate labeled instances. Moreover, we propose a classifier consensus strategy (CCS) for classifier optimization. CCS enables a given classifier to take full advantage of the test data to enrich prior knowledge. Experiments on three benchmark datasets and three classical classifiers justify the validity of the proposed approach. We improve the classification accuracy of a linear SVM by 6%. © 2021, Springer Nature Switzerland AG.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

Classifying tag relevance with relevant positive and negative examples 13

Classifying tag relevance with relevant positive and negativ...

引用

21st ACM International Conference on Multimedia, MM 2013

作者： Li, Xirong Snoek, Cees G. M. Key Lab of Data Engineering and Knowledge Engineering Renmin University of China China Intelligent Systems Lab Amsterdam University of Amsterdam Netherlands

ISBN: (纸本)9781450324045

Image tag relevance estimation aims to automatically deter- mine what people label about images is factually present in the pictorial content. Different from previous works, which either use only positive examples of a given tag or use pos- itive and random negative examples, we argue the impor- Tance of relevant positive and relevant negative examples for tag relevance estimation. We propose a system that se- lects positive and negative examples, deemed most relevant with respect to the given tag from crowd-annotated images. While applying models for many tags could be cumbersome, our system trains efficient ensembles of Support Vector Ma- chines per tag, enabling fast classification. Experiments on two benchmark sets show that the proposed system com- pares favorably against five present day methods. Given extracted visual features, for each image our system can pro- cess up to 3,787 tags per second. The new system is both effective and efficient for tag relevance estimation. Copyright © 2013 ACM.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

Fine-Grained Generation for Zero-Shot Learning 27th

Fine-Grained Generation for Zero-Shot Learning

引用

27th International Conference on MultiMedia Modeling, MMM 2021

作者： Sun, Weimin Xu, Jieping Yang, Gang Key Lab of Data Engineering and Knowledge Engineering Beijing China School of Information Renmin University of China Beijing China

ISBN: (纸本)9783030678319

Although zero-shot learning (ZSL) has achieved success in recognizing unseen classes images, most previous studies focus on feature projection from one domain to another, neglecting the domain shift problem caused by differences in classes. In this paper, we propose two novel methods in terms of attributes and features for ZSL problem. The first is Sample-Level Attribute Generation via GAN (SLA-GAN) that generates sample-level attributes. Considering the influence of lighting, environment, weather and other factors, the description based on class-level attributes will be biased. SLA-GAN generates sample-level attributes to describe each sample. Specially, we train a conditional Wasserstein GAN in which the generator synthesizes sample-level attributes from features and the discriminator distinguishes the sample-level from class-level attributes. Apart from that, we propose a novel method Fine-Grained Sample Generation via GAN (FGS-GAN) which can generate the unseen samples from the most similar samples of seen classes. Finally, we replace the class-level attributes with sample-level attributes in FGS-GAN and analyze the effects of sample-level attributes on synthesized features. Experiments on five benchmark data set show that our models outperform state-of-the-art methods in ZSL. © 2021, Springer Nature Switzerland AG.

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

Distance-based feature selection from probabilistic data

Distance-based feature selection from probabilistic data

引用

14th International Conference on Web-Age Information Management, WAIM 2013

作者： Zhao, Tingting Pei, Bin Zhao, Suyun Chen, Hong Li, Cuiping Key Lab of Data Engineering and Knowledge Engineering Ministry of Education China Department of Computer Science Renmin University of China China

ISBN: (纸本)9783642385612

Feature selection is a powerful tool of dimension reduction from datasets. In the last decade, more and more researchers have paid attentions on feature selection. Further, some researchers begin to focus on feature selection from probabilistic datasets. However, in the existing method of feature selection from probabilistic data, the distance hidden in probabilistic data is neglected. In this paper, we design a new distance measure to select informative feature from probabilistic databases, in which both the distance and randomness in the data are considered. And then, we propose a feature selection algorithm based on the new distance and develop two accelerative algorithms to boost the computation. Furthermore, we introduce a parameter into the distance to reduce the sensitivity to noise. Finally, the experimental results verify the effectiveness of our algorithms. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Random processes

来源：评论

学校读者我要写书评

暂无评论

Rucmm at MediaEval 2015 Affective impact of movies task: Fusion of audio and visual cues

Rucmm at MediaEval 2015 Affective impact of movies task: Fus...

引用

Multimedia Benchmark Workshop, MediaEval 2015

作者： Jin, Qin Li, Xirong Cao, Haibing Huo, Yujia Liao, Shuai Yang, Gang Xu, Jieping Multimedia Computing Lab School of Information Renmin University of China Key Lab of Data Engineering and Knowledge Engineering Renmin University of China China

This paper summarizes our efforts for the first time participation in the Violent Scene Detection subtask of the MediaEval 2015 Affective Impact of Movies Task. We build violent scene detectors using both audio and visual cues. In particular, the audio cue is represented by bag-of-audio-words with fisher vector encoding. The visual cue is exploited by extracting CNN features from video frames. The detectors are implemented using two-class linear SVM classifiers. Evaluation shows that the audio detectors and the visual detectors are comparable and complementary to each other. Among our submissions, multi-modal late fusion leads to the best performance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Analysis of bandwagon and average hybrid attack model against trust-based recommender systems

Analysis of bandwagon and average hybrid attack model agains...

引用

2011 International Conference on Management of e-Commerce and e-Government, ICMeCG 2011

作者： Zhang, Fuguo School of Information and Technology Jiangxi University of Finance and Economics Nanchang China Institute of Information Resource Management Jiangxi University of Finance and Economics Nanchang China Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang China

ISBN: (纸本)9780769545448

Recommender systems have been accepted as a vital application on the web by offering product advice or information that users might be interested in. Despite its success, similarity-based collaborative filtering suffers from some significant limitations, such as scalability, sparsity and recommendation attack. Prior work has shown incorporating trust mechanism into traditional collaborative filtering recommender systems can improve these limitations. However, trust-based recommender systems are also known to be vulnerable to profile infection attacks. Malicious users can inject a large number of biased profiles into such a system in order to make recommendations that favor or disfavor given items. In this paper, we propose a bandwagon and average hybrid attack model and analysis the effectiveness of the attack model against topic-level trust-based recommender algorithm. The results of our experiments conducted on well-known dataset show that the hybrid attack model is more effective than other attack models. © 2011 IEEE.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

RUC @ INEX 2011 data-centric track

RUC @ INEX 2011 data-centric track

引用

Lecture Notes in Computer Science

作者： Wang, Qiuyue Gan, Yantao Sun, Yu School of Information Renmin University of China China Key Lab. of Data Engineering and Knowledge Engineering MOE Beijing 100872 China

ISBN: (纸本)9783642357336

We report our experiment results on the INEX 2011 data-Centric Track. We participated in both the ad hoc and faceted search tasks. On the ad hoc search task, we employ language modeling approaches to do structured object retrieval, trying to capture both the structure in data and structure in query and unify the structured and unstructured information retrieval in a general framework. However, our initial experimental results using INEX test bed show that the unstructured retrieval model performs better than structured retrieval models. On the faceted search task, we propose a simple user-simulation model to evaluate the effectiveness of a faceted search system's recommending facet-values. We implemented the evaluation system and conducted the evaluations for the track. We also tested basic redundancy and relevance based approaches for recommending facet-values. The results show that our basic approaches of recommending facet-values perform quite well. © Springer-Verlag 2012.

关键词： XML

来源：评论

学校读者我要写书评

暂无评论

Integrated retrieval over structured and unstructured data

Integrated retrieval over structured and unstructured data

引用

2012 Cross Language Evaluation Forum Conference, CLEF 2012

作者： Wang, Qiuyue Kang, Jinglin School of Information Renmin University of China Beijing100872 China Key Lab of Data Engineering and Knowledge Engineering MOE Beijing100872 China

We report our experiment results on the INEX 2012 Linked data Track. We participated in the ad hoc and jeopardy tasks. As the new data collection on INEX 2012 Linked data Track features a combination of unstructured and structured data, our first attempt is to investigate different strategies of combining the retrievals over structured and unstructured data, and compare the combined approaches with the traditional unstructured ones. In this paper, we discussed three types of combination strategies and we experimented two of them on the track. The experiment results show that.

关键词： Linked data

来源：评论

学校读者我要写书评

暂无评论

A practice probability frequent pattern mining method over transactional uncertain data streams

A practice probability frequent pattern mining method over t...

引用

Lecture Notes in Computer Science

作者： Liao, Guoqiong Wu, Linqing Wan, Changxuan Xiong, Naixue School of Information Technology Jiangxi University of Finance and Economics Nanchang 330013 China Jiangxi Key Laboratory of Data and Knowledge Engineering Nanchang 330013 China Department of Computer Science Georgia State University United States

ISBN: (纸本)9783642236402

In recent years, large amounts of uncertain data are emerged with the widespread employment of the new technologies, such as wireless sensor networks, RFID and privacy protection. According to the features of the uncertain data streams such as incomplete, full of noisy, non-uniform and mutable, this paper presents a probability frequent pattern tree called PFP-tree and a method called PFP-growth, to mine probability frequent patterns based on probability damped windows. The main characteristics of the suggested method include: (1) adopting time-based probability damped window model to enhance the accuracy of mined frequent patterns;(2) setting an item index table and a transaction index table to speed up retrieval on the PFP-tree;and (3) pruning the tree to remove the items that cannot become frequent patterns;. The experimental results demonstrate that PFP-growth method has better performance than the main existing schemes in terms of accuracy, processing time and storage space. © 2011 Springer-Verlag.

关键词： Probability

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共27页 << < 3 4 5 6 7 8 9 10 11 12 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：