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

IEEE International Symposium on Quality Electronic Design

作者： Zhengyang Chen Yuhan Zhu Zhen Chen Zhisheng Chen Genggeng Liu College of Computer and Data Science Fuzhou University Fuzhou China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou China Fujian Key Laboratory of Network Computing and Intelligent Information Processing (Fuzhou University) Fuzhou China School of Informatics Xiamen University Xiamen China

ISBN: (数字)9798350309270

ISBN: (纸本)9798350309287

In recent years, microfluidic biochips have been widely applied in various fields of human society. The emergence of distributed channel-storage architecture enables fluid to be directly cached within the flow channels without being transported to the dedicated storage. However, the volume of the flow channels is limited, it is important to carefully consider the fluid volume to be cached to ensure it can be accommodated within the appropriate flow channels. In this paper, we propose a high-level synthesis method considering actual volume management and channel storage through integer linear programming, providing a rational analysis of fluid caching and the temporal relationships between different fluid-handling tasks. Experimental results conducted on multiple benchmark tests demonstrate the effectiveness of the proposed method in reducing the completion time of bioassay, the number of caches, the maximum fluid caching volume, and the number of fluid-handling tasks.

关键词： Fluids Biochips Estimation Cells (biology) Integer linear programming Benchmark testing Task analysis

来源：评论

学校读者我要写书评

暂无评论

Distributed Traffic Engineering in Hybrid Software Defined Networks: A Multi-agent Reinforcement Learning Framework

arXiv

引用

arXiv 2023年

作者： Guo, Yingya Tang, Qi Ma, Yulong Tian, Han Chen, Kai The College of Computer and Data Science Fuzhou University China The Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University China The Key Laboratory of Spatial Data Mining & Information Sharing Ministry of Education Fujian 350003 China The Department of Computer Science & Engineering Hong Kong University of Science & Technology Hong Kong

Traffic Engineering (TE) is an efficient technique to balance network flows and thus improves the performance of a hybrid Software Defined Network (SDN). Previous TE solutions mainly leverage heuristic algorithms to centrally optimize link weight setting or traffic splitting ratios under the static traffic demand. Note that as the network scale becomes larger and network management gains more complexity, it is notably that the centralized TE methods suffer from a high computation overhead and a long reaction time to optimize routing of flows when the network traffic demand dynamically fluctuates or network failures happen. To enable adaptive and efficient routing in TE, we propose a Multi-agent Reinforcement Learning method CMRL that divides the routing optimization of a large network into multiple small-scale routing decision-making problems. To coordinate the multiple agents for achieving a global optimization goal, we construct an interactive environment for training the routing agents that own partial link utilization observations. To optimize credit assignment of multi-agent, we introduce the difference reward assignment mechanism for encouraging agents to take better action. Extensive simulations conducted on the real traffic traces demonstrate the superiority of CMRL in improving TE performance, especially when traffic demands change or network failures happen. Copyright © 2023, The Authors. All rights reserved.

关键词： Global optimization

来源：评论

学校读者我要写书评

暂无评论

Dynamic Constrained Multi-Objective Optimization Algorithm Based on Co-Evolution and Diversity Enhancement

SSRN

引用

SSRN 2024年

作者： Che, Wang Zheng, Jinhua Hu, Yaru Zou, Juan Yang, Shengxiang Key Laboratory of Intelligent Computing and Information Processing Ministry of Education School of Computer Science School of Cyberspace Science of Xiangtan University Hunan Province Xiangtan China Faculty of School of Computer Science School of Cyberspace Science of Xiangtan University Xiangtan411105 China School of Computer Science and Informatics De Montfort University LeicesterLE1 9BH United Kingdom

Dynamic constrained multi-objective optimization problems (DCMOPs) involve objectives, constraints, and parameters that change over time. This kind of problem presents a greater challenge for evolutionary algorithms because it requires the population to quickly track the changing pareto-optimal set (PS) while being subject to constrained limitations and maintaining a good distribution of solutions. This paper proposes a dynamic constrained multi-objective optimization algorithm based on co-evolution and diversity enhancement (CEDE). The static optimization involves the co-evolution of three populations. We evolve the first population to prioritize the preservation of feasible individuals. The second population is evolved to assist the first population in finding better feasible regions, while the third population is evolved to aid the first population in exploring feasible regions comprehensively. At different stages, the co-evolution of these three populations will also be adjusted. Additionally, to prevent the elimination of potentially valuable infeasible individuals due to pareto domination, we employ an archive set to store and update these individuals, providing more useful information for both static and dynamic optimization. When the environment changes, we propose a diversity enhancement strategy, which includes a diversity maintenance strategy and a center point-based exploration strategy. The experimental results demonstrate that CEDE is highly competitive in handling DCMOPs compared to several state-of-the-art algorithms. © 2024, The Authors. All rights reserved.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Preference Multi-Objective Evolutionary Optimization Based on Angle Decompositio

SSRN

引用

SSRN 2023年

