| 👨💼 Antoine BOSSARD, Ph.D., Professor | 🏛️ 神奈川大学 | 📧 abossard#kanagawa-u.ac.jp 0000-0001-9381-9346 |
| 🏫 Graduate School of Science | 🏫 情報学部 計算機科学科 | 📮 3-27-1 Rokkakubashi, Yokohama, Japan 221-8686 |
| 🏛️ Kanagawa University | 🏫 理学研究科 理学専攻 情報科学領域 | 📞 +81 (0) 45-481-5661 |
|
💡Research areas研究テーマ
✒️ Authored books著書
Lecture textbooks
![Understanding Microcontrollers [Second Edition]](img/cover8.jpg "Understanding Microcontrollers [Second Edition]")
![A Gentle Introduction to Functional Programming in English [Third Edition]](img/cover4.jpg "A Gentle Introduction to Functional Programming in English [Third Edition]")
💾 Released softwareソフトウェア開発
📝 Papers (excerpt)研究業績 (抜粋)
2022 Best paper: Outstanding Paper Award Torus-connected toroids: an interconnection network for massively parallel systems, Proc. 19th Applied Computing Int. Conf. (AC), pp. 21–28, Lisbon, Portugal.
2022 Ontological and quantitative analyses of the kokuji characters of the Japanese writing system, Journal of Chinese Writing Systems, 6(2):137–145.
2022 Memory optimisation on AVR microcontrollers for IoT devices' minimalistic displays, Chips, 1(1):2–13.
2021 On the Erdős-Sós conjecture for stars, paths and some of their variants, Proc. 20th IEEE/ACIS Int. Summer Semi-Virtual Conf. on Computer and Information Science (ICIS Summer), pp. 49–53, Shanghai, China.
2021 On solving the decycling problem in a torus network, Wireless Communications and Mobile Computing, 2021:5598173.
2021 On Japanese's quasi-characters and their representation on computer systems, Journal of Chinese Writing Systems, 4(4):313–324.
2020 with K. Kaneko, Cluster-fault tolerant routing in a torus, Sensors, 20(11):3286.
2019 with K. Kaneko, A new methodology for a functional and logic programming course, Proc. 20th ACM Ann. Conf. Information Technology Education (SIGITE), pp. 63–68, Tacoma, WA, USA.
2018 with K. Kaneko, Torus pairwise disjoint-path routing, Sensors, 18(11):3912.
2018 Outstanding Paper Award A grammar aware system for Latin document analysis and learning support, Proc. 6th Int. Symp. on Teaching, Education, and Learning (ISTEL), pp. 22–36, Naha, Japan.
2016 with K. Kaneko, Set-to-set disjoint paths routing in Torus-Connected Cycles, IEICE Transactions on Information and Systems, E99-D(11):2821–2823.
2015 with K. Kaneko, Torus-Connected Cycles: a simple and scalable topology for interconnection networks, Int. Journal of Applied Mathematics and Computer Science, 25(4):723–735.
2014 Best Paper Award with K. Kaneko, On hypercube routing and fault tolerance with bit constraint, Proc. 2nd Int. Symp. on Computing and Networking (CANDAR), pp. 40–49, Shizuoka City, Japan.
2014 with K. Kaneko, k-pairwise disjoint paths routing in perfect hierarchical hypercubes, The Journal of Supercomputing, 67(2):485–495.
2014 with K. Kaneko, Set-to-set disjoint paths routing in hierarchical cubic networks, The Computer Journal, 57(2):332–337.
2014 with K. Kaneko, Time optimal node-to-set disjoint paths routing in hypercubes, Journal of Information Science and Engineering, 30(4):1087–1093.
2013 Best Paper Award with K. Kaneko, Set-to-set disjoint paths routing in hyper-star graphs, Proc. 3rd Int. Conf. Advanced Computing and Communications (ACC), pp. 47–52, Los Angeles, CA, USA.
2013 On the decycling problem in hierarchical hypercubes, Journal of Interconnection Networks, 14(2):1350006.1–1350006.13.
2012 with K. Kaneko, Node-to-set disjoint-path routing in hierarchical cubic networks, The Computer Journal, 55(12):1440–1446.
2012 with K. Kaneko, The set-to-set disjoint-path problem in perfect hierarchical hypercubes, The Computer Journal, 55(6):769–775.
2011 with K. Kaneko and S. Peng, A new node-to-set disjoint-path algorithm in perfect hierarchical hypercubes, The Computer Journal, 54(8):1372–1381.
詳細 more
|
🤵♂️ Invited talks招待講演
2024 Deciphering Chinese characters: a journey where Asian and Western cultures meet, Okayama University, Okayama, Japan.
2023 Une approche cartésienne de l’écriture japonaise pour en faciliter le traitement informatique, INSA Lyon, Lyon, France.
2022 A computational approach to Chinese characters, Rochester Institute of Technology Croatia (RIT-Croatia), Dubrovnik, Croatia.
2017 High-performance graphics in Racket with DirectX, University of Nevada Reno (UNR), Reno, NV, USA.
2017 A computational approach to Chinese characters, 6th IIAI International Congress on Advanced Applied Informatics (AAI), Hamamatsu, Japan.
2016 A computational approach to Chinese characters, University of Nevada Reno (UNR), Reno, NV, USA.
👨🏫 Lectures (excerpt)担当科目 (抜粋)
2014 onwards Functional programming 関数プログラミング (Haskell, Prolog), TUAT 東京農工大学, KU 神奈川大学.
2015 onwards Computer architecture 計算機アーキテクチャ, KU 神奈川大学.
2015 onwards Special topics in graph theory グラフ理論特論, KU 神奈川大学 大学院.
2016 onwards English for information science 情報英語, KU 神奈川大学.
2015 onwards Introduction to computer systems 計算機システム基礎, KU 神奈川大学.
2013–2015, 2017–2019 Technical writing in English, AIIT 産業技術大学院大学.
2013–2014 An algorithmic approach to functional programming (Scheme), AIIT 産業技術大学院大学.
詳細 more
🧑🎓 Graduate advising研究指導 (大学院)
2019 MS 修士 T. Tsurusashi, 相互結合網TCCにおける耐故障経路選択アルゴリズムの提案、開発及び評価, KU Graduate School of Science 神奈川大学 大学院 理学研究科.
2018 MS 修士 N. Hotta, On shortest path routing in Torus-Connected Cycles, KU Graduate School of Science 神奈川大学 大学院 理学研究科.
👨👩👧👦 Social activities (excerpt)社会貢献 (抜粋)
2014–2021 Associate Editor, ISCA Int. Journal of Computers and Their Applications (IJCA).
2014 onwards Associate Managing Editor, IIAI Information Engineering Express (IEE).
Program Chair ISCA CATA 2017, ISCA CATA 2016, CCATS 2015.
Publication Chair IIAI AAI 2015.
Special Session Chair ISCA CAINE 2014.
Steering Committee ICESS 2022, ICESS 2020, ICESS 2019.
Program Committee Very regularly: IEEE/ACIS SNPD, IEEE/ACIS ICIS, IEEE/ACIS SERA, Baltic DB&IS, ISCA CATA, ISCA CAINE, IIAI ESKM, ACM/ACIS ACIT, amongst many others.
詳細 more
💰Grants (excerpt)研究助成金 (抜粋)
🗺️ Visited countries渡航歴
Visited USA states
Visited Canadian provinces
|
