SAYAKA KAMEI

Last Updated :2021/04/06

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

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
  • 【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

Educational Activity

Course in Charge

  1. 2021, Undergraduate Education, 1Term, Informatics and data science, Exercise I
  2. 2021, Liberal Arts Education Program1, 1Term, Introductory Seminar for First-Year Students
  3. 2021, Undergraduate Education, First Semester, Programming I
  4. 2021, Graduate Education (Master's Program) , First Semester, Directed Study in Information Engineering IIB
  5. 2021, Graduate Education (Master's Program) , First Semester, Seminar in Information Engineering IIB
  6. 2021, Graduate Education (Doctoral Program) , Academic Year, Special Study on Informatics and Data Science
  7. 2021, Graduate Education (Master's Program) , 1Term, Special Exercises on Informatics and Data Science A
  8. 2021, Graduate Education (Master's Program) , 2Term, Special Exercises on Informatics and Data Science A
  9. 2021, Graduate Education (Master's Program) , 3Term, Special Exercises on Informatics and Data Science B
  10. 2021, Graduate Education (Master's Program) , 4Term, Special Exercises on Informatics and Data Science B
  11. 2021, Graduate Education (Master's Program) , Academic Year, Special Study on Informatics and Data Science
  12. 2021, Graduate Education (Master's Program) , 1Term, Information retrieval

Research Activities

Academic Papers

  1. A Tensor Factorization on Rating Prediction for Recommendation by Feature Extraction from Reviews, International Journal of Networking and Computing, 10(2), 111-126, 2020
  2. Forgive & Forget: Self-Stabilizing Swarms in Spite of Byzantine Robots, Proc. of the 11th International Workshop on Parallel and Distributed Algorithms and Applications, in conjunction with CANDAR 2019, 2019
  3. A self-stabilizing algorithm for the local (1,|Ni|)-critical section problem with safe convergence, Proc. of the 21st Workshop on Advances in Parallel and Distributed Computational Models, in conjunction with IPDPS 2019, 201905
  4. Asynchronous message-passing distributed algorithm for the global critical section problem, International Journal of Networking and Computing, 9(2), 2019
  5. Brief Announcement: Neighborhood Mutual Remainder and its Self-Stabilizing Implementation of Look-Compute-Move Robots, Proc. 33rd International Symposium on Distributed Computing, 2019
  6. Course Recommendation System using Doc2Vec, 2019
  7. 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
  8. Brief Announcement: Neighborhood Mutual Remainder: Self-Stabilizing Implementation of LCM Robots, Proc. 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems, 201910
  9. A Tensor Factorization on Rating Prediction for Recommendation by Feature Extraction from Reviews, Proc. 7th International Symposium on Computing and Networking, 201911
  10. Gathering on Rings for Myopic Asynchronous Robots with Lights, Proceedings of the 23rd International Conference on Principles of Distributed Systems, 2019
  11. A self-stabilizing distributed algorithm for the local (1,|N-i|)-critical section problem, CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2019
  12. 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
  13. Self-stabilizing algorithm for dynamically maintaining two disjoint dominating sets, Proc. of the 10th International Workshop on Parallel and Distributed Algorithms and Applications, in conjunction with CANDAR 2018, 201811
  14. An Asynchronous Message-Passing Distributed Algorithm for the Generalized Local Critical Section Problem, ALGORITHMS, 10(2), 201706
    Link to Paper Search Results by DOI
  15. 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
  16. 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
  17. 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
  18. An Asynchronous Message-Passing Distributed Algorithm for the Generalized Local Critical Section Problem, ALGORITHMS, 10(2), 2017
  19. ★, An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs, THEORETICAL COMPUTER SCIENCE, 615, 102-119, 20160215
    Link to Paper Search Results by DOI
  20. Personalized Web Page Recommendation based on Preference Footprint to Browsed Pages, IEICE TRANSACTIONS on Information and Systems, E99D(11), 2705-2715, 2016
  21. Collaborative P2p Painting on a Shared Canvas, Proc. 19th IEEE International Conference on Computational Science and Engineering (CSE 2016), 2016
  22. A hotel recommendation system based on reviews: What do you attach importance to?, Proc. of 7th International Workshop on Advances in Networking and Computing, in conjunction with CANDAR 2016, 2016
  23. Automatic Generation of Temporal Feature Vectors with Application to Tourism Recommender Systems, Proc. of 7th International Workshop on Advances in Networking and Computing, in conjunction with CANDAR 2016, 2016
  24. 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
  25. An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs, THEORETICAL COMPUTER SCIENCE, 615, 102-119, 2016
  26. Ring Gathering by Robots with Limited Vision, Proceedings of the 8th Annual Meeting of Asian Association for Algorithms and Computation (AAAC2015), 2015
  27. Set Cover Formation Algorithms by Mobile Robots, Proceedings of the 8th Annual Meeting of Asian Association for Algorithms and Computation (AAAC2015), 2015
  28. Credibility Judgment Support System for Review, IPSJ Journal, 55(11), 2461-2475, 20141115
  29. A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks, JOURNAL OF COMBINATORIAL OPTIMIZATION, 25(3), 430-459, 201304
    Link to Paper Search Results by DOI
  30. Feasibility of Polynomial-Time Randomized Gathering for Oblivious Mobile Robots, IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 24(4), 716-723, 201304
    Link to Paper Search Results by DOI
  31. Time-Optimal Gathering Algorithm of Mobile Robots with Local Weak Multiplicity Detection in Rings, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E96A(6), 1072-1080, 201306
    Link to Paper Search Results by DOI
  32. 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
  33. Time-Optimal Gathering Algorithm of Mobile Robots with Local Weak Multiplicity Detection in Rings, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E96A(6), 1072-1080, 2013
  34. 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
    Link to Paper Search Results by DOI
  35. Observations on non-silent self-stabilizing algorithms in sensor networks with probabilistically intermittent link failures, THEORETICAL COMPUTER SCIENCE, 412(33), 4336-4349, 20110729
    Link to Paper Search Results by DOI
  36. Timer-based composition of fault-containing self-stabilizing protocols, INFORMATION SCIENCES, 180(10), 1802-1816, 20100515
    Link to Paper Search Results by DOI
  37. 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
  38. 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
  39. Hierarchical Composition of Self-Stabilizing Protocols Preserving the Fault-Containment Property, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E92D(3), 451-459, 2009
  40. A token-based distributed group mutual exclusion algorithm with quorums, IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 19(9), 1153-1166, 200809
    Link to Paper Search Results by DOI
  41. A token-based distributed group mutual exclusion algorithm with quorums, IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 19(9), 1153-1166, 2008
  42. A self-stabilizing approximation algorithm for the distributed minimum k-domination, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E88A(5), 1109-1116, 200505
    Link to Paper Search Results by DOI
  43. A self-stabilizing distributed algorithm for the Steiner tree problem, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E87D(2), 299-307, 200402
    Link to Paper Search Results by DOI
  44. A boosting method considering tolerance against noisy data by weighting each data according to the distance between incidents, 113(286), 15-21, 20131105
  45. A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks, JOURNAL OF COMBINATORIAL OPTIMIZATION, 25(3), 430-459, 2013
  46. A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs, THEORETICAL COMPUTER SCIENCE, 428, 80-90, 2012
  47. Time-Optimal Gathering Algorithm of Mobile Robots with Local Weak Multiplicity Detection in Rings, 96(6), 1072-1080, 20130601
  48. Time-Optimal Gathering Algorithm of Mobile Robots with Local Weak Multiplicity Detection in Rings, IEICE Trans. Fundamentals, 96(6), 1072-1080, 2013
  49. 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
  50. Autonomous Multi-Source Multi-Sink Routing in Wireless Sensor Networks, Journal of Information Processing, 20(1), 319-326, 2012
  51. Autonomous Multi-Source Multi-Sink Routing in Wireless Sensor Networks, IMT, 7(1), 488-495, 2012
  52. A Robust and Fast Routing Mechanism in Wireless Sensor Networks, IEICE technical report, 110(378), 73-78, 20110113
  53. Biased Index Distribution Technique and its Application for P2P File Search, IEICE technical report. Information networks, 109(362), 1-6, 20100107
  54. Hierarchical Composition of Self-Stabilizing Protocols Preserving the Fault-Containment Property, IEICE Trans. Inf. & Syst., 92(3), 451-459, 20090301
  55. An improvement of the interest mining method based on a network reconfiguration, IEICE technical report. Information networks, 108(136), 7-12, 20080710
  56. On effective index caching technique for P2P file-sharing systems, IEICE technical report. Information networks, 108(136), 1-6, 20080710
  57. Timer-based composition technique for self-stabilizing protocols preserving the fault-containment property, IPSJ SIG Notes, 2008(49), 1-8, 20080520
  58. A Time-based Appraising Method in Cached Peer-to-Peer Networks, Technical report of IEICE. CST, 105(573), 69-74, 20060120
  59. A Coterie Construction Algorithm in Dynamic Environment, Technical report of IEICE. CST, 105(573), 63-68, 20060120
  60. 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
  61. A Self-Stabilizing Distributed Algorithm for the Steiner Tree Problem(Foundations of Computer Science), IEICE transactions on information and systems, 87(2), 299-307, 20040201
  62. A Self-Stabilizing Algorithm for the Steiner Tree Problem, IPSJ SIG Notes, 2003(92), 43-50, 20030919
  63. Feasibility of Polynomial-Time Randomized Gathering for Oblivious Mobile Robots, IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 24(4), 716-723, 2013
  64. Observations on non-silent self-stabilizing algorithms in sensor networks with probabilistically intermittent link failures, THEORETICAL COMPUTER SCIENCE, 412(33), 4336-4349, 2011
  65. A SELF-STABILIZING DISTRIBUTED APPROXIMATION ALGORITHM FOR THE MINIMUM CONNECTED DOMINATING SET, INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 21(3), 459-476, 2010
  66. Timer-based composition of fault-containing self-stabilizing protocols, INFORMATION SCIENCES, 180(10), 1802-1816, 2010
  67. A Method of Temporal Feature Characterization with Application to Tourism Recommender Systems
  68. Personalized Web Page Recommendation Based on Preference Footprint to Browsed Pages, IEICE Trans. Inf. & Syst., 99(11), 2705-2715, 2016
  69. Forgive & Forget: Self-Stabilizing Swarms in Spite of Byzantine Robots, Proc. of 11th International Workshop on Parallel and Distributed Algorithms and Applications
  70. Forgive and forget: Self-stabilizing swarms in spite of Byzantine robots, CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2020

Invited Lecture, Oral Presentation, Poster Presentation

  1. 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
  2. A Survey on Self-stabilizing Distributed Approximation Algorithms, Sayaka Kamei, Workshop on Advanced Distributed Algorithms, 2016/11/23, With Invitation, English, Higashi-hiroshima
  3. 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

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