Qihui Li

Qihui Li

Auto-generated profile, based on publicly available information

Qihui Li

School of Computer Science and Artificial Intelligence, Huanggang Normal University, Huanggang 438000, China

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
23 December 2022 in IEEE Transactions on Cloud Computing
Verified
Journal Article
Closed access
QLQihui Li
Qihui Li
XJXiaohua Jia
Xiaohua Jia
CHChuanhe Huang
Chuanhe Huang
HBHaizhou Bao
Haizhou Bao
For the cloud market, we proposed a Dynamic Combinatorial Double Auction (DCDA) model to improve the social welfare and resource utilization. In the model, cloud-agents represent cloud service providers, and user-agents represent cloud users. They bid for various combinations of resources in a dynamic environment. To overcome the computational complexity of combinatorial auctions, we employed a greedy approximation method to solve the winner determination problem together with a truthful payment scheme. The proposed model is proven to be approximately efficient, incentive compatible, individually rational, and budget-balanced. Considering both parties' interests and the relative scarcity of cloud resources, this model also ensures fairness and balances resource allocation.

18 July 2023 in Journal of Cloud Computing
Verified
Journal Article
Open access
PDF file
QLQihui Li
Qihui Li
XJXiaohua Jia
Xiaohua Jia
CHChuanhe Huang
Chuanhe Huang
Dynamic auction-based resource allocation models require little global price information, are decentralized and suitable for the distributed systems like cloud computing. For the cloud computing market, we proposed a Truthful Dynamic Combinatorial Double Auction (TDCDA) model to improve the social welfare and resource utilization. In our model, multiple cloud service providers and cloud users bid for various resources in a dynamic environment. We adopted a payment scheme to ensure truthfulness for all participants, which motivates bidders to reveal their true preferences. Since the combinatorial auction allocation with goal of economic efficiency is NP-hard, we developed a greedy mechanism to achieve the approximately efficient solution. Considering both parties’ interests and the resource scarcity, this model also ensures fairness and balances resource allocation. The proposed model is proven to be approximately efficient, incentive compatible, individually rational and budget-balanced. Simulation results show that the model not only achieves economic efficiency, but also improves resource allocation and meets resource needs for more cloud users.

3 March 2026 in IEEE Transactions on Cloud Computing
Verified
Journal Article
Closed access
QLQihui Li
Qihui Li
ZHZhonglin He
Zhonglin He
AWAsher Wu
Asher Wu
LYLiting Yu
Liting Yu
XJXiaohua Jia
Xiaohua Jia
Efficient resource allocation in cloud computing environments is crucial for ensuring platform performance and service quality. To address the heterogeneity of cloud resources and the diverse demands of cloud users, this paper proposes a truthful multi-combinatorial double auction (TMCDA) mechanism for cloud resource allocation. The mechanism introduces resource weight ratios to reflect the relative importance and proportional relationships among different resource types, thereby enabling a more precise evaluation of heterogeneous resource combinations. Meanwhile, cloud users are allowed to submit multiple substitutable combinatorial resource requests, which increases allocation flexibility and improves transaction success rates. In the payment design, a critical price calculation method similar to the second-price auction is adopted to guarantee truthfulness and economic efficiency. By integrating resource bundle matching with weighted pricing, the proposed mechanism improves resource utilization and overall social welfare. Simulation results demonstrate that, compared with Truthful Combinatorial/Multi-unit multi-item Double Auction for Cloud computing (TCMDAC) and Combinatorial Double Auction Resource Allocation (CDARA), the proposed approach achieves at least 15% and 30% improvements in social welfare, respectively, highlighting its advantages in transaction fairness, incentive compatibility, and allocation efficiency.

29 April 2026 in Future Generation Computer Systems
Verified
Journal Article
Closed access
QLQihui Li
Qihui Li
AWAsher Wu
Asher Wu
SWSophya Wu
Sophya Wu
JXJingxiu Xu
Jingxiu Xu

27 September 2026 in Processes
Verified
Journal Article
Open access
PDF file
QLQihui Li
Qihui Li
QLQizhen Li
Qizhen Li
Equal Channel Angular Pressing (ECAP) technique is widely used to refine grains in metallic materials, including magnesium and its alloys. This paper reviews the grain refinement data for various magnesium alloys achieved through ECAP processing. The data are analyzed to explore the effect of ECAP parameters on grain refinement effectiveness and provide us with some guidelines for selecting appropriate values for the processing parameters. The parameters studied include the internal channel angle ϕ, the outer arc angle Ψ, the pressing temperature T, the number of ECAP passes N, and the type of ECAP processing Route. Some key observations and general trends were obtained based on the analysis: (i) route Bc is generally the most effective processing route to generate finer grains and it is the most commonly used pressing route in the literature; (ii) the most commonly selected ECAP temperature falls between 200 °C and 300 °C; (iii) ECAP processing often refines grains the most during the first pass; and (iv) the most commonly used number of ECAP passes is less than 8.