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

Optimal Linear Crossover for Mitigating Negative Transfer in Evolutionary Multitasking

IEEE Transactions on Evolutionary Computation 2024年

作者： Liu, Zhaobo Yuan, Jianhua Zhang, Haili Zeng, Tao Zhu, Zexuan Shenzhen University Institute for Advanced Study Shenzhen518060 China Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China Shenzhen Polytechnic University School of Undergraduate Education Shenzhen518055 China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen518060 China Shenzhen University Shenzhen City Key Laboratory of Embedded System Design Shenzhen518060 China Chongqing University Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of Education of China Chongqing400044 China

Evolutionary multitasking algorithms use information exchange among individuals in a population to solve multiple optimization problems simultaneously. Negative transfer is a critical factor that affects the performance of evolutionary multitasking algorithms. In this study, we propose an innovative approach to mitigate negative transfer in evolutionary multitasking algorithms. The proposed approach is grounded in rigorous theoretical analysis, which provides valuable theoretical insights into the design of an optimal linear crossover operator for mitigating negative transfer. By identifying interpretable conditions, we establish a solid theoretical foundation to prevent negative transfer in diverse scenarios. Building upon these findings, we theoretically derive a closed-form expression for the optimal crossover operator and propose practical design methods based on approximations. Furthermore, we integrate the proposed optimal crossover operator into a fundamental evolutionary multitasking algorithm framework. The resultant algorithm is comparable or superior to other state-of-the-art methods. Empirical validation through comprehensive experiments confirms the effectiveness of our theoretical findings. © 1997-2012 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Synchronization of Multi-Weighted and Directed Network Under Pinning Impulsive Control

Synchronization of Multi-Weighted and Directed Network Under...

引用

2021 China Automation Congress, CAC 2021

作者： Hu, Xiaohan Liu, Xiwei Department of Computer Science and Technology Tongji University Shanghai201804 China Department of Computer Science and Technology Key Laboratory of Embedded System Service Computing Tongji University Shanghai201804 China

ISBN: (纸本)9781665426473

In this paper, multi-weighted and directed complex dynamic networks (MWDCDNs) under the control of hybrid impulses are analyzed. Two cases are considered. In the first case, impulses can be only applied on one fixed node. In the other case, impulses are applied on different nodes according to whether they are synchronized or de-synchronized in MWDCDNs with unbounded time delay. By limiting impulsive interval and Chebyshev distance between the normalized left eigenvectors (NLEVec) of multiple coupling matrices corresponding to the zero eigenvalue, we obtain some criteria for the synchronization of MWDCNs. Some numerical simulation are also given. © 2021 IEEE

关键词： Eigenvalues and eigenfunctions

来源：评论

学校读者我要写书评

暂无评论

When the Metaverse Meets Carbon Neutrality: Ongoing Efforts and Directions

arXiv

引用

arXiv 2023年

作者： Liu, Fangming Pei, Qiangyu Chen, Shutong Yuan, Yongjie Wang, Lin Mühlhäuser, Max Huazhong University of Science and Technology Peng Cheng Laboratory China The National Engineering Research Center for Big Data Technology and System The Services Computing Technology and System Lab Cluster and Grid Computing Lab The School of Computer Science and Technology Huazhong University of Science and Technology 1037 Luoyu Road Wuhan430074 China VU Amsterdam Netherlands TU Darmstadt Germany The Telecooperation Lab TU Darmstadt Germany

The metaverse has recently gained increasing attention from the public. It builds up a virtual world where we can live as a new role regardless of the role we play in the physical world. However, building and operating this virtual world will generate an extraordinary amount of carbon emissions for computing, communicating, displaying, and so on. This inevitably hinders the realization of carbon neutrality as a priority of our society, adding heavy burden to our earth. In this survey, we first present a green viewpoint of the metaverse by investigating the carbon issues in its three core layers, namely the infrastructure layer, the interaction layer, and the economy layer, and estimate their carbon footprints in the near future. Next, we analyze a range of current and emerging applicable green techniques for the purpose of reducing energy usage and carbon emissions of the metaverse, and discuss their limitations in supporting metaverse workloads. Then, in view of these limitations, we discuss important implications and bring forth several insights and future directions to make each metaverse layer greener. After that, we investigate green solutions from the governance perspective, including both public policies in the physical world and regulation of users in the virtual world, and propose an indicator Carbon Utility (CU) to quantify the service quality brought by an user activity per unit of carbon emissions. Finally, we identify an issue for the metaverse as a whole and summarize three directions: (1) a comprehensive consideration of necessary performance metrics, (2) a comprehensive consideration of involved layers and multiple internal components, and (3) a new assessing, recording, and regulating mechanism on carbon footprints of user activities. Our proposed quantitative indicator CU would be helpful in regulating user activities in the metaverse world. Copyright © 2023, The Authors. All rights reserved.

