• International conference on construction engineering and project management
• /
• 2005.10a
• /
• pp.1036-1041
• /
• 2005

Treemaps, a space filling visualization technique, displays a massive data set of hierarchical data interactively on a single computer screen by mapping it to a matrix of rectangles. It allows users to visually inspect and manipulate data to find new relationships or discrepancies that are to difficult to find using traditional techniques. This paper applies treemaps to the evaluation of highway project bids, which contain hundreds or thousands of elements arranged in a hierarchical structure. Through a case study, treemaps are shown to be a potentially effective tool for bid evaluation by both contractors and State or Federal highway officials.

• The KIPS Transactions:PartD
• /
• v.15D no.4
• /
• pp.541-548
• /
• 2008

Today, GIS service requires not only a simple map visualization but also geographical information of each object. However, POI service provides simply geographical naming service only because of lacking in geographical information of objects. In addition, geographical space data representation functioning that is the basis for most GIS has not been standardized yet. In this paper, it is designed that POI DB that is hierarchical and user-oriented and it is constructed that GVP(GML Viewer POI) that is the basis of GML specification to overcome difference and incompatibility of map visualization. GVP adds POI DB in a 3-Layer structure to dBase file managing the information of SHP file attributes. Therefore, POI visualization enables hierarchical search, by providing POI information in directory-type grouping. Consisting of map visualization and POI visualization, GVP regenerates attributes in the form of individual objects and responds to user events immediately.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.2
• /
• pp.289-305
• /
• 2011

To efficiently analyze complex and voluminous data, OLAP systems increasingly provide functionalities for visual exploration of the data allowing end-users to navigate the desired view of the data cube. This paper only deals with data cubes whose schemas represented like the exclusive symmetric hierarchy which is not addressed by current OLAP implementations. This paper presents a conceptual classification of abstraction hierarchies, and an approach to navigating data cubes with a hierarchical visualization technique. The hierarchical visualization technique is developed by using the transitive closure of a binary relation. The approach is exemplified using a real-world study from the domain of national license administration.

• The KIPS Transactions:PartA
• /
• v.16A no.3
• /
• pp.143-152
• /
• 2009

One of the main issues in comparative genomics is to study chromosomal gene order in one or more related species. For this purpose, the whole genome alignment is usually applied to find the horizontal gene transfer, gene duplication, and gene loss between two related genomes. Also it is well known that the novel visualization tool with whole genome alignment is greatly useful for us to understand genome organization and evolution process. There are a lot of algorithms and visualization tools already proposed to find the "gene clusters" on genome alignments. But due to the huge size of whole genome, the previous visualization tools are not convenient to discover the relationship between two genomes. In this paper, we propose AlignScope, a novel visualization system for whole genome alignment, especially useful to find gene clusters between two aligned genomes. This AlignScope not only provides the simplified structure of genome alignment at any simplified level, but also helps us to find gene clusters. In experiment, we show the performance of AlignScope with several microbial genomes such as B. subtilis, B.halodurans, E. coli K12, and M. tuberculosis H37Rv, which have more than 5000 alignment pairs (matched DNA subsequence).

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.6
• /
• pp.1087-1101
• /
• 2020

Various security devices are used to protect internal networks and valuable information from rapidly evolving cyber attacks. Firewall, which is the most commonly used security device, tries to prevent malicious attacks based on a text-based filtering rule (i.e., access control policy), by allowing or blocking access to communicate between inside and outside environments. However, in order to protect a valuable internal network from large networks, it has no choice but to increase the number of access control policy. Moreover, the text-based policy requires time-consuming and labor cost to analyze various types of vulnerabilities in firewall. To solve these problems, this paper proposes a 3D-based hierarchical visualization method, for intuitive analysis and management of access control policy. In particular, by providing a drill-down user interface through hierarchical architecture, Can support the access policy analysis for not only comprehensive understanding of large-scale networks, but also sophisticated investigation of anomalies. Finally, we implement the proposed system architecture's to verify the practicality and validity of the hierarchical visualization methodology, and then attempt to identify the applicability of firewall data analysis in the real-world network environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.7
• /
• pp.501-511
• /
• 2013

