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

34th ACM Web Conference, WWW 2025

作者： Li, Ken Shi, Bin Wei, Jiazhe Dong, Bo School of Computer Science and Technology Xi’an Jiaotong University Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi’an China School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi’an China School of Distance Education Xi’an Jiaotong University Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi’an China

ISBN: (纸本)9798400712746

Federated Graph Learning (FedGL) is an emerging Federated Learning (FL) framework that learns the graph data from various clients to train better Graph Neural Networks(GNNs) model. Owing to concerns regarding the security of such framework, numerous studies have attempted to execute backdoor attacks on FedGL, with a particular focus on distributed backdoor attacks. However, all existing methods posting distributed backdoor attack on FedGL only focus on injecting distributed backdoor triggers into the training data of each malicious client, which will cause model performance degradation on original task and is not always effective when confronted with robust federated learning defense algorithms, leading to low success rate of attack. What’s more, the backdoor signals introduced by the malicious clients may be smoothed out by other clean signals from the honest clients, which potentially undermining the performance of the attack. To address the above significant shortcomings, we propose a non-intrusive graph distributed backdoor attack(NI-GDBA) that does not require backdoor triggers to be injected in the training data. Our attack trains an adaptive perturbation trigger generator model for each malicious client to learn the natural backdoor from the GNN model downloading from the server with the malicious client’s local data. In contrast to traditional distributed backdoor attacks on FedGL via trigger injection in training data, our attack on different datasets such as Molecules and Bioinformatics have higher attack success rate, stronger persistence and stealth, and has no negative impact on the performance of the global GNN model. We also explore the robustness of NI-GDBA under different defense strategies, and based on our extensive experimental studies, we show that our attack method is robust to current federated learning defense methods, thus it is necessary to consider non-intrusive distributed backdoor attacks on FedGL as a novel threat that requires custom d

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

StoryLLaVA: Enhancing Visual Storytelling with Multi-Modal Large Language Models 31

StoryLLaVA: Enhancing Visual Storytelling with Multi-Modal L...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Yang, Li xiao, Zhiding Huang, Wenxin Zhong, xian Hubei Key Laboratory of Big Data Intelligent Analysis and Application School of Computer Science and Information Engineering Hubei University China Hubei Key Laboratory of Transportation Internet of Things School of Computer Science and Artificial Intelligence Wuhan University of Technology China

ISBN: (纸本)9798891761964

The rapid development of multi-modal large language models (MLLMs) has positioned visual storytelling as a crucial area in content creation. However, existing models often struggle to maintain temporal, spatial, and narrative coherence across image sequences and frequently lack the depth and engagement of human-authored stories. To address these challenges, we propose Story with Large Language and vision Assistant (StoryLLaVA), a novel framework for enhancing visual storytelling. Our approach introduces a Topic-Driven Narrative Optimizer (TDNO) that improves both the training data and MLLM models by integrating image descriptions, topic generation, and GPT-4-based refinements. Furthermore, we employ a preference-based ranked story sampling method that aligns model outputs with human storytelling preferences through positive-negative pairing. These two phases of the framework differ in their training methods: the former uses supervised fine-tuning, while the latter incorporates reinforcement learning with positive and negative sample pairs. Experimental results demonstrate that StoryLLaVA outperforms current models in visual relevance, coherence, and fluency, with LLM-based evaluations confirming the generation of richer and more engaging narratives. The enhanced dataset and model are available at https://***/XxxZzD/StoryLLaVA. © 2025 Association for Computational Linguistics.

关键词：

来源：评论

学校读者我要写书评

暂无评论

The Research of Facial Expression Image Recognition Method Based on MobileNetV3

The Research of Facial Expression Image Recognition Method B...

引用

2024 International Conference on Remote Sensing, Mapping, and Image Processing, RSMIP 2024

作者： Zou, xinyue Liu, Chenguang Xu, Xuebin Zhang, Rong School of Computer Science and Technology Xi'an University of Posts &Telecommunications Shaanxi Xi'an China China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Shaanxi Xi'an China

ISBN: (纸本)9781510680012

The information conveyed through facial expressions accounts for a large proportion of the total information and can effectively express people's intentions and emotions. Facial expression recognition has laid the foundation for fields such as human-computer interaction, facial emotion prediction, and artificial intelligence, and has become an important research object in computer vision. This article proposes a facial expression recognition method based on the MobileNetV3 network for face images from different angles. The method uses depth-wise separable convolution, introduces attention mechanism and new activation function to update blocks, and redesigns the time-consuming layer structure at the end. The dataset used in this article is the KDEF, which includes 4, 900 color images with a size of 562*762 pixels. Through extensive experiments, it has been shown that the proposed structure in this article improves the accuracy of facial expression recognition from different angles compared to other network structures, achieving 94.7%, and has a smaller parameter count, which is beneficial for further research on facial expressions. © 2024 SPIE.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

Bidirectional Identity-Based Inner-Product Functional Re-Encryption in Vaccine data Sharing

引用

IEEE Transactions on Cloud Computing 2025年第02期13卷 617-628页

作者： Wang, Jing Zhou, Yanwei Zhu, Yasi Liu, Zhiquan Yang, Bo Zhang, Mingwu Shaanxi Normal University School of Computer Science Xi'an710119 China Sichuan University Key Laboratory of Data Protection and Intelligent Management Ministry of Education China Jinan University College of Cyber Security Guangzhou510632 China Hubei University of Technology School of Computer Wuhan430068 China

With the development of cloud computing, more and more data is stored in cloud servers, which leads to an increasing degree of privacy of data stored in cloud servers. For example, in the critical domain of medical vaccine trials, where public health outcomes hinge on the analysis of sensitive patient data, the imperative to safeguard privacy has never been more pronounced. Traditional encryption methods, though effective at protecting data, often expose vulnerabilities during decryption and lack the ability to support granular data access and computation. One-way re-encryption schemes further impede the agility of data sharing, which is indispensable for the collaborative efforts of research institutions. To address these limitations, we propose a novel bidirectional re-encryption scheme for inner-product functional encryption (IPFE). Our scheme secures data while allowing computation and sharing in an encrypted state, preserving patient privacy without hindering research. By harnessing inner-product functional encryption, our approach allows authorized researchers to extract valuable insights from encrypted data, significantly enhancing privacy protections. Our scheme's security is predicated on the $l$-ABDHE (augmented bilinear Diffie-Hellman exponent) assumption, ensuring robustness against chosen plaintext attacks within the standard model. This foundation not only secures the data but also yields compact ciphertext length, minimizing storage demands. We introduce a protocol specifically designed for medical vaccine trials, which leverages our bidirectional IB-IPFRE (Identity-Based Inner-Product Functional Re-Encryption) scheme. This protocol enhances data security, supports collaborative research, and maintains patient privacy. Its application in vaccine trials demonstrates the scheme's effectiveness in protecting sensitive information while enabling critical research insights. © 2013 IEEE.

关键词： Encryption Vaccines data Privacy Iron Security Protection Vectors Protocols Cloud Computing Access Control Inner Product Function Encryption Identity Based Encryption CPA Security Bidirectional Re Encryption data Sharing Research Institute Privacy Of data Collaborative Research data Security Sensitive data Privacy Protection Patient Privacy Encrypted data Chosen Plaintext Computational Cost Medical data Vector Of Length Access Control Vector Production Original Information Secret key Public key Security Requirements Bilinear Map Decryption Process key Generation Information Encryption Round Of Experiments Decryption Algorithm Encryption And Decryption Vaccine Information Evaluation Of Drug Efficacy Public Parameters Cryptographic Primitives

来源：评论

学校读者我要写书评

暂无评论

Spatial-Temporal Semantic Feature Interaction Network for Semantic Change Detection in Remote Sensing Images

引用

IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing 2025年 18卷 12090-12102页

作者： Zhang, Yuhang Zhang, Wuxia Ding, Songtao Wu, Siyuan Lu, xiaoqiang Xi'an University of Posts and Telecommunications Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing School of Computer Science and Technology Xi'an710121 China Xi'an University of Technology College of Computer Science and Engineering Shaanxi Xi'an710048 China Fuzhou University College of Physics and Information Engineering Fuzhou350002 China

