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

arXiv 2024年

作者： Zhu, Zhiyu Chen, Huaming Wang, Xinyi Zhang, Jiayu Jin, Zhibo Choo, Kim-Kwang Raymond Shen, Jun Yuan, Dong The School of Electrical and Computer Engineering The University of Sydney Australia The University of Malaya Malaysia Suzhou Yierqi China The Department of Information Systems and Cyber Security The University of Texas at San Antonio United States University of Wollongong Australia

Adversarial generative models, such as Generative Adversarial Networks (GANs), are widely applied for generating various types of data, i.e., images, text, and audio. Accordingly, its promising performance has led to the GAN-based adversarial attack methods in the white-box and black-box attack scenarios. The importance of transferable black-box attacks lies in their ability to be effective across different models and settings, more closely aligning with real-world applications. However, it remains challenging to retain the performance in terms of transferable adversarial examples for such methods. Meanwhile, we observe that some enhanced gradient-based transferable adversarial attack algorithms require prolonged time for adversarial sample generation. Thus, in this work, we propose a novel algorithm named GE-AdvGAN to enhance the transferability of adversarial samples whilst improving the algorithm’s efficiency. The main approach is via optimising the training process of the generator parameters. With the functional and characteristic similarity analysis, we introduce a novel gradient editing (GE) mechanism and verify its feasibility in generating transferable samples on various models. Moreover, by exploring the frequency domain information to determine the gradient editing direction, GE-AdvGAN can generate highly transferable adversarial samples while minimizing the execution time in comparison to the state-of-the-art transferable adversarial attack algorithms. The performance of GE-AdvGAN is comprehensively evaluated by large-scale experiments on different datasets, which results demonstrate the superiority of our algorithm. The code for our algorithm is available at: https://***/LMBTough/GE-advGAN. Copyright © 2024, The Authors. All rights reserved.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Improving Deep Learning MRI Reconstruction with Contrastive Learning Pretraining

Improving Deep Learning MRI Reconstruction with Contrastive ...

引用

IEEE International Symposium on Biomedical Imaging

作者： Mevan Ekanayake Zhifeng Chen Mehrtash Harandi Gary Egan Zhaolin Chen Monash Biomedical Imaging Monash University Australia Department of Electrical and Computer Systems Engineering Monash University Australia Department of Data Science and AI Monash University Australia School of Psychological Sciences Monash University Australia

ISBN: (数字)9798350313338

ISBN: (纸本)9798350313345

Image reconstruction in Magnetic Resonance Imaging (MRI) aims to generate a high-quality image of the underlying anatomy from a minimal amount of measurements acquired during the scanning process. Deep learning (DL) has recently become the state-of-the-art approach for MRI reconstruction, often employing deep neural networks that learn to transform undersampled measurements into high-quality images, typically in a data-driven supervised manner. In our work, we propose a self-supervised contrastive learning pretraining framework for MRI that enhances the latent space for downstream reconstruction. Our framework is based on the fundamental principle of mutual information maximization, and we attempt to maximize the mutual information between different views of the same scan in latent space using contrastive learning. The learned latent space representations are subsequently utilized for reconstruction, and our experiments on various DL reconstruction models demonstrate significant improvements in performance both qualitatively and quantitatively.

关键词： Deep learning Magnetic resonance imaging Biological system modeling Contrastive learning Transforms Artificial neural networks Biomedical measurement

来源：评论

学校读者我要写书评

暂无评论

A Region Enhanced Discrete Multi-Objective Fireworks Algorithm for Low-Carbon Vehicle Routing Problem

引用

Complex System Modeling and Simulation 2022年第2期2卷 142-155页

作者： Xiaoning Shen Jiaqi Lu Xuan You Liyan Song Zhongpei Ge Collaborative Innovation Center of Atmospheric Environment and Equipment Technology Jiangsu Key Laboratory of Big Data Analysis TechnologySchool of AutomationNanjing University of Information Science and TechnologyNanjing 210044China School of Automation Nanjing University of Information Science and TechnologyNanjing 210044China Institute of Trustworthy Autonomous Systems and also with the Guangdong Provincial Key Laboratory of Brain-Inspired Intelligent ComputationDepartment of Computer Science and EngineeringSouthern University of Science and TechnologyShenzhen 518055China

