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

A Sparsity Knowledge Transfer-Based Evolutionary Algorithm for Large-Scale Multitasking Multi-Objective Optimization

引用

IEEE Transactions on Evolutionary Computation 2024年

作者： Wu, Chengming Tian, Ye Zhang, Limiao Xiang, Xiaoshu Zhang, Xingyi Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Artificial Intelligence Hefei230601 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Hefei230039 China Anhui University Information Materials and Intelligent Sensing Laboratory of Anhui Province Anhui Hefei230601 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Institutes of Physical Science and Information Technology Hefei230601 China

Multitasking multi-objective evolutionary algorithms (MMEAs) have been extensively studied in the past decade, which mainly concentrate on multitasking multi-objective optimization problems (MMOPs) with dozens of decision variables. Nevertheless, many real-world MMOPs have thousands of decision variables and are of sparse nature, which are regarded as large-scale MMOPs (LSMMOPs) in this study. To address LSMMOPs, a sparsity knowledge transfer-based evolutionary multi-objective algorithm, termed EMO-SKT, is proposed for efficiently finding high-quality sparse solutions of LSMMOPs. For each target optimization task, a sparsity knowledge transfer strategy extracts sparse distribution information from a source task and incorporates the information into the target task for two types of sparsity knowledge: variable importance and sparse degree. The variable importance is utilized to produce high-quality sparse solutions during the evolutionary search for EMO-SKT, while the sparse degree facilitates the reduction of search space and thus speeds up the convergence of the evolutionary search. Experimental results on eight benchmark problems and six practical LSMMOPs demonstrate the effectiveness of the sparsity knowledge transfer strategy. Furthermore, the proposed EMO-SKT is capable of efficiently finding high-quality sparse solutions on an LSMMOP with over 1000 decision variables. In comparison with five state-of-the-art multitasking or sparse optimization algorithms, the proposed EMO-SKT exhibits superior performance in terms of both solution quality and search efficiency. © 1997-2012 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

DragEntity:Trajectory Guided Video Generation using Entity and Positional Relationships 24

DragEntity:Trajectory Guided Video Generation using Entity a...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Wan, Zhang Tang, Sheng Wei, Jiawei Zhang, Ruize Cao, Juan Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China Zhengzhou University Zhengzhou China Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9798400706868

In recent years, diffusion models have achieved tremendous success in the field of video generation, with controllable video generation receiving significant attention. However, existing control methods still face two limitations: Firstly, control conditions (such as depth maps, 3D Mesh) are difficult for ordinary users to obtain directly. Secondly, it's challenging to drive multiple objects through complex motions with multiple trajectories simultaneously. In this paper, we introduce DragEntity, a video generation model that utilizes entity representation for controlling the motion of multiple objects. Compared to previous methods, DragEntity offers two main advantages: 1) Our method is more user-friendly for interaction because it allows users to drag entities within the image rather than individual pixels. 2) We use entity representation to represent any object in the image, and multiple objects can maintain relative spatial relationships. Therefore, we allow multiple trajectories to control multiple objects in the image with different levels of complexity simultaneously. Our experiments validate the effectiveness of DragEntity, demonstrating its excellent performance in fine-grained control in video generation. © 2024 ACM.

关键词： controllable video generation

来源：评论

学校读者我要写书评

暂无评论

Evidential Open Set Recognition for Imbalanced Medical Images via Multi-level Data Augmentation

Evidential Open Set Recognition for Imbalanced Medical Image...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Zhao, Rui-Wei Xu, Yiqian Zhang, Ying Feng, Rui Shanghai Maritime University College of Information Engineering China Fudan University Academy for Engineering and Technology China Fudan University School of Computer Science Shanghai Key Laboratory of Intelligent Information Processing China

ISBN: (纸本)9798350386226

