检索结果-南通市图书馆

A recover-then-discriminate framework for robust anomaly detection

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science China(Information sciences) 2025年第04期68卷 300-318页

作者： Peng XING Dong ZHANG Jinhui TANG Zechao LI School of computer science and Engineering Nanjing University of Science and Technology department of Electronic and computer Engineering The Hong Kong University of Science and Technology

Anomaly detection(AD) has been extensively studied and applied across various scenarios in recent years. However, gaps remain between the current performance and the desired recognition accuracy required for practical *** paper analyzes two fundamental failure cases in the baseline AD model and identifies key reasons that limit the recognition accuracy of existing approaches. Specifically, by Case-1, we found that the main reason detrimental to current AD methods is that the inputs to the recovery model contain a large number of detailed features to be recovered, which leads to the normal/abnormal area has not/has been recovered into its original state. By Case-2, we surprisingly found that the abnormal area that cannot be recognized in image-level representations can be easily recognized in the feature-level representation. Based on the above observations, we propose a novel recover-then-discriminate(ReDi) framework for *** takes a self-generated feature map(e.g., histogram of oriented gradients) and a selected prompted image as explicit input information to address the identified in Case-1. Additionally, a feature-level discriminative network is introduced to amplify abnormal differences between the recovered and input representations. Extensive experiments on two widely used yet challenging AD datasets demonstrate that ReDi achieves state-of-the-art recognition accuracy.

关键词： recovery network HOG prompt discriminative network self-correlation loss anomaly detection

Hybrid Deep Learning Approach for Automating App Review Classification:Advancing Usability Metrics Classification with an Aspect-Based Sentiment Analysis Framework

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

computers, Materials & Continua 2025年第1期82卷 949-976页

作者： Nahed Alsaleh Reem Alnanih Nahed Alowidi department of computer science Faculty of Computing and Information TechnologyKing Abdulaziz UniversityJeddah21589Saudi Arabia department of computer science College of Computer Science and EngineeringUniversity of HailHail81451Saudi Arabia

App reviews are crucial in influencing user decisions and providing essential feedback for developers to improve their *** the analysis of these reviews is vital for efficient review *** traditional machine learning(ML)models rely on basic word-based feature extraction,deep learning(DL)methods,enhanced with advanced word embeddings,have shown superior *** research introduces a novel aspectbased sentiment analysis(ABSA)framework to classify app reviews based on key non-functional requirements,focusing on usability factors:effectiveness,efficiency,and *** propose a hybrid DL model,combining BERT(Bidirectional Encoder Representations from Transformers)with BiLSTM(Bidirectional Long Short-Term Memory)and CNN(Convolutional Neural Networks)layers,to enhance classification *** analysis against state-of-the-art models demonstrates that our BERT-BiLSTM-CNN model achieves exceptional performance,with precision,recall,F1-score,and accuracy of 96%,87%,91%,and 94%,*** contributions of this work include a refined ABSA-based relabeling framework,the development of a highperformance classifier,and the comprehensive relabeling of the Instagram App Reviews *** advancements provide valuable insights for software developers to enhance usability and drive user-centric application development.

关键词： Requirements Engineering(RE) app review analysis usabilitymetrics hybrid deep learning BERT-BiLSTM-CNN

Labeling-based centrality approaches for identifying critical edges on temporal graphs

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Frontiers of computer science 2025年第2期19卷 89-104页

作者： Tianming ZHANG Jie ZHAO Cibo YU Lu CHEN Yunjun GAO Bin CAO Jing FAN Ge YU School of computer science and Technology Zhejiang University of TechnologyHangzhou 310023China School of computer science and Technology Zhejiang UniversityHangzhou 310013China department of computer science Northeastern UniversityShenyang 110819China

Edge closeness and betweenness centralities are widely used path-based metrics for characterizing the importance of edges in *** general graphs,edge closeness centrality indicates the importance of edges by the shortest distances from the edge to all the other *** betweenness centrality ranks which edges are significant based on the fraction of all-pairs shortest paths that pass through the ***,extensive research efforts go into centrality computation over general graphs that omit time ***,numerous real-world networks are modeled as temporal graphs,where the nodes are related to each other at different time *** temporal property is important and should not be neglected because it guides the flow of information in the *** state of affairs motivates the paper’s study of edge centrality computation methods on temporal *** introduce the concepts of the label,and label dominance relation,and then propose multi-thread parallel labeling-based methods on OpenMP to efficiently compute edge closeness and betweenness centralities *** types of optimal temporal *** edge closeness centrality computation,a time segmentation strategy and two observations are presented to aggregate some related temporal edges for uniform *** edge betweenness centrality computation,to improve efficiency,temporal edge dependency formulas,a labeling-based forward-backward scanning strategy,and a compression-based optimization method are further proposed to iteratively accumulate centrality *** experiments using 13 real temporal graphs are conducted to provide detailed insights into the efficiency and effectiveness of the proposed *** with state-ofthe-art methods,labeling-based methods are capable of up to two orders of magnitude speedup.