关键词： Carbon footprint

来源：评论

学校读者我要写书评

暂无评论

TDiffSal: Text-Guided Diffusion Saliency Prediction Model for Images 27th

TDiffSal: Text-Guided Diffusion Saliency Prediction Model fo...

引用

27th International Conference on Pattern Recognition, ICPR 2024

作者： Zhang, Nana Xiong, Min Zhu, Dandan Zhu, Kun Zhai, Guangtao School of Computer Science and Technology Donghua University No. 2999 Renmin North Road Songjiang District Shanghai201620 China State Key Laboratory for Novel Software Technology Nanjing University Nanjing210093 China Institute of AI Education Shanghai East China Normal University No. 3663 Zhongshan North Road Putuo District Shanghai200333 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University No. 4800 Cao’an Highway Jiading District Shanghai201804 China Institute of Image Communication and Network Engineering Shanghai Jiao Tong University No. 800 Dongchuan Road Minhang District Shanghai200240 China

ISBN: (纸本)9783031781858

Existing visual saliency prediction methods mainly focus on single-modal visual saliency prediction, while ignoring the significant impact of text on visual saliency. To more comprehensively explore the influence of text on human attention in images, we propose a text-guided diffusion saliency prediction model, named TDiffSal. In specific, recent studies on stable diffusion models have shown promising performance in unifying tasks due to their inherent generalization ability. Inspired by this, a novel diffusion model for generalized visual-text saliency prediction is proposed, which formulates the prediction issue as a conditional generative task of the saliency map by employing input visual and text as the conditions. Meanwhile, we introduce a multi-head fusion module to effectively integrate text features and image features, which can efficiently guide the image denoising process and progressively refine the generated saliency map to make it semantically relevant to the text. Additionally, we employ an efficient pre-training strategy to enhance the robustness and generalization of the proposed model. We conduct extensive experiments on benchmark datasets to demonstrate its superior performance compared to other state-of-the-art methods. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Prediction models

来源：评论

学校读者我要写书评

暂无评论

Unknown-Aware Bilateral Dependency Optimization for Defending Against Model Inversion Attacks

引用

IEEE Transactions on Pattern Analysis and Machine Intelligence 2025年 PP卷 PP页

作者： Peng, Xiong Liu, Feng Wang, Nannan Lan, Long Liu, Tongliang Cheung, Yiu-Ming Han, Bo Hong Kong Baptist University Department of Computer Science Hong Kong The University of Melbourne School of Computing and Information Systems Australia Xidian University State Key Laboratory of Integrated Services Networks School of Telecommunications Engineering Shaanxi Xi'an710071 China National University of Defense Technology State Key Laboratory of High Performance Computing School of Computer Hunan Changsha410000 China The University of Sydney Sydney AI Centre School of Computer Science Faculty of Engineering Australia

By abusing access to a well-trained classifier, model inversion (MI) attacks pose a significant threat as they can recover the original training data, leading to privacy leakage. Previous studies mitigated MI attacks by imposing regularization to reduce the dependency between input features and outputs during classifier training, a strategy known as unilateral dependency optimization. However, this strategy contradicts the objective of minimizing the supervised classification loss, which inherently seeks to maximize the dependency between input features and outputs. Consequently, there is a trade-off between improving the model's robustness against MI attacks and maintaining its classification performance. To address this issue, we propose the bilateral dependency optimization strategy (BiDO), a dual-objective approach that minimizes the dependency between input features and latent representations, while simultaneously maximizing the dependency between latent representations and labels. BiDO is remarkable for its privacy-preserving capabilities. However, models trained with BiDO exhibit diminished capabilities in out-of-distribution (OOD) detection compared to models trained with standard classification supervision. Given the open-world nature of deep learning systems, this limitation could lead to significant security risks, as encountering OOD inputs—whose label spaces do not overlap with the in-distribution (ID) data used during training-is inevitable. To address this, we leverage readily available auxiliary OOD data to enhance the OOD detection performance of models trained with BiDO. This leads to the introduction of an upgraded framework, unknown-aware BiDO (BiDO+), which mitigates both privacy and security concerns. As a highlight, with comparable model utility, BiDO-HSIC+ reduces the FPR95 by 55.02% and enhances the AUCROC by 9.52% compared to BiDO-HSIC, while also providing superior MI robustness. © 1979-2012 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

