Profile自己紹介

Antoine BOSSARD, Ph.D., Associate Professor

Graduate School of Science, Kanagawa University

学校法人 神奈川大学
理学部 情報科学科, 理学研究科 情報科学専攻
准教授 博士(工学) ボサール・アントワーヌ

📧 abossard#kanagawa-u.ac.jp

🏣 Tsuchiya 2946, Hiratsuka, Japan 259-1293

📞 +81 (0) 463-59-4111

Research areas研究テーマ

Graph theory グラフ理論
Interconnection networks 相互結合網
Routing problems 経路選択問題
Chinese characters 文字体系
Natural languages 自然言語

Social activities社会貢献

Member of ACM and ISCA.
2014 onwards 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.
Program Committee PDAA 2017, IEEE COMCOM 2017, ISCA CAINE 2017, ACIS ACIT 2017, IIAI SISS 2017, IIAI SCAI 2017, IEEE/ACIS SNPD 2017, ACIS ACIT 2016, BDAW 2016, PDAA 2016, ISCA CAINE 2016, IIAI SCAI 2016, IIAI SSIS 2016, IEEE/ACIS SNPD 2016, ICATSE ICISA 2016, ISCA CAINE 2015, IIAI ICSCAI 2015, IEEE/ACIS SNPD 2015, ICT-ISPC 2015, ISCA CATA 2015, ISCA CAINE 2014, IIAI ESKM 2014, IIAI ICSCAI 2014, ISCA CATA 2014, ISCA CAINE 2013, ISCA CAINE 2012, IIAI AAI 2012.
More here.

Grants研究助成 (省略)

TitleAmount
2017 International Exchange Grant 国際交流援助, Yazaki Memorial Foundation for Science and Technology (公財) 矢崎科学技術振興記念財団. jpy 220,000
2017 Integrated Science Laboratory Joint Research Grant 総合理学研究所共同研究助成, KU 神奈川大学. jpy 800,000
2016 Oversee Travel Expense Grant 海外渡航旅費援助, The Telecommunications Advancement Foundation (公財) 電気通信普及財団. jpy 220,000
2015 International Technical Exchange Grant 国際技術交流援助, TEPCO Memorial Foundation (公財) 東電記念財団. jpy 200,000
2014 International Exchange Grant 国際交流援助, Research Foundation for the Electrotechnology of Chubu (公財) 中部電気利用基礎研究振興財団. jpy 120,000
2014 School Competitive Grant 傾斜的研究費 (部局分) (部局競争的経費), AIIT 産業技術大学院大学. jpy 300,000
2014 Young Researcher Support Grant 傾斜的研究費 (部局分) (若手奨励経費), AIIT 産業技術大学院大学. jpy 1,500,000
More here.

Publications研究業績 (省略)

2016 A. Bossard and K. Kaneko, Set-to-set disjoint paths routing in Torus-Connected Cycles, IEICE Transactions on Information and Systems, vol. E99-D, no. 11, pp. 2821–2823.
2016 A. Bossard, aIME: a new input method based on Chinese characters algebra, Studies in Computational Intelligence, vol. 656, pp. 167–179.
2015 A. Bossard and K. Kaneko, Torus-Connected Cycles: a simple and scalable topology for interconnection networks, Int. Journal of Applied Mathematics and Computer Science, vol. 25, no. 4, pp. 723–735.
2015 A. Bossard, K. Kaneko and S. Peng, Node-to-set disjoint paths routing in a metacube, Int. Journal of High Performance Computing and Networking, vol. 8, no. 4, pp. 315–323.
2014 Best Paper Award A. Bossard and 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 A. Bossard and K. Kaneko, k-pairwise disjoint paths routing in perfect hierarchical hypercubes, The Journal of Supercomputing, vol. 67, no. 2, pp. 485–495.
2014 A. Bossard and T. Nagao, ModernDvi: a high quality rendering and modern DVI viewer, TUGboat: The Communications of the TeX Users Group, vol. 35, no. 1, pp. 61–68.
2014 A. Bossard and K. Kaneko, Set-to-set disjoint paths routing in hierarchical cubic networks, The Computer Journal, vol. 57, no. 2, pp. 332–337.
2014 A. Bossard and K. Kaneko, Time optimal node-to-set disjoint paths routing in hypercubes, Journal of Information Science and Engineering, vol. 30, no. 4, pp. 1087–1093.
2013 Best Paper Award A. Bossard and 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 A. Bossard, On the decycling problem in hierarchical hypercubes, Journal of Interconnection Networks, vol. 14, no. 2, pp. 1350006.1–1350006.13.
2012 A. Bossard and K. Kaneko, Node-to-set disjoint-path routing in hierarchical cubic networks, The Computer Journal, vol. 55, no. 12, pp. 1440–1446.
2012 A. Bossard and K. Kaneko, The set-to-set disjoint-path problem in perfect hierarchical hypercubes, The Computer Journal, vol. 55, no. 6, pp. 769–775.
2011 A. Bossard, K. Kaneko and S. Peng, A new node-to-set disjoint-path algorithm in perfect hierarchical hypercubes, The Computer Journal, vol. 54, no. 8, pp. 1372–1381.
More here.

Invited talks招待講演

2017 A computational approach to Chinese characters, 6th Int. Cong. on Advanced Applied Informatics (AAI), Hamamatsu, Japan.
2016 A computational approach to Chinese characters, University of Nevada Reno (UNR), Reno, NV, USA.
More here.

Lectures担当科目 (省略)

2015 onwards Architecture of computers 計算機アーキテクチャ, KU 神奈川大学.
2015 onwards Special topics in graph theory グラフ理論特論, KU 神奈川大学 大学院.
2016 onwards English for information science 情報英語, KU 神奈川大学.
2015 onwards Introduction to computer systems 計算機システム基礎, KU 神奈川大学.
2014 onwards Functional programming 関数プログラミング (Haskell), TUAT 東京農工大学.
2017, 2015–2013 Technical writing in English, AIIT 産業技術大学院大学.
2014, 2013 An algorithmic approach to functional programming (Scheme), AIIT 産業技術大学院大学.
More here.

Visited countries渡航歴

Finland France England Estonia Jersey Guernesey Austria Belgium Germany Switzerland USA Canada Japan Korea China Singapore Taiwan Philippines Australia
Visited USA states
California Colorado Florida Hawaii Louisiana Nevada Washington