SAYAKA KAMEI

Last Updated :2025/03/26

Affiliations, Positions
Graduate School of Advanced Science and Engineering, Associate Professor
Web Site
https://home.hiroshima-u.ac.jp/s10kamei/index.html
E-mail
s10kameihiroshima-u.ac.jp
Self-introduction
Sayaka Kamei received the B.E., M.E., and D.E. degrees in computer science from Hiroshima University in 2001, 2003, and 2006, respectively. She worked at the Tottori University of Environmental Studies and Hiroshima University as an assistant professor from 2006-2008 and 2008-2012, respectively. Now, she is an associate professor of the Graduate School of Engineering, Hiroshima University. Her research interests include distributed algorithms. She is a member of the IEEE, IEEE Computer Society, ACM, IEICE, and IPSJ.

Basic Information

Educational Backgrounds

  • Hiroshima University, Japan, 2003/04, 2006/03
  • Hiroshima University, Japan, 2001/04, 2003/03
  • Hiroshima University, Japan, 1997/04, 2001/03

Academic Degrees

  • Doctor of Engineering, Hiroshima University
  • Master of Engineering, Hiroshima University

Educational Activity

  • [Bachelor Degree Program] School of Informatics and Data Science : Department of Informatics and Data Science : Data Science Program
  • [Master's Program] Graduate School of Advanced Science and Engineering : Division of Advanced Science and Engineering : Informatics and Data Science Program
  • [Doctoral Program] Graduate School of Advanced Science and Engineering : Division of Advanced Science and Engineering : Informatics and Data Science Program

Research Fields

  • Informatics;Principles of Informatics;Theory of informatics

Research Keywords

  • Distributed Algorithms

Affiliated Academic Societies

Educational Activity

Course in Charge

  1. 2024, Undergraduate Education, First Semester, Programming I
  2. 2024, Undergraduate Education, Second Semester, Programming IV
  3. 2024, Undergraduate Education, 1Term, Frontier of Informatics and Data Science
  4. 2024, Undergraduate Education, 1Term, Informatics and Data Science Exercise I
  5. 2024, Undergraduate Education, 1Term, Data Science Seminar I
  6. 2024, Undergraduate Education, 2Term, Data Science Seminar II
  7. 2024, Undergraduate Education, Intensive, Long-term Fieldwork I
  8. 2024, Undergraduate Education, Second Semester, Graduation Thesis
  9. 2024, Graduate Education (Master's Program) , 1Term, Special Exercises on Informatics and Data Science A
  10. 2024, Graduate Education (Master's Program) , 2Term, Special Exercises on Informatics and Data Science A
  11. 2024, Graduate Education (Master's Program) , 3Term, Special Exercises on Informatics and Data Science A
  12. 2024, Graduate Education (Master's Program) , 4Term, Special Exercises on Informatics and Data Science A
  13. 2024, Graduate Education (Master's Program) , 3Term, Special Exercises on Informatics and Data Science B
  14. 2024, Graduate Education (Master's Program) , 4Term, Special Exercises on Informatics and Data Science B
  15. 2024, Graduate Education (Master's Program) , Academic Year, Special Study on Informatics and Data Science
  16. 2024, Graduate Education (Master's Program) , Academic Year, Special Study on Informatics and Data Science
  17. 2024, Graduate Education (Master's Program) , 2Term, Information retrieval
  18. 2024, Graduate Education (Doctoral Program) , Academic Year, Special Study on Informatics and Data Science

Research Activities

Academic Papers

  1. Crash-Tolerant Perpetual Exploration with Myopic Luminous Robots on Rings, Leibniz International Proceedings in Informatics, LIPIcs, 324, 20250108
  2. Crash-Tolerant Perpetual Exploration with Myopic Luminous Robots on Rings, Leibniz International Proceedings in Informatics, LIPIcs, 324, 20250108
  3. Tailored Federated Learning: Leveraging Direction Regulation and Knowledge Distillation, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 15388 LNAI, 270-284, 20250101
  4. Tailored Federated Learning: Leveraging Direction Regulation and Knowledge Distillation, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 15388 LNAI, 270-284, 20250101
  5. A self-stabilizing distributed algorithm for the 1-MIS problem under the distance-3 model, Concurrency and Computation: Practice and Experience, 36(26), 20241130
  6. A self-stabilizing distributed algorithm for the 1-MIS problem under the distance-3 model, Concurrency and Computation: Practice and Experience, 36(26), 20241130
  7. Stand-up indulgent gathering on lines, Theoretical Computer Science, 1016, 20241112
  8. Stand-up indulgent gathering on lines, Theoretical Computer Science, 1016, 20241112
  9. Brief Announcement: Self-Stabilizing Graph Exploration by a Single Agent, Leibniz International Proceedings in Informatics, LIPIcs, 319, 20241024
  10. Brief Announcement: Self-Stabilizing Graph Exploration by a Single Agent, Leibniz International Proceedings in Informatics, LIPIcs, 319, 20241024
  11. MacGAN: A Moment-Actor-Critic Reinforcement Learning-Based Generative Adversarial Network for Molecular Generation, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 14331 LNCS, 127-141, 20240101
  12. MacGAN: A Moment-Actor-Critic Reinforcement Learning-Based Generative Adversarial Network for Molecular Generation, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 14331 LNCS, 127-141, 20240101
  13. Stand-Up Indulgent Gathering on Rings, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 14662 LNCS, 119-137, 20240101
  14. Stand-Up Indulgent Gathering on Rings, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 14662 LNCS, 119-137, 20240101
  15. Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots, Lecture Notes on Data Engineering and Communications Technologies, 200, 110-121, 20240101
  16. Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots, Lecture Notes on Data Engineering and Communications Technologies, 200, 110-121, 20240101
  17. Stand-Up Indulgent Gathering on Lines, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 14310 LNCS, 451-465, 20230101
  18. Stand-Up Indulgent Gathering on Lines, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 14310 LNCS, 451-465, 20230101
  19. Neighborhood mutual remainder: self-stabilizing distributed implementation and applications, Acta Informatica, 61(1), 83-100, 20231218
  20. Self-stabilizing 2-minimal dominating set algorithms based on loop composition, Theoretical Computer Science, 983, 20240201
  21. A self-stabilizing distributed algorithm for the bounded lattice domination problems under the distance-2 model, Concurrency and Computation: Practice and Experience, 36(3), 20231101
  22. An Asynchronous Maximum Independent Set Algorithm By Myopic Luminous Robots On Grids, Computer Journal, 67(1), 57-77, 20240101
  23. Stand-Up Indulgent Gathering on Rings, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 14662 LNCS, 119-137, 20240523
  24. Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots, Lecture Notes on Data Engineering and Communications Technologies, 200, 110-121, 20240410
  25. EarlGAN: An enhanced actor–critic reinforcement learning agent-driven GAN for de novo drug design, Pattern Recognition Letters, 175, 45-51, 20231101
  26. Evacuation from various types of finite two-dimensional square grid fields by a metamorphic robotic system, Concurrency and Computation: Practice and Experience, 35(14), 20230625
  27. Forgive and forget: Self-stabilizing swarms in spite of Byzantine robots, Concurrency and Computation: Practice and Experience, 35(11), 20230515
  28. Location functions for self-stabilizing byzantine tolerant swarms, THEORETICAL COMPUTER SCIENCE, 954, 20230418
    Link to Paper Search Results by DOI
  29. Stand-Up Indulgent Gathering on Lines, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 14310 LNCS, 451-465, 20230930
  30. A Visual Interpretation-Based Self-improved Classification System Using Virtual Adversarial Training, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 14179 LNAI, 548-562, 20231105
  31. Data Augmentation Methods for Enhancing Robustness in Text Classification Tasks, Algorithms, 16(1), 20230116
  32. A self-stabilizing distributed algorithm for the 1-MIS problem under the distance-3 model, Proceedings - 2023 11th International Symposium on Computing and Networking Workshops, CANDARW 2023, 100-106, 20231127
  33. A self-stabilizing token circulation with graceful handover on bidirectional ring networks, International Journal of Networking and Computing, 12(1), 103-130, 20220610
  34. Asynchronous Gathering in a Torus, Leibniz International Proceedings in Informatics, LIPIcs, 217, 20220201
  35. Overall Rating Prediction from Review Texts using Category-oriented Japanese Sentiment Polarity Dictionary, Proceedings - 2022 10th International Symposium on Computing and Networking, CANDAR 2022, 124-129, 20220101
  36. Location Data Anonymization Retaining Data Mining Utilization, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 13726 LNAI, 407-418, 20220101
  37. A linear-time self-stabilizing distributed algorithm for the minimal minus (L, K, Z) -domination problem under the distance-2 model, Proceedings - 2022 10th International Symposium on Computing and Networking Workshops, CANDARW 2022, 168-173, 20220101
  38. A self-stabilizing 2-minimal dominating set algorithm based on loop composition in networks of girth at least 7, Proceedings - 2022 IEEE 36th International Parallel and Distributed Processing Symposium, IPDPS 2022, 1140-1150, 20220101
  39. Matrix Factorization with Topic and Sentiment Analysis for Rating Prediction, International Journal of Networking and Computing, 11(2), 198-214, 20210701
  40. A self-stabilizing distributed algorithm for the local (1,|Ni|)-critical section problem, Concurrency and Computation: Practice and Experience, 33(12), 20210625
  41. A self-stabilizing token circulation with graceful handover on bidirectional ring networks, 2021 IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2021 - In conjunction with IEEE IPDPS 2021, 596-604, 20210601
  42. A Distributed Multi-group Mutual Exclusion Algorithm for Intersection Traffic Control, Proceedings - 2021 9th International Symposium on Computing and Networking Workshops, CANDARW 2021, 265-291, 20210101
  43. Location Functions for Self-stabilizing Byzantine Tolerant Swarms, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 13046 LNCS, 229-242, 20210101
  44. Category-oriented Sentiment Polarity Dictionary for Rating Prediction of Japanese Hotels, Proceedings - 2020 8th International Symposium on Computing and Networking Workshops, CANDARW 2020, 440-444, 20201101
  45. Topic and Sentiment Analysis Matrix Factorization on Rating Prediction for Recommendation, Proceedings - 2020 8th International Symposium on Computing and Networking Workshops, CANDARW 2020, 137-143, 20201101
  46. Evacuation from a finite 2D square grid field by a metamorphic robotic system, Proceedings - 2020 8th International Symposium on Computing and Networking, CANDAR 2020, 69-78, 20201101
  47. Gathering on rings for myopic asynchronous robots with lights, Leibniz International Proceedings in Informatics, LIPIcs, 153, 20200201
  48. A Tensor Factorization on Rating Prediction for Recommendation by Feature Extraction from Reviews, Proceedings - 2019 7th International Symposium on Computing and Networking, CANDAR 2019, 218-224, 20191101
  49. Forgive & Forget: Self-stabilizing swarms in spite of byzantine robots, Proceedings - 2019 7th International Symposium on Computing and Networking Workshops, CANDARW 2019, 188-194, 20191101
  50. Brief announcement: Neighborhood mutual remainder and its self-stabilizing implementation of look-compute-move robots, Leibniz International Proceedings in Informatics, LIPIcs, 146, 20191001
  51. A self-stabilizing algorithm for the local (1,|Ni|)-Critical section problem with safe convergence, Proceedings - 2019 IEEE 33rd International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2019, 609-618, 20190501
  52. And: Self-stabilizing LCM Schedulers for Autonomous Mobile Robots Using Neighborhood Mutual Remainder, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 11914 LNCS, 127-132, 20190101
  53. And Forgive & Forget: Self-stabilizing Swarms in Spite of Byzantine Robots, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 11914 LNCS, 16-21, 20190101
  54. Self-stabilizing algorithm for dynamically maintaining two disjoint dominating sets, Proceedings - 2018 6th International Symposium on Computing and Networking Workshops, CANDARW 2018, 278-284, 20181226
  55. A Self-Stabilizing Algorithm for Two Disjoint Minimal Dominating Sets with Safe Convergence, Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS, 2018-December, 365-372, 20180702
  56. Collaborative P2P Painting on a Shared Canvas, Proceedings - 19th IEEE International Conference on Computational Science and Engineering, 14th IEEE International Conference on Embedded and Ubiquitous Computing and 15th International Symposium on Distributed Computing and Applications to Business, Engineering and Science, CSE-EUC-DCABES 2016, 221-224, 20170714
  57. An Asynchronous Message-Passing Distributed Algorithm for the Global Critical Section Problem, Proceedings - 2017 5th International Symposium on Computing and Networking, CANDAR 2017, 2018-January, 414-419, 20170702
  58. An asynchronous message-passing distributed algorithm for the generalized local critical section problem, Algorithms, 10(2), 20170601
  59. A hotel recommendation system based on reviews: What do you attach importance to?, Proceedings - 2016 4th International Symposium on Computing and Networking, CANDAR 2016, 710-712, 20170113
  60. Automatic generation of temporal feature vectors with application to tourism recommender systems, Proceedings - 2016 4th International Symposium on Computing and Networking, CANDAR 2016, 676-680, 20170113
  61. An asynchronous message-passing distributed algorithm for the generalized local critical section problem, ACM International Conference Proceeding Series, 203-207, 20161217
  62. Personalized web page recommendation based on preference footprint to browsed pages, IEICE Transactions on Information and Systems, E99D(11), 2705-2715, 20161101
  63. An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs, Theoretical Computer Science, 615, 102-119, 20160215
  64. Asynchronous ring gathering by oblivious robots with limited vision, Proceedings of the IEEE Symposium on Reliable Distributed Systems, 0(0), 46-49, 20141230
  65. Credibility Judgment Support System for Review, IPSJ Journal, 55(11), 2461-2475, 20141115
  66. Approximation algorithms for the set cover formation by oblivious mobile robots, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8878, 233-247, 20140101
  67. An asynchronous self-stabilizing approximation for the minimum connected dominating set with safe convergence in unit disk graphs, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8255 LNCS, 251-265, 20131201
  68. A boosting method considering tolerance against noisy data by weighting each data according to the distance between incidents, 113(286), 15-21, 20131105
  69. A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks, Journal of Combinatorial Optimization, 25(3), 430-459, 20130401
  70. Feasibility of polynomial-time randomized gathering for oblivious mobile robots, IEEE Transactions on Parallel and Distributed Systems, 24(4), 716-723, 20130319
  71. Time-optimal gathering algorithm of mobile robots with local weak multiplicity detection in rings, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E96-A(6), 1072-1080, 20130101
  72. Empirical analysis of periodically bookmarked web pages in social bookmarking systems, Proceedings of the 2012 3rd International Conference on Networking and Computing, ICNC 2012, 85-93, 20121201
  73. Brief announcement: Mobile agent rendezvous on edge evolving rings, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7596 LNCS, 92-94, 20121107
  74. Brief announcement: Mobile agent rendezvous on edge evolving rings, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7596 LNCS, 92-94, 20121107
  75. Gathering an even number of robots in an odd ring without global multiplicity detection, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7464 LNCS, 542-553, 20120820
  76. How to Reduce the Number of Access Points in WMNs without Increasing the Communication Latancy, Technical report of IEICE. CQ, 112(119), 71-76, 20120705
  77. A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs, Theoretical Computer Science, 428, 80-90, 20120413
  78. Mobile agent rendezvous on a probabilistic edge evolving ring, Proceedings of the 2012 3rd International Conference on Networking and Computing, ICNC 2012, 103-112, 20120101
  79. Autonomous multi-source multi-sink routing in wireless sensor networks, Journal of Information Processing, 20(1), 319-326, 20120101
  80. Fast and reliable route maintenance protocols for WSN with crash and intermittent failures, Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011, 40-49, 20111201
  81. Asynchronous mobile robot gathering from symmetric configurations without global multiplicity detection, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6796 LNCS, 150-161, 20110810
  82. Observations on non-silent self-stabilizing algorithms in sensor networks with probabilistically intermittent link failures, Theoretical Computer Science, 412(33), 4336-4349, 20110729
  83. A Robust and Fast Routing Mechanism in Wireless Sensor Networks, IEICE technical report, 110(378), 73-78, 20110113
  84. A token-based distributed algorithm for the generalized resource allocation problem, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6490 LNCS, 411-426, 20101201
  85. Mobile robots gathering algorithm with local weak multiplicity in rings, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6058 LNCS, 101-113, 20100714
  86. A Self-stabilizing distributed approximation algorithm for the minimum connected dominating set, International Journal of Foundations of Computer Science, 21(3), 459-476, 20100601
  87. Timer-based composition of fault-containing self-stabilizing protocols, Information Sciences, 180(10), 1802-1816, 20100515
  88. Biased Index Distribution Technique and its Application for P2P File Search, IEICE technical report. Information networks, 109(362), 1-6, 20100107
  89. A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6196 LNCS, 80-89, 20100101
  90. A heuristic routing scheme for wireless sensor networks based on a local search method, I-SPAN 2009 - The 10th International Symposium on Pervasive Systems, Algorithms, and Networks, 46-51, 20091201
  91. Randomized gathering of mobile robots with local-multiplicity detection, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5873 LNCS, 384-398, 20091201
  92. Cached sensornet transformation of non-silent self-stabilizing algorithms with unreliable links, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5873 LNCS, 428-442, 20091201
  93. A shape recognition scheme for wireless sensor networks based on a distance field method, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5574 LNCS, 350-361, 20090921
  94. A self-stabilizing approximation for the minimum connected dominating set with safe convergence, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5401 LNCS, 496-511, 20081201
  95. A token-based distributed group mutual exclusion algorithm with quorums, IEEE Transactions on Parallel and Distributed Systems, 19(9), 1153-1166, 20080819
  96. An improvement of the interest mining method based on a network reconfiguration, IEICE technical report. Information networks, 108(136), 7-12, 20080710
  97. On effective index caching technique for P2P file-sharing systems, IEICE technical report. Information networks, 108(136), 1-6, 20080710
  98. Timer-based composition technique for self-stabilizing protocols preserving the fault-containment property, IPSJ SIG Notes, 2008(49), 1-8, 20080520
  99. A self-stabilizing distributed approximation algorithm for the minimum connected dominating set, Proceedings - 21st International Parallel and Distributed Processing Symposium, IPDPS 2007; Abstracts and CD-ROM, 20070924
  100. A Time-based Appraising Method in Cached Peer-to-Peer Networks, Technical report of IEICE. CST, 105(573), 69-74, 20060120
  101. A Coterie Construction Algorithm in Dynamic Environment, Technical report of IEICE. CST, 105(573), 63-68, 20060120
  102. Composition of fault-containing protocols based on recovery waiting fault-containing composition framework, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 4280 LNCS, 516-532, 20060101
  103. A Self-Stabilizing Approximation Algorithm for the Distributed Minimum k-Domination(Discrete Mathematics and Its Applications), IEICE transactions on fundamentals of electronics, communications and computer sciences, 88(5), 1109-1116, 20050501
  104. A self-stabilizing approximation algorithm for the distributed minimum k-domination, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E88-A(5), 1109-1115, 20050101
  105. A Self-Stabilizing Distributed Algorithm for the Steiner Tree Problem, IEICE Transactions on Information and Systems, E87-D(2), 299-307, 20040101
  106. A self-stabilizing algorithm for the distributed minimal k-redundant dominating set problem in tree networks, Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings, 720-724, 20031201
  107. A Quorum-Based Distributed Algorithm for Group Mutual Exclusion, Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings, 742-746, 20031201
  108. A Self-Stabilizing Algorithm for the Steiner Tree Problem, IPSJ SIG Notes, 2003(92), 43-50, 20030919
  109. A self-stabilizing algorithm for the Steiner tree problem, Proceedings of the IEEE Symposium on Reliable Distributed Systems, 396-401, 20021217
  110. Drastic Fluctuation Prediction of the Number of Comments on Social Media by Attributes of Comments, INTERNATIONAL JOURNAL OF SEMANTIC COMPUTING, 15(01), 1-21, 202103
    Link to Paper Search Results by DOI
  111. Brief announcement: Forgive & Forget: Self-Stabilizing Swarms in Spite of Byzantine Robots, Proc. 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems, 201910
  112. A self-stabilizing algorithm for two disjoint minimal dominating sets with safe convergence, 2018 IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS), 201812
  113. Rating Prediction with Topic Gradient Descent Method for Matrix Factorization in Recommendation, INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 8(12), 469-476, 201712
  114. A Japanese Tourism Recommender System with Automatic Generation of Seasonal Feature Vectors, INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 8(6), 347-354, 201706
  115. A SELF-STABILIZING DISTRIBUTED APPROXIMATION ALGORITHM FOR THE MINIMUM CONNECTED DOMINATING SET, INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 21(3), 459-476, 201006
    Link to Paper Search Results by DOI
  116. Hierarchical Composition of Self-Stabilizing Protocols Preserving the Fault-Containment Property, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E92D(3), 451-459, 200903
    Link to Paper Search Results by DOI
  117. A Tensor Factorization on Rating Prediction for Recommendation by Feature Extraction from Reviews, International Journal of Networking and Computing, 10(2), 111-126, 2020
  118. Asynchronous message-passing distributed algorithm for the global critical section problem, International Journal of Networking and Computing, 9(2), 2019
  119. Brief Announcement: Neighborhood Mutual Remainder and its Self-Stabilizing Implementation of Look-Compute-Move Robots, Proc. 33rd International Symposium on Distributed Computing, 2019
  120. Course Recommendation System using Doc2Vec, 2019
  121. An asynchronous message-passing distributed algorithm for the global critical section problem, Proc. the 9th International Workshop on Parallel and Distributed Algorithms and Applications, in conjunction with CANDAR 2017, 2017
  122. An asynchronous message-passing distributed algorithm for the generalized local critical section problem, The Fifth International Conference on Network, Communication and Computing (ICNCC), Proceedings, 2016
  123. Ring Gathering by Robots with Limited Vision, Proceedings of the 8th Annual Meeting of Asian Association for Algorithms and Computation (AAAC2015), 2015
  124. Set Cover Formation Algorithms by Mobile Robots, Proceedings of the 8th Annual Meeting of Asian Association for Algorithms and Computation (AAAC2015), 2015
  125. An Asynchronous Self-Stabilizing Approximation for the Minimum Connected Dominating Set with Safe Convergence in Unit Disk Graphs, The 15th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS2013),, 251-265, 2013
  126. Special Issue on Selected Papers from the First International Conference Networking and Computing, IJNC, 1(2), 131-131, 2011

Invited Lecture, Oral Presentation, Poster Presentation

  1. Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots, Quentin Bramas, Hirotsugu Kakugawa, Anissa Lamani, Fukuhito Ooshita, Masahiro Shibata, and Sebastien Tixeuil, The 38th International Conference on Advanced Information Networking and Applications (AINA-2024), 2024/04/17, Without Invitation, English, published
  2. Stand-Up Indulgent Gathering on Lines, Quentin Bramas, Anissa Lamani, and Sebastien Tixeuil,, 25th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2023/10/02, Without Invitation, English, Institute for Future Technologies (NJIT-BGU Partnership), 101 Hudson Street, Jersey City, New Jersey, USA, published
    Related URL
  3. An asynchronous maximum independent set algorithm by myopic luminous robots on grids, SAYAKA KAMEI, SÉBASTIEN TIXEUIL, Research Meeting and School on Distributed Computing by Mobile Robots, 2022/09/19, With Invitation, English, Pisa, Italia
    Related URL
  4. Autonomous Distributed Systems of Myopic Mobile Robots with Lights, Sayaka Kamei, 22nd International Conference on Distributed Computing and Networking, 2021/01/07, With Invitation, English
    Related URL
  5. Asynchronous Ring Gathering by Oblivious Robots with Limited Vision, Anissa Lamani, Fukuhito Ooshita, IEEE Symposium on Reliable Distributed Systems, 2014/10/06, Without Invitation, English, IEEE, Nara
  6. Approximation Algorithms for the Set Cover Formation by Oblivious Mobile Robots, Sayaka Kamei, Tomoko Izumi, Yukiko Yamauchi, The 18th International Conference on Principles of Distributed Systems, 2014/12/19, Without Invitation, English
  7. How to Extract Seasonal Features of Sightseeing Spots from Twitter and Wikipedia (Preliminary Version), Guanshen Fang, Satoshi Fujita, International Workshop on Networking, Computing, Systems, and Software, 2014/12/10, Without Invitation, English
  8. Ring Gathering by Robots with Limited Vision, Anissa Lamani, Anissa Lamani, Fukuhito Ooshita, The 8th Annual Meeting of Asian Association for Algorithms and Computation (AAAC2015),, 2015/05, Without Invitation, English
  9. Set Cover Formation Algorithms by Mobile Robots, Sayaka Kamei, Tomoko Izumi, Yukiko Yamauchi, The 8th Annual Meeting of Asian Association for Algorithms and Computation (AAAC2015), 2015/05, Without Invitation, English
  10. A Method of Temporal Feature Characterization with Application to Tourism Recommender Systems, 2016/03, Without Invitation, Japanese
  11. A Survey on Self-stabilizing Distributed Approximation Algorithms, Sayaka Kamei, Workshop on Advanced Distributed Algorithms, 2016/11/23, With Invitation, English, Higashi-hiroshima
  12. An asynchronous message-passing distributed algorithm for the global critical section problem, Sayaka Kamei, Hirotsugu Kakugawa, The 9th International Workshop on Parallel and Distributed Algorithms and Applications, in conjunction with CANDAR 2017, 2017/11/20, Without Invitation, English
  13. Drastic Fluctuation Prediction of the Number of Comments on Social Media by Feature Comments, Yuan Wang, Sayaka Kamei, Satoshi Fujita, 2018/10/20, Without Invitation, English, Hiroshima

Awards

  1. 2020/11/29, CANDAR Outstanding Paper Award, CANDAR, Evacuation from a Finite 2D Square Grid Field by a Metamorphic Robotic System
  2. 2018/11/29, Best Paper Award The 10th International Workshop on Parallel and Distributed Algorithms and Applications, The 10th International Workshop on Parallel and Distributed Algorithms and Applications, Self-stabilizing algorithm for dynamically maintaining two disjoint dominating sets
  3. 2017/11/20, Best Paper Award The 9th International Workshop on Parallel and Distributed Algorithms and Applications
  4. 2017/11/20, CANDAR/Workshop Best/Outstanding Paper Award, An asynchronous message-passing distributed algorithm for the global critical section problem
  5. 2016/11/23, Best Paper Award The 7th International Workshop on Advances in Networking and Computing (WANC), WANC Organizing Committee

External Funds

Acceptance Results of Competitive Funds

  1. KAKENHI, 2014, 2018
    Permalink
  2. KAKENHI, A study of fault-tolerant distributed approximation algorithms for dynamic wireless networks, 2010, 2013
    Permalink
  3. KAKENHI, Research on self-* distributed algorithms in dynamic netwroks, 2008, 2011
    Permalink
  4. KAKENHI, 2023, 2026
    Permalink
  5. KAKENHI, A Study of fault-tolerant distributed approximation algorithms for MANET, 2007, 2009
    Permalink
  6. KAKENHI(Grant-in-Aid for Scientific Research (C)), 2019, 2023
  7. Strategic International Collaborative Research Program, 2018/06/01, 2022/03/31

Social Activities

History as Committee Members

  1. Guest Editor, 2020/12, 2021/06, Concurrency and Computation: Practice and Experience
  2. guest editor, 2020/09, 2021/03, Concurrency and Computation: Practice and Experience
  3. Guest Editor, 2019/12, 2020/06, Concurrency and Computation: Practice and Experience
  4. editor, 2019/05, 2023/05, IEICE
  5. Guest Editor, 2018/11, 2019/11, Concurrency and Computation: Practice and Experience
  6. Guest Editor, 2021/12, 2022/06, Concurrency and Computation: Practice and Experience
  7. Guest Editor, 2022/12, 2023/06, Concurrency and Computation: Practice and Experience
  8. Guest Editor, 2023/12, 2024/06, Concurrency and Computation: Practice and Experience

Organizing Academic Conferences, etc.

  1. 2023/09, 2024/03
  2. ALGOWIN 2024, program committee, 2024/04, 2024/09
    Permalink
  3. ICDCIT-2024, program committee, 2023/06, 2024/01
    Permalink
  4. ICDCIT-2025, program committee, 2024/06, 2025/01
    Permalink
  5. Euro-Par'2023 (Euro-Par'2023: 29th International European Conference on Parallel and Distributed Computing (Euro-Par'2023)), PC member, 2023/02, 2023/09
  6. ICDCN2023, Program Comittee, 2022/01, 2023/01
  7. SSS, Program Comitee, 2022/01, 2022/11
  8. OPODIS, Program Comitee, 2021/05, 2021/12
  9. PDAA, Workshop co-chair, 2021/11, 2021/11
  10. CANDAR, Program Committee, 2021/04, 2021/11
  11. WDALFR, WORKSHOP co-organizer, 2020/20, 2021/01
    Permalink
  12. CANDAR, Program Committee, 2020/07, 2020/11
    Permalink
  13. ICDCN, Program comittee, 2020/06, 2021/01
    Permalink
  14. SSS2020, Track chair, 2020/03, 2020/11
    Permalink
  15. PDAA, Workshop co-chair, 2020/03, 2020/11
    Permalink
  16. ICDCN, Technical Program Committee, 2020/01, 2020/01
  17. CANDAR, Program Committee, 2019/11, 2019/11
  18. PDAA, Workshop co-chair, 2019/11, 2019/11
  19. Workshop on Distributed Algorithms for Low-Functional Robots, Organizers, 2019/11, 2019/11
  20. The 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2019), PC (Track C: Theoretical and Practical Aspects of Stabilizing Systems), 2019/10, 2019/10
  21. PDAA, Workshop co-chair, 2018/11, 2018/11
  22. CANDAR, PC member, 2018/11, 2018/11
  23. SSS, PC member (Stabilizing Systems: Theory and Practice), 2017/11, 2017/11
  24. CANDAR, PC member (Track 1: Algorithms and Applications), 2017/11, 2017/11
  25. PDAA, PC member (PDAA: International Workshop on Parallel and Distributed Algorithms and Applications), 2017/11, 2017/11
  26. 2016/03, 2016/11
  27. 2016/, 2016/
  28. ICDCN 2017, program committee, 2016/, 2016/
  29. PDAA2016, Program comittee, 2016/, 2016/
  30. CANDAR 2016, program committee, 2016/, 2016/
  31. APDCM 2016, Program Committee, 2016/, 2016/
  32. APDCM2015, program committee, 2015/05, 2015/05
  33. DISC2015, Local Arrangement Team, 2015/04, 2015/10
    Permalink
  34. WSSR, committee member, 2014/12, 2014/12
  35. SSS, track program committee, 2014/09, 2014/10
  36. LA symposium, 2014/04, 2015/05
  37. SIROCCO2014, organization committee, 2013/09, 2014/08
  38. CANDAR, Program Committee, 2023/04, 2023/11
    Permalink
  39. CANDAR2024, Program Committee, 2024/04, 2024/11
    Permalink
  40. PDAA2023, Workshop co-chair, 2023/11, 2023/11
    Permalink
  41. PDAA2024, Workshop co-chair, 2024/11, 2024/11
    Permalink
  42. PDAA, Workshop co-chair, 2022/11, 2022/11
  43. OPODIS, Program Comitee, 2023/05, 2023/12
  44. SSS2024, Track A, Co-Chair, 2024/01, 2024/11
    Permalink
  45. SSS, Program Comitee, 2023/01, 2023/11