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

Adaptive Multi-strategy Rabbit Optimizer for Large-scale Optimization

Journal of Bionic engineering 2025年第1期22卷 398-416页

作者： Baowei Xiang Yixin Xiang Department of Computing School of Electronic and Information Engineering Taizhou UniversityTaizhou318000China Department of Software Engineering College of Software Nankai UniversityTianjin300350China

As optimization problems continue to grow in complexity,the need for effective metaheuristic algorithms becomes increasingly ***,the challenge lies in identifying the right parameters and strategies for these *** this paper,we introduce the adaptive multi-strategy Rabbit Algorithm(RA).RA is inspired by the social interactions of rabbits,incorporating elements such as exploration,exploitation,and adaptation to address optimization *** employs three distinct subgroups,comprising male,female,and child rabbits,to execute a multi-strategy *** parameters,including distance factor,balance factor,and learning factor,strike a balance between precision and computational *** offer practical recommendations for fine-tuning five essential RA parameters,making them versatile and *** is capable of autonomously selecting adaptive parameter settings and mutation strategies,enabling it to successfully tackle a range of 17 CEC05 benchmark functions with dimensions scaling up to *** results underscore RA’s superior performance in large-scale optimization tasks,surpassing other state-of-the-art metaheuristics in convergence speed,computational precision,and ***,RA has demonstrated its proficiency in solving complicated optimization problems in real-world engineering by completing 10 problems in CEC2020.

关键词： Adaptive parameter Large scale optimization Rabbit algorithm Swarm intelligence engineering optimization

来源：评论

学校读者我要写书评

暂无评论

Successive Interference Cancellation-Enabled Timely Status Update in Linear Multi-Hop Wireless Networks

引用

IEEE Transactions on Mobile computing 2025年第6期24卷 5298-5311页

作者： Han, Xinhui Pan, Haoyuan Wang, Zhaorui Li, Jianqiang Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China Future Network of Intelligence Institute School of Science and Engineering Shenzhen518172 China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology College of Computer Science and Software Engineering Shenzhen518060 China

We investigate the timely status update in linear multi-hop wireless networks, where a source tries to deliver status update packets to a destination through a sequence of half-duplex relays. Timeliness is measured by the age of information (AoI) metric. Maintaining a low AoI at the destination typically necessitates frequent transmission of update packets from the source. However, high packet transmission frequency in multi-hop scenarios can result in mutual wireless interference at intermediate relays. Specifically, when an intermediate relay receives wireless signals of a new packet from its previous node, simultaneous transmission of an old packet by its subsequent node to the next hop may cause wireless signals to interfere at the intermediate relay, conventionally leading to packet collision. A key motivation to solve this issue is that the intermediate relay has previously received the old packet (which can thus be forwarded to the subsequent node for further relaying). Hence, successive interference cancellation (SIC) can be employed to mitigate interference of the old packet and recover the new packet. This paper designs an SIC-enabled packet relaying scheme tailored to low AoI. Initially focusing on a three-hop network, we subsequently extend our approach to general multi-hop networks. We model the multi-hop relaying scheme using a Markov chain to derive the theoretical average AoI. Theoretical and simulation results indicate that the SIC-enabled packet relaying scheme significantly reduces the average AoI compared to the non-SIC approaches, owing to an increased packet transmission frequency at the source and the effectiveness of SIC techniques at the relays. © 2002-2012 IEEE.

关键词： Markov chains

来源：评论

学校读者我要写书评

暂无评论

HDeFC: Hierarchical Secure Fuzzy Deduplication Based on Fog computing

引用

IEEE Internet of Things Journal 2025年第9期12卷 12658-12668页

作者： Tang, Zehui Zeng, Shengke Han, Song Liu, Jun He, Mingxing Xihua University School of Computer and Software Engineering Chengdu610039 China Hangzhou City University School of Computer and Computing Science Hangzhou310015 China