A One-Dimensional Residual Network and Physical Fitness-Based Exercise Prescription Recommendation Method

A One-Dimensional Residual Network and Physical Fitness-Base...

引用

IEEE International Conference on Cyber Security and Cloud computing (CSCloud)

作者： Runqing Fan Zhenlian Peng Buqing Cao Jianxun Liu Peng Che Tieping Chen School of Computer Science and Engineering Hunan Provincial Key Laboratory for Services Computing and Novel Software Technology Hunan University of Science and Technology Xiangtan China School of Physical Education Hunan University of Science and Technology Xiangtan China

In the context of the national big data strategy, physical fitness test data has become one of the main influencing factors in guiding and promoting the participation of the population in sports and fitness. Recommending exercise prescriptions based on national physical fitness test data has become an important research topic. However, currently, there is little research on how to accurately use computer data processing technology to recommend exercise prescriptions based on physical fitness test data. In this study, we propose a ResNet-based Exercise Prescription (ResNet-EP) method that utilizes one-dimensional residual neural network technology to recommend exercise prescriptions based on physical fitness testing data. This method comprehensively analyzes physical fitness testing data and exercise prescription data and realizes the automatic recommendation of exercise prescriptions. Experimental results on a real dataset demonstrate that the ResNet-EP model outperforms other comparison models in terms of precision (79.98%), recall (83.73%), and F1 score (81.81%). This study provides novel insights into the combination of physical fitness testing and exercise.

关键词：

来源：评论

学校读者我要写书评

暂无评论

MFCLIP: Multi-modal Fine-grained CLIP for Generalizable Diffusion Face Forgery Detection

arXiv

引用

arXiv 2024年

作者： Zhang, Yaning Wang, Tianyi Yu, Zitong Gao, Zan Shen, Linlin Chen, Shengyong Jinan250353 China Nanyang Technological University 50 Nanyang Ave Block N 4 639798 Singapore School of Computing and Information Technology Great Bay University Dongguan523000 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China Jinan250014 China The Key Laboratory of Computer Vision and System Ministry of Education Tianjin University of Technology Tianjin300384 China Computer Vision Institute College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen518129 China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen518060 China

The rapid development of photo-realistic face generation methods has raised significant concerns in society and academia, highlighting the urgent need for robust and generalizable face forgery detection (FFD) techniques. Although existing approaches mainly capture face forgery patterns using image modality, other modalities like fine-grained noises and texts are not fully explored, which limits the generalization capability of the model. In addition, most FFD methods tend to identify facial images generated by GAN, but struggle to detect unseen diffusion-synthesized ones. To address the limitations, we aim to leverage the cutting-edge foundation model, contrastive language-image pre-training (CLIP), to achieve generalizable diffusion face forgery detection (DFFD). In this paper, we propose a novel multi-modal fine-grained CLIP (MFCLIP) model, which mines comprehensive and fine-grained forgery traces across image-noise modalities via language-guided face forgery representation learning, to facilitate the advancement of DFFD. Specifically, we devise a fine-grained language encoder (FLE) that extracts fine global language features from hierarchical text prompts. We design a multi-modal vision encoder (MVE) to capture global image forgery embeddings as well as fine-grained noise forgery patterns extracted from the richest patch, and integrate them to mine general visual forgery traces. Moreover, we build an innovative plug-and-play sample pair attention (SPA) method to emphasize relevant negative pairs and suppress irrelevant ones, allowing cross-modality sample pairs to conduct more flexible alignment. Extensive experiments and visualizations show that our model outperforms the state of the arts on different settings like cross-generator, cross-forgery, and cross-dataset evaluations. Copyright © 2024, The Authors. All rights reserved.

关键词： Alignment

来源：评论

学校读者我要写书评

暂无评论

Routing Recovery for UAV Networks with Deliberate Attacks: A Reinforcement Learning based Approach

arXiv

引用

arXiv 2023年

