• Journal of the Korean Society of Safety
• /
• v.11 no.3
• /
• pp.104-111
• /
• 1996

A system was developed that could predict hazardous states for safe operation of chemical plants. This system aimed to prevent hazards of chemical processes from misoperation before real operation. In this study, a data base was organized which consisted of all hazards in the chemical processes. The structure of process was represented by signed direct graph(SDG) of NODEs and ARCs. Each NODE and ARC have property variables ; connected structure and state of processes etc. The hazards that could be occurred in processes were divided into two classes ; one is by operation of unit and the other is by hazardous materials. Using Hazardous States Transition Network, we could recognize transition progress of process states.

• KIISE Transactions on Computing Practices
• /
• v.21 no.11
• /
• pp.681-688
• /
• 2015

The k nearest neighbor (k-NN) graph construction is an important operation with many web-related applications, including collaborative filtering, similarity search, and many others in data mining and machine learning. Despite its many elegant properties, the brute force k-NN graph construction method has a computational complexity of $O(n^2)$, which is prohibitive for large scale data sets. Thus, (Key, Value)-based distributed framework, MapReduce, is gaining increasingly widespread use in Locality Sensitive Hashing which is efficient for high-dimension and sparse data. Based on the two-stage strategy, we engage the locality sensitive hashing technique to divide users into small subsets, and then calculate similarity between pairs in the small subsets using a brute force method on MapReduce. Specifically, generating a candidate group stage is important since brute-force calculation is performed in the following step. However, existing methods do not prevent large candidate groups. In this paper, we proposed an efficient algorithm for approximate k-NN graph construction by regrouping candidate groups. Experimental results show that our approach is more effective than existing methods in terms of graph accuracy and scan rate.

• Proceedings of the KIEE Conference
• /
• 2002.07b
• /
• pp.1012-1014
• /
• 2002

This paper shows that a static redundancy excitation system for thermal power plant. The detailed contents are system explanation and MMI(Man-Machine Interface) integration, operation mimic graph.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.124.4-124
• /
• 2001

It needs a skillful experience to design and implement sequential circuits with a relay circuit or LD (Ladder Diagram). One makes out the operation of relay contacts sequentially in case of analyzing a relay circuit or LD. Still more, the design and analyzing of a complex relay circuit or LD are difficult. In this paper, we propose the EMFG (Extended Mark Graph) representation on relay circuits and LD.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.30 no.3
• /
• pp.82-88
• /
• 2007

Service engineering is a new discipline which aims at basically understanding of service and a concrete methodology using engineering approach for service design. In this paper is introduced the serviset graph [7] which is a comprehensive concept to represent service products, processes, and operation activities. The proposed concept is a degree of commonality index in a service product in order to deal with service mass customization using the input-output analysis in economic model.

• Education of Primary School Mathematics
• /
• v.5 no.2
• /
• pp.111-119
• /
• 2001

Over the years, the benefits of instructional manipulatives in mathematics education have been verified by classroom practice and educational research. The purpose of this paper is to introduce how the instructional material, specifically, geoboard could be used and integrated in elementary mathematics classroom in order to develop student's mathematical concepts and process in terms of the following areas: (1) Number '||'&'||' Operation : counting, fraction '||'&'||' additio $n_traction/multiplication (2) Geometry : geometric concepts (3) Geometry : symmetry '||'&'||' motion (4) Measurement : area '||'&'||' perimeter (5) Probability '||'&'||' Statistics : table '||'&'||' graph (6) Pattern : finding patterns Further, future study will continue to foster how manipulatives will enhance children's mathematics knowledge and influence on their mathematics performance.

• Proceedings of the Korea Database Society Conference
• /
• 1999.06a
• /
• pp.353-359
• /
• 1999

We present a matrix-based inference algorithm suitable for electronic commerce applications. For this purpose, an Extended AND-OR Graph (EAOG) was developed with the intention that fast inference process is enabled within the electronic commerce situations. The proposed EAOG inference mechanism has 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. We have proved the validity of our approach with several propositions and an illustrative EC example.

• Honam Mathematical Journal
• /
• v.32 no.1
• /
• pp.141-155
• /
• 2010

In this paper we prove that with some hypothesis the set of k-isomorphism classes of simple closed k-surfaces in ${\mathbf{Z}}^3$ forms a commutative monoid with an operation derived from a digital connected sum, k ${\in}$ {18,26}. Besides, with some hypothesis the set of k-homotopy equivalence classes of closed k-surfaces in ${\mathbf{Z}}^3$ is also proved to be a commutative monoid with the above operation, k ${\in}$ {18,26}.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 1999.03a
• /
• pp.353-359
• /
• 1999

We present a matrix-based inference alorithm suitable for electronic commerce applications. For this purpose, an Extended AND-OR Graph (EAOG) was developed with the intention that fast inference process is enabled within the electronic commerce situations. The proposed EAOG inference mechanism has 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 matric 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 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. We have proved the validity of our approach with several propositions and an illustrative EC example.

• Korean Journal of Computational Design and Engineering
• /
• v.2 no.1
• /
• pp.19-27
• /
• 1997

This paper presents rough cut tool path planning for the fewer-axis machine consisting of a three-axis CNC machine and a rotary indexing table. In the problem dealt with in this paper, the tool orientation is "intermediately" changed, distinguished from the conventional problem where the tool orientation is assumed to be fixed. The developed rough cut path planning algorithm tries to minimize the number of tool orientation (setup) changes together with tool changes and the machining time for the rough cut by the four procedures: a) decomposition of the machining area based on the possibility of tool interference (via convex hull operation), b) determination of the optimal tool size and orientation (via network graph theory and branch-and bound algorithm), c) generation of tool path for the tool and orientation (based on zig-zag pattern), and d) feedrate adjustment to maintain the cutting force at an operation level (based on average cutting force). The developed algorithms are validated via computer simulations, and can be also used in pure fiveaxis machining environment without modification.