scispace - formally typeset
Search or ask a question
Author

Kazuo Misue

Other affiliations: Fujitsu, University of Tokyo
Bio: Kazuo Misue is an academic researcher from University of Tsukuba. The author has contributed to research in topics: Visualization & Graph drawing. The author has an hindex of 16, co-authored 101 publications receiving 1679 citations. Previous affiliations of Kazuo Misue include Fujitsu & University of Tokyo.


Papers
More filters
Journal ArticleDOI
TL;DR: This paper discusses some layout adjustment methods and the preservation of the 'mental map' of the diagram, and two kinds of layout adjustments are described, an algorithm for rearranging a diagram to avoid overlapping nodes and a method aimed at changing the focus of interest of the user without destroying the mental map.
Abstract: Many models in software and information engineering use graph representations; examples are data flow diagrams, state transition diagrams, flow charts, PERT charts, organization charts, Petri nets and entity-relationship diagrams. The usefulness of these graph representations depends on the quality of the layout of the graphs. Automatic graph layout, which can release humans from graph drawing, is now available in several visualization systems. Most automatic layout facilities take a purely combinatorial description of a graph and produce a layout of the graph; these methods are called 'layout creation' methods. For interactive systems, another kind of layout is needed: a facility which can adjust a layout after a change is made by the user or by the application. Although layout adjustment is essential in interactive systems, most existing layout algorithms are designed for layout creation. The use of a layout creation method for layout adjustment may totally rearrange the layout and thus destroy the user's 'mental map' of the diagram; thus a set of layout adjustment methods, separate from layout creation methods, is needed. This paper discusses some layout adjustment methods and the preservation of the 'mental map' of the diagram. First, several models are proposed to make the concept of 'mental map' more precise. Then two kinds of layout adjustments are described. One is an algorithm for rearranging a diagram to avoid overlapping nodes, and the other is a method aimed at changing the focus of interest of the user without destroying the mental map. Next, some experience with visualization systems in which the techniques have been employed is also described.

613 citations

Journal ArticleDOI
Kozo Sugiyama1, Kazuo Misue1
01 Jul 1991
TL;DR: An automatic method for drawing compound digraphs that contain both inclusion edges and adjacency edges are presented, and a heuristic algorithm to generate readable diagrams is developed.
Abstract: An automatic method for drawing compound digraphs that contain both inclusion edges and adjacency edges are presented. In the method vertices are drawn as rectangles (areas for texts, images, etc.), inclusion edges by the geometric inclusion among the rectangles, and adjacency edges by arrows connecting them. Readability elements such as drawing conventions and rules are identified, and a heuristic algorithm to generate readable diagrams is developed. Several applications are shown to demonstrate the effectiveness of the algorithm. The utilization of curves to improve the quality of diagrams is investigated. A possible set of command primitives for progressively organizing structures within this graph formalism is discussed. The computational time for the applications shows that the algorithm achieves satisfactory performance. >

232 citations

Patent
25 May 1993
TL;DR: In this article, a document classifying system is formed by a document data classifier, a document classification function building system, a sample data storage apparatus and a keyword storage apparatus.
Abstract: A document classifying system is formed by a document data classifying system, a document classifying function building system, a sample data storage apparatus and a keyword storage apparatus. The document data classifying system inputs document data and defines a classification to which the document data belongs. The document classifying function building system is operatively connected to the document data classifying system and automatically builds a classification decision tree in the document data classifying system. A sample data storage apparatus is operatively connected to the document classifying function building system and stores sample data formed by a set comprised of the document data and the classification to which the document data belongs. The keyword storage apparatus is operatively connected to the document classifying function building system and stores keywords extracted thereby.

102 citations

Journal ArticleDOI
Kozo Sugiyama1, Kazuo Misue1
TL;DR: The proposed magnetic spring model and algorithm can control orientations of links and can nicely draw not only undirected graphs but also other classes of graphs such as trees, directed graphs and mixed graphs in a simple and unified manner.
Abstract: A novel and heuristic method for drawing graphs is proposed, introducing a new model called the magnetic spring model , that is an extension of the model by Eades. Graph drawing by force-directed placement has mainly been investigated so far for undirected graphs, and the idea of controlling edge orientations has not been considered. The proposed method can control orientations of links and can nicely draw not only undirected graphs but also other classes of graphs such as trees, directed graphs and mixed graphs in a simple and unified manner. Moreover, since the method is based upon simulations of physical systems, it is conceptually intuitive and therefore quite easy to understand, implement and improve the method. The magnetic spring model and algorithm are presented and many examples of drawings and results from statistical experiments are shown to demonstrate the effectiveness of the proposed method.

