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

IEEE Transactions on Evolutionary Computation 2025年

作者： Xue, Xingsi Mei, Yi Zhao, Baozhong Zhang, Mengjie Fujian University of Technology Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian Fuzhou350118 China Victoria University of Wellington School of Engineering and Computer Science Wellington6140 New Zealand Taiyuan University of Technology School of Electrical and Power Engineering Shanxi Taiyuan030024 China

Ontology is a kernel technique of the semantic web, which defines concepts, properties, and their relationships to establish a shared understanding of domain knowledge. Ontology matching identifies semantically similar entities across different ontologies, which uses similarity features to measure their similarity from different perspectives. However, due to the complexity of the entity heterogeneity, no single similarity feature is universally effective. In recent years, genetic algorithms have proven effective in constructing similarity features for ontology matching, but their potential is limited by the reliance on default classification strategies, empirical determination of the number of high-level features, the requirement for manually selecting, combining these features, and tuning the associated combination parameters. To overcome these drawbacks, we propose a multi-layer hybrid genetic programming approach to automatically construct high-level similarity features. This approach includes three novel components. First, a new multi-layer individual representation is designed, which faciliates the algorithm to adaptively explore the search space of constructing high-level similarity features. Second, to enhance the search effectiveness, a new initialization method and a mutation operator are developed, which use a weight-based strategy to adaptively select and construct a more diverse set of similarity features. Third, a compact genetic algorithm-based optimizer is designed to refine the tree structures of elite individuals. The experimental results on the ontology alignment evaluation initiative's benchmark show that our algorithm can generate high-quality ontology matching results across various matching tasks, significantly outperforming the state-of-the-art ontology matching methods. © 2025 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Multi-Quadrotor Cooperative Encirclement and Capture Approach in Obstacle Environments

Multi-Quadrotor Cooperative Encirclement and Capture Approac...

引用

International Conference on Mechatronics (ICM)

作者： Zhenyu Li Ruixin Wu Jin Wang Chuanqi Hu Zhi Zheng Jun Meng Guodong Lu School of Mechanical Engineering Zhejiang University Hangzhou China State Key Laboratory of Fluid Power and Mechatronic Systems Zhejiang University Hangzhou China Zhejiang Key Laboratory of Industrial Big Data and Robot Intelligent Systems Zhejiang University Hangzhou China Robotics Research Center of Yuyao City Ningbo China Polytechnic Institute Zhejiang University Hangzhou China College of Electrical Engineering Zhejiang University Hangzhou China Center for Data Mining and Systems Biology College of Electrical Engineering Zhejiang University Hangzhou China

ISBN: (数字)9798331533892

ISBN: (纸本)9798331533908

This article proposes an algorithm designed for autonomous quadrotors to capture target quadrotors in complex obstacle environments, enabling multiple pursuers to perform distributed capture while simultaneously avoiding obstacles and collisions. We first introduce a 3D obstacle space representation method based on safety-priority reachable region (SPRR) and implement real-time construction for general point cloud maps. Subsequently, leveraging SPRR, we employ an area minimization approach to ensure the effective capture of the evader within a limited time. The outcomes are then integrated into a MINCO-based trajectory planning framework to ensure their practical execution by real quadrotors. Relying on SPRR, the optimization problem is simplified and the solution efficiency is improved. In the scenario of simulating the dynamics of real quadrotors, we compare the proposed algorithm with state-of-the-art evasion and pursuit methods, validating its effectiveness and advancements. This work presents a practical solution for multi-quadrotor collaborative capture.

关键词： Point cloud compression Visualization Three-dimensional displays Trajectory planning Heuristic algorithms Collaboration Real-time systems Safety Optimization Quadrotors

来源：评论

学校读者我要写书评

暂无评论

Homophily Induced Contrastive Attributed Graph Clustering

引用

IEEE Transactions on Circuits and Systems for Video Technology 2025年

作者： Chen, Man-Sheng Lai, Pei-Yuan Liao, De-Zhang Wang, Chang-Dong Lai, Jian-Huang Sun Yat-sen University School of Computer Science and Engineering Guangzhou China Guangxi Zhuang Autonomous Region Information Center Guangxi Key Laboratory of Digital Infrastructure Nanning China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education China South China Technology Commercialization Center Guangzhou China Guangdong Key Laboratory of Information Security Technology Guangzhou China

