Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Yasuki Iizuka is active.

Publication


Featured researches published by Yasuki Iizuka.


international conference on human-computer interaction | 2011

An Effective Disaster Evacuation Assist System Utilized by an Ad-Hoc Network

Yasuki Iizuka; Kyoko Yoshida; Kayo Iizuka

This paper proposes a system that supports effective evacuation from danger using an original Distributed Constraint Optimization Problem (DCOP) algorithm DiSTaS-Anne (Distributed Tabu Search with simulated Annealing). The use of DCOP facilitates the assisted optimization of people’s evacuation timing, by estimating the location of evacuees. This system enables assistance in terms of evacuation guidance to be given to relieve congestion, by calculating evacuation routes via an ad-hoc network of evacuees’ mobile devices (phones, PCs, etc.), intercommunication function and location information.


international conference on online communities and social computing | 2011

A real-time disaster situation mapping system for university campuses

Kayo Iizuka; Yasuki Iizuka; Kyoko Yoshida

This paper proposes a real-time disaster situation mapping system for campuses. University campuses have various features and issues (e.g., difficult to determine the number of people on campus at any one time as there are many students studying at the library or in their rooms, visitors can also use the open spaces, building layouts are often very complicated etc.), and therefore unique disaster prevention efforts are required. In order to address these prevention issues, a system that facilitates disaster situation information transmission by users will be effective. PlaceEngine is implemented for this system to allow users to estimate the current location easily by utilizing Wi-Fi devices.


acm multimedia | 2012

Food menu selection support system: considering constraint conditions for safe dietary life

Kayo Iizuka; Takuya Okawada; Kouki Matsuyama; Sui Kurihashi; Yasuki Iizuka

This paper proposes a food menu selection support system to realize a safe dietary life considering constraint conditions. Nowadays, people have greater choice in food menu selection due to diversification of diet such as food choices available by dining out in restaurants and ready-made foods. Some people, such as food allergy and dialysis patients, however, are excluded from these benefits by dietary constraints...Food menu planning is difficult for people found to be allergic to certain foods, people on dialysis, or people who are recuperating at home after leaving hospital. To address these issues, we propose a food menu selection support system that considers the constraint conditions of individuals for a safe dietary life. The system supports various individual situations such as home, hospital, school, kindergarten and elder care residence.


international conference on knowledge based and intelligent information and engineering systems | 2011

Exceeding the efficiency of distributed approximate algorithms enabling by the multiplexing method

Yasuki Iizuka; Kayo Iizuka

Distributed constraint optimization problems have attracted attention as a method for resolving distribution problems in multiagent environments. In this paper, the authors propose a multiplex method aiming to improve the efficiency of a distributed nondeterministic approximate algorithm for distributed constraint optimization problems. Since much of the calculation time is used to transmit messages, improving efficiency using a multiplex calculation of distributed approximate algorithms might be feasible on the presupposition that the calculation time of each node or a small change in message length has no direct impact. The authors conducted a theoretical analysis of efforts to improve efficiency using a multiplex calculation of distributed approximate algorithms using extreme value theory and verifying with an experiment of a simple algorithm. A significant reduction in calculation time and improvement in the quality of the solution was ascertained, as a result of the experiment.


hawaii international conference on system sciences | 2015

Disaster Evacuation Assistance System Based on Multi-agent Cooperation

Yasuki Iizuka; Kayo Iizuka

This paper proposes a system that supports people being evacuated effectively from dangerous situations by using multi-agent cooperation. The main feature of this system is that it does not require central servers. The system uses the mobile devices of evacuees (e.g. Phones, mobile PCs, tablets) and performs distributed calculations while assessing the locations of evacuees. By using this system, the evacuees are able to know the appropriate evacuation timing. This paper focuses on the formalization of the disaster evacuation problem and how to solve it using the framework of the Distributed Constraint Optimization Problem (DCOP). In order to evaluate this system, an experiment was carried out using multi-agent simulation. The result of the experiment showed that, for the case where the evacuees can receive evacuation guidance from this system, the evacuation completion time for all evacuees (in the case) was about 10% - 30% less than in the case where this system is not used.


enterprise and organizational modeling and simulation | 2013

Issues about Inter-organizational Process Flow Adjustment in Business Process Modeling

