• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.4
• /
• pp.863-868
• /
• 2013

In recently years, many digital logic systems based on graph theory are analyzed and synthesized. This paper presented a method of constructing the function using edge valued extension graph which is based on graph theory. The graph is applied to a new data structure. from binary graph which is recently used in constructing the digital logic systems based on the graph theory. We discuss the mathematical background of literal and reed-muller expansion, and we discuss the edge valued extension graph which is the key of this paper. Also, we propose the algorithms which is the function derivation based on the proposed edge valued extension graph. That is the function minimization method of the n-variables m-valued functions and showed that the algorithm had the regularity with module by which the same blocks were made concerning about the schematic property of the proposed algorithm.

• Journal of the Korean Data and Information Science Society
• /
• v.25 no.5
• /
• pp.1107-1116
• /
• 2014

In this paper, we review recent developments in network analysis using the graph theory, and introduce ongoing research area with relevant theoretical results. In specific, we introduce basic notations in graph, and conditional and marginal approach in constructing the adjacency matrix. Also, we introduce the Marcenko-Pastur law, the Tracy-Widom law, the white Wishart distribution, and the spiked distribution. Finally, we mention the relationship between degrees and eigenvalues for the detection of hubs in a network.

• Journal of The Korean Association For Science Education
• /
• v.29 no.8
• /
• pp.978-989
• /
• 2009

In this study, we investigated high school students' errors in constructing and interpreting graph on experimental results by students' science achievement level. Two tests regarding constructing and interpreting graph about 'the relationship between the pressure and volume of a gas' were administered to 11th-graders (N=140). Analysis of the results revealed that most students exhibited many errors in the processes of constructing and interpreting graph. In the processes of constructing graph, there were 16 types of errors on the categories of 'misinterpreting the variables', 'mis-marking the graphical elements', and 'misusing the data'. The students of lower achievement level had more errors than those of higher achievement level in the four error types, that is, 'missing the variables', 'representing the best fit line using a broken line', 'adding the data', and 'neglecting the data'. However, the results were reversed in the error type of 'not marking the origin.' In the processes of interpreting graph, there were 9 types of errors on 'misreading the data', 'wrong interpolation and extrapolation', and 'establishing the wrong relationship'. The students of lower achievement level had more errors than those in the higher achievement level in the error types of 'wrong interpolation' and 'misdescribing the relationship between variables'. Educational implications of the findings are discussed.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2536-2542
• /
• 2000

The dominator tree presents the dominance frontier from directed graph to the tree. we present the effective algorithm for constructing the dominator tree from arbitrarY directed graph. The reducible flow graph was reduced to dominator tree after dominator calculation. And the irreducible flow graph was constructed to dominator-join graph using join-edge information of information table. For reducing the dominator tree from dominator-join graph, we present the effective sequency reducible algorithm and delay reducible algorithm.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.959-962
• /
• 2002

This paper presents a method of constructing the universal multiple processing element unit(UMPEU) based on De Bruijn Graph. The proposed method is as following. Firstly we propose transformation operators in order to construct the De Bruijn graph using properties of graph. Secondly we construct the transformation table of De Bruijn graph using above transformation operators. Finally we construct the De Bruijn graph using transformation table. The proposed UMPEU is capable of constructing the De Bruijn geraph for any prime number and integer value of finite fields. Also the UMPEU is applied to fault-tolerant computing system, pipeline class, parallel processing network, switching function and its circuits.

• East Asian mathematical journal
• /
• v.21 no.2
• /
• pp.249-260
• /
• 2005

Experimentation using computer plays an important part in education and research in graph theory. The purpose of this paper is to develop the CAS techniques for the hands-on approach in graph theory specifically on the topic of constructing the spanning tree. This paper discusses the advantages of CAS as the software system for doing graph theory and introduces the software solutions integrating multimedia user interface developed by the author, which extend the functionality of the existing CAS-based graph theory software package.

• Journal of The Korean Association For Science Education
• /
• v.29 no.2
• /
• pp.168-178
• /
• 2009

In this study, we investigated the errors that students committed in the processes of constructing graphs on experimental results by the students' science achievement level. A test of constructing a graph about 'the relationship between the pressure and volume of a gas' was administered to 7th graders (N=145). Results revealed that most students committed errors in the processes of constructing the graph, showing 12 error types in the categories of 'Misinterpreting the variables', 'Mismarking the graphical elements', and 'Misusing the data'. The students in the lower achievement level had more errors than those in the higher achievement level in the two error types, that is 'representing the bar graph' and 'marking the scale in the presented data order', but the results were reversed in the three error types, that is 'marking the independent variable and dependent variable reversely', 'adding the data', and 'neglecting the data'. In the other error types, there were little differences in the frequencies of the errors by students' science achievement level.

• Journal of The Korean Association For Science Education
• /
• v.39 no.5
• /
• pp.655-668
• /
• 2019

In this study, we investigated the middle school students' processes of scientific graph construction from the perspective of the problem solving process. Ten 9th graders participated in this study. They constructed a scientific graph based on pictorial data depicting precipitation reaction. The think-aloud method was used in order to investigate their thinking processes deeply. Their activities were videotaped, and semi-structured interviews were also conducted. The analysis of the results revealed that their processes of scientific graph construction could be classified into four types according to the problem solving strategy and the level of representations utilized. Students using the structural strategy succeeded in constructing scientific graph regardless of the level of representation utilized, by analyzing the data and identifying the trend based on the propositional knowledge about the target concept of the graph. Students of random strategy-higher order representation type were able to succeed in constructing scientific graph by systematically analyzing the characteristics of the data using various representations, and considering the meaning of the graph constructed in terms of the scientific context. On the other hand, students of random strategy-lower order representation type failed to construct correct scientific graph by constructing graph in a way of simply connecting points, and checking the processes of graph construction only without considering the scientific context. On the bases of the results, effective methods for improving students' ability to construct scientific graphs are discussed.

• Journal of IKEEE
• /
• v.3 no.2 s.5
• /
• pp.295-304
• /
• 1999

This paper presents a method of constructing the Multiple-Valued Logic Systems(MVLS) over Finite Fields(FF) using by Decision Diagram(DD) that is based on Graph Theory. The proposed method is as following. First, we derivate the Ordered Multiple-Valued Logic Decision Diagram(OMVLDD) based on the multiple-valued Shannon's expansion theorem and we execute function decomposition using by sub-graph. Next, we propose the variable selecting algorithm and simplification algorithm after apply the each isomorphism and reodering vertex. Also we propose MVLS design method.

• Korean Management Science Review
• /
• v.23 no.3
• /
• pp.63-75
• /
• 2006

There are many kinds of research on web graph, most of them are focus on the hyperlinked structure of the web graph. Well known results on the web graph are rich-get-richer phenomenon, small-world phenomenon, scale-free network, etc. In this paper, we define 3 new directed web graph, so called the Web Usage Pattern Graph (WUPG), that nodes represent web sites arid arcs between nodes represent a movement between two sites by users' browsing behavior. The data to constructing the WUPG, approximately 56,000 records, are gathered from some users' PCs. The results analysing the data summarized as follows : (i) extremely rich-get-richer phenomenon (ii) average path length between sites is significantly less than the previous one (iii) less external hyperlinks, more internal hyperlinks.