The construction of a case event logic graph for the judgment documentcan more intuitively retrospect the development of the case. This paperproposes a joint model of event extraction and relationship recognition for ...The construction of a case event logic graph for the judgment documentcan more intuitively retrospect the development of the case. This paperproposes a joint model of event extraction and relationship recognition for judgmentdocuments. By extracting the case information in the judgment document,a case event logic graph was constructed. The development process of the casewas shown, and a reference was provided for the analysis of the context of thecase. The experimental results show that the proposed method can extract eventsand identify the relationship between events, and the F1 value reaches 0.809. Thecase event logic graph reveals the development context of the case accurately andvividly.展开更多
知识图谱嵌入技术已在推荐系统领域引起广泛关注,将结构化知识图谱中的信息融入到推荐模型中,可以提高推荐的个性化程度。然而,因为初始数据的不准确性会导致推荐结果不正确,现存的知识图谱推荐模型中仍存在误差传播问题。针对这个问题...知识图谱嵌入技术已在推荐系统领域引起广泛关注,将结构化知识图谱中的信息融入到推荐模型中,可以提高推荐的个性化程度。然而,因为初始数据的不准确性会导致推荐结果不正确,现存的知识图谱推荐模型中仍存在误差传播问题。针对这个问题,该文提出了RR-KGE模型,由知识图谱嵌入模块和推荐算法模块组成;其中聚焦于知识图谱嵌入框架,将规则嵌入和知识图谱嵌入进行联合学习,通过规则给予模型更多的约束条件,以减少误差传播;并结合此框架将推荐算法ALS(Alternating Least Squares)和RNN(Recurrent Neural Network)相融合来获得更加精确的推荐结果;最后将RR-KGE与不同基准模型进行比较,在两个数据集上多项指标均优于对比模型,证明了推荐方法的有效性。展开更多
This paper proposes an algorithm applied in se mantic P2P network based on the description logics with the purpose for realizing the concepts distribution of resources, which makes the resources semantic locating easy...This paper proposes an algorithm applied in se mantic P2P network based on the description logics with the purpose for realizing the concepts distribution of resources, which makes the resources semantic locating easy. With the idea of the consistent hashing in the Chord, our algorithm stores the addresses and resources with the values of the same type to select instance. In addition, each peer has its own ontology, which will be completed by the knowledge distributed over the network during the exchange of CHGs （classification hierarchy graphs）. The hierarchy classification of concepts allows to find matching resource by querying to the upper level concept because the all concepts described in the CHG have the same root.展开更多
为识别飞行冲突事故的诱发事件与关键演化链路,提出了一种基于事理图谱的事故分析方法。首先依据系统理论过程分析(System Theoretic Process Analysis,STPA)方法辨识飞行冲突场景潜在风险事件,归纳出描述各组件交互过程的场景分析框架...为识别飞行冲突事故的诱发事件与关键演化链路,提出了一种基于事理图谱的事故分析方法。首先依据系统理论过程分析(System Theoretic Process Analysis,STPA)方法辨识飞行冲突场景潜在风险事件,归纳出描述各组件交互过程的场景分析框架;再利用自然语言处理方法从事故文本中提取结构化事件,基于语义相似度匹配建立与风险事件的映射,组成事件演化链条,构建事理图谱;通过对飞行冲突场景进行仿真,运用统计指标定量分析网络拓扑结构,揭示事件对事故演化过程的影响力。结果表明,构建的事理图谱可视化诊断出机组突破管制员指令、机组操作不当导致偏航、航空器机上通讯导航设备故障、管制员纠正指令发布过晚、空中交通预警和防撞系统(Traffic Alert and Collision Avoidance System,TCAS)发出异常措施通告/活动通告(Resolution Advisory/Traffic Advisory,RA/TA)警告、航空器出现飞行汇聚趋势6个诱发事件与3条关键演化链路,其中机组突破管制员指令与管制员指令发布过晚为重点管控事件。展开更多
The Four Color Conjecture is a well-known coloring problem of graphs. Since its advent, there are a lot of solvers. One of the early pioneers was Percy John Heawood, who has proved the Five Color Theorem. In addition,...The Four Color Conjecture is a well-known coloring problem of graphs. Since its advent, there are a lot of solvers. One of the early pioneers was Percy John Heawood, who has proved the Five Color Theorem. In addition, Kempe first demonstrated an important conclusion about planar graph: in any map, there must be a country with five or fewer neighbors. Kempe’s proof proposed two important concepts—“configuration” and “reducibility”, which laid the foundation for further solving the Four Color Problem. The Four Color Problem had previously been proved by use of computer. Based on Kempe’s concepts of “configuration” and “reducibility”, this paper attempts to provide a non-computer proof of the Four Color Problem through rigorous logical analysis.展开更多
基金This work was supported in part by the National Key R&D Program of China under Grant 2018YFC0830104.
文摘The construction of a case event logic graph for the judgment documentcan more intuitively retrospect the development of the case. This paperproposes a joint model of event extraction and relationship recognition for judgmentdocuments. By extracting the case information in the judgment document,a case event logic graph was constructed. The development process of the casewas shown, and a reference was provided for the analysis of the context of thecase. The experimental results show that the proposed method can extract eventsand identify the relationship between events, and the F1 value reaches 0.809. Thecase event logic graph reveals the development context of the case accurately andvividly.
文摘知识图谱嵌入技术已在推荐系统领域引起广泛关注,将结构化知识图谱中的信息融入到推荐模型中,可以提高推荐的个性化程度。然而,因为初始数据的不准确性会导致推荐结果不正确,现存的知识图谱推荐模型中仍存在误差传播问题。针对这个问题,该文提出了RR-KGE模型,由知识图谱嵌入模块和推荐算法模块组成;其中聚焦于知识图谱嵌入框架,将规则嵌入和知识图谱嵌入进行联合学习,通过规则给予模型更多的约束条件,以减少误差传播;并结合此框架将推荐算法ALS(Alternating Least Squares)和RNN(Recurrent Neural Network)相融合来获得更加精确的推荐结果;最后将RR-KGE与不同基准模型进行比较,在两个数据集上多项指标均优于对比模型,证明了推荐方法的有效性。
基金Supported by the National Natural Science Foun-dation of China (60403027)
文摘This paper proposes an algorithm applied in se mantic P2P network based on the description logics with the purpose for realizing the concepts distribution of resources, which makes the resources semantic locating easy. With the idea of the consistent hashing in the Chord, our algorithm stores the addresses and resources with the values of the same type to select instance. In addition, each peer has its own ontology, which will be completed by the knowledge distributed over the network during the exchange of CHGs （classification hierarchy graphs）. The hierarchy classification of concepts allows to find matching resource by querying to the upper level concept because the all concepts described in the CHG have the same root.
文摘The Four Color Conjecture is a well-known coloring problem of graphs. Since its advent, there are a lot of solvers. One of the early pioneers was Percy John Heawood, who has proved the Five Color Theorem. In addition, Kempe first demonstrated an important conclusion about planar graph: in any map, there must be a country with five or fewer neighbors. Kempe’s proof proposed two important concepts—“configuration” and “reducibility”, which laid the foundation for further solving the Four Color Problem. The Four Color Problem had previously been proved by use of computer. Based on Kempe’s concepts of “configuration” and “reducibility”, this paper attempts to provide a non-computer proof of the Four Color Problem through rigorous logical analysis.
