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

A Method for Fast Feature Selection Utilizing Cross-Similarity within the Context of Fuzzy Relations

Computers, Materials & Continua 2025年第4期83卷 1195-1218页

作者： Wenchang Yu Xiaoqin Ma Zheqing Zhang Qinli Zhang School of Big Data and Artificial Intelligence Chizhou UniversityChizhou247000China Anhui Education Big Data Intelligent Perception and Application Engineering Research Center Anhui Provincial Joint Construction Key Laboratory of Intelligent Education Equipment and TechnologyChizhou247000China

Feature selection methods rooted in rough sets confront two notable limitations:their high computa-tional complexity and sensitivity to noise,rendering them impractical for managing large-scale and noisy *** primary issue stems from these methods’undue reliance on all *** overcome these challenges,we introduce the concept of cross-similarity grounded in a robust fuzzy relation and design a rapid and robust feature selection ***,we construct a robust fuzzy relation by introducing a truncation ***,based on this fuzzy relation,we propose the concept of cross-similarity,which emphasizes the sample-to-sample similarity relations that uniquely determine feature importance,rather than considering all such relations *** studying the manifestations and properties of cross-similarity across different fuzzy granularities,we propose a forward greedy feature selection algorithm that leverages cross-similarity as the foundation for information *** algorithm significantly reduces the time complexity from O(m2n2)to O(mn2).Experimental findings reveal that the average runtime of five state-of-the-art comparison algorithms is roughly 3.7 times longer than our algorithm,while our algorithm achieves an average accuracy that surpasses those of the five comparison algorithms by approximately 3.52%.This underscores the effectiveness of our *** paper paves the way for applying feature selection algorithms grounded in fuzzy rough sets to large-scale gene datasets.

关键词： Fuzzy rough sets feature selection cross-similarity fuzzy relations

来源：评论

学校读者我要写书评

暂无评论

Multi-Scale Feature Fusion and Advanced Representation Learning for Multi Label Image Classification

引用

Computers, Materials & Continua 2025年第3期82卷 5285-5306页

作者： Naikang Zhong Xiao Lin Wen Du Jin Shi Institute of Artificial Intelligence on Education Research College of InformationMechanical and Electrical EngineeringShanghai Normal UniversityShanghai200234China Lab for Educational Big Data and Policymaking Ministry of EducationShanghai Normal UniversityShanghai200234China Shanghai Intelligent Education Big Data Engineering Technology Research Center Shanghai Normal UniversityShanghai200234China Shanghai Online Education Research Base for Primary and Secondary Schools Shanghai200234China DS Information Technology Co. Ltd.Shanghai200032China Faculty of Innovation Engineering Macao university of Science and TechnologyMacao999078China

Multi-label image classification is a challenging task due to the diverse sizes and complex backgrounds of objects in *** class-specific precise representations at different scales is a key aspect of feature ***,existing methods often rely on the single-scale deep feature,neglecting shallow and deeper layer features,which poses challenges when predicting objects of varying scales within the same *** some studies have explored multi-scale features,they rarely address the flow of information between scales or efficiently obtain class-specific precise representations for features at different *** address these issues,we propose a two-stage,three-branch Transformer-based *** first stage incorporates multi-scale image feature extraction and hierarchical scale *** design enables the model to consider objects at various scales while enhancing the flow of information across different feature scales,improving the model’s generalization to diverse object *** second stage includes a global feature enhancement module and a region selection *** global feature enhancement module strengthens interconnections between different image regions,mitigating the issue of incomplete represen-tations,while the region selection module models the cross-modal relationships between image features and ***,these components enable the efficient acquisition of class-specific precise feature *** experiments on public datasets,including COCO2014,VOC2007,and VOC2012,demonstrate the effectiveness of our proposed *** approach achieves consistent performance gains of 0.3%,0.4%,and 0.2%over state-of-the-art methods on the three datasets,*** results validate the reliability and superiority of our approach for multi-label image classification.

关键词： Image classification multi-label multi scale attention mechanisms feature fusion

来源：评论

学校读者我要写书评

暂无评论

Dynamic Regret for Distributed Online Composite Optimization

引用

IEEE Transactions on Automatic Control 2025年第5期70卷 3056-3071页

作者： Hou, Ruijie Yu, Yang Li, Xiuxian Tongji University Department of Control Science and Engineering College of Electronics and Information Engineering Shanghai201800 China Tongji University Shanghai Research Institute for Intelligent Autonomous Systems National Key Laboratory of Autonomous Intelligent Unmanned Systems Frontiers Science Center for Intelligent Autonomous Systems Ministry of Education Shanghai Institute of Intelligent Science and Technology Shanghai201210 China

