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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是201-210 订阅

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

详细简洁

排序：

AUCSeg: AUC-oriented Pixel-level Long-tail Semantic Segmentation 38

AUCSeg: AUC-oriented Pixel-level Long-tail Semantic Segmenta...

引用

38th Conference on Neural information processing Systems, NeurIPS 2024

作者： Han, Boyu Xu, Qianqian Yang, Zhiyong Bao, Shilong Wen, Peisong Jiang, Yangbangyan Huang, Qingming Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS China School of Computer Science and Tech. University of Chinese Academy of Sciences China Peng Cheng Laboratory China Key Laboratory of Big Data Mining and Knowledge Management CAS China

The Area Under the ROC Curve (AUC) is a well-known metric for evaluating instance-level long-tail learning problems. In the past two decades, many AUC optimization methods have been proposed to improve model performance under long-tail distributions. In this paper, we explore AUC optimization methods in the context of pixel-level long-tail semantic segmentation, a much more complicated scenario. This task introduces two major challenges for AUC optimization techniques. On one hand, AUC optimization in a pixel-level task involves complex coupling across loss terms, with structured inner-image and pairwise inter-image dependencies, complicating theoretical analysis. On the other hand, we find that mini-batch estimation of AUC loss in this case requires a larger batch size, resulting in an unaffordable space complexity. To address these issues, we develop a pixel-level AUC loss function and conduct a dependency-graph-based theoretical analysis of the algorithm's generalization ability. Additionally, we design a Tail-Classes Memory Bank (T-Memory Bank) to manage the significant memory demand. Finally, comprehensive experiments across various benchmarks confirm the effectiveness of our proposed AUCSeg method. The code is available at https://***/boyuh/AUCSeg. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Automatic Construction of RSM Based on XML

Automatic Construction of RSM Based on XML

引用

The Seventh International Conference on Semantics,Knowledge,and Grids(第七届语义、知识与网格国际会议 SKG 20110)

作者： Lei He Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China Beijing，China

A Resource Space Model is a semantic model to organize, locate and operate Web resources in a multidimensional resource space. It’s easy for users to understand the resource space and locate resources in it because a resource space is constructed based on the classification semantics. In general, resource spaces models are manually designed and constructed based on domain knowledge and resource analysis. Human factors, such as personal opinions, knowledge level and design skill, will influence the design result of a resource space. To reduce the difficulties of the manual design and ease the designing process, this work studies the issues of automated creation of a resource space and proposes a general method to automatically construct resource spaces from XML files.

关键词： XML Semantics Finite element methods Data models Computational modeling Peer to peer computing Design methodology

来源：评论

学校读者我要写书评

暂无评论

Improving Bert Fine-Tuning via Stabilizing Cross-Layer Mutual information 48

Improving Bert Fine-Tuning via Stabilizing Cross-Layer Mutua...

引用

48th IEEE International Conference on Acoustics, Speech and Signal processing, ICASSP 2023

作者： Li, Jicun Li, Xingjian Wang, Tianyang Wang, Shi Cao, Yanan Xu, Chengzhong Dou, Dejing Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China Big Data Lab Baidu Research China University of Alabama Birmingham United States Institute of Information Engineering Chinese Academy of Sciences China State Key Lab of Iotsc University of Macau China

ISBN: (纸本)9781728163277

Fine-tuning pre-trained language models, such as BERT, has shown enormous success among various NLP tasks. Though simple and effective, the process of fine-tuning has been found unstable, which often leads to unexpected poor performance. To increase stability and generalizability, most existing works resort to maintaining the parameters or representations of pre-trained models during fine-tuning. Nevertheless, very little work explores mining the reliable part of pre-learned information that can help to stabilize fine-tuning. To address this challenge, we introduce a novel solution in which we fine-tune BERT with stabilized cross-layer mutual information. Our method aims to preserve the reliable behaviors of cross-layer information propagation, instead of preserving the information itself, of the pre-trained model. Therefore, our method circumvents the domain conflicts between pre-trained and target tasks. We conduct extensive experiments with popular pre-trained BERT variants on NLP datasets, demonstrating the universal effectiveness and robustness of our method. © 2023 IEEE.

关键词： Fine-tuning Stability Mutual information Pre-trained Language Model

来源：评论

学校读者我要写书评

暂无评论

SGDE-GEP: A Novel Algorithm of GEP