Attributed graph clustering, aiming to discover the underlying graph structure and partition the graph nodes into several disjoint categories, is a basic task in graph data analysis. Although recent efforts over graph contrastive clustering have achieved decent performances, most of them get accustomed to construct the positive neighbor set by the generated pseudo clustering information, directly ignoring the ready-made neighbor nodes and the underlying semantics of edges in a graph. How to well deal with the graph neighbor-specific information to facilitate the performance of graph contrastive clustering is still a challenging problem. Therefore, in this work, we propose a novel Homophily Induced Contrastive Attributed Graph Clustering (HomoCAGC) method, where the power of homophily is exploited in facilitating the performance of contrastive attributed graph clustering, while the pseudo homophily in a graph is also explored and distinguished. Especially, the node feature as reliable information guidance is used to compute the underlying feature-oriented pair-wise node similarity, based on which the positive node pairs in contrastive regularizer are adjusted for better node representation characterization. According to the refined node representations, a triplet self-supervised clustering objective is well-designed to ensure the output embedding is cluster-oriented, and suitable for the downstream clustering task. Extensive experiments on seven benchmarks are conducted to demonstrate the effectiveness of HomoCAGC. © 1991-2012 IEEE.

关键词： Attributed graph clustering contrastive learning graph homophily self-supervised clustering

来源：评论

学校读者我要写书评

暂无评论

Electrocardiogram-to-Pair (E2P): A Secure Group Pairing Protocol for WBAN Devices

引用

IEEE Internet of Things Journal 2025年

作者： Zhao, Guichuan Tian, Youliang Jiang, Qi Ma, Jianfeng Guizhou University College of Computer Science and Technology Guiyang 550000 China Guizhou University State Key Laboratory of Public Big Data College of Big Data and Information Engineering Guiyang 550000 China Xidian University School of Cyber Engineering Xi'an 710071 China

In a wireless body area network (WBAN), group pairing among multiple wearable devices enables efficient and secure broadcasting group messages. Existing pairing methods that rely on trusted concentrators, active participation of users, or homogeneous environments are vulnerable to single point of failure and have restricted practicality. In this article, we propose Electrocardiogram-to-Pair (E2P), an electrocardiogram (ECG)-based secure group pairing protocol for WBAN devices that allows the establishment of a shared group key among multiple devices without requiring the user involvement or the central device. First, all wearable devices worn by the same user simultaneously collect ECG signals, which are then pre-processed through filtering and alignment to minimize the effect of noise on the pairing. Next, an adaptive quantization method is designed to reliably quantize the pre-processed ECG signals to generate initial keys. This method is ingenious as it relies on feature transformation and dynamic thresholds generation in the quantization process, which effectively ensures the security of biometrics and increases the key generation rate. Then, the group key is established among devices with initial keys through an improved Cascade method. The simulation results demonstrate that E2P achieves an effective balance the reliability and efficiency in group pairing, with outstanding performance in both security and key generation rate. © 2014 IEEE.

关键词： Electrocardiogram group pairing key establishment wireless body area network

来源：评论

学校读者我要写书评

暂无评论

MAGIC: detecting advanced persistent threats via masked graph representation learning 24

MAGIC: detecting advanced persistent threats via masked grap...

引用

Proceedings of the 33rd USENIX Conference on Security Symposium

作者： Zian Jia Yun Xiong Yuhong Nan Yao Zhang Jinjing Zhao Mi Wen Shanghai Key Laboratory of Data Science School of Computer Science Fudan University China School of Software Engineering Sun Yat-sen University China National Key Laboratory of Science and Technology on Information System Security China Shanghai University of Electric Power China

ISBN: (纸本)9781939133441

Advance Persistent Threats (APTs), adopted by most delicate attackers, are becoming increasing common and pose great threat to various enterprises and institutions. data provenance analysis on provenance graphs has emerged as a common approach in APT detection. However, previous works have exhibited several shortcomings: (1) requiring attack-containing data and a priori knowledge of APTs, (2) failing in extracting the rich contextual information buried within provenance graphs and (3) becoming impracticable due to their prohibitive computation overhead and memory *** this paper, we introduce MAGIC, a novel and flexible self-supervised APT detection approach capable of performing multi-granularity detection under different level of supervision. MAGIC leverages masked graph representation learning to model benign system entities and behaviors, performing efficient deep feature extraction and structure abstraction on provenance graphs. By ferreting out anomalous system behaviors via outlier detection methods, MAGIC is able to perform both system entity level and batched log level APT detection. MAGIC is specially designed to handle concept drift with a model adaption mechanism and successfully applies to universal conditions and detection scenarios. We evaluate MAGIC on three widely-used datasets, including both real-world and simulated attacks. Evaluation results indicate that MAGIC achieves promising detection results in all scenarios and shows enormous advantage over state-of-the-art APT detection approaches in performance overhead.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Real-Time Proportional-Integral-Derivative(PID)Tuning Based on Back Propagation(BP)Neural Network for Intelligent Vehicle Motion Control

引用

Computers, Materials & Continua 2025年第5期83卷 2375-2401页

