Difference between revisions of "Ayumu Nagai"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
| (2 intermediate revisions by the same user not shown) | |||
| Line 6: | Line 6: | ||
He holds a M.Sc. and Ph.D. from [https://en.wikipedia.org/wiki/University_of_Tokyo University of Tokyo] on [[Depth-First|depth-first]] [https://en.wikipedia.org/wiki/And%E2%80%93or_tree and-or tree] search algorithms, in particular depth-first [[Proof-Number Search|Proof-number search]], | He holds a M.Sc. and Ph.D. from [https://en.wikipedia.org/wiki/University_of_Tokyo University of Tokyo] on [[Depth-First|depth-first]] [https://en.wikipedia.org/wiki/And%E2%80%93or_tree and-or tree] search algorithms, in particular depth-first [[Proof-Number Search|Proof-number search]], | ||
and was member of [[Hiroshi Imai|Hiroshi Imai's]] research laboratory <ref>[http://www-imai.is.s.u-tokyo.ac.jp/members.html Imai Laboratory: Members]</ref>. | and was member of [[Hiroshi Imai|Hiroshi Imai's]] research laboratory <ref>[http://www-imai.is.s.u-tokyo.ac.jp/members.html Imai Laboratory: Members]</ref>. | ||
| − | In the 90s, along with [[Yasushi Tanase]], [[Akihiro Kishimoto]] and [[Norifumi Gotou]], Ayumu Nagai was co-author of the [[Shogi]] program [[ | + | In the 90s, along with [[Yasushi Tanase]], [[Akihiro Kishimoto]] and [[Norifumi Gotou]], Ayumu Nagai was co-author of the [[Shogi]] program [[ISshogi]] <ref>[https://www.game-ai-forum.org/icga-tournaments/program.php?id=255 ISshogi's ICGA Tournaments]</ref> <ref>[http://www2.computer-shogi.org/wcsc/csc8_e.html 8th Computer Shogi Championship]</ref>, multiple winner and top finisher of CSA tournaments <ref>[http://www2.computer-shogi.org/index_e.html Computer Shogi Association]</ref> and [[Computer Olympiad|Computer Olympiads]]. |
=Selected Publications= | =Selected Publications= | ||
| Line 17: | Line 17: | ||
==2000 ...== | ==2000 ...== | ||
* [[Ayumu Nagai]] ('''2002'''). ''Df-pn Algorithm for Searching AND/OR Trees and Its Applications''. Ph.D. thesis, [https://en.wikipedia.org/wiki/University_of_Tokyo University of Tokyo] | * [[Ayumu Nagai]] ('''2002'''). ''Df-pn Algorithm for Searching AND/OR Trees and Its Applications''. Ph.D. thesis, [https://en.wikipedia.org/wiki/University_of_Tokyo University of Tokyo] | ||
| − | * [[Ayumu Nagai]], [[Hiroshi Imai]] ('''2002'''). ''[https://ci.nii.ac.jp/naid/110006376599 Proof for the Equivalence Between Some Best-First Algorithms and Depth-First Algorithms for AND/OR Trees]''. [ | + | * [[Ayumu Nagai]], [[Hiroshi Imai]] ('''2002'''). ''[https://ci.nii.ac.jp/naid/110006376599 Proof for the Equivalence Between Some Best-First Algorithms and Depth-First Algorithms for AND/OR Trees]''. [https://www.ieice.org/eng/index.html IEICE transactions on information and systems] |
* [https://dblp.uni-trier.de/pers/hd/m/Moriyama:Sonoko Sonoko Moriyama], [[Ayumu Nagai]], [[Hiroshi Imai]] ('''2002'''). ''[https://www.worldscientific.com/doi/abs/10.1142/9789812777171_0009 Fast and Space-efficient Algorithms for Deciding Shellability of Simplicial Complexes of Large Size using h-Assignments]''. [http://www.mmrc.iss.ac.cn/icms/toc.html ICMS 2002] | * [https://dblp.uni-trier.de/pers/hd/m/Moriyama:Sonoko Sonoko Moriyama], [[Ayumu Nagai]], [[Hiroshi Imai]] ('''2002'''). ''[https://www.worldscientific.com/doi/abs/10.1142/9789812777171_0009 Fast and Space-efficient Algorithms for Deciding Shellability of Simplicial Complexes of Large Size using h-Assignments]''. [http://www.mmrc.iss.ac.cn/icms/toc.html ICMS 2002] | ||
* [[Ayumu Nagai]] ('''2007'''). ''[https://dl.acm.org/citation.cfm?id=1290393 Inappropriateness of the criterion of k-way normalized cuts for deciding the number of clusters]''. [https://en.wikipedia.org/wiki/Pattern_Recognition_Letters Pattern Recognition Letters], Vol. 28, No. 15 | * [[Ayumu Nagai]] ('''2007'''). ''[https://dl.acm.org/citation.cfm?id=1290393 Inappropriateness of the criterion of k-way normalized cuts for deciding the number of clusters]''. [https://en.wikipedia.org/wiki/Pattern_Recognition_Letters Pattern Recognition Letters], Vol. 28, No. 15 | ||
| Line 29: | Line 29: | ||
<references /> | <references /> | ||
'''[[People|Up one level]]''' | '''[[People|Up one level]]''' | ||
| − | [[Category:Shogi Programmer| | + | [[Category:Shogi Programmer|Nagai]] |
| − | [[Category:Researcher| | + | [[Category:Researcher|Nagai]] |
Latest revision as of 19:32, 16 November 2019
Ayumu Nagai,
a Japanese computer scientist and professor at the department of computer science at Gunmma University.
His research interests include artificial intelligence and software verification.
He holds a M.Sc. and Ph.D. from University of Tokyo on depth-first and-or tree search algorithms, in particular depth-first Proof-number search,
and was member of Hiroshi Imai's research laboratory [1].
In the 90s, along with Yasushi Tanase, Akihiro Kishimoto and Norifumi Gotou, Ayumu Nagai was co-author of the Shogi program ISshogi [2] [3], multiple winner and top finisher of CSA tournaments [4] and Computer Olympiads.
Contents
Selected Publications
1998 ...
- Ayumu Nagai (1998). A new AND/OR Tree Search Algorithm Using Proof Number and Disproof Number. Complex Games Lab Workshop, Tsukuba
- Ayumu Nagai (1999). A New Depth-First-Search Algorithm for AND/OR Trees. M.Sc. thesis, University of Tokyo
- Ayumu Nagai, Hiroshi Imai (1999). Proof for the Equivalence Between Some Best-First Algorithms and Depth-First Algorithms for AND/OR Trees. Proceedings of the Korea-Japan Joint Workshop on Algorithms and Computation
- Ayumu Nagai, Hiroshi Imai (1999). Application of df-pn+ to Othello endgames. 5th Game Programming Workshop » Othello
2000 ...
- Ayumu Nagai (2002). Df-pn Algorithm for Searching AND/OR Trees and Its Applications. Ph.D. thesis, University of Tokyo
- Ayumu Nagai, Hiroshi Imai (2002). Proof for the Equivalence Between Some Best-First Algorithms and Depth-First Algorithms for AND/OR Trees. IEICE transactions on information and systems
- Sonoko Moriyama, Ayumu Nagai, Hiroshi Imai (2002). Fast and Space-efficient Algorithms for Deciding Shellability of Simplicial Complexes of Large Size using h-Assignments. ICMS 2002
- Ayumu Nagai (2007). Inappropriateness of the criterion of k-way normalized cuts for deciding the number of clusters. Pattern Recognition Letters, Vol. 28, No. 15
2010 ...
- Yuta Kanuki, Naoya Ohta, Ayumu Nagai (2013). Automatic Compensation of Radial Distortion by Minimizing Entropy of Histogram of Oriented Gradients. ACPR 2013