86 citations

Book ChapterDOI
Kozo Sugiyama1, Kazuo Misue1
10 Oct 1994
TL;DR: A simple and unified heuristic method for nicely drawing directed, undirected and mixed graphs is proposed basing upon a new model called magnetic-spring model which is an extension of Eades's spring model.
Abstract: A simple and unified heuristic method for nicely drawing directed, undirected and mixed graphs is proposed basing upon a new model called magnetic-spring model which is an extension of Eades's spring model. In the new model, the idea of controlling edge orientations by magnetic forces is employed. Since the method is conceptually intuitive, it is quite easy to understand, implement, tune and improve it. Examples of layouts and results of experiments are shown to demonstrate extensive possibilities of the method.

70 citations


Cited by
More filters
01 Jan 2012

3,692 citations

Journal ArticleDOI
01 May 1975
TL;DR: The Fundamentals of Queueing Theory, Fourth Edition as discussed by the authors provides a comprehensive overview of simple and more advanced queuing models, with a self-contained presentation of key concepts and formulae.
Abstract: Praise for the Third Edition: "This is one of the best books available. Its excellent organizational structure allows quick reference to specific models and its clear presentation . . . solidifies the understanding of the concepts being presented."IIE Transactions on Operations EngineeringThoroughly revised and expanded to reflect the latest developments in the field, Fundamentals of Queueing Theory, Fourth Edition continues to present the basic statistical principles that are necessary to analyze the probabilistic nature of queues. Rather than presenting a narrow focus on the subject, this update illustrates the wide-reaching, fundamental concepts in queueing theory and its applications to diverse areas such as computer science, engineering, business, and operations research.This update takes a numerical approach to understanding and making probable estimations relating to queues, with a comprehensive outline of simple and more advanced queueing models. Newly featured topics of the Fourth Edition include:Retrial queuesApproximations for queueing networksNumerical inversion of transformsDetermining the appropriate number of servers to balance quality and cost of serviceEach chapter provides a self-contained presentation of key concepts and formulae, allowing readers to work with each section independently, while a summary table at the end of the book outlines the types of queues that have been discussed and their results. In addition, two new appendices have been added, discussing transforms and generating functions as well as the fundamentals of differential and difference equations. New examples are now included along with problems that incorporate QtsPlus software, which is freely available via the book's related Web site.With its accessible style and wealth of real-world examples, Fundamentals of Queueing Theory, Fourth Edition is an ideal book for courses on queueing theory at the upper-undergraduate and graduate levels. It is also a valuable resource for researchers and practitioners who analyze congestion in the fields of telecommunications, transportation, aviation, and management science.

2,562 citations

Journal ArticleDOI
TL;DR: This is a survey on graph visualization and navigation techniques, as used in information visualization, which approaches the results of traditional graph drawing from a different perspective.
Abstract: This is a survey on graph visualization and navigation techniques, as used in information visualization. Graphs appear in numerous applications such as Web browsing, state-transition diagrams, and data structures. The ability to visualize and to navigate in these potentially large, abstract graphs is often a crucial part of an application. Information visualization has specific requirements, which means that this survey approaches the results of traditional graph drawing from a different perspective.

1,648 citations

Book
01 Dec 2006
TL;DR: Providing an in-depth examination of core text mining and link detection algorithms and operations, this text examines advanced pre-processing techniques, knowledge representation considerations, and visualization approaches.
Abstract: 1. Introduction to text mining 2. Core text mining operations 3. Text mining preprocessing techniques 4. Categorization 5. Clustering 6. Information extraction 7. Probabilistic models for Information extraction 8. Preprocessing applications using probabilistic and hybrid approaches 9. Presentation-layer considerations for browsing and query refinement 10. Visualization approaches 11. Link analysis 12. Text mining applications Appendix Bibliography.

1,628 citations