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

Continual Reinforcement Learning for Digital Twin Synchronization Optimization

IEEE Transactions on Mobile Computing 2025年

作者： Tong, Haonan Chen, Mingzhe Zhao, Jun Hu, Ye Yang, Zhaohui Liu, Yuchen Yin, Changchuan Beijing University of Posts and Telecommunications Beijing Key Laboratory of Network System Architecture and Convergence Beijing Advanced Information Network Laboratory Beijing China College of Computing and Data Science Singapore University of Miami Department of Electrical and Computer Engineering Frost Institute for Data Science and Computing Coral Gables33146 United States University of Miami Department of Industrial and Systems Engineering Coral Gables33146 United States Zhejiang University College of Information Science and Electronic Engineering Hangzhou310027 China North Carolina State University Department of Computer Science RaleighNC27695 United States Beijing Key Laboratory of Network System Architecture and Convergence China Beijing University of Posts and Telecommunications Beijing Advanced Information Network Laboratory Beijing100876 China

This article investigates the adaptive resource allocation scheme for digital twin (DT) synchronization optimization over dynamic wireless networks. In our considered model, a base station (BS) continuously collects factory physical object state data from wireless devices to build a real-time virtual DT system for factory event analysis. Due to continuous data transmission, maintaining DT synchronization must use extensive wireless resources. To address this issue, a subset of devices is selected to transmit their sensing data, and resource block (RB) allocation is optimized. This problem is formulated as a constrained Markov process (CMDP) problem that minimizes the long-term mismatch between the physical and virtual systems. To solve this CMDP, we first transform the problem into a dual problem that refines RB constraint impacts on device scheduling strategies. We then propose a continual reinforcement learning (CRL) algorithm to solve the dual problem. The CRL algorithm learns a stable policy across historical experiences for quick adaptation to dynamics in physical states and network capacity. Simulation results show that the CRL can adapt quickly to network capacity changes and reduce normalized root mean square error (NRMSE) between physical and virtual states by up to 55.2%, using the same RB number as traditional methods. © 2025 IEEE. All rights reserved.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

On the Effectiveness of Function-Level Vulnerability Detectors for Inter-Procedural Vulnerabilities

On the Effectiveness of Function-Level Vulnerability Detecto...

引用

International Conference on Software engineering (ICSE)

作者： Zhen Li Ning Wang Deqing Zou Yating Li Ruqian Zhang Shouhuai Xu Chao Zhang Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Jin YinHu Laboratory Wuhan China Department of Computer Science University of Colorado Colorado Springs Colorado Springs Colorado USA Institute for Network Sciences and Cyberspace Tsinghua University Beijing China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (数字)9798400702174

ISBN: (纸本)9798350382143

Software vulnerabilities are a major cyber threat and it is important to detect them. One important approach to detecting vulnerabilities is to use deep learning while treating a program function as a whole, known as function-level vulnerability detectors. However, the limitation of this approach is not understood. In this paper, we investigate its limitation in detecting one class of vulnerabilities known as inter-procedural vulnerabilities, where the to-be-patched statements and the vulnerability-triggering statements belong to different functions. For this purpose, we create the first Inter -Procedural Vulnerability dataset (InterPVD) based on C/C++ open-source software, and we propose a tool dubbed VulTrigger for identifying vulnerability-triggering statements across functions. Experimental results show that VulTrigger can effectively identify vulnerability-triggering statements and inter-procedural vulnerabilities. Our findings include: (i) inter-procedural vulnerabilities are prevalent with an average of 2.8 inter-procedural layers; and (ii) function-level vulner-ability detectors are much less effective in detecting to-be-patched functions of inter-procedural vulnerabilities than detecting their counterparts of intra-procedural vulnerabilities.

关键词： Deep learning Detectors Open source software Software engineering

来源：评论

学校读者我要写书评

暂无评论

RAHP: A Redundancy-aware Accelerator for High-performance Hypergraph Neural Network

RAHP: A Redundancy-aware Accelerator for High-performance Hy...

引用

IEEE/ACM International Symposium on Microarchitecture (MICRO)

作者： Hui Yu Yu Zhang Ligang He Yingqi Zhao Xintao Li Ruida Xin Jin Zhao Xiaofei Liao Haikun Liu Bingsheng He Hai Jin National Engineering Research Center for Big Data Technology and System Service Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Department of Computer Science University of Warwick United Kingdom National University of Singapore Singapore

ISBN: (数字)9798350350579

ISBN: (纸本)9798350350586