Due to the exstence of common and rare diseases, the complex clinical scenario often poses the challenging class imbalanced open set recognition problem. Unfortunately, most existing approaches are ill-suited for such situations with limited and imbalanced data during training and the possibility of encountering unseen classes during test. In this work, we propose a novel Multi-level mixup-based Evidential Open Set Recognition (ME-OSR) approach to more explicitly and effectively address the open set recognition for class-imbalanced medical images. Briefly, we first extract disentangled discriminative and background image features. Then, based on the original images and extracted features, we propose to sample and conduct Multi-level Open Mixup (MOM) for a more balanced open set data augmentation. It includes extensive intra- and interclass mixup operations in both image and feature spaces, which can augment rare classes with different feature combinations and generate potential pseudo-unknown class examples in the open set to boost the model training. Based on the augmented data and their extracted discriminative features, we propose a Regularized Evidential Deep Learning (REDL) classifier to work with the augmented data to achieve open set recognition with prediction uncertainty estimation and unknown example rejection. Through comparative experiments and ablation studies on several representative medical datasets, we showed that our proposed method outperforms other state-of-the-arts on four popular medical OSR datasets. © 2024 IEEE.

关键词： Medical imaging

来源：评论

学校读者我要写书评

暂无评论

Deep Dual Attention Network for Precise Diagnosis of COVID-19 From Chest CT Images

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第1期5卷 104-114页

作者： Lin, Zhijie He, Zhaoshui Yao, Ruoyu Wang, Xu Liu, Taiheng Deng, Yamei Xie, Shengli Guangdong University of Technology School of Automation Guangzhou510006 China Key Laboratory for IoT Intelligent Information Processing and System Integration of Ministry of Education Guangzhou510006 China Guangdong Key Laboratory of IoT Information Technology Guangzhou510006 China Third Affiliated Hospital of Guangzhou Medical University Department of Radiology Guangzhou510150 China Guangdong-HongKong-Macao Joint Laboratory for Smart Discrete Manufacturing Guangzhou510006 China

Automatic diagnosis of Coronavirus disease 2019 (COVID-19) using chest computed tomography (CT) images is of great significance for preventing its spread. However, it is difficult to precisely identify COVID-19 due to the following problems: 1) the location and size of lesions can vary greatly in CT images;2) its unique characteristics are often imperceptible in imaging findings. To solve these problems, a Deep Dual Attention Network ($\text {D}^{\text {2}}\text {ANet}$) is proposed for accurate diagnosis of COVID-19 by integrating dual attention modules (DAMs) with different scales of the feature extractor, where DAM can adaptively detect relevant lesion regions to extract discriminative imaging features of COVID-19. Specifically, DAM is implemented by two parallel blocks: 1) global attention block (GAB) and 2) local attention block (LAB), in which GAB is designed to roughly locate the infected regions from the entire image by modeling global contexts while LAB is developed to explicitly highlight subtle differences of COVID-19 from other viral pneumonia in the infected regions by learning detailed lesion information. Experimental results on several public datasets show that $\text {D}^{\text {2}}\text {ANet}$ outperforms the state-of-the-art approaches in various performance metrics. © 2020 IEEE.

关键词： COVID-19

来源：评论

学校读者我要写书评

暂无评论

Hybrid Metric-Induced Nonnegative Matrix Factorization

Hybrid Metric-Induced Nonnegative Matrix Factorization

引用

2023 China Automation Congress, CAC 2023

作者： Yang, Sijun Chen, Wen-Sheng Pan, Binbin College of Mathematics and Statistics Shenzhen University Shenzhen518060 China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen518060 China

ISBN: (纸本)9798350303759

NMF is a promising feature representation method for data analysis. Matrix decomposition losses can be described using different metrics, based on which different NMF algorithms can be developed. However, a small Euclidean distance metric is not guaranteed to have a small cosine similarity metric, and vice versa. To overcome the shortcomings of these metrics, we integrate these two metrics to present a novel hybrid metric-induced NMF (HMNMF) model. The update rules for the HMNMF algorithm are obtained using the gradient descent method to resolve the optimization problem. The proposed algorithm is proven to be convergent, which implies that it is reasonable and stable. The proposed HMNMF approach is compared with different metric-induced NMF algorithms for face recognition, the experimental results confirm the effectiveness and good performance of the proposed algorithm. © 2023 IEEE.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

