Researcher Profile and Settings

Researcher

• Name

  NAGAI AYUMU

Profile and Settings

• Name

  AYUMU, NAGAI

Affiliation

• Gunma University, Assistant Professor

Research Experience

• Gunma University

Research Activities

Research Areas

• Informatics, Intelligent informatics

Published Papers

• Generation of a Large-Scale Line Image Dataset with Ground Truth Texts from Page-Level Autograph Documents, Ayumu Nagai, Dec. 2021, 28th International Conference on Neural Information Processing (ICONIP), 354, 366
• Recognizing Japanese Historical Cursive with Pseudo-Labeling-aided CRNN as an Application of Semi-Supervised Learning to Sequence Labeling, Ayumu Nagai, 2020, 17th International Conference on Frontiers in Handwriting Recognition (ICFHR), 97, 102, International conference proceedings
• On the Improvement of Recognizing Single-line Strings of Japanese Historical Cursive, Ayumu Nagai, 2019, 2019 International Conference on Document Analysis and Recognition (ICDAR), 621, 628, International conference proceedings
• 畳み込みネットワークによる仮名３文字のくずし字の文字認識, 長井　歩, Dec. 2017, 213-218
• Obstacle Detection from Monocular On-Vehicle Camera in units of Delaunay Triangles, Ayumu Nagai, Naoya Ohta, 2013
• Obstacle Detection from Monocular On-Vehicle Camera in units of Delaunay Triangles, Ayumu Nagai, Naoya Ohta, Aug. 2012
• An Algorithm to Solve Hisshi Problems, Ayumu Nagai, Oct. 2011, Game Programming Workshop, 1, 8
• Heuristics to improve solving Tsume-Shogi, Ayumu Nagai, 2010, 15th Game Programming Workshop, 29, 35
• 階層化CHLAC特徴を用いた異常行動の検出, 松永 錦弥, 鈴木 雄太, 長井 歩, 太田 直哉, 2009
• Inappropriateness of the criterion of k-way normalized cuts for deciding the number of clusters, Ayumu Nagai, 2007, Pattern Recognition Letters
• 重み付きデータのNormalized Cuts, 長井　歩, 2007, 90-D, 9, 2483--2494
• SAT問題を解くＤＰＬＬベースの探索法に対する改善手法, 長井　歩, 2007, ６３－１１
• Normalized Cuts の評価基準を用いた階層型クラスタリングの提案, 長井　歩, 2007, １１５－１０
• A case study of life cycle formal verification on spacecraft software, Naoki Ishihama, Ayumu Nagai, Masa katahira, 2003, ISESE
• 詰将棋, 長井　歩, 2003
• df-pnアルゴリズムの詰将棋回答プログラムへの応用, 長井歩、今井浩, 2002, ４３, ６
• Proof for the equivalence between some best-first algorithms and depth-first algorithms for AND/OR trees, Ayumu Nagai, Hiroshi Imai, 2002, IEICE Transactions on Information and Systems
• Fast and space-efficient algorithms for deciding shellability of Simplicial complexes of large size using h-assignments, Sonoko Moriyama, 2002, 1st International congress of mathematical software
• 詰将棋を解くプログラムにおける効率的なハッシュの利用法について, 長井歩、今井浩, 2001, ７９－４
• 詰将棋における変別チェックと余詰探索を同時に行える新しいアルゴリズムの提案, 長井歩、今井浩, 2001
• Application of df-pn+ to Othello endgames, Ayumu Nagai, Hiroshi Imai, 1999, The 5th Game Programming Workshop
• A new AND/OR tree search algorithm using both proof number and disproof number, Ayumu Nagai, 1998, complex game lab workshop
• Prediction of credit card users to switch into cashing from personal credit histories, Seki Yoichi;Nagai Ayumu;Watanabe Ryo;Ishihara Jun-ichiro, 2005, Abstracts of Annual Conference of Japan Society for Management Information, 2005, 0, 3, 3
• An Improvement for DPLL-based SAT solvers, NAGAI AYUMU, Mar. 2007, IPSJ SIG Notes, 63, 41, 44
• A Hierarchical Clustering using the Normalized Cuts Criterion, NAGAI AYUMU, Nov. 2007, IPSJ SIG Notes, 115, 73, 80
• Weighted Normalized Cuts, NAGAI Ayumu, Sep. 2007, The IEICE transactions on information and systems, 90, 9, 2483, 2494
• Detecting Abnormal Behavior by Hierarchical CHLAC, MATSUNAGA Kinya;SUZUKI Yuta;NAGAI Ayumu;OHTA Naoya, Mar. 2009, 71, 0, 443, 444
• Behavior Pattern Extraction by Self-Organizing Maps of Personal Usage Histories : Predicting when credit-card users will switch to credit-card cashing based on personal credit histories, SEKI Yoichi;NAGAI Ayumu;ISHIHARA Jun-ichiro;WATANABE Ryo, 2006, Journal of Japan Industrial Management Association, 57, 5, 404, 412

