Hongyue Wu

Hongyue Wu

Auto-generated profile, based on publicly available information

Hongyue Wu

Tianjin University

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
28 September 2015 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
Shuguang DengShuguang Deng
Shuguang Deng
HWHongyue Wu
Hongyue Wu
Javid TaheriJavid Taheri
Javid Taheri
Albert ZomayaAlbert Zomaya
Albert Zomaya
ZWZhaohui Wu
Zhaohui Wu
Service mashups are applications created by combining single-functional services (or APIs) dispersed over the web. With the development of cloud computing and web technologies, service mashups are becoming more and more widely used and a large number of mashup platforms have been produced. However, due to the proliferation of services on the web, how to select component services to create mashups has become a challenging issue. Most developers pay more attention to the quality of service (QoS) and cost of services. Beside service selection, mashup deployment is another pivotal process, as the platform can significantly affect the quality of mashups. In this paper, we focus on creating service mashups from the perspective of developers. A genetic algorithm-based method, genetic algorithm for mashup creation (GA4MC), is proposed to select component services and deployment platforms in order to create service mashups with optimal cost performance. A series of experiments are conducted to evaluate the performance of GA4MC. The results show that the GA4MC method can achieve mashups whose cost performance is extremely close to the optimal. Moreover, the execution time of GA4MC is in a low order of magnitude and the algorithm performs good scalability as the experimental scale increases.

12 March 2024 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
SWShaobo Wang
Shaobo Wang
RCRenhai Chen
Renhai Chen
HWHongyue Wu
Hongyue Wu
XLXiaozhe Li
Xiaozhe Li
ZFZhiyong Feng
Zhiyong Feng
Multi-scale detection based on Feature Pyramid Networks (FPN) has been a popular approach in object detection to improve accuracy. However, using multi-layer features in the decoder of FPN methods entails performing many convolution operations on high-resolution feature maps, which consumes significant computational resources. In this paper, we propose a novel perspective for FPN in which we directly use fused single-layer features for regression and classification. Our proposed model, You Only Look One Hourglass (YOLOH), fuses multiple feature maps into one feature map in the encoder. We then use dense connections and dilated residual blocks to expand the receptive field of the fused feature map. This output not only contains information from all the feature maps, but also has a multi-scale receptive field for detection. The experimental results on the COCO dataset demonstrate that YOLOH achieves higher accuracy and better run-time performance than established detector baselines, for instance, it achieves an average precision (AP) of 50.2 on a standard 3× training schedule and achieves 40.3 AP at a speed of 32 FPS on the ResNet-50 model. We anticipate that YOLOH can serve as a reference for researchers to design real-time detection in future studies. Our code is available at https://github.com/wsb853529465/YOLOH-main.

2 November 2023 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
GFGuodong Fan
Guodong Fan
SCShizhan Chen
Shizhan Chen
QHQiang He
Qiang He
HWHongyue Wu
Hongyue Wu
JLJing Li
Jing Li
ZFZhiyong Feng
Zhiyong Feng
Service recommendations are crucial for developers to create mashups such as mobile applications, workflows, e-business solutions, etc. Existing methods based on collaborative filtering or content analysis are manual and cannot automatically acquire services that align with the requirements of mashup creation. A possible solution to automatically acquiring necessary services for mashups is the seq2seq (sequence to sequence) generation model, which has demonstrated promising performance in automatic text and program code generation. However, two main challenges must be tackled in service acquisition based on the seq2seq model. First, the seq2seq model can only acquire a set of services without inter-service dependencies, but such dependencies are crucial in the generation of sequences for services. Second, external knowledge must be leveraged to recommend services more accurately that fulfill developers' requirements, such as similar historical user requirements and combining mashup category information, due to the incomplete description of user requirements. To tackle these challenges, this paper proposes GSR ( G eneration of S ervice R ecommendations), an approach that can automatically acquire services based on user requirements. Specifically, GSR employs reinforcement learning to learn the inter-dependencies among services and integrate dependencies into service recommendations. To further improve the quality of the acquired services, GSR retrieves relevant user requirements based on BERT (Bidirectional Encoder Representation from Transformers) to help identify potential services. Experiment results conducted on real-world datasets show the superior performance of GSR. Compared with the existing recommendation approaches, the precision metric is increased by up to 1.99x, and the recall metric is increased by up to 12%.

6 September 2024 in Knowledge-Based Systems
Verified
Journal Article
Closed access
QYQiaoyun Yin
Qiaoyun Yin
ZFZhiyong Feng
Zhiyong Feng
XLXiaohong Li
Xiaohong Li
SCShizhan Chen
Shizhan Chen
HWHongyue Wu
Hongyue Wu
GHGaoyong Han
Gaoyong Han

12 April 2024 in Knowledge-Based Systems
Verified
Journal Article
Closed access
CWChao Wang
Chao Wang
SCShizhan Chen
Shizhan Chen
MXMeng Xing
Meng Xing
HWHongyue Wu
Hongyue Wu
ZFZhiyong Feng
Zhiyong Feng

2 December 2024 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
GWGuoli Wu
Guoli Wu
ZFZhiyong Feng
Zhiyong Feng
SCShizhan Chen
Shizhan Chen
HWHongyue Wu
Hongyue Wu
XXXiao Xue
Xiao Xue
JLJingyu Li
Jingyu Li
Traditional recommendation systems focus on maximizing user satisfaction by suggesting their favorite items. This user-centric approach may lead to unfair exposure distribution among the providers. On the contrary, a provider-centric design might become unfair to the users. Therefore, this paper proposes a re-ranking model FairSort1 to find a trade-off solution among user-side fairness, provider-side fairness, and personalized recommendations utility. Previous works habitually treat this issue as a knapsack problem, incorporating both-side fairness as constraints. In this paper, we adopt a novel perspective, treating each recommendation list as a runway rather than a knapsack. In this perspective, each item on the runway gains a velocity and runs within a specific time, achieving re-ranking for both-side fairness. Meanwhile, we ensure the Minimum Utility Guarantee for personalized recommendations by designing a Binary Search approach. This can provide more reliable recommendations compared to the conventional greedy strategy based on the knapsack problem. We further broaden the applicability of FairSort, designing two versions for online and offline recommendation scenarios. Theoretical analysis and extensive experiments on real-world datasets indicate that FairSort can ensure more reliable personalized recommendations while considering fairness for both the provider and user.