Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Dongchen Jiang"'
Autor:
Xi Tang, Dongchen Jiang
Publikováno v:
IEEE Access, Vol 12, Pp 59893-59900 (2024)
Named entity recognition is a key prerequisite for many tasks. However, the high cost of entity annotation limits feature learning and generalization capabilities of models. To address this problem, this paper integrates the weakly supervised method
Externí odkaz:
https://doaj.org/article/1e8fd3efbb404441adf8c79b7bde38c6
Publikováno v:
Pattern Analysis and Applications. 25:993-999
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b262119c9041808bc5acb9f442eccdb0
https://doi.org/10.1007/s10044-022-01087-y
https://doi.org/10.1007/s10044-022-01087-y
Autor:
Dongchen Jiang, Bo Xu
Publikováno v:
International Journal of Software Engineering and Knowledge Engineering. 32:1043-1069
Automatic code generation plays an important role in ensuring the reliability and correctness of software programs. Reliable programs can be obtained automatically from verified program specifications by code generators. The target languages of the e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c07e541a7d514790c77dd025970a3ccd
https://doi.org/10.1142/s0218194022500401
https://doi.org/10.1142/s0218194022500401
Publikováno v:
Pattern Recognition Letters. 125:13-20
Knowledge graphs usually contain much implicit semantic information, which need to be further recognized through semantic inference. However, existing approaches are either not good at processing large scale data or not powerful enough for digging hi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c4bd2cf89193be849c3183770350fe52
https://doi.org/10.1016/j.patrec.2019.03.012
https://doi.org/10.1016/j.patrec.2019.03.012
Autor:
Dongchen Jiang, Wei Li
Publikováno v:
Journal of Symbolic Computation. 80:87-100
This paper investigates belief revision with uncertainty. Normally, this kind of revision is processed in the framework of possibilistic logic, which is good at processing incomplete and imprecise information. However, the possibilistic logic based r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::169d034366cc8d60adc4c1ba1da88d56
https://doi.org/10.1016/j.jsc.2016.07.011
https://doi.org/10.1016/j.jsc.2016.07.011
Publikováno v:
Artificial Intelligence and Symbolic Computation ISBN: 9783319999562
AISC
AISC
New word detection is of great significance for Chinese text information processing, which directly affects the capabilities of word segmentation, information retrieval and automatic translation. Focusing on the problem of Chinese new word detection,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::66161b3c5b0a0e1888ac56d2f6c534fa
https://doi.org/10.1007/978-3-319-99957-9_17
https://doi.org/10.1007/978-3-319-99957-9_17
Autor:
Dongchen Jiang, Miao Zhou
Publikováno v:
2017 IEEE 2nd Information Technology, Networking, Electronic and Automation Control Conference (ITNEC).
Focusing on the impact different ways of formalization have on the according verifications of sorting algorithm, this paper presents the formal specifications of insertion sort, and verifies its functional correctness using Isabelle/HOL. For the form
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::10b266ffdd4102136ef136664e4f7e87
https://doi.org/10.1109/itnec.2017.8284998
https://doi.org/10.1109/itnec.2017.8284998
Autor:
Dongchen Jiang, Wei Li
Publikováno v:
Science China Information Sciences. 61
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b0475e31ad47295856a6dc24987b8d9b
https://doi.org/10.1007/s11432-017-9155-x
https://doi.org/10.1007/s11432-017-9155-x
Publikováno v:
Frontiers of Computer Science. 7:801-811
This paper proposes a decomposition based algorithm for revision problems in classical propositional logic. A set of decomposing rules are presented to analyze the satisfiability of formulas. The satisfiability of a formula is equivalent to the satis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::29933268bff77bd4f16a59e670b2551d
https://doi.org/10.1007/s11704-013-3089-z
https://doi.org/10.1007/s11704-013-3089-z
Publikováno v:
Science China Information Sciences. 56:1-13
In this paper, we propose a representative model based algorithm to calculate maximal contractions. For a formal theory Γ and a fact set Δ, the algorithm begins by accepting all models of refutation by facts of Γ with respect to Δ and filters the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4eb98d3e7e6487cfab566519ef978cb2
https://doi.org/10.1007/s11432-012-4752-y
https://doi.org/10.1007/s11432-012-4752-y