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

International Conference on Software engineering (ICSE)

作者： Zhiyuan Pan Xing Hu Xin Xia Xian Zhan David Lo Xiaohu Yang The State Key Laboratory of Blockchain and Data Security Zhejiang University Hangzhou China Software Engineering Application Technology Lab Huawei Hangzhou China The Hong Kong Polytechnic University Hong Kong China School of Computing and Information Systems Singapore Management University Singapore

ISBN: (数字)9798400702174

ISBN: (纸本)9798350382143

The number of vulnerabilities reported in open source software has increased substantially in recent years. Security patches provide the necessary measures to protect software from attacks and vulnerabilities. In practice, it is difficult to identify whether patches have been integrated into software, especially if we only have binary files. Therefore, the ability to test whether a patch is applied to the target binary, a.k.a. patch presence test, is crucial for practitioners. However, it is challenging to obtain accurate semantic information from patches, which could lead to incorrect results. In this paper, we propose a new patch presence test framework named Ppt4j (Patch Presence Test forJava Binaries). Ppt4j is designed for open-source Java libraries. It takes Java binaries (i.e. bytecode files) as input, extracts semantic information from patches, and uses feature-based techniques to identify patch lines in the binaries. To evaluate the effectiveness of our proposed approach Ppt4j, we construct a dataset with binaries that include 110 vulnerabilities. The results show that Ppt4j achieves an F1 score of 98.5% with reasonable efficiency, improving the baseline by 14.2%. Furthermore, we conduct an in-the-wild evaluation of Ppt4j on JetBrains IntelliJ IDEA. The results suggest that a third-party library included in the software is not patched for two CVEs, and we have reported this potential security problem to the vendor.

关键词： Java Semantics Feature extraction Libraries Security Software measurement data mining

来源：评论

学校读者我要写书评

暂无评论

Semantic Pre-Extraction for Energy-Efficient AoI Minimization in UAV-Assisted Wireless Networks

Semantic Pre-Extraction for Energy-Efficient AoI Minimizatio...

引用

IEEE Conference on Wireless Communications and Networking

作者： Yusi Long Gary C.F. Lee Lanhua Li Shimin Gong Sumei Sun Dusit Niyato School of Intelligent Systems Engineering Shenzhen Campus of Sun Yat-sen University China Guangdong Provincial Key Laboratory of Fire Science and Intelligent Emergency Technology China Institute for Infocomm Research (IR) A*STAR Singapore College of Computing and Data Science Nanyang Technological University Singapore

ISBN: (数字)9798350368369

ISBN: (纸本)9798350368376

This paper investigates an unmanned aerial vehicle (UAV)-assisted semantic communication network. The energy-limited ground users (GUs) provide semantic services to periodically generated raw data and a UAV relays the extracted semantic information to a base station (BS). Semantic extraction enhances data responsiveness and reduces the age-of-information (AoI) by transmitting only the most essential information. However, more complex semantic extraction increases energy consumption, making it easier for the GUs to deplete their energy. Therefore, we introduce a novel energy-efficient AoI (EAoI) metric to capture both information freshness and energy consumption of the GUs. We formulate a time-averaged EAoI minimization problem by jointly optimizing the GUs' scheduling, pre-extraction strategy, semantic control, computing resource allocation, and the UAV's trajectory. We further propose a semantic-aware joint pre-extraction and trajectory planning (Sem-JPT) algorithm to decompose the complex optimization problem into three subproblems, which are solved by a series of approximation methods. Simulation results demonstrate that semantic communication can reduce the overall EAoI by more than 18% compared with conventional bit-based communication. Moreover, the proposed Sem-JPT algorithm can maintain information freshness and prolong the GUs' lifetimes, outperforming existing baselines.

关键词： Energy consumption Trajectory planning Processor scheduling Wireless networks Semantic communication Minimization Information age Energy efficiency Trajectory data mining

来源：评论

学校读者我要写书评

暂无评论

Lyapunov-guided Deep Reinforcement Learning for Semantic-aware AoI Minimization in UAV-assisted Wireless Networks

arXiv

引用

arXiv 2024年

作者： Long, Yusi Gong, Shimin Sun, Sumei Lee, Gary Li, Lanhua Niyato, Dusit The School of Intelligent Systems Engineering Sun Yat-Sen University Shenzhen Campus Shenzhen518000 China Guangdong Provincial Key Laboratory of Fire Science and Intelligent Emergency Technology China A*STAR Singapore The College of Computing and Data Science Nanyang Technological University Singapore

