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

Tianji’s horse racing optimization (THRO): a new metaheuristic inspired by ancient wisdom and its engineering optimization applications

引用

Artificial Intelligence Review 2025年第9期58卷 1-111页

作者： Wang, Liying Du, Haiping Zhang, Zhenxing Hu, Gang Mirjalili, Seyedali Khodadadi, Nima Hussien, Abdelazim G. Liao, Yingying Zhao, Weiguo School of Water Conservancy and Hydropower Hebei University of Engineering Handan China School of Electrical Computer and Telecommunications Engineering University of Wollongong Wollongong Australia Prairie Research Institute University of Illinois at Urbana-Champaign Champaign USA Department of Applied Mathematics Xi’an University of Technology Xi’an China Centre for Artificial Intelligence Research and Optimisation Torrens University Australia Brisbane Australia Faculty of Electrical Engineering and Computer Science VSB-Technical University of Ostrava Ostrava Czech Republic University Research and Innovation Center Obuda University Budapest Hungary Department of Civil and Environmental Engineering Pacific Earthquake Engineering Research (PEER) Center University of California Berkeley USA Faculty of Science Fayoum University Fayoum Egypt School of Civil Engineering Shijiazhuang Tiedao University Shijiazhuang China

In this study, we introduce a novel metaheuristic algorithm named Tianji’s horse racing optimization (THRO), inspired by the Chinese historical story of Tianji’s horse racing. The story illustrates how Tianji leveraged his strengths to counteract his opponent’s weaknesses, ultimately leading to his victory in the competition. This strategic principle, which led to Tianji’s victory, forms the foundation of THRO’s design. The need for such a proposal arises from the limitations of existing optimization algorithms, which often struggle with convergence speed and solution accuracy when solving complex problems. THRO addresses these challenges by employing a unique dynamic individual matching strategy that enhances the algorithm’s convergence rate and solution precision. In this algorithm, an effective greedy strategy is employed to maximize benefits by selecting individuals from its population and matching them with individuals from the opponent’s population, thereby facilitating individual updates. This paper provides mathematically grounded explanations and analysis of how the algorithm converges to the global optimum with probability 1. To validate the efficacy of THRO, comparative experiments with 12 popular algorithms are conducted on 23 classical benchmark functions and the CEC2017 test suite. For the 29 CEC2017 functions across 10, 30, 50, and 100 dimensions, THRO achieves the slowest Friedman average ranking values among all competing methods, which are 2.052, 2.500, 2.293, and 2.259, respectively. Additionally, we conduct a comprehensive comparison with several advanced algorithms, including high-performance hybrid optimizers and the CEC winners, across the CEC2014, CEC2017, CEC2020, and CEC2022 suites, where THRO again achieves the slowest Friedman average ranking value of 1.729. Furthermore, six engineering design problems are employed to comprehensively check the applicability of THRO. Eventually, THRO’s proficiency extends to the application of identifying

关键词：

来源：评论

学校读者我要写书评

暂无评论

Quantum noise of dark pulse microcombs

Quantum noise of dark pulse microcombs

引用

CLEO: QELS_Fundamental science, QELS 2022

作者： Lao, Chenghao Jin, Xing Chang, Lin Xie, Weiqiang Shu, Haowen Wang, Xingjun Bowers, John E. Yang, Qi-Fan State Key Laboratory for Artificial Microstructure and Mesoscopic Physics Frontiers Science Center for Nano-Optoelectronics School of Physics Peking University Beijing100871 China Department of Electrical and Computer Engineering University of California Santa BarbaraCA93106 United States State Key Laboratory of Advanced Optical Communications System and Networks Department of Electronics School of Electronics Engineering and Computer Science Peking University Beijing100871 China

We investigate the fundamental timing jitter of dark pulse microcombs generated in an AlGaAs microresonator, where the quantum-limited frequency noise of the 91-GHz repetition rate is measured to be 0.5 Hz2/Hz. ©... 详细信息

ISBN: (纸本)9781557528209

关键词： Aluminum gallium arsenide

来源：评论

学校读者我要写书评

暂无评论

NumbOD: A Spatial-Frequency Fusion Attack Against Object Detectors 39