作者： Gao, Yubo Yu, Fan Zou, Juan Tang, Huanrong Zheng, Jinhua Key Laboratory of Intelligent Computing and Information Processing Ministry of Education Xiangtan University Xiangtan411105 China School of Computer Science School of Cyberspace Science University of Xiangtan Xiangtan411105 China School of Traffic and Transport Engineering Central South University Changsha410083 China

The optimal solution set of multi-objective optimization problems (MOPs) exists in a Pareto optimal front (PF) consisting of many Pareto non-dominated solutions. Still, the decision maker (DM) may be interested in only some of the solutions in the PF, called the region of interest (ROI). However, the existing strategies to determine the ROI for the DM are only limited to obtaining the preference region close to the preference point, which does not fully realize the essence of the preference multi-objective optimization problems (PMOPs), i.e., the solutions closer to the preference point should be more preferred by the DM. To better investigate the effectiveness of solving PMOPs, this paper proposes a preference multi-objective optimization evolutionary algorithm (PMOEA) based on the angle decomposition between objectives (MOEA/D-DAP) to avoid the challenge of preference information loss in PMOPs with increasing objective space dimension. Meanwhile, the reference vector generation method proposed by the MOEA/D-DAP enables preference solutions that align with the DM's needs to be closer to the preference points. Therefore, the preference solutions that are more in line with the needs of the DM exist closer to the preference points. Experiments on benchmark problems with dual and high dimensional objectives demonstrate the high effectiveness of the proposed MOEA/D-DAP in obtaining the ROI of the PMOPs. © 2023, The Authors. All rights reserved.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

CA-Edit: Causality-Aware Condition Adapter for High-Fidelity Local Facial Attribute Editing 39

CA-Edit: Causality-Aware Condition Adapter for High-Fidelity...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Xian, Xiaole He, Xilin Niu, Zenghao Zhang, Junliang Xie, Weicheng Song, Siyang Yu, Zitong Shen, Linlin Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China University of Exeter United Kingdom Great Bay University China

ISBN: (纸本)157735897X

For efficient and high-fidelity local facial attribute editing, most existing editing methods either require additional finetuning for different editing effects or tend to affect beyond the editing regions. Alternatively, inpainting methods can edit the target image region while preserving external areas. However, current inpainting methods still suffer from the generation misalignment with facial attributes description and the loss of facial skin details. To address these challenges, (i) a novel data utilization strategy is introduced to construct datasets consisting of attribute-text-image triples from a data-driven perspective, (ii) a Causality-Aware Condition Adapter is proposed to enhance the contextual causality modeling of specific details, which encodes the skin details from the original image while preventing conflicts between these cues and textual conditions. In addition, a Skin Transition Frequency Guidance technique is introduced for the local modeling of contextual causality via sampling guidance driven by low-frequency alignment. Extensive quantitative and qualitative experiments demonstrate the effectiveness of our method in boosting both fidelity and editability for localized attribute editing. Our codes will be made publicly available. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

EQ-Net: Elastic Quantization Neural Networks

EQ-Net: Elastic Quantization Neural Networks

引用

International Conference on Computer Vision (ICCV)

作者： Ke Xu Lei Han Ye Tian Shangshang Yang Xingyi Zhang School of Artificial Intelligence Anhui University Hefei China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Hefei China School of Computer Science and Technology Anhui University Hefei China Institutes of Physical Science and Information Technology Anhui University Hefei China

Current model quantization methods have shown their promising capability in reducing storage space and computation complexity. However, due to the diversity of quantization forms supported by different hardware, one limitation of existing solutions is that usually require repeated optimization for different scenarios. How to construct a model with flexible quantization forms has been less studied. In this paper, we explore a one-shot network quantization regime, named Elastic Quantization Neural Networks (EQ-Net), which aims to train a robust weight-sharing quantization supernet. First of all, we propose an elastic quantization space (including elastic bit-width, granularity, and symmetry) to adapt to various mainstream quantitative forms. Secondly, we propose the Weight Distribution Regularization Loss (WDR-Loss) and Group Progressive Guidance Loss (GPG-Loss) to bridge the inconsistency of the distribution for weights and output logits in the elastic quantization space gap. Lastly, we incorporate genetic algorithms and the proposed Conditional Quantization-Aware Accuracy Predictor (CQAP) as an estimator to quickly search mixed-precision quantized neural networks in supernet. Extensive experiments demonstrate that our EQ-Net is close to or even better than its static counterparts as well as state-of-the-art robust bit-width methods. Code can be available at https://***/xuke225/EQ-Net.

关键词：

来源：评论

学校读者我要写书评

暂无评论

EQ-Net: Elastic Quantization Neural Networks

arXiv

引用

arXiv 2023年

作者： Xu, Ke Han, Lei Tian, Ye Yang, Shangshang Zhang, Xingyi School of Artificial Intelligence Anhui University Hefei China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Hefei China Institutes of Physical Science and Information Technology Anhui University Hefei China School of Computer Science and Technology Anhui University Hefei China

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Exploring Invariance Matters for Domain Generalization

引用

