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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

355 篇 会议
202 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

354 篇 工学
- 266 篇 计算机科学与技术...
- 227 篇 软件工程
- 73 篇 信息与通信工程
- 36 篇 生物工程
- 35 篇 控制科学与工程
- 34 篇 机械工程
- 27 篇 化学工程与技术
- 23 篇 光学工程
- 22 篇 电子科学与技术（可...
- 18 篇 电气工程
- 16 篇 生物医学工程（可授...
- 12 篇 仪器科学与技术
- 11 篇 农业工程
- 10 篇 建筑学
- 7 篇 材料科学与工程（可...
- 7 篇 动力工程及工程热...
184 篇 理学
- 109 篇 数学
- 48 篇 生物学
- 45 篇 物理学
- 31 篇 统计学（可授理学、...
- 20 篇 化学
- 10 篇 系统科学
128 篇 管理学
- 91 篇 图书情报与档案管...
- 40 篇 管理科学与工程(可...
- 15 篇 工商管理
15 篇 农学
- 12 篇 作物学
13 篇 医学
- 9 篇 临床医学
- 8 篇 基础医学(可授医学...
9 篇 法学
- 9 篇 社会学
7 篇 经济学
- 7 篇 应用经济学
3 篇 艺术学
2 篇 教育学
2 篇 文学
1 篇 军事学

主题

37 篇 semantics
23 篇 training
21 篇 feature extracti...
15 篇 deep learning
15 篇 data models
14 篇 computational mo...
13 篇 computer vision
12 篇 visualization
11 篇 face recognition
11 篇 data mining
9 篇 object detection
9 篇 neural networks
9 篇 robustness
8 篇 forecasting
7 篇 support vector m...
7 篇 optimization
7 篇 navigation
7 篇 databases
7 篇 humans
7 篇 detectors

机构

101 篇 university of ch...
65 篇 key lab of intel...
51 篇 key lab of intel...
30 篇 key lab. of inte...
21 篇 school of comput...
20 篇 key laboratory o...
19 篇 key lab. of inte...
17 篇 key lab of intel...
16 篇 peng cheng labor...
14 篇 shanghai key lab...
14 篇 key lab. of inte...
13 篇 key lab. of inte...
13 篇 school of cyber ...
13 篇 shanghai collabo...
12 篇 institute of dig...
11 篇 institute of com...
10 篇 graduate univers...
10 篇 school of cyber ...
9 篇 key lab of intel...
9 篇 graduate school ...

作者

28 篇 huang qingming
28 篇 zhuge hai
24 篇 xilin chen
21 篇 cao juan
19 篇 gao wen
18 篇 liu qun
17 篇 shiguang shan
17 篇 xu qianqian
14 篇 qing he
14 篇 cao xiaochun
13 篇 yang zhiyong
13 篇 sun xiaoping
12 篇 sheng qiang
11 篇 shuqiang jiang
11 篇 hai zhuge
11 篇 jiang yu-gang
11 篇 he qing
10 篇 jiang shuqiang
10 篇 chen xilin
10 篇 li hua

语言

542 篇 英文
11 篇 其他
9 篇 中文

检索条件"机构=Key Lab of Scientific Computing and Intelligent Information Processing"

共 559 条记录，以下是221-230 订阅

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

详细简洁

排序：

Representative local features mining for large-scale near-duplicates retrieval

Representative local features mining for large-scale near-du...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Xiaoguang Gu Yongdong Zhang Dongming Zhang Jintao Li Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology CAS Beijing China

Local features have been widely used in many computer vision related researches, such as near-duplicate image and video retrieval. However, the storage and query cost of local features become prohibitive on large-scale database. In this paper, we propose a representative local features mining method to generate a compact but more effective feature subset. First, we do an unsupervised annotation for all similar images(or frames in video) in the database. Second, we compute a comprehensive score for every local feature. The score function combines the robustness and discrimination. Finally, we sort all the local features in an image by their scores and the low-score local features can be removed. The selected local features are robust and discriminative, which can guarantee the better retrieval quality than using full of the original feature set. By our method, the number of local features can be significantly reduced and a large amount of storage and computational cost can be saved. The experimental results show that we can use 30% of the features to get a better query performance than that of full feature set.

关键词： Databases Robustness Vectors Visualization Feature extraction Binary codes Complexity theory

来源：评论

学校读者我要写书评

暂无评论

Towards Occlusion Robust Facial Landmark Detector

Towards Occlusion Robust Facial Landmark Detector

引用

International Conference on Automatic Face and Gesture Recognition

作者： Yuyang Sha Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology CAS Beijing China

ISBN: (纸本)9781665431774

Facial landmark detection plays an essential role in many face analysis tasks, such as face recognition, facial action unit detection, etc. However, when occlusion occurs, the existing methods might not perform well. This paper studies a new framework for facial landmark detection referred to as the Occlusion Robust Facial Landmark Detector (OR-FLD), which attempts to solve the occlusion problem. Specifically, the proposed OR-FLD consists of three main modules: Feature Random Dropping Module (FRD), Feature Activation Diversity Module (FAD), and Landmark Refinement Attention Module (LRA). The FRD forces the model to focus on the geometric relationships between different facial components by randomly dropping some appearance information and then automatically recovering them. The FAD tries to enhance the model representation and make the extracted features discriminative and robust to occlusions. Besides, the recovered features contribute differently to the final results. Therefore, we propose a simple and effective attention mechanism to refine the landmark location and make the model more robust to occlusions. We extensively evaluate OR-FLD on four facial landmark detection benchmarks (300W, WFLW, COFW, and AFLW). The results show that our method outperforms the state-of-the-art by a significant margin, especially on the datasets with large occlusion.

关键词： Location awareness Sensitivity Face recognition Pose estimation Detectors Gesture recognition Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

Pattern Synthesis of MIMO Radar Based on Immune Differential Evolution Algorithm

Pattern Synthesis of MIMO Radar Based on Immune Differential...

引用

2020 International Conference on Modeling, Big Data Analytics and Simulation, MBDAS 2020

作者： Jiang, Ling Jiang, Yi Chen, Guangfu Shi, Guimin Cheng, Qi School of Mathematics and Computer Wuyi University Wuyishan354300 China Key Lab. of Cogn. Computing and Intelligent Information Processing of Fujian Education Institutions Wuyishan354300 China Big Data Development Administration of Anji County Huzhou313000 China

In order to optimize the pattern synthesis of multiple input and multiple output (MIMO) radar, immune mechanism is adopted to overcome the premature risk of differential evolution (DE) algorithm, namely immune differential evolution (IDE). Firstly, the modeling of MIMO radar is introduced by encoding the position of array in the binary. Secondly, the immune mechanism is employed to improve the DE. In IDE, two parameters are self-adapted for the mutation operator by immune mechanism to enhance the convergence ability of DE, including scaling factor and crossover rate. Several experiments are conducted to analysis the performance of IDE. The simulation results show that the IDE with variable parameters can get optimal results in MIMO radar with lower the peak side-lobe level (PSLL) and maintain the diversity with stronger convergence ability and shorter calculation speed. © Published under licence by IOP Publishing Ltd.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

A Resource Space Model for Dataspace

A Resource Space Model for Dataspace

引用

Sixth International Conference on Semantics,Knowledge and Grids(第六届语义、知识与网格国际会议 SKG 2010)

作者： Xiaorui Jiang Xiaoping Sun Hai Zhuge Knowledge Grid Research Group Key Lab of Intelligent Information Processing Institute of Computing Technology CAS Beijing China

Dataspace is a semi-structural data model for the management of large-scale heterogeneous data *** a dataspace,each data object consists of a set of attribute-value pairs to describe the internal properties of the object and their relationships to other objects. The dataspace model provides a flexible query language that supports attribute-value pair-based predicate queries and semantic link queries. In this paper we introduce a Resource Space Model that extends the concepts of dataspace to make it more flexible by incorporating classification semantics. We model a dataspace as a set of Resource Spaces (RS) with each RS representing a kind of resources that share common attributes and can be put into the same category, either according to a user’s knowledge of the world or his query preferences. Our model is suitable for designing a user-tailored semantic view of a dataspace while at the same time without losing the schema-later data-centric nature. A practical query language is introduced to implement flexible query operations on the resource spaces of the dataspace. Examples show how the proposed model and language support both the schema query and the data query.

关键词： Semantics Data models Argon Portals Organizations Database languages Resource description framework

来源：评论

学校读者我要写书评

暂无评论

An intelligent load balancing algorithm towards efficient cloud computing

An intelligent load balancing algorithm towards efficient cl...

引用

2011 AAAI Workshop

作者： Xu, Yang Wu, Lei Guo, Liying Chen, Zheng Yang, Lai Shi, Zhongzhi Agent-based Cooperative System Lab School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu SC 611731 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China

ISBN: (纸本)9781577355243

MapReduce provided a novel computing model for complex job decomposition and sub-tasks management to support cloud computing with large distributed data sets. However, its performance is significantly influenced by the working data distributions over those data sets. In this paper, we put forward a novel model to balance data distribution to improve cloud computing performance in data-intensive applications, such as distributed data mining. By extending the classic MapReduce model with an agent-aid layer and abstracting working load requests for data blocks as tokens, the agents can reason from previously received tokens about where to send other tokens in order to balance the working tasks and improve system performance. Our key contribution lies in building an efficient token routing algorithm in spite of agents' unknowing to the global state of data distribution in cloud. We also built a prototype of our system, and the experimental results show that our approach can significantly improve the efficiency of cloud computing. Copyright © 2011, Association for the Advancement of Artificial Intelligence. All rights reserved.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Noise Robust Hard Example Mining for Human Detection with Efficient Depth-Thermal Fusion

Noise Robust Hard Example Mining for Human Detection with Ef...

引用

International Conference on Automatic Face and Gesture Recognition

作者： Zijian Zhao Jie Zhang Shiguang Shan Key Lab of Intelligent Information Processing Chinese Academy of Sciences (CAS) Institute of Computing Technology CAS Beijing China

ISBN: (数字)9781728130798

ISBN: (纸本)9781728130804

Identity-preserving human detection is important for the privacy-protecting applications. IPHD [1] is a newly collected identity-preserving dataset that only contains depth and thermal images, which have much less information than RGB images. While less information and weakly labeled ground-truth boxes make it difficult to locate the objects correctly. In this paper, we adopt an efficient depth-thermal fusion approach to combine these two different inputs and enhance the representation. Moreover, a noise robust hard example mining algorithm is proposed to deal with weakly labeled data. The experiments show that our single model with single scale testing can get the AP=88.1 at IoU=0.5, which is a significant improvement compared with other competition results.

关键词： Noise robustness Feature extraction Training Head Thermal noise Kernel Detectors

来源：评论

学校读者我要写书评

暂无评论

Summarization of Related Work through Citations 12

Summarization of Related Work through Citations

引用

12th International Conference on Semantics, Knowledge and Grids, SKG 2016

作者： Chen, Jingqiang Zhuge, Hai Nanjing University of Posts and Telecommunications 210023 Nanjing China. Key Lab of Intelligent Information Processing Institute of Computing Technology University of Chinese Academy of Sciences 100190 Beijing China. Systems Analytics Research Institute Aston University Birmingham UK

ISBN: (纸本)9781509047956

Automatically generating the related work section for a writing paper is useful for researchers as it can save a lot of time and avoid missing related works. The related work section of scientific paper usually introduces other researchers' work published before and makes comparisons with the current author's work. This paper proposes an approach to automatically generating related work by comparing the main text of the writing paper with the citations to the references from other papers. Our approach firstly collects the papers that cite the reference papers of the writing paper and extracts the corresponding citation sentences to form a citation document. It then makes a summarization that makes a comparison between the citation document and the writing paper's abstract, introduction and conclusion. It extracts the representative keywords from the citation document and the writing paper, and constructs a graph of the keywords. The discriminated nodes in the graph are figured out, and then the minimum Steiner tree that covers the nodes is extracted. A summary is generated by extracting the sentences covering the Steiner tree. The experiments show that our approach outperforms three baselines MEAD, ReWoS and ARWG according to ROUGE evaluation results. © 2016 IEEE.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Bilingually-constrained (monolingual) shift-reduce parsing

Bilingually-constrained (monolingual) shift-reduce parsing

引用

2009 Conference on Empirical Methods in Natural Language processing, EMNLP 2009, Held in Conjunction with ACL-IJCNLP 2009

作者： Huang, Liang Jiang, Wenbin Liu, Qun Google Research 1350 Charleston Rd. Mountain View CA 94043 United States Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences P.O. Box 2704 Beijing 100190 China

Jointly parsing two languages has been shown to improve accuracies on either or both sides. However, its search space is much bigger than the monolingual case, forcing existing approaches to employ complicated modeling and crude approximations. Here we propose a much simpler alternative, bilingually-constrained monolingual parsing, where a source-language parser learns to exploit reorderings as additional observation, but not bothering to build the target-side tree as well. We show specifically how to enhance a shift-reduce dependency parser with alignment features to resolve shift-reduce conflicts. Experiments on the bilingual portion of Chinese Treebank show that, with just 3 bilingual features, we can improve parsing accuracies by 0.6% (absolute) for both English and Chinese over a state-of-the-art baseline, with negligible (∼6%) efficiency overhead, thus much faster than biparsing. © 2009 ACL and AFNLP.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

Downstream Task-agnostic Transferable Attacks on Language-Image Pre-training Models

Downstream Task-agnostic Transferable Attacks on Language-Im...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Yiqiang Lv Jingjing Chen Zhipeng Wei Kai Chen Zuxuan Wu Yu-Gang Jiang Shanghai Key Lab of Intelligent Information Processing School of Computer Science Fudan University Shanghai Collaborative Innovation Center of Intelligent Visual Computing

Vision-language pre-trained models (e.g., CLIP) trained on large-scale datasets via self-supervised learning, are drawing increasing research attention since they can achieve superior performances on multi-modal downstream tasks. Nevertheless, we find that the adversarial perturbations crafted on vision-language pre-trained models can be used to attack different corresponding downstream task models. Specifically, to investigate such adversarial transferability, we introduce a task-agnostic method named Global and Local Augmentation (GLA) attack to generate highly transferable adversarial examples on CLIP, to attack black-box downstream task models. GLA adopts random crop and resize at both global and local patch levels, to create more diversity and make adversarial noises robust. Then GLA generates the adversarial perturbations by minimizing the cosine similarity between intermediate features from augmented adversarial and benign examples. Extensive experiments on three CLIP image encoders with different backbones and three different downstream tasks demonstrate the superiority of our method compared with other strong baselines. The code is available at https://***/yqlvcoding/GLAattack.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An Improved FTRLS Filtering Algorithm and Its Simulation Analysis

An Improved FTRLS Filtering Algorithm and Its Simulation Ana...

引用

2017 17th IEEE International Conference on Communication Technology (ICCT 2017)

作者： Jun Zhu Jingjing Zhang Qiang Chen Key Lab of Intelligent Computing and Signal Processing Ministry of Education China School of Electronics and Information Engineering Anhui University

Due to the large error of LMS algorithm and the slow convergence rate, the recursive least squares(RLS) algorithm is proposed. Although the recursive estimation error is greatly reduced, the convergence rate is one order of magnitude higher than that of the general LMS filter. When the order N increases, the amount of calculation for a single iteration of the RLS algorithm is increased significantly. Aiming at these problems, this paper proposes an improved FTRLS filtering algorithm, which is to find out the amount of large error and accumulate the error, and then make the error feedback to make the algorithm more stable. The analysis of MATlab simulation results show that the improved algorithm can improve the convergence speed and stability of the algorithm, and effectively reduce the convergence of the noise.

关键词： adaptive filtering Least Mean Squares(LMS) Recursive Least Squares(RLS) Fast Transverse Recursive Least Squares(FTRLS) improved FTRLS algorithm convergence rate

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共56页 << < 19 20 21 22 23 24 25 26 27 28 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：