• 한국측량학회:학술대회논문집
• /
• 한국측량학회 2006년도 춘계학술발표회 논문집
• /
• pp.501-506
• /
• 2006

With the development of Geospatial Technology (GT), many countries and industries have been expanding their investment in constructing a cyber territory. As the critical components of this cyber territory, three-dimensional models and virtual reality contents based on these models of urban areas in particular have been considered. These models and contents can be intensively used for a city to decide the policies efficiently and to attract the interests of peoples while planning and performing large projects. In this study, we have thus constructed the 3D models and virtual reality contents of the large areas along the CheongGye stream to visualize the environment of these areas before and after the CheongGyeCheon restoration project being completed. Furthermore, we propose efficient methods to construct and visualize these large models, such as tile mapping and multiple LOD application.

• Journal of the Korean Statistical Society
• /
• 제29권3호
• /
• pp.297-306
• /
• 2000

An efficient method of constructing $textsc{k}$-minimal path sets to evaluate the reliability of a flow network is presented. The network is considered to be in a functioning state if it can transmit a maximum flow which is greater than or equal to a specified amount of flow, $textsc{k}$say, and a $textsc{k}$-minimal path set is a minimal set of branches that satisfies the given flow constraint. In this paper, under the assumption that minimal path sets of the network are known, we generate composite paths by adding only a minimal set of branches at each iteration to get $textsc{k}$-minimal path sets after possibly the fewest composition, and compute maximum flow of composite paths using only minimal path sets. Thereby we greatly reduce the possible occurrence of redundant composite paths throughout the process and efficiently compute the maximum flow of composite paths generated. Numerical examples illustrate the method.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1997년도 추계학술대회발표논문집; 홍익대학교, 서울; 1 Nov. 1997
• /
• pp.11-14
• /
• 1997

Flexibility and efficiency in producing a large number of productions in small-to-medium lot sizes are necessary to be competitive. Many firms are concerned about cellular manufacturing system(CMS) to surmount the abrupt change in management environment and to innovate their manufacturing systems. The purpose of this study 1) align BPR with CMS, 2) present the methodology for constructing a CMS and 3) apply to a firm ad verify it. The results of this paper are to present 1) the systematic methodology for constructing CMS at first in our country, 2) the methodology integrating managerial aspects, technological aspects and behavioral aspects, 3) the customer-oriented methodology based on customer value.

• 한국전자통신학회논문지
• /
• 제8권8호
• /
• pp.1149-1154
• /
• 2013

본 논문에서, 성능 좋은 LDPC(Low density parity check) 코드을 위한 태너(Tanner) 그래프를 생성하는 알고리듬을 제안한다. 이 알고리듬은 뎁스 컨스트렌트(depth constraints)를 유지하면서 태너 그래프의 새로운 가지를 생성한다. 이 알고리듬은 그래프의 스토핑 �V(stopping set)을 효과적으로 줄이고, 기존의 다른 알고리듬 보다도 낮은 계산복잡도를 갖는다. 모의시험을 통해서 이 알고리듬의 개선된 성능을 확인 할 수 있었다.

• 한국조명전기설비학회:학술대회논문집
• /
• 한국조명전기설비학회 2009년도 추계학술대회 논문집
• /
• pp.231-234
• /
• 2009

IEC 61850 based substation automation system is operating under digital network with a number of IEDs and a HMI as relation of server and client. In case of IEDs, before implementing the system, all of the system integrators require IEC 61850 certificate from individual IED manufacture. Otherwise, there is nothing to verify IED for constructing substation automation system at the real substation. This paper shows verification strategy of IEC 61850 communication reliability such as association /release, report, dataset and four type control function.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2017년도 춘계학술발표대회
• /
• pp.677-679
• /
• 2017

Data convergecast is an indispensable task for any WSN applications. Typically, scheduling in the WSN consists of two phases: tree construction and scheduling. The optimal tree structure and scheduling for the network is proven NP-hard. This paper focuses on the delay optimality while constructing the data convergecast tree. The algorithm can take any tree as the input, and by performing the switches (i.e. a node changes its parent), the expected aggregation delay is potentially reduced. Note that while constructing the tree, only the in-tree collisions between the child nodes sending data to their common parent is considered.

• 한국통계학회:학술대회논문집
• /
• 한국통계학회 2002년도 추계 학술발표회 논문집
• /
• pp.141-146
• /
• 2002

In this article we consider the problem of constructing confidence intervals for a linear regression model with nested error structure. A popular approach is the likelihood-based method employed by PROC MIXED of SAS. In this paper, we examine the ability of MIXED to produce confidence intervals that maintain the stated confidence coefficient. Our results suggest the intervals for the regression coefficients work well, but the intervals for the variance component associated with the primary level cannot be recommended. Accordingly, we propose alternative methods for constructing confidence intervals on the primary level variance component. Computer simulation is used to compare the proposed methods. A numerical example and SAS code are provided to demonstrate the methods.

• 한국실내디자인학회:학술대회논문집
• /
• 한국실내디자인학회 2006년도 추계학술발표대회 논문집
• /
• pp.125-128
• /
• 2006

In the history of space design, the concept and application of Multi-Layer can be easily found in various projects. As life styles in the contemporary cities are becoming more and more complex and inter-related to each other, the concept of multi-layer is re-considered In terms of constructing differentiated life patterns as well as multi programs within certain physical buildings or designs. This study aims to analyze the brief history of multi-layer in space design and the contemporary applications in recent architectural as well as interior design projects. It is concluded that the concept of multi layer is not only useful for constructing an interesting spatial organizations, but can also be a vital tool for re-organizing the contemporary urban programs that cannot be considered with the preconceived existing terms.

• 한국정보전자통신기술학회논문지
• /
• 제6권4호
• /
• pp.238-242
• /
• 2013

We consider the problem of constructing observers for nonlinear systems with unknown inputs. Connectionist networks, also called neural networks, have been broadly applied to solve many different problems since McCulloch and Pitts had shown mathematically their information processing ability in 1943. In this thesis, we present a genetic neuro-control scheme for nonlinear systems. Our method is different from those using supervised learning algorithms, such as the backpropagation (BP) algorithm, that needs training information in each step. The contributions of this thesis are the new approach to constructing neural network architecture and its training.

• 대한산업공학회지
• /
• 제27권4호
• /
• pp.394-405
• /
• 2001

Since most real-world application data involve continuous-valued attributes, properly addressing the discretization process for constructing a decision tree is an important problem. A continuous-valued attribute is typically discretized during decision tree generation by partitioning its range into two intervals recursively. In this paper, by removing the restriction to the binary discretization, we present a hybrid multi-interval discretization algorithm for discretizing the range of continuous-valued attribute into multiple intervals. On the basis of experiment using semiconductor etching machine, it has been verified that our discretization algorithm constructs a more efficient incremental decision tree compared to previously proposed discretization algorithms.