Directory of Researchers

NAGASAKA Kosaku
Graduate School of Human Development and Environment / Department of Human Environmental Science
Associate Professor
Mathematics
Last Updated :2021/12/03

Researcher Profile and Settings

Affiliation

  • <Faculty / Graduate School / Others>

    Graduate School of Human Development and Environment / Department of Human Environmental Science
  • <Related Faculty / Graduate School / Others>

    Faculty of Global Human Sciences / Department of Environment and Sustainability, Faculty of Human Development / Department of Human Environmental Science

Teaching

Research Activities

Research Interests

  • computational algebra
  • computer algebra
  • mathematical education
  • symbolic manipulation
  • symbolic computation

Research Areas

  • Natural sciences / Algebra / computer algebra
  • Informatics / Information theory / computer algebra

Committee Memberships

  • Jun. 2021 - Present, Maple Transactions, Associate Editor
  • Aug. 2016 - Present, ACM Communications in Computer Algebra, Associate Editor
  • Apr. 2018 - Mar. 2022, 日本数式処理学会, 教育分科会運営委員会 委員長
  • Apr. 2008 - Mar. 2022, 日本数式処理学会, 代表会員
  • Apr. 2016 - Mar. 2018, 日本数式処理学会, 大会プログラム委員会 委員長
  • Apr. 2014 - Mar. 2016, 日本数式処理学会, システム分科会運営委員会 副委員長
  • 2014 - 2014, SNC 2014 (Symobolic-Numeric Computation, 2014), Program Committee
  • 2014 - 2014, ISSAC 2014 (International Symposium on Symbolic and Algebraic Computation, 2014), General Co-Chair and Local Chair
  • 2012 - 2012, ASCM 2012 (Asian Symposium on Computer Mathematics, 2012), Program Committee
  • 2011 - 2011, SNC 2011 (Symobolic-Numeric Computation, 2011), Program Committee
  • 2009 - 2009, ISSAC 2009 (International Symposium on Symbolic and Algebraic Computation, 2009), Program Committee
  • 2009 - 2009, CASC 2009 (Computer Algebra in Scientific Computing, 2009), Local Organizing Committee Chair
  • 2006 - 2006, ISSAC 2006 (International Symposium on Symbolic and Algebraic Computation, 2006), Poster and Software Demos Co-Chair
  • Jul. 2021 - Jul. 2022, ISSAC 2022 (International Symposium on Symbolic and Algebraic Computation, 2022), Program Committee

Awards

  • Jun. 2005 Japan Society for Symbolic and Algebraic Computation, Encouragement Prize, 多変数多項式の絶対既約半径の改善について

    NAGASAKA KOSAKU

