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

18th International Conference on Wireless Artificial Intelligent Computing Systems and Applications, WASA 2024

作者： Huang, Zhijian Song, Shuguang Liu, Han Kuang, Hongyu Zhang, Jingjing Hu, Pengfei National Key Laboratory of Science and Technology on Information System Security Systems Engineering Institute Academy of Military Sciences Beijing China School of Computer Science and Technology Shandong University Qingdao China

ISBN: (纸本)9783031714696

Binary code analysis serves as the foundation for research in vulnerability discovery, software protection, and malicious code analysis. However, analyzing binary files is challenging due to the lack of high-level semantic information, leading to heavy dependence on analysts’ expertise and significantly impacting the efficiency of binary code analysis. Recent years has witnessed the blossom of machine learning models for binary analysis, but few researches address the problem of binary code datasets. In this paper, we review all the existing and available datasets, and make classification according to their application. We set up experiments to illustrate how dataset quality could affect the performance of machine learning models in binary function recognition. Based on the experimental evaluation, we present a discussion on the ground truth as well as quality evaluation problems for binary code datasets. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

CroPrompt: Cross-task Interactive Prompting for Zero-shot Spoken Language Understanding

CroPrompt: Cross-task Interactive Prompting for Zero-shot Sp...

引用

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

作者： Qin, Libo Wei, Fuxuan Chen, Qiguang Zhou, Jingxuan Huang, Shijue Si, Jiasheng Lu, Wenpeng Che, Wanxiang School of Computer Science and Engineering Central South University China Key Laboratory of Data Intelligence and Advanced Computing in Provincial Universities Soochow University China Research Center for Social Computing and Information Retrieval Harbin Institute of Technology China Harbin Institute of Technology Shenzhen China Key Laboratory of Computing Power Network and Information Security Ministry of Education Qilu University of Technology Shandong Academy of Sciences China

ISBN: (纸本)9798350368741

Slot filling and intent detection are two highly correlated tasks in spoken language understanding (SLU). Recent SLU research attempts to explore zero-shot prompting techniques in large language models to alleviate the data scarcity problem. Nevertheless, the existing prompting work ignores the cross-task interaction information for SLU, which leads to sub-optimal performance. To solve this problem, we present the pioneering work of Cross-task Interactive Prompting (CroPrompt) for SLU, which enables the model to interactively leverage the information exchange across the correlated tasks in SLU. Additionally, we further introduce a multi-task self-consistency mechanism to mitigate the error propagation caused by the intent information injection. We conduct extensive experiments on the standard SLU benchmark and the results reveal that CroPrompt consistently outperforms the existing prompting approaches. In addition, the multi-task self-consistency mechanism can effectively ease the error propagation issue, thereby enhancing the performance. We hope this work can inspire more research on cross-task prompting for SLU. © 2025 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Semantic-Aware Prompt Learning for Multimodal Sarcasm Detection

Semantic-Aware Prompt Learning for Multimodal Sarcasm Detect...

引用

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

作者： Wang, Guangjin Wang, Bao Xu, Fuyong Zhu, Zhenfang Wang, Peipei Wang, Ru Liu, Peiyu School of Information Science and Engineering Shandong Normal University Jinan China School of Information Science and Electrical Engineering Shandong Jiao Tong University Jinan China 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

ISBN: (纸本)9798350368741

Multimodal sarcasm detection aims to identify whether utterances express sarcastic intentions contrary to their literal meaning based on multimodal information. However, existing methods fail to explore the model's "ability to understand" the semantics expressed by sentences in the image context from semantic diversity perspectives. In this paper, we propose a multi-view semantic awareness method, which concretizes semantics from multiple perspectives to improve the model's ability to capture different semantic features. Specifically, two learnable prefixes are attached to the text representation respectively to construct semantic representations from both the literal meaning and sarcastic intention perspectives. Then, image-text information is further fused through cross-attention to guide the semantic representation of different perspectives in the image context. Finally, the semantics expressed by prefixes are strengthened through KL divergence, thereby encouraging the model to capture two distinctive semantic features. Experiments on benchmark datasets demonstrate the effectiveness of our method. © 2025 IEEE.

