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

IAENG International Journal of computer science 2025年第1期52卷 38-45页

作者： Li, Wanji Liu, Qiangbin Zhu, Yi School of Computer Science and Communication Engineering Jiangsu University Zhenjiang China School of Computer Science and Communication Engineering Jiangsu University Zhenjiang China School of Computer Science and Communication Engineering the Dean of Department of Communication Engineering Jiangsu University Zhenjiang China

Named in-network computing service (NICS) is a potential computing paradigm emerged recently. Benefitted from the characteristics of named addressing and routing, NICS can be flexibly deployed on NDN router side and provide nearby computing service to Internet users. But the NICS feature of dynamic deployment also causes serious security risk of access control. How to independently check out the subscription relationship between requester and requested computing service on NICS side become a challenge. To solve this problem, we propose a novel certificateless signature-based access control scheme (CS-ACS) in this paper. In CS-ACS, the entire user public-private key pairs consist of two parts, user side and source server side. Where, the user public-private key pairs (server side) are generated according to the user ID, service subscription relationship and subscription expiration time. Based on this special design, when authorized user signs the interest packet of invoking specific service using its private key, the NICS can verify the signature then check out whether the requester is a valid subscriber and the subscription is expired or not. Simulation results show that, comparing with fundamental solutions, CS-ACS can avoid extra secret key storage cost on NICS side and markedly shorten authentication delay. © (2025), (International Association of Engineers). All rights reserved.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Multimodal and Temporal Graph Fusion Framework for Advanced Phishing Website Detection

引用

IEEE Access 2025年 13卷 74128-74146页

作者： Kavya, S. Sumathi, D. Vellore Institute of Technology School of Computer Science Engineering and Information Systems Vellore India

Phishing attacks are among the persistent threats that are dynamically evolving and demand advanced detection mechanisms to counter more sophisticated techniques. Traditional detection approaches are usually based on single-modal features or static analysis, failing to capture the complex, multi-faceted nature of phishing websites and their dynamic behaviors. Thus, we present a robust Multi-Modal and Temporal Graph Fusion Framework integrating advanced learning paradigms that enhance accuracy and adaptability in phishing detection. Our work proposes four brand-new methods: Multi-Modal Hypergraph Fusion Network (MM-HFN), Temporal Graph Neural Network with Attention (TGNN-Att), Federated Graph Contrastive Learning Network (FGCL-Net), and Multi-Modal Temporal Hypergraph Fusion Network (MMTHF-Net). MM-HFN leverages hypergraphs to capture complex, high-order relationships at textual levels (BERT) and graph-based features versus visual ones (CNNs) for an accuracy in the 95–97% range. TGNN-Att addresses temporal variations in phishing behavior by using attention-enhanced temporal graph networks and LSTMs, providing dynamic detection with 94–96% accuracy. FGCL-Net ensures privacy-preserving learning across decentralized datasets through federated contrastive learning, achieving 93–95% accuracy while safeguarding data privacy. Finally, MMTHF-Net fuses multi-modal and temporal features into a dynamic hypergraph framework, achieving state-of-the-art accuracy of 96–98% with an F1-score of 0.97. These approaches together allow for exact, real-time phishing detection by capturing static and temporal behaviors, high-order relationships, and cross-modal features. The framework proposed demonstrates significant improvements compared to the state of the art, eliminating the shortcomings of single-modality and static analysis while offering scalability, privacy, and adaptability levels. © 2013 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

A Bearing Fault Diagnosis Method Based on Hierarchical Belief Rule Base With Power Set

引用

IEEE Access 2025年 13卷 70324-70339页

作者： Yan, Xingchi Li, Ning Yu, Yan He, Wei Wang, Duo Harbin Normal University School of Computer Science and Information Engineering Harbin150025 China

