• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Practical approach to self-constructive learning on subjects on computer science

Research Project

Project/Area Number 20500760
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeSingle-year Grants
Section一般
Research Field Science education
Research InstitutionIshinomaki Senshu University

Principal Investigator

MARUOKA Akira  Ishinomaki Senshu University, 理工学部, 教授 (50005427)

Co-Investigator(Kenkyū-buntansha) KAWASHIMA Ryuta  東北大学, 加齢医学研究所, 教授 (90250828)
MURAMOTO Toshiaki  東北大学, 大学院・情報科学研究科, 准教授 (80212257)
TAKIMOTO Eiji  九州大学, 大学院・システム情報科学研究院, 教授 (50236395)
AMANO Kazuyuki  群馬大学, 大学院・工学研究科, 准教授 (30282031)
HARAGUCHI Kazuya  石巻専修大学, 理工学部, 助教 (80453356)
Project Period (FY) 2008 – 2010
Project Status Completed (Fiscal Year 2010)
Budget Amount *help
¥4,420,000 (Direct Cost: ¥3,400,000、Indirect Cost: ¥1,020,000)
Fiscal Year 2010: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2009: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2008: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
Keywords自然科学教育(数学、情報) / 計算学習理論 / 脳科学 / 認知心理学 / 計算理論 / 情報系教科 / カードゲーム / 学習曲線 / 論理回路
Research Abstract

Among results we obtained in this project there exists a framework that yields instances of certain combinatorial puzzles. To explore such a framework, we focus on certain types of puzzles that ask an assignment of numbers to cells of nxn grids so that it satisfies certain constraints as well as the Latin square condition, that is, each row and column contains all of the numbers in {1, 2,…,n} Our algorithm based on the framework yields automatically puzzle instances whose difficulties to solve can be adjusted by means of puzzle inference rules built into the algorithm. We performed experiments to demonstrate that, as is expected, human solvers tend to solve puzzle instances correctly that are produced with easy inference rules, whereas they tend to fail to solve those produced with sophisticated rules.

Report

(4 results)
  • 2010 Annual Research Report   Final Research Report ( PDF )
  • 2009 Annual Research Report
  • 2008 Annual Research Report
  • Research Products

    (36 results)

All 2011 2010 2009 2008 Other

