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

High-accuracy disposable micro-optical anti-counterfeiting labels based on single-molecule quantum coherence

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Han, Shuangping Song, Kai Zan, Pengyu Yu, Changzhi Li, Ao Zhou, Haitao Qin, Chengbing Xiao, Liantuan College of Physics and Optoelectronics Engineering Taiyuan University of Technology Shanxi Taiyuan030024 China Key Laboratory of Advanced Transducers and Intelligent Control System of Ministry of Education Taiyuan University of Technology Taiyuan030024 China Department of Nuclear Medicine The First Hospital of Shanxi Medical University Collaborative Innovation Center of Molecular Imaging Precision Medical Shanxi Medical University Taiyuan030001 China State Key Laboratory of Quantum Optics and Quantum Optics Devices Institute of Laser Spectroscopy Shanxi University Shanxi Taiyuan030006 China

In this work we introduce an innovative approach to single-molecule quantum coherence (SMQC)-based disposable micro-optical anti-counterfeiting labels. This method facilitates the editing and reading of anti-counterfeiting with single molecules used as the anti-counterfeiting information labels. The label is meticulously crafted through inkjet printing technology, while its authentication is achieved via frequency domain imaging. Through a validation process including experimental demonstration, numerical simulation, and neural network analysis, we demonstrate the feasibility of this approach, further validate the integrity of the miniature anti-counterfeiting information storage, and verify the signal extraction accuracy with the recognition accuracy of the labels is consistently above 99.995%. The combination of SMQC-based disposable micro-optical anti-counterfeiting technology is expected to enable more precise preparation of single-molecule-array chips, thus providing a crucial foundation for the advancement of high-tech and smart manufacturing industries. Copyright © 2025, The Authors. All rights reserved.

关键词： Ink jet printing

Submodularity-based False Data Injection Attack Scheme in Multi-agent Dynamical systems

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Luo, Xiaoyu Zhao, Chengcheng Fang, Chongrong He, Jianping The Department of Automation Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China The State Key Laboratory of Industrial Control Technology Institute of Cyberspace Research Zhejiang University China The Department of Electrical and Computer Engineering University of Victoria BC Canada

Consensus in multi-agent dynamical systems is prone to be sabotaged by the adversary, which has attracted much attention due to its key role in broad applications. In this paper, we study a new false data injection (FDI) attack design problem, where the adversary with limited capability aims to select a subset of agents and manipulate their local multi-dimensional states to maximize the consensus convergence error. We first formulate the FDI attack design problem as a combinatorial optimization problem and prove it is NP-hard. Then, based on the submodularity optimization theory, we show the convergence error is a submodular function of the set of the compromised agents, which satisfies the property of diminishing marginal returns. In other words, the benefit of adding an extra agent to the compromised set decreases as that set becomes larger. With this property, we exploit the greedy scheme to find the optimal compromised agent set that can produce the maximum convergence error when adding one extra agent to that set each time. Thus, the FDI attack set selection algorithms are developed to obtain the near-optimal subset of the compromised agents. Furthermore, we derive the analytical suboptimality bounds and the worst-case running time under the proposed algorithms. Extensive simulation results are conducted to show the effectiveness of the proposed algorithm. Copyright © 2022, The Authors. All rights reserved.

关键词： Dynamical systems

Distributed Event-Triggered Algorithm for Convex Optimization with Coupled Constraints

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Huang, Yi Zeng, Xianlin Meng, Ziyang Sun, Jian School of Automation Beijing Institute of Technology Beijing100081 China State Key Laboratory of Intelligent Control and Decision of Complex Systems School of Automation Beijing Institute of Technology Beijing100081 China Department of Precision Instrument Tsinghua University Beijing100084 China Chongqing Innovation Center Beijing Institute of Technology Chongqing401120 China

This paper develops a distributed primal-dual algorithm via event-triggered mechanism to solve a class of convex optimization problems subject to local set constraints, coupled equality and inequality constraints. Different from some existing distributed algorithms with the diminishing step-sizes, our algorithm uses the constant step-sizes, and is shown to achieve an exact convergence to an optimal solution with an O(1/k) convergence rate for general convex objective functions, where k > 0 is the iteration number. Moreover, by applying event-triggered communication mechanism, the proposed algorithm can effectively reduce the communication cost without sacrificing the convergence rate. Finally, a numerical example is presented to verify the effectiveness of the proposed algorithm. Copyright © 2022, The Authors. All rights reserved.

关键词： Convex optimization

Joint Counting, Detection and Re-Identification for Multi-Object Tracking

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Ren, Weihong Wu, Denglu Cao, Hui Chen, Xi'ai Han, Zhi Liu, Honghai The School of Mechanical Engineering and Automation State Key Lab of Robotics and Systems Harbin Institute of Technology Shenzhen518055 China The Shenzhen Duorou Intelligent System Co. Ltd. Shenzhen518055 China The School of Electrical Engineering Xi’an Jiaotong University Xi’an710049 China State Key Laboratory of Robotics Shenyang Institute of Automation Chinese Academy of Science Beijing110169 China