关键词： KL divergence multi-view semantic representation multimodal sarcasm detection semantic representation enhancement

来源：评论

学校读者我要写书评

暂无评论

A Triangular Stable Node network based on Self-supervised Learning for personalized prediction

A Triangular Stable Node Network based on Self-supervised Le...

引用

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

作者： Liu, Qing Gao, Qian Fan, Jun Zhang, Zhiqiang 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 Jinan250014 China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology Shandong Academy of Sciences Jinan250353 China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan250014 China China Telecom Digital Intelligence Techonology Co Ltd. No.1999 Shunhua road Shandong Jinan250101 China

ISBN: (纸本)9798350368741

In recent years, research has illuminated the potency of implicit data processing in enhancing user preferences. Nevertheless, barriers remain in breaking through the constraints of implicit information. This study aims to bridge this gap by firstly constructing a triangular stable node network model, tailored to manage implicit information with precision. Recognizing the challenge of pinpointing novel structures within large-scale graphs, we propose SLTSNN-a triangular stable node network based on self-supervised learning for personalized prediction. SLTSNN innovates by maximizing mutual information between graph-level and patch-level representations, while augmenting graph representations through extended enhanced representations. Additionally, it incorporates triangular data associations and introduces a triangular allocation attention network, which emphasizes strongly correlated preference features among similar users. Furthermore, SLTSNN employs contrastive learning to maximize mutual information between graph vectors and hidden representations, distinguishing between high-order global and local representations. The model's effectiveness in enhancing user preferences and capturing new graph structures is evidenced by its performance on hit rate and normalized discounted cumulative gain metrics across three datasets. © 2025 IEEE.

关键词： graph contrastive learning graph neural networks recommender systems self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Enhancing Scalability: A Complete Tree Sharding Architecture Towards IoT 18th

Enhancing Scalability: A Complete Tree Sharding Architecture...

引用

18th International Conference on Wireless Artificial Intelligent Computing Systems and Applications, WASA 2024

作者： Zhang, Luyi Wang, Yujue Ding, Yong Liang, Hai Yang, Changsong Zheng, Haibin Guangxi Key Laboratory of Cryptography and Information Security School of Computer Science and Information Security Guilin University of Electronic Technology Guilin541004 China Hangzhou Innovation Institute of Beihang University Hangzhou310052 China Institute of Cyberspace Technology HKCT Institute for Higher Education Hong Kong Guangdong Provincial Key Laboratory of Novel Security Intelligence Technologies Shenzhen518055 China Guangxi Engineering Research Center of Industrial Internet Security and Blockchain Guilin University of Electronic Technology Guilin541004 China

ISBN: (纸本)9783031714665

With the rapid proliferation of integration of blockchain and IoT, traditional centralized architectures and single-node processing have been effectively solved, but scalability of blockchain have become inadequate to meet the demands of high-load environments. Sharded blockchain brings an innovative approach to tackle the scalability of blockchain and has the potential to greatly enhance the performance of IoT based on blockchain. This paper introduces CTS towards IoT – complete tree sharding that overlaps shards to enable a little shards to retain records of other shards, facilitating the validation of cross-shard transactions as intra-shard transactions. A tree sharding consensus mechanism that relies on the complete tree architecture is proposed to ensure consistency among interconnected shards during the execution of cross-shard transactions. A prototype for CTS towards IoT is simulated and the findings demonstrate that CTS can enhance transaction throughput by a factor of 1.3 when compared to state of the art layered sharding systems observed in a system consisting of 15 shards and 1500 nodes. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Distributed ledger

来源：评论

学校读者我要写书评

暂无评论

T³Planner: Multi-Phase Planning Across Structure-Constrained Optical, IP, and Routing Topologies

引用

IEEE Journal on Selected Areas in Communications 2025年第5期43卷 1823-1839页

作者： Hao, Yijun Yang, Shusen Li, Fang Zhang, Yifan Zhao, Cong Ren, Xuebin Zhao, Peng Xu, Chenren Wang, Shibo Xi’an Jiaotong University National Engineering Laboratory for Big Data Analytics Xi’an710049 China Xi’an Jiaotong University National Engineering Laboratory for Big Data Analytics Ministry of Education Key Laboratory for Intelligent Networks and Network Security Xi’an710049 China Peking University School of Computer Science Beijing100871 China The Chinese University of Hong Kong Department of Computer Science and Engineering Hong Kong National Engineering Laboratory for Big Data Analytics Xi'an Jiaotong University Xi'an710049 China