As one of the most critical components in rotating machinery, bearings play a vital role in ensuring the stable operation of the equipment. Due to the influence of complex environments, there is uncertainty in the process of bearing fault diagnosis. The Belief Rule Base (BRB) is a modeling method that can effectively handle uncertainty issues. However, in the process of bearing fault diagnosis, with the increase of bearing use time, bearing wear will become more and more serious. When extracting data feature values, different types of fault feature values have similarities, which makes it difficult to distinguish and represent the type of fault in the diagnosis process, resulting in local ignorance. The traditional BRB model cannot solve the local ignorance problem, and with the increase of the number of rules, it will lead to the explosion of rule combinations. To solve the above problems, this paper proposes a Hierarchical Belief Rule Base with power set, Firstly, a Hierarchical Belief Rule Base (HBRB) model is selected to solve the problem of combination rule explosion, and then HBRB is extended to the power set identification framework. Because the power set recognition framework can more effectively represent the ignorant information in the complex system, and solve the local ignorance problem in the bearing fault diagnosis, then, the evidential reasoning algorithm is used to establish the reasoning process of the model. Finally, the parameters of the model are optimized using the projection covariance matrix adaptive evolutionary strategy algorithm. The experimental results show that the proposed method can identify different fault categories with high accuracy, effectively solve the local ignorance problem in bearing faults diagnosis, and has good generalization ability. © 2013 IEEE.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

An Improved Graph Partitioning Algorithm Based Approach for Workflow Offloading in a Fog Environment

引用

Journal of The Institution of Engineers (India): Series B 2025年第2期106卷 623-634页

作者： Mahajan, Neetu Narang Kaur, Parmeet Department of Computer Science and Engineering Jaypee Institute of Information Technology Noida India

The paper addresses the critical problem of application workflow offloading in a fog environment. Resource constrained mobile and Internet of Things devices may not possess specialized hardware to run complex workflows locally and hence, need to offload these tasks to fog nodes. As compared to cloud-based servers, fog nodes can provide responses in a more-timely manner and are preferred for latency-sensitive applications. Workflow applications are characterized by inter-task dependencies and hence, can be readily represented as directed acyclic graphs. Therefore, the proposed offloading solution approach utilizes an improved graph partitioning algorithm based on the Louvain community detection algorithm. The aim of the algorithm is to partition the workflow graph in such a manner that the workflow tasks having high communication costs between them are transferred or offloaded to the same fog node. The benefits of the proposed algorithm have been verified by simulation experiments where it was observed that it results in a lower makespan as compared to the related approaches. © The Institution of Engineers (India) 2024.

关键词： Fog

来源：评论

学校读者我要写书评

暂无评论

HCBiL-DMN: an effective food infestation detection from stored food grains using deep learning model

引用

Multimedia Tools and Applications 2025年第14期84卷 14047-14070页

作者： Vedavathi, N. Suhas Bharadwaj, R. Department of Computer Science and Engineering Vidyavardhaka College of Engineering Karnataka Mysuru570002 India Department of Information Science and Engineering The National Institute of Engineering Karnataka Mysuru570008 India

Food Infestation Detection is more important for food safety and health concerns. It is a challenging task to separate the grains into infested or non-infested. It is found that in the existing system, there is no effective approach for the early detection of pest populations and for classifying crops as infested or non-infested. Therefore, the identification and categorization of early-stage grain infestations is in high demand. To address the above problem, this research presents a better technique for detecting and classifying infested and non-infested grains. Initially, the maize, wheat and olive image datasets are collected, which are then pre-processed using data normalization and adaptive wiener filtering (AdwF) approach to improve the excellence of the input images. Image quality helps in achieving better performance and also helps in analyzing the quality of food grains effectively. Feature extraction is done using the Dense Residual Pyramidal Dilated Convolution Network (DR-PDCNet) technique, and feature selection is done using the Linear Discriminant Coati Optimization (LD-CoA) algorithm. The Hybrid Convolutional Bi-LSTM based Deep Maxout Network (HCBiL-DMN) model is used to detect the infected food grains in the preserved food grains with high accuracy. This research explores the potential and future possibilities for using technology to ensure the quality, assessment, and monitoring of nutritional grains during storage. The performance results are achieved with 98.3% accuracy, 99.12% recall, 98.65% precision, 98.02% MCC, and 99.32% F1 score. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