NumbOD: A Spatial-Frequency Fusion Attack Against Object Det...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Zhou, Ziqi Li, Bowen Song, Yufei Yu, Zhifei Hu, Shengshan Wan, Wei Zhang, Leo Yu Yao, Dezhong Jin, Hai National Engineering Research Center for Big Data Technology and System China Services Computing Technology and System Lab China Cluster and Grid Computing Lab China Hubei Engineering Research Center on Big Data Security China Hubei Key Laboratory of Distributed System Security China School of Computer Science and Technology Huazhong University of Science and Technology China School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Information and Communication Technology Griffith University Australia

ISBN: (纸本)157735897X

With the advancement of deep learning, object detectors (ODs) with various architectures have achieved significant success in complex scenarios like autonomous driving. Previous adversarial attacks against ODs have been focused on designing customized attacks targeting their specific structures (e.g., NMS and RPN), yielding some results but simultaneously constraining their scalability. Moreover, most efforts against ODs stem from image-level attacks originally designed for classification tasks, resulting in redundant computations and disturbances in object-irrelevant areas (e.g., background). Consequently, how to design a model-agnostic efficient attack to comprehensively evaluate the vulnerabilities of ODs remains challenging and unresolved. In this paper, we propose NumbOD, a brand-new spatial-frequency fusion attack against various ODs, aimed at disrupting object detection within images. We directly leverage the features output by the OD without relying on its internal structures to craft adversarial examples. Specifically, we first design a dual-track attack target selection strategy to select high-quality bounding boxes from OD outputs for targeting. Subsequently, we employ directional perturbations to shift and compress predicted boxes and change classification results to deceive ODs. Additionally, we focus on manipulating the high-frequency components of images to confuse ODs’ attention on critical objects, thereby enhancing the attack efficiency. Our extensive experiments on nine ODs and two datasets show that NumbOD achieves powerful attack performance and high stealthiness. © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Hybrid Active-Passive Beamforming for Scalable sub-Terahertz Antenna Array

Hybrid Active-Passive Beamforming for Scalable sub-Terahertz...

引用

2021 IEEE International Symposium on Antennas and Propagation and North American Radio science Meeting, APS/URSI 2021

作者： Huang, Kai-Qi Swaminathan, Madhavan 3D Systems Packaging Research Center School of Electrical and Computer Engineering School of Materials Science and Engineering Georgia Institute of Technology AtlantaGA United States

ISBN: (纸本)9781728146706

For massive multiple-input multiple-output applications in sub-terahertz band, both active and passive beamforming methods encounter challenges. This paper proposes a concept of hybrid active-passive beamforming using a combination of both to address the issues. We also introduce an implementation platform using glass interposer with patch antenna array on polymer build-up layers and integrated-circuit chips embedded in the glass core. © 2021 IEEE.

关键词： Beamforming

来源：评论

学校读者我要写书评

暂无评论

DisCo: Graph-Based Disentangled Contrastive Learning for Cold-Start Cross-Domain Recommendation

arXiv

引用

arXiv 2024年

作者： Li, Hourun Wang, Yifan Xiao, Zhiping Yang, Jia Zhou, Changling Zhang, Ming Ju, Wei State Key Laboratory for Multimedia Information Processing School of Computer Science PKU-Anker LLM Lab Peking University Beijing China Computer Center Peking University Beijing China School of Information Technology & Management University of International Business and Economics Beijing China Paul G. Allen School of Computer Science and Engineering University of Washington SeattleWA United States College of Computer Science Sichuan University Chengdu China

Recommender systems are widely used in various real-world applications, but they often encounter the persistent challenge of the user cold-start problem. Cross-domain recommendation (CDR), which leverages user interactions from one domain to improve prediction performance in another, has emerged as a promising solution. However, users with similar preferences in the source domain may exhibit different interests in the target domain. Therefore, directly transferring embeddings may introduce irrelevant source-domain collaborative information. In this paper, we propose a novel graph-based disentangled contrastive learning framework to capture fine-grained user intent and filter out irrelevant collaborative information, thereby avoiding negative transfer. Specifically, for each domain, we use a multi-channel graph encoder to capture diverse user intents. We then construct the affinity graph in the embedding space and perform multi-step random walks to capture high-order user similarity relationships. Treating one domain as the target, we propose a disentangled intent-wise contrastive learning approach, guided by user similarity, to refine the bridging of user intents across domains. Extensive experiments on four benchmark CDR datasets demonstrate that DisCo consistently outperforms existing state-of-the-art baselines, thereby validating the effectiveness of both DisCo and its components. Copyright © 2024, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Retraction Note: High performance reconciliation for practical quantum key distribution systems