All Journal Article (29 results) (of which Peer Reviewed: 29 results) Presentation (6 results) Book (1 results)

  • [Journal Article] Size-energy tradeoffs for unate circuits computing symmetric Boolean functions2011

    • Author(s)
      Kei Uchizawa, et al.
    • Journal Title

      Theoretical Computer Science 412

      Pages: 773-782

    • Related Report
      2010 Final Research Report
    • Peer Reviewed
  • [Journal Article] A Well-Mixed Function with Circuit Complexity 5n : Tightness of the Lachish-Raz-type Bounds2011

    • Author(s)
      Kazuyuki Amano
    • Journal Title

      Theoretical Computer Science 412(8)

      Pages: 1646-1651

    • Related Report
      2010 Final Research Report
    • Peer Reviewed
  • [Journal Article] Tight Bounds on the Average Sensitivity of k-CNF2011

    • Author(s)
      Kazuyuki Amano
    • Journal Title

      Theory of Computing 7

      Pages: 45-48

    • NAID

      110008583105

    • Related Report
      2010 Final Research Report
    • Peer Reviewed
  • [Journal Article] Size-energy tradeoffs for unate circuits computing symmetric Boolean functions2011

    • Author(s)
      Kei Uchizawa, et al.
    • Journal Title

      Theoretical Computer Science

      Volume: 412 Pages: 773-782

    • Related Report
      2010 Annual Research Report
    • Peer Reviewed
  • [Journal Article] A Well-Mixed Function with Circuit Complexity 5n : Tightness of the Lachish-Raz-type Bounds2011

    • Author(s)
      Kazuyuki Amano
    • Journal Title

      Theoretical Computer Science

      Volume: 412(8) Pages: 1646-1651

    • Related Report
      2010 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Tight Bounds on the Average Sensitivity of k-CNF2011

    • Author(s)
      Kazuyuki Amano
    • Journal Title

      Theory of Computing

      Volume: 7 Pages: 45-48

    • NAID

      110008583105

    • Related Report
      2010 Annual Research Report
    • Peer Reviewed
  • [Journal Article] インフオームド・コンセントのための説明文書のわかりやすさと不安感-プロトコル分析による研究-2010

    • Author(s)
      野呂幾久子・邑本俊亮
    • Journal Title

      Ars Linguistica (Linguistic Studies of Shizuoka) 17

      Pages: 95-113

    • Related Report
      2010 Final Research Report
    • Peer Reviewed
  • [Journal Article] NPN-representatives of a Set of Optimal Boolean Formulas2010

    • Author(s)
      Hideaki Fukuhara, et al
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E93-A(6)

      Pages: 1008-1015

    • Related Report
      2010 Final Research Report
    • Peer Reviewed
  • [Journal Article] NPN-representatives of a Set of Optimal Boolean Formulas2010

    • Author(s)
      Hideaki Fukuhara, et al.
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E93-A(6)

      Pages: 1008-1015

    • Related Report
      2010 Final Research Report
    • Peer Reviewed
  • [Journal Article] k-Subgraph Isomorphism on ACO Circuit2010

    • Author(s)
      Kazuyuki Amano
    • Journal Title

      Computational Complexity 19

      Pages: 183-210

    • Related Report
      2010 Final Research Report
    • Peer Reviewed
  • [Journal Article] Sampling site location problem in lake monitoring having multiple purposes and constraints2010

    • Author(s)
      Kazuya Haraguchi, Yuichi Sato
    • Journal Title

      Journal of Operations Research Society of Japan 53-4

      Pages: 289-304

    • NAID

      110008006430

    • Related Report
      2010 Final Research Report
    • Peer Reviewed
  • [Journal Article] インフォームド・コンセントのための説明文書のわかりやすさと不安感-プロトコル分析による研究-2010

    • Author(s)
      野呂幾久子・邑本俊亮
    • Journal Title

      Ars Linguistica (Linguistic Studies of Shizuoka)

      Volume: 17 Pages: 95-113

    • Related Report
      2010 Annual Research Report
    • Peer Reviewed
  • [Journal Article] NPN-representatives of a Set of Optimal Boolean Formulas2010

    • Author(s)
      Hideaki Fukuhara, et al.
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

      Volume: E93-A(6) Pages: 1008-1015

    • Related Report
      2010 Annual Research Report
    • Peer Reviewed
  • [Journal Article] k-Subgraph Isomorphism on AC0 Circuit2010

    • Author(s)
      Kazuyuki Amano
    • Journal Title

      Computational Complexity

      Volume: 19 Pages: 183-210

    • Related Report
      2010 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Sampling site location problem in lake monitoring having multiple purposes and constraints2010

    • Author(s)
      Kazuya Haraguchi, Yuichi Sato
    • Journal Title

      Journal of Operations Research Society of Japan

      Volume: 53-4 Pages: 289-304

    • NAID

      110008006430

    • Related Report
      2010 Annual Research Report
    • Peer Reviewed
  • [Journal Article] On Directional vs. Undirectional Randomized Decision Tree Complexity for Read-Once Formulas2010

    • Author(s)
      Kazuyuki Amano
    • Journal Title

      Conferences in Research and Practice in Information Technology 109

      Pages: 25-29

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] NPN-Representatives of a Set of Optimal Boolean Formulas2010

    • Author(s)
      Hideaki Fukuhara
    • Journal Title

      MICE Trans.on Fund.Elect. Communications and Computer Sciences E93-A-6(印刷中)

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Lower Bounds on Quantum Query Complexity for Read-once Formulas with XOR and MUX Operators2010

    • Author(s)
      Hideaki Fukuhara, et al.
    • Journal Title

      MICE Transactions on Information and Systems E93-D(2)

      Pages: 280-289

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Energy Complexity and Depth of Threshold Circuits2009

    • Author(s)
      Kei Uchizawa, et al.
    • Journal Title

      Lecture Notes in Computer Science 5699

      Pages: 335-345

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Size and Energy of Threshold Circuits Computing Mod Functions2009

    • Author(s)
      Kei Uchizawa, et al.
    • Journal Title

      Lecture Notes in Computer Science 5734

      Pages: 724-735

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Linear Programming Boosting by Column and Row Generation2009

    • Author(s)
      Kohei Hatano, et al.
    • Journal Title

      Lecture Notes in Artificial Intelligence 5808

      Pages: 401-408

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] K-Subgraph Isomorphism on AC_0 Circuits2009

    • Author(s)
      Kazuyuki Amano
    • Journal Title

      Proceedings of the 24^<th> IEEE Conference on Computational Complexity 24

      Pages: 9-18

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] 協同問題解決を行う成員の満足感を構成する要因の検討2009

    • Author(s)
      鈴木俊太郎
    • Journal Title

      心理学研究 80(2)

      Pages: 105-113

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] 協同問題解決における協同促進行動および客観評価が成員の満足感に与える影響について2009

    • Author(s)
      鈴木俊太郎
    • Journal Title

      認知科学 16

      Pages: 39-50

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity2008

    • Author(s)
      Kei Uchizawa
    • Journal Title

      Theoretical Computer Science 407

      Pages: 474-487

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] A Well-Mixed Function with Circuit Compleixty 5n+-o(n)2008

    • Author(s)
      天野 一幸
    • Journal Title

      Lecture Notes in Computer Science 4978

      Pages: 191-203

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Representation of Quantum Circuit with Clifford and π/8 Gates2008

    • Author(s)
      松本 健
    • Journal Title

      Proceedings of the 8^<th> Asian Conference on Quantum Information Science 8

      Pages: 135-136

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] インフォームド・コンセントのための説明文書に対する一般市民の理解度とわかりやすさ・安心感2008

    • Author(s)
      野呂幾久子
    • Journal Title

      医療の質・安全学会誌 2

      Pages: 365-377

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Monotone DNF Formula that has a Minimal or Maximal Number of Satisfying Assignments

    • Author(s)
      佐藤 貴之
    • Journal Title

      Lecture Notes in Compture Science

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Presentation] 計算ブロックパズルの生成アルゴリズム2011

    • Author(s)
      安倍泰孝, 原口和也, 丸岡章
    • Organizer
      情報処理学会・第25回ゲーム情報学研究会
    • Related Report
      2010 Annual Research Report 2010 Final Research Report
  • [Presentation] 重みつき窓を用いた適応型オンライン予測2010

    • Author(s)
      畑埜晃平
    • Organizer
      人工知能学会データマイニングと統計数理研究会
    • Place of Presentation
      統計数理研究所
    • Year and Date
      2010-03-30
    • Related Report
      2009 Annual Research Report
  • [Presentation] K-Subgraph Isomorphism on AC_0 Circuits2009

    • Author(s)
      Kazuyuki Amano
    • Organizer
      The 24^<th> IEEE Conference on Computational Complexity
    • Place of Presentation
      パリ(フランス)
    • Year and Date
      2009-07-15
    • Related Report
      2009 Annual Research Report
  • [Presentation] Bounds on the Size of Small Depth Circuits for Approximating Majority2009

    • Author(s)
      Kazuyuki Amano
    • Organizer
      The 36th International Colloquium on Automata, Languages and Programming
    • Place of Presentation
      ロドス(ギリシャ)
    • Year and Date
      2009-07-09
    • Related Report
      2009 Annual Research Report
  • [Presentation] Lower Bounds on Quantum Query Complexity for Read-once Formulas with XOR and MUX Operators2009

    • Author(s)
      Hideaki Fukuhara
    • Organizer
      Annual Meeting of Asian Association for Algorithms and Computation
    • Place of Presentation
      杭州(中国)
    • Year and Date
      2009-04-11
    • Related Report
      2009 Annual Research Report
  • [Presentation] 計算ブロックパズルの問題例生成2009

    • Author(s)
      原口和也
    • Organizer
      電子情報通信学会組合せゲーム・パズル ミニプロジェクト第4回ミニ研究集会
    • Place of Presentation
      東京工業大学大岡山キャンパス
    • Year and Date
      2009-03-03
    • Related Report
      2008 Annual Research Report
  • [Book] Concise Guide to Computation Theory2011

    • Author(s)
      Akira Maruoka
    • Total Pages
      298
    • Publisher
      Springer
    • Related Report
      2010 Annual Research Report 2010 Final Research Report

URL: 

Published: 2008-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi