Zobrazeno 1 - 10
of 70
pro vyhledávání: '"Caiquan Xiong"'
Publikováno v:
Applied Sciences, Vol 14, Iss 17, p 7656 (2024)
In abstract argumentation frameworks, the computation of stable extensions is an important semantic task for evaluating the acceptability of arguments. The current approaches for the computation of stable extensions are typically conducted through me
Externí odkaz:
https://doaj.org/article/ddaa24eb8dee444db2e54e25da67363c
Publikováno v:
Journal of Marine Science and Engineering, Vol 12, Iss 8, p 1269 (2024)
Ship trajectory prediction is a complex time series forecasting problem that necessitates models capable of accurately capturing both long-term trends and short-term fluctuations in vessel movements. While existing deep learning models excel in short
Externí odkaz:
https://doaj.org/article/52dfca38ec564516bac53e43d76b48a2
Publikováno v:
Applied Sciences, Vol 14, Iss 15, p 6428 (2024)
Abstract argumentation has become one of the important fields of artificial intelligence. This paper proposes a dual-neighborhood tabu search (DNTS) method specifically designed to find a single stable extension in abstract argumentation frameworks.
Externí odkaz:
https://doaj.org/article/5a709b01051a4a04847ab2f6315bc3f8
Publikováno v:
Mathematics, Vol 12, Iss 7, p 1021 (2024)
This paper presents an algorithm for effectively maintaining the minimum spanning tree in dynamic weighted undirected graphs. The algorithm efficiently updates the minimum spanning tree when the underlying graph structure changes. By identifying the
Externí odkaz:
https://doaj.org/article/dd047b6221b34030a72fa82ae1fe8f27
Publikováno v:
Applied Sciences, Vol 14, Iss 1, p 421 (2024)
Named entity recognition (NER) is particularly challenging for medical texts due to the high domain specificity, abundance of technical terms, and sparsity of data in this field. In this work, we propose a novel attention layer, called the “ontolog
Externí odkaz:
https://doaj.org/article/bc164c938cfa4c87ad9b5f89d9fad8de
Publikováno v:
Mathematics, Vol 11, Iss 19, p 4214 (2023)
The minimum dominating tree (MDT) problem consists of finding a minimum weight subgraph from an undirected graph, such that each vertex not in this subgraph is adjacent to at least one of the vertices in it, and the subgraph is connected without any
Externí odkaz:
https://doaj.org/article/f4e5404724d04c39a460681df4a17387
Publikováno v:
IEEE Access, Vol 7, Pp 108400-108410 (2019)
As a common biological sequence, DNA sequences contain important information. The discovery of frequent patterns in DNA sequences can help to study the evolution, function and variation of genes. The findings are of great significance to genetic and
Externí odkaz:
https://doaj.org/article/5656fe8c52424a5881e2a2e3daa3d006
Publikováno v:
Algorithms, Vol 8, Iss 2, Pp 234-247 (2015)
We introduce a multi-feature optimization clustering algorithm for color image segmentation. The local binary pattern, the mean of the min-max difference, and the color components are combined as feature vectors to describe the magnitude change of gr
Externí odkaz:
https://doaj.org/article/c4020b3d5f6e499b809b7c3b5efcb511
Publikováno v:
Frontiers of Computer Science. 17
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8b84cae94d1f4d711fd65e4ff2c1c140
https://doi.org/10.1007/s11704-022-2178-2
https://doi.org/10.1007/s11704-022-2178-2
Publikováno v:
7th International Symposium on Advances in Electrical, Electronics, and Computer Engineering.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::39b507bdbb7311e20611c27733d3c087
https://doi.org/10.1117/12.2639865
https://doi.org/10.1117/12.2639865