• School Mathematics
• /
• v.18 no.1
• /
• pp.127-141
• /
• 2016

This study analyzes modes related to use of graph representation that appears to solve high school students quadratic function problem based on the graph using modes of Chauvat. It was examined the extent of understanding of the quadratic function of students through the flexibility of the representation of the Bannister (2014) from the analysis. As a result, the graph representation mode in which a high school students are mainly used is a nomographic specific mode, when using operational mode, it was found to be an error. The flexibility of Bannister(2014) that were classified to the use of representation from the point of view of the object and the process in the understanding of the function was constrained operation does not occur between the two representations in understanding the function in the process of perspective. Based on these results, the teaching on use graph representation for the students in classroom is required and the study of teaching and learning methods can understand the function from various perspectives is needed.

• KIISE Transactions on Computing Practices
• /
• v.21 no.4
• /
• pp.327-332
• /
• 2015

Constructing a k-nearest neighbor (k-NN) graph is a primitive operation in the field of recommender systems, information retrieval, data mining and machine learning. Although there have been many algorithms proposed for constructing a k-NN graph, either the existing approaches cannot be used for various types of similarity measures, or the performance of the approaches is decreased as the number of nodes or dimensions increases. In this paper, we present a novel algorithm for k-NN graph construction based on "balanced" canopy clustering. The experimental results show that irrespective of the number of nodes or dimensions, our algorithm is at least five times faster than the brute-force approach while retaining an accuracy of approximately 92%.

• Kyungpook Mathematical Journal
• /
• v.62 no.3
• /
• pp.437-453
• /
• 2022

Unlike for polynomial rings, the notion of multiplication for the near-ring of polynomials is the substitution operation. This leads to somewhat surprising results. Let S be an abelian left near-ring with identity. The relation ~ on S defined by letting a ~ b if and only if ann_S(a) = ann_S(b), is an equivalence relation. The compressed zero-divisor graph 𝚪_E(S) of S is the undirected graph whose vertices are the equivalence classes induced by ~ on S other than [0]_S and [1]_S, in which two distinct vertices [a]_S and [b]_S are adjacent if and only if ab = 0 or ba = 0. In this paper, we are interested in studying the compressed zero-divisor graphs of the zero-symmetric near-ring of polynomials R₀[x] and the near-ring of the power series R₀[[x]] over a commutative ring R. Also, we give a complete characterization of the diameter of these two graphs. It is natural to try to find the relationship between diam(𝚪_E(R₀[x])) and diam(𝚪_E(R₀[[x]])). As a corollary, it is shown that for a reduced ring R, diam(𝚪_E(R)) ≤ diam(𝚪_E(R₀[x])) ≤ diam(𝚪_E(R₀[[x]])).

• Journal of KIISE:Software and Applications
• /
• v.28 no.12
• /
• pp.910-920
• /
• 2001

We developed a SIFC(Slice-based Information Flow Graph) For modeling the information flow on program on the basis of the information flow of a data tokens on program slices. Then we defined a SCM(Slice-based Complexity Measure) for measuring the program complexity by measuring the complexity of information flow on SIFG, We showed that, according to Zuse's approach, it assumed ordinal scale based on atomic modifications on SIFG and that it was additive to binary operation MBSEQ and that it was not additive to binary operation MBALT but satisfied Weyuker's 9th axiom. Also based on comparison with the existing measures, we showed that SCM could measure not only the control and data flow in program but also the physical size of program.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.23 no.12
• /
• pp.224-232
• /
• 2009

Power plant start-up is a complicate process involving hundreds of operations that should be performed either automatically or manually. Several major operations should be proceeded in parallel and each major operation is again broken down into detailed operations that must be carried out in a strict sequence. Even though most of the operations are automated, still substantial portions of the operations are carried out manually and the operational status should be monitored by the crew members, which are quite stressful tasks to be performed in real time. In this paper, a data structure called an Event Sequence Monitoring Graph(ESMG) is proposed for monitoring a sequence of events involved in the power plant start-up process. The ESMG is currently being applied to a thermal power plant with a rated output of 500MW. An application example is shown with the boiler feed water pump system start-up process, which exhibits a good potential for future applications.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.1
• /
• pp.71-81
• /
• 2010