Published Papers

  • Kosaku Nagasaka

    Elsevier BV, Jul. 2021, Journal of Symbolic Computation, 105, 4 - 27, English

    [Refereed]

    Scientific journal

  • Kosaku Nagasaka

    Elsevier BV, May 2021, Journal of Symbolic Computation, 104, 402 - 418, English

    [Refereed]

    Scientific journal

  • 多肢選択問題の自動生成 - 数学IIIの微分積分から偏微分まで -

    長坂耕作

    Apr. 2021, 京都大学数理解析研究所講究録, 2178, 31 - 38, Japanese

    Symposium

  • Multiple-choice questions in Mathematics: automatic generation, revisited

    Kosaku Nagasaka

    Dec. 2020, Electronic Proceedings of the 25th Asian Technology Conference in Mathematics, 21785-1 - 21785-15, English

    [Refereed][Invited]

    International conference proceedings

  • Approximate GCD by Bernstein Basis, and its Applications

    Kosaku Nagasaka

    Jul. 2020, Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation, ISSAC 2020, 372 - 379, English

    [Refereed]

    International conference proceedings

  • パラメータを含む1変数多項式の因数分解について

    関 伯実, 長坂耕作

    Jun. 2020, 京都大学数理解析研究所講究録, 2159, 137 - 142, Japanese

    Symposium

  • バーンスタイン基底関数を用いた近似GCDの評価について

    長坂耕作

    Jun. 2020, 京都大学数理解析研究所講究録, 2159, 132 - 136, Japanese

    Symposium

  • Moodle XML Question Generator for Python

    長坂耕作

    Dec. 2019, 京都大学数理解析研究所講究録, 2142, 67 - 70, Japanese

    Symposium

  • 近似GCDの枠組みでの近似無平方分解

    長坂耕作

    Dec. 2019, 京都大学数理解析研究所講究録, 2138, 96 - 100, Japanese

    Symposium

  • 近似GCDアルゴリズムの新たな組み合わせ

    NAGASAKA KOSAKU

    Feb. 2019, 京都大学数理解析研究所講究録, 2104, 14 - 19, Japanese

    Symposium

  • Moodle KaTeX filter

    NAGASAKA KOSAKU

    Feb. 2019, 京都大学数理解析研究所講究録, 2105, 106 - 108, Japanese

    Symposium

  • 数式処理と学習管理システム - 静的評価の再評価 -

    NAGASAKA KOSAKU

    Apr. 2018, 京都大学数理解析研究所講究録, 2067, 160 - 169, Japanese

    Symposium

  • Kosaku Nagasaka

    Computing the greatest common divisor (GCD) of polynomials can be done by computing the Gröbner basis instead of the well-known Euclidean algorithm, studied by Gianni and Trager in 1985, and Sasaki and Suzuki in 1992. In this paper, we extend their theories to polynomials with parameters. That is the theory of parametric greatest common divisors by means of comprehensive Gröbner systems (CGS). Moreover, this can be considered as an indirect extension of known parametric GCD algorithms to those for several multivariate polynomials with parameters.

    Association for Computing Machinery, 23 Jul. 2017, Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC, 129312, 341 - 348, English

    [Refereed]

    International conference proceedings

  • 平成28年度RIMS共同研究「数式処理の新たな発展」:その最新研究と基礎理論の再構成

    NAGASAKA KOSAKU

    Apr. 2017, 京都大学数理解析研究所講究録, 2019, 1 - 2, Japanese

    Symposium

  • Kosaku Nagasaka

    Association for Computing Machinery, 01 Mar. 2017, ACM Communications in Computer Algebra, 51 (1), 15 - 17, English

    [Refereed]

    Scientific journal

  • Approximate Polynomial GCD over Integers with Digits-wise Lattice

    NAGASAKA KOSAKU

    Japan Society for Symbolic and Algebraic Computation, Mar. 2016, Communications of JSSAC, 2, 15 - 32, English

    [Refereed]

    Scientific journal

  • 近似GCDにおける逐次的なQR分解法とその実装について

    NAGASAKA KOSAKU

    Dec. 2015, 京都大学数理解析研究所講究録, 1976, 1 - 7, Japanese

    Symposium

  • 近似GCDの安定性について

    NAGASAKA KOSAKU

    Jul. 2015, 京都大学数理解析研究所講究録, 1955, 42 - 47, Japanese

    Symposium

  • The Berlekamp Algorithm -サーベイと試み-

    NAGASAKA KOSAKU

    Jan. 2015, 京都大学数理解析研究所講究録, 1930, 15 - 25, Japanese

    Symposium

  • 近似GCDアルゴリズムにおける枢軸選択の影響

    NAGASAKA KOSAKU

    Jul. 2014, 京都大学数理解析研究所講究録, 1907, 8 - 19, Japanese

    Symposium

  • SNAPパッケージとQRGCDアルゴリズムの改善

    MASUI TAKAAKI, NAGASAKA KOSAKU

    Jul. 2013, 京都大学数理解析研究所講究録, 1843, 101 - 113, Japanese

    Symposium

  • 厳密に与えられた系のGroebner基底を数値的に求める場合に必要な桁精度の考察

    NAGASAKA KOSAKU

    九州大学 マス・フォア・インダストリ研究所, 2013, MI レクチャーノート, 49, 104 - 111, Japanese

    Symposium

  • Revisiting QRGCD and Comparison with ExQRGCD

    NAGASAKA KOSAKU, MASUI TAKAAKI

    2013, ACM Communications in Computer Algebra, 47 (3), 88 - 89, English

    [Refereed]

    Symposium

  • Extended QRGCD Algorithm

    Kosaku Nagasaka, Takaaki Masui

    For computing the greatest common divisor of two univariate polynomials with a priori numerical errors on their coefficients, we use several approximate polynomial GCD algorithms: QRGCD, UVGCD, STLN-based, Fastgcd, GPGCD and so on. Among them, QRGCD is the most common algorithm since it has been distributed as a part of Maple and there are many papers including their comparisons of efficiency and effectiveness against QRGCD. In this paper, we give an improved QRGCD algorithm (ExQRGCD) which is unfortunately not faster than the original but more accurate and the resulting perturbation is able to satisfy the given tolerance.

    SPRINGER-VERLAG BERLIN, 2013, COMPUTER ALGEBRA IN SCIENTIFIC COMPUTING, CASC 2013, 8136, 257 - 272, English

    [Refereed]

    International conference proceedings

  • 近似Groebner基底の逐次算法に向けて

    NAGASAKA KOSAKU

    Oct. 2012, 京都大学数理解析研究所講究録, 1815, 70 - 78, Japanese

    Symposium

  • 近似Groebner基底に向けて

    NAGASAKA KOSAKU

    Oct. 2012, 京都大学数理解析研究所講究録, 1814, 160 - 167, Japanese

    Symposium

  • 近似代数の汎用ライブラリに向けて

    NAGASAKA KOSAKU

    May 2012, 京都大学数理解析研究所講究録, 1793, 30 - 37, Japanese

    Symposium

  • 近似GCDの無平方分解への応用

    NAGASAKA KOSAKU

    Mar. 2012, 京都大学数理解析研究所講究録, 1785, 1 - 7, Japanese

    Symposium

  • Backward error analysis of approximate Groebner basis

    NAGASAKA KOSAKU

    2012, ACM Communications in Computer Algebra, 46 (3), 116 - 117, English

    [Refereed]

    Symposium

  • Kosaku Nagasaka

    Symbolic numeric algorithms for polynomials are very important, especially for practical computations since we have to operate with empirical polynomials having numerical errors on their coefficients. Recently, for those polynomials, a number of algorithms have been introduced, such as approximate univariate GCD and approximate multivariate factorization for example. However, for polynomials over integers having coefficients rounded from empirical data, changing their coefficients over reals does not remain them in the polynomial ring over integers; hence we need several approximate operations over integers. In this paper, we discuss computing a polynomial GCD of univariate or multivariate polynomials over integers approximately. Here, "approximately" means that we compute a polynomial GCD over integers by changing their coefficients slightly over integers so that the input polynomials still remain over integers. (C) 2011 Elsevier Ltd. All rights reserved.

    ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD, Dec. 2011, JOURNAL OF SYMBOLIC COMPUTATION, 46 (12), 1306 - 1317, English

    [Refereed]

    Scientific journal

  • 準同型暗号と整数及び整数多項式の近似GCD

    NAGASAKA KOSAKU

    Sep. 2011, 京都大学数理解析研究所講究録, 1759, 115 - 123, Japanese

    Symposium

  • Kosaku Nagasaka

    We compute an approximate greatest common divisor (GCD) of co-prime polynomials over integers by changing their coefficients slightly over integers so that the input polynomials still remain over integers. In this paper, we give an improved algorithm with a new lattice construction process by which we can restrict the range of perturbations in some cases. Copyright © 2011 ACM.

    2011, SNC'11 - Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation, 63 - 64, English

    [Refereed]

    International conference proceedings

  • Computing a Structured Grobner Basis Approximately

    Kosaku Nagasaka

    There are several preliminary definitions for a Grobner basis with inexact input since computing such a basis is one of the challenging problems in symbolic-numeric computations for several decades. A structured Grobner basis is such a basis defined from the data mining point of view: how to extract a meaningful result from the given inexact input when the amount of noise is not small or we do not have enough information about the input. However, the known algorithm needs a suitable (unknown) information on terms required for a variant of the Buchberger algorithm. In this paper, we introduce an improved version of the algorithm that does not need any extra information in advance.

    ASSOC COMPUTING MACHINERY, 2011, ISSAC 2011: PROCEEDINGS OF THE 36TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION, 273--280, 273 - 280, English

    [Refereed]

    International conference proceedings

  • 数式処理による教育の充実

    NAGASAKA KOSAKU

    Jan. 2010, 京都大学数理解析研究所講究録, 1674, 1 - 4, Japanese

    Symposium

  • 近似GCDによる人間らしい簡単化

    NAGASAKA KOSAKU

    Oct. 2009, 京都大学数理解析研究所講究録, 1666, 145 - 152, Japanese

    Symposium

  • Ruppert行列による近似GCDの算出

    NAGASAKA KOSAKU

    Jun. 2009, 京都大学数理解析研究所講究録, 1652, 63 - 70, Japanese

    Symposium

  • 数式処理ソフトと正課外活動

    NAGASAKA KOSAKU, TAKAHASHI TADASHI

    Jan. 2009, 京都大学数理解析研究所講究録, 1624, 45 - 48, Japanese

    Symposium

  • A Study on Grobner Basis with Inexact Input

    Kosaku Nagasaka

    Grobner basis is one of the most important tools in recent symbolic algebraic computations. However, computing a Grobner basis for the given polynomial ideal is not easy and it is riot numerically stable if polynomials have inexact coefficients. In this paper, we study what we should get for computing a Grobner basis with inexact coefficients and introduce a naive method to compute a Grobner basis by reduced row echelon form, for the ideal generated by the given polynomial set having a priori errors on their coefficients.

    SPRINGER-VERLAG BERLIN, 2009, COMPUTER ALGEBRA IN SCIENTIFIC COMPUTING, PROCEEDINGS, 5743, 247 - 258, English

    [Refereed]

    International conference proceedings

  • Approximate Polynomial GCD over Integers

    NAGASAKA KOSAKU

    2008, ACM Communications in Computer Algebra, 42 (3), 124 - 126, English

    [Refereed]

    Symposium

  • 整数係数多項式の近似GCD II

    NAGASAKA KOSAKU

    Nov. 2007, 京都大学数理解析研究所講究録, 1572, 50 - 58, Japanese

    Symposium

  • Symbolic-Numeric Algebra for Polynomials

    Kosaku Nagasaka

    2007, The Mathematica Journal, Vol. 10(3), 593-616, English

    [Refereed]

    Scientific journal

  • SNAP package for Mathematica

    NAGASAKA KOSAKU

    2007, ACM Communications in Computer Algebra, 41 (3), 105 - 106, English

    [Refereed]

    Symposium

  • Ruppert matrix as subresultant mapping

    Kosaku Nagasaka

    Ruppert and Sylvester matrices are very common for computing irreducible factors of bivariate polynomials and computing polynomial greatest common divisors, respectively. Since Ruppert matrix comes from Ruppert criterion for bivariate polynomial irreducibility testing and Sylvester matrix comes from the usual subresultant mapping, they are used for different purposes and their relations have not been focused yet. In this paper, we show some relations between Ruppert and Sylvester matrices as the usual subresultant mapping for computing (exact/approximate) polynomial GCDs, using Ruppert matrices.

    SPRINGER-VERLAG BERLIN, 2007, Computer Algebra in Scientific Computing, Proceedings, 4770, 316 - 327, English

    [Refereed]

    International conference proceedings

  • Development of an Empowerment System for Citizens in Science and Technology II : Starting Science Cafe Kobe

    ITOH Masayuki, TANAKA Shigenori, EBINA Kuniyoshi, NAGASAKA Kosaku, OHMIDO Nobuko, OGASAWARA Fumie, SAKURAI Kaori, HAMAOKA Rie

    Aug. 2006, 日本科学教育学会研究会研究報告, Vol. 21, No. 1, pp. 37-42, Japanese

    Scientific journal

  • Using Coefficient-wise Tolerance in Symbolic-Numeric Algorithms for Polynomials

    NAGASAKA, Kosaku

    Mar. 2006, 数式処理, 12-3, 21-30, English

    [Refereed]

    Scientific journal

  • Developement of an Empowerment System for Citizens in Science and Technology

    ITOH, Masayuki, OGAWA, Masataka, TAKEDA, Yoshiaki, USHIMARU, Atsushi, TAINOSHO, Yoshiaki, EBINA, Kuniyoshi, OHMIDO, Nobuko, SHIRASUGI, Naoko, NAGASAKA, Kosaku, TANAKA, Shigenori, SANUKIDA, Satoshi, NOBUKAWA, Takako

    Sep. 2005, 科教研報, 20・2, 47-51, Japanese

    Scientific journal

  • On the Degeneracy Conditions of Singularities by using CGBs

    TAKAHASHI, Tadashi, NAGASAKA, Kosaku

    Apr. 2005, Algorithmic Algebra and Logic 2005 (Conference in Honor of the 60th Birthday of Volker Weispfenning). Proc. A3L, , 253p-256p, English

    [Refereed]

    Scientific journal

  • Towards more accurate separation bounds of empirical polynomials II

    K Nagasaka

    We study the problem of bounding a polynomial which is absolutely irreducible, away from polynomials which are not absolutely irreducible. These separation bounds are useful for testing whether an empirical polynomial is absolutely irreducible or not, for the given tolerance or error bound of its coefficients. In the former paper, we studied some improvements on Kaltofen and May's method which finds applicable separation bounds using an absolute irreducibility criterion due to Ruppert. In this paper, we study the similar improvements on the method using the criterion due to Gao and Rodrigues for sparse polynomials satisfying Newton polytope conditions, by which we are able to find more accurate separation bounds, for such bivariate polynomials. We also discuss a concept of separation bound continuations for both dense and sparse polynomials.

    SPRINGER-VERLAG BERLIN, 2005, COMPUTER ALGEBRA IN SCIENFIFIC COMPUTING, PROCEEDINGS, 3718, 318 - 329, English

    [Refereed]

    Scientific journal

  • SNAP Package for Mathematica and Its Applications

    NAGASAKA, Kosaku

    Dec. 2004, Proc. The Ninth Asian Technology Conference in Mathematics (ATCM2004), , 308-316, English

    [Refereed]

    International conference proceedings

  • Towards More Accurate Separation Bounds of Empirical Polynomials

    NAGASAKA, Kosaku

    2004, SIGSAM Bulletin: Communications in Computer Algebra, 38(4), 119-129, English

    [Refereed]

    Scientific journal

  • Neighborhood Irreducibility Testing of Multivariate Polynomials

    NAGASAKA, Kosaku

    Sep. 2003, Proc. Computer Algebra in Scientific Computing (CASC2003), 283-292, English

    [Refereed]

    Scientific journal

  • Towards Certified Irreducibility Testing of Bivariate Approximate Polynomials

    NAGASAKA, Kosaku

    Jul. 2002, Proc. International Symposium on Symbolic and Algebraic Computation (ISSAC2002), 192-199, English

    [Refereed]

    Scientific journal

  • Estimation of Cancellation Errors in Multivariate Hensel Construction with Floating-Point Numbers

    NAGASAKA, Kosaku

    Dec. 2001, Proc. The Sixth Asian Technology Conference in Mathematics (ATCM2001), 408-415, English

    [Refereed]

    International conference proceedings

  • Kosaku Nagasaka

    Springer International Publishing, Aug. 2021, Computer Algebra in Scientific Computing (CASC 2021, Lecture Notes in Computer Science), 12865, 272 - 292, English

    [Refereed]

    International conference proceedings

  • グレブナー基底の項順序についての再考

    大島谷遼, 長坂耕作

    Apr. 2021, 京都大学数理解析研究所講究録, 2185, 22 - 28, Japanese

    Symposium

  • 近似GCDでのNewtonSLRAアルゴリズムの効果的な利用に向けて

    長坂耕作

    Apr. 2021, 京都大学数理解析研究所講究録, 2185, 16 - 21, Japanese

    Symposium

  • 単純な手書き計算ソフトの可能性を探る

    長坂 耕作, 丸山 真穂

    Nov. 2013, 京都大学数理解析研究所講究録, 1865, 164 - 170, Japanese

    Symposium

