• Journal of Korea Multimedia Society
• /
• v.22 no.4
• /
• pp.502-514
• /
• 2019

Existing user research methods are subject to a variety of research conditions such as the amount and variety of data collected and the expertise of the facilitator of a group research session. In this study, we propose a new user research methodology using an 'Issue-Network' system, which is developed based on the theory and methods of social network analysis. The Issue-Network is designed to define problem spaces from the issues raised by users in a group research session in a form of an interactive network graph. The system helps to break out of ordinary perspectives of looking into problem spaces by enabling an alternative and more creative way to connect issues in the network. In this study, we took a case study of generating the Issue-Network on behalf of the problems raised by users in various driving-related situations. We were able to draw three navigation usage scenarios that cover relatively important problem spaces: safety and being ready for the unexpected, smart navigation and notifications, making use of the spare time. In the future, the Issue-Network system is expected to be used as a tool to identify problems and derive solutions in group research sessions involving a large number of users.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.7
• /
• pp.411-421
• /
• 2002

In this Paper we propose a new Image analysis algorithm for microarray processing and a method to locate the position of the grid cell using the topology of the grid spots. Microarray is a device which enables a parallel experiment of 10 to 100 thousands of test genes in order to measure the gene expression. Because of the huge data obtained by a experiment automated image analysis is needed. The final output of this microarray experiment is a set of 16-bit gray level image files which consist of grid-structured spots. In this paper we propose one algorithm which located the address of spots (spot indices) using graph structure from image data and a method which determines the precise location and shape of each spot by measuring the inclination of grid structure. Several experiments are given from real data sets.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.3_4
• /
• pp.152-159
• /
• 2004

The Grid system is an emerging computing infrastructure that will substitute for existing distributed systems. However end users have a difficulty in using the Grid because of its complicated usage, which is an inherent characteristic from the heterogeneous mechanism of the Grid. In this paper, we present the JCML(Job Control Markup Language) and its GUI-based editor, which not only provide users with ease of use, improved working environment, but assist users to execute their jobs efficiently The JCML is a job control language that improves the RSL of Globus, which defines global services in Grid. The JCML is designed to support flexibility among various Grid services using standard XML. And it makes use of a graph representation method, GXL(Graph eXchange Language), to specify detailed job properties and dependencies among jobs using nodes and edges. The JCML editor provides users with GUI-based interface. With the JCML editor, a complicated job order can be easily completed using very simple manipulations with a mouse, such as a drag-and-drop.

• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• pp.438-441
• /
• 2007

Recently, due to molecular biology and engineering technology, DNA microarray makes people watch thousands of genes and the state of variation from the tissue samples of living body. With DNA Microarray, it is possible to construct a genetic group that has similar expression patterns and grasp the progress and variation of gene. This paper practices Cluster Analysis which purposes the discovery of biological subgroup or class by using gene expression information. Hence, the purpose of this paper is to predict a new class which is unknown, open leukaemia data are used for the experiment, and MCL (Markov CLustering) algorithm is applied as an analysis method. The MCL algorithm is based on probability and graph flow theory. MCL simulates random walks on a graph using Markov matrices to determine the transition probabilities among nodes of the graph. If you look at closely to the method, first, MCL algorithm should be applied after getting the distance by using Euclidean distance, then inflation and diagonal factors which are tuning modulus should be tuned, and finally the threshold using the average of each column should be gotten to distinguish one class from another class. Our method has improved the accuracy through using the threshold, namely the average of each column. Our experimental result shows about 70% of accuracy in average compared to the class that is known before. Also, for the comparison evaluation to other algorithm, the proposed method compared to and analyzed SOM (Self-Organizing Map) clustering algorithm which is divided into neural network and hierarchical clustering. The method shows the better result when compared to hierarchical clustering. In further study, it should be studied whether there will be a similar result when the parameter of inflation gotten from our experiment is applied to other gene expression data. We are also trying to make a systematic method to improve the accuracy by regulating the factors mentioned above.

• Journal of the Korean School Mathematics Society
• /
• v.8 no.4
• /
• pp.481-494
• /
• 2005