This article focuses on online composite optimization over multiagent networks. In the distributed setting, each agent has its own local loss function, which consists of a convex, strongly convex or strongly convex and smooth function, and a time-varying nonsmooth regularizer. Two distributed online algorithms are proposed and corresponding dynamic regrets are analyzed. Two proposed algorithms are based on signs of relative states. The first algorithm obtains (Formula presented) dynamic regret bound when each local loss is a general convex composite function, where CT is the path variation. If CT can be estimated in advance for convex or strongly convex local loss with a time-varying nonsmooth regularizer, then dynamic regret bounds are, respectively, in the order of (Formula presented) and o (log T(1 + CT)). The second algorithm is based on the first one, especially for handling the local loss composed of a strongly convex and smooth function with a nonsmooth regularizer, and then obtains o (1 + CT) dynamic regret bound. In the end, numerical results are given to support the theoretical findings. © 1963-2012 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

A numerical magnitude aware multi-channel hierarchical encoding network for math word problem solving

引用

Neural Computing and Applications 2025年第3期37卷 1651-1672页

作者： Xu, Junjie Chen, Yuzhong Xiao, Lingsheng Liao, Hongmiao Zhong, Jiayuan Dong, Chen College of Computer and Data Science Fuzhou University Fujian Province Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fujian Province Fuzhou350108 China

Math word problem (MWP) represents a critical research area within reading comprehension, where accurate comprehension of math problem text is crucial for generating math expressions. However, current approaches still grapple with unresolved challenges in grasping the sensitivity of math problem text and delineating distinct roles across various clause types, and enhancing numerical representation. To address these challenges, this paper proposes a Numerical Magnitude Aware Multi-Channel Hierarchical Encoding Network (NMA-MHEA) for math expression generation. Firstly, NMA-MHEA implements a multi-channel hierarchical context encoding module to learn context representations at three different channels: intra-clause channel, inter-clause channel, and context-question interaction channel. NMA-MHEA constructs hierarchical constituent-dependency graphs for different levels of sentences and employs a Hierarchical Graph Attention Neural Network (HGAT) to learn syntactic and semantic information within these graphs at the intra-clause and inter-clause channels. NMA-MHEA then refines context clauses using question information at the context-question interaction channel. Secondly, NMA-MHEA designs a number encoding module to enhance the relative magnitude information among numerical values and type information of numerical values. Experimental results on two public benchmark datasets demonstrate that NMA-MHEA outperforms other state-of-the-art models. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Device-edge collaborative occluded face recognition method based on cross-domain feature fusion

引用

Digital Communications and Networks 2025年第2期11卷 482-492页

作者： Puning Zhang Lei Tan Zhigang Yang Fengyi Huang Lijun Sun Haiying Peng School of Communications and Information Engineering Chongqing University of Posts and Telecommunications Advanced Network and Intelligent Connection Technology Key Laboratory of Chongqing Education Commission of China Chongqing Key Laboratory of Ubiquitous Sensing and Networking Chongqing Innovation Center of Industrial Big-Data Co.Lt

The lack of facial features caused by wearing masks degrades the performance of facial recognition systems. Traditional occluded face recognition methods cannot integrate the computational resources of the edge layer and the device layer. Besides, previous research fails to consider the facial characteristics including occluded and unoccluded parts. To solve the above problems, we put forward a device-edge collaborative occluded face recognition method based on cross-domain feature fusion. Specifically, the device-edge collaborative face recognition architecture gets the utmost out of maximizes device and edge resources for real-time occluded face recognition. Then, a cross-domain facial feature fusion method is presented which combines both the explicit domain and the implicit domain facial. Furthermore, a delay-optimized edge recognition task scheduling method is developed that comprehensively considers the task load, computational power, bandwidth, and delay tolerance constraints of the edge. This method can dynamically schedule face recognition tasks and minimize recognition delay while ensuring recognition accuracy. The experimental results show that the proposed method achieves an average gain of about 21% in recognition latency, while the accuracy of the face recognition task is basically the same compared to the baseline method.

关键词： Occluded face recognition Cross-domain feature fusion Device-edge collaboration

来源：评论

学校读者我要写书评

暂无评论

Low Profile, High Aperture Efficiency Magneto-Electric Dipole Circularly Polarized Beam Scanning Antenna Array

引用

IEEE Antennas and Wireless Propagation Letters 2025年第5期24卷 1094-1098页

作者： Wang, Chao Xu, Guanghui Meng, Yanfeng Yan, Jiaxin Xie, Guoda Chen, Yi Wang, Wei Zhao, Luyu Li, Minquan Li, Yingsong Huang, Zhixiang Anhui University The Industry-Education-Research Institute of Advanced Materials and Technology for Integrated Circuits Information Materials and Intelligent Sensing Laboratory of Anhui Province Center for Big Data and Population Health of lHM Hefei230601 China East China Research Institute of Electronic Engineering Hefei230088 China

