• Journal of Korea Water Resources Association
• /
• v.34 no.5
• /
• pp.567-575
• /
• 2001

A methodology is developed for designing the minimum-cost water distribution network. The method is based on network simulations and an optimization scheme using genetic algorithms. Being a stochastic optimization scheme, genetic algorithms have advantages over the conventional search algorithms in solving network problems known for their nonlinearities and herculean computational costs. While existing methods focus on the design of either entirely new or parallel augmentation of network systems, the proposed method can be applied to problems having both new branches of tree-type and paralle augmentation in loops. The applicability of the method was shown through a case study for Baekryeon water supply system. The optimized design resulted in the maximum 5.37% savings compared to the conventional design without optimization, while meeting the hydraulic constraints.

• International Journal of Precision Engineering and Manufacturing
• /
• v.7 no.4
• /
• pp.40-46
• /
• 2006

The market of programmable implantable pumps has bound to a monopolistic situation, inducing high device costs, thus making them inaccessible to most patients. Micro-mechanical and medical innovations allow improved performances by reducing the dimensions. This affects the consumption and weight, and, by reducing the number of parts, the cost is also affected. This paper presents the procedure followed to design an innovative implantable drug delivery system. This drug delivery system consists of a low flow pump which shall be implanted in the human body to relieve pain. In comparison to classical known solutions, this pump presents many advantages of high interest in both medical and mechanical terms. The first section of the article describes the specifications which would characterize a perfect delivery system from every points of view. This concerns shape, medication, flow, autonomy, biocompatibility, security and sterilization ability. Afterwards, an overview of existing systems is proposed in a decisional tree. Positive displacement motorized pumps are classified into three main groups: the continuous movement group, the fractioned translation group and the alternative movement group. These systems are described and the different problems which are specific to these mechanisms are presented. Since none of them fully satisfy the specifications, an innovation is justified.. The decisional tree is therefore extended by adding new principles: fractioned refilling and fractioned injection within the fractioned translation movement group, spider guiding system within the alternative translation movement group, rotational bearing guided device and notch hinge guided device in the alternative rotation movement group.

• Nuclear Engineering and Technology
• /
• v.45 no.5
• /
• pp.653-664
• /
• 2013

The design of computer-based instrumentation and control (I&C) systems is determined by the allocation of I&C functions to I&C systems and components. Due to the characteristics of computer-based technology, component failures can negatively affect several I&C functions, so that the reliability proof of the I&C systems requires the accomplishment of I&C system design analyses throughout the I&C life-cycle. On one hand, this paper proposes the restructuring of the sequential IEC 61513 I&C life-cycle according to the V-model, so as to adequately integrate the concept of verification and validation. On the other hand, based on a metamodel for the modeling of I&C systems, this paper introduces a method for the modeling and analysis of the effects with respect to the superposition of failure combinations and event sequences on the I&C system design, i.e. the temporal change of physical structure is analyzed. In the first step, the method is concerned with the modeling of the I&C systems. In the second step, the method considers the analysis of temporal change of physical structure, which integrates the concepts of the diversity and defense-in-depth analysis, fault tree analysis, event tree analysis, and failure mode and effects analysis.

• Korean Journal of Computational Design and Engineering
• /
• v.7 no.4
• /
• pp.240-247
• /
• 2002

Most commercial CAD systems provide parametric modeling functions, and by using these capabilities designers can edit a CAD model in order to create design variants. It is necessary to transfer parametric information during a CAD model exchange to modify the model inside the receiving system. However, it is not possible to exchange parametric information of CAD models based on the cur-rent version of STEP. The designer intents which are contained in the parametric information can be lost during the STEP transfer of CAD models. This paper introduces a hybrid CAB model translator, which also uses the feature tree of commercial CAD systems in addition to the macro file to allow transfer of parametric information. The macro-parametric approach is to exchange CAD models by using the macro file, which contains the history of user commands. To exchange CAD models using the macro-parametric approach, the modeling commands of several commercial CAD systems are analyzed. Those commands are classified and a set of standard modeling commands has been defined. As a neutral fie format, a set of standard modeling commands has been defined. Mapping relations between the standard modeling commands set and the native modeling commands set of commercial CAD systems are defined. The scope of the current version is limited to parts modeling and assemblies are excluded.

• Journal of Korea Game Society
• /
• v.15 no.4
• /
• pp.59-68
• /
• 2015

The progress in Information & Communication Technology enables data scientists to analyze big data for identifying peoples' daily lives and tacit preferences. A variety of industries already aware the potential usefulness of analyzing big data. However limited use of big data has been performed in game industry. In this research, we adopt data mining technique to analyze data gathered from a strategic simulation game. Decision Tree, Random Forest, Multi-class SVM, and Linear Regression techniques are used to find the most important variables to users' game levels. We provide practical guides for game design and usability based on the analyzed results.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.6
• /
• pp.1542-1552
• /
• 1996

This paper presents a design and implementation of an extended directory system in manage and provide an effective search operation of the DFR(Document Filing and Retrieval) Object's attributes. For this, the design and implementation of a configuration model for interworking between the DFR and directory systems, an association mechanisms between two application's operation, extended directory schema and extended DIT(Directory Information Tree) are described. In a distributed environment, the interworking between the DFR and directory system implemented by using QUIPU 8.0 of ISODE(ISO Development Environment) directory system is tested. based on the result of this paper, an extended model of the directory system is proposed for proving search operation of various application's objects.

• Journal of Korea Game Society
• /
• v.19 no.5
• /
• pp.133-142
• /
• 2019

In this study, 100 types of computationally proposed digital games were analyzed based on the expected marketability. The game classification methodology with five classification criteria proposed by Kim (2017) and the elimination method leveraged by the Decision Tree have been adopted as the methodology of the study. As a result, digital games could be classified into three groups. With the result, designers in the field will be able to leverage computational design methodology to develop a new type of digital game more efficiently by following the proposed hierarchy.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1B
• /
• pp.18-28
• /
• 2004

Efficient hardware implementation of address lookup is one of the most important design issues of internet routers. Address lookup significantly impacts router performance since routers need to process tens-to-hundred millions of packets per second in real time. In this paper, we propose a practical IP address lookup structure based on the binary tree of prefixes of different lengths. The proposed structure produces multiple balanced trees, and hence it solve the issues due to the unbalanced binary prefix tree of the existing scheme. The proposed structure is implemented using pipelined binary search combined with a small size TCAM. Performance evaluation results show that the proposed architecture requires a 2000-entry TCAM and total 245 kbyte SRAMs to store about 30,000 prefix samples from MAE-WEST router, and an address lookup is achieved by a single memory access. The proposed scheme scales very well with both of large databases and longer addresses as in IPv6.

• Journal of Korea Spatial Information System Society
• /
• v.7 no.1 s.13
• /
• pp.77-89
• /
• 2005

Recently, application area on the Location Based System(LBS) is increasing because of development of mobile-communication and GPS technique. Previous studies on the index of moving objects are classified as either index for past trajectories or current/future positions. It is necessary to develop a unified index because many applications need to process queries about both past trajectories and current/future positions at the same time. In this paper, the past trajectories of moving objects are represented as line segments and the current and future positions are represented as the function of time. We propose a new index called PCR-tree(Past, Current R-tree) for unification of past, current and future positions. Nodes of the index have bounding boxes that enclose all position data and entries in the nodes are accessed with only one interface. We implement the proposed index and show a feasibility of processing the queries about temporal-spatial domain with the query tool which we develop.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.6
• /
• pp.827-836
• /
• 2001

Data is represented by file structure in Computer System. But the file size is to be larger, it is hard to control and transmit. Therefore, in recent years, many researchers have developed new algorithms for the data compression. And now, we introduce a new Dynamic Compression Technique, making up for the weaknesses of huffman's. The huffman compression technique has two weaknesses. The first, it needs two steps of reading, one for acquiring character frequency and the other for real compression. The second, low compression rate caused by storing tree information. These weaknesses can be solved by our new Dynamic Relocatable Method, reducing the reading pass by relocating data file to dynamic form, and then storing tree information from pipeline structure. The first, it needs two steps of reading, one for acquiring character frequency and the other for real compression. The second, low compression rate caused by storing tree information. These weaknesses can be solved by our new Dynamic Relocatable Method, reducing the reading pass by relocating data file to dynamic form, and then storing tree information from pipeline structure.