Attacks Against Cross-Chain Systems and Defense Approaches:A Contemporary Survey

引用

IEEE/CAA Journal of Automatica Sinica 2023年第8期10卷 1647-1667页

作者： Li Duan Yangyang Sun Wei Ni Weiping Ding Jiqiang Liu Wei Wang IEEE the Beijing Key Laboratory of Security and Privacy in Intelligent Transportation Beijing Jiaotong UniversityBeijing 100044China the Guangxi Key Laboratory of Cryptography and Information Security Guilin 541004China the Communications and Signal Processing Team Data61 Business UnitCommonwealth Scientific and Industrial Research Organisation(CSIRO)Sydney NSW 2109Australia the School of Information Science and Technology Nantong UniversityNantong 226019China

The blockchain cross-chain is a significant technology for inter-chain interconnection and value transfer among different blockchain ***-chain overcomes the“information island”problem of the closed blockchain network and is increasingly applied to multiple critical areas such as finance and the internet of things(IoT).Blockchain can be divided into three main categories of blockchain networks:public blockchains,private blockchains,and consortium ***,there are differences in block structures,consensus mechanisms,and complex working mechanisms among heterogeneous *** fragility of the cross-chain system itself makes the cross-chain system face some potential security and privacy *** paper discusses security defects on the cross-chain implementation mechanism,and discusses the impact of the structural features of blockchain networks on cross-chain *** terms of cross-chain intercommunication,a cross-chain attack can be divided into a multi-chain combination attack,native chain attack,and inter-chain attack *** various security threats and attack paths faced by the cross-chain system are *** last,the corresponding security defense methods of cross-chain security threats and future research directions for cross-chain applications are put forward.

关键词： Blockchain cross-chain defense distributed private key control hash-locking notary security threats sidechain/relay

来源：评论

学校读者我要写书评

暂无评论

IMPULSE NOISE REMOVAL BY L1 WEIGHTED NUCLEAR NORM MINIMIZATION

引用

Journal of Computational Mathematics 2023年第6期41卷 1171-1191页

作者： Jian Lu Yuting Ye Yiqiu Dong Xiaoxia Liu Yuru Zou Shenzhen Key Laboratory of Advanced Machine Learning and Applications College of Mathematics and StatisticsShenzhen UniversityShenzhen 518060China Guangdong Key Laboratory of Intelligent Information Processing Pazhou LabGuangzhou 510335China Department of Applied Mathematics and Computer Science Technical University of Denmark2800 Kgs.LyngbyDenmark

In recent years,the nuclear norm minimization(NNM)as a convex relaxation of the rank minimization has attracted great research *** assigning different weights to singular values,the weighted nuclear norm minimization(WNNM)has been utilized in many ***,most of the work on WNNM is combined with the l 2-data-fidelity term,which is under additive Gaussian noise *** this paper,we introduce the L1-WNNM model,which incorporates the l 1-data-fidelity term and the regularization from *** apply the alternating direction method of multipliers(ADMM)to solve the non-convex minimization problem in this *** exploit the low rank prior on the patch matrices extracted based on the image non-local self-similarity and apply the L1-WNNM model on patch matrices to restore the image corrupted by impulse *** results show that our method can effectively remove impulse noise.

关键词： Image denoising Weighted nuclear norm minimization l 1-data-fidelity term Low rank analysis Impulse noise

来源：评论

学校读者我要写书评

暂无评论

Resource Binding and Module Placement Algorithms for Continuous-Flow Microfluidic Biochip in intelligent Digital Healthcare 18th

Resource Binding and Module Placement Algorithms for Conti...

引用

18th International Conference on Green, Pervasive, and Cloud computing, GPC 2023

作者： Yang, Zhongliao Huang, Huichang Liu, Zeyi Dong, Chen Xu, Li College of Computer and Data Science Fuzhou University Fuzhou350116 China College of Computer and Cyber Security Fujian Normal University Fuzhou350007 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China

