Kazuo Misue

Kazuo Misue

Auto-generated profile, based on publicly available information

Kazuo Misue

University of Tsukuba

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 March 2016 in Health Care Management Science
Verified
Journal Article
Open access
PDF file
HTHideaki Takagi
Hideaki Takagi
YKYuta Kanai
Yuta Kanai
KMKazuo Misue
Kazuo Misue
A queueing network is used to model the flow of patients in a hospital using the observed admission rate of patients and the histogram for the length of stay for patients in each ward. A complete log of orders for every movement of all patients from room to room covering two years was provided to us by the Medical Information Department of the University of Tsukuba Hospital in Japan. We focused on obstetric patients, who are generally hospitalized at random times throughout the year, and we analyzed the patient flow probabilistically. On admission, each obstetric patient is assigned to a bed in one of the two wards: one for normal delivery and the other for high-risk delivery. Then, the patient may be transferred between the two wards before discharge. We confirm Little’s law of queueing theory for the patient flow in each ward. Next, we propose a new network model of M/G/ ∞ and M/M/ m queues to represent the flow of these patients, which is used to predict the probability distribution for the number of patients staying in each ward at the nightly census time. Although our model is a very rough and simplistic approximation of the real patient flow, the predicted probability distribution shows good agreement with the observed data. The proposed method can be used for capacity planning of hospital wards to predict future patient load in each ward.

28 November 2019
Verified
Book Chapter
Closed access
PDF file
KMKazuo Misue
Kazuo Misue
KAKatsuya Akasaka
Katsuya Akasaka

6 June 2025 in IEEE Transactions on Visualization and Computer Graphics
Verified
Journal Article
Open access
HFHenry Förster
Henry Förster
FKFelix Klesen
Felix Klesen
TDTim Dwyer
Tim Dwyer
PEPeter Eades
Peter Eades
SHSeok-Hee Hong
Seok-Hee Hong
Falk SchreiberFalk Schreiber
Falk Schreiber
Graph and network visualization supports exploration, analysis and communication of relational data arising in many domains: from biological and social networks, to transportation and powergrid systems. With the arrival of AI based question-answering tools, issues of trustworthiness and explainability of generated answers motivate a significant new role for visualization. In the context of graphs, we see the need for visualizations that can convince a critical audience that an assertion (e. g., from an AI) about the graph under analysis is valid. The requirements for such representations that convey precisely one specific graph property are quite different from standard network visualization criteria which optimize general aesthetics and readability. In this paper, we aim to provide a comprehensive introduction to visual proofs of graph properties and a foundation for further research in the area. We present a framework that defines what it means to visually prove a graph property. In the process, we introduce the notion of a visual certificate, that is, a specialized faithful graph visualization that leverages the viewer's perception, in particular, pre-attentive processing (e. g., via pop-out effects), verify to a given assertion about the represented graph. We also discuss the relationships between visual complexity, cognitive load and complexity theory, and propose a classification based on visual proof complexity. Then, we provide further examples of visual certificates for problems in different visual proof complexity classes. Finally, we conclude the paper with a discussion of the limitations of our model and some open problems.

19 January 2023
Verified
Book Chapter
Closed access
PDF file
KMKazuo Misue
Kazuo Misue

11 December 2024
Verified
Conference Paper
Open access
IMIkuya Morita
Ikuya Morita
STShigeo Takahashi
Shigeo Takahashi
YKYui Komo
Yui Komo
SNSatoshi Nishimura
Satoshi Nishimura
MAMasatoshi Arikawa
Masatoshi Arikawa
KMKazuo Misue
Kazuo Misue

1 July 2017
Verified
Conference Paper
Closed access
KHKouhei Hamada
Kouhei Hamada
TSTakahiro Saito
Takahiro Saito
KMKazuo Misue
Kazuo Misue
The analysis of incidents is important for preventing collisions between moving objects. However, it requires that many cases of incidents be collected as target data. The purpose of this study was to develop a method that supports the collection of many cases of anomalous (near-miss) approach from massive movement data. To achieve this, a relative superposition method is proposed. Relative superposition is a type of visualization method, in which the trajectories of pairs of moving objects are transformed, focusing on their relative positional relationships. The method is expected to facilitate the search for anomalous approach cases. This paper describes five types of relative superposition, together with a visual tool in which they are implemented. Moreover, it presents a case study in which anomalous approach cases of ships were searched by applying the tool to actual the automatic identification system (AIS) data.