14:00–14:30 “Reveal.js for mathematicians”, HAMADA Tatsuyoshi (Nihon University / OCAMI)
Many mathematicians are using Beamer, a LaTeX class file, a presentation tool. Ordinary, we use it as a PDF presentation file, which not only supports displaying mathematical expressions, but also supports basic themes and step-by-step display. On the other hand, PDF is primarily designed for printing, so, it requires some efforts to display videos or interactive contents in it.
In this talk, we will propose reveal.js. reveal.js is a presentation tool based on JavaScript. By writing HTML, we can express it on a Web browser. By using KaTeX and MathJAX, it is also possible to display mathematical expressions in LaTeX. Not only supporting basic themes and step-by-step display, but it can display embeded videos and interactive contents. We will show some examples with JavaScript Libraries, such as GeoGebra and p5.js.
14:50–15:20 “Proposals of TeX macros, for creating teaching materials”, NAKAGAWA Yoshiyuki (Ryukoku University)
Not only in mathematics, but also in natural science subjects, for expecting students to be able to learn the standard patterns of thinking, teachers often have to prepare exercises of various types with random numbers, etc. For this purpose, I introduced ‘fp’ and ‘ifthen’ TeX macro packages, and I introduced ‘auto-multiple-choise’, which is the frameset of MCQ tests with automated correction and grading. Hamada introduced a method for linking with the external Computer Algebraic Systems to simplify mathematical expressions.
Hamada’s method is extremely excellent, but it has a weakness. The frequent calls of the external system are too heavy, and it causes a slowdown in operations. By the way, in some calculations such as simplification of rational numbers or square roots of natural numbers, we can do them with TeX macros.
Therefore, in this talk, I suggest how to use TeX macros to handle these simple symbolic computations. I would also like to propose some gadget-like macros to switch between displaying or hiding answers.
Since, in the last year, MSFD36 was postponed by the typhoon, I made some further modifications to the macros. In addition, my TeX macros will be released under a ‘copyleft’ license, so please feel free to extract and modify them if you like.
15:40–16:10 “Automated Code Grading with CES-Alpha: Development and Applications”, LIU, Xuefeng (Tokyo Woman’s Christian Universit/CES-Alpha)
The speaker, as the main developer of CES-Alpha, has developed an automated grading system for coding exercises in 2024, in addition to the existing grading system for mathematical exercises.
Currently, CES-Alpha supports grading for code written in Python, R, and MATLAB. This talk will provide an overview of the data structures used for the code grading, the grading mechanism, and security measures. Furthermore, the effectiveness of integrating this system into courses at Tokyo Woman’s Christian University and TohokuUniversity will be discussed.
16:30–17:20 “Introducing kv: A C++ library for verified numerical computation”, KASHIWAGI Masahide (Waseda University)
Verified numerical computation means a type of numerical methods that not only compute approximate solutions but also provide mathematically rigorous error bounds for those solutions. This is achieved by combining various techniques, including interval arithmetic for evaluating rounding errors and function ranges, fixed-point theorems to guarantee the existence of solutions to equations, and several special operations such as automatic differentiation.
The speaker has been releasing the C++ library kv for verified numerical computation since 2013. In this talk, an overview of verified numerical computation will be presented along with an introduction to the kv library, and a few simple application examples will also be discussed.