Kayo Iizuka; Takuya Okawada; Masaaki Tsubone; Yasuki Iizuka; Chihiro Suematsu

Expectations of top management regarding information technology (IT) are said to be increasing. However, research results have shown that the dissatisfaction level of top management is high. 52.3% of top management personnel said “rather dissatisfied” and 5.7% answered “definitely dissatisfied” to a question (4-point scale) about the satisfaction with the information system of their companies [1] in Japan. This means about 60% of top management are unhappy with the information systems of their companies. From the survey results analyzed by the authors regarding process defining decisions, it is possible to assume that attempts to adjust and align an appropriate decision with understanding of its difficulty impact on the effect (satisfaction) of the information systems [2]. In this paper, the authors discuss business process modeling methods from the viewpoint of adjusting the needs and requirements of several perspectives (e.g. the satisfaction of top management and end users, efficiency of business process, and maintenance and control), regarding the issues of business process modeling for Japanese companies.


Procedia Computer Science | 2013

E-Business Process Modeling Issues: From the Viewpoint of Inter-organizational Process Efficiency and Information Sharing

Kayo Iizuka; Yasuki Iizuka; Chihiro Suematsu

Abstract E-business process modeling is an important factor in developing schemes of e-business. In order to develop schemes of e- business in or among firms, they have to reform their business process and information systems, considering changes that enable the companies to achieve new value. In this paper, the authors overview related works on developing e-business schemes, consider issues concerning e-business process modeling issues especially for Japanese companies bearing in mind their management style, and propose the idea of a modeling tool for supporting inter-organizational process flow adjustment.


software engineering, artificial intelligence, networking and parallel/distributed computing | 2012

An Approximate Algorithm for DCOP with Optimal Solution Attainment Rate of 0.99

Yasuki Iizuka

Distributed constraint optimization problems (DCOP) have attracted attention as a means of resolving distribution problems in multiagent environments. The authors has proposed a multiplex method targeting the improved efficiency of a distributed nondeterministic approximate algorithm for distributed constraint optimization problems. The multiplex method targeting the improved efficiency of a distributed nondeterministic approximate algorithm have been proposed for distributed constraint optimization problems. Since much of the computation time is used to transmit messages, improving efficiency using a multiplex computation of distributed approximate algorithms might be feasible, presuming that the computation time of each node or a small change in message length has no direct impact. Although it is usually impossible to guarantee that the approximation algorithm can obtain the optimal solution, the authors managed to do so, using a theoretically determined multiplex method. In addition, the authors shows the feasibility of an optimal solution attainment rate of 0.99 by an experiment using a Distributed Stochastic Search Algorithm.


international symposium on multimedia | 2011

Food Product Information Supplement System - Corresponding to Consumer Needs for Shopping and Eating Out

Kayo Iizuka; Takuya Okawada; Yasuki Iizuka

In this paper, the authors propose an effective information system that can supply food product information to meet consumer needs. Consumer awareness of food safety has recently intensified, and food allergy issues seem to be of increasing concern these days, hence the need for effective solutions are required. Improving the quality of food might be an important solution, but supplementation with key information for consumers might also be considered important. To help resolve this issue, the authors developed a prototype system to meet consumer needs based on the survey conducted. Place Engine is implemented for this system, allowing users to estimate their current location by utilizing Wi-Fi devices, and obtain information as to where they can obtain food that meets their requirements nearby.


international conference on advanced applied informatics | 2017

Stochastic Speculative Computation Method on General Purpose Graphics Processing Units

Yosuke Suzuki; Akira Hamada; Yasuki Iizuka

Parallel processing is considered effective in order to solve problems with significant computational complexity. The development of graphics processing units (GPU) in recent years has led to eneral purpose GPU (GPGPU) and brought significant benefits to the AI research field. In conventional parallel processing, processes must be frequently synchronized; thus, parallel computing does not necessarily improve the efficiency of computation except for special algorithms designed for parallel computation. In this study, we investigate the effect of applying MultiStart based speculative computation on GPGPU. This method incurs little synchronization overhead. Although the effect of this method is stochastic, an expected value is theoretically calculable. We analyze theoretically about the effects of the speculative method, and provide the results of applying the method to combinatorial optimization problems.

Collaboration


Dive into the Yasuki Iizuka's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Sui Kurihashi

University of Electro-Communications

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge