Search

Your search keyword '"Huo, Yu-Jia"' showing total 16 results
Start Over Author "Huo, Yu-Jia"
16 results on '"Huo, Yu-Jia"'

7. Additional file 1 of Dynamic change of soluble interleukin-2 receptor distinguished molecular heterogeneity and microenvironment alterations in diffuse large B-cell lymphoma

Author

Huo, Yu-Jia, Xu, Peng-Peng, Wang, Li, Zhong, Hui-Juan, Fu, Di, Shi, Qing, Cheng, Shu, Wang, Shuo, Zhang, Mu-Chen, and Zhao, Wei-Li

Abstract

Additional file 1: Supplementary Methods. Figure S1. Dynamic change of sIL-2R in DLBCL. Figure S2. Univariate and multivariate risk models in DLBCL according to sIL-2R dynamic change. Figure S3. Survival analysis in DLBCL according to sIL-2R dynamic change in patients risked by R-IPI. Figure S4. Genetic and lymphoma microenvironment features of sIL-2R subtypes. Table S1. Clinical and pathological characteristics of DLBCL patients. Table S2. Multivariate analysis and C-index for progression-free survival (PFS) and overall survival (OS) in DLBCL. Table S3. Pathway alterations in RES subtype. Table S4. Pathway alterations in RET subtype.

Published
2022
Full Text
View/download PDF

10. Single-Machine Scheduling with Step-Deteriorating Jobs and Rejection

Author

Kong, Fan-Yu, Miao, Cui-Xia, Huo, Yu-Jia, Song, Jia-Xin, and Zhang, Yu-Zhong

Abstract

In this paper, we consider the single-machine scheduling with step-deteriorating jobs and rejection. Each job is either rejected by paying a rejection penalty, or accepted and processed on the single machine, and the actual processing time of each accepted job is a step function of its starting time and the common deteriorating date. The objective is to minimize the makespan of the accepted jobs plus the total penalty of the rejected jobs. For the case of common deteriorating penalty, we first show that the problem is NP-hard in the ordinary sense. Then we present two pseudo-polynomial algorithms and a 2-approximation algorithm. Furthermore, we propose a fully polynomial time approximation scheme. For the case of common normal processing time, we present two pseudo-polynomial time algorithms, a 2-approximation algorithm and a fully polynomial time approximation scheme.

Published
2023
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results