Social Network Analysis

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.

Fundamentals of Queueing Theory

The Visual Display of Quantitative Information

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.

/pdf/graph-visualization-and-navigation-in-information-24tisrjfna.pdf

Graph visualization and navigation in information visualization: A survey

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.

/pdf/the-text-mining-handbook-advanced-approaches-in-analyzing-ge55wa29fm.pdf

The Text Mining Handbook: Advanced Approaches in Analyzing Unstructured Data

A bipartite graph consists of a set of nodes that can be divided into two partitions such that no edge has both endpoints in the same partition. A semi-bipartite graph is a bipartite graph with edges in one partition. Anchored map is a graph drawing technique for bipartite graphs and provides aesthetically pleasing layouts of graphs with high readability by restricting the positions of nodes in a partition. For this research, the objects of the anchored map technique were extended to semi-bipartite graphs. A hybrid layout style of anchored maps and matrix representations are proposed, and an automatic drawing technique is shown. The proposed technique arranges the nodes in one partition on a circumference like the anchored map of bipartite graphs. It also divides nodes in the other partition with edges into clusters and represents them in the matrix representations to make it easy to see connective subsets.

/pdf/drawing-semi-bipartite-graphs-in-anchor-matrix-style-2gyutf151u.pdf

Drawing Semi-bipartite Graphs in Anchor+Matrix Style

Bipartite graphs appear in various scenes in the real world, and visualizing these graphs helps improve our understanding of network structures. The amount of information that is available to us has increased dramatically in recent years, and it is therefore necessary to develop a drawing technique that corresponds to large-scale graphs. In this paper, we describe drawing methods to make large-scale bipartite graphs easy to read. We propose two techniques: "node contraction drawing," which involves collecting similar nodes and drawing them as one node, and "isosimilarity contour drawing," which puts clusters into an outlined area. We developed interactive user interfaces for the drawing methods and conducted an evaluation experiment to demonstrate the effectiveness of the proposed techniques.

/pdf/readable-representations-for-large-scale-bipartite-graphs-2vrwavrh8e.pdf

Readable Representations for Large-Scale Bipartite Graphs

We propose a "layered structured network diagram," which consists of layers of time differences. We have implemented a tool called "NeL2 " for handling layered structured network diagrams. Layered structured network diagrams have multiple accumulated layers and are not single diagrams. Using this layered structure, time differences can be included in one diagram. In addition, various type of information, such as the overall tendency in a diagram during a specific period of time, can be visualized.We used layered structured network diagrams to show the co-authorship network of academic literature. Changes in the co-authorship network become visible using the layered structured network diagram. We can read various information such as changes of active research communities and other phenomena. In addition to co-authorship networks, the layered structured network diagram can be applied to the visualization of various data, such as idea processors, changes of Web sites, and others.

/pdf/nel-2-network-drawing-tool-for-handling-layered-structured-4m5y7u1oqf.pdf

NeL 2 : network drawing tool for handling layered structured network diagram

One of the main challenges of interaction in a ubiquitous environment is the use of hand gestures for interacting with day to day applications. This interaction may be negatively affected due to the change in the user's position, interaction device, or the level of social acceptance of a specific hand gesture. We present UbiGesture as architecture for developers and users who frequently change locations while interacting in ubiquitous environments. The architecture enables applications to be operated by using hand gestures. Normal users can customize their own hand gestures when interacting with computers in context-aware ubiquitous environments. UbiGesture is based on combining user preferences, location, input/output devices, applications, and hand gestures into one profile. A prototype implementation application for UbiGesture is presented. Then a subjective and objective primary evaluation for UbiGesture while interacting in different locations with different hand gesture profiles is presented.

/pdf/ubigesture-customizing-and-profiling-hand-gestures-in-dan6334khb.pdf

UbiGesture: Customizing and Profiling Hand Gestures in Ubiquitous Environment

Color plays an important role in information visualization. To use the colors as visual representations of the data effectively, designing color schemes that consider perceptual differences between colors is necessary. We developed a tool to assist in color-scheme design when using the CIE1976L*a*b* (or CIELAB) color space. The developed tool provides functions to assist in designing color schemes for nominal, ordinal, and quantitative data. The CIELAB color space has a property in which the Euclidean distances between any two colors in the space can approximate the perceptual differences between them. Thus, designing color schemes for data representation is convenient. However, because the CIELAB color space has a distorted shape, color scheme design in such space is not easy. Our tool allows the designer to see the positions of colors in the CIELAB color space visually to facilitate scheme design. Moreover, our tool provides information to the designer on the distinguishability of the selected colors, and offers functions to correct color schemes automatically.

Kazuo Misue

Papers

Drawing Semi-bipartite Graphs in Anchor+Matrix Style

Readable Representations for Large-Scale Bipartite Graphs

NeL 2 : network drawing tool for handling layered structured network diagram

UbiGesture: Customizing and Profiling Hand Gestures in Ubiquitous Environment

Design Tool of Color Schemes on the CIELAB Space