关键词： temporal graph closeness centrality between-ness centrality temporal path

A Novel Reliable and Trust Objective Function for RPL-Based IoT Routing Protocol

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

computers, Materials & Continua 2025年第2期82卷 3467-3497页

作者： Mariam A.Alotaibi Sami S.Alwakeel Aasem N.Alyahya department of computer Engineering College of Computer ScienceKing Saud UniversityRiyadh11543Saudi Arabia department of computer science and Information Technology Shaqra UniversityShaqra11961Saudi Arabia

The Internet of Things (IoT) integrates diverse devices into the Internet infrastructure, including sensors, meters, and wearable devices. Designing efficient IoT networks with these heterogeneous devices requires the selection of appropriate routing protocols, which is crucial for maintaining high Quality of Service (QoS). The Internet Engineering Task Force’s Routing Over Low Power and Lossy Networks (IETF ROLL) working group developed the IPv6 Routing Protocol for Low Power and Lossy Networks (RPL) to meet these needs. While the initial RPL standard focused on single-metric route selection, ongoing research explores enhancing RPL by incorporating multiple routing metrics and developing new Objective Functions (OFs). This paper introduces a novel Objective Function (OF), the Reliable and Secure Objective Function (RSOF), designed to enhance the reliability and trustworthiness of parent selection at both the node and link levels within IoT and RPL routing protocols. The RSOF employs an adaptive parent node selection mechanism that incorporates multiple metrics, including Residual Energy (RE), Expected Transmission Count (ETX), Extended RPL Node Trustworthiness (ERNT), and a novel metric that measures node failure rate (NFR). In this mechanism, nodes with a high NFR are excluded from the parent selection process to improve network reliability and stability. The proposed RSOF was evaluated using random and grid topologies in the Cooja Simulator, with tests conducted across small, medium, and large-scale networks to examine the impact of varying node densities. The simulation results indicate a significant improvement in network performance, particularly in terms of average latency, packet acknowledgment ratio (PAR), packet delivery ratio (PDR), and Control Message Overhead (CMO), compared to the standard Minimum Rank with Hysteresis Objective Function (MRHOF).

关键词： IoT LLNs RPL objective function OF MRHOF OF0 routing metrics reliability trustworthiness

A Latency-Aware and Fault-Tolerant Framework for Resource Scheduling and Data Management in Fog-Enabled Smart City Transportation Systems

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

computers, Materials & Continua 2025年第1期82卷 1377-1399页

作者： Ibrar Afzal Noor ul Amin Zulfiqar Ahmad Abdulmohsen Algarni department of computer science and Information Technology Hazara UniversityMansehra21300Pakistan department of computer science King Khalid UniversityAbha61421Saudi Arabia

Thedeployment of the Internet of Things(IoT)with smart sensors has facilitated the emergence of fog computing as an important technology for delivering services to smart environments such as campuses,smart cities,and smart transportation *** computing tackles a range of challenges,including processing,storage,bandwidth,latency,and reliability,by locally distributing secure information through end *** of endpoints,fog nodes,and back-end cloud infrastructure,it provides advanced capabilities beyond traditional cloud *** smart environments,particularly within smart city transportation systems,the abundance of devices and nodes poses significant challenges related to power consumption and system *** address the challenges of latency,energy consumption,and fault tolerance in these environments,this paper proposes a latency-aware,faulttolerant framework for resource scheduling and data management,referred to as the FORD framework,for smart cities in fog *** framework is designed to meet the demands of time-sensitive applications,such as those in smart transportation *** FORD framework incorporates latency-aware resource scheduling to optimize task execution in smart city environments,leveraging resources from both fog and cloud *** simulation-based executions,tasks are allocated to the nearest available nodes with minimum *** the event of execution failure,a fault-tolerantmechanism is employed to ensure the successful completion of *** successful execution,data is efficiently stored in the cloud data center,ensuring data integrity and reliability within the smart city ecosystem.

关键词： Fog computing smart cities smart transportation data management fault tolerance resource scheduling

GPS: graph contrastive learning via multi-scale augmented views from adversarial pooling

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

science China(Information sciences) 2025年第1期68卷 145-158页

作者： Wei JU Yiyang GU Zhengyang MAO Ziyue QIAO Yifang QIN Xiao LUO Hui XIONG Ming ZHANG School of computer science National Key Laboratory for Multimedia Information ProcessingPeking University Artificial Intelligence Thrust The Hong Kong University of Science and Technology department of computer science University of California

Self-supervised graph representation learning has recently shown considerable promise in a range of fields, including bioinformatics and social networks. A large number of graph contrastive learning approaches have shown promising performance for representation learning on graphs, which train models by maximizing agreement between original graphs and their augmented views(i.e., positive views). Unfortunately, these methods usually involve pre-defined augmentation strategies based on the knowledge of human experts. Moreover, these strategies may fail to generate challenging positive views to provide sufficient supervision signals. In this paper, we present a novel approach named graph pooling contrast(GPS) to address these *** by the fact that graph pooling can adaptively coarsen the graph with the removal of redundancy, we rethink graph pooling and leverage it to automatically generate multi-scale positive views with varying emphasis on providing challenging positives and preserving semantics, i.e., strongly-augmented view and weakly-augmented view. Then, we incorporate both views into a joint contrastive learning framework with similarity learning and consistency learning, where our pooling module is adversarially trained with respect to the encoder for adversarial robustness. Experiments on twelve datasets on both graph classification and transfer learning tasks verify the superiority of the proposed method over its counterparts.

关键词： graph representation learning graph neural networks graph contrastive learning graph augmentations graph pooling

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].

关键词：

Privacy-preserving explainable AI: a survey

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science China(Information sciences) 2025年第1期68卷 23-56页

作者： Thanh Tam NGUYEN Thanh Trung HUYNH Zhao REN Thanh Toan NGUYEN Phi Le NGUYEN Hongzhi YIN Quoc Viet Hung NGUYEN School of Information and Communication Technology Griffith University School of computer and Communication sciences Ecole Polytechnique Federale de Lausanne Faculty of Mathematics and computer science University of Bremen Faculty of Information Technology HUTECH University department of computer science Hanoi University of Science and Technology School of Electrical Engineering and computer science The University of Queensland

As the adoption of explainable AI(XAI) continues to expand, the urgency to address its privacy implications intensifies. Despite a growing corpus of research in AI privacy and explainability, there is little attention on privacy-preserving model explanations. This article presents the first thorough survey about privacy attacks on model explanations and their countermeasures. Our contribution to this field comprises a thorough analysis of research papers with a connected taxonomy that facilitates the categorization of privacy attacks and countermeasures based on the targeted explanations. This work also includes an initial investigation into the causes of privacy leaks. Finally, we discuss unresolved issues and prospective research directions uncovered in our analysis. This survey aims to be a valuable resource for the research community and offers clear insights for those new to this domain. To support ongoing research, we have established an online resource repository, which will be continuously updated with new and relevant findings.

关键词： privacy-preserving explainable AI privacy attacks privacy defences PrivEx PPXAI

Intrusion detection system for controller area network

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Cybersecurity 2025年第1期8卷 1-21页

作者： Vinayak Tanksale department of computer science Ball State UniversityMuncieIN 47306USA

The rapid expansion of intra-vehicle networks has increased the number of threats to such *** modern vehicles implement various physical and data-link layer *** are becoming increasingly autonomous and *** area network(CAN)is a serial bus system that is used to connect sensors and controllers(electronic control units-ECUs)within a *** vary widely in processing power,storage,memory,and *** goal of this research is to design,implement,and test an efficient and effective intrusion detection system for intra-vehicle *** cryptographic approaches are resource-intensive and increase processing delay,thereby not meeting CAN latency *** is a need for a system that is capable of detecting intrusions in almost real-time with minimal *** research proposes a long short-term memory(LSTM)network to detect anomalies and a decision engine to detect intrusions by using multiple contextual *** have tested our anomaly detection algorithm and our decision engine using data from real *** present the results of our experiments and analyze our *** detailed evaluation of our system,we believe that we have designed a vehicle security solution that meets all the outlined requirements and goals.

关键词： Controller area network Deep learning Intrusion detection system Long short-term memory Machine learning Recurrent neural networks