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

Lecture Notes in Networks and Systems 2024年 1076 LNNS卷 v-vii页

作者： Biele, Cezary Kacprzyk, Janusz Kopeć, Wieslaw Możaryn, Jakub Owsiński, Jan W. Romanowski, Andrzej Sikorski, Marcin National Information Processing Institute Warszaw Poland Polish Academy of Sciences Systems Research Institute Warsaw Poland Polish-Japanese Academy of Information Technology Warsaw Poland Institute of Automatic Control and Robotics Faculty of Mechatronics Warsaw University of Technology Warsaw Poland Institute of Applied Computer Science Faculty of Electrical Electronic Computer and Control Engineering Lódż University of Technology LODZ Poland Department of Applied Informatics in Management Faculty of Management and Economics Gdańsk University of Technology Gdańsk Poland

来源：评论

学校读者我要写书评

暂无评论

Unsupervised Domain Adaptation on Person Re-Identification via Dual-level Asymmetric Mutual Learning

arXiv

引用

arXiv 2023年

作者： Wu, Qiong Li, Jiahan Dai, Pingyang Ye, Qixiang Cao, Liujuan Wu, Yongjian Ji, Rongrong Institute of Artificial Intelligence The Media Analytics and Computing Laboratory Department of Artificial Intelligence School of Informatics Xiamen University Xiamen361005 China School of Information and Control Engineering China University of Mining and Technology Xuzhou221000 China The Media Analytics and Computing Laboratory Department of Artificial Intelligence School of Informatics Xiamen University Xiamen361005 China The Peng Cheng Laboratory Shenzhen518066 China The School of Electronics Electrical and Communication Engineering University of Chinese Academy of Sciences Beijing100049 China The Media Analytics and Computing Lab Department of Computer Science School of Informatics Xiamen University Xiamen361005 China The Youtu Laboratory Tencent Shanghai200233 China The Fujian Engineering Research Center of Trusted Artificial Intelligence Analysis and Application Institute of Artificial Intelligence Xiamen University Xiamen361005 China

Unsupervised domain adaptation person re-identification (Re-ID) aims to identify pedestrian images within an unlabeled target domain with an auxiliary labeled source-domain dataset. Many existing works attempt to recover reliable identity information by considering multiple homogeneous networks. And take these generated labels to train the model in the target domain. However, these homogeneous networks identify people in approximate subspaces and equally exchange their knowledge with others or their mean net to improve their ability, inevitably limiting the scope of available knowledge and putting them into the same mistake. This paper proposes a Dual-level Asymmetric Mutual Learning method (DAML) to learn discriminative representations from a broader knowledge scope with diverse embedding spaces. Specifically, two heterogeneous networks mutually learn knowledge from asymmetric subspaces through the pseudo label generation in a hard distillation manner. The knowledge transfer between two networks is based on an asymmetric mutual learning manner. The teacher network learns to identify both the target and source domain while adapting to the target domain distribution based on the knowledge of the student. Meanwhile, the student network is trained on the target dataset and employs the ground-truth label through the knowledge of the teacher. Extensive experiments in Market-1501, CUHK-SYSU, and MSMT17 public datasets verified the superiority of DAML over state-of-the-arts. Copyright © 2023, The Authors. All rights reserved.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

Learning Greenhouse Climate control Policy from Monitored Data

Learning Greenhouse Climate Control Policy from Monitored Da...

引用

Chinese Automation Congress (CAC)

作者： Xiaoxuan Zhao Haoyu Wang Xiujuan Wang Udom Lewlomphaisarl Dong Li Jing Hua Mengzhen Kang The State Key Laboratory for Management and Control of Complex Systems Chinese Academy of Sciences Institute of Automation Beijing China School of Artificial Intelligence University of Chinese Academy of Sciences Beijing China Beijing Engineering Research Center of Intelligent Systems and Technologies Beijing China National Electronics and Computer Technology Center Pathum Thani Thailand Institute of Digital Agriculture Zhejiang Academy of Agricultural Sciences Hangzhou China Qingdao AgriTech Co. Ltd. Qingdao China

The knowledge of solar greenhouse growers on environment control plays an important role in greenhouse production and management. We proposed a way to extract the control strategies from the monitored data of greenhouses by building a long short-term memory (LSTM) model. The result is verified according to the real monitored data of a solar greenhouse, which shows that the model can learn the control strategy of a ventilator in the solar greenhouse. Through monitored data and models, the knowledge of greenhouse ventilation control can be learned, and automatic control can be achieved in a greenhouse with a similar configuration.

关键词： Ventilators Green buildings Buildings Production Ventilation Data models Data mining

来源：评论

学校读者我要写书评

暂无评论

Efficient Pyramid Channel Attention Network for Pathological Myopia Recognition

arXiv

引用

arXiv 2023年

作者： Zhang, Xiaoqing Zhao, Jilu Li, Yan Wu, Hao Zhou, Xiangtian Liu, Jiang Research Institute of Trustworthy Autonomous Systems Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen518055 China Center for High Performance Computing Shenzhen Key Laboratory of Intelligent Bioinformatics Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen518055 China National Clinical Research Center for Ocular Diseases Eye Hospital Wenzhou Medical University Wenzhou325027 China State Key Laboratory of Ophthalmology Optometry and Visual Science Eye Hospital Wenzhou Medical University Wenzhou325027 China Research Unit of Myopia Basic Research and Clinical Prevention and Control Chinese Academy of Medical Sciences Wenzhou325027 China Singapore Eye Research Institute 169856 Singapore

Pathological myopia (PM) is the leading ocular disease for impaired vision worldwide. Clinically, the characteristic of pathology distribution in PM is global-local on the fundus image, which plays a significant role in assisting clinicians in diagnosing PM. However, most existing deep neural networks focused on designing complex architectures but rarely explored the pathology distribution prior of PM. To tackle this issue, we propose an efficient pyramid channel attention (EPCA) module, which fully leverages the potential of the clinical pathology prior of PM with pyramid pooling and multi-scale context fusion. Then, we construct EPCA-Net for automatic PM recognition based on fundus images by stacking a sequence of EPCA modules. Moreover, motivated by the recent pretraining-and-finetuning paradigm, we attempt to adapt pre-trained natural image models for PM recognition by freezing them and treating the EPCA and other attention modules as adapters. In addition, we construct a PM recognition benchmark termed PM-fundus by collecting fundus images of PM from publicly available datasets. The comprehensive experiments demonstrate the superiority of EPCA-Net over state-of-the-art methods in the PM recognition task. For example, EPCA-Net achieves 97.56% accuracy and outperforms ViT by 2.85% accuracy on the PM-fundus dataset. The results also show that our method based on the pretraining-and-finetuning paradigm achieves competitive performance through comparisons to part of previous methods based on traditional fine-tuning paradigm with fewer tunable parameters, which has the potential to leverage more natural image foundation models to address the PM recognition task in limited medical data regime. Copyright © 2023, The Authors. All rights reserved.

关键词： Pathology

来源：评论

学校读者我要写书评

暂无评论

Reference design for closed loop system optimization

arXiv

引用

arXiv 2020年

作者： Balula, Samuel Liniger, Alex Rupenyan, Alisa Lygeros, John Automatic Control Laboratory Department of Electrical Engineering and Information Technology ETH Zurich Switzerland Inspire AG ETH Zurich Switzerland Computer Vision Lab Department of Electrical Engineering and Information Technology ETH Zurich Switzerland

An optimization-based method for improving the productivity of precision machine tools is proposed, where the reference path is computed in local coordinates, and information about the machine tool performance is learned from experimental data. The optimization yields a modified reference that is tracked by the existing low-level controller. The method is tested in simulation for a biaxial positioning system. The positioning system is modelled as double integrator, and the controller characteristic is modelled from experimental data using a least-squares fit. Simulation results show that the method is effective in designing optimal references even for challenging geometries such as sharp corners. The application of this procedure allows the retrofit of the control of existing machines with minimal overhead, by providing a modified reference file to track. Copyright © 2020, The Authors. All rights reserved.

关键词： Closed loop systems

来源：评论

学校读者我要写书评

暂无评论

A New Perspective of Graph Data and A Generic and Efficient Method for Large Scale Graph Data Traversal

arXiv

引用

arXiv 2020年

作者： Zhang, Chenglong State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences School of Computer and Control Engineering University of Chinese Academy of Sciences Beijing100049 China

The BFS algorithm is a basic graph data processing algorithm and many other graph data processing algorithms have similar architectural features with BFS algorithm and can be built on the basis of BFS algorithm model. We analyze the differences between graph algorithms and traditional high-performance algorithms in detail, propose a new way of classifying algorithms into data independent algorithm and data correlation algorithm based on their run-time correlation with data, and use this new classification to explain the validity of the methods proposed in this paper. Through a deeper analysis of graph data, we propose a new fundamental perspective on understanding graph data, establishing a link between two basic data structures, graph and tree, and viewing graph data as consisting of smaller subgraphs and edge trees. Small degree vertices are found to be one of important cause of random memory access. Based on this, we propose a general, easy to implement, and efficient method for graph data processing, with the basic idea of treating low-degree vertices and core subgraphs separately, thus significantly reducing the size of random memory access and improving the efficiency of memory access. Finally, we evaluated the performance of the method on three major data center computing platforms (Intel, AMD, and ARM), and the experiments showed that it brought 19.7%, 31.8% and 17.9% performance improvement, respectively, with a performance-power ratio of 282.70 MTEPS/s on the ARM platform, ranking it among the Green graph500 in November 2019. World No. 1 on the big dataset list. Copyright © 2020, The Authors. All rights reserved.

关键词： Graph algorithms

来源：评论

学校读者我要写书评

暂无评论

Network Inference using Sinusoidal Probing

引用

IFAC-PapersOnLine 2021年第9期54卷 696-700页

作者： Robin Delabays Melvyn Tyloo Automatic Control Laboratory Swiss Federal Institute of Technology CH-8092 Zurich Switzerland Center for Control Dynamical Systems and Computation UCSB Santa Barbara CA 93106-5070 USA School of Engineering University of Applied Sciences of Western Switzerland HES-SO CH-1951 Sion Switzerland Institute of Physics École Polytechnique Fédérale de Lausanne (EPFL) CH-1015 Lausanne Switzerland

The aim of this manuscript is to present a non-invasive method to recover the network structure of a dynamical system. We propose to use a controlled probing input and to measure the response of the network, in the spirit of what is done to determine oscillation modes in large electrical networks. For a large class of dynamical systems, we show that this approach is analytically tractable and we confirm our findings by numerical simulations of networks of Kuramoto oscillators. Our approach also allows us to determine the number of agents in the network by probing and measuring a single one of them.

关键词： Networks inference processes Jacobian matrices input signals low frequencies

来源：评论

学校读者我要写书评

暂无评论

A Demand Response Framework to Overcome Network Overloading in Power Distribution Networks ⁎

引用

IFAC-PapersOnLine 2020年第2期53卷 13339-13344页

作者： Muhammad Jibran Hasan Arshad Nasir Faran Qureshi Usman Ali Colin Jones School of Electrical Engineering and Computer Science National University of Sciences and Technology Islamabad 44000 Pakistan Computer Electrical and Mathematical Science and Engineering Division King Abdullah University of Science and Technology Thuwal 23955 Saudi Arabia Automatic Control Lab in Ecole Polytechnique Fédérale de Lausanne Lausanne CH-1015 Switzerland

This paper considers the problem of network overloading in the power distribution networks of Pakistan, often resulting from the inability of the transmission system to transfer power from source to end-user during peak loads. This results in frequent power-outages and consumers at such times have to rely on alternative energy sources, e.g. Uninterrupted Power Supply (UPS) systems with batteries to meet their basic demand. In this paper, we propose a demand response framework to eliminate the problem of network overloading. The flexibility provided by the batteries at different houses connected to the same grid node is exploited by scheduling the flow of power from mains and batteries and altering the charging-discharging patterns of the batteries, thereby avoiding network overloading and any tripping of the grid node. This is achieved by casting the problem in an optimal control setting based on a prediction of power demand at a grid node and then solving it using a model predictive control strategy. We present a case study to demonstrate the application and efficacy of our proposed framework.