Secure deduplication not only optimizes cloud storage but also prevents data leakage. However, traditional schemes are with high computation and communication costs to deal with large-scale multimedia data. To address this problem, we propose a fog computing-based fuzzy deduplication (HDeFC), a two-stage privacy-preserving deduplication protocol. Our approach prevents guessing attacks and single point of failure, besides that also implements noninteractive Proof of Ownership and label consistency verification. In addition, we also achieve the access permission for only legitimate users. Our performance evaluation shows that the hierarchical setting is efficient in deduplication. © 2014 IEEE.

关键词： Information leakage

来源：评论

学校读者我要写书评

暂无评论

Bias analysis of AI models for undergraduate student admissions

引用

Neural computing and Applications 2025年第12期37卷 7785-7795页

作者： Van Busum, Kelly Fang, Shiaofen Department of Computer Science and Software Engineering Butler University IndianapolisIN United States Computing and Engineering Indiana University Luddy School of Informatics Indiana University Indianapolis IndianapolisIN United States

Bias detection and mitigation is an active area of research in machine learning. This work extends previous research done by the authors Van Busum and Fang (Proceedings of the 38th ACM/SIGAPP Symposium on Applied computing, 2023) to provide a rigorous and more complete analysis of the bias found in AI predictive models. Admissions data spanning six years was used to create an AI model to determine whether a given student would be directly admitted into the School of Science under various scenarios at a large urban research university. During this time, submission of standardized test scores as part of a student’s application became optional which led to interesting questions about the impact of standardized test scores on admission decisions. We developed and analyzed AI models to understand which variables are important in admissions decisions, and how the decision to exclude test scores affects the demographics of the students who are admitted. We then evaluated the predictive models to detect and analyze biases these models may carry with respect to three variables chosen to represent sensitive populations: gender, race, and whether a student was the first in his/her family to attend college. We also extended our analysis to show that the biases detected were persistent. Finally, we included several fairness metrics in our analysis and discussed the uses and limitations of these metrics. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Evolution Analysis of Network Attack and Defense Situation Based on Game Theory

引用

Computers, Materials & Continua 2025年第4期83卷 1475-1494页

作者： Haiyan Sun Chenglong Shao Jianwei Zhang Kun Wang Wanwei Huang College of Software Engineering Zhengzhou University of Light IndustryZhengzhou450007China Intelligent Computing Power Research Department Zhengzhou Xinda Advanced Technology Research InstituteZhengzhou450007China

To address the problem that existing studies lack analysis of the relationship between attack-defense game behaviors and situation evolution from the game perspective after constructing an attack-defense model,this paper proposes a network attack-defense game model(ADGM).Firstly,based on the assumption of incomplete information between the two sides of the game,the ADGM model is established,and methods of payoff quantification,equilibrium solution,and determination of strategy confrontation results are ***,drawing on infectious disease dynamics,the network attack-defense situation is defined based on the density of nodes in various security states,and the transition paths of network node security states are ***,the network zero-day virus attack-defense behaviors are analyzed,and comparative experiments on the attack-defense evolution trends under the scenarios of different strategy combinations,interference methods,and initial numbers are conducted using the NetLogo simulation *** experimental results indicate that this model can effectively analyze the evolution of the macro-level network attack-defense situation from the micro-level attack-defense *** instance,in the strategy selection experiment,when the attack success rate decreases from 0.49 to 0.29,the network destruction rate drops by 11.3%,in the active defense experiment,when the interference coefficient is reduced from 1 to 0.7,the network destruction rate decreases by 7%,and in the initial node number experiment,when the number of initially infected nodes increases from 10 to 30,the network destruction rate rises by 3%.

关键词： Network attack-defense situation evolution zero-day virus NetLogo

来源：评论

学校读者我要写书评

暂无评论

Redactable Blockchain From Decentralized Chameleon Hash Functions, Revisited

引用

IEEE Transactions on Computers 2025年第6期74卷 1911-1920页

作者： Li, Cong Shen, Qingni Wu, Zhonghai Peking University School of Software and Microelectronics Beijing100871 China Peking University National Engineering Research Center for Software Engineering Beijing100871 China Peking University Key Laboratory of High Confidence Software Technologies Ministry of Education Beijing100871 China Peking University PKU-OCTA Laboratory for Blockchain and Privacy Computing Beijing100871 China

Recently, redactable blockchains have attracted attention owing to enabling the contents of blocks to be re-written. The existing redactable blockchain solutions can be classified as two categories, the centralized one and decentralized one. In centralized solutions, a single blockchain node possessing the trapdoor conducts redaction operations. However, they suffer from the issue of single point of failure. In decentralized solutions, redaction operations are performed by numerous blockchain nodes cooperatively. But there also exists the issue of inefficiency or requiring a trusted party in these solutions. Subsequently, Jia et al. proposed a redactable blockchain solution from a decentralized chameleon hash function (DCH) they designed, which supports the threshold redaction, traceability and consistency check. Nevertheless, after carefully analyzing their solution, we find that it fails to achieve the security they claimed by presenting a concrete attack. To resolve this security issue, we propose a novel chameleon hash function scheme that achieves strong collision-resistant security while maintaining simple and efficient as the building block. Based on it, we then present an improved DCH scheme with sufficient security, so that the redactable blockchain from it can resist the presented attack. Theoretical and experimental analyses demonstrate that improved DCH achieves efficiency comparable to DCH. © 1968-2012 IEEE.

关键词： Decentralized control

来源：评论

学校读者我要写书评

暂无评论

Instruction selection optimization for VLIW architecture based on classification node merging

引用

Journal of Supercomputing 2025年第7期81卷 1-19页

作者： Liu, Fangjun Zhang, Huifu Hu, Yonghua Xie, Anxing Cao, Wei Mo, Shangfeng School of Computer Science and Engineering Hunan University of Science and Technology XiangTan411201 China Hunan Key Laboratory for Service Computing and Novel Software Technology XiangTan411201 China

Traditional instruction selection methods fail to fully exploit the very long instruction word (VLIW) architecture’s efficient scalar instructions. We propose an optimized instruction selection method based on classification node merging. This method abstracts scalar intermediate instructions into nodes and divides them into associated and similar ones according to operational semantics. Combined with the VLIW architecture’s instruction set features and guided by the instruction cost model, the nodes are merged and optimized to select efficient instructions. We design an instruction generation framework that swiftly converts the low level virtual machine intermediate representation into the instruction sequence of the target architecture. The experimental results show that, compared with the instruction sequence generated by M7002-cc, the instruction sequence generated with the solution proposed in this paper exhibits an average execution performance that is up to 54% higher on the FT-M7002 hardware platform. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

SQUMUTH squirrel search based algorithm for high order mutant generation in mutation testing

引用

Discover computing 2025年第1期28卷 1-17页

作者： Mohanty, Subhasish Mishra, Jyotirmaya Mohapatra, Sudhir Kumar Bejo, Seifu Detso Deferisha, Aliazar Deneke Computer Science and Engineering GIET University Odisha Gunupur India Faculty of Engineering and Technology Sri Sri University Cuttack India Department of Software Engineering CCI Wolkite University Wolkite Ethiopia Faculty of Computing and Software Engineering Arba Minch University Arba Minch Ethiopia

In today's software testing community, quality assessment remains critical, with mutation testing standing as a cornerstone technique for evaluating the effectiveness of test cases. This method involves introducing faulty code, or mutants, into the program to assess the quality of the test suite and other testing methods. However, mutation testing faces challenges such as the generation of numerous mutants, the presence of equivalent mutants that are difficult to detect through testing, and the lack of realistic mutant creation. Literature reviews indicate significant efforts to address these issues through formal solutions and heuristic methods. Recent optimization-based methods are now recognized as cost-effective result in an optimized solution. Hence, to overcome these limitations, this study introduces SQUMUTH, a novel approach for high-order mutant generation based on the Squirrel Search Algorithm (SSA). Inspired by the foraging behavior of squirrels, SSA offers a promising solution for enhancing the efficiency and effectiveness of mutation testing. Experimental evaluations on eight well-known Java benchmark programs demonstrate that SQUMUTH outperforms existing methods. Comparative analyses of mutation scores and the rates of realistic mutants consistently show its better performance across all subject programs compared to other state-of-the-art methods such as Social Group Optimization, Binary Genetic Algorithm, and random testing. The experimental results underscore its effectiveness in generating more realistic mutants. The experimental results indicated that the proposed approach has the potential to advance software testing by improving the cost-effectiveness of mutation analysis and the quality of software systems. © The Author(s) 2025.

