Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Sainan Guo"'
Publikováno v:
Theoretical Computer Science. 928:1-12
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f80e509fb0dfb5a9a4281da64bdcfffc
https://doi.org/10.1016/j.tcs.2022.06.006
https://doi.org/10.1016/j.tcs.2022.06.006
Publikováno v:
Asia-Pacific Journal of Operational Research.
In this paper, we consider two single-processor online scheduling problems with an unexpected breakdown. Speaking specifically, there is a group of nonresumable jobs being processed on the single processor. Note that the breakdown will emerge on the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ca2bc9c27530f7436890c4e59f9b4e12
https://doi.org/10.1142/s0217595923500057
https://doi.org/10.1142/s0217595923500057
Autor:
YangYang Niu, XinHao Han, Yuan Zeng, Abiyasi Nanding, Qiang Bai, SaiNan Guo, YaLi Hou, Yan Yu, QiuJu Zhang, XiaoMei Li
Publikováno v:
Journal of Cancer Research and Clinical Oncology.
Purpose Spread through air spaces (STAS) is a crucial invasive mode of lung cancer and has been shown to be associated with early recurrence and metastasis. We aimed to develop a prognostic risk assessment model for stage I lung adenocarcinoma based
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e3819f91d60329bc383e377128971c1b
https://doi.org/10.1007/s00432-023-04619-z
https://doi.org/10.1007/s00432-023-04619-z
Autor:
Ran Ma, Sainan Guo
Publikováno v:
European Journal of Operational Research. 290:57-67
In this study, we consider the classical online scheduling problem with rejection on identical parallel machines. In particular, a series of independent jobs arriving online over time will be scheduled on the identical machines with the flexibility o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::15a705f28b0cc20c7f99ae0e8bee6dbc
https://doi.org/10.1016/j.ejor.2020.08.009
https://doi.org/10.1016/j.ejor.2020.08.009
Autor:
Rudolf Vetschera, Sainan Guo
The abstract is available here: https://uscholar.univie.ac.at/o:1636341
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2ae96e8f5dfdd6e562e30d376722e5d1
https://doi.org/10.1002/mde.3778
https://doi.org/10.1002/mde.3778
Publikováno v:
Journal of the science of food and agricultureREFERENCES. 102(8)
BACKGROUND To ameliorate egg white gel's salinity and undesirable texture characteristics during curing, different metal ions (K+ , Mg2+ , Ca2+ , Zn2+ ) were used to replace NaCl to simulate salted eggs partially. The effects of these ions on the phy
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::93b6eec878008e66ed0440ff468254b4
https://pubmed.ncbi.nlm.nih.gov/34813108
https://pubmed.ncbi.nlm.nih.gov/34813108
Publikováno v:
Asia-Pacific Journal of Operational Research. 38
In this paper, a single-machine semi-online scheduling problem with rejection is addressed. In this model, “semi-online” implies that [Formula: see text], where [Formula: see text] and [Formula: see text] are the maximum processing time and the m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4151384420483188767aaae2d5bfa030
https://doi.org/10.1142/s0217595921400030
https://doi.org/10.1142/s0217595921400030
Publikováno v:
Applied Mathematics and Computation. 392:125670
In this paper, we focus on a semi-online scheduling problem with rejection on identical parallel machines, where “semi-online” means that the ratio of the longest processing time among all jobs to the shortest one is no more than γ with γ ≥ 1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0a60170ddfec53b551410fa2e1b9bae0
https://doi.org/10.1016/j.amc.2020.125670
https://doi.org/10.1016/j.amc.2020.125670
Publikováno v:
ACPR
In this paper, we propose a new shadow removal method from an image by extracting an illumination-invariant feature representation for road scene understanding. We model the invariant representation based on a 3D log chromaticity feature space, where
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d624de04978d579d5860efa43b531a69
https://doi.org/10.1109/acpr.2017.68
https://doi.org/10.1109/acpr.2017.68