关键词：

来源：评论

学校读者我要写书评

暂无评论

ABCP: automatic block-wise and channel-wise network pruning via joint search

arXiv

引用

arXiv 2021年

作者： Li, Jiaqi Li, Haoran Chen, Yaran Ding, Zixiang Li, Nannan Ma, Mingjun Duan, Zicheng Zhao, Dongbing The State Key Laboratory of Management and Control for Complex Systems Institute of Automation Chinese Academy of Sciences Beijing100190 China The School of Mechanical Engineering Beijing Institute of Technology Beijing100081 China The University of Chinese Academy of Sciences Beijing China The College of Engineering and Computer Science Australian National University ACT2601 Australia

Currently, an increasing number of model pruning methods are proposed to resolve the contradictions between the computer powers required by the deep learning models and the resource-constrained devices. However, most of the traditional rule-based network pruning methods can not reach a sufficient compression ratio with low accuracy loss and are time-consuming as well as laborious. In this paper, we propose automatic Block-wise and Channel-wise Network Pruning (ABCP1) to jointly search the block-wise and channel-wise pruning action with deep reinforcement learning. A joint sample algorithm is proposed to simultaneously generate the pruning choice of each residual block and the channel pruning ratio of each convolutional layer from the discrete and continuous search space respectively. The best pruning action taking both the accuracy and the complexity of the model into account is obtained finally. Compared with the traditional rule-based pruning method, this pipeline saves human labor and achieves a higher compression ratio with lower accuracy loss. Tested on the mobile robot detection dataset, the pruned YOLOv3 model saves 99.5% FLOPs, reduces 99.5% parameters, and achieves 37.3× speed up with only 2.8% mAP loss. The results of the transfer task on the sim2real detection dataset also show that our pruned model has much better robustness performance. Copyright © 2021, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Multi-View Landmark-Assisted UAV Swarm 6-DoF Pose Estimation Using Resonant Beam and VIO

引用

IEEE Internet of Things Journal 2025年

作者： Du, Siyuan Xu, Mengyuan Li, Yixuan Fang, Wen Liu, Qingwen Yi, Peng Hong, Yiguang Tongji University School of Computer Science and Technology Shanghai201804 China Tongji University College of Electronic and Information Engineering Shanghai201804 China Chinese Academy of Sciences Key Laboratory of Systems and Control Academy of Mathematics and Systems Science Beijing100190 China

As an essential aerial platform in Internet of Things (IoT) applications, UAV swarms require high-precision attitude estimation in GPS-limited and dynamic environments, which supports higher-level IoT functions such as smart logistics, disaster response, and environmental monitoring. However, most odometry-based pose estimation methods in dynamic scenarios without GPS encounter issues with cumulative errors over time. In this paper, we propose a method to reduce these cumulative errors by constraining the absolute positioning of Visual-Inertial Odometry (VIO) using relative poses obtained from multi-view landmark and Resonant-Beam (RBeam) sensors between UAVs. For synchronous moments, we estimate the 6 Degree-of-Freedom (DoF) relative pose using the Angle of Arrival and Time of Flight data from the RBeam, combined with nonlinear optimization. For asynchronous moments, a two-stage visual estimation method is introduced, combining multi-camera epipolar geometry for rotation recovery and depth reconstruction optimization for translation recovery, enabling the estimation of asynchronous relative poses. Finally, we design a global objective function based on a sliding window and factor graph, integrating RBeam, multi-view landmark, and VIO for absolute 6-DoF pose optimization of the UAV swarm. Simulation results demonstrate that optimizing with the addition of RBeam synchronous relative poses improves overall positioning accuracy by 32.94% compared to pure VIO. Incorporating both RBeam synchronous and visual asynchronous relative poses further enhances overall positioning accuracy by 37.65%. Additionally, the UAV’s attitude benefits from the rotational constraints provided by the RBeam, achieving over 30% improvement in the pitch and yaw directions. © 2014 IEEE.

关键词： Global positioning system

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：