作者： Liang Zhou Qiyao Hu Xianlin Peng Qianlong Liu School of Information Science and Technology Northwest UniversityXi’an710127China State-Province Joint Engineering and Research Center of Advanced Networking and Intelligent Information Services Northwest UniversityXi’an710127China Generative Artificial Intelligence and Mixed Reality Key Laboratory of Higher Education Institutions in Shaanxi Province Xi’an710127China Shaanxi Silk Road Cultural Heritage Digital Protection and Inheritance Collaborative Innovation Center Xi’an710127China School of Art Northwest UniversityXi’an710127China Network and Data Center Northwest UniversityXi’an710127China

Over 1.3 million people die annually in traffic accidents,and this tragic fact highlights the urgent need to enhance the intelligence of traffic safety and control *** modern industrial and technological applications and collaborative edge intelligence,control systems are crucial for ensuring efficiency and ***,deficiencies in these systems can lead to significant operational *** paper uses edge intelligence to address the challenges of achieving target speeds and improving efficiency in vehicle control,particularly the limitations of traditional Proportional-Integral-Derivative(PID)controllers inmanaging nonlinear and time-varying dynamics,such as varying road conditions and vehicle behavior,which often result in substantial discrepancies between desired and actual speeds,as well as inefficiencies due to manual parameter *** paper uses edge intelligence to propose a novel PID control algorithm that integrates Backpropagation(BP)neural networks to enhance robustness and *** BP neural network is first trained to capture the nonlinear dynamic characteristics of the *** network is then combined with the PID controller to forma hybrid control *** output layer of the neural network directly adjusts the PIDparameters(k_(p),k_(i),k_(d)),optimizing performance for specific driving scenarios through self-learning and weight *** experiments demonstrate that our BP neural network-based PID design significantly outperforms traditional methods,with the response time for acceleration from 0 to 1 m/s improved from 0.25 s to just 0.065 ***,real-world tests on an intelligent vehicle show its ability to make timely adjustments in response to complex road conditions,ensuring consistent speed maintenance and enhancing overall system performance.

关键词： PID control backpropagation neural network hybrid control nonlinear dynamic processes edge intelligence

来源：评论

学校读者我要写书评

暂无评论

Performance of fiber-based QAM/FSO systems in turbulence with anisotropic tilt angle and random angular jitter

arXiv

引用

arXiv 2025年

作者： Zhai, Chao Xue, Zhenyuan School of Computer and Communication Engineering Northeastern University at Qinhuangdao Qinhuangdao066004 China Hebei Key Laboratory of Marine Perception Network and Data Processing Northeastern University at Qinhuangdao Qinhuangdao066004 China

Nowadays, the subsistent anisotropic non-Kolmogorov (ANK) turbulence models are all established on the supposition that the long axis of turbulence cell ought to be level with the ground. Nevertheless, Beason et al. and Wang et al. have illustrated through their recent experimental results that there is an anisotropic tilt angle in the turbulence cell, i.e., the long axis of turbulence cell is probably not level with the ground but has a particular angle with the ground. For the practical free-space optical (FSO) communication link, bias error and random angular jitter are critical elements which influence the fiber-based FSO communication system performance. In this paper, employing the new ANK turbulence spectrum models in the horizontal link with anisotropic tilt angle, we derive the normalized probability density function (PDF) for Gamma-Gamma distribution with anisotropic tilt angle, and the PDF of fiber-coupling efficiency in the presence of bias error, anisotropic tilt angle, and random angular jitter. And then the average bit error rate (BER) expression of fiber-based J × Q rectangular quadrature amplitude modulation (QAM) FSO systems for a plane wave transmission through the weak ANK horizontal link in the presence of bias error, anisotropic tilt angle, and random angular jitter is developed. © 2025, CC BY-NC-ND.

关键词： Quadrature amplitude modulation

来源：评论

学校读者我要写书评

暂无评论

A Plug-and-Play Bregman ADMM Module for Inferring Event Branches in Temporal Point Processes

arXiv

引用

arXiv 2025年

作者： Wang, Qingmei Wu, Yuxin Long, Yujie Huang, Jing Ran, Fengyuan Su, Bing Xu, Hongteng Gaoling School of Artificial Intelligence Renmin University of China China School of Cyber Science and Engineering Wuhan University China Beijing Key Laboratory of Big Data Management and Analysis Methods China