MISC

  • Kosaku Nagasaka, Agnes Szanto, Franz Winkler

    ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD, Jul. 2016, JOURNAL OF SYMBOLIC COMPUTATION, 75, 1 - 3, English

    Others

  • 国際研究集会の仕組みとその運営 - ISSAC 2014 -

    NAGASAKA KOSAKU

    Dec. 2014, 京都大学数理解析研究所講究録, 1927, 103 - 105, Japanese

    [Invited]

    Lecture materials

  • 手で触る数理情報教育

    宮田 任寿, Kosaku Nagasaka, 高橋 正

    Mar. 2007, 神戸大学発達科学部研究紀要, 第14巻,第2号, Japanese

    Report scientific journal

  • On the Theorem Prover using Computer Algebra Systems in Mathematics Education

    FUNAKOSHI, Shunsuke, TATSUMI, Takeo, NAGASAKA, Kosaku, DEGUCHI, Hiroaki, TAKAHASHI, Tadashi

    Mar. 2005, 科学研究費補助金基盤研究 (B)(2)「大学における数理情報教育に求められている課題の分析とその改善に関する研究」研究成果中間報告書, , 47p-52p, English

    Report scientific journal

Books etc

  • Fundamentals of Computer Algebra

    NAGASAKA KOSAKU, IWANE Hidenao, KITAMOTO Takuya, SANUKI Masaru, TERUI Akira, NABESHIMA Katsusuke

    KYORITSU SHUPPAN CO., LTD., Mar. 2019, Japanese, 正誤表は共立出版ウェブ: https://www.kyoritsu-pub.co.jp/bookdetail/9784320113732, ISBN: 9784320113732

    Scholarly book

  • 入門Mathematica【決定版】Ver.7対応

    Kosaku Nagasaka, 日本Mathematicaユーザー会 編著

    Joint work, 東京電機大学出版局, Jun. 2009, Japanese

    Others

  • キーワード 人間と発達[増補改訂版] V. 生活とテクノロジー

    丸谷 宣子, 井上 真理, 青木 務, 平山 洋介, 市橋 秀樹, 浜口 八朗, 高橋 正, 長坂 耕作, 矢野 澄雄, 福田 博也, 城 仁士, 阪本 雄二, 高橋 譲嗣, 高橋 真, 白倉 暉弘, 稲葉 太一, 白杉 直子, 近江戸 伸子, 宮田 任寿, 澤 宗則, 二宮 厚美

    Joint work, 大学教育出版, Apr. 2007, Japanese

    Textbook

