Chuan Cai
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Chuan Cai has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Wei Su
Lanzhou University
4 shared publications - Yongna Yuan
Lanzhou University
2 shared publications - Bowang Liu
Lanzhou University
1 shared publication - Hengjie Li
School of Digital Media, Lanzhou University of Arts and Science, Lanzhou 730000, China
1 shared publication - Jiamin Liu
School of Information Science & Engineering, Lanzhou University, Lanzhou, China
1 shared publication Jinzhao Wu
Guangxi University for Nationalities
1 shared publication
Latest Publications
- 12 August 2026
- Published by Springer Nature
- p. 68-76
Q-Matrix Learning Based on Graph Attention Neural Network for Knowledge Tracing
- 12 August 2026
- Published by Springer Nature
- p. 68-76
Q-Matrix Learning Based on Graph Attention Neural Network for Knowledge Tracing
- 26 July 2024
- Published by Springer Nature
- p. 41-56
Attention and Learning Features-Enhanced Knowledge Tracing
- 26 July 2024
- Published by Springer Nature
- p. 41-56
Attention and Learning Features-Enhanced Knowledge Tracing
- Open Access
Complexity of Mathematical Expressions and Its Application in Automatic Answer Checking
The complexity of a mathematical expression is a measure that can be used to compare the expression with other mathematical expressions and judge which one is simpler. In the paper, we analyze three effect factors for the complexity of a mathematical expression: representational length, computational time, and intelligibility. Mainly, the paper introduces a binary-lambda-calculus based calculation method for representational complexity and a rule based calculation method for algebraic computation complexity. In the process of calculating the representation complexity of mathematical expressions, we transform the de bruijn notation into the binary lambda calculus of mathematical expressions that is inspired by compressing symmetry strings in Kolmogorov complexity theorem. Furthermore, the application of complexity of mathematical expressions in MACP, a mathematics answer checking protocol, is also addressed. MACP can be used in a computer aided assessment system in order to compute correct answers, verify equivalence of expressions, check user answers whether in a simplification form, and give automatic partial grades.
Open AccessComplexity of Mathematical Expressions and Its Application in Automatic Answer Checking
The complexity of a mathematical expression is a measure that can be used to compare the expression with other mathematical expressions and judge which one is simpler. In the paper, we analyze three effect factors for the complexity of a mathematical expression: representational length, computational time, and intelligibility. Mainly, the paper introduces a binary-lambda-calculus based calculation method for representational complexity and a rule based calculation method for algebraic computation complexity. In the process of calculating the representation complexity of mathematical expressions, we transform the de bruijn notation into the binary lambda calculus of mathematical expressions that is inspired by compressing symmetry strings in Kolmogorov complexity theorem. Furthermore, the application of complexity of mathematical expressions in MACP, a mathematics answer checking protocol, is also addressed. MACP can be used in a computer aided assessment system in order to compute correct answers, verify equivalence of expressions, check user answers whether in a simplification form, and give automatic partial grades.
- 22 August 2018
- Published by Springer Nature
- p. 237-242
The Accessibility of Mathematical Formulas for the Visually Impaired in China
- 22 August 2018
- Published by Springer Nature
- p. 237-242
The Accessibility of Mathematical Formulas for the Visually Impaired in China