A constrained multi-objective optimization model for the low-carbon vehicle routing problem(VRP)is established.A carbon emission measurement method considering various practical factors is *** minimizes both the total carbon emissions and the longest time consumed by the sub-tours,subject to the limited number of available *** to the characteristics of the model,a region enhanced discrete multi-objective fireworks algorithm is proposed.A partial mapping explosion operator,a hybrid mutation for adjusting the sub-tours,and an objective-driven extending search are designed,which aim to improve the convergence,diversity,and spread of the non-dominated solutions produced by the algorithm,*** low-carbon VRP instances with different scales are used to verify the effectiveness of the new ***,comparison results with four state-of-the-art algorithms indicate that the proposed algorithm has better performance of convergence and distribution on the low-carbon *** provides a promising scalability to the problem size.

关键词： vehicle routing problem carbon emission multi-objective optimization fireworks algorithm region enhanced

来源：评论

学校读者我要写书评

暂无评论

Assessing the Robustness of nnU-Net in the Detection of Prostate Lesions via Bi-Parametric MRI

Assessing the Robustness of nnU-Net in the Detection of Pros...

引用

Data Science and engineering in Healthcare, Medicine and Biology, IEEE EMBS Special Topic Conference on

作者： Dimitrios I. Zaridis Eugenia Mylona Nikolaos Tachos Charalampos Kalantzopoulos Vasileios C. Pezoulas Dimitrios D. Koutsouris George K. Matsopoulos Kostas Marias Manolis Tsiknakis Dimitrios I. Fotiadis Biomedical Engineering Laboratory School of Electrical and Computer Engineering National Technical University of Athens GR15773 Athens Greece Biomedical Research Institute FORTH Ioannina Greece University of Ioannina Ioannina Greece Institute of Computer Science FORTH Heraklion Greece Department of Electrical and Computer Engineering Hellenic Mediterranean University Heraklion Crete Greece FORTH-IMBB Ioannina Greece Materials Science and Engineering Department Unit of Medical Technology and Intelligent Information Systems University of Ioannina Ioannina GR 45110 Greece

Within the scope of prostate cancer diagnostic imaging, distinguishing lesions is challenging due to their subtle appearance and the prostate gland’s complexity. This study employed the nnU-Net, a state-of-the-art medical image segmentation model, on a dataset of 301 patients from 2 openly available datasets to identify whether lesion sizes are affecting the model’s performance. By applying t-SNE dimensionality reduction algorithm among dice score and respective lesion sizes, we found that nnU-Net behaves differently for lesions smaller than 9mm compared to lesions larger than 15mm. These insights can inform specialized training approaches for future deep learning models in prostate lesion *** Relevance: The main contributions of this study is, to investigate whether lesion sizes affects nnU-Net’s deficiency leading to the development of more specialized models in respect to these factors.

关键词：

来源：评论

学校读者我要写书评

暂无评论

CONSTRUCTION PROGRESS MONITORING IN SMART CITIES USING DEEP ALEXNET

CONSTRUCTION PROGRESS MONITORING IN SMART CITIES USING DEEP ...

引用

2023 IEEE International Conference on Research Methodologies in Knowledge Management, Artificial Intelligence and Telecommunication engineering, RMKMATE 2023

作者： Rajavel, A. Karkuzhali, S. Sharma, Sarvdaman Singh, Sitesh Kumar Senthilkumar, P. Ida, S. Jhansi Electronics and Instrumentation Engineering Kamaraj College of Engineering and Technology Virudhnagar India Department of Electrical and Electronics Engineering R.M.D. Engineering College Chennai India Department of Civil Engineering University Institute of Engineering and Technology University of Jammu Jammu & Kashmir India Department of Civil Engineering Wollega University Nekemte Oromia Ethiopia KL School of Architecture Koneru Lakshmaiah Education Foundation Vaddeswaram Greenfield AP Guntur India Department of Computer Science and Business Systems R.M.K Engineering College India

ISBN: (纸本)9798350305708

Construction progress monitoring plays a crucial role in ensuring the timely and efficient completion of infrastructure projects within smart cities. This paper proposes a novel approach utilizing the Deep AlexNet architecture for construction progress assessment in smart cities. The Deep AlexNet model is trained on a diverse dataset of images captured from construction sites, enabling it to accurately analyze the visual cues indicative of construction advancement. By leveraging deep learning techniques, our system extracts and processes features from images, enabling automated and real-time progress evaluation. The proposed method contributes to enhancing construction management practices by providing stakeholders with a reliable tool to monitor and manage construction projects efficiently. Experimental results demonstrate the effectiveness and robustness of the Deep AlexNet-based approach in accurately assessing construction progress, thereby facilitating informed decision-making throughout the construction lifecycle. © 2023 IEEE.

关键词： Construction progress monitoring Deep AlexNet Deep learning Infrastructure projects Smart cities

来源：评论

学校读者我要写书评

暂无评论