Semantic Change Detection (SCD) in Remote Sensing Images (RSI) aims to identify changes in the type of Land Cover/Land Use (LCLU) corresponding to changed areas in RSI. The "from-to" information of the acquired image has more profound practical significance than Binary Change Detection (BCD). However, most deep learning-based SCD algorithms do not fully exploit the spatial-temporal information of multi-level features, leading to challenges in extracting LCLU features in complex changing scenes. To address these issues, we propose a Spatial-Temporal Semantic Feature Interaction Network (STS-FINet) to improve the performance of SCD in RSI. The proposed STS-FINet comprises a Multi-Scale Feature Extraction Encoder (MS-FEE), a Transformer-based Multi-Level Feature Interaction module (TML-FI), and a Multi-Level Feature Fusion Decoder (ML-FFD). The MS-FEE extracts deep semantic and differential information from the RSI. The TML-FI is designed to mine the spatial-temporal information by extracting long-range dependencies and spatial information from multi-level features to improve spatial perception. Moreover, Mixed Spatial Reasoning Convolution block (MixSrc) is presented to enrich the spatial information by extracting the multi-scale features, thus improving the model's capability to interpret complex changing scenes. Finally, ML-FFD integrates the multi-level features, resulting in the generation of the semantic change map. The effectiveness of the proposed STS-FINet is verified on two high-resolution RSI datasets. Experimental results show that the proposed STS-FINet achieves better change detection performance than SOTA methods. © 2008-2012 IEEE.

关键词： Change detection

来源：评论

学校读者我要写书评

暂无评论

Hypertensive Pulse Diagnosis Method Based on Hilbert-Huang Transform and Feature Fusion Dimensionality Reduction 5

Hypertensive Pulse Diagnosis Method Based on Hilbert-Huang T...

引用

5th International Conference on Artificial Intelligence and Pattern Recognition, AIPR 2022

作者： Fan, Lin Yao, Ruiling Wang, Zhongmin School of Computer Science and Technology Xi'an University of Posts and Telecommunications Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi 'An Key Laboratory of Big Data and Intelligent Computing China School of Computer Science and Technology Xi'an University of Posts and Telecommunications China

ISBN: (纸本)9781450396899

With the development of artificial intelligence, pulse diagnosis has been standardized and objectified. However, there is a lack of research on the extraction and dimensionality reduction of hypertensive pulse features. We propose two effective features for distinguishing pulses of disease samples and a fusion dimensionality reduction method that combines linear and nonlinear dimensionality reduction. The results show that the proposed features and dimensionality reduction method make the classification accuracy of hypertension pulse feature reach 94.23%, and the training time of the classifier is reduced by 47 seconds, which improves the performance in terms of both accuracy and time. © 2022 ACM.

关键词： Hilbert-Huang transform

来源：评论

学校读者我要写书评

暂无评论

A Multi-Objective Particle Swarm Optimization Algorithm Based on Decomposition and Multi-Selection Strategy

引用

computers, Materials & Continua 2025年第1期82卷 997-1026页

作者： Li Ma Cai Dai xingsi Xue Cheng Peng School of Computer Science Shaanxi Normal UniversityXi’an710119China Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of TechnologyFuzhou350118China Information Construction and Management Center and Institute of Artificial Intelligence and Educational New Productivity Ningxia Normal UniversityGuyuan756099China

The multi-objective particle swarm optimization algorithm(MOPSO)is widely used to solve multi-objective optimization *** the article,amulti-objective particle swarm optimization algorithmbased on decomposition and multi-selection strategy is proposed to improve the search ***,two update strategies based on decomposition are used to update the evolving population and external archive,***,a multiselection strategy is *** first strategy is for the subspace without a non-dominated *** the neighbor particles,the particle with the smallest penalty-based boundary intersection value is selected as the global optimal solution and the particle far away fromthe search particle and the global optimal solution is selected as the personal optimal solution to enhance global *** second strategy is for the subspace with a non-dominated *** the neighbor particles,two particles are randomly selected,one as the global optimal solution and the other as the personal optimal solution,to enhance local *** third strategy is for Pareto optimal front(PF)discontinuity,which is identified by the cumulative number of iterations of the subspace without non-dominated *** the subsequent iteration,a new probability distribution is used to select from the remaining subspaces to ***,an adaptive inertia weight update strategy based on the dominated degree is designed to further improve the search ***,the proposed algorithmis compared with fivemulti-objective particle swarm optimization algorithms and five multi-objective evolutionary algorithms on 22 test *** results show that the proposed algorithm has better performance.

关键词： Multi-objective optimization multi-objective particle swarm optimization decomposition multi-selection strategy

来源：评论

学校读者我要写书评

暂无评论

Towards Exploratory Query Optimization for Template-Based SQL Workloads 40

Towards Exploratory Query Optimization for Template-Based SQ...

引用

40th IEEE International Conference on data Engineering, ICDE 2024

作者： Feng, Jieming Li, Zhanhuai Chen, Qun School of Computer Science and Engineering Northwestern Polytechnical University Shaanxi Xi'an China Key Laboratory of Big Data Storage and Management Ministry of Industry and Information Technology Northwestern Polytechnical University Shaanxi Xi'an China

