Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Jinkun Lin"'
Publikováno v:
Frontiers in Pharmacology, Vol 12 (2021)
Background: It has been verified that deficiency of Qi, a fundamental substance supporting daily activities according to the Traditional Chinese Medicine theory, is an important symptom of cancer. Qi-invigorating herbs can inhibit cancer development
Externí odkaz:
https://doaj.org/article/28c59afd9dd24b22a741a60566a752a3
Publikováno v:
Composites Science and Technology. 237:110005
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aa9482a1be09521fa345ba785d4882fd
https://doi.org/10.1016/j.compscitech.2023.110005
https://doi.org/10.1016/j.compscitech.2023.110005
Deep-learning (DL) compilers such as TVM and TensorRT are increasingly being used to optimize deep neural network (DNN) models to meet performance, resource utilization and other requirements. Bugs in these compilers can result in models whose semant
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ae681b03f914e651f77e68ea2a756e4b
Autor:
Chuan Luo, Hongyu Zhang, Bin-qi Sun, Jinkun Lin, Junjie Chen, Dongmei Zhang, Bo Qiao, Qingwei Lin
Publikováno v:
ESEC/SIGSOFT FSE
There has been a rapidly increasing demand for developing highly configurable software systems, which urgently calls for effective testing methods. In practice, t-wise coverage has been widely recognized as a useful metric to evaluate the quality of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::84247e9c167f55fe542dcd1a4dadf742
https://doi.org/10.1145/3468264.3468622
https://doi.org/10.1145/3468264.3468622
Publikováno v:
Electrochimica Acta. 317:628-637
Yolk@shell nanocomposites with delicate composition and tailored structure usually exhibit great potential in various areas. In the present study, the synthesis of yolk@shell Fe3O4@MnO2 microspheres was reported using core@shell Fe3O4@polydopamine (F
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::579e4813c9e1c26516fbac5f35445775
https://doi.org/10.1016/j.electacta.2019.06.011
https://doi.org/10.1016/j.electacta.2019.06.011
Publikováno v:
ICSE (Companion Volume)
Combinatorial interaction testing (CIT) is a popular approach to detecting faults in highly configurable software systems. The core task of CIT is to generate a small test suite called a t-way covering array (CA), where t is the covering strength. A
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::36de86fe0a808ee0f4df79232bd64078
https://doi.org/10.1109/icse-companion52605.2021.00040
https://doi.org/10.1109/icse-companion52605.2021.00040
Autor:
Qingwei Lin, Saravanakumar Rajmohan, Pu Zhao, Hongyu Zhang, Xin Chen, Dongmei Zhang, Chuan Luo, Jinkun Lin, Bo Qiao, Wei Wu, Shaowei Cai, Bing He
Publikováno v:
ICSE
Combinatorial interaction testing (CIT) is an important technique for testing highly configurable software systems with demonstrated effectiveness in practice. The goal of CIT is to generate test cases covering the interactions of configuration optio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bb14122a28666ca80deddcdd849b48e3
https://doi.org/10.1109/icse43902.2021.00030
https://doi.org/10.1109/icse43902.2021.00030
Autor:
Jinkun, Lin
Publikováno v:
American Journal of Mathematics, 1990 Aug 01. 112(4), 595-610.
Externí odkaz:
https://www.jstor.org/stable/2374871
Publikováno v:
Digital.CSIC. Repositorio Institucional del CSIC
instname
IJCAI
instname
IJCAI
The minimum connected dominating set (MCDS) problem is an important extension of the minimum dominating set problem, with wide applications, especially in wireless networks. Despite its practical importance, there are few works on solving MCDS for ma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dc0865a228a38b39bea69cc1f0ba7b9f
http://hdl.handle.net/10261/235645
http://hdl.handle.net/10261/235645
Publikováno v:
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research, 59, 463-494
Journal of Artificial Intelligence Research, 59, 463-494
The problem of finding a minimum vertex cover (MinVC) in a graph is a well known NP-hard combinatorial optimization problem of great importance in theory and practice. Due to its NP-hardness, there has been much interest in developing heuristic algor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9440a436186103c57c70566f4ec0bc0d
https://doi.org/10.1613/jair.5443
https://doi.org/10.1613/jair.5443