Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Liucheng Guo"'
Publikováno v:
ACS Omega, Vol 8, Iss 40, Pp 37098-37107 (2023)
Externí odkaz:
https://doaj.org/article/b1a7a8a9df684d8d9313a78c86291fe4
Publikováno v:
Shipin gongye ke-ji, Vol 43, Iss 16, Pp 185-191 (2022)
Using fresh Lentinus edodes and milk powder as the main materials, the Lentinus edodes flavored milk tablets was prepared through processes such as mixing, granulating, drying, granulating and tableting. With sensory score, tablet weight variation, h
Externí odkaz:
https://doaj.org/article/b97e690c6340474e99ca3c42a3f79a4b
Publikováno v:
Electronic Workshops in Computing.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3978179ef0390ca9f5eba532578255cd
https://doi.org/10.14236/ewic/hci2022.27
https://doi.org/10.14236/ewic/hci2022.27
Autor:
Rong Wang, Jun-Jun Zhou, Jin Shaoju, Kun-Peng Guo, Ma Yongchao, Song-Tao Xu, Liucheng Guo, Tingting Wang
Publikováno v:
Iranian Red Crescent Medical Journal. 21
Background: Sophocarpine (SC) is a major alkaloid extracted from Sophora alopecuroides L. Our previous study showed that SC has analgesic effects on neuropathic pain induced by chronic constriction injury (CCI). However, the exact analgesic mechanism
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::afbf8b47ffedce1e1c48d8f7984289d9
https://doi.org/10.5812/ircmj.94716
https://doi.org/10.5812/ircmj.94716
Publikováno v:
FPT
Accelerators are becoming increasingly prevalent in distributed computation. FPGAs have been shown to be fast and power efficient for particular tasks, yet scheduling on FPGA-based multi-accelerator systems is challenging when workloads vary signific
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::46ee731476fb9eae0f2a847dbd395957
https://hdl.handle.net/10023/16738
https://hdl.handle.net/10023/16738
Publikováno v:
ACM SIGARCH Computer Architecture News. 43:86-93
Genetic algorithms (GA) have been shown to be effective in the optimization of many large-scale real-world problems in a reasonable amount of time. Parallel GAs not only reduce the overall GA execution time, but also bring higher quality solutions du
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0a4d9dbce7e752016424a87cd3e15f64
https://doi.org/10.1145/2927964.2927980
https://doi.org/10.1145/2927964.2927980
Publikováno v:
FPL
This paper presents novel regression and regularisation techniques based on Field Programmable Gate Array (FPGA) technology for large-scale datasets for machine learning and other applications. We introduce a customisable design which allows end-user
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::59f8ed2d359fc6660c75cf4049d82d3c
https://doi.org/10.1109/fpl.2018.00073
https://doi.org/10.1109/fpl.2018.00073
Publikováno v:
HEART
The classic Jacobi method, widely used for solving linear systems, is slow, especially when dealing with large matrices. This paper proposes a Custom Jacobi Solver (CJS) for large-scale linear systems. It is based on a column-wise Jacobi step operati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::81ea4334075caaca7753cb5fc05f2d68
https://doi.org/10.1145/3241793.3241802
https://doi.org/10.1145/3241793.3241802
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319562575
ARC
13th International Symposium, ARC 2017
ARC
13th International Symposium, ARC 2017
A trading strategy is generally optimised for a given market regime. If it takes too long to switch from one trading strategy to another, then a sub-optimal trading strategy may be adopted. This paper proposes the first FPGA-based framework which sup
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::30212ef324b87278dcc1f93547f46cba
https://doi.org/10.1007/978-3-319-56258-2_14
https://doi.org/10.1007/978-3-319-56258-2_14
Publikováno v:
ACM SIGARCH Computer Architecture News. 41:101-106
This paper proposes novel customisable streaming architectures for the NP-hard set covering problem. Our approach covers both exhaustive and genetic algorithms, supporting coarse-grain parallelism and deep pipelines while allowing trade-offs between
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::73a441f8538ec77f4941e1c8e17e6e7f
https://doi.org/10.1145/2641361.2641378
https://doi.org/10.1145/2641361.2641378