• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2001.01a
• /
• pp.496-507
• /
• 2001

An expert system for the diagnosis and indication of hypertension is implemented through HTML-based backward inference. HTML-based backward inference is performed using the hypertext function of HTML, and many HTML files, which are hyperlinked to each other based on the backward rules, should be prepared beforehand. The development and maintenance of the HTML files are conducted automatically using the decision graph. Still, the drawing and input of the decision graph is a time consuming and tedious job if it is done manually. So, automatic generator of the decision graph for the diagnosis and indication of hypertension was implemented. The HTML-based backward inference ensures accessibility, multimedia facilities, fast response, stability, easiness, and platform independency of the expert system. So, this research reveals that HTML-based inference approach can be used for many Web-based intelligent site with fast and stable performance.

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

The objective of this paper is to propose a brand new interface mechanism to provide more intelligent decision making support for EC problems. Its main virtue is based on a numerical process mechanism by using an Extended AND-OR Graph (EAOG)-based logic algebra. Using this mechanism, decision makers engaged in electronic commerce (EC) can effectively deal with complicated decision making problems. In the field of traditional expert systems research, AND-OR Graph approach has been suggested as a useful tool for representing the logic flowchart of the forward and/or backward chaining inference methods. However, the AND-OR Graph approach cannot be effectively used in the EC problems in which real-time problem-solving property should be highly required. In this sense, we propose the EAOG inference mechanism for EC problem-solving in which heurisric knowledge necessary for intelligent EC problem-solving can be represented in a form of matrix. Finally, we have proved the validity of our approach with several propositions and an illustrative EC example

• 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.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1989.10a
• /
• pp.77-85
• /
• 1989

The purpose of this research entails the study of the multicriteria graph-theoretic Facility Layout Problem(FLP), the development of a Decision Support System(DSS), and a sensitivity analysis for graph Theoretic heuristics. The graph theoretic FLP Decision Support System gives decision makers or planners more information as a guide in producing their final layouts. This information is provided by a variety of final result scores, so called upper bound values, based on different options and different criteria. The increased information provided will give decision makers more confidence in design a block plan. One case is presented to demonstrate the applicability of the system to real-world problem. Finally, applicabilities of the DSS to other format layouts, such as GT layout and JIT's U-line, are briefly mentioned.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.10
• /
• pp.4007-4024
• /
• 2020

It is tremendously important to construct decision trees to use as a tool for knowledge representation from a given decision table. However, the usual algorithms may split the decision table based on each value, which is not efficient for numerical attributes. The methodology of this paper is to split the given decision table into binary groups as like the CART algorithm, that uses binary split to work for both categorical and numerical attributes. The difference is that it uses split for each attribute established by the directed acyclic graph in a dynamic programming fashion whereas, the CART uses binary split among all considered attributes in a greedy fashion. The aim of this paper is to study the effect of binary splits in comparison with each value splits when building the decision trees. Such effect can be studied by comparing the number of nodes, local and global misclassification rate among the constructed decision trees based on three proposed algorithms.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.5
• /
• pp.1-12
• /
• 1999

A new algorithm of constructing binary decision diagram(BDD) for design verification of switch-level circuits is proposed in this paper. In the switch-level circuit, functions are characterized by serial and parallel connections of switches and the final logic values may have high-impedance and unstable states in addition to the logic values of 0 and 1. We extend the BDD to represent functions of switch-level circuits as acyclic graphs so called switch-level binary decision diagram (SLBDD). The function representation of the graph is in the worst case, exponential to the number of inputs. Thus, the ordering of decision variables plays a major role in graph sizes. Under the existence of pass-transistors and domino-logic of precharging circuitry, we also propose an input ordering algorithm for the efficiency in graph sizes. We conducted several experiments on various benchmark circuits and the results show that our algorithm is efficient enough to apply to functional simulation, power estimation, and fault-simulation of switch-level design.

• Journal of information and communication convergence engineering
• /
• v.9 no.3
• /
• pp.276-281
• /
• 2011

This paper presents a method of constructing the switching function using edge-valued decision diagrams. The proposed method is as following. The edge-valued decision diagram is a new data structure type of decision diagram which is recently used in constructing the digital logic systems based on the graph theory. Next, we apply edge-valued decision diagram to function minimization of digital logic systems. The proposed method has the visible, schematic and regular properties.

• ETRI Journal
• /
• v.29 no.4
• /
• pp.507-515
• /
• 2007

Skeleton transform of which the medial axis transform is the most popular has been proposed as a useful shape abstraction tool for the representation and modeling of human posture. This paper explains this proposition with a description of the areas in which skeletons could serve to enable the representation of shapes. We present algorithms for two-dimensional posture modeling using the developed simplified shock graph (SSG). The efficacy of SSG extracted feature vectors as shape descriptors are also evaluated using three different classifiers, namely, decision tree, multilayer perceptron, and support vector machine. The paper concludes with a discussion of the issues involved in using shock graphs to model and classify human postures.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.213-217
• /
• 2004

This paper presents a method of constructing the digital logic systems(DLS) using edge-valued decision diagrams(EVDD). The proposed method is as following. The EVDD is a new data structure type of decision diagram(DD) that is recently used in constructing the digital logic systems based on the graph theory. Next, we apply EVDD to function minimization of digital logic systems. The proposed method has the visible, schematical and regular properties.

• Journal of applied mathematics & informatics
• /
• v.42 no.1
• /
• pp.123-137
• /
• 2024

In this paper, Power fuzzy graphs is newly introduced by allotting fuzzy values on power graphs in such a way that the newly added edges, has the edge membership values between a closed interval which depends on vertex membership values and the length of the added edges. Power fuzzy subgraphs and total power fuzzy graphs are newly defined with properties and some special cases. It is observed that every power fuzzy graph is a fuzzy graph but the converse need not be true. Edges that are incident to vertices with the least vertex membership values are retained in the least power fuzzy subgraph. Further, the application of these concepts in real life time has been presented and discussed using power fuzzy graph model.