network topology planning is an essential multi-phase process to build and jointly optimize the multi-layer network topologies in wide-area networks (WANs). Most existing practices target single-phase/layer planning, and are incapable of satisfying all rigorous topological structure constraints (e.g., dual-homing rings) defined by network standards and operators, especially in large-scale networks. These significantly limit their usability and performance in production networks. We consider a general topology planning problem with typical structure constraints over three essential phases (greenfield, reconfiguration, and site expansion) and topological layers (optical, IP, and routing topologies). We present, T3Planner, a novel practical solver to this problem in production. Specifically, we develop a structure-driven encoder based on graph neural network (GNN) for concise structure encoding, and design a new learning framework with optical-centric layer compression/reconstruction and rule-aided reinforcement learning (RL) for fast convergence and high performance. Extensive experiments on nine real topologies demonstrate that T3Planner scales to large optical networks with hundreds of sites, saves 46.6% cost, and supports 3.12x more demand when compared to related existing approaches. © 1983-2012 IEEE.

关键词： network topology

来源：评论

学校读者我要写书评

暂无评论

iGrasp: An Interactive 2D-3D Framework for 6-DoF Grasp Detection 27th

iGrasp: An Interactive 2D-3D Framework for 6-DoF Grasp Detec...

引用

27th International Conference on Pattern Recognition, ICPR 2024

作者： Jiang, Jian-Jian Wu, Xiao-Ming Chen, Zibo Wei, Yi-Lin Zheng, Wei-Shi School of Computer Science and Engineering Sun Yat-sen University Guangzhou China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education Guangzhou China Guangdong Province Key Laboratory of Information Security Technology Sun Yat-sen University Guangzhou China

ISBN: (纸本)9783031781124

For 6-DoF grasp detection, we aim at introducing a new interactive 2D-3D framework which filters out irrelevant information and makes both modalities collaborate effectively to generate robust grasps and accelerate inference speed greatly. This cannot be accomplished by existing works on learning to grasp that merely utilize 3D point clouds or leverage both 2D textures and 3D point clouds. Our framework is called iGrasp, a novel three-step design between 2D textures and 3D point clouds, where the interaction modelling enhances both modalities. Concretely, we propose the 2D-to-3D interaction to leverage objectness masks generated from 2D textures to filter out target-irrelevant information in 3D point clouds. Then, we introduce the 3D-to-2D interaction to leverage structural priors from 3D point cloud features with cross-attention and cylinder grouping to refine 2D texture features. Finally, we combine the refined 2D texture features and 3D point cloud features for generating high-quality 6-DoF grasp poses. Our experiments on the large-scale real-world dataset, namely GraspNet-1Billion, demonstrate that iGrasp surpasses state-of-the-art methods by 4.66/3.53 mAP on RealSense/Kinect and reduces the inference time by 28%. Real-world experiments further verify the effectiveness of iGrasp. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

UAV Swarm Path Planning for Sensor Data Collection via Double Pre-Partitioned Deep Q-network

引用

IEEE Sensors Journal 2025年

作者： Zhang, Heng Gao, Yuan Wang, Xin He, Yunpeng Yang, Ming Wu, Xiaoming Yang, Chaoqun Cao, Xianghui Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan250014 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan250014 China Jiangsu Ocean University School of Computer Engineering Lianyungang222000 China Southeast University School of Automation Nanjing210096 China