作者： He, Sijie Jia, Ziye Dong, Chao Wang, Wei Cao, Yilu Yang, Yang Wu, Qihui The Key Laboratory of Dynamic Cognitive System of Electromagnetic Spectrum Space Ministry of Industry and Information Technology Nanjing University of Aeronautics and Astronautics Jiangsu Nanjing210016 China State Key Laboratory of Integrated Services Networks Xidian University Xi’an710071 China Institute of Computing Technologies China Academy of Railway Sciences Corporation Limited Beijing10081 China

The unmanned aerial vehicle (UAV) network is popular these years due to its various applications. In the UAV network, routing is significantly affected by the distributed network topology, leading to the issue that UAVs are vulnerable to deliberate damage. Hence, this paper focuses on the routing plan and recovery for UAV networks with attacks. In detail, a deliberate attack model based on the importance of nodes is designed to represent enemy attacks. Then, a node importance ranking mechanism is presented, considering the degree of nodes and link importance. However, it is intractable to handle the routing problem by traditional methods for UAV networks, since link connections change with the UAV availability. Hence, an intelligent algorithm based on reinforcement learning is proposed to recover the routing path when UAVs are attacked. Simulations are conducted and numerical results verify the proposed mechanism performs better than other referred methods. Copyright © 2023, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Dynamic Random Route Mutation Mechanism for Moving Target Defense in SDN 6

Dynamic Random Route Mutation Mechanism for Moving Target De...

引用

6th International Symposium on Computer and Information Processing technology, ISCIPT 2021

作者： Zhang, Bofeng Han, Li Sun, Shimin Tianjin University of Technology School of Computer Science and Engineering Tianjin China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology National Engineering Laboratory for Computer Virus Prevention and Control Technology Tianjin China Tiangong University Tianjin Key Laboratory of Autonomous Intelligent Technology and System School of Computer Science and Technology Tianjin China

ISBN: (纸本)9781665441377

Moving Target Defense (MTD) is commonly used in changing the asymmetric situation between attack and defense in cyberspace. Route mutation is a vital branch of MTD. Current route mutation methods still have some limitations on unpredictability of mutating routing paths and time overhead. In this paper, we propose a Dynamic Random Route Mutation (DRRM) mechanism in order to maximize the unpredictability of mutation and reduce the time overhead. First, we adopt Jaccard distance matrix and temporal constraint to improve mutation space. Mutation space can be dynamically shifted to enhance the unpredictability. Then, we weaken attackers' capabilities of launching effective eavesdropping at a certain node by using route weight. Finally, we construct a pre-distribution strategy to reduce the transmission latency caused by route mutation. Simulation results show that DRRM not only raises the difficulty of network eavesdropping, but also ensures low mutation time overhead. © 2021 IEEE.

关键词： Dynamics

来源：评论

学校读者我要写书评

暂无评论

Sparsity Aware of TF-IDF Matrix to Accelerate Oblivious Document Ranking and Retrieval

Sparsity Aware of TF-IDF Matrix to Accelerate Oblivious Docu...

引用

IEEE International Conference on Trust, Security and Privacy in computing and Communications (TrustCom)

作者： Zeshi Zhang Guangping Xu Hongzhang Yang Yulei Wu School of Computer Science and Engineering Tianjin University of Technology Tianjin China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin China Ministry of Education Key Laboratory of Computer Vision and System China Faculty of Engineering University of Bristol Bristol U.K.

ISBN: (数字)9798350381993

ISBN: (纸本)9798350382006

Due to cloud security concerns, there is an increasing interest in information retrieval systems that can support private queries over public documents. It is desirable for oblivious document ranking and retrieval in public cloud at lower cost and faster speed without revealing query-related information. Currently, the term frequency-inverse document frequency (TF-IDF) and private information retrieval (PIR) techniques are used to solve this problem, but the encryption operation time is over dominant. Motivated by the observation of the sparsity of the TF-IDF matrix, we propose an efficient approach for oblivious document ranking and retrieval, called E-Coeus. It takes advantage of the high sparsity of the TF-IDF matrix to rearrange the matrix. Our method accelerates the speed of PIR inadvertently retrieving documents and reduces the user retrieval delay time. In a stand-alone experiment for a TF-IDF matrix of 1.2M rows and 64K columns with the sparsity of 10%, E-Coeus improves the document ranking and retrieval performance by 23% over the state-of-the-art approach, Coeus. With cluster of 64 machines, E-Coeus improves the performance by 34% over Coeus when the TF-IDF matrix sparsity is 30%.

关键词： Time-frequency analysis Privacy Costs Cloud computing security Information retrieval Encryption Delays

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：