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

34th ACM Web Conference, WWW 2025

作者： Li, Yishuo Zhang, Qi Lu, Wenpeng Peng, Xueping Zhang, Weiyu Si, Jiasheng Gong, Yongshun Hu, Liang Jinan China Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Fundamental Research Center for Computer Science Jinan China Department of Computer Science and Technology Tongji University Shanghai China Australian Artificial Intelligence Institute University of Technology Sydney Sydney Australia School of Software Shandong University Jinan China

ISBN: (纸本)9798400712746

Medication recommendation aims to suggest personalized drug combinations to patients based on their longitudinal medical histories stored in electronic health record (EHR) datasets. Patients’ Dynamic Treatment Regimes (DTRs) determine how patients’ drug combinations change along with the evolution of disease treatment. DTRs are effective for comprehending disease-treatment dynamics and for recommending a timely and personalized combination of medications for patients. However, existing medication recommender systems (MRSs) overlook the multiple treatment pathways generated by the intervention of DTRs and can only recommend a single treatment paradigm, ignoring the fact that patients may be at different treatment stages and thus require different treatment regime. Such disregard leads to a significant limitation in recommending personalized medication combinations tailored to different treatment stages, yielding greatly compromised accuracy and applicability of MRSs. Moreover, existing methods often overlook the time interval information over patients’ successive visits, which is critical to indicate patients’ treatment evolution. To address these significant gaps, we propose a Time-aware Medication Recommendation Framework via Intervention of Dynamic Treatment Regimes, called MR-DTR. To explicitly illustrate the intervention processes of DTRs on similar patients, we employ a co-guided graph to connect various patient sequences. In addition, to fully utilize the time interval information, we design a time-aware guidance mechanism dedicated to the co-guided graph to efficiently learn medication representation using the patient’s guidance information. We also introduce relative time intervals in the encoder to act as positional information. Extensive experiments on two real-world datasets demonstrate that MR-DTR surpasses state-of-the-art models in terms of recommendation performance. © 2025 Copyright held by the owner/author(s).

关键词： Electronic health record

来源：评论

学校读者我要写书评

暂无评论

MRLATO: An Adaptive Task Offloading Mechanism Based on Meta Reinforcement Learning in Edge Computing Environment

引用

IEEE Transactions on Vehicular technology 2025年

作者： Zhang, Peiying Liu, Jiamin Guizani, Maher Wang, Jian Kumar, Neeraj Tan, Lizhuang Qingdao Institute of Software College of Computer Science and Technology Qingdao266580 China Shandong Key Laboratory of Intelligent Oil & Gas Industrial Software Qingdao266580 China Ministry of Education Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Jinan250014 China University of Texas Arlington Computer Science and Engineering Department TX United States College of Science Qingdao266580 China Thapar University Department of Computer Science and Engineering Patiala147004 India Jinan250014 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Jinan250014 China

Traditional cloud computing models struggle to meet the requirements of latency-sensitive applications when processing large amounts of data. As a solution, Multi-access Edge Computing (MEC) extends computing resources to the edge of the network to reduce processing delays and improve user experience. However, in dynamically changing edge computing environments, effective decision making on whether to offload tasks to edge servers remains a core challenge. For this purpose, we propose MRLATO, an adaptive task offloading mechanism based on Meta Reinforcement Learning (MRL), which exploits a large amount of a priori knowledge of different tasks to achieve fast adaptation. The task offloading process is modelled as multiple Markov Decision Processes (MDPs) and solved using a Sequence to Sequence (Seq2Seq) neural network integrating multi-head attention and recursive task sequencing. It is shown by the experimental results that the proposed method has the lowest latency in all experimental settings and the convergence efficiency is improved by 14.06% compared to the traditional Deep Reinforcement Learning (DRL) algorithm. This research fully demonstrates the significant benefits of the deep integration of MRL with the edge computing domain, providing new optimisation ideas for task offloading decisions. © 1967-2012 IEEE.

关键词： Computation offloading

来源：评论

学校读者我要写书评

暂无评论

An enhanced concurrency control scheme for multi-dimensional index structures 7

An enhanced concurrency control scheme for multi-dimensional...

引用

7th International Conference on Database Systems for Advanced Applications, DASFAA 2001

作者： Song, Seok Il Kim, Young Ho Yoo, Jae Soo Dept. of Comput. and Commun. Eng. Chung-Buk Nat. Univ. Cheongju Korea Republic of Electronics and Telecommunications Research Institute Computer and Software Technology Labs. Internet Service Department Korea Republic of

ISBN: (纸本)0769509967

Propose an enhanced concurrency control algorithm that minimizes the query delay efficiently. The factors that delay search operations and deteriorate the concurrency of index structures are node splits and minimum bounding region (MBR) updates in multi-dimensional index structures. In our algorithm, in order to reduce the query delay by splitting operations, we optimize the exclusive latching time on a split node. It does not hold exclusive latches throughout the whole split time but only during the physical node split time, which occupies only a small part of the whole split time. Also, to avoid the query delay caused by MBR updates, we introduce the partial lock coupling (PLC) technique. PLC increases concurrency by using lock coupling only in the case of MBR shrinking operations that are less frequent than MBR expansion operations. For performance evaluation, we implement the proposed algorithm and one of the existing link technique-based algorithms on MIDAS-III, which is the storage system of the BADA-III DBMS. We show, through various experiments, that our proposed algorithm outperforms the existing algorithm in terms of throughput and response time. © 2001 IEEE.