In a typical web environment, it is difficult to determine the update and re-computation status of WebView content or the transition of WebView processing included in web page. If an update to one of data is performed before a read operation to that, we could get a wrong result due to the incorrect operation and increase a complexity of the problem to process. To solve this problem, lots of researchers have studied and most of these problems at the single user environment is not problems. However, the problems at a distributed environment might be occurred. For this reason, in this paper, we proposed the extended state transition graph and algorithms for each status of WebView for explaining WebView state in the distributed environment and analyze the performance of using the materialized WebView and not. Additionally, also analyze the timing issues in network and effectiveness which follows in size of WebView contents.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 1999.10a
• /
• pp.121-130
• /
• 1999

The objective of this paper is to apply Extended AND-OR Graph (EAOG)-related techniques to extract knowledge from a specific problem-domain and perform analysis in complicated decision making area. Expert systems use expertise about a specific domain as their primary source of solving problems belonging to that domain. However, such expertise is complicated as well as uncertain, because most knowledge is expressed in causal relationships between concepts or variables. Therefore, if expert systems can be used effectively to provide more intelligent support for decision making in complicated specific problems, it should be equipped with real-time inference mechanism. We develop two kinds of EAOG-driven inference mechanisms(1) EAOG-based forward chaining and (2) EAOG-based backward chaining. and The EAOG method processes the following three characteristics. 1. Real-time inference : The EAOG inference mechanism is suitable for the real-time inference because its computational mechanism is based on matrix computation. 2. Matrix operation : All the subjective knowledge is delineated in a matrix form, so that inference process can proceed based on the matrix operation which is computationally efficient. 3. Bi-directional inference : Traditional inference method of expert systems is based on either forward chaining or backward chaining which is mutually exclusive in terms of logical process and computational efficiency. However, the proposed EAOG inference mechanism is generically bi-directional without loss of both speed and efficiency.

• Asia pacific journal of information systems
• /
• v.11 no.1
• /
• pp.1-24
• /
• 2001

This paper is aimed at proposing a new inference mechanism for B-to-B electronic commerce decision-makings, named IMITAO(Integer Matrix-driven Inference based on Transformed And-Or graph) which is based on integer matrix operation to speed up the inference. During the B-to-B electronic commerce, many kinds of negotiations are needed for mutually satisfactory decision-makings. During such negotiations, several factors including subjective and objective constraints should be considered so as to reach satisfactory decisions. In this respect, we suggest first a Transformed AND-OR Graph(TAOG) which each firm's conditions or judgement are incorporated into, and then we propose a high-speedy inference mechanism named IMITAO which basically depends on TAOG. Firms engaged in B-to-B negotiations on the Internet can get an appropriate decision support from using IMITAO for their negotiation simulations. The proposed IMITAO inference mechanism is characterized by its fast inference because its main inference procedures are based on integer matrix operation. A real-world example for B-to-B negotiations was used to prove the validity of our proposed TAOG and IMITAO approach. Experimental results showed that our approach was very useful in performing the B-to-B electronic commerce decision-makings considering a wide variety of either subjective or objective constraints.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1999.05a
• /
• pp.179-184
• /
• 1999

A Timing Diagram is almost used to represent the various signals such as an address bus, a data bus, and the control signals during design and analysis of a digital system. But if so, its representation is somewhat complicated and also it is difficult to analyze the operation of the system. In this paper, we proposed the representation method of timing diagrams with the EMFG(Extended Mark Flow Graph). In the EMFG representation of the system operation, the logical states due to the various signals of the system is graphically represented. Therefore the proposal method allows that it is easy to design as well as analyze the system. As examples applied, we represented the memory read cycle of $\mu$PD70320 CPU and the read cycle of MCM60256A memory with the EMFG.

• Journal of the Institute of Convergence Signal Processing
• /
• v.6 no.1
• /
• pp.39-44
• /
• 2005

Scheduling for digital system synthesis is assigning each operation in a control/data flow graph(CDFG) to a specific control step without violating precedence relation. It is one of the most important tasks due to its direct influence on the performance of the hardware synthesized. In this paper, we propose a resource-constrained scheduling algorithm. Our algorithm first analyzes the given CDFG to determine the number of functional units of each type, then assigns each operation to a control step while satisfying the constraints. It also tries to improve the solution iteratively by adjusting the number of functional units using the results collected from the previous scheduling. Experiments were performed to test the performance of the proposed algorithm, and results are presented