IEEE Transactions on Image processing 2025年 34卷 3336-3351页

作者： Wang, Shanshan He, Houmeng Yang, Xun Liu, Zhipu Zhong, Yuanhong Zhang, Xingyi Wang, Meng Anhui University National Key Laboratory of Opto-Electronic Information Acquisition and Protection Technology Institutes of Physical Science and Information Technology Hefei230601 China University of Science and Technology of China School of Information Science and Technology Department of Electronic Engineering and Information Science Hefei230026 China Chongqing University of Technology School of Computer Science and Engineering Chongqing400054 China Chongqing University School of Microelectronics and Communication Engineering Chongqing400030 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education School of Computer Science and Technology Hefei230601 China Hefei University of Technology School of Computer Science and Information Engineering Hefei230009 China

Domain generalization (DG) aims to solve the problem of significant performance degradation when target domain data collected from the Out-Of-Distribution (O.O.D). Previous efforts try to exploit invariant features in the source domain through CNN networks. However, inspired by causal mechanisms, we find that the complex spurious-invariant information is still hidden in this view invariant features, and the impact of domain and class discrepancies on extracting invariance has not been effectively mitigated. To alleviate these issues, we propose a self-weighted multi-view mining invariance domain generalization framework (SMIDG). On the one hand, to make up for the insufficiency of traditional single-view convolutional feature extraction networks, we propose to mine features from another frequency view and use the self-adaptive adversarial masks to eliminate some spurious correlations, ensuring causal invariance in the coarse-grained generalization. However, due to inconsistencies in discriminative information between interdomain and intra-domain samples, as well as inter-class and intra-class samples, the coarse-grained elimination of spurious associations does not fully resolve this issue. On the other hand, we also consider the fine-grained generalization from two aspects. Firstly, to better tackle the domain discrepancies, we propose a novel progressive contrastive learning strategy that learns the underlying specific features of samples while gradually mitigating domain discrepancies, thereby ensuring domain invariance in fine-grained generalization. Secondly, due to the issue of feature inconsistency, we adopt a self-adaptive hard sample mining method with information gain to ensure that the model pays more attention on hard disentangled samples, thus maintaining feature invariance. Extensive experiments on five benchmark datasets demonstrate that our method outperforms state-of-the-art approaches. © 1992-2012 IEEE.

关键词： Contrastive learning Feature extraction Frequency-domain analysis Training Data models Data mining Correlation Data augmentation Convolutional neural networks Computer science

来源：评论

学校读者我要写书评

暂无评论

HairDiffusion: vivid multi-colored hair editing via latent diffusion 24

HairDiffusion: vivid multi-colored hair editing via latent d...

引用

Proceedings of the 38th International Conference on Neural information processing Systems

作者： Yu Zeng Yang Zhang Jiachen Liu Linlin Shen Kaijun Deng Weizhao He Jinbao Wang Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University and Shenzhen Institute of Artificial Intelligence and Robotics for Society and National Engineering Laboratory for Big Data System Computing Technology Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen University and Guangdong Provincial Key Laboratory of Intelligent Information Processing

ISBN: (纸本)9798331314385

Hair editing is a critical image synthesis task that aims to edit hair color and hairstyle using text descriptions or reference images, while preserving irrelevant attributes (e.g., identity, background, cloth). Many existing methods are based on StyleGAN to address this task. However, due to the limited spatial distribution of StyleGAN, it struggles with multiple hair color editing and facial preservation. Considering the advancements in diffusion models, we utilize Latent Diffusion Models (LDMs) for hairstyle editing. Our approach introduces Multi-stage Hairstyle Blend (MHB), effectively separating control of hair color and hairstyle in diffusion latent space. Additionally, we train a warping module to align the hair color with the target region. To further enhance multi-color hairstyle editing, we fine-tuned a CLIP model using a multi-color hairstyle dataset. Our method not only tackles the complexity of multi-color hairstyles but also addresses the challenge of preserving original colors during diffusion editing. Extensive experiments showcase the superiority of our method in editing multi-color hairstyles while preserving facial attributes given textual descriptions and reference images.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A general alternating-direction implicit Newton method for solving complex continuous-time algebraic Riccati matrix equation

arXiv

引用

arXiv 2022年

作者： Li, Shifeng Jiang, Kai Zhang, Juan Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Hunan Key Laboratory for Computation and Simulation in Science and Engineering School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China

In this paper, applying the Newton method, we transform the complex continuous-time algebraic Riccati matrix equation into a Lyapunov equation. Then, we introduce an efficient general alternating-direction implicit (GADI) method to solve the Lyapunov equation. The inexact Newton-GADI method is presented to save computational amount effectively. Moreover, we analyze the convergence of the Newton-GADI method. The convergence rate of the Newton-GADI and Newton-ADI methods is compared by analyzing their spectral radii. Furthermore, we give a way to select the quasi-optimal parameter. Corresponding numerical tests are shown to illustrate the effectiveness of the proposed algorithms. © 2022, CC BY-SA.

关键词： Newton-Raphson method

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：