Presentations

  • グレブナー基底の項順序についての再考

    大島谷遼, 長坂耕作

    研究集会 Computer Algebra - Theory and its Applications, 21 Dec. 2020, Japanese

    Oral presentation

  • 近似GCDでのNewtonSLRAアルゴリズムの効果的な利用に向けて

    長坂耕作

    研究集会 Computer Algebra - Theory and its Applications, 21 Dec. 2020, Japanese

    Oral presentation

  • Multiple-choice questions in Mathematics: automatic generation, revisited

    Kosaku Nagasaka

    The 25th Asian Technology Conference in Mathematics, ATCM 2020, 15 Dec. 2020, English

    [Invited]

    Invited oral presentation

  • 多肢選択問題の自動生成 – 数学 III の微分積分から偏微分まで –

    長坂耕作

    研究集会 数学ソフトウェアとその効果的教育利用に関する研究, 28 Nov. 2020, Japanese

    Oral presentation

  • 近似GCD関連問題におけるNewtonSLRAアルゴリズムの評価

    長坂耕作

    日本数式処理学会第29回大会, 31 Oct. 2020, Japanese

    Oral presentation

  • Approximate GCD by Bernstein Basis, and its Applications

    Kosaku Nagasaka

    The 45th International Symposium on Symbolic and Algebraic Computation, ISSAC 2020, 21 Jul. 2020, English

    Oral presentation

  • Python版Moodle向け多肢選択問題の作成モジュールについて

    長坂耕作

    日本数式処理学会 第14期第3回 教育分科会, 24 Feb. 2020, Japanese

    Oral presentation

  • パラメータを含む1変数多項式の有限体上の因数分解について

    関伯実, 長坂耕作

    研究集会 Computer Algebra - Theory and its Applications, Dec. 2019, Japanese

    Oral presentation

  • バーンスタイン基底関数を用いた近似GCDの評価について

    長坂耕作

    研究集会 Computer Algebra - Theory and its Applications, Dec. 2019, Japanese

    Oral presentation

  • Moodle XML Question Generator for Python

    KOSAKU NAGASAKA

    研究集会 数学ソフトウェアとその効果的教育利用に関する研究, Aug. 2019, Japanese

    Oral presentation

  • Jupyter Notebook で SymPy を使った授業展開について

    長坂耕作

    日本数式処理学会 第14期第2回 教育分科会ワークショップ, Aug. 2019, Japanese

    Oral presentation

  • Pythonによる多肢選択問題の生成について

    長坂耕作

    日本数式処理学会 第14期第2回 教育分科会ワークショップ, Aug. 2019, Japanese

    Oral presentation

  • 近似GCDとその応用

    長坂耕作

    第28回 日本数式処理学会大会, Jun. 2019, Japanese

    Oral presentation

  • 数学ソフトウェアと教材形式

    NAGASAKA KOSAKU

    日本数式処理学会 第14期第1回 教育分科会ワークショップ, Feb. 2019, Japanese, Domestic conference

    Oral presentation

  • 近似GCDの枠組みでの近似無平方分解

    NAGASAKA KOSAKU

    研究集会 Computer Algebra - Theory and its Applications, Dec. 2018, Japanese, 京都大学数理解析研究所, Domestic conference

    Oral presentation

  • スマートフォン適応のLMS用反転学習問題教材のCASによる自動生成について

    吉冨 賢太郎, NAGASAKA KOSAKU

    PCカンファンレンス北海道 2018, Nov. 2018, Japanese, 北翔大学, Domestic conference

    Oral presentation

  • スマートフォン適応のLMS用反転学習問題教材のCASによる自動生成

    吉冨 賢太郎, NAGASAKA KOSAKU

    教育システム情報学会 第43回 全国大会, Sep. 2018, Japanese, 北星学園大学, Domestic conference

    Oral presentation

  • Moodle KaTeX filter

    NAGASAKA KOSAKU

    研究集会 数学ソフトウェアとその効果的教育利用に関する研究, Aug. 2018, Japanese, 京都大学数理解析研究所, Domestic conference

    Oral presentation

  • 近似 GCD アルゴリズムの性能評価と選択基準

    NAGASAKA KOSAKU

    第27回 日本数式処理学会大会, Jun. 2018, Japanese, Domestic conference

    Oral presentation

  • 近似GCDアルゴリズムの新たな組み合わせ

    NAGASAKA KOSAKU

    研究集会 Computer Algebra - Theory and its Applications, Dec. 2017, Japanese, 京都大学数理解析研究所, Domestic conference

    Oral presentation

  • 数式処理と学習管理システム - 静的評価の再評価 -

    NAGASAKA KOSAKU

    研究集会 数学ソフトウェアとその効果的教育利用に関する研究, Sep. 2017, Japanese, 京都大学数理解析研究所, Domestic conference

    Oral presentation

  • ISSAC 2017とSC^2 2017の報告

    NAGASAKA KOSAKU

    研究集会 数式処理研究の新たな発展, Sep. 2017, Japanese, 京都大学数理解析研究所, Domestic conference

    Oral presentation

  • STLN-GCDの実装とその性能評価について

    NAGASAKA KOSAKU

    第26回 日本数式処理学会大会, Jun. 2017, Japanese, Domestic conference

    Oral presentation

  • パラメータを伴う最大公約因子計算における停止性

    NAGASAKA KOSAKU

    日本数式処理学会合同分科会, Jan. 2017, Japanese, Domestic conference

    Oral presentation

  • パラメータを含んだ多項式の最大公約因子の計算法

    NAGASAKA KOSAKU

    研究集会 Computer Algebra and Related Topics, Dec. 2016, Japanese, 京都大学数理解析研究所, Domestic conference

    Oral presentation

  • Seeking Better Algorithms for Approximate GCD

    NAGASAKA KOSAKU

    ISSAC 2016 (Poster presentations), Jul. 2016, English, International conference

    Poster presentation

  • Approximate GCD and Its Implementations

    NAGASAKA KOSAKU

    Milestones in Computer Algebra, MICA2016, Jul. 2016, English, International conference

    Oral presentation

  • 近似GCDの大規模実験とExQRGCDの性能向上について

    NAGASAKA KOSAKU

    第25回 日本数式処理学会大会, Jun. 2016, Japanese, Domestic conference

    Oral presentation

  • 近似GCDにおける逐次的なQR分解法とその実装について II

    NAGASAKA KOSAKU

    研究集会 Computer Algebra and Related Topics, Dec. 2015, Japanese, Domestic conference

    Oral presentation

  • 近似GCDにおける逐次的なQR分解法とその実装について

    NAGASAKA KOSAKU

    研究集会 数式処理研究の新たな発展, Aug. 2015, Japanese, Domestic conference

    Oral presentation

  • 近似GCD向けChasingアルゴリズム改良の試み

    NAGASAKA KOSAKU

    第24回 日本数式処理学会大会, Jun. 2015, Japanese, Domestic conference

    Oral presentation

  • Symbolic-Numeric Methodologies in Computer Algebra

    NAGASAKA KOSAKU

    Computer Algebra Seminar, Mar. 2015, English, Takikawa memorial Hall in Kobe University, International conference

    Oral presentation

  • 近似 GCD の安定性について

    NAGASAKA KOSAKU

    研究集会 Computer Algebra and Related Topics, Dec. 2014, Japanese, 京都大学数理解析研究所, Domestic conference

    Oral presentation

  • 国際研究集会の仕組みとその運営 - ISSAC 2014 -

    NAGASAKA KOSAKU

    研究集会 数式処理研究の新たな発展, Aug. 2014, Japanese, 京都大学数理解析研究所, Domestic conference

    [Invited]

    Invited oral presentation

  • fastgcdとuvgcdの改良について

    NAGASAKA KOSAKU

    第23回 日本数式処理学会大会, May 2014, Japanese, Domestic conference

    Oral presentation

  • 近似GCDの速度比較 qrgcdからfastgcdまで

    NAGASAKA KOSAKU

    Risa/Asir Conference 2014, Mar. 2014, Japanese, 神戸大学, Domestic conference

    Oral presentation

  • 近似 GCD アルゴリズムにおける枢軸選択の影響

    NAGASAKA KOSAKU

    研究集会 Computer Algebra and Related Topics, Dec. 2013, Japanese, 京都大学数理解析研究所, Domestic conference

    Oral presentation

  • 厳密に与えられた系のGroebner基底を数値的に求める場合に必要な桁精度の考察

    NAGASAKA KOSAKU

    研究集会 数式処理研究と産学連携の新たな発展, Aug. 2013, English, 九州大学 マス・フォア・インダストリ研究所, Domestic conference

    Oral presentation

  • 近似GCDの性能評価 - LIBSNAPにおける3つの実装 -

    NAGASAKA KOSAKU

    第22回 日本数式処理学会大会, Jun. 2013, Japanese, 防衛大学校, Domestic conference

    Oral presentation

  • 近似GCDアルゴリズムの改良 - QRGCDの解析とExQRGCDとの比較 -

    NAGASAKA KOSAKU, 増井 貴明

    第42回数値解析シンポジウム, Jun. 2013, Japanese, 愛媛, Domestic conference

    Oral presentation

  • Revisiting QRGCD and Comparison with ExQRGCD

    NAGASAKA KOSAKU, MASUI TAKAAKI

    ISSAC 2013 (Poster presentations), Jun. 2013, English, Boston, USA, International conference

    Poster presentation

  • ExQRGCDの近似代数ライブラリLIBSNAPへの実装について

    NAGASAKA KOSAKU

    Risa/Asir Conference 2013, Mar. 2013, Japanese, 神戸大学, Domestic conference

    Oral presentation

  • SNAP パッケージと QRGCD アルゴリズムの改善

    増井 貴明, NAGASAKA KOSAKU

    研究集会 Computer Algebra - The Algorithms, Implementations and the Next Generation, Dec. 2012, Japanese, 京都大学数理解析研究所, Domestic conference

    Oral presentation

  • The Berlekamp Algorithm -サーベイと試み-

    長坂 耕作

    研究集会 数式処理研究の新たな発展, Jul. 2012, Japanese, 京都大学数理解析研究所, Domestic conference

    Oral presentation

  • Backward error analysis of approximate Gröbner basis

    Kosaku NAGASAKA

    The International Symposium on Symbolic and Algebraic Computation (ISSAC) 2012, Jul. 2012, English, Grenoble, France, International conference

    Poster presentation

  • 近似グレブナ基底の後退誤差解析について

    長坂 耕作

    第21回 日本数式処理学会大会, Jun. 2012, Japanese, 山口大学, Domestic conference

    Oral presentation

  • 近似グレブナ基底の後退誤差解析の試み

    長坂 耕作

    Risa/Asir Conference 2012, Mar. 2012, Japanese, 神戸大学, Domestic conference

    Oral presentation

  • 近似GCDの無平方分解への応用

    Kosaku Nagasaka

    研究集会 Computer Algebra - The Algorithms, Implementations and the Next Generation, Dec. 2011, Japanese, 京都大学数理解析研究所, Domestic conference

    Oral presentation

  • A Symbolic-Numeric Approach to Groebner Basis with Inexact Input

    Kosaku Nagasaka

    Fields Institute Workshop on Hybrid Methodologies for Symbolic-Numeric Computation, Hybrid2011, Nov. 2011, English, The University of Waterloo, Waterloo, Ontario, Canada, International conference

    [Invited]

    Invited oral presentation

  • 整数係数多項式の近似GCDとその実装

    Kosaku Nagasaka

    第20回 日本数式処理学会大会, Sep. 2011, Japanese, 神戸大学, Domestic conference

    Oral presentation

  • 近似代数の汎用ライブラリに向けて

    Kosaku Nagasaka

    研究集会 数式処理研究の新たな発展, Jul. 2011, Japanese, 京都大学数理解析研究所, Domestic conference

    Oral presentation

  • An improvement in the lattice construction process of Approximate Polynomial GCD over Integers (Extended Abstract)

    Kosaku Nagasaka

    Symbolic-Numeric Computation (SNC2011), Jun. 2011, English, San Jose, International conference

    Oral presentation

  • 近似Groebner基底の逐次算法に向けて

    Kosaku Nagasaka

    研究集会 Computer Algebra - Design of Algorithms, Implementations and Applications, Dec. 2010, Japanese, 京都大学数理解析研究所, Domestic conference

    Oral presentation

  • 準同型暗号と整数及び整数多項式の近似GCD

    Kosaku Nagasaka

    研究集会 数式処理研究の新たな発展, Jul. 2010, Japanese, 京都大学数理解析研究所, Domestic conference

    Oral presentation

  • 国際研究集会を開くまで - CASC 2009 開催までの道のり -

    Kosaku Nagasaka

    研究集会 数式処理研究の新たな発展, Jul. 2010, Japanese, 京都大学数理解析研究所, Domestic conference

    [Invited]

    Invited oral presentation

  • 近似Groebner基底とSLRA

    Kosaku Nagasaka

    第19回 日本数式処理学会大会, Jun. 2010, Japanese, 名古屋大学, Domestic conference

    Oral presentation

  • 近似Groebner基底のSLRAによる安定化

    Kosaku Nagasaka

    Risa/Asir Conference 2010, Mar. 2010, Japanese, 神戸大学, Domestic conference

    Oral presentation

  • 近似Groebner基底に向けて

    Kosaku Nagasaka

    研究集会 Computer Algebra - Design of Algorithms, Implementations and Applications, Nov. 2009, Japanese, 京都大学数理解析研究所, Domestic conference

    Oral presentation

  • 数式処理による教育の充実

    Kosaku Nagasaka

    研究集会 数式処理と教育, Aug. 2009, Japanese, 京都大学数理解析研究所, Domestic conference

    Oral presentation

  • 色彩変換ソフトウェアの開発のための感性的色空間の解析

    Michiko Yamamoto, Kosaku Nagasaka

    日本デザイン学会 第56回春季研究発表大会, Jun. 2009, Japanese, 名古屋, 日本, Domestic conference

    Oral presentation

  • RREFによるグレブナー基底計算について

    Kosaku Nagasaka

    第18回 日本数式処理学会大会, Jun. 2009, Japanese, 滋賀, 日本, Domestic conference

    Oral presentation

  • 線形空間の基底としてグレブナ基底を計算する方法のまとめ

    Kosaku Nagasaka

    Risa/Asir Conference 2009, Mar. 2009, Japanese, 神戸, 日本, Domestic conference

    Oral presentation

  • 近似GCDによる人間らしい簡単化

    Kosaku Nagasaka

    Computer Algebra - Design of Algorithms, Implementations and Applications, Nov. 2008, Japanese, 京都大学数理解析研究所, Domestic conference

    Oral presentation

  • 数式処理ソフトと正課外活動

    Kosaku Nagasaka, Tadashi Takahasi

    研究集会 数式処理と教育, Aug. 2008, Japanese, 京都大学数理解析研究所, Domestic conference

    Oral presentation

  • Mathematica Playerの活用 -応用代数学講義編-

    Kosaku Nagasaka

    理数系教育におけるICT技術の活用 〜Mathematica の活用事例〜, Aug. 2008, Japanese, 大阪府立大学, 大阪府立大学, Domestic conference

    Invited oral presentation

  • Approximate Polynomial GCD over Integers

    Kosaku Nagasaka

    ISSAC 2008 Poster presentations, Jul. 2008, English, Hagenberg, Austria, International conference

    Poster presentation

  • 整数係数多項式の近似GCDの高速化

    Kosaku Nagasaka

    第17回 日本数式処理学会大会, Jun. 2008, Japanese, 東京, 日本, Domestic conference

    Oral presentation

  • 感性的表象としての色空間の開発に関する予備的研究

    Michiko Yamamoto, Kosaku Nagasaka

    芸術工学会2007年度秋期大会, Nov. 2007, Japanese, 名古屋, 日本, Domestic conference

    Oral presentation

  • Ruppert行列による近似GCDの算出

    Nagasaka Kosaku

    Computer Algebra - Design of Algorithms, Implementations and Applications, Nov. 2007, Japanese, 京都大学数理解析研究所, Domestic conference

    Oral presentation

  • 線形代数における数式処理ソフトの活用

    Kosaku Nagasaka

    研究集会 数式処理と教育, Aug. 2007, Japanese, 京都, 日本, Domestic conference

    Oral presentation

  • 整数係数多項式の近似GCD II

    Kosaku Nagasaka

    研究集会 数式処理研究の新たなる発展, Jul. 2007, Japanese, 京都, 日本, Domestic conference

    Oral presentation

  • SNAP package for Mathematica

    Kosaku Nagasaka

    ISSAC 2007 Software Exhibitions, Jul. 2007, English, Waterloo, Canada, International conference

    Others

  • 整数係数多項式の近似GCD

    Kosaku Nagasaka

    第16回 日本数式処理学会大会, Jun. 2007, Japanese, 倉敷, 日本, Domestic conference

    Oral presentation

  • ウェブでの近似代数演算

    Kosaku Nagasaka

    Risa/Asir Conference 2007, Mar. 2007, Japanese, 神戸, 日本, Domestic conference

    Oral presentation

  • 整数係数の近似因数分解はなぜ難しいか

    Kosaku Nagasaka

    研究集会 Computer Algebra -- Design of Algorithms,Implementations and Applications, Dec. 2006, Japanese, 京都, 日本, Domestic conference

    Oral presentation

  • カテナリーを用いた衣服における記号記述の基盤整備

    KIRIU, Yusuke, Takuya Kitamoto, Kosaku Nagasaka, Tadashi Takahashi, 山口 哲

    研究集会 Computer Algebra -- Design of Algorithms,Implementations and Applications, Dec. 2006, Japanese, 京都, 日本, Domestic conference

    Oral presentation

  • Niederreiterの因数分解法の実装について

    Akiko Yamanaka, Kosaku Nagasaka

    研究集会 Computer Algebra -- Design of Algorithms,Implementations and Applications, Dec. 2006, Japanese, 京都, 日本, Domestic conference

    Oral presentation

  • gridMathematicaを試す

    Kosaku Nagasaka

    Japan Mathematica Conference 2006, Dec. 2006, Japanese, 東京ビックサイト, Domestic conference

    Invited oral presentation

  • 大学における数式処理を使った転換教育と専門基礎教育

    Nagasaka Kosaku

    研究集会 数式処理と教育, Nov. 2006, Japanese, 京都, 日本, Domestic conference

    Oral presentation

  • Mathematicaのある教育と研究

    Kosaku Nagasaka

    数学ソフトウェアとフリードキュメントIII, Sep. 2006, Japanese, 大阪市立大学, Domestic conference

    Invited oral presentation

  • Mathematics and Arts: Symbolic Manipulation and Challengeable Fact

    KIRIU, Yusuke, NAGASAKA, Kosaku, TAKAHASHI, Tadashi

    第15回 日本数式処理学会大会, Jun. 2006, Japanese, 日本数式処理学会, 東京, 日本, Domestic conference

    Oral presentation

  • A Trial for Approximate Factorization

    NAGASAKA, Kosaku

    第15回 日本数式処理学会大会, Jun. 2006, Japanese, 日本数式処理学会, 東京, 日本, Domestic conference

    Oral presentation

  • Mathematical Issues of Mathematica's BigFloat and Our Resolutions in SNAP Package

    NAGASAKA, Kosaku

    International Mathematica Symposium, IMS 2006, Jun. 2006, English, Avignon, フランス, International conference

    Oral presentation

  • Finding Mathematical Structures in Arts I

    KIRIU, Yusuke, NAGASAKA, Kosaku, TAKAHASHI, Tadashi

    International Mathematica Symposium, IMS 2006, Jun. 2006, English, Avignon, フランス, International conference

    Oral presentation

  • Irreducibility Radii

    NAGASAKA, Kosaku

    ARCC Workshop: The computational complexity of polynomial factorization, May 2006, English, Paloalto, 米国, International conference

    Invited oral presentation

  • Report: Precision Assurance on Mathematica

    NAGASAKA, Kosaku

    Risa/Asir Conference 2006, Mar. 2006, Japanese, 神戸, 日本, Domestic conference

    Oral presentation

  • Mathematics Embeded Contents and Its Standardization

    NAGASAKA, Kosaku

    研究集会 Computer Algebra -- Design of Algorithms,Implementations and Applications, Dec. 2005, Japanese, 京都, 日本, Domestic conference

    Oral presentation

  • A Mathematical Approach to Arts,by Computer Algebra System

    KIRIU, Yusuke, NAGASAKA, Kosaku, TAKAHASHI, Tadashi

    研究集会 Computer Algebra -- Design of Algorithms,Implementations and Applications, Dec. 2005, Japanese, 京都, 日本, Domestic conference

    Oral presentation

  • SNAP

    NAGASAKA, Kosaku

    International Mathematica Symposium, IMS 2005, Aug. 2005, English, Perth, オーストラリア, International conference

    Oral presentation

  • An implementation issue on SNAP and significant digits

    NAGASAKA, Kosaku

    Conference on Applications of Computer Algebra, ACA 2005, Aug. 2005, English, 奈良, 日本, International conference

    Oral presentation

  • Calculation of Groebner Basis with Indeterminate Exponents II

    TAKAHASHI, Tadashi, NAGASAKA, Kosaku

    京都大学数理解析研究所研究集会, Jul. 2005, Japanese, 京都大学数理解析研究所, 京都, 日本, Domestic conference

    Oral presentation

  • Improving Radius of Absolute Irreducibility for Multivariate Polynomials

    NAGASAKA, Kosaku

    第14回 日本数式処理学会大会, Jun. 2005, Japanese, 日本数式処理学会, 広島, 日本, Domestic conference

    Oral presentation

  • Implementing CGB on Mathematica

    NAGASAKA, Kosaku

    Risa/Asir Conference 2005, Mar. 2005, Japanese, 神戸, 日本, Domestic conference

    Oral presentation

  • Calculation of Groebner Basis with Parametric Coefficients or Indeterminante Exponents

    TAKAHASHI, Tadashi, Kosaku Nagasaka

    Computer Algebra -- Design of Algorithms, Implementations and Applications, Dec. 2004, Japanese, 京都, 日本, Domestic conference

    Oral presentation

  • Towards: Practical Approximate Algebraic Computation for Univariate Polynomials

    NAGASAKA, Kosaku

    第13回 日本数式処理学会大会, Sep. 2004, Japanese, 日本数式処理学会, 東京, 日本, Domestic conference

    Oral presentation

  • Calculation Program of Groebner Basis with Indeterminate Exponents

    NAGASAKA, Kosaku, TAKAHASHI, Tadashi

    第13回 日本数式処理学会大会, Sep. 2004, Japanese, 日本数式処理学会, 東京, 日本, Domestic conference

    Oral presentation

  • Calculation Program of Groebner Basis with Indeterminate Exponents

    NAGASAKA, Kosaku, TAKAHASHI, Tadashi

    研究集会 Computer Algebra の新たな展開, Aug. 2004, English, 京都, 日本, Domestic conference

    Oral presentation

  • Towards: Improving Radius of Absolute Irreducibility for Multivariate Polynomials

    NAGASAKA, Kosaku

    研究集会 Computer Algebra -- Algorithms, Implementations and Applications, Dec. 2003, Japanese, 京都, 日本, Domestic conference

    Oral presentation

  • Absolute Irreducibility Testing of Polynomials with Errors

    NAGASAKA, Kosaku

    第11回Risaコンソーシアム研究集会, Mar. 2003, Japanese, 神戸, 日本, Domestic conference

    Oral presentation

  • Distance between an expansion point and the nearest singular point in Multivariate Hensel Construction

    NAGASAKA, Kosaku

    研究集会 Computer Algebra -- Algorithms, Implementations and Applications, Nov. 2001, Japanese, 京都, 日本, Domestic conference

    Oral presentation

  • Approximate Bivariate Factrization - Lower Bound of Tolerance and Irreducibility Testing -

    NAGASAKA, Kosaku

    第29回数値解析シンポジウム, Jun. 2000, Japanese, 那須, 日本, Domestic conference

    Oral presentation

  • Approximate Bivariate Factrization - Lower Bound of Tolerance and Irreducibility Testing -

    NAGASAKA, Kosaku

    数式処理における理論と応用の研究集会, Nov. 1999, Japanese, 京都, 日本, Domestic conference

    Oral presentation

  • Approximate Multivariate Factorization and Its Time Complexity

    NAGASAKA, Kosaku, SASAKI, Tateaki

    International IMACS Conference on Applications of Computer Algebra '98, Aug. 1998, English, IMACS, Prague, チェコ共和国, International conference

    Oral presentation

  • Approximate Multivariate Factorization and Its Time Complexity

    NAGASAKA, Kosaku, SASAKI, Tateaki

    数式処理における理論と応用の研究集会, Nov. 1997, Japanese, 京都, 日本, Domestic conference

    Oral presentation

  • Approximate GCD by relaxed NewtonSLRA algorithm

    Kosaku Nagasaka

    The 46th International Symposium on Symbolic and Algebraic Computation (ISSAC 2021), 21 Jul. 2021, English, International conference

    Others

  • NewtonSLRAの緩和アルゴリズムとその効果

    長坂耕作

    日本数式処理学会第30回大会, 06 Jun. 2021, Japanese

    Oral presentation

  • Relaxed NewtonSLRA for Approximate GCD

    Kosaku Nagasaka

    The 23rd International Workshop on Computer Algebra in Scientific Computing, CASC 2021, 17 Sep. 2021, English

    Oral presentation

  • 中等数学の証明問題と自動採点における課題

    青山雄太郎, 長坂耕作

    日本数式処理学会 第15期第2回 教育分科会, 29 Aug. 2021, Japanese

    Oral presentation

  • 数学教育における順序並び替え問題

    長坂耕作

    研究集会 数学ソフトウェアとその効果的教育利用に関する研究, 27 Aug. 2021, Japanese

    Oral presentation

Association Memberships

  • ACM SIGSAM

  • 情報処理学会

  • 日本応用数理学会

  • 日本数式処理学会

Works

  • Getting Better at Mathematica, for beginners

    長坂 耕作, 佐藤 真人, 市川 浩, 山口 哲, 春日 和久, 宮地 力, 大橋 真也

    2001

  • Getting Better at Mathematica, Standard version

    長坂 耕作, 佐藤 真人, 市川 浩, 山口 哲, 春日 和久, 宮地 力, 大橋 真也

    2000

Research Projects

  • 長坂 耕作

    Japan Society for the Promotion of Science, Grants-in-Aid for Scientific Research Grant-in-Aid for Scientific Research (C), Grant-in-Aid for Scientific Research (C), Kobe University, 01 Apr. 2019 - 31 Mar. 2024

  • 吉冨 賢太郎, 亀田 真澄, 長坂 耕作, 金西 計英

    Japan Society for the Promotion of Science, Grants-in-Aid for Scientific Research Grant-in-Aid for Scientific Research (C), Grant-in-Aid for Scientific Research (C), Osaka Prefecture University, 01 Apr. 2018 - 31 Mar. 2022

    LMS上でのオンラインテストはこれまでSTACKを使って新規に実装を行ったり,既存コンテンツの解答形式の見直しを若干行ったりした.また, 大阪府立大学で運用されているMathematica を用いたMATH ON WEBの問題コンテンツの移植をいくつかの問題について行なった.これらの問題は数値の入力が必要であり,行列が多数出てくる線形代数においては,学生のスマートフォン活用に着目した本研究の視点からは利便性に相当の問題がある場合がある.この点を改善するために, これらの問題を,場合によっては視点を変えた形に変換した上で,多肢選択問題としての出題が可能かについての検討を行った.また,実際,そのいくつかについては, CAS(Mathematica)を用いて実装を開始し, 基本的な実装手順を確立した.同様に開発をしている分担者(長坂)とも協議し,開発における仕様の統一化や,他の一般教員が参加できるようにWebベースでの開発のインターフェイスができないかなど必要な検討課題について打ち合せを行い,今後 webMathematica の他,無償の言語もしくはCASを使った Webでの開発環境について討議することになった. また, 本研究のアイデアについて, 国際学会(ICMS-2018, EAMS-2018)および国内学会(JSiSE全国大会および研究会,CIEC北海道研究会)で発表し, 国内外の研究者と意見交換や情報収集を行った.その結果,STACKのPRT(Potential Response Tree)に代表される既存の問題におけるフィードバック手法と多肢選択問題の誤選択肢の生成は相補関係にあるという知見を確認することができた.

  • 長坂 耕作

    学術研究助成基金助成金/基盤研究(C), Apr. 2015 - Mar. 2020, Principal investigator

    Competitive research funding

  • 長坂 耕作

    科学研究費補助金/若手研究(B), 2010, Principal investigator

    Competitive research funding

  • 伊藤 真之

    科学研究費補助金/萌芽研究, 2007

    Competitive research funding

  • 船越 俊介

    科学研究費補助金/基盤研究(B), 2005

    Competitive research funding

  • 長坂 耕作

    科学研究費補助金/若手研究(B), 2005, Principal investigator

    Competitive research funding

  • 福山 克司

    科学研究費補助金/基盤研究(B), 2005

    Competitive research funding

  • 吉冨 賢太郎, 亀田 真澄, 市川 裕子, 樋口 三郎, 長坂 耕作, 金西 計英

    Japan Society for the Promotion of Science, Grants-in-Aid for Scientific Research Grant-in-Aid for Scientific Research (B), Grant-in-Aid for Scientific Research (B), Osaka Prefecture University, 01 Apr. 2021 - 31 Mar. 2025

  • International Symposium on Symbolic and Algebraic Computation, 2014 (ISSAC 2014)

    長坂 耕作

    立石科学技術振興財団, 国際会議等開催助成, Jul. 2014

  • The 39 th International Symposium on Symbolic and Algebraic Computation (ISSAC 2014)

    長坂 耕作

    栢森情報科学振興財団, フォーラム・シンポジウム等開催助成金, Jul. 2014

  • CASC 2009 「科学技術計算と数式処理」

    長坂 耕作

    日本学術振興会, 国際研究集会, Sep. 2009