Phase transition kinetics in austempered ductile iron (ADI) with regard to MO content

The phase transformation to ausferrite during austempered ductile iron (ADI) heat treatment can be significantly influenced by the alloying element Mo. Utilizing neutron diffraction, the phase transformation from austenite to ausferrite was monitored in-situ during the heat treatment. In addition to the phase volume fractions, the carbon enrichment of retained austenite was investigated. The results from neutron diffraction were compared to the macroscopic length change from dilatometer measurements. They show that the dilatometer data are only of limited use for the investigation of ausferrite formation. However, they allow deriving the time of maximum carbon accumulation in the retained austenite. In addition, the transformation of austenite during ausferritization was investigated using metallographic methods. Finally, the distribution of the alloying elements in the vicinity of the austenite/ferrite interface zone was shown by atom probe tomography (APT) measurements. C and Mn were enriched within the interface, while Si concentration was reduced. The Mo concentration in ferrite, interface and austentite stayed at the same level. The delay of austenite decay during Stage II reaction caused by Mo was studied in detail at 400 °C for the initial material as well as for 0.25 mass % and 0.50 mass % Mo additions

Visual Similarity Perception of Directed Acyclic Graphs: A Study on Influencing Factors

While visual comparison of directed acyclic graphs (DAGs) is commonly encountered in various disciplines (e.g., finance, biology), knowledge about humans' perception of graph similarity is currently quite limited. By graph similarity perception we mean how humans perceive commonalities and differences in graphs and herewith come to a similarity judgment. As a step toward filling this gap the study reported in this paper strives to identify factors which influence the similarity perception of DAGs. In particular, we conducted a card-sorting study employing a qualitative and quantitative analysis approach to identify 1) groups of DAGs that are perceived as similar by the participants and 2) the reasons behind their choice of groups. Our results suggest that similarity is mainly influenced by the number of levels, the number of nodes on a level, and the overall shape of the graph.Comment: Graph Drawing 2017 - arXiv Version; Keywords: Graphs, Perception, Similarity, Comparison, Visualizatio

Visual parameter optimisation for biomedical image processing

Background: Biomedical image processing methods require users to optimise input parameters to ensure high quality output. This presents two challenges. First, it is difficult to optimise multiple input parameters for multiple input images. Second, it is difficult to achieve an understanding of underlying algorithms, in particular, relationships between input and output. Results: We present a visualisation method that transforms users’ ability to understand algorithm behaviour by integrating input and output, and by supporting exploration of their relationships. We discuss its application to a colour deconvolution technique for stained histology images and show how it enabled a domain expert to identify suitable parameter values for the deconvolution of two types of images, and metrics to quantify deconvolution performance. It also enabled a breakthrough in understanding by invalidating an underlying assumption about the algorithm. Conclusions: The visualisation method presented here provides analysis capability for multiple inputs and outputs in biomedical image processing that is not supported by previous analysis software. The analysis supported by our method is not feasible with conventional trial-and-error approaches

Evaluation of two interaction techniques for visualization of dynamic graphs

Several techniques for visualization of dynamic graphs are based on different spatial arrangements of a temporal sequence of node-link diagrams. Many studies in the literature have investigated the importance of maintaining the user's mental map across this temporal sequence, but usually each layout is considered as a static graph drawing and the effect of user interaction is disregarded. We conducted a task-based controlled experiment to assess the effectiveness of two basic interaction techniques: the adjustment of the layout stability and the highlighting of adjacent nodes and edges. We found that generally both interaction techniques increase accuracy, sometimes at the cost of longer completion times, and that the highlighting outclasses the stability adjustment for many tasks except the most complex ones.Comment: Appears in the Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016

Visual Causality: Investigating Graph Layouts for Understanding Causal Processes

Causal diagrams provide a graphical formalism indicating how statistical models can be used to study causal processes. Despite the extensive research on the efficacy of aesthetic graphic layouts, the causal inference domain has not benefited from the results of this research. In this paper, we investigate the performance of graph visualisations for supporting users’ understanding of causal graphs. Two studies were conducted to compare graph visualisations for understanding causation and identifying confounding variables in a causal graph. The first study results suggest that while adjacency matrix layouts are better for understanding direct causation, node-link diagrams are better for understanding mediated causation along causal paths. The second study revealed that node-link layouts, and in particular layouts created by a radial algorithm, are more effective for identifying confounder and collider variables

Application of Approximate Pattern Matching in Two Dimensional Spaces to Grid Layout for Biochemical Network Maps

Background For visualizing large-scale biochemical network maps, it is important to calculate the coordinates of molecular nodes quickly and to enhance the understanding or traceability of them. The grid layout is effective in drawing compact, orderly, balanced network maps with node label spaces, but existing grid layout algorithms often require a high computational cost because they have to consider complicated positional constraints through the entire optimization process. Results We propose a hybrid grid layout algorithm that consists of a non-grid, fast layout (preprocessor) algorithm and an approximate pattern matching algorithm that distributes the resultant preprocessed nodes on square grid points. To demonstrate the feasibility of the hybrid layout algorithm, it is characterized in terms of the calculation time, numbers of edge-edge and node-edge crossings, relative edge lengths, and F-measures. The proposed algorithm achieves outstanding performances compared with other existing grid layouts. Conclusions Use of an approximate pattern matching algorithm quickly redistributes the laid-out nodes by fast, non-grid algorithms on the square grid points, while preserving the topological relationships among the nodes. The proposed algorithm is a novel use of the pattern matching, thereby providing a breakthrough for grid layout. This application program can be freely downloaded from http://www.cadlive.jp/hybridlayout/hybridlayout.html