In this letter, a low-profile, high-aperture-efficiency millimeter-wave magneto-electric dipole (MED) circularly polarized (CP) beam-scanning antenna array is proposed. Initially, a novel MED antenna element is designed by arranging metallized vias around the radiating patches to serve as beam directors. This novel method not only provides broad axial-ratio (AR) beams and wide half-power beamwidths but also maintains a low-profile and compact structural characteristic. By adjusting the positions of the via directors, the radiation beam direction of the antenna element is effectively controlled. Subsequently, 4 × 4 antenna arrays for the xoz and yoz planes are designed and simulated to verify the CP beam scanning performance. The results demonstrate that the maximum CP beam scanning range can reach from -50° to +50°, with the AR maintained below 3 dB throughout the scanning range. At 29 GHz, the peak aperture efficiencies of the antenna arrays reach 73.8%, while maintaining a low profile of just 0.12λ0. Finally, the measurement results confirm the validity of the simulations. © 2002-2011 IEEE.

关键词： Millimeter waves

来源：评论

学校读者我要写书评

暂无评论

Gupacker: Generalized Unpacking Framework for Android Malware

引用

IEEE Transactions on Information Forensics and Security 2025年 20卷 4338-4352页

作者： Zheng, Tao Hou, Qiyu Chen, Xingshu Ren, Hao Li, Meng Li, Hongwei Shen, Changxiang Sichuan University School of Cyber Science and Engineering Chengdu610065 China Sichuan University School of Cyber Science and Engineering Cyber Science Research Institute Key Laboratory of Data Protection and Intelligent Management Ministry of Education Chengdu610065 China Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Intelligent Interconnected Systems Laboratory of Anhui Province School of Computer Science and Information Engineering Hefei230002 China University of Padua Department of Mathematics HIT Center Padua35131 Italy University of Electronic Science and Technology of China School of Computer Science and Engineering Chengdu611731 China Sichuan University Cyber Science Research Institute Key Laboratory of Data Protection and Intelligent Management Ministry of Education Chengdu610065 China

Android malware authors often use packers to evade analysis. Although many unpacking tools have been proposed, they face two significant challenges: 1) They are easily impeded by anti-analysis techniques employed by packers, preventing efficient collection of hidden Dex data. 2) They are typically designed to unpack a specific packer and cannot handle malware packed with mixed packers. Consequently, many packed malware samples evade detection. To bridge this gap, we propose Gupacker , a novel generalized unpacking framework. Gupacker offers a generic solution for first-generation holistic packer by customizing the Android system source code. It identifies the type of packer and selects an appropriate unpacking function, constructs a deeper active call chain to achieve generic unpacking of second-generation function extraction packers, and uses JNI function and instruction monitoring to handle third-generation virtual obfuscation packer. On this basis, we counteract a diverse array of anti-analysis techniques. We conduct extensive experiments on 5K packed Android malware samples, comparing Gupacker with 2 commercial and 4 state-of-the-art academic unpacking tools. The results demonstrate that Gupacker significantly improves the efficiency of Android malware unpacking with acceptable system overhead. We analyze real packed applications based on Gupacker and found several are second-packed by attackers, including WPS for Android, with tens of millions of users. We receive and responsibly report 13 0day vulnerabilities and also assist in the remediation of all vulnerabilities. © 2005-2012 IEEE.

关键词： Android malware

来源：评论

学校读者我要写书评

暂无评论

Two efficient beamforming methods for hybrid IRS-aided AF relay wireless networks

引用

Science China(Information Sciences) 2025年第4期68卷 363-379页

作者： Xuehui WANG Qingbo LI Wen ZHU Feng SHU Mengxing HUANG Fuhui ZHOU Riqing CHEN Cunhua PAN Yongpeng WU Jiangzhou WANG School of Mathematics and Statistics Hainan Normal University Key Laboratory of Data Science and Smart Education Ministry of Education Hainan Normal University School of Information and Communication Engineering Hainan University Collaborative Innovation Center of Information Technology Hainan University School of Electronic and Optical Engineering Nanjing University of Science and Technology College of Electronic and Information Engineering Nanjing University of Aeronautics and Astronautics Digital Fujian Institute of Big Data for Agriculture Fujian Agriculture and Forestry University National Mobile Communications Research Laboratory Southeast University Shanghai Key Laboratory of Navigation and Location Based Services Shanghai Jiao Tong University School of Engineering University of Kent