关键词： Locks (fasteners)

来源：评论

学校读者我要写书评

暂无评论

An enhanced concurrency control scheme for multi-dimensional index structures

An enhanced concurrency control scheme for multi-dimensional...

引用

International Conference on Database Systems for Advanced Applications

作者： Seok Il Song Young Ho Kim Jae Soo Yoo Department of Computer and Communication Engineering Chungbuk National University South Korea Technology Laboratories Internet Service Department Electronics and Telecommunications Research Institute South Korea

ISBN: (纸本)0769509967

关键词： Concurrency control Concurrent computing Multidimensional systems Telecommunication computing Web and internet services software algorithms Delay effects Latches Programmable control Throughput

来源：评论

学校读者我要写书评

暂无评论

An efficient concurrency control algorithm for high-dimensional index structures

An efficient concurrency control algorithm for high-dimensio...

引用

1999 International Conference on Information Intelligence and Systems, ICIIS 1999

作者： Song, Seok-Il Lee, Seok Hee Yoo, Jae Soo Lee, Jang Sun Department of Computer and Communication Chungbuk National University Korea Republic of Electronics and Telecommunications Research Institute Computer and Software Technology Labs Internet Service Department Korea Republic of

ISBN: (纸本)0769504469

In this paper we propose an efficient concurrency control algorithm based on the link technique of RLink-Tree for high-dimensional index structures. Unlike the RLink-Tree concurrency control algorithm, it does not employ lock-coupling while ascending the index trees to process node splits and MBR (minimum bounding region) updates. Additionally, the algorithm provides the concurrency control mechanisms for forced reinsertion operations that are used to improve search performance in multi-dimensional index trees. We show through experiments that our proposed method outperforms the existing RLink-Tree algorithm. © 1999 IEEE.

关键词： Concurrency control

来源：评论

学校读者我要写书评

暂无评论

Improved hard acknowledgement deadline protocol in real-time RPC

Improved hard acknowledgement deadline protocol in real-time...

引用

25th EUROMICRO Conference on Informatics: Theory and Practice for the New Millennium, EUROMICRO 1999

作者： Namgoong, Han Kim, Myung-Joon Internet Service Department Computer.Software Technology Laboratory ETRI Yusong P.O.Box 106 Taejon 305-600 Korea Republic of

ISBN: (纸本)0769503217

In this paper we present an improved hard acknowledgement deadline protocol in real-time remote procedure call (RT-RPC). Current RT-RPC protocol asks services and waits until the deadline of result. M. Dao and Kwei-Jay Lin (1991) extended RT-RPC by adding hard acknowledgement deadline and got considerable result, to give more time to client recovering error etc. We improved that hard acknowledgement deadline by sending cancel message to the server at acknowledgement deadline when the client did not receive any message from the server by acknowledgement deadline. Upon receiving the cancel message the server kills the current request and executes next message. This scheme will give the client more time to handle requests and the server can do more requests in a given time. To show the effectiveness (more throughput in server) of our protocol we also include our simulation analysis. © 1999 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An efficient concurrency control algorithm for high-dimensional index structures

An efficient concurrency control algorithm for high-dimensio...

引用

International Conference on Information Intelligence and Systems

作者： Seok-Il Song Seok Hee Lee Jae Soo Yoo Jang Sun Lee Department of Computer and Communication Chungbuk National University South Korea Computer and Software Technology Laboratories Internet Service Department Electronics and Telecommunications Research Institute South Korea

In this paper we propose an efficient concurrency control algorithm based on the link technique of R/sup Link/-Tree for high-dimensional index structures. Unlike the R/sup Link/-Tree concurrency control algorithm, it does not employ lock-coupling while ascending the index trees to process node splits and MBR (minimum bounding region) updates. Additionally, the algorithm provides the concurrency control mechanisms for forced reinsertion operations that are used to improve search performance in multi-dimensional index trees. We show through experiments that our proposed method outperforms the existing R/sup Link/-Tree algorithm.

关键词： Concurrency control Telecommunication computing Degradation Concurrent computing Sun software Web and internet services Tree data structures

来源：评论

学校读者我要写书评

暂无评论

Improved hard acknowledgement deadline protocol in real-time RPC

Improved hard acknowledgement deadline protocol in real-time...

引用

EUROMICRO Conference

作者： Han Namgoong Myung-Joon Kim Internet Service Department Computer.Software Technology Laboratory Electronics and Telecommunications Research Institute Daejeon South Korea

关键词： Protocols Delay effects Throughput Web and internet services laboratories Web server Message passing Bandwidth Wireless communication Real time systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：