Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Changhong Tai

dblp:418/0043 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2026
0009-0004-4730-1633ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 2 · 1 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Edge and fog computing · 67% Network optimization and economics · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Edge and fog computing › mobile edge computing
computation offloading
1.012026
Interactive Fast Computation Offloading and Resource Allocation: A Joint Optimization Approach for Metaverse Applications · IEEE Trans. Serv. Comput. 2026
Edge and fog computing › edge offloading
joint offloading and resource allocation
1.012026
Interactive Fast Computation Offloading and Resource Allocation: A Joint Optimization Approach for Metaverse Applications · IEEE Trans. Serv. Comput. 2026
Network optimization and economics
resource allocation
1.012026
Interactive Fast Computation Offloading and Resource Allocation: A Joint Optimization Approach for Metaverse Applications · IEEE Trans. Serv. Comput. 2026

Methods — techniques the papers use, named apart from their topics

transformer · 1.0multi-agent proximal policy optimization · 1.0MIMO · 1.0
YearPublicationVenuePosition
2026 Budget-constrained workflow scheduling using task prediction in hybrid environments
Changhong Tai, Huiying Jin, Hai Dong 0001, Pengcheng Zhang 0001
Expert Syst. Appl.1
2026 Interactive Fast Computation Offloading and Resource Allocation: A Joint Optimization Approach for Metaverse Applications
abstract
The metaverse is a pioneering cyber-physical space that seamlessly blends the physical and virtual worlds, demanding a fully immersive and highly interactive user experience. However, existing communication designs and traditional offloading and allocation approaches fall short of meeting the dynamic network conditions and real-time performance demands of the metaverse. To tackle these challenges, we develop a wireless transmission architecture optimized for metaverse computation offloading and resource allocation. This design leverages the Rayleigh fading and Multiple Input Multiple Output (MIMO) technology to optimize transmission paths, enhancing the reliability and efficiency of signal transmission in high-concurrency connections. We further introduce MetaTMCO (MetaTransformer andMAPPO basedComputationOffloading), a dynamic online computation offloading and resource allocation joint optimized method that meets critical QoS requirements for metaverse applications. MetaTMCO uses a metric named Interaction Frequency (IF) to evaluate resource competition between users and resource interaction between users and the environment, combining QoS to maximize utility under resource constraints. By integrating a Transformer-based encoder-decoder within the Multi-Agent Proximal Policy Optimization (MAPPO) algorithm, MetaTMCO mitigates inefficiencies from partial observations, enabling dynamic optimization of real-time fast offloading strategies across multiple agents. Experimental results demonstrate that MetaTMCO significantly outperforms other approaches in metaverse environments, achieving superior strategy optimization and resource efficiency.
Huiying Jin, Changhong Tai, Hai Dong 0001, Pengcheng Zhang 0001
IEEE Trans. Serv. Comput.3
2025 DAG- FGL: An Enhanced Approach for Accurate Workflow Task Execution Time Prediction with Complex Dependencies
abstract
We propose a new workflow task execution time prediction approach, DAG-FGL, by integrating Flash attention mechanism with a GraphLSTM model. It addresses the challenge of low task execution time prediction accuracy in the presence of complex dependencies among workflow subtasks. The GraphLSTM model captures and conveys subtask dependencies through the adjacency matrix of sub task relationships modeled as a directed acyclic graph (DAG). The Flash attention mechanism enhances the model by incorporating customized positional encoding of subtask priority. The encoding ensures that the model accurately reflects each subtask's importance and relative order when calculating attention weight. Therefore, DAG- FG L can more accurately predict task execution time in the context of complex dependencies. Experimental results show that DAG-FGL outperforms the best-performing baseline model. It achieves 7.82 % to 44.52 % improvements in prediction accuracies over the best-performing baselines across three cloud workflow datasets of varying lengths.
Changhong Tai, Huiying Jin, Hai Dong 0001, Pengcheng Zhang 0001
ICWS1