Owing to its ability to mitigate the double-fading effect by amplifying the reflected signal, the active intelligent reflecting surface(IRS) has garnered significant attention. In this paper, an amplify-and-forward(AF) relay network assisted by a hybrid IRS consisting of both passive and active units is developed. A signal-to-noise ratio(SNR) maximization problem is formulated, where the AF relay beamforming matrix and the hybrid IRS reflecting coefficient matrices for two-time slots need to be optimized. To address the SNR maximization problem, this paper proposes both a high-performance(HP) method and a low-complexity(LC) method. The HP method is based on the semidefinite relaxation and fractional programming(SDR-FP)algorithm, with rank-1 solutions obtained through Gaussian randomization. For the LC method, the amplification coefficient of each active IRS element is assumed to be equal. The SNR maximization problem is then addressed using the whitening filter,generalized power iteration, and generalized Rayleigh-Ritz(WF-GPI-GRR) approach. Simulation results show that compared with the benchmarks, such as the passive IRS-aided AF relay network, the proposed HP-SDR-FP and WF-GPI-GRR methods achieve significant rate improvements. In particular, the HP-SDR-FP and WF-GPI-GRR methods yield more than a 135.0%rate gain when the transmit power Ps of the source is 10 dBm. Furthermore, the proposed HP-SDR-FP method outperforms the WF-GPI-GRR method in terms of rate performance.

关键词： double-fading intelligent reflecting surface active elements passive elements hybrid IRS AF relay

来源：评论

学校读者我要写书评

暂无评论

Unified Grid Tagging Scheme for Aspect Sentiment Quad Prediction 31

Unified Grid Tagging Scheme for Aspect Sentiment Quad Predic...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Su, Guixin Zhang, Yongcheng Wang, Tongguan Wu, Mingmin Sha, Ying Key Laboratory of Smart Farming for Agricultural Animals Wuhan China Engineering Research Center of Intelligent Technology for Agriculture Ministry of Education China Hubei Engineering Technology Research Center of Agricultural Big Data Wuhan China College of Informatics Huazhong Agricultural University Wuhan China

ISBN: (纸本)9798891761964

Aspect Sentiment Quad Prediction (ASQP) aims to extract all sentiment elements in quads for a given review to explain the reason for the sentiment. Previous table-filling based methods have achieved promising results by modeling word-pair relations. However, these methods decompose the ASQP task into several subtasks without considering the association between sentiment elements. Most importantly, they fail to tackle the situation where a sentence contains multiple implicit expressions. To address these limitations, we propose a simple yet effective Unified Grid Tagging Scheme (UGTS) to extract sentiment quadruplets in one shot, with two additional special tokens from pre-trained models to represent potential implicit aspect and opinion terms. Based on this, we first introduce the adaptive graph diffusion convolution network to construct the direct connection between explicit and implicit sentiment elements from syntactic and semantic views. Next, we utilize conditional layer normalization to refine the mutual indication effect between words for matching valid aspect-opinion pairs. Finally, we employ the triaffine mechanism to integrate heterogeneous word-pair relations to capture higher-order interactions between sentiment elements. Experimental results on four benchmark datasets show the effectiveness and robustness of our model, which achieves state-of-the-art performance. © 2025 Association for Computational Linguistics.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Multi-Hop Attention Diffusion Graph Neural Networks For Multimodal Fake News Detection

Multi-Hop Attention Diffusion Graph Neural Networks For Mult...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Huang, Zhongqiang Lu, Dongli Sha, Ying Key Laboratory of Smart Farming for Agricultural Animals Wuhan China Engineering Research Center of Intelligent Technology for Agriculture Ministry of Education Wuhan China Hubei Engineering Technology Research Center of Agricultural Big Data Wuhan China College of Informatics Huazhong Agricultural University Wuhan China

ISBN: (纸本)9798350368741

Fake news often spreads rapidly on social media in various forms, exposing users to a large amount of misinformation and disinformation. Recently, promising results have been achieved in fake news detection. However, most of the approaches only consider one-hop neighborhood information in cross-modal mapping relationships or focus mainly on pairwise interactions of multimodal fake news. However, the fine-grained feature mapping of multimodal fake news may go beyond binary relations. To address these issues, we propose a Multi-Hop Attention Diffusion Graph Neural Networks in this work to capture and complement the multivariate mapping relationships between fine-grained features, while extracting cross-modal higher-order alignment representations for multimodal fake news detection via cross-modal contrastive learning and modal matching. Extensive experiments on three public datasets demonstrate the effectiveness of the proposed approach in the multimodal fake news detection task. © 2025 IEEE.

关键词： attention diffusion fake news graph neural networks multivariate mapping relationships

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：