An End-to-End Algorithm for Solving Circuit Problems

被引:11
|
作者
Jian, Pengpeng [1 ]
Sun, Chao [1 ]
Yu, Xinguo [1 ]
He, Bin [1 ]
Xia, Meng [1 ]
机构
[1] Cent China Normal Univ, Natl Engn Res Ctr E Learning, Wuhan, Hubei, Peoples R China
基金
中国国家自然科学基金;
关键词
Circuit problems; end-to-end algorithm; relation extraction; text understanding; schematic understanding; MODEL;
D O I
10.1142/S0218001419400044
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper presents an end-to-end algorithm for solving circuit problems in secondary physics. A key challenge in solving circuit problems is to automatically understand circuit problems over the modals of both text and schematic. Existing methods have a limited capacity in problem understanding due to the they cannot deal with the numerous expressions of problems in natural language and the various circuit diagrams. In fact that this paper, a batch of methods is proposed to work against the challenge of solving circuit problems. The problem understanding is modeled as a problem of relation extraction and a scheme is proposed to extract relations from both text and schematic. A syntax-semantics model is adopted to extract explicit relations from text, whereas a unit-theorem-based method is proposed to extract implicit relations. And a mesh search method is proposed to extract relations from schematic. Based on the result of problem understanding, an algorithm is proposed to produce the solutions of circuit problems, in which the solutions are presented in a readable way. The experimental results demonstrate the effectiveness of the proposed algorithm in solving circuit problems. To the best of our knowledge, this paper is the first literature which reports the quantitative results in understanding and solving circuit problems.
引用
收藏
页数:21
相关论文
共 50 条
  • [1] An accelerated end-to-end method for solving routing problems
    Zhu, Tianyu
    Shi, Xinli
    Xu, Xiangping
    Cao, Jinde
    NEURAL NETWORKS, 2023, 164 : 535 - 545
  • [2] Solving Chemistry Problems via an End-to-End Approach: A Proof of Concept
    Liu, Xiaotong
    Zhang, Tianfu
    Yang, Tao
    Liu, Xiulei
    Song, Xin
    Yang, Yong
    Li, Ning
    Rignanese, Gian-Marco
    Li, Yongwang
    Wen, Xiaodong
    JOURNAL OF PHYSICAL CHEMISTRY A, 2020, 124 (42): : 8866 - 8873
  • [3] End-to-End Verification for Subgraph Solving
    Gocht, Stephan
    McCreesh, Ciaran
    Myreen, Magnus O.
    Nordstrom, Jakob
    Oertel, Andy
    Tan, Yong Kiam
    THIRTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 38 NO 8, 2024, : 8038 - 8047
  • [4] On the academic interview circuit:: An end-to-end discussion
    Çetintemel, U
    SIGMOD RECORD, 2001, 30 (04) : 116 - 122
  • [5] Research Review on Deep Reinforcement Learning for Solving End-to-End Navigation Problems of Mobile Robots
    He, Li
    Yao, Jiacheng
    Liao, Yuxin
    Zhang, Wenzhi
    Lu, Zhaoqing
    Yuan, Liang
    Xiao, Wendong
    Computer Engineering and Applications, 2024, 60 (14) : 1 - 13
  • [6] End-to-end intelligent MCS selection algorithm
    Xue, Xiaosong
    Pan, Wei
    Yan, Fang
    Li, Na
    PROCEEDINGS OF THE 2024 27 TH INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN, CSCWD 2024, 2024, : 1876 - 1880
  • [7] End-to-End Algorithm for Absolute Phase Retrieval
    Lu, Jin
    Li, Yuan
    Xu, Jian
    Wang, Fu P.
    Sun, Xiao G.
    TWELFTH INTERNATIONAL CONFERENCE ON INFORMATION OPTICS AND PHOTONICS (CIOP 2021), 2021, 12057
  • [8] Algorithm of End-to-End Integrated Quality Management
    Filippov, Aleksandr A.
    Antonova, Anastasia A.
    Antonova, Irina I.
    Baranova, Irina A.
    Nazarenko, Maxim A.
    2018 IEEE INTERNATIONAL CONFERENCE QUALITY MANAGEMENT, TRANSPORT AND INFORMATION SECURITY, INFORMATION TECHNOLOGIES (IT&QM&IS), 2018, : 44 - 46
  • [9] An End-to-End Traffic Visibility Regression Algorithm
    Qin, Hongshuai
    Qin, Huibin
    IEEE ACCESS, 2022, 10 : 25448 - 25454
  • [10] Algorithm for Minimum End-to-End Delay Paths
    Rao, Nageswara S. V.
    Batsell, Stephen G.
    IEEE COMMUNICATIONS LETTERS, 1997, 1 (05) : 152 - 154