MISC

• Inappropriateness of the criterion of k-way normalized cuts for deciding the number of clusters, Ayumu Nagai, Nov. 2007, PATTERN RECOGNITION LETTERS, 28, 15, 1981, 1986

  DOI
• A case study of life cycle formal verification on spacecraft software, Naoki Ishihama,Ayumu Nagai,Masa katahira, 2003, ISESE
• Proof for the equivalence between some best-first algorithms and depth-first algorithms for AND/OR trees, Ayumu Nagai,Hiroshi Imai, 2002, IEICE Transactions on Information and Systems, E85-D, 10
• Fast and space-efficient algorithms for deciding shellability of Simplicial complexes of large size using h-assignments, Sonoko Moriyama, 2002, 1st International congress of mathematical software
• Application of df-pn+ to Othello endgames, Ayumu Nagai,Hiroshi Imai, 1999, The 5th Game Programming Workshop
• A new AND/OR tree search algorithm using both proof number and disproof number, Ayumu Nagai, 1998, complex game lab workshop
• A case study of life cycle formal verification on spacecraft software, Naoki Ishihama,Ayumu Nagai,Masa katahira, 2003
• 詰将棋, 長井 歩, 2003
• df-pnアルゴリズムの詰将棋回答プログラムへの応用, 長井歩,今井浩, 2002, 43, 6
• Proof for the equivalence between some best-first algorithms and depth-first algorithms for AND/OR trees, Ayumu Nagai,Hiroshi Imai, 2002, E85-D, 10
• Fast and space-efficient algorithms for deciding shellability of Simplicial complexes of large size using h-assignments, Sonoko Moriyama, 2002
• 詰将棋を解くプログラムにおける効率的なハッシュの利用法について, 長井歩,今井浩, 2001, 79-4
• 詰将棋における変別チェックと余詰探索を同時に行える新しいアルゴリズムの提案, 長井歩,今井浩, 2001
• Application of df-pn+ to Othello endgames, Ayumu Nagai,Hiroshi Imai, 1999
• A new AND/OR tree search algorithm using both proof number and disproof number, Ayumu Nagai, 1998
• Inappropriateness of the criterion of k-way normalized cuts for deciding the number of clusters, Ayumu Nagai, 2007

  DOI
• 重み付きデータのNormalized Cuts, 長井 歩, 2007, 90-D, 9, 2483--2494
• SAT問題を解くＤＰＬＬベースの探索法に対する改善手法, 長井 歩, 2007, 63-11
• Normalized Cuts の評価基準を用いた階層型クラスタリングの提案, 長井 歩, 2007, 115-10
• 階層化CHLAC特徴を用いた異常行動の検出, 松永 錦弥,鈴木 雄太,長井 歩,太田 直哉, 2009
• 畳み込みネットワークによる仮名３文字のくずし字の文字認識, 長井 歩, 2017, 213, 218

Books etc

• コンピューター将棋の進歩４, 2003, ISBN: 9784320120747

Presentations

• Application of df-pn+ to Othello endgaes, 1999
• Proof for the equivalence between some best-first algorithms and depth-first algorithms for AND/OR trees, 1999
• Detection of Abnormal Behavior by Multi-Scale CHLAC, Privacy Protection and Community Safety 2009 (SPC 2009), 2009
• クレジットカード利用履歴を利用したキャッシング移行予測, 経営情報学会2005年春季研究発表大会予稿集, pp.S56-S59, 2005
• 詰将棋における変別チェックと余詰探索を同時に行える新しいアルゴリズムについて, 2001
• 情報処理学会 数理モデルと問題解決研究会, 2007
• Normalized Cuts 評価基準を用いた階層型クラスタリングの提案, 2007
• 詰将棋を解くプログラムにおける効率的なハッシュの利用法について, 情報処理学会, 2001
• Application of df-pn+ to Othello endgaes, 1999
• Proof for the equivalence between some best-first algorithms and depth-first algorithms for AND/OR trees, 1999
• Detection of Abnormal Behavior by Multi-Scale CHLAC, Privacy Protection and Community Safety 2009 (SPC 2009), 2009
• マルチスケールＣＨＬＡＣを用いた画像からの異常行動の検出, 第15回 画像センシングシンポジウム(SSII09), 2009