Hypergraph Neural Network (HyperGNN) has emerged as a potent methodology for dissecting intricate multilateral connections among various entities. Current software/hardware solutions leverage a sequential execution model that relies on hyperedge and vertex indices for conducting standard matrix operations for HyperGNN inference. Yet, they are impeded by the dual challenges of redundant computation and irregular memory access overheads. This is primarily due to the frequent and repetitive access and updating of a number of feature vectors corresponding to the same hyperedges and vertices. To address these challenges, we propose the first redundancy-aware accelerator, RAHP, which enables high performance execution of HyperGNN inference. Specifically, we present a redundancy-aware asynchronous execution approach into the accelerator design for HyperGNN to reduce redundant computations and off-chip memory accesses. To unveil opportunities for data reuse and unlock the parallelism that existing HyperGNN solutions fail to capture, it prioritizes vertices with the highest degree as roots, prefetching other vertices along the hypergraph structure to capture the common vertices among multiple hyperedges, and synchronizing the computations of hyperedges and vertices in real-time. By such means, this facilitates the concurrent processing of relevant hyperedge and vertex computations of the common vertices along the hypergraph topology, resulting in smaller redundant computations overhead. Furthermore, by efficiently caching intermediate results of the common vertices, it curtails memory traffic and off-chip communications. To fully harness the performance potential of our proposed approach in the accelerator, RAHP incorporates a topology-driven data loading mechanism to minimize off-chip memory accesses on the fly. It is also endowed with an adaptive data synchronization scheme to mitigate the effects of conflicting updates of both hyperedges and vertices. Moreover, RAHP emplo

关键词： Computational modeling Neural networks Memory management Loading Energy conservation Vectors Software Topology Synchronization Standards

来源：评论

学校读者我要写书评

暂无评论

Topology preserving Image segmentation using the iterative convolution-thresholding method

arXiv

引用

arXiv 2025年

作者： Deng, Lingyun Liu, Litong Wang, Dong Wang, Xiao-Ping School of Science and Engineering The Chinese University of Hong Kong Guangdong Shenzhen518172 China Department of Industrial and System Engineering Georgia Institute of Technology Atlanta30332 United States Shenzhen International Center for Industrial and Applied Mathematics Shenzhen Research Institute of Big Data Guangdong518172 China

Variational models are widely used in image segmentation, with various models designed to address different types of images by optimizing specific objective functionals. However, traditional segmentation models primarily focus on the visual attributes of the image, often neglecting the topological properties of the target objects. This limitation can lead to segmentation results that deviate from the ground truth, particularly in images with complex topological structures. In this paper, we introduce a topology-preserving constraint into the iterative convolution-thresholding method (ICTM), resulting in the topology-preserving ICTM (TP-ICTM). Extensive experiments demonstrate that, by explicitly preserving the topological properties of target objects—such as connectivity—the proposed algorithm achieves enhanced accuracy and robustness, particularly in images with intricate structures or noise. Copyright © 2025, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

VARIATIONAL AUTO-ENCODER BASED SOLUTIONS TO INTERACTIVE DYNAMIC INFLUENCE DIAGRAMS

arXiv

引用

arXiv 2024年

作者： Pan, Yinghui Ma, Biyang Zhang, Hanyi Zeng, Yifeng National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China School of Computer Science Minnan Normal University Zhangzhou China Department of Computer and Information Sciences Northumbria University Newcastle United Kingdom

Addressing multiagent decision problems in AI, especially those involving collaborative or competitive agents acting concurrently in a partially observable and stochastic environment, remains a formidable challenge. While Interactive Dynamic Influence Diagrams (I-DIDs) have offered a promising decision framework for such problems, they encounter limitations when the subject agent encounters unknown behaviors exhibited by other agents that are not explicitly modeled within the I-DID. This can lead to sub-optimal responses from the subject agent. In this paper, we propose a novel data-driven approach that utilizes an encoder-decoder architecture, particularly a variational autoencoder, to enhance I-DID solutions. By integrating a perplexity-based tree loss function into the optimization algorithm of the variational autoencoder, coupled with the advantages of Zig-Zag One-Hot encoding and decoding, we generate potential behaviors of other agents within the I-DID that are more likely to contain their true behaviors, even from limited interactions. This new approach enables the subject agent to respond more appropriately to unknown behaviors, thus improving its decision quality. We empirically demonstrate the effectiveness of the proposed approach in two well-established problem domains, highlighting its potential for handling multi-agent decision problems with unknown behaviors. This work is the first time of using neural networks based approaches to deal with the I-DID challenge in agent planning and learning problems. © 2024, CC BY.

关键词： Decoding

来源：评论

学校读者我要写书评

暂无评论

Markov chain quasi-Monte Carlo method for forecasting fire hotspots in Sarawak, Malaysia

引用

Environmental Science and Pollution Research 2024年第35期31卷 48608-48619页

作者： Zakaria, Nurul Nnadiah Daud, Hanita Sokkalingam, Rajalingam Othman, Mahmod Abdul Kadir, Evizal Mohd Aris, Muhammad Naeim Muhammad, Noryanti Maharani, Warih Fundamental and Applied Sciences Department Universiti Teknologi PETRONAS Perak Darul Ridzuan Bandar Seri Iskandar32610 Malaysia Information System Department Universitas Islam Indragiri Tembilahan29212 Indonesia Informatics Engineering Department Universitas Islam Riau Pekanbaru28284 Indonesia Department of Mathematical Sciences Faculty of Science and Technology Universiti Kebangsaan Malaysia Selangor Darul Ehsan Bangi43600 Malaysia Centre of Excellence in Artificial Intelligence & amp Data Science Universiti Malaysia Pahang Al-Sultan Abdullah Lebuh Persiaran Tun Khalil Yaakob Pahang Darul Makmur Kuantan26300 Malaysia Centre for Mathematical Sciences Universiti Malaysia Pahang Al-Sultan Abdullah Lebuh Persiaran Tun Khalil Yaakob Pahang Darul Makmur Kuantan26300 Malaysia School of Computing Telkom University Bandung40257 Indonesia

Stochastic modeling approaches have attracted many researchers to the field. However, fire hotspot detection suffers from not using a Markov chain quasi-Monte Carlo (MCQMC) as a forecasting methodology. This paper proposes improvements to the computational time by combining the strengths of the Markov chain Monte Carlo (MCMC) and quasi-Monte Carlo (QMC) methods. The proposed method can lead to more precise and stable results, particularly in problems with high-dimensional integration or complex probability distributions. The proposed method is applied to a case study of fire hotspot detection in Sarawak, Malaysia. The outcome of this study reveals that the MCQMC method is more computationally efficient, taking only 0.0746 seconds compared to MCMC’s 0.0914 seconds and QMC’s 0.0994 seconds. It is shown that the best option derived by the proposed method is effective in predicting fire hotspots and providing quick solutions to protect the environment and communities from forest fires. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2024.

关键词： Fires

来源：评论

学校读者我要写书评

暂无评论

STMAE: Spatial Temporal Masked Auto-Encoder for Traffic Forecasting 27th

STMAE: Spatial Temporal Masked Auto-Encoder for Traffic For...

引用

27th International Conference on Pattern Recognition, ICPR 2024

作者： Wu, Xing Cai, Chengyou Wang, Xiaoxiao Wang, Jianjia Yao, Junfeng Qian, Quan Song, Jun School of Computer Engineering and Science Shanghai University Shanghai China Shanghai Institute for Advanced Communication and Data Science Shanghai University Shanghai China Shanghai Shentong Metro Co. Ltd. Shanghai China School of AI and Advanced Computing XJTLU Entrepreneur College Xi’an Jiaotong-Liverpool University Suzhou China CSSC Seago System Technology Co. Ltd. Shanghai China Department of Geography Hong Kong Baptist University Hong Kong

ISBN: (纸本)9783031781681

The advancement of intelligent transportation systems underscores the importance of data-driven approaches in traffic forecasting, which plays a crucial role in tasks such as traffic signal control and route guidance, among others. However, the inherent uncertainty stemming from regional traffic dynamics, coupled with intricate spatio-temporal correlations, poses formidable challenges to accurate traffic prediction. Moreover, the complexities inherent in sequence forecasting across varying scales further exacerbate the accuracy dilemma. Recognizing the need for integrating information across spatial and temporal dimensions to enhance forecasting precision, a novel solution termed Spatial Temporal Masked Autoencoder (STMAE) is introduced. The STMAE framework addresses these challenges through a two-stage learning process. In the pre-training phase, an autoencoder architecture is employed to extract spatio-temporal features from the data. In the fine-tuning phase, the pre-trained encoder of the STMAE model undergoes further refinement to specifically target traffic forecasting tasks. Extensive evaluations validate the effectiveness of the proposed STMAE model. Notably, STMAE demonstrates competitive performance, achieving 3.32 Vehs MAE for long-term (60 min) traffic forecasting while operating within a reduced computational budget. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

Trends, Opportunities, and Challenges in Detecting Depressive Disorders Through Mobile Devices: A Review 2

Trends, Opportunities, and Challenges in Detecting Depressiv...

引用

2nd International Conference on Computer system, Information Technology, and Electrical engineering, COSITE 2023

作者： Elwirehardja, Gregorius Natanael Isnan, Mahmud Perbangsa, Anzaludin Samsinga Muchtar, Kahlil Pardamean, Bens Computer Science Department School of Computer Science Bina Nusantara University Jakarta11480 Indonesia Mahmud Isnan Bioinformatics and Data Science Research Center Bina Nusantara University Jakarta11480 Indonesia Information System Department School of Information Systems Bina Nusantara University Jakarta11480 Indonesia Department of Electrical and Computer Engineering Universitas Syiah Kuala Banda Aceh23111 Indonesia Computer Science Department BINUS Graduate Program-Master of Computer Science Bina Nusantara University Jakarta11480 Indonesia

ISBN: (纸本)9798350343069

Depressive Disorders (DD) is one of the most prevalent mental disorders in the world that may lead to suicide cases. To prevent the latter, ubiquitous early detection systems may be effective. Recent studies have since researched the development of such systems by exploiting several forms of data, including video, audio, Ecological Momentary Assessments (EMA), and passive sensing data using sensors embedded in mobile devices. To summarize the trends, opportunities, and existing challenges in this field, this study reviewed 15 papers to answer four research questions. EMA was the most popular data to be used in this task, but other approaches, such as using video, audio, and typing behaviors, may be considered due to the subjectivity of EMA. These data were typically recorded using smartphones and analyzed using Machine Learning (ML). However, most of the developed systems had yet to be implemented. Overall, it was concluded that further studies may need to explore usages of more objective data in multimodal approaches as well as consider using Mobile Cloud Computing (MCC) to deploy these systems to provide more effective and efficient diagnoses. Future studies must also take into account the existing challenges of the data and infrastructures, such as the weaknesses of several data types, limitations of mobile devices, as well as the challenges of diagnosis approaches. © 2023 IEEE.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Learner Action Patterns in the Problem-Solving Process Related to Program Code Composition Based on Tracking system Activities 7

Learner Action Patterns in the Problem-Solving Process Relat...

引用

7th International Conference on Informatics and Computing, ICIC 2022

作者： Syahidi, Aulia Akhrian Supianto, Ahmad Afif Hirashima, Tsukasa Watanobe, Yutaka Politeknik Negeri Banjarmasin Smart City Information System Applied Undergraduate Program Banjarmasin City Indonesia Research Center for Data and Information Sciences Bandung City Indonesia Graduate School of Advanced Science and Engineering Hiroshima University Kagamiyama Learning Engineering Laboratory Higashihiroshima Japan University of Aizu Division of Information Systems Department of Computer Science and Engineering Fukushima AizuWakamatsu Japan

ISBN: (纸本)9798350345711

Learning activities are an indicator of the learner's desire to learn during the learning process. The pattern of learner action is related to learning activities. In this case, in extracting the learning process, it is necessary to collect a lot of data through analysis of the learning process. The purpose of this study is to recommend and report the performance of an activity tracking system equipped with visual artifacts as an educational data mining approach to analyze action patterns when learners complete the arrangement of program code lines in each programming problem. In this study, data were taken from activity recordings when learners used interactive learning media for a basic programming subject called TOLSYASUPI-EduMed which had problem-solving learning models embedded in their interactions. Learning Analytics is used as a method of this research and data relationships from learner actions during the learning process using the 'if-then' rule. Log data is used for recording and detecting activities carried out by learners. We confirm that the results of the study are based on the findings of the data relationship that if the lines of program code are too long (more than five lines) then almost all learners experience a bottleneck condition. The completion time of each question and the number of iterations in completing the program code lines for each question have also been recorded and have a pattern of connection between the data. The information that has been obtained is then forwarded to teachers or stakeholders as key information to make appropriate feedback to learners based on the results as a means of analyzing and evaluating the programming learning process. © 2022 IEEE.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

Drawing Order Diagrams Through Two-Dimension Extension

引用

Journal of Graph Algorithms and Applications 2023年第9期27卷 783-802页

作者： Dürrschnabel, Dominik Hanika, Tom Stumme, Gerd Knowledge & Data Engineering Group Research Center for Information System Design & Department of Electrical Engineering and Computer Science University of Kassel Germany Institute of Computer Science University of Hildesheim Germany Berlin School of Library and Information Science Humboldt-Universität zu Berlin Germany

Ordinal real-world data such as concept hierarchies, ontologies, genealogies, or task dependencies in scheduling often has the property to not only contain pairwise comparable, but also incomparable elements. Order diagrams provide an important tool for understanding and thus discovering knowledge in such data. Easily readable drawings of such order diagrams are hard to come by, even for small ordered sets. Many attempts were made to transfer classical graph drawing approaches to order diagrams. Although these methods produce satisfying results for some ordered sets, they unfortunately perform poorly in general. In this work, we present the novel algorithm DimDraw to decompose an ordered set (e.g., a concept hierarchy) in linear orders and to produce a corresponding order diagram. This algorithm is based on a relation between the dimension of an ordered set and the bipartiteness of its transitive incompatibility graph. To evaluate the quality of the algorithm, a user study was conducted where generated drawings were compared with ones from state-of-the-art drawing algorithms. © 2023 Brown University. All rights reserved.

关键词： Set theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：