This paper investigates an unmanned aerial vehicle (UAV)-assisted semantic network where the ground users (GUs) periodically capture and upload the sensing information to a base station (BS) via UAVs’ relaying. Both the GUs and the UAVs can extract semantic information from large-size raw data and transmit it to the BS for recovery. Smaller-size semantic information reduces latency and improves information freshness, while larger-size semantic information enables more accurate data reconstruction at the BS, preserving the value of original information. We introduce a novel semantic-aware age-of-information (SAoI) metric to capture both information freshness and semantic importance, and then formulate a time-averaged SAoI minimization problem by jointly optimizing the UAV-GU association, the semantic extraction, and the UAVs’ trajectories. We decouple the original problem into a series of subproblems via the Lyapunov framework and then use hierarchical deep reinforcement learning (DRL) to solve each subproblem. Specifically, the UAV-GU association is determined by DRL, followed by the optimization module updating the semantic extraction strategy and UAVs’ deployment. Simulation results show that the hierarchical structure improves learning efficiency. Moreover, it achieves low AoI through semantic extraction while ensuring minimal loss of original information, outperforming the existing baselines. Copyright © 2024, The Authors. All rights reserved.

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

Adaptive-Propagating Heterophilous Graph Convolutional Network

SSRN

引用

SSRN 2024年

作者： Huang, Yang Pi, Yueyang Shi, Yiqing Wang, Shiping Guo, Wenzhong College of Computer and Data Science Fuzhou University Fuzhou350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China College of Photonic and Electronic Engineering Fujian Normal University Fuzhou350007 China

Graph convolutional network have significant advantages in tasks dealing with graph-structured data, but most existing approaches based on graph convolutional network usually potentially assume that nodes belonging to the same class in a graph tend to form edges, yet inter-class edges exist in many real graph-structured data. Due to the propagation mechanism of graph convolutional network, it is usually difficult to avoid the aggregation of interference information of nodes from different classes, leading to the inclusion of noise and irrelevant information in the results, thus affecting the performance of the model. We propose a new framework to address this issue, which can extend graph convolutional network to heterophilous graph-structured data. The proposed method has two main parts: Firstly, from the perspective of feature space, the heterophily of the graph-structured data is modeled so that the model can adaptively change the information propagation process according to the homophily of the edges, and mitigate the influence of inter-class information on the model. Secondly, the implicit node interaction information is captured through the feature space, which is then fused with the original interaction information to aggregate sufficient intra-class information. Extensive experiments on real-world datasets demonstrate the competitiveness of our approach among current state-of-the-art methods. © 2024, The Authors. All rights reserved.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Automatic Life Event Tree Generation for Older Adults 1

引用

24th International Conference on Human-Computer Interaction, HCII 2022

作者： Gui, Fang Wu, Xi Hu, Min Yang, Jiaoyun School of Computer Science and Information Engineering Hefei University of Technology Hefei China Key Laboratory of Knowledge Engineering with Big Data of Ministry of Education Hefei University of Technology Hefei China National Smart Eldercare International S&T Cooperation Base Hefei University of Technology Hefei China Laboratory of Affective Computing and Advanced Intelligent Machine Hefei University of Technology Hefei China Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China

ISBN: (数字)9783031179020

ISBN: (纸本)9783031179013

Studies have shown that learning personal stories could help provide individualized eldercare services. However, personal stories are often disordered because of the scattered collection, including informal interviews or daily interactions, which brings difficulties in acquiring valuable information quickly. One solution to this problem is to extract events from personal stories and automatically organize them in chronological order. Events extracted by current methods from social media or news corpus are mainly organized in a linear structure. These works usually focus on the event time and ignore the consistency of event contents when organizing events. This paper aims to organize events into a tree structure based on an event network, with stem nodes representing key event topics and branch nodes representing detailed events. Social workers or caregivers can clarify the life experience of the older adults quickly through the event tree and have a preliminary understanding of them. The experiments show that the event tree generated by our method has a better performance in consistency than current event organization methods. A survey study shows that our method achieves the highest logical coherence for the event tree branches compared with other algorithms. © 2022, Springer Nature Switzerland AG.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

EvoSampling: A Granular Ball-based Evolutionary Hybrid Sampling with Knowledge Transfer for Imbalanced Learning

arXiv

引用

arXiv 2024年

