Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Xiangkun Shen"'
Autor:
Yanbo Liu, Mengxiao Sun, Pei Hou, Wenya Wang, Xiangkun Shen, Lixin Zhang, Suna Han, Chunmei Pan
Publikováno v:
Scientific Reports, Vol 12, Iss 1, Pp 1-14 (2022)
Abstract In this study, the pit mud used in manufacturing Taorong-type Baijiu was collected from the upper, middle, lower and bottom layers of pits at Henan Yangshao Liquor Co., LTD. High-throughput sequencing (HTS) technology was used to analyze the
Externí odkaz:
https://doaj.org/article/abd6ea4612bb4a3483060e9e766895bb
Autor:
Yanbo Liu, Xin Li, Haideng Li, Huimin Zhang, Xiangkun Shen, Lixin Zhang, Suna Han, Chunmei Pan
Publikováno v:
PLoS ONE, Vol 17, Iss 10, p e0274881 (2022)
To study the difference between the fungal community compositional and fragrance components in medium- and high-Temperature Taorong-type Baijiu Daqu. The microbial communities and fragrance components of Taorong-type Baijiu Daqu were analyzed using h
Externí odkaz:
https://doaj.org/article/1c0ba77172344c0e8afff16fb5e5c5df
Autor:
yanbo liu, Xin Li, Haideng Li, Huimin Zhang, Xiangkun Shen, Lixin Zhang, Suna Han, Chunmei Pan
The microbial communities and fragrant components of Taorong-typed were analyzed using high-throughput sequencing (HTS) and headspace-solid phase microextraction-gas chromatography-mass spectrometry (HS-SPME-GC-MS). At the phylum and genus levels wit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aa440ba68b0e29a7bb3f4ab8ded76379
https://doi.org/10.21203/rs.3.rs-1309419/v1
https://doi.org/10.21203/rs.3.rs-1309419/v1
Publikováno v:
2021 3rd International Academic Exchange Conference on Science and Technology Innovation (IAECST).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3e052d0731554c649a89f6b42ed6552c
https://doi.org/10.1109/iaecst54258.2021.9695586
https://doi.org/10.1109/iaecst54258.2021.9695586
Autor:
Yanbo Liu, Mengxiao Sun, Pei Hou, Wenya Wang, Xiangkun Shen, Lixin Zhang, Suna Han, Chunmei Pan
In this study, the pit mud used in manufacturing Taorong-type Baijiu was collected from the upper, middle, lower and bottom layers of pits in Henan Yangshao Liquor Co., LTD. Besides, high-throughput sequencing (HTS) technology was adopted to analyze
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::641f5bc9711b2eb6ee550e21f0b2a2ab
https://doi.org/10.21203/rs.3.rs-1097837/v1
https://doi.org/10.21203/rs.3.rs-1097837/v1
Autor:
Yanbo Liu, Mengxiao Sun, Pei Hou, Wenya Wang, Xiangkun Shen, Lixin Zhang, Suna Han, Chunmei Pan
Publikováno v:
Scientific reports. 12(1)
In this study, the pit mud used in manufacturing Taorong-type Baijiu was collected from the upper, middle, lower and bottom layers of pits at Henan Yangshao Liquor Co., LTD. High-throughput sequencing (HTS) technology was used to analyze the microbia
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c7aecd1f60f0d2a81d2060f7cbb0fa73
https://pubmed.ncbi.nlm.nih.gov/35513386
https://pubmed.ncbi.nlm.nih.gov/35513386
Autor:
Xiangkun Shen, Viswanath Nagarajan
Publikováno v:
Mathematical Programming. 184:155-182
We consider fractional online covering problems with $$\ell _q$$ -norm objectives as well as its dual packing problems. The problem of interest is of the form $$\min \{ f(x) \,:\, Ax\ge 1, x\ge 0\}$$ where $$f(x)=\sum _{e} c_e \Vert x(S_e)\Vert _{q_e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2e97778322ad08ec66582e4959ccc541
https://doi.org/10.1007/s10107-019-01409-9
https://doi.org/10.1007/s10107-019-01409-9
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783030457709
IPCO
IPCO
We study stochastic combinatorial optimization problems where the objective is to minimize the expected maximum load (a.k.a. the makespan). In this framework, we have a set of n tasks and m resources, where each task j uses some subset of the resourc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7851d5ec183fc302fd8cfa5dc6ad3eac
https://doi.org/10.1007/978-3-030-45771-6_13
https://doi.org/10.1007/978-3-030-45771-6_13
We study stochastic combinatorial optimization problems where the objective is to minimize the expected maximum load (a.k.a.\ the makespan). In this framework, we have a set of $n$ tasks and $m$ resources, where each task $j$ uses some subset of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2c18a8905f6cc4f4423e22674e1cc858
Publikováno v:
Operations Research Letters. 46:592-598
We consider the max-cut and max- k -cut problems under graph-based constraints. Our approach can handle any constraint specified using monadic second-order (MSO) logic on graphs of constant treewidth. We give a 1 2 -approximation algorithm for this c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b2fa9e12fc0bc5900f2e0989a0110e99
https://doi.org/10.1016/j.orl.2018.10.004
https://doi.org/10.1016/j.orl.2018.10.004