关键词： First-order mutants Higher-order mutants Mutation score Mutation testing software testing Squirrel search algorithm

来源：评论

学校读者我要写书评

暂无评论

Uncertainty-Calibrated Test-Time Model Adaptation without Forgetting

引用

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

作者： Tan, Mingkui Chen, Guohao Wu, Jiaxiang Zhang, Yifan Chen, Yaofo Zhao, Peilin Niu, Shuaicheng South China University of Technology School of Software Engineering China Pazhou Laboratory Guangzhou China XVERSE China National University of Singapore School of Computing Singapore Tencent AI Lab China Nanyang Technological University College of Computing and Data Science Singapore

Test-time adaptation (TTA) seeks to tackle potential distribution shifts between training and testing data by adapting a given model w.r.t. any testing sample. This task is particularly important when the test environment changes frequently. Although some recent attempts have been made to handle this task, we still face two key challenges: 1) prior methods have to perform backpropagation for each test sample, resulting in unbearable optimization costs to many applications;2) while existing TTA solutions can significantly improve the test performance on out-of-distribution data, they often suffer from severe performance degradation on in-distribution data after TTA (known as catastrophic forgetting). To this end, we have proposed an Efficient Anti-Forgetting Test-Time Adaptation (EATA) method which develops an active sample selection criterion to identify reliable and non-redundant samples for test-time entropy minimization. To alleviate forgetting, EATA introduces a Fisher regularizer estimated from test samples to constrain important model parameters from drastic changes. However, in EATA, the adopted entropy loss consistently assigns higher confidence to predictions even when the samples are underlying uncertain, leading to overconfident predictions that underestimate the data uncertainty. To tackle this, we further propose EATA with Calibration (EATA-C) to separately exploit the reducible model uncertainty and the inherent data uncertainty for calibrated TTA. Specifically, we compare the divergence between predictions from the full network and its sub-networks to measure the reducible model uncertainty, on which we propose a test-time uncertainty reduction strategy with divergence minimization loss to encourage consistent predictions instead of overconfident ones. To further re-calibrate predicting confidence on different samples, we utilize the disagreement among predicted labels as an indicator of the data uncertainty. Based on this, we devise a min-max entropy

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Unpaired 3D Shape-to-Shape Translation via Gradient-Guided Triplane Diffusion

引用

IEEE Transactions on Visualization and Computer Graphics 2025年第5期31卷 3376-3386页

作者： Zhang, Wenxiao Rahmani, Hossein Liu, Jun Hohai University College of Computer Science and Software Engineering Nanjing211100 China Lancaster University School of Computing and Communications LancasterLA1 4YW United Kingdom

Unpaired shape-to-shape translation refers to the task of transforming the geometry and semantics of an input shape into a new shape domain without paired training data. Previous methods utilize GAN-based architectures to perform shape translation, employing adversarial training to transform the source shape encoding into the target domain in the low-dimensional latent feature space. However, these methods encounter difficulties in generating diverse and high-quality results, as they often suffer from issues such as "mode collapse". This leads to limited generation diversity and makes it challenging to find an accurate latent code that adequately represents the input shape. In this paper, we achieve unpaired shape-to-shape translation via a triplane diffusion model, in which we factorize 3D objects into triplane representations and conduct a diffusion process on these representations to accomplish shape domain transformation. We observe that by adding an appropriate amount of noise to an input object during the forward diffusion process, domain-specific shape structures are smoothed out while the overall structure is still preserved. Subsequently, we progressively remove the noise via an unconditional diffusion model trained on the target shape domain in the reverse diffusion process. This allows us to obtain a denoised output that retains the structural similarities of the source input while aligning with the distribution of the target shape domain. During this process, we propose two gradient-based guidance mechanisms to guide the translation process to guarantee more faithful results during the denoising process. We conduct extensive experiments on different shape domains, and the experimental results demonstrate that our method achieves superior shape fidelity with high quality compared to current state-of-the-art baselines. © 1995-2012 IEEE.

关键词： Signal encoding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：