The recent trend in 2D multiple object tracking (MOT) is jointly solving detection and tracking, where object detection and appearance feature (or motion) are learned simultaneously. Despite competitive performance, in crowded scenes, joint detection and tracking usually fail to find accurate object associations due to missed or false detections. In this paper, we jointly model counting, detection and re-identification in an end-to-end framework, named CountingMOT, tailored for crowded scenes. By imposing mutual object-count constraints between detection and counting, the CountingMOT tries to find a balance between object detection and crowd density map estimation, which can help it to recover missed detections or reject false detections. Our approach is an attempt to bridge the gap of object detection, counting, and re-Identification. This is in contrast to prior MOT methods that either ignore the crowd density and thus are prone to failure in crowded scenes, or depend on local correlations to build a graphical relationship for matching targets. The proposed MOT tracker can perform online and real-time tracking, and achieves the state-of-the-art results on public benchmarks MOT16 (MOTA of 79.7%), MOT17 (MOTA of 81.3%) and MOT20 (MOTA of 78.9%). Source code is available at https://***/weihong9/CountingMOT. Copyright © 2022, The Authors. All rights reserved.

关键词： Object detection

Switchable deep beamformer for high-quality and real-time passive acoustic mapping

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zeng, Yi Li, Jinwei Zhu, Hui Lu, Shukuan Li, Jianfeng Cai, Xiran School of Information Science and Technology ShanghaiTech University Shanghai201210 China Gene Editing Center School of Life Science and Technology ShanghaiTech University Shanghai201210 China State Key Laboratory of Advanced Medical Materials and Devices ShanghaiTech University Shanghai201210 China Key Laboratory of Biomedical Information Engineering of Ministry of Education Department of Biomedical Engineering School of Life Science and Technology Xi’an Jiaotong University Xi’an710049 China Shanghai Engineering Research Center of Intelligent Vision and Imaging ShanghaiTech University Shanghai201210 China Key Laboratory of Biomedical Imaging Science and System Chinese Academy of Sciences Shenzhen518055 China

Passive acoustic mapping (PAM) is a promising tool for monitoring acoustic cavitation activities in the applications of ultrasound therapy. Data-adaptive beamformers for PAM have better image quality compared to the time exposure acoustics (TEA) algorithms. However, the computational cost of data-adaptive beamformers is considerably expensive. In this work, we develop a deep beamformer based on a generative adversarial network, which can switch between different transducer arrays and reconstruct high-quality PAM images directly from radio frequency ultrasound signals with low computational cost. The deep beamformer was trained on the dataset consisting of simulated and experimental cavitation signals of single and multiple microbubble clouds measured by different (linear and phased) arrays covering 1–15 MHz. We compared the performance of the deep beamformer to TEA and three different data-adaptive beamformers using the simulated and experimental test dataset. Compared with TEA, the deep beamformer reduced the energy spread area by 18.9%–65.0% and improved the image signal-to-noise ratio by 9.3–22.9 dB in average for the different arrays in our data. Compared to the data-adaptive beamformers, the deep beamformer reduced the computational cost by three orders of magnitude achieving 10.5 ms image reconstruction speed in our data, while the image quality was as good as that of the data-adaptive beamformers. These results demonstrated the potential of the deep beamformer for high-resolution monitoring of microbubble cavitation activities for ultrasound therapy. Copyright © 2024, The Authors. All rights reserved.

关键词： Cavitation

Optimization of Robot End-Effector Load Gravity Compensation for Unmanned Live Work in Electric Power Distribution Networks Based on Improved PSO Algorithm

学校读者我要写书评

暂无评论

Optimization of Robot End-Effector Load Gravity Compensation...

Chinese automation Congress (CAC)

作者： Jinge Chen Xin Chen Chenyu Hu Guangxian Huang Shu Sun Xu Jian School of Automation China University of Geosciences Wuhan China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Wuhan China Engineering-Research Center of Intelligent Technology for Geo-Exploration Ministry of Education Wuhan China Distribution Department State Grid Hubei Electric Power Co. Ltd. Xianning Power Supply Company Xianning China Equipment Technology Center State Grid Hubei Electric Power Co. Ltd. Electric Power Science Research Institute Wuhan China

In the field of electric power distribution network operation, most tasks involve contact operations. A key technology to enable the flexible operation of robots in live distribution network tasks is the installation of six-dimensional force sensors on the robot's end flange. These sensors allow the robot to perceive external environmental contact forces. However, the presence of the end load interferes with the accurate perception of external forces. Aiming at the gravity compensation of robot end load, an optimization algorithm of gravity compensation based on particle swarm optimization is proposed. In this method, the optimal solution model is established with the objective of minimum sum of squared errors, and the particle swarm optimization algorithm is used to estimate the mounting declination angle of the force sensor and improve the precision of gravity compensation. The experiments show that the proposed method can effectively reduce the maximum gravity compensation error and the average gravity compensation error in each direction after optimization, in which the maximum gravity compensation error of the resultant force is reduced by 9.11% and the average gravity compensation error of the resultant force is reduced by 12.34%.

关键词：