作者： Pei, Wenbin Dai, Ruohao Xue, Bing Zhang, Mengjie Zhang, Qiang Cheung, Yiu-Ming Xia, Shuyin The School of Computer Science and Technology Dalian University of Technology Dalian116024 China Ministry of Education Dalian116024 China The School of Engineering and Computer Science Victoria University of Wellington PO Box 600 Wellington6140 New Zealand The Department of Computer Science Hong Kong Baptist University Hong Kong The Chongqing Key Laboratory of Computational Intelligence Key Laboratory of Big Data Intelligent Computing Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing University of Posts and Telecommunications Chongqing400065 China

Class imbalance would lead to biased classifiers that favor the majority class and disadvantage the minority class. Unfortunately, from a practical perspective, the minority class is of importance in many real-life applications. Hybrid sampling methods address this by oversampling the minority class to increase the number of its instances, followed by undersampling to remove low-quality instances. However, most existing sampling methods face difficulties in generating diverse high-quality instances and often fail to remove noise or low-quality instances on a larger scale effectively. This paper therefore proposes an evolutionary multi-granularity hybrid sampling method, called EvoSampling. During the oversampling process, genetic programming (GP) is used with multi-task learning to effectively and efficiently generate diverse high-quality instances. During the undersampling process, we develop a granular ball-based undersampling method that removes noise in a multi-granular fashion, thereby enhancing data quality. Experiments on 20 imbalanced datasets demonstrate that EvoSampling effectively enhances the performance of various classification algorithms by providing better datasets than existing sampling methods. Besides, ablation studies further indicate that allowing knowledge transfer accelerates the GP's evolutionary learning process. Copyright © 2024, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

COph100: A comprehensive fundus image registration dataset from infants constituting the "RIDIRP" database

arXiv

引用

arXiv 2025年

作者： Hu, Yan Gong, Mingdao Qiu, Zhongxi Liu, Jiabao Shen, Hongli Yuan, Mingzhen Zhang, Xiaoqing Li, Heng Lu, Hai Liu, Jiang Research Institute of Trustworthy Autonomous Systems Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen China Beijing Tongren Eye Center Beijing Tongren Hospital Capital Medical University Beijing Ophthalmology and Visual Sciences Key Laboratory Beijing China Center for High Performance Computing and Shenzhen Key Laboratory of Intelligent Bioinformatics Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen China

Retinal image registration is vital for diagnostic therapeutic applications within the field of ophthalmology. Existing public datasets, focusing on adult retinal pathologies with high-quality images, have limited number of image pairs and neglect clinical challenges. To address this gap, we introduce COph100, a novel and challenging dataset known as the Comprehensive Ophthalmology Retinal Image Registration dataset for infants with a wide range of image quality issues constituting the public "RIDIRP" database1. COph100 consists of 100 eyes, each with 2 to 9 examination sessions, amounting to a total of 491 image pairs carefully selected from the publicly available dataset. We manually labeled the corresponding ground truth image points and provided automatic vessel segmentation masks for each image. We have assessed COph100 in terms of image quality and registration outcomes using state-of-the-art algorithms. This resource enables a robust comparison of retinal registration methodologies and aids in the analysis of disease progression in infants, thereby deepening our understanding of pediatric ophthalmic conditions. Copyright © 2025, The Authors. All rights reserved.

关键词： Image registration

来源：评论

学校读者我要写书评

暂无评论

An Auto-Parallel Method for Deep Learning Models Based on Genetic Algorithm 29

An Auto-Parallel Method for Deep Learning Models Based on Ge...

引用

29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023

作者： Zeng, Yan Huang, Chengchuang Ni, Yijie Zhou, Chunbao Zhang, Jilin Wang, Jue Zhou, Mingyao Xue, Meiting Zhang, Yunquan Hangzhou Dianzi University School of Computer Science and Technology Hangzhou310018 China Ministry of Education Key Laboratory for Modeling and Simulation of Complex Systems Hangzhou310018 China Data Security Governance Zhejiang Engineering Research Center Hangzhou310018 China Hangzhou Dianzi University School of ITMO Joint Institute Hangzhou310018 China Institute of Computer Network Information Center of the Chinese Academy of Sciences Beijing100086 China HuaWei China Institute of Computing Technology of the Chinese Academy of Sciences State Key Laboratory of Computer Architecture Beijing100086 China

ISBN: (纸本)9798350330717

As the size of datasets and neural network models increases, automatic parallelization methods for models have become a research hotspot in recent years. The existing auto-parallel methods based on machine learning or graph algorithms still have issues with search efficiency and applicability. This paper proposes an automatic parallel method based on a dual-population genetic algorithm, TGA, which transforms model partitioning and placement into an integer linear programming problem and constructs a cost model to evaluate the solution. The solution space is built using the neural network's dataflow graph and device cluster's topology, and the dual-population genetic algorithm is used to search for the optimal model parallel strategy. Experiments with various models show that the proposed method can improve single-step execution time by up to 42% compared to the Baechi method and up to 37.7% compared to the Hierarchical method. © 2023 IEEE.

关键词： Auto-Parallel Distributed machine learning Genetic algorithm Integer linear programming Model parallelism

来源：评论

学校读者我要写书评

暂无评论

Coordinate Attention Based 3D-CNN Using Ghost Multi-Scale for Diagnosing Alzheimer’s Disease

Coordinate Attention Based 3D-CNN Using Ghost Multi-Scale fo...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Xiaolu Lin Pinya Lu Jie Pan Hongqin Yang Xuemei Ding Fujian Provincial Engineering Research Center for Public Service Big Data Mining and Application Fujian Provincial University Engineering Research Center for Big Data Analysis and Application Fujian Normal University Fuzhou China Xiamen Jingyi Zhikang Technology Co. Ltd Xiamen China Fujian Provincial Key Laboratory for Photonics Technology Key Laboratory of OptoElectronic Science and Technology for Medicine of Ministry of Education Fujian Normal University Fuzhou China School of Computing Engineering and Intelligent Systems Ulster University Derry-Londonderry NI UK

ISBN: (数字)9798350359312

ISBN: (纸本)9798350359329

Alzheimer's disease (AD) is a neurodegenerative disease and mild cognitive impairment (MCI) is the early stage of AD. Previous studies have predominantly focused on binary classification using 3 dimensional - convolutional neural network (3D-CNN) for AD diagnosis, with limited progress in multi-classification. Moreover, the current 3D-CNNs often adopt a single-scale architecture with massive parameters growth. Additionally, obtaining precise location information of brain imaging data is crucial for improving the classification accuracy with 3D-CNN. Hence, we propose a multi-scale 3D-CNN based on coordinate attention mechanism to marvelously capture and integrate 3D features with fewer parameters, improving the accuracy of AD diagnosis. A total of 447 cognitively normal (CN), 512 MCI, and 358 AD sMRI images from the Alzheimer's Disease Neuroimaging Initiative datasets are used for multi-class classification task, yielding a classification accuracy of 92.8%. The model merely involves 2.41 M parameters and achieves the best classification results with the least number of parameters when compared to other representative CNN architectures including ResNet 18, ResNet 34, ConvNeXt tiny, and VGG 11. Through the ablation experiment, the addition of attention mechanism and the multi-scale classification enhances the classification performance by 4.5% and 1.5%, respectively. Furthermore, our model outperforms the other six existing studies in terms of accuracy for classifying AD vs. MCI vs. CN. Overall, this study underscores the efficacy of our approach for AD diagnosis, showcasing its utility in diagnosing AD patients and providing novel insights for diagnosing other neurological disorder diseases.

关键词： Neuroimaging Accuracy Attention mechanisms Three-dimensional displays Resonance Convolutional neural networks Alzheimer's disease

来源：评论

学校读者我要写书评

暂无评论

GK: A Graphormer Architecture Based Knowledge Graph Reasoning Model for Link Prediction

GK: A Graphormer Architecture Based Knowledge Graph Reasonin...

引用

IEEE International Conference on Big data and Cloud computing (BdCloud)

作者： Yueiia Wu Jian-tao Zhou Ministry of Education Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing College of Computer Science Inner Mongolia University National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Engineering Research Center of Ecological Big Data Hohhot China

Knowledge Graph has become a dominant research field in graph theory, but its incompleteness and sparsity hinder its application in various fields. Knowledge Graph Reasoning aims to alleviate these problems by deducing new knowledge or identifying false knowledge from existing knowledge. Recently, the Graph Convolution Network (GCN) based method is one of the most advanced methods to realize knowledge graph reasoning. However, it still suffers from some problems such as incomplete neighbor information aggregation and slow training speed. This paper proposes a knowledge graph reasoning model named GK for the link prediction task, which obtains better performance than existing GCN-based methods by introducing Graphormer into knowledge reasoning. The GK first proposes that nodes and their surroundings can be regarded as a hierarchical architecture that enables the model to capture more practical reasoning information to improve prediction accuracy. In addition, to accelerate the training speed of the model on the large-scale Knowledge Graph, we present a faster shortest path-finding method F-SPF in the edge coding process. Extensive experimental results show that the GK model can obtain the state-of-the-art prediction results of current GCN-based methods and can improve the training speed.

关键词： Training Knowledge engineering Knowledge graphs Predictive models Prediction algorithms Feature extraction Cognition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：