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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,614 篇 会议
1,979 篇 期刊文献
4 册 图书

馆藏范围

5,597 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

3,645 篇 工学
- 1,676 篇 计算机科学与技术...
- 1,489 篇 软件工程
- 978 篇 控制科学与工程
- 752 篇 信息与通信工程
- 578 篇 机械工程
- 473 篇 电气工程
- 423 篇 电子科学与技术（可...
- 343 篇 生物工程
- 320 篇 仪器科学与技术
- 274 篇 光学工程
- 230 篇 化学工程与技术
- 218 篇 生物医学工程（可授...
- 204 篇 交通运输工程
- 193 篇 动力工程及工程热...
- 164 篇 材料科学与工程（可...
- 114 篇 安全科学与工程
- 112 篇 航空宇航科学与技...
- 99 篇 土木工程
2,004 篇 理学
- 1,030 篇 数学
- 510 篇 物理学
- 373 篇 生物学
- 350 篇 系统科学
- 288 篇 统计学（可授理学、...
- 226 篇 化学
731 篇 管理学
- 525 篇 管理科学与工程(可...
- 215 篇 图书情报与档案管...
- 160 篇 工商管理
180 篇 医学
- 142 篇 临床医学
- 116 篇 基础医学(可授医学...
- 95 篇 药学(可授医学、理...
86 篇 经济学
84 篇 法学
75 篇 农学
25 篇 教育学
22 篇 军事学
13 篇 艺术学
10 篇 文学
2 篇 哲学
2 篇 历史学

主题

199 篇 feature extracti...
118 篇 training
98 篇 optimization
88 篇 accuracy
86 篇 semantics
81 篇 computational mo...
80 篇 robustness
78 篇 predictive model...
77 篇 simulation
75 篇 object detection
73 篇 synthetic apertu...
68 篇 image segmentati...
66 篇 real-time system...
64 篇 heuristic algori...
61 篇 three-dimensiona...
61 篇 visualization
61 篇 mathematical mod...
59 篇 convolution
58 篇 data models
57 篇 reinforcement le...

机构

332 篇 department of au...
312 篇 key laboratory o...
197 篇 hubei province k...
157 篇 department of au...
142 篇 key laboratory o...
138 篇 cas key laborato...
132 篇 school of comput...
119 篇 fujian provincia...
112 篇 shanghai enginee...
110 篇 college of compu...
82 篇 department of au...
71 篇 hubei province k...
67 篇 university of ch...
60 篇 aerospace inform...
54 篇 key laboratory o...
54 篇 state key labora...
52 篇 fujian provincia...
51 篇 shaanxi key labo...
47 篇 college of infor...
46 篇 school of electr...

作者

103 篇 shaoyuan li
103 篇 xinping guan
79 篇 cailian chen
74 篇 chen cailian
73 篇 dewei li
67 篇 li zuoyong
67 篇 guan xinping
59 篇 yugeng xi
58 篇 jingcheng wang
56 篇 zhang fuquan
52 篇 li dewei
52 篇 wang hesheng
50 篇 hesheng wang
49 篇 li shaoyuan
47 篇 yang bo
45 篇 chen zhibo
44 篇 bo yang
44 篇 xiaofan wang
42 篇 weidong chen
42 篇 yin xiang

语言

5,256 篇 英文
225 篇 其他
115 篇 中文
1 篇 德文
1 篇 法文

检索条件"机构=The Key Laboratory of System Control and Information Processing"

共 5597 条记录，以下是701-710 订阅

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

详细简洁

排序：

Fine grained image recognition algorithm based on CNN-Transformer and paired interaction

Fine grained image recognition algorithm based on CNN-Transf...

引用

Neural Networks, information and Communication Engineering (NNICE), International Conference on

作者： Yu Wang Hong Zhang Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial System Wuhan University of Science and Technology Wuhan China

A new fine-grained image recognition algorithm (P-ResViT, Paired Interaction Res50-ViT) based on CNN-Transformer is proposed to address the issue of existing fine-grained image recognition methods based on convolutional neural networks (CNN) lacking attention mechanisms and difficulty in accurately locating key regions, as well as weak ability to extract contextual information and global features. This algorithm introduces paired interaction attention mechanisms to supplement external attention. This algorithm can utilize the self attention mechanism of the Vision Transformer and the external attention mechanism formed by paired image inputs during training to achieve precise positioning, while preserving the inductive bias and local feature extraction capabilities of CNN. Firstly, the fine-tuning improved ResNet-50 completes local feature extraction and obtains high-resolution feature maps. Secondly, the Transformer encodes the tokenized image blocks of the feature map as input sequences for extracting global context. Finally, the Transformer completes global feature extraction and outputs the classification sequence. In addition, two external attention mechanisms were introduced by inputting image pairs during training, including collaborative attention mechanisms for similar images and cross attention mechanisms for heterogeneous images, fully utilizing the correlation information between images. After experimental evaluation, the P-ResViT proposed in this article has reached advanced levels in three fine-grained image datasets CUB, CAR, and AIR.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Influence Maximization With Graph Neural Network in Multi-Feature Social Network 24

Influence Maximization With Graph Neural Network in Multi-Fe...

引用

24th IEEE International Conference on High Performance Computing and Communications, 8th IEEE International Conference on Data Science and systems, 20th IEEE International Conference on Smart City and 8th IEEE International Conference on Dependability in Sensor, Cloud and Big Data systems and Application, HPCC/DSS/SmartCity/DependSys 2022

作者： Wang, Yuhao Li, Peng Huang, Weiyi School of Computer Science and Technology Wuhan University of Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System China

ISBN: (纸本)9798350319934

The classical influence maximization (IM) prob-lem aims to select a set of nodes as seed nodes for information propagation. Most related studies focus on one-dimensional information dissemination. However, the diffusion of information should be a multi-dimensional (or multi-feature) diffusion process. The user's judgment of information often depends on the combined judgment of multiple-dimensional information. Based on this, we consider a multi-feature diffusion model. In-formation will be decomposed into multi-dimensional features for diffusion. The user will receive these features and integrate them into a complete message. In addition, we consider seed node selection as a network node classification task. Consid-ering that social networks satisfy a graph structure, we use the node classification technique of graph neural networks. This technique classifies the nodes by the network topology to find the set of influential nodes. We propose a multi-feature influence (MFI) algorithm to improve the performance of the prediction. The set of candidate nodes obtained by classification is used as a benchmark to find the set of nodes with maximum influence. Our experiment results on real datasets show that the proposed algorithm has better algorithmic efficiency than the traditional greedy algorithm and better effectiveness than similar heuristic algorithms. © 2022 IEEE.

关键词： information dissemination

来源：评论

学校读者我要写书评

暂无评论

Novel £2,1-Norm Based Least Square Regression Method for Classification

Novel £2,1-Norm Based Least Square Regression Method for Cl...

引用

International Conference on Informative and Cybernetics for Computational Social systems (ICCSS)

作者： Junwei Jin Qiuling Yan Chunhua Zhu Zhenghao Qin Lei Li Key Laboratory of Grain Information Processing and Control Henan University of Technology Ministry of Education Henan Key Laboratory of grain photoelectric detection and control College of Information Science and Engineering Henan University of Technology Unmanned System Research Institute Northwestern Polytechnical University

In the realm of linear regression, the concept of utilizing relaxed regression targets for classification has shown considerable success. However, it suffers from a lack of strong discriminative ability. In this study, we build upon the theory of relaxed regression targets and propose a more concise and discriminative model for multi-class classification. Our approach introduces the £ 2,1 -norm regularized term to enhance the efficacy and compactness of the learned projection matrix. This regularization term not only generates a sparse row structure but also facilitates feature selection during the training phase. Consequently, both the accuracy of classification and the convergence speed of the model are improved. Furthermore, when compared to various variants of the linear regression model, our designed method exhibits superior performance in image classification. Through extensive experiments conducted on image databases, we provide evidence that our proposed approach excels in recognition capability, surpassing the performance of state-of-the-art methods in terms of classification accuracy.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Two-sided Online Stable Task Assignment with Incomplete Lists and Ties in Spatial Crowdsourcing 19

Two-sided Online Stable Task Assignment with Incomplete List...

引用

2022 IEEE SmartWorld, 19th IEEE International Conference on Ubiquitous Intelligence and Computing, 2022 IEEE International Conference on Autonomous and Trusted Vehicles Conference, 22nd IEEE International Conference on Scalable Computing and Communications, 2022 IEEE International Conference on Digital Twin, 8th IEEE International Conference on Privacy Computing and 2022 IEEE International Conference on Metaverse, SmartWorld/UIC/ATC/ScalCom/DigitalTwin/PriComp/Metaverse 2022

作者： Huang, Weiyi Li, Peng Li, Bo Liu, Jing Nie, Lei Bao, Haizhou Wuhan University of Science and Technology School of Computer Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System China

ISBN: (纸本)9798350346558

For the application of task assignment in crowdsourcing, previous research has focused on offline version or one-sided online version. Some of them draw extra attention to stability in task assignment. Our work extends a one-sided task assignment and its stable generalization. In particular, we present a two-sided online stable task assignment (TS-OSTA) problem in which any vertex from two sides can maintain an incomplete neighbor list and ties. We first give the fundamental definitions of task assignment in spatial crowdsourcing and stable matching. Then, we analyze and present the matching condition and formulate the TS-OSTA problem. As a warm-up, we investigate and analyze two classical baseline algorithms Greedy and Random Threshold. Then we present a bipartite ranking algorithm that maintains the efficiency of Greedy and effectiveness of Random Threshold. Through extensive experiments, we examine the performance of our algorithm in size, memory, and time. The results show that our algorithm performs better than the baselines. © 2022 IEEE.

关键词： Crowdsourcing

来源：评论

学校读者我要写书评

暂无评论

Dynamic Event-Triggered control for Multi-Agent Consensus with Relative Output Feedback

Dynamic Event-Triggered Control for Multi-Agent Consensus wi...

引用

American control Conference (ACC)

作者： Sikang Zhan Xianwei Li Department of Automation Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai China

ISBN: (数字)9798350382655

ISBN: (纸本)9798350382662

This paper studies the consensus problem of linear multi-agent systems (MASs) with relative output measurement on undirected graphs. Output-feedback protocols are designed for both leaderless and leader-follower consensus. Different from [1], dynamic event-triggered sampling strategies are integrated to reduce the communication burdens between agents. Compared with most of the existing results which are based absolute output, the proposed protocols are based on sampled relative output. Finally, a simulation example is provided to illustrate the theoretical results.

关键词： Protocols Decentralized control Numerical simulation Topology Closed loop systems Output feedback Multi-agent systems

来源：评论

学校读者我要写书评

暂无评论

A Review of Rotation Mechanical Fault Diagnosis Research Based on Deep Domain Adaptation 9

A Review of Rotation Mechanical Fault Diagnosis Research Bas...

引用

9th IEEE International Conference on Big Data Computing Service and Applications, BigDataService 2023

作者： Zhang, Shun Xie, Gang Tian, Juan Shi, Hui Zhang, Xiaohong Nie, Xiaoyin Xie, Xinlin Shanxi Key Laboratory of Advanced Control and Equipment Intelligence Taiyuan China Taiyuan University of Science and Technology Dept. of Electronic and Information Engineering Taiyuan China Division of Industrial and System Engineering Taiyuan China

ISBN: (纸本)9798350333794

With the rapid development of computer technology and the Internet of Things (IoT), a large amount of data containing both healthy and faulty states can be collected from existing devices in factories. However, the usable faulty state data is scarce. Transfer learning makes it possible to train efficient and reliable neural networks with a small number of samples. Domain adaptation, as a branch of transfer learning, can effectively realize knowledge transfer between small sample data. Starting from three subcategories of deep learning-based domain adaptation methods, this article summarizes the latest research achievements and provides insights into future research directions. © 2023 IEEE.

关键词： Failure analysis

来源：评论

学校读者我要写书评

暂无评论

Multi-Attention Gate Based U-net for Retinal Vessel Segmentation 12

Multi-Attention Gate Based U-net for Retinal Vessel Segmenta...

引用

12th International Conference on information Technology in Medicine and Education, ITME 2022

作者： Zhu, Yu Li, Rui Teng, Shenghua Cao, Xinrong Shandong University of Science and Technology College of Electronic and Information Engineering Qingdao266590 China College of Computer and Control Engineering Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Minjiang University Fuzhou350121 China

ISBN: (纸本)9798350310153

Retinal blood vessel segmentation images can be used to detect and evaluate various cardiovascular and ophthalmic diseases. However, due to the intricate vessel structures and blurred boundaries of vessels, it is a huge challenge to efficiently and accurately segment blood vessels. To deal with the above problems, this paper improves on the U-net by firstly using multi-scale feature convolution with kernels of varying size for feature extraction. Second, a non-local attention mechanism is applied to obtain richer global semantic information. Then multi-attention gate is used in the skip connection part by inputting feature maps of various scales and dimensions and selectively learning the interrelated regions, which improves the segmentation ability of the network model for the tiny structure of blood vessels. Quantitative and qualitative experimental results on two public datasets, DRIVE and CHASE-DB1, demonstrate the effectiveness of the proposed method. © 2022 IEEE.

关键词： Blood vessels

来源：评论

学校读者我要写书评

暂无评论

A Network Combining CNN and Transformer for Blind Image Super-Resolution 12

A Network Combining CNN and Transformer for Blind Image Supe...

引用

12th International Conference on information Technology in Medicine and Education, ITME 2022

作者： Zhang, Shuhao Li, Zuoyong Teng, Shenghua Zeng, Kun Shandong University of Science and Technology College of Electronic and Information Engineering Qingdao266590 China Minjiang University Fujian Provincial Key Laboratory of Information Processing and Intelligent Control College of Computer and Control Engineering Fuzhou350121 China

ISBN: (纸本)9798350310153

Blind super-resolution (SR) requires not only estimating blur kernel, but also super-resolving low-resolution image based on estimated blur kernel. Most blind SR methods use convolutional neural networks (CNNs) for kernel estimation, which cannot exploit long-range dependency within image domain, thus failing to predict blur kernel accurately. To address this issue, we propose a network combining CNN and transformer named NCCT for kernel estimation. By modeling local and non-local image priors simultaneously, NCCT outperforms other blind SR methods in terms of kernel estimation accuracy. Moreover, we design a network module named RRFDB for constructing lightweight blind SR network, which runs faster and achieves comparative SR performance with fewer parameters compared with other state-of-the-art blind SR methods. © 2022 IEEE.

关键词： Optical resolving power

来源：评论

学校读者我要写书评

暂无评论

The Deployment of Microservice at Edge based on MQTT for Low Latency

The Deployment of Microservice at Edge based on MQTT for Low...

引用

IEEE International Conference on Industrial Informatics (INDIN)

作者： Mengqi Han Bo Yang Yuxiang Liu Sicheng Liu Qi Liu Department of Automation Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai China

ISBN: (数字)9798331527471

ISBN: (纸本)9798331527488

With the rapid development of smart manufacturing, existing microservice deployment strategies based on the TCP protocol tend to encounter problems such as network latency, excessive header length, and port exhaustion in high concurrency scenarios. MQTT Broker can relay data between microservices, effectively alleviating these issues. However, the communication overhead of the Broker is significantly related to its deployment and the dependency of microservices. An appropriate deployment solution can significantly improve service quality. To address this issue, this paper models the deployment of MQTT Broker and microservices as a graph with cycles. By introducing auxiliary variables, the NP-hard problem is transformed into a mixed-integer quadratic programming problem, improving problem-solving efficiency and optimizing the microservices deployment strategy to reduce communication overhead. Meanwhile, a real-world heterogeneous cluster was constructed to experiment on fault detection applications, elaborating on the superiority of the microservice deployment strategy designed in this paper. Experimental results demonstrate that our approach reduces communication overhead by 20% in comparison to both the greedy strategy and the K8s strategy. This suggests that achieving an optimal balance between the number of Brokers and microservices is vital for ensuring efficient resource utilization and maintaining low communication latency, particularly as the scale of services expands.

关键词： Protocols Fault detection Microservice architectures Transforms Programming Quadratic programming Resource management Problem-solving Relays Smart manufacturing

来源：评论

学校读者我要写书评

暂无评论

Duration-Aware Task Assignment for Heterogeneous Mobility Users in Crowdsensing 25

Duration-Aware Task Assignment for Heterogeneous Mobility Us...

引用

25th IEEE International Conference on Computer Supported Cooperative Work in Design, CSCWD 2022

作者： Liu, Zhiyuan Li, Peng Huang, Weiyi Wang, Jiahu Nie, Lei Wuhan University of Science and Technology School of Computer Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing Real-Time Industrial System China

ISBN: (纸本)9781665405270

This paper investigates the duration-aware task assignment problem for heterogeneous mobility users in MCS (DTAH problem). There are two types of users in MCS, vehicle users and pedestrian users. The vehicle user gets to the task fast, but the task duration is short. Pedestrian user meets the task duration limit, but it takes a long time to reach the task. Given a set of tasks and two types of users, each user, and each task has a duration limit. The DTAH problem is how to assign tasks to maximize the utility of the system. We prove that the DTAH problem is NP-hard by reducing the weighted maximum set coverage problem to the DTAH problem. Then, we solve the problem from a pedestrian perspective and a vehicle perspective. From the pedestrian user perspective, we propose a pedestrian user task assignment (PTA) algorithm based on the Kuhn-Munkres algorithm. From the vehicle user perspective, we propose a greedy vehicle user task assignment (VTA) algorithm. We prove that the VTA algorithm can obtain the approximate ratio of 1-1/e to the optimal value. Finally, we design the heterogeneous user task assignment (HTA) algorithm based on these PTA and VTA algorithms. Extensive experiments have proved that our proposed HTA algorithm achieves more efficient performance than other comparison algorithms. © 2022 IEEE.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 67 68 69 70 71 72 73 74 75 76 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：