Unorthodox parallelization for Bayesian quantum state estimation

arXiv

引用

arXiv 2025年

作者： Nguyen, Hanson H. Law, Kody J.H. Lukens, Joseph M. School of Electrical Computer and Energy Engineering Research Technology Office Arizona State University TempeAZ85287 United States School of Mathematics University of Manchester ManchesterM13 9PL United Kingdom Elmore Family School of Electrical and Computer Engineering Purdue Quantum Science and Engineering Institute Purdue University West LafayetteIN47907 United States Quantum Information Science Section Oak Ridge National Laboratory Oak RidgeTN37831 United States

Quantum state tomography (QST) allows for the reconstruction of quantum states through measurements and some inference technique under the assumption of repeated state preparations. Bayesian inference provides a promising platform to achieve both efficient QST and accurate uncertainty quantification, yet is generally plagued by the computational limitations associated with long Markov chains. In this work, we present a novel Bayesian QST approach that leverages modern distributed parallel computer architectures to efficiently sample a D-dimensional Hilbert space. Using a parallelized preconditioned Crank–Nicholson Metropolis-Hastings algorithm, we demonstrate our approach on simulated data and experimental results from IBM Quantum systems up to four qubits, showing significant speedups through parallelization. Although highly unorthodox in pooling independent Markov chains, our method proves remarkably practical, with validation ex post facto via diagnostics like the intrachain autocorrelation time. We conclude by discussing scalability to higher-dimensional systems, offering a path toward efficient and accurate Bayesian characterization of large quantum systems. Copyright © 2025, The Authors. All rights reserved.

关键词： Markov chains

来源：评论

学校读者我要写书评

暂无评论

Exact Algorithm for Batch Scheduling with Many-to-Many Job-Tool Matching and Job Release Time Constraints

引用

IEEE Transactions on Automation Science and engineering 2025年 22卷 16499-16511页

作者： Li, Shengchao Liu, Shixin Zhao, Ziyan Zhou, Mengchu Northeastern University State Key Laboratory of Synthetical Automation for Process Industries College of Information Science and Engineering Shenyang 110819 China Northeastern University at Qinhuangdao Hebei Key Laboratory of Industrial Software for Advanced Planning and Scheduling of Complex Industrial Processes School of Control Engineering Qinhuangdao 066004 China New Jersey Institute of Technology Department of Electrical and Computer Engineering Newark 07102 NJ United States

Job-dependent tool switching is necessary in many batch processing systems (BPSs). Heterogeneous tool demand and extra time consumption for tool switch bring great challenge for high-performance production scheduling in BPSs. In this study, we present a novel batch scheduling problem derived from a satellite vibration test system. Different from basic scheduling problems in BPSs with tool switching, it has complications caused by many-to-many task-tool matching and job release time constraints. Specifically, each job has predetermined candidate tools. One of them should be selected and equipped to process a given job. Unlike sequence-dependent setup time that is only related to two adjacent jobs, tool switching time is additionally dependent on the tools selected by both jobs from their respective candidate tools. Both job sequence and tool selections need to be determined to minimize makespan. Mixed-integer linear programming (MILP) and constraint programming (CP) models are developed for formulating the problem. We prove that the problem is NP hard. To obtain exact solutions, we propose a novel branch-and-bound algorithm (B&B) based on the analysis and extraction of problem properties. It integrates a domain reduction mechanism, branching strategies, and dominance rules. Among them, the domain reduction mechanism reduces the number of jobs to be scheduled;the branching strategies accelerate solving speed;and the dominance rules save the memory consumption. Ablation studies and key influencing factor experiments are performed. The results show that the proposed B&B can optimally solve much larger instances than state-of-the-art methods (including some heuristics). It can optimally solve industrial-size problems in a short time, implying that it can well satisfy the performance demand of a satellite vibration test system and thus advancing the filed of optimal scheduling for BPSs. © 2004-2012 IEEE.

关键词： Batch scheduling branch-and-bound algorithm heterogenerous tool demand mixed-integer linear programming satellite vibration test system

来源：评论

学校读者我要写书评

暂无评论

Speed Master: Quick or Slow Play to Attack Speaker Recognition 39

Speed Master: Quick or Slow Play to Attack Speaker Recogniti...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Ye, Zhe Zhang, Wenjie Ren, Ying Kang, Xiangui Yan, Diqun Ma, Bin Wang, Shiqi Guangdong Key Lab of Information Security School of Computer Science and Engineering Sun Yat-sen University Guangzhou China Faculty of Electrical Engineering and Computer Science Ningbo University Ningbo China Key Laboratory of Computing Power Network and Information Security Ministry of Education Qilu University of Technology Shandong Academy of Sciences Jinan China Department of Computer Science City University of Hong Kong Hong Kong