The Security of Using Large Language Models:A Survey With Emphasis on ChatGPT

引用

IEEE/CAA Journal of Automatica Sinica 2025年第1期12卷 1-26页

作者： Wei Zhou Xiaogang Zhu Qing-Long Han Lin Li Xiao Chen Sheng Wen Yang Xiang the School of Science Computing and Engineering Technologies Swinburne University of Technology IEEE the School of Computer and Mathematical Sciences the University of Adelaide Adelaide the Faculty of Science and Engineering Southern Cross University the School of Information and Physical Sciences the University of Newcastle

ChatGPT is a powerful artificial intelligence(AI)language model that has demonstrated significant improvements in various natural language processing(NLP) tasks. However, like any technology, it presents potential security risks that need to be carefully evaluated and addressed. In this survey, we provide an overview of the current state of research on security of using ChatGPT, with aspects of bias, disinformation, ethics, misuse,attacks and privacy. We review and discuss the literature on these topics and highlight open research questions and future *** this survey, we aim to contribute to the academic discourse on AI security, enriching the understanding of potential risks and mitigations. We anticipate that this survey will be valuable for various stakeholders involved in AI development and usage, including AI researchers, developers, policy makers, and end-users.

关键词： Artificial intelligence (AI) ChatGPT large language models (LLMs) security

来源：评论

学校读者我要写书评

暂无评论

Robust federated contrastive recommender system against targeted model poisoning attack

引用

science China(information sciences) 2025年第4期68卷 50-65页

作者： Wei YUAN Chaoqun YANG Liang QU Guanhua YE Quoc Viet Hung NGUYEN Hongzhi YIN School of Electrical Engineering and Computer Science The University of Queensland School of Information and Communication Technology Griffith University Deep Neural Computing Company Limited

Federated recommender systems(FedRecs) have garnered increasing attention recently, thanks to their privacypreserving benefits. However, the decentralized and open characteristics of current FedRecs present at least two ***, the performance of FedRecs is compromised due to highly sparse on-device data for each client. Second, the system's robustness is undermined by the vulnerability to model poisoning attacks launched by malicious users. In this paper, we introduce a novel contrastive learning framework designed to fully leverage the client's sparse data through embedding augmentation, referred to as CL4FedRec. Unlike previous contrastive learning approaches in FedRecs that necessitate clients to share their private parameters, our CL4FedRec aligns with the basic FedRec learning protocol, ensuring compatibility with most existing FedRec implementations. We then evaluate the robustness of FedRecs equipped with CL4FedRec by subjecting it to several state-of-the-art model poisoning attacks. Surprisingly, our observations reveal that contrastive learning tends to exacerbate the vulnerability of FedRecs to these attacks. This is attributed to the enhanced embedding uniformity, making the polluted target item embedding easily proximate to popular items. Based on this insight, we propose an enhanced and robust version of CL4FedRec(rCL4FedRec) by introducing a regularizer to maintain the distance among item embeddings with different popularity levels. Extensive experiments conducted on four commonly used recommendation datasets demonstrate that rCL4FedRec significantly enhances both the model's performance and the robustness of FedRecs.

关键词： federated recommender system contrastive learning model poisoning attack and defense

来源：评论

学校读者我要写书评

暂无评论

Cardinality estimation for property graph queries with gated learning approach on the graph database

引用

Multimedia Tools and Applications 2025年第11期84卷 9159-9183页

作者： He, Zhenzhen Yu, Jiong Du, Xusheng Guo, Binglei Li, Ziyang Li, Zhe School of Information Science and Engineering Xinjiang University Urumqi China School of Computer Engineering Hubei University of Arts and Science Xiangyang China School of Software Xinjiang University Urumqi China Department of Electronic and Information Engineering The Hong Kong Polytechnic University Hong Kong