In this study, the goal is to spread profound knowledge and theory through providing with accumulated methods in mathematics education to the students who are relatively neglected in educational benefits. The process is divided into 3 categories: mathematics for obtaining common sense and intelligence, practical math for application, and math as a liberal art to elevate their characters. Furthermore, it includes the reasons for studying math, improving problem-solving skills, machinery application learning, introduction to code(cipher) theory and game theory, utilizing GSP to geometry learning, and mathematical relations to sports and art. Based on these materials, the next step(goal) is to train graduate students to conduct researches in teaching according to the teaching plan, as well as developing interesting and effective teaching plan for the remote high school learners.

• Journal of the Korean Society for information Management
• /
• v.2 no.2
• /
• pp.3-37
• /
• 1985

This research deals with the problems encountered in designing systems for more efficient and effective information retrieval used in the proliferation of literature. This research was designed to develop and test 1) the partitioning a large bibliographic data base into quality oriented subsets (quality filtering), and 2) a system for effective and efficient information retrieval within subsets of data base (relevance). In order to accomplish this partitioning, the 'kernel' technique of graph theory was applied. In addition, a method of quality filtering utilizing the 'epidemic' theory and the 'obsolescence' of scientific literature was developed.

• Journal of the Korean Society for information Management
• /
• v.3 no.1
• /
• pp.3-16
• /
• 1986

This research deals with the problems encountered in designing systems for more efficient and effective information retrieval used in the proliferation of literature. This research was designed to develop and test 1) the partitioning a large bibliographic data base into quality oriented subsets (quality filtering), and 2) a system for effective and efficient Information retrieval within subsets of data base (relevance). In order to accomplish this partitioning, the 'kernel' technique of graph theory was applied. In addition, a method of quality filtering utilizing the 'epidemic' theory and the 'obsolescence' of scientific literature was developed.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.5_6
• /
• pp.195-201
• /
• 2007

A minimum terminal path decomposition of a tree is defined as a partition of the tree into edge-disjoint terminal-to-terminal paths that minimizes the weight of the longest path. In this paper, we present an $O({\mid}V{\mid}^2$time algorithm to find a minimum terminal path decomposition of trees. The algorithm reduces the given optimization problem to the binary search using the corresponding decision problem, the problem to decide whether the cost of a minimum terminal path decomposition is at most l. This decision problem is solved by dynamic programing in a single traversal of the tree.

• International Journal of Highway Engineering
• /
• v.15 no.3
• /
• pp.103-115
• /
• 2013

PURPOSES: The purpose of this study is to develop a method for distribution between superelevation and side friction factor by increasing design speed. METHODS: First of all, a method for distribution between superelevation and side friction factor and a theory for the functional formula of side friction factor in compliance with horizontal radius applied in South Korea and the United States are considered. Especially, design speed of 140km/h and numerical value of design elements are applied to the theory for the functional formula of side friction factor in AASHTO's methods. Also, the anxiety EEG upon running speed is measured to reflect ergonomic characteristics through field experiments at seven curve sections of the West Coast Freeway, and this data is applied to graph for the functional formula of side friction factor. RESULTS : Matching side friction factor against the anxiety EEG, the results that a critical points of driver's anxiety EEG sharply increase locate under existing parabola are figured out. CONCLUSIONS : Therefore, we could get a new type of the functional formula that driver's driving comfortability is guaranteed if the existing the functional formula of side friction factor goes down under boundary of the critical points of the anxiety EEG.

• Journal for History of Mathematics
• /
• v.20 no.4
• /
• pp.61-70
• /
• 2007

Combinatorics, often called the 21 st century mathematics, has turned out a very important subject for the present information era. Modern combinatorics has started from some mathematical works, for example, Pascal's triangle and the binomial coefficients, and Euler's problems on the partitions of integers and Konigsberg's bridge problem, and so on. In this paper, we investigate the origin of combinatorics by looking over some interesting ancient combinatorial problems and some important problems which have started various subfields of combinatorics. We also discuss a little on the role of combinatorics in mathematics and mathematics education.