Tackling Noisy Labels with Network Parameter Additive Decomposition

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Wang, Jingyi Xia, Xiaobo Lan, Long Wu, Xinghao Yu, Jun Yang, Wenjing Han, Bo Liu, Tongliang The Department of Intelligent Data Science College of Computer Science and Technology National University of Defense Technology Changsha410073 China The Trustworthy Machine Learning Lab School of Computer Science Faculty of Engineering University of Sydney DarlingtonNSW2008 Australia The State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and Engineering Beihang University Beijing100191 China The Department of Automation University of Science and Technology of China Hefei230026 China The Department of Computer Science Hong Kong Baptist University Hong Kong

Given data with noisy labels, over-parameterized deep networks suffer overfitting mislabeled data, resulting in poor generalization. The memorization effect of deep networks shows that although the networks have the ability to memorize all noisy data, they would first memorize clean training data, and then gradually memorize mislabeled training data. A simple and effective method that exploits the memorization effect to combat noisy labels is early stopping. However, early stopping cannot distinguish the memorization of clean data and mislabeled data, resulting in the network still inevitably overfitting mislabeled data in the early training stage. In this paper, to decouple the memorization of clean data and mislabeled data, and further reduce the side effect of mislabeled data, we perform additive decomposition on network parameters. Namely, all parameters are additively decomposed into two groups, i.e. , parameters w are decomposed as w = σ + γ. Afterward, the parameters σ are considered to memorize clean data, while the parameters γ are considered to memorize mislabeled data. Benefiting from the memorization effect, the updates of the parameters σ are encouraged to fully memorize clean data in early training, and then discouraged with the increase of training epochs to reduce interference of mislabeled data. The updates of the parameters γ are the opposite. In testing, only the parameters σ are employed to enhance generalization. Extensive experiments on both simulated and real-world benchmarks confirm the superior performance of our method. The implementation is available at: https://***/wangjingyi9924/TNLPAD. Copyright © 2024, The Authors. All rights reserved.

关键词： Benchmarking

Model-Based and Data-Driven Control of Event- and Self-Triggered Discrete-Time LTI systems

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Wang, Xin Berberich, Julian Sun, Jian Wang, Gang Allgöwer, Frank Chen, Jie The Key Laboratory of Intelligent Control and Decision of Complex System Beijing Institute of Technology Beijing10081 China The Beijing Institute of Technology Chongqing Innovation Center Chongqing401120 China The University of Stuttgart Institute for Systems Theory and Automatic Control Stuttgart70550 Germany The Department of Control Science and Engineering Tongji University Shanghai201804 China The State Key Lab of Intelligent Control and Decision of Complex Systems School of Automation Beijing Institute of Technology Beijing100081 China

The present paper considers the model-based and data-driven control of unknown linear time-invariant discretetime systems under event-triggering and self-triggering transmission schemes. To this end, we begin by presenting a dynamic event-triggering scheme (ETS) based on periodic sampling, and a discrete-time looped-functional approach, through which a model-based stability condition is derived. Combining the model-based condition with a recent data-based system representation, a data-driven stability criterion in the form of linear matrix inequalities (LMIs) is established, which also offers a way of co-designing the ETS matrix and the controller. To further alleviate the sampling burden of ETS due to its continuous/periodic detection, a self-triggering scheme (STS) is developed. Leveraging pre-collected input-state data, an algorithm for predicting the next transmission instant is given, while achieving system stability. Finally, numerical simulations showcase the efficacy of ETS and STS in reducing data transmissions as well as of the proposed co-design methods. Copyright © 2022, The Authors. All rights reserved.

关键词： Linear matrix inequalities

Gearbox Fault Diagnosis for Wind Turbines based on Data Augmentation using Improved Generative Adversarial Networks 3

学校读者我要写书评

暂无评论

Gearbox Fault Diagnosis for Wind Turbines based on Data Augm...

3rd International Conference on Electrical Materials and Power Equipment, ICEMPE 2021

作者： Shen, Chen Wang, Jingang Chen, Junsheng Zhang, Bin Chongqing University State Key Laboratory of Power Transmission Equipment System Security and New Technology Chongqing China College of Automation Chongqing University of Posts and Telecommunications Chongqing China China Southern Power Grid Energy Efficiency Clean Synthesis Energy CO. LTD. Engineering and Technology Department Guangdong China

ISBN: (纸本)9781665418409

Under realistic working conditions, the fault data of the gearbox of the wind turbines are difficult to balance with the healthy data. The imbalance of the data will affect the training results of the fault diagnosis model. To deal with such an imbalance, a fault diagnosis method with data augmentation is proposed for gearbox of the wind turbines. The method takes the spectrograms of the vibration signals as the input. Then we develop a framework of generative adversarial networks as the data augmentation model. Among the framework, the weight matrices of networks are all improved through spectrally normalization. Then the data augmentation model can be training more stably to generate samples with a high quality and diversity. Finally, taking the enhanced spectrograms as the training set, the fault diagnosis model is obtained based on the convolutional neural networks. The proposed method is verified to diagnose four working states. The results denote that the proposed method is effective in imbalanced data set. © 2021 IEEE.

关键词： Wind turbines