With the increasing complexity of graph query processing tasks, it is difficult for users to obtain the accurate cardinality before or during the execution of query tasks. Accurate estimate query cardinality is crucial for property graph data model, which usually involves entities, multiple joins, and various types of properties (key-value pairs). While learning-based approaches have been used in query optimization, estimating the cardinality of property graph queries is still particularly challenging. In this paper, we first formally represent each property graph query and then divide the estimation process into three phases: query execution, training data generation, and model training. Secondly, we construct a data pool to deal the updating query workloads in the training data generation phase. Thirdly, we utilize the gate mechanism to develop a cardinality estimation framework based on deep learning neural networks for property graph queries in the Neo4j database, and we propose a hybrid loss function to optimize the training process. Finally, we adopt a method of pre-aggregating the underlying data to speed up query execution in the first phase. The result of the experiment on two real-world datasets shows that our optimized methods can effectively improve the estimation accuracy of the deep learning model, and our query estimator outperforms other deep learning models compared in terms of estimation accuracy. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

Local Search-Based Anytime Algorithms for Continuous Distributed Constraint Optimization Problems

引用

IEEE/CAA Journal of Automatica Sinica 2025年第1期12卷 288-290页

作者： Xin Liao Khoi Hoang Xin Luo the College of Computer and Information Science Southwest University the Department of Computer Science and Engineering Washington University in St.Louis IEEE

Dear Editor,The distributed constraint optimization problems(DCOPs) [1]-[3]provide an efficient model for solving the cooperative problems of multi-agent systems, which has been successfully applied to model the real-world problems like the distributed scheduling [4], sensor network management [5], [6], multi-robot coordination [7], and smart grid [8]. However, DCOPs were not well suited to solve the problems with continuous variables and constraint cost in functional form, such as the target tracking sensor orientation [9], the air and ground cooperative surveillance [10], and the sensor network coverage [11].

关键词：

来源：评论

学校读者我要写书评

暂无评论

Skeleton-Aware Graph-Based Adversarial Networks for Human Pose Estimation from Sparse IMUs

引用

ACM Transactions on Multimedia Computing, Communications and Applications 2025年第4期21卷 1-22页

作者： Chen, Kaixin Zhang, Lin Wang, Zhong Zhao, Shengjie Zhou, Yicong School of Software Engineering Tongji University Shanghai China Department of Computer and Information Science University of Macau Macau China

Recently, sparse-inertial human pose estimation (SI-HPE) with only a few IMUs has shown great potential in various fields. The most advanced work in this area achieved fairish results using only six IMUs. However, there are still two major issues that remain to be addressed. First, existing methods typically treat SI-HPE as a temporal sequential learning problem and often ignore the important spatial prior of skeletal topology. Second, there are far more synthetic data in their training data than real data, and the data distribution of synthetic data and real data is quite different, which makes it difficult for the model to be applied to more diverse real data. To address these issues, we propose "Graph-based Adversarial Inertial Poser (GAIP),"which tracks body movements using sparse data from six IMUs. To make full use of the spatial prior, we design a multi-stage pose regressor with graph convolution to explicitly learn the skeletal topology. A joint position loss is also introduced to implicitly mine spatial information. To enhance the generalization ability, we propose supervising the pose regression with an adversarial loss from a discriminator, bringing the ability of adversarial networks to learn implicit constraints into full play. Additionally, we construct a real dataset that includes hip support movements and a synthetic dataset containing various motion categories to enrich the diversity of inertial data for SI-HPE. Extensive experiments demonstrate that GAIP produces results with more precise limb movement amplitudes and relative joint positions, accompanied by smaller joint angle and position errors compared to state-of-the-art counterparts. The datasets and codes are publicly available at https://***/GAIP/. © 2025 Copyright held by the owner/author(s). Publication rights licensed to ACM.

关键词： Network theory (graphs)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：