An event sequence generated by a temporal point process is often associated with a hidden and structured event branching process that captures the triggering relations between its historical and current events. In this study, we design a new plug-and-play module based on the Bregman ADMM (BADMM) algorithm, which infers event branches associated with event sequences in the maximum likelihood estimation framework of temporal point processes (TPPs). Specifically, we formulate the inference of event branches as an optimization problem for the event transition matrix under sparse and low-rank constraints, which is embedded in existing TPP models or their learning paradigms. We can implement this optimization problem based on subspace clustering and sparse group-lasso, respectively, and solve it using the Bregman ADMM algorithm, whose unrolling leads to the proposed BADMM module. When learning a classic TPP (e.g., Hawkes process) by the expectation-maximization algorithm, the BADMM module helps derive structured responsibility matrices in the E-step. Similarly, the BADMM module helps derive low-rank and sparse attention maps for the neural TPPs with self-attention layers. The structured responsibility matrices and attention maps, which work as learned event transition matrices, indicate event branches, e.g., inferring isolated events and those key events triggering many subsequent events. Experiments on both synthetic and real-world data show that plugging our BADMM module into existing TPP models and learning paradigms can improve model performance and provide us with interpretable structured event branches. The code is available at https://***/qingmeiwangdaily/BADMM *** Codes 60G55, 62M10 Copyright © 2025, The Authors. All rights reserved.

关键词： Maximum likelihood estimation

来源：评论

学校读者我要写书评

暂无评论

Nitrate ameliorates myelin loss and cognitive impairment in Alzheimer's disease through upregulation of neuronal sialin and subsequent inhibition of TPPP phosphorylation

引用

Science Bulletin 2025年第8期70卷 1224-1229页

作者： Chen, Xinyue Hu, Geng Chang, Lirong Li, Xiaoyu Tang, Yi Wu, Yan Zhang, Ran Zhang, Chunmei Wang, Jinsong Wang, Xue Wang, Songlin Department of Biochemistry and Molecular Biology School of Basic Medical Sciences Beijing Laboratory of Oral Health Capital Medical University Beijing100069 China Key Laboratory of Big Data-Based Precision Medicine School of Engineering Medicine Beihang University Beijing100191 China Beijing Key Laboratory of Neural Regeneration and Repair Department of Anatomy School of Basic Medical Sciences Beijing Institute of Brain Disorders Capital Medical University Beijing100069 China Innovation Center for Neurological Disorders Department of Neurology Xuanwu Hospital Capital Medical University Beijing100053 China Beijing Key Laboratory of Traditional Chinese Veterinary Medicine Department of Veterinary Medicine Animal Science and Technology College Beijing University of Agriculture Beijing102206 China Department of Oral Pathology Peking University School and Hospital of Stomatology & National Center of Stomatology & National Clinical Research Center for Oral Diseases & National Engineering Research Center of Oral Biomaterials and Digital Medical Devices Beijing100081 China National Human Brain Bank for Development and Function Institute of Basic Medical Sciences Chinese Academy of Medical Sciences School of Basic Medicine Peking Union Medical College Beijing10005 China Laboratory of Homeostatic Medicine School of Medicine Southern University of Science and Technology Shenzhen518055 China Research Units of Tooth Development and Regeneration Chinese Academy of Medical Sciences Beijing100700 China

来源：评论

学校读者我要写书评

暂无评论

Characterizing the set of quantum correlations in prepare-and-measure quantum multichain-shaped networks

引用

Physical Review A 2025年第2期111卷 022439-022439页

作者： Yanning Jia Fenzhuo Guo Yukun Wang Haifeng Dong Fei Gao School of Science Beijing University of Posts and Telecommunications Beijing 100876 China Beijing Key Laboratory of Petroleum Data Mining China University of Petroleum-Beijing Beijing 102249 China School of Instrumentation Science and Opto-Electronics Engineering Beihang University Beijing 100191 China

We introduce a hierarchy of tests satisfied by any probability distribution P that represents the quantum correlations generated in prepare-and-measure (P&M) quantum multichain-shaped networks, assuming only the inner-product information of prepared states. The P&M quantum multichain-shaped networks involve multiple measurement parties, with each measurement party potentially having multiple sequential receivers. We adapt the original Navascués, Pironio, and Acín (NPA) hierarchy by incorporating a finite number of linear and positive semi-definite constraints to characterize the quantum correlations in P&M quantum multichain-shaped networks. These constraints in each hierarchy are derived from sequential measurements and the inner-product matrix of prepared states. The adapted NPA hierarchy is further applied to tackle some quantum information tasks, including sequential quantum random access codes (QRACs) and semi-device-independent randomness certification. First, we derive the optimal trade-off between the two sequential receivers in the 2→1 sequential QRACs, and investigate randomness certification in its double violation region. Second, considering the presence of an eavesdropper in actual communication, we show how much local and global randomness can be certified using the optimal trade-off of 2→1 sequential QRACs. We also quantify the amount of local and global randomness that can be certified from the complete set of probabilities generated by the two sequential receivers. Our conclusion is that utilizing the full set of probabilities certifies more randomness than relying solely on the optimal trade-off relationship.

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：