ISBN: (纸本)157735897X

Backdoor attacks pose a significant threat during the model’s training phase. Attackers craft pre-defined triggers to break deep neural networks, ensuring the model accurately classifies clean samples during inference yet erroneously classifies samples added with these triggers. Recent studies have shown that speaker recognition systems trained on large-scale data are susceptible to backdoor attacks. Existing attackers employ unnoticed ambient sounds as triggers. However, these sounds are not inherently part of the training samples themselves. In essence, triggers can be designed to maintain an intrinsic connection with the original speech to enhance stealthiness. Our paper presents a novel attack methodology named Speed Master, which undermines deep neural networks by manipulating the speed of speech samples. Specifically, we execute poison-only backdoor attacks using speed or tempo adjustment. Changes in speech rate have become a common occurrence, as seen on platforms that allow users to adjust playback speed. In real-world scenarios, people naturally adjust their speaking rate depending on the context. As a result, changes in a speaker’s speech rate are typically perceived as normal and are unlikely to raise suspicion. Furthermore, detecting such subtle adjustments becomes challenging for users without reference speech. Our comprehensive experiments demonstrate that Speed Master can achieve an ASR over 99% in the digital domain, with only a 0.6% poisoning rate. Additionally, we validate the feasibility of Speed Master in the real world and its resistance to typical defensive measures. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

A Multi-Player Potential Game Approach for Sensor Network Localization with Noisy Measurements

A Multi-Player Potential Game Approach for Sensor Network Lo...

引用

IEEE Conference on Decision and Control

作者： Gehui Xu Guanpu Chen Baris Fidan Yiguang Hong Hongsheng Qi Thomas Parisini Karl H. Johansson Department of Electrical and Electronic Engineering Imperial College London London UK Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden Department of Mechanical and Mechatronics Engineering University of Waterloo Waterloo ON Canada Department of Control Science and Engineering Tongji University shanghai China Shanghai Research Institute for Intelligent Autonomous Systems Shanghai China Key Laboratory of Systems and Control Academy of Mathematics and Systems Science Beijing China School of Mathematical Sciences University of Chinese Academy of Sciences Beijing China Department of Electronic Systems Aalborg University Denmark Department of Engineering and Architecture University of Trieste Italy

ISBN: (数字)9798350316339

ISBN: (纸本)9798350316346

Sensor network localization (SNL) is a challenging problem due to its inherent non-convexity and the effects of noise in inter-node ranging measurements and anchor node position. We formulate a non-convex SNL problem as a multiplayer non-convex potential game and investigate the existence and uniqueness of a Nash equilibrium (NE) in both the ideal setting without measurement noise and the practical setting with measurement noise. We first show that the NE exists and is unique in the noiseless case, and corresponds to the precise network localization. Then, we study the SNL for the case with errors affecting the anchor node position and the inter-node distance measurements. Specifically, we establish that in case these errors are sufficiently small, the NE exists and is unique. It is shown that the NE is an approximate solution to the SNL problem, and that the position errors can be quantified accordingly. Based on these findings, we apply the results to case studies involving only inter-node distance measurement errors and only anchor position information inaccuracies.

关键词： Location awareness Noise Games Position measurement Nash equilibrium Distance measurement Noise measurement

来源：评论

学校读者我要写书评

暂无评论

Dynamical control in hybrid magnonics 16

Dynamical control in hybrid magnonics

引用

Spintronics XVI 2023

作者： Xu, Jing Zhong, Changchun Han, Xu Jin, Dafei Jiang, Liang Zhang, Xufeng Argonne National Laboratory 9700 S. Cass Ave LemontIL60439 United States Pritzker School of Molecular Engineering University of Chicago ChicagoIL60637 United States Department of Physics and Astronomy University of Notre Dame Notre DameIN46556 United States Department of Electrical and Computer Engineering Northeastern University BostonMA02115 United States

ISBN: (纸本)9781510665262

In-situ control of system dynamics is critical for coherent information processing, but it has been challenging for the emerging field of hybrid magnonics, thus limiting its potential applications. This work will show novel approaches to introduce dynamical control in conventional hybrid magnonic devices. Using fast temporal modulation in system parameters such as the bias field, real-time tuning of the coherent magnon-microwave photon coupling can be obtained at time scales that are much shorter than the magnon and photon lifetimes. This allows real-time control of the coherent information exchange between magnons and microwave photons. © 2023 SPIE.

关键词： Real time control

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：