引用

Optical and Quantum Electronics 2024年第12期56卷 1-2页

作者： Mao, ao-Kun Li, Qiong Hao, Peng-Lei Abd-El-Atty, Bassem Iliyasu, Abdullah M. Department of Computer Science and Technology Harbin Institute of Technology Harbin China CAS Key Laboratory of Quantum Information University of Science and Technology of China Hefei China CAS Center for Excellence in Quantum Information and Quantum Physics University of Science and Technology of China Hefei China Department of Computer Science Faculty of Computers and Information Luxor University Luxor Egypt Electrical Engineering Department College of Engineering Prince Sattam Bin Abdulaziz University Al- Kharj Saudi Arabia School of Computing Tokyo Institute of Technology Yokohama Japan School of Computer Science and Technology Changchun University of Science and Technology Changchun China

来源：评论

学校读者我要写书评

暂无评论

A Composite Decomposition Method for Large-Scale Global Optimization

arXiv

引用

arXiv 2024年

作者： Tian, Maojiang Chen, Minyang Du, Wei Tang, Yang Jin, Yaochu Yen, Gary G. The Key Laboratory of Smart Manufacturing in Energy Chemical Process Ministry of Education East China University of Science and Technology Shanghai200237 China The Engineering Research Center of Process System Engineering Ministry of Education East China University of Science and Technology Shanghai200237 China The Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen518055 China The School of Engineering Westlake University Hangzhou310030 China The School of Electrical and Computer Engineering Oklahoma State University StillwaterOK74048 United States

Cooperative co-evolution (CC) algorithms, based on the divide-and-conquer strategy, have emerged as the predominant approach to solving large-scale global optimization (LSGO) problems. The efficiency and accuracy of the grouping stage significantly impact the performance of the optimization process. While the general separability grouping (GSG) method has overcome the limitation of previous differential grouping (DG) methods by enabling the decomposition of non-additively separable functions, it suffers from high computational complexity. To address this challenge, this article proposes a composite separability grouping (CSG) method, seamlessly integrating DG and GSG into a problem decomposition framework to utilize the strengths of both approaches. CSG introduces a step-by-step decomposition framework that accurately decomposes various problem types using fewer computational resources. By sequentially identifying additively, multiplicatively and generally separable variables, CSG progressively groups non-separable variables by recursively considering the interactions between each non-separable variable and the formed non-separable groups. Furthermore, to enhance the efficiency and accuracy of CSG, we introduce two innovative methods: a multiplicatively separable variable detection method and a non-separable variable grouping method. These two methods are designed to effectively detect multiplicatively separable variables and efficiently group non-separable variables, respectively. Extensive experimental results demonstrate that CSG achieves more accurate variable grouping with lower computational complexity compared to GSG and state-of-the-art DG series designs. © 2024, CC BY.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

CLMSI: A Novel Image-Text Named Entity Recognition Method Based on Contrast Learning and Multimodal Semantic Interaction

CLMSI: A Novel Image-Text Named Entity Recognition Method Ba...

引用

International Conference on Behavior, Economic and Social Computing (BESC)

作者： Jiangtao Ma Wenduo Jin Yonggang Chen Fan Zhang Shenyi Qian Yaqiong Qiao College of Computer and Information Engineering Tianjin Normal University Tianjin China School of Computer Science and Technology Zhengzhou University of Light Industry Zhengzhou China The State Information Center China National Digital Switching System Engineering and Technology R&D Center Zhengzhou China College of Cyber Science Nankai University Tianjin China

ISBN: (数字)9798331531904

ISBN: (纸本)9798331531911