Recently, the visualization method of social network service have been only focusing on presentation of visualizing network data, which the methods do not consider an efficient processing speed and computational complexity for increasing at the ratio of arithmetical of a big data regarding social networks. This paper proposes a cloud based on visualization method to visualize a user focused hierarchy relationship between user's nodes on social network. The proposed method can intuitionally understand the user's social relationship since the method uses fuzzy to represent a hierarchical relationship of user nodes of social network. It also can easily identify a key role relationship of users on social network. In addition, the method uses hadoop and hive based on cloud for distributed parallel processing of visualization algorithm, which it can expedite the big data of social network.

• Journal of Engineering Education Research
• /
• v.10 no.3
• /
• pp.109-124
• /
• 2007

With the advance of the Internet and computing technologies, e-learning is now a hot issue worldwide for providing the effective learning on the cyber-space. However, most of existing e-learning contents have been developed mainly based on text, including simple multimedia elements such as images, animations, and voices. This paper suggests a method effective for the computer programming e-learning. The method is based on program visualization using flowcharts. It features the stepwise hierarchical program visualization on the level of statements, the flowchart based visualization for control constructs of languages, visualization over whole programs, visualization compared with source codes, and interaction with users. Finally, we implement a system to realize the suggested method, and execute it for an example program.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.5_6
• /
• pp.360-370
• /
• 2004

Adaptive mesh refinement(AMR) is one of the popular computational simulation techniques used in various scientific and engineering fields. Although AMR data is organized in a hierarchical multi-resolution data structure, traditional volume visualization algorithms such as ray-casting and splatting cannot handle the form without converting it to a sophisticated data structure. In this paper, we present a hierarchical multi-resolution splatting technique using k-d trees and octrees for AMR data that is suitable for implementation on the latest consumer PC graphics hardware. We describe a graphical user interface to set transfer function and viewing / rendering parameters interactively. Experimental results obtained on a general purpose PC equipped with an nVIDIA GeForce3 card are presented to demonstrate that the proposed techniques can interactively render AMR data(over 20 frames per second). Our scheme can easily be applied to parallel rendering of time-varying AMR data.

• Genomics & Informatics
• /
• v.10 no.4
• /
• pp.263-265
• /
• 2012

We developed a user-friendly, interactive program to simultaneously cluster and visualize omics data, such as DNA and protein array profiles. This program provides diverse algorithms for the hierarchical clustering of two-dimensional data. The clustering results can be interactively visualized and optimized on a heatmap. The present tool does not require any prior knowledge of scripting languages to carry out the data clustering and visualization. Furthermore, the heatmaps allow the selective display of data points satisfying user-defined criteria. For example, a clustered heatmap of experimental values can be differentially visualized based on statistical values, such as p-values. Including diverse menu-based display options, QCanvas provides a convenient graphical user interface for pattern analysis and visualization with high-quality graphics.

• Journal of Digital Convergence
• /
• v.11 no.7
• /
• pp.185-192
• /
• 2013

The purpose of this study is to set the relationship between each parts that forms the engine of an automobile based on the 3D visualization technology which is able to be learned according to the skill of the operator in the industry field and to recommend the auto parts using a task ontology. A visualization method was proposed by structuring the complex knowledge by signifying the link and the node in forms of a network and using SOM which can be shown in the form of 3 dimension. In addition, by using is-a Relationship-based hierarchical Taxonomy setting the relationship between each of the parts that forms the engine of an automobile, to allow a recommendation using a weighted value possible. By providing and placing the complex knowledge in the 3D space to the user for an opportunity of more realistic and intuitive navigation, when randomly selecting the automobile parts, it allows the recommendation of the parts having a close relationship with the corresponding parts for easy assembly and to know the importance of usage for the automobile parts without any special expertise.