• Nuclear Engineering and Technology
• /
• v.40 no.7
• /
• pp.571-580
• /
• 2008

A Binary Decision Diagram (BDD) is a graph-based data structure that calculates an exact top event probability (TEP). It has been a very difficult task to develop an efficient BDD algorithm that can solve a large problem since it is highly memory consuming. In order to solve a large reliability problem within limited computational resources, many attempts have been made, such as static and dynamic variable ordering schemes, to minimize BDD size. Additional effort was the development of a ZBDD (Zero-suppressed BDD) algorithm to calculate an approximate TEP. The present method is the first successful application of a BDD truncation. The new method is an efficient method to maintain a small BDD size by a BDD truncation during a BDD calculation. The benchmark tests demonstrate the efficiency of the developed method. The TEP rapidly converges to an exact value according to a lowered truncation limit.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.31 no.2
• /
• pp.69-85
• /
• 2006

Transductive Support Vector Machine(TSVM) is one of semi-supervised learning algorithms which exploit the domain structure of the whole data by considering labeled and unlabeled data together. Although it was proposed several years ago, there has been no efficient algorithm which can handle problems with more than hundreds of training examples. In this paper, we propose an efficient branch-and-bound algorithm which can solve large-scale TSVM problems with thousands of training examples. The proposed algorithm uses two bounding techniques: min-cut bound and reduced SVM bound. The min-cut bound is derived from a capacitated graph whose cuts represent a lower bound to the optimal objective function value of the dual problem. The reduced SVM bound is obtained by constructing the SVM problem with only labeled data. Experimental results show that the accuracy rate of TSVM can be significantly improved by learning from the optimal solution of TSVM, rather than an approximated solution.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.259-262
• /
• 2004

In most of the character recognition systems, the method of template matching or statistical method using hidden Markov model is used to extract and recognize feature shapes. In this paper, we used modified chain-code which has 8-directions but 4-codes, and made the chain-code of hand-written character, after that, converted it into transition chain-code by applying to HMM(Hidden Markov Model). The transition chain code by HMM is analyzed as signal flow graph by Mason's theory which is generally used to calculate forward gain at automatic control system. If the specific forward gain and feedback gain is properly set, the forward gain of transition chain-code using Mason's theory can be distinguished depending on each object for recognition. This data of the gain is reorganized as tree structure, hence making it possible to distinguish different hand-written characters. With this method, $91\%$ recognition rate was acquired.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.3
• /
• pp.69-78
• /
• 1998

This paper presented a method of extracting algorithm for Edge Multiple-Valued Decision Diagrams(EMVDD), a new data structure, from Binary Decision Diagram(BDD) which is resently using in constructing the digital logic systems based on the graph theory. We discussed the function minimization method of the n-variables multiple-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. We showed the EMVDD of Full Adder by module construction and verified the proposed algorithm by examples. The proposed method has the visible, schematical and regular properties.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.10
• /
• pp.2693-2706
• /
• 1999

Reengineering to object-oriented system is needed to maintain the system and satisfy requirements of structure change. Target systems which should be reengineered to object-oriented system are difficult to change because these systems have no design document or their design document is inconsistent of source code. Using design document to identifying objects for these systems is improper. There are several researches which identify objects through procedural source code analysis. In this paper, we propose automatic object identification method based on clustering of VTFG(Variable-Type-Function Graph) which represents relations among variables, types, and functions. VTFG includes relations among variables, types, and functions that may be basis of objects, and weights of these relations. By clustering related variables, types, and functions using their weights, our method overcomes limit of existing researches which identify too big objects or objects excluding many functions. The method proposed in this paper minimizes user's interaction through automatic object identification and make it easy to reenginner procedural system to object-oriented system.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.3
• /
• pp.745-755
• /
• 2000

In designing distributed databases, DAP(Data Allocation Problem) is one of the key design issues. Because, however, most of previous researches on DAP have considered only cost aspect, they cannot increase the performance and availability and they are not proper to the system requiring high-availability or real-time processing. Therefore, we need a more formal data allocation model considering multiple aspects. In this paper, we propose the MAPN (Multiple Aspects Petri Net) modeling method for the distributed transaction modeling. The MAPN model, an extended classical petri net, is proposed for the formal modeling considering multiple aspects (cost, performance and availability) concurrently. We demonstrate that we can compose the valid DAP evaluation model considering not only cost but also performance and availability concurrently by using the MAPN structure and MAPN graph.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11c
• /
• pp.1725-1728
• /
• 2003

인터넷의 보급 확산과 정보통신기술 및 웹 기술의 발달로 쇼핑몰 사이트가 등장하게 되었다. 현재 쇼핑몰 사이트는 그 종류가 다양해지고, 규모가 대형화되고 있으며, 매출규모 또한 증가하고 있는 추세이다. 이러한 많은 쇼핑몰 사이트들은 매출경쟁에서 자사의 수익창출을 위해 끈임없이 노력하고 있고 특히, 고객이 편리하게 쇼핑을 할 수 있도록 원활한 페이지 이동을 지원하고 있다. 고객의 쇼핑과정에 영향을 미치는 페이지 이동을 기존의 웹사이트 설계기법인 플로우차트, 스토리보드, 사이트 맵으로 표현하기에는 미흡한 점이 있다. 따라서 본 논문에서는 개념적이고 직관적인 설계가 가능한 EMFG(Extended Mark Flow Graph)[6]를 이용하여 쇼핑몰 사이트에서 웹 페이지간의 이동흐름을 나타내는 링크구조를 표현하고 분석 한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10a
• /
• pp.646-648
• /
• 1999

본 논문에서는 RSA 암호 알고리즘의 핵심 계산 과정인 모듈로 곱셈 연산의 효율적인 하드웨어 구현을 위해 새로운 알고리즘과 하드웨어 구조를 제시한다. 기존의 몽고메리 알고리즘이 LSB 우선 방법을 사용한 것과는 달리 여기서는 MSB 우선 방법을 사용하였으며, RSA 암호 시스템에서 키가 일정 기간 동안 변하지 않고 유지된다는 점에 착안해 계수(Modulus)에 대한 보수(Complements)를 미리 계산해 놓고 이를 이용하여 모듈로 감소 처리를 간단히 덧셈으로 치환하도록 하였다. 보수들을 저장할 몇 개의 레지스터와 그들 중 하나를 선택하기 위한 간단한 멀티플렉서(Multiplexer)만을 추가함으로써 몽고메리 알고리즘이 안고 있는 홀수 계수 조건과 사후 연산이라는 번거로움을 없앨 수 있다. 본 논문에서 제안하는 알고리즘은 하드웨어 복잡도가 몽고메리 알고리즘과 비슷하며 그 내부 계산 구조를 보여주는 DG(Dependence Graph)의 지역 연결성 (Local Connection), 모듈성(Modularity), 데이터의 규칙적 종속성 (Regular Data Dependency)등으로 인한 실시간 고속 처리를 위한 VLSI 구현에 적합하다.

• Korean Journal of Remote Sensing
• /
• v.24 no.3
• /
• pp.245-250
• /
• 2008

According to public and industrial interests on mobile graphics, a preliminary implementation regarding 3D feature visualization system on cell phone was performed using M3G API, one of the de-facto standards for mobile 3D graphic API. Through this experiment, it is revealed that scene graph structure and 3D mobile file format supported from this API is useful one for 3D geo-modeling and rendering in mobile environment. It is necessary that 3D mobile graphic standards can be considered as one component of current mobile GIS services standards to provide value-added 3D GIS contents.

• Journal of the Architectural Institute of Korea Structure & Construction
• /
• v.35 no.10
• /
• pp.191-198
• /
• 2019

In this paper the evaluation scheme for determining torsional irregularity of Hanok has been proposed. The proposed method can evaluate torsional irregularity of Hanok easily only with characteristics of Hanok shapes, arrangement of lateral load resisting frames and their lateral stiffness without time consuming and complicate 3-dimensional structural analysis. The proposed formula is expressed as allowable maximum eccentricity, and torsional irregularity is evaluated by comparing this value with actual eccentricity. The applicability of the proposed scheme was evaluated by applying it to the line shape plan Hanok with two symmetrically arranged walls and the result was expressed by formula and graph. The results showed that the allowable maximum eccentricity is 10% of plan dimension perpendicular to the seismic load when the walls are placed at the extreme end. The proposed formula was expressed as a generalized formula so it can be applied generally to the various plan shape and wall arrangement of Hanok.