In this study, we propose a way to link the scholarly contents of scientific papers by constructing a knowledge graph based on the semantic organization of argumentation units and relations in scientific papers. We carried out an argumentation graph data model aimed at linking multiple discourses, and also developed a semantic annotation platform for scientific papers and an argumentation graph visualization system. A construction experiment was performed using 12 articles. The final argumentation graph has 1,262 nodes and 1,628 edges, including (...) 1,628 intra-article relations and 190 inter-article relations. Knowledge evolution representation, strategic reading, and automatic abstracting use cases are presented to demonstrate the application of the argumentation graph. In contrast to existing knowledge graphs used in academic fields, the argumentation graph better supports the organization and representation of scientific paper content and can be used as data infrastructure in scientific knowledge retrieval, reorganization, reasoning, and evolution. Moreover, it supports automatic abstract and strategic reading. (shrink)

We study the flow of trigonalizable algebraic group acting on its type space, focusing on the problem raised in [17] of whether weakly generic types coincide with almost periodic types if the group has global definable f‐generic types, equivalently whether the union of minimal subflows of a suitable type space is closed. We shall give a description of f‐generic types of trigonalizable algebraic groups, and prove that every f‐generic type is almost periodic.

In [16], Peterzil and Steinhorn proved that if a group G definable in an o-minimal structure is not definably compact, then G contains a definable torsion-free subgroup of dimension 1. We prove here a p-adic analogue of the Peterzil–Steinhorn theorem, in the special case of abelian groups. Let G be an abelian group definable in a p-adically closed field M. If G is not definably compact then there is a definable subgroup H of dimension 1 which is not definably compact. (...) In a future paper we will generalize this to non-abelian G. (shrink)

Ben shu tan tao le Song Ming li xue yu Ming dai wen xue de guan xi, bing yi ren ge feng fan wei zhong dian shen ru yan jiu le Ming dai wen xue de chuang zuo yu liu bian, jian gou le Ming dai wen xue de chuang zuo yu liu bian jian gou le Ming dai wen xue de fa zhan ti xi, dui Ming dai zhong yao zuo jia, zuo pin ti chu le du dao (...) de kan fa. (shrink)

Recall that a group G has finitely satisfiable generics (fsg) or definable f-generics (dfg) if there is a global type p on G and a small model $M_0$ such that every left translate of p is finitely satisfiable in $M_0$ or definable over $M_0$, respectively. We show that any abelian group definable in a p-adically closed field is an extension of a definably compact fsg definable group by a dfg definable group. We discuss an approach which might prove a similar (...) statement for interpretable abelian groups. In the case where G is an abelian group definable in the standard model $\mathbb {Q}_p$, we show that $G^0 = G^{00}$, and that G is an open subgroup of an algebraic group, up to finite factors. This latter result can be seen as a rough classification of abelian definable groups in $\mathbb {Q}_p$. (shrink)

The aim of this paper is to develop the theory of groups definable in the p-adic field ${{\mathbb {Q}}_p}$, with “definable f-generics” in the sense of an ambient saturated elementary extension of ${{\mathbb {Q}}_p}$. We call such groups definable f-generic groups.So, by a “definable f-generic” or $dfg$ group we mean a definable group in a saturated model with a global f-generic type which is definable over a small model. In the present context the group is definable over ${{\mathbb {Q}}_p}$, and (...) the small model will be ${{\mathbb {Q}}_p}$ itself. The notion of a $\mathrm {dfg}$ group is dual, or rather opposite to that of an $\operatorname {\mathrm {fsg}}$ group (group with “finitely satisfiable generics”) and is a useful tool to describe the analogue of torsion-free o-minimal groups in the p-adic context.In the current paper our group will be definable over ${{\mathbb {Q}}_p}$ in an ambient saturated elementary extension $\mathbb {K}$ of ${{\mathbb {Q}}_p}$, so as to make sense of the notions of f-generic type, etc. In this paper we will show that every definable f-generic group definable in ${{\mathbb {Q}}_p}$ is virtually isomorphic to a finite index subgroup of a trigonalizable algebraic group over ${{\mathbb {Q}}_p}$. This is analogous to the o-minimal context, where every connected torsion-free group definable in $\mathbb {R}$ is isomorphic to a trigonalizable algebraic group [5, Lemma 3.4]. We will also show that every open definable f-generic subgroup of a definable f-generic group has finite index, and every f-generic type of a definable f-generic group is almost periodic, which gives a positive answer to the problem raised in [28] of whether f-generic types coincide with almost periodic types in the p-adic case. (shrink)

It is known Hrushovski and Pillay that a group G definable in the field \ of p-adic numbers is definably locally isomorphic to the group \\) of p-adic points of a algebraic group H over \. We observe here that if H is commutative then G is commutative-by-finite. This shows in particular that any one-dimensional group G definable in \ is commutative-by-finite. This result extends to groups definable in p-adically closed fields. We prove our results in the more general context (...) of geometric structures. (shrink)

全书分为“科教兴国”、“走向世界”、“弘扬科智”、“控制论与人口”、“断代工程”以及“师师仰贤”六个部分,共收入作品80余篇。.

Ben shu gong fen wei liu zhang, qi zhu yao bao kuo: xu lun ; Shao Yong sheng ping ji qi zhu zuo wen ben kao bian ; Shao Yong xue shu si xiang de li shi bei jing ji yuan yuan ; Shao Yong xue shu si xiang yuan yuan; shao yong yi shu yu yi tu si xiang tan jiu deng nei rong.

Simion and Kelp develop the obligation-based account of trustworthiness as a compelling general account of trustworthiness and then apply this account to various instances of AI. By doing so, they explain in what way any AI can be considered trustworthy, as per the general account. Simion and Kelp identify that any account of trustworthiness that relies on assumptions of agency that are too anthropocentric, such as that being trustworthy, must involve goodwill. I argue that goodwill is a necessary condition for (...) being trustworthy and further suggest a network account of trustworthy AI, which retains the goodwill as the essential requirement for the concept of trustworthiness and meanwhile predicts that current AI can be trustworthy. The alternative account suggests that the focus of trustworthy AI is not merely AI technology, but the whole network of AI involving AI technology, AI designers, AI companies, and other social and legal institutions. A trustworthy AI requires that AI technology is reliable and that other involved agents are trustworthy. (shrink)