SGDE-GEP: A Novel Algorithm of GEP

引用

International Conference on Computer Science and Software Engineering

作者： Yu-zhong Peng Chang-an Yuan Yan Wang Xiao Qin Graduate Student of Key Lab of Scientific Computing &Intelligent Information processing in Universities of Guangxi Guangxi Teachers Education University Nanning China Information processing in Universities of Guangxi Guangxi Teachers Education University Nanning China

Traditional GEP algorithm takes up many system resources in decoding and evaluating due to the operation of the tree construction and corresponding traversing. This paper aims to introduce a novel GEP algorithm to alleviate the drawback mentioned above. The main contributions include:(1) presenting a new method for decoding and evaluating chromosome (SGDE), and proposing the corresponding ETs construction schema;(2) proving the relative natures of SGDE-GEP;(3)The experiments showed that the average efficiency of SGDE-GEP can be raised from 18.94% to 23.11% compared with the traditional GEP.

关键词： Educational institutions Biological cells Decoding scientific computing Competitive intelligence information processing Systems engineering education Genetic programming Tail Software algorithms

来源：评论

学校读者我要写书评

暂无评论

Cascaded Shape Space Pruning for Robust Facial Landmark Detection

Cascaded Shape Space Pruning for Robust Facial Landmark Dete...

引用

International Conference on Computer Vision (ICCV)

作者： Xiaowei Zhao Shiguang Shan Xiujuan Chai Xilin Chen Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology Beijing China

ISBN: (纸本)9781479928415

In this paper, we propose a novel cascaded face shape space pruning algorithm for robust facial landmark detection. Through progressively excluding the incorrect candidate shapes, our algorithm can accurately and efficiently achieve the globally optimal shape configuration. Specifically, individual landmark detectors are firstly applied to eliminate wrong candidates for each landmark. Then, the candidate shape space is further pruned by jointly removing incorrect shape configurations. To achieve this purpose, a discriminative structure classifier is designed to assess the candidate shape configurations. Based on the learned discriminative structure classifier, an efficient shape space pruning strategy is proposed to quickly reject most incorrect candidate shapes while preserve the true shape. The proposed algorithm is carefully evaluated on a large set of real world face images. In addition, comparison results on the publicly available BioID and LFW face databases demonstrate that our algorithm outperforms some state-of-the-art algorithms.

关键词： Shape Face Detectors Optimization Databases Robustness Detection algorithms

来源：评论

学校读者我要写书评

暂无评论

Mobile Crowd-Sensing System Based on Participant Selection 15th

Mobile Crowd-Sensing System Based on Participant Selection

引用

15th International Conference on Green, Pervasive, and Cloud computing, GPC 2020

作者： Tu, Chunyu Han, Lei Wang, Leye Yu, Zhiyong College of Mathematics and Computer Science Fuzhou University Fuzhou China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China Key Laboratory of Spatial Data Mining and Information Sharing Ministry of Education Fuzhou China Key Lab of High Confidence Software Technologies Peking University Beijing China

ISBN: (纸本)9783030642426

Mobile Crowdsensing (MCS) is often accompanied by various adverse objectives when performing data collection, which makes it difficult to collect accurate data of the entire target area with low cost. Therefore, how to collect a small part of the data to accurately infer the other data of the entire target area is a crucial issue. People’s daily trajectories usually follow a certain pattern, for example, students go to school, company employees go to work. This pattern allows us to find participants who often pass through fixed areas within a certain time span, leading their collected partial data are near optimal for the entire data collection task. This paper models the problem and develops multiple methods to improve the participant selection and the data recovery. Particularly, we use a random method, reinforcement learning, and greedy algorithm to handle this problem and compare the differences among these methods by experiments. © 2020, Springer Nature Switzerland AG.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Exploring multi-loss function based attention framework for vehicle re-identification 10

Exploring multi-loss function based attention framework for ...

引用

10th International Conference on information Technology in Medicine and Education, ITME 2019

作者： Liu, Wei Zhang, Yi Luo, Zhiming Li, Shaozi East China Jiaotong University Jiangxi China Cognitive Science Department Xiamen University Fujian China Postdoc Center of Information and Communication Engineering Xiamen University China Key Lab. of Cogn. Computing and Intelligent Information Processing of Fujian Education Institutions Wuyishan China Hubei Key Laboratory of Intelligent Vision Based Monitoring for Hydroelectric Engineering Yi Chang China