ISBN: (纸本)9798350317152

SQL query optimization aims to choose an optimal Query Execution Plan (QEP) for a query. The existing optimizers usually choose the plan with the minimal execution cost. However, in some real scenarios (e.g., cloud OLAP), it is a business imperative to minimize the cost of an entire workload. Unfortunately, the greedy optimizers are prone to generating execution plans that are only suboptimal from the workload perspective. In this paper, we propose a novel QEP optimization approach for template-based SQL that aims to minimize the execution cost of an entire workload instead of individual queries. While choosing an execution plan for a query, the proposed approach considers a plan's impact on future query execution as well as its own execution cost. We first define an exploratory metric, Plan Exploration Value (PEV), to measure a plan's potential benefit to future query execution. Then, we model exploratory plan selection as an optimization problem with cost constraints, and present an efficient algorithm based on dynamic programming for its solution. Finally, we evaluate the performance of the proposed approach by a comparative study on benchmark workloads. Our extensive experiments have shown that it generates more efficient workload execution plans than the existing alternatives. © 2024 IEEE.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Using Depth-Enhanced Spatial Transformation for Student Gaze Target Estimation in Dual-View Classroom Images

Using Depth-Enhanced Spatial Transformation for Student Gaze...

引用

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

作者： Miao, Haonan Zhao, Peizheng Sun, Yuqi Nan, Fang Zhang, xiaolong Wu, Yaqiang Tian, Feng School of Computer Science and Technology Xi'an Jiaotong University Xi'an710049 China Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi'an Jiaotong University Xi'an710049 China School of Advanced Technology Xi'an Jiaotong-Liverpool University Suzhou215123 China Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University Xi'an710049 China

ISBN: (纸本)9798350368741

Dual-view gaze target estimation in classroom environments has not been thoroughly explored. Existing methods lack consideration of depth information, primarily focusing on 2D image information and neglecting the latent 3D spatial context, which could lead to suboptimal transformation and cause the gaze cone to intersect with an incorrect object. This paper introduces a novel dual-view gaze target estimation method tailored for classroom settings, leveraging depth-enhanced spatial transformations. By formulating a depth-enhanced 2D space, our method uses depth-enhanced spatial transformation to accurately project students' gaze cones to the teacher-oriented image. Additionally, we collected a dataset named DVSGE, specifically for student gaze target estimation in dual-view classroom images. Experimental results demonstrate significant performance improvements of 9.8% in AUC and 19.9% in L2-Distance for our method, surpassing existing methods. © 2025 IEEE.

关键词： classroom depth-enhanced 2D space dual-view gaze target estimation spatial transformation

来源：评论

学校读者我要写书评

暂无评论

基于数据挖掘技术的税务风险检测方法评述

引用

Engineering 2024年第3期34卷 43-59页

作者： Qinghua Zheng Yiming Xu Huixiang Liu Bin Shi Jiaxiang Wang Bo Dong School of Computer Science and Technology Xi’an Jiaotong UniversityXi’an 710049China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong UniversityXi’an 710049China School of Distance Education Xi’an Jiaotong UniversityXi’an 710049China

Tax risk behavior causes serious loss of fiscal revenue,damages the country’s public infrastructure,and disturbs the market economic order of fair *** recent years,tax risk detection,driven by information technology such as data mining and artificial intelligence,has received extensive *** promote the high-quality development of tax risk detection methods,this paper provides the first comprehensive overview and summary of existing tax risk detection methods *** specifi-cally,it first discusses the causes and negative impacts of tax risk behaviors,along with the development of tax risk *** then focuses on data-mining-based tax risk detection methods utilized around the *** on the different principles employed by the algorithms,existing risk detection methods can be divided into two categories:relationship-based and non-relationship-based.A total of 14 risk detection methods are identified,and each method is thoroughly explored and ***,four major technical bottlenecks of current data-driven tax risk detection methods are analyzed and discussed,including the difficulty of integrating and using fiscal and tax fragmented knowledge,unexplainable risk detection results,the high cost of risk detection algorithms,and the reliance of existing algorithms on labeled *** investigating these issues,it is concluded that knowledge-guided and datadriven big data knowledge engineering will be the development trend in the field of tax risk in the future;that is,the gradual transition of tax risk detection from informatization to intelligence is the future development direction.

关键词： Tax risk detection data mining Knowledge guide Informatization Intellectualization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：