Most existing multimodal named entity recognition (MNER) methods cannot align image and text well, and fail to effectively fuse image-text semantic information, leading to suboptimal MNER accuracy. To this end, this paper proposes a novel named entity recognition model based on Contrastive Learning and Multimodal Semantic Interaction (named CLMSI). Specifically, to narrow the semantic gap between image-text modalities, making semantically similar image-text representations closer and pushing dissimilar ones further apart, we propose a contrastive learning-based cross-modal alignment method. Moreover, to integrate multimodal information effectively and filter out the noise introduced by image features as thoroughly as possible, we propose to incorporate image descriptions as additional features to enrich the multimodal representation and to reduce the semantic bias of the image information. Extensive experiments conducted on two MNER benchmark datasets, Twitter-2015 and Twitter-2017, demonstrate the superiority of the proposed method. Further ablation studies and case analyses also affirm the efficacy of CLMSI.

关键词： Visualization Social computing Accuracy Social networking (online) Computational modeling Semantics Noise Named entity recognition Feature extraction Data mining

来源：评论

学校读者我要写书评

暂无评论

Intelligent Network Selection Algorithm for Multiservice Users in 5G Heterogeneous Network System: Nash Q-Learning Method

Intelligent Network Selection Algorithm for Multiservice Use...

引用

作者： Ma, Mingfang Zhu, Anqi Guo, Songtao Yang, Yuanyuan The College of Computer Science Chongqing University Chongqing China Robotics Research Center College of Intelligence Science and Technology National University of Defense Technology Changsha China Department of Electrical and Computer Engineering Stony Brook University Stony BrookNY United States

The 5G heterogeneous network architecture integrates different radio access technologies (RATs), which will support the large-scale communication connection of massive Internet-of-Things (IoT) devices. However, as the rapid growth of IoT connections, personalized requirements of services requested and heterogeneity deepening of the network system, how to design an intelligent network selection scheme for user devices (UDs) is becoming a crucial challenge in the 5G heterogeneous network system. Most of the existing network selection methods only optimize the selection strategies from the user side or network side, which results in heavy network congestion, poor user experience, and system performance degradation. Accordingly, we propose a multiagent $Q$ -learning network selection (MAQNS) algorithm based on Nash $Q$ -learning, which can learn a joint optimal selection strategy to improve system throughput and reduce user blocking on the premise of ensuring the requirements of IoT services. In particular, we apply the discrete-time Markov chains to model the network selection, and the analytic hierarchy process (AHP) and gray relation analysis (GRA) are jointly utilized to obtain user preferences for each network. Finally, performance evaluation demonstrates that comparing to the existing schemes, MAQNS proposed cannot only improve system throughput and reduce user blocking but also promote user experience on average energy efficiency and delay. © 2014 IEEE.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Optimization for Task Offloading and Downloading in UAV-Assisted MEC Systems with Aerial to Aerial Collaboration

Optimization for Task Offloading and Downloading in UAV-Assi...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Jiawei Jiang Xiang Tian Yubing Han Chunyu Hu Bin Feng Jiguo Yu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan China School of Information Science and Technology Taishan University Taian China School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China Big Data Institute Qilu University of Technology Jinan China

ISBN: (数字)9798331513054

ISBN: (纸本)9798331513061

Owing to the easy deployment and mobile flexibility, Unmanned Aerial Vehicle (UAV) assisted Mobile Edge Computing (MEC) has been deemed as one potential technology for handling the computation-intensive tasks at terminal devices (TDs). In this work, a MEC architecture assisted by UAVs is designed which achieves efficient offloading, computing, and downloading for tasks from multiple TDs via aerial to aerial collaboration of two UAVs. In this architecture, the task offloading process contains two parts, i.e., the offloading from TDs to a mobile UAV which flies around TDs, and the offloading from the mobile UAV to a hovering UAV which hovers in the air. The computing tasks from TDs will be divided into three parts allocated to the TDs themselves, and both two UAVs. Upon completion of computation, the computation results are downloaded to the TDs. The optimization objective is to seek for an optimal task division strategy to attain the weighted total energy consumption minimization for all devices. Since the formulated optimization problem is not convex, we develop a two-step iteration algorithm which jointly optimizes computing frequency, task allocation volume, as well as UAV's trajectory based on the method of block coordinate descent. Simulation results confirm the effectiveness and performance advantages of the designed algorithm.

关键词： Energy consumption Simulation Collaboration computer architecture Autonomous aerial vehicles Minimization Resource management Jamming Trajectory optimization Radio spectrum management

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：