ISBN: (纸本)9789819998951

Continuous-Flow Microfluidic Biochip (CFMB), with their integrated features, bring traditional biochemical experiments on a single chip to accomplish complex operations and reactions through precise control, efficient reactions and emerging ways of saving reagents. In the field of intelligent digital healthcare, CFMB have attracted a lot of attention. However, traditional manual design schemes can no longer meet the needs of increasingly complex chip architecture design. Therefore, this paper proposes an automated design method for resource binding and module placement of CFMB based on a list scheduling algorithm and an improved Simulated Annealing algorithm. Through the resource binding and scheduling design based on the list scheduling algorithm, an effective scheduling strategy is generated, which effectively improves the biochip execution efficiency. In addition, the improved Simulated Annealing algorithm solves the module placement problem in the biochip in a limited physical space. Compared with some benchmark algorithms, the experimental results demonstrate the effectiveness of the method in the biochip design process and provide a practical framework for further development of CFMB in the field of intelligent digital healthcare. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd 2024.

关键词： Biochips

来源：评论

学校读者我要写书评

暂无评论

Genetic-A* Algorithm-Based Routing for Continuous-Flow Microfluidic Biochip in intelligent Digital Healthcare 18th

Genetic-A* Algorithm-Based Routing for Continuous-Flow Micr...

引用

18th International Conference on Green, Pervasive, and Cloud computing, GPC 2023

作者： Huang, Huichang Yang, Zhongliao Zhong, Jiayuan Xu, Li Dong, Chen Bao, Ruishen College of Computer and Data Science Fuzhou University Fuzhou350116 China College of Computer and Cyber Security Fujian Normal University Fuzhou350007 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China

ISBN: (纸本)9789819998951

In the field of intelligent digital healthcare, Continuous-flow microfluidic biochip (CFMB) has become a research direction of widespread concern. CFMB integrates a large number of microvalves and large-scale microchannel networks into a single chip, enabling efficient execution of various biochemical protocols. However, as the scale of the chip increases, the routing task for CFMB becomes increasingly complex, and traditional manual routing is no longer sufficient to meet the requirements. Therefore, this paper proposes an automatic routing framework for CFMB based on Genetic algorithm (GA) and A* algorithms. Specifically, we adopt a two-stage A* algorithm to design the routing between modules, using the routing results obtained from the A* algorithm as the basis for evaluating the quality of solutions in the GA algorithm. Then, the GA algorithm is used to search for the optimal approximate solution in the solution space. Experimental results show that this method can reduce routing length and minimize routing crossings, thereby improving the parallel transmission speed of reagents on CFMB. This approach provides a feasible solution for large-scale automated routing of CFMB in the field of intelligent digital healthcare. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd 2024.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Algorithm for Solving Traveling Salesman Problem Based on Self-Organizing Mapping Network

引用

Journal of Shanghai Jiaotong university(Science) 2024年第3期29卷 463-470页

作者：朱江辉叶航航姚莉秀蔡云泽 Department of Automation Shanghai Jiao Tong UniversityShanghai 200240China Key Laboratory of System Control and Information Processing Ministry of EducationShanghai 200240China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai 200240China Key Laboratory of Marine Intelligent Equipment and System Ministry of EducationShanghai 200240China Huawei Technologies Co. Ltd.Shanghai 201206China

Traveling salesman problem(TSP)is a classic non-deterministic polynomial-hard optimization *** on the characteristics of self-organizing mapping(SOM)network,this paper proposes an improved SOM network from the perspectives of network update strategy,initialization method,and parameter *** paper compares the performance of the proposed algorithms with the performance of existing SOM network algorithms on the TSP and compares them with several heuristic *** show that compared with existing SOM networks,the improved SOM network proposed in this paper improves the convergence rate and algorithm *** with iterated local search and heuristic algorithms,the improved SOM net-work algorithms proposed in this paper have the advantage of fast calculation speed on medium-scale TSP.

关键词： traveling salesman problem(TSP) self-organizing mapping(SOM) combinatorial optimization neu-ral network

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：