Collision-free path planning is a significant challenge in deploying unmanned aerial vehicle (UAV) swarms for sensor data collection tasks, particularly in uncertain environments. This paper addresses the problem of designing flight strategies for energy-constrained UAV swarms using deep reinforcement learning. We propose a locally-aware double pre-partitioned deep Q-network (DPPDQN) for flight planning of multiple UAVs in large-scale uncertain industrial environments. This algorithm aims to collect data from ground sensors with communication constraints while avoiding mutual collisions. In the proposed algorithm, we first introduce a node pre-partitioning scheme using an improved clustering algorithm, which efficiently reduces the number of access points for UAVs through effective data aggregation. Subsequently, we employ an area pre-partitioning algorithm that segments the detection area into several subregions based on the number of UAVs available for operation, thereby preventing collisions among the UAV swarm during task execution. Finally, we propose a deep Q-network algorithm incorporating a convolutional neural network, which utilizes the local perceptions of UAVs as state inputs to address the 'curse of dimensionality"occurring in large-scale environments. Systematic simulation experiments validate the effectiveness and advantages of the proposed method. © 2025 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Towards Completeness: A Generalizable Action Proposal Generator for Zero-Shot Temporal Action Localization 27th

Towards Completeness: A Generalizable Action Proposal Genera...

引用

27th International Conference on Pattern Recognition, ICPR 2024

作者： Du, Jia-Run Lin, Kun-Yu Meng, Jingke Zheng, Wei-Shi School of Computer Science and Engineering Sun Yat-sen University Guangzhou China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education Guangzhou China Guangdong Province Key Laboratory of Information Security Technology Sun Yat-sen University Guangzhou China

ISBN: (纸本)9783031784439

To address the zero-shot temporal action localization (ZSTAL) task, existing works develop models that are generalizable to detect and classify actions from unseen categories. They typically develop a category-agnostic action detector and combine it with the Contrastive Language-Image Pre-training (CLIP) model to solve ZSTAL. However, these methods suffer from incomplete action proposals generated for unseen categories, since they follow a frame-level prediction paradigm and require hand-crafted post-processing to generate action proposals. To address this problem, in this work, we propose a novel model named Generalizable Action Proposal generator (GAP), which can interface seamlessly with CLIP and generate action proposals in a holistic way. Our GAP is built in a query-based architecture and trained with a proposal-level objective, enabling it to estimate proposal completeness and eliminate the hand-crafted post-processing. Based on this architecture, we propose an Action-aware Discrimination loss to enhance the category-agnostic dynamic information of actions. Besides, we introduce a Static-Dynamic Rectifying module that incorporates the generalizable static information from CLIP to refine the predicted proposals, which improves proposal completeness in a generalizable manner. Our experiments show that our GAP achieves state-of-the-art performance on two challenging ZSTAL benchmarks, i.e., Thumos14 and ActivityNet1.3. Specifically, our model obtains significant performance improvement over previous works on the two benchmarks, i.e., +3.2% and +3.4% average mAP, respectively. The code is available at https://***/Run542968/GAP. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

Privacy-Preserving Face Recognition with Adaptive Generative Perturbations 27th

Privacy-Preserving Face Recognition with Adaptive Generative...

引用

27th International Conference on Pattern Recognition, ICPR 2024

作者： Zhang, Delong Peng, Yixing Wu, Ancong Zheng, Wei-Shi School of Computer Science and Engineering Sun Yat-sen University Guangzhou China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education Guangzhou China Guangdong Province Key Laboratory of Information Security Technology Sun Yat-sen University Guangzhou China

ISBN: (纸本)9783031783401

For online face recognition services, the potential leakage of facial features and reconstruction techniques gives malicious attackers the opportunity to reconstruct face images, raising public concern about privacy. Previous privacy-preserving face recognition methods either require retraining the face recognition model or iterative perturbation that increases inference time. To overcome these limitations, we propose an efficient plug-and-play method that crafts Adaptive Generative perturbations for frozen Face recognition model (AGFace) to defend the reconstruction attacks. To generate perturbation with a single forward for shallow features extracted by frozen recognition model, we learn a Perturbation Generator to efficiently mine the adversarial perturbations by simultaneously minimizing the perturbation and maximizing the reconstruction error of a proxy reconstructor. To achieve privacy-utility trade-off, we propose the Adaptive Channel Selector to identify top-k reconstruction-sensitive channels for the features. By selecting these channels for perturbation, the dominant visual privacy information is protected with reconstruction-insensitive discriminative information preserved. Extensive experiments demonstrate that AGFace achieves state-of-the-art performance in terms of both privacy and utility among retraining-free methods and is comparable to retraining-dependent methods. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：