ISBN: (纸本)9781728139173

Vehicle Re-identification(Re-ID) refers to the task of matching a specific vehicle across multiple non-overlapping cameras. Precise vehicle Re-ID suffers from two main challenges: (1) different vehicle identities with a similar appearance of the same type have a subtle inter-instance discrepancy, (2) one vehicle usually has large intra-instance differences due to viewpoint and illumination variations. To address these challenges, in this paper, we proposed an Attention-based Framework for Vehicle Re-ID named AFVR, which combines the benefits of both the cross-entropy loss function and the triplet loss function. Experimental results on two popular vehicle Re-ID benchmarks demonstrate the effectiveness of our proposed method, compared with the state of the arts. © 2019 IEEE.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

Cross-view graph embedding

Cross-view graph embedding

引用

11th Asian Conference on Computer Vision, ACCV 2012

作者： Huang, Zhiwu Shan, Shiguang Zhang, Haihong Lao, Shihong Chen, Xilin Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China University of Chinese Academy of Sciences Beijing 100049 China OMRON Social Solutions Co. Ltd. Kyoto Japan

ISBN: (纸本)9783642374432

Recently, more and more approaches are emerging to solve the cross-view matching problem where reference samples and query samples are from different views. In this paper, inspired by Graph Embedding, we propose a unified framework for these cross-view methods called Cross-view Graph Embedding. The proposed framework can not only reformulate most traditional cross-view methods (e.g., CCA, PLS and CDFE), but also extend the typical single-view algorithms (e.g., PCA, LDA and LPP) to cross-view editions. Furthermore, our general framework also facilitates the development of new cross-view methods. In this paper, we present a new algorithm named Cross-view Local Discriminant Analysis (CLODA) under the proposed framework. Different from previous cross-view methods only preserving inter-view discriminant information or the intra-view local structure, CLODA preserves the local structure and the discriminant information of both intra-view and inter-view. Extensive experiments are conducted to evaluate our algorithms on two cross-view face recognition problems: face recognition across poses and face recognition across resolutions. These real-world face recognition experiments demonstrate that our framework achieves impressive performance in the cross-view problems. © 2013 Springer-Verlag.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Reducing blocking artifacts in compressed images via transform-domain non-local coefficients estimation

Reducing blocking artifacts in compressed images via transfo...

引用

2012 13th IEEE International Conference on Multimedia and Expo, ICME 2012

作者： Zhang, Xinfeng Xiong, Ruiqin Ma, Siwei Gao, Wen Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Graduate University Chinese Academy of Sciences Beijing 100049 China Institute of Digital Media Peking University Beijing 100871 China

ISBN: (纸本)9781467316590

Block transform coding using discrete cosine transform is the most popular approach for image compression. However, many annoying blocking artifacts are generated due to coarse quantization on transform coefficients independently. This paper proposes an effective blocking artifacts reduction method by estimating the transform coefficients from their quantized version. In the proposed scheme, we estimate the transform coefficients based on an image statistic model and non-local similarity among blocks in transform domain. The parameters used in our proposed scheme are discussed and adaptively selected. Extensive experimental results show that our proposed method significantly reduces blocking artifacts and improves the subjective and the objective quality of block transform coded images. © 2012 IEEE.

关键词： Discrete cosine transforms

来源：评论

学校读者我要写书评

暂无评论

PPLSA: Parallel probabilistic latent semantic analysis based on MapReduce

PPLSA: Parallel probabilistic latent semantic analysis based...

引用

7th IFIP International Conference on intelligent information processing, IIP 2012

作者： Li, Ning Zhuang, Fuzhen He, Qing Shi, Zhongzhi Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China Graduate University Chinese Academy of Sciences Beijing China Key Lab. of Machine Learning and Computational Intelligence College of Mathematics and Computer Science Hebei University Baoding China

ISBN: (纸本)9783642328909

PLSA(Probabilistic Latent Semantic Analysis) is a popular topic modeling technique for exploring document collections. Due to the increasing prevalence of large datasets, there is a need to improve the scalability of computation in PLSA. In this paper, we propose a parallel PLSA algorithm called PPLSA to accommodate large corpus collections in the MapReduce framework. Our solution efficiently distributes computation and is relatively simple to implement. © 2012 IFIP International Federation for information processing.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共56页 << < 17 18 19 20 21 22 23 24 25 26 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：