VLDB 2026 Research / reviewers in the wild / expert
Michiharu Takemoto
dblp:48/1561
· DBLP profile ↗
14ranked-venue papers
3as first author
2since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 5 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 5 · 2 since 2021Computer networks · 4 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 first-author
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | InterlaceProximity: Proximity-Aware and Fault-Tolerant Backup Node Selection in Skip Graphs Toward Smart City Infrastructures
Takuya Suzuki, Michiharu Takemoto |
COMPSAC | 2 |
| 2025 | MONDAY: A Unified Semantic Communication Profile with Dynamic Role Integration in Pub/Sub SystemsabstractWe present MONDAY, a BLE overlay that bundles all three roles in firmware; the current prototype still runs one fixed role per node. A three-node prototype on XIAO ESP32-C6 achieved 99.1 % delivery with 40 ms apparent RTT through a write-notify relay and lightweight RTOS queue. We outline designs for topic-hash routing, dynamic role migration, and Wi-Fi/TCP ports as future work. Haruto Nakai, Michiharu Takemoto |
COMPSAC | 2 |
| 2018 | Message from the Fast Abstract Co-chairsabstractPresents the introductory welcome message from the conference proceedings. May include the conference officers' congratulations to all involved with the conference event and publication of the proceedings record. Hossain Shahriar, Hiroki Takakura, Michiharu Takemoto, Dave Towey |
COMPSAC (1) | 3 |
| 2017 | Message from COMPSAC 2017 Fast Abstract Track Co-ChairsabstractPresents the introductory welcome message from the conference proceedings. May include the conference officers' congratulations to all involved with the conference event and publication of the proceedings record. Dave Towey, Michiharu Takemoto, Hossain Shahriar |
COMPSAC (2) | 2 |
| 2015 | Comparison of subscriber assignment methods on scalable distributed Pub/Sub systemsabstractScalable messaging methods for IoT services are needed to accommodate a vast number of devices. Skip Graph based topic based pub/sub (SG-TPS), which utilizes multiple brokers composing a structured overlay network, is one of the promising candidates. In SG-TPS, the distribution delay time is widely influenced by a way to assign subscribers to each broker. There are two possible approaches: the intensive assignment by which subscribers having a same topic are accommodated on a same broker, and the extensive assignment by which the subscribers are accommodated on different brokers as far as possible. In this paper, we formulate the difference of the distribution delay time between these two approaches, and discuss about the optimization of subscriber assignment. Ryohei Banno, Tetsuo Kawano, Susumu Takeuchi, Michiharu Takemoto, Masato Matsuo |
APCC | 4 |
| 2014 | A Distributed Topic-Based Pub/Sub Method for Exhaust Data Streams towards Scalable Event-Driven SystemsabstractDistributed pub/sub messaging has become indispensable for event-driven systems. There are methods for achieving high scalability regarding topic-based pub/sub by using structured overlay networks. However, these methods waste network resources concerning "exhaust data," which have low or no value most of the time. There are at least two problems: each publisher node continues to forward data to a relay node even if there are no subscribers, and multicast trees are constructed which are excessively large for low value data, namely having a small number of subscribers. In this paper, we formulate the requirements of overlay networks by defining a property called "strong relay-free" as an expansion of relay-free property, and propose a practical method satisfying the property by using Skip Graph. The proposed method involves publishers and subscribers composing connected sub graphs to enable detecting the absence of subscribers and autonomously adjusting the tree size. Through simulation experiments, we confirmed that the proposed method can suspend publishing adaptively, and shorten the path length on multicast trees by more than 75% under an experimental condition with 100,000 nodes. The proposed method is competent for decentralized event-driven systems with encouraging the locally produced data to be consumed locally. Ryohei Banno, Susumu Takeuchi, Michiharu Takemoto, Tetsuo Kawano, Takashi Kambayashi, Masato Matsuo |
COMPSAC | 3 |
| 2009 | Field trial evaluation of a location-aware social capital serviceabstractWe have been studying a service coordination technology that enables users to use the various types of service elements that are available in a ubiquitous computing and networking environment. We have adopted a user context handling mechanism to choose suitable service components. In this paper, we proposed an adaptive information delivery method for personalized recommendation and information provisioning. This method can provide information services based on user location, preferences, or moving history to everyone, everywhere, using a mobile phone. This system is an information circulation system based on social capital, which refers to connections between social networks. Users can obtain information about events, sightseeing information, gourmet information, disaster prevention information from SNS by marking the location information. We also applied a location-dependent recommendation method based on user's movement history. We conducted a field trial to evaluate feasibility of the system. According to the results of our questionnaire, the information-provision style is acceptable to the users. In addition, according to the analysis of the user movement and user preferences, there was a correlation between user's visited place and interested genres. Yuuichi Teranishi, Yuki Yokohata, Shinji Shimojo, Michiharu Takemoto, Makoto Hamada, Keita Kumamaru, Toshirou Nakamura |
ISADS | 4 |
| 2007 | Demo: Implementation of Information-Provision Service with Smart Phone and Field Trial in Shopping AreaabstractTo achieve the information-provision service, we adopted the social network concept (http://en.wikipedia.org/wiki/Social_network_service), which handles human relationships in networks. We have implemented the information recommendation mechanism, by which users may obtain suitable information from the system based on relationships with other users in the social network service. We believe that information used by people should be handled based on their behavior. We have developed an information-provision service based on our platform. We have been studying and developing the service coordination and provision architecture - ubiquitous service-oriented network (USON) (Takemoto et al., 2002) - for services in ubiquitous computing environments. We have developed an information-provision service using the social network service based on USON architecture. This demonstration shows the implementation of the information-provision system with the actual information which was used in the field trial. Michiharu Takemoto, Yuki Yokohata, Tetsuro Tokunaga, Makoto Hamada, Toshirou Nakamura |
MobiQuitous | 1 |
| 2006 | Context-aware content-provision service for shopping malls based on ubiquitous service-oriented network framework and authentication and access control agent frameworkabstractAs emerging technologies are being developed, ubiquitous computing environments will be established in the near future. Research on user service provisions over ubiquitous computing environments has been started. The implementation method of an actual service, based on our proposed service-provision framework, is described in this demonstration and we will show the actual implementation in a demonstration area. This is a context-aware contentprovision service, and the content is assumed to be commercial advertisements in a shopping mall. The users can enjoy many types of the content-provision services based on their own profiles, which are used by the authentication and access control agents. Yuki Yokohata, Yoji Yamato, Michiharu Takemoto, Erika Tanaka, Kenya Nishiki, Takeshi Okuda, Yuuichi Teranishi |
CCNC | 3 |
| 2004 | P2P Applications Using the Semantic Information Oriented NetworkabstractThis paper describes P2P applications using an advanced P2P platform called SIONet. Based on its metadata-based routing and easy communication creation capabilities, various kinds of P2P applications can be constructed. Effective discovery, P2P content delivery with digital rights management, semi-active information exchanging community, and P2P ad hoc community are constructed. These are expected to be bases for next generation ubiquitous applications. Hiroshi Sunaga, Kiyoshi Ueda, Tetsuya Iwata, Kazuhiro Kikuma, Michiharu Takemoto |
Peer-to-Peer Computing | 5 |
| 2003 | Applications of an Advanced Peer-to-Peer PlatformabstractWe describe actual and trial applications on the SIONet (semantic information-oriented network) peer-to-peer (P2P) platform developed by NTT Labs. SIONet is a logical overlay network. Peers record semantic information on SIONet routers (SI switches), which use the information to guide the routing of packets. We have already developed on-line community systems, a storage system, integrated database systems, components for a software development environment, and a simple game. We look at some of these applications. Hiroshi Sunaga, Michiharu Takemoto, Takashi Nakata |
Peer-to-Peer Computing | 2 |
| 2002 | Advanced Peer-to-Peer Network Platform for Various Services - SIONet (Semantic Information Oriented Network)abstractThis paper describes an advanced peer-to-peer (P2P) platform called the Semantic Information Oriented Network (SIONet). This is a meta-network that delivers user events based on semantic information (meta-data) and searches for specific entities dynamically in the network. SIONet consists of Semantic Information (SI) Switch (SI-SW), which compares the meta-data of each event with the receiver's conditions, SI-Router (SI-R), which routes events between two SI-SWs, Event Place (EP), which is a logical subnet constructed by SI-SW and SI-R, and SI-Gateway (SI-GW), which connects EPs. These elements are self-organizing as needed, making possible a secure and scalable P2P network. Hiroshi Sunaga, Michiharu Takemoto, Tetsuya Iwata |
Peer-to-Peer Computing | 2 |
| 2002 | The Ubiquitous Service-Oriented Network (USON) - An Approach for a Ubiquitous World Based on P2P TechnologyabstractAs network technologies evolve in two areas-peer-to-peer technology and nomadic technology-new types of services provided through a ubiquitous environment will be created. To allow users to enjoy services in a ubiquitous environment, services that are appropriate to users' needs and desires must be created and discovered. In this paper, we describe the ubiquitous service-oriented network (USON). The USON is a network architecture for providing future networking services based on ubiquitous technologies. It is based on three technologies-service composition core technology, state-acquisition technology, and network reflective technology. Services provided through the USON will consist of autonomous distributed service elements (SEs). We describe the architecture, implementation, and an example of the USON, and explain how it will provide user services through a ubiquitous environment. Michiharu Takemoto, Hiroshi Sunaga, Kenichiro Tanaka, Hiroaki Matsumura, Eiji Shinohara |
Peer-to-Peer Computing | 1 |
| 2001 | Performance Evaluation of a Fault-Tolerant Mechanism Based on Replicated Distributed Objects for CORBAabstractFor future applications, it is important to develop systems using small objects. Such systems must be able to provide uninterrupted services even when some small objects stop. Replicating such objects is one way to do this. However, introducing some type of redundancy into systems generally adds some overhead. Our proposed model reduces this overhead. It is implemented with multi-threaded execution for applications in actual systems. We measured the performance of an implementation for applications connected to databases. The results show that the overhead for ordinary execution and the time required to switch the replicas are both acceptably small. This technique will therefore play an important role in future systems. Michiharu Takemoto, Takayuki Nakamura |
ISORC | 1 |