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

네트워크를 설계하거나 평가하는데 있어 중요한 문제 중 하나는 그 네트워크를 구성하는 요소들간의 상대적 중요도(importance)에 관한 문제이다. 이런 중요도를 나타내는 여러 가지 측도들 중 하나인 Joint Reliability Importance(JRI)는 Hong & Lie(1993)에 의해 소개되었으며, 네 가지 파생된 서브그래프의 신뢰성을 구하여 JRI를 계산하는 방법이 제시되었다. 본 연구에서는 minimal path set을 이용하여 파생되는 서브 그래프 신뢰성 계산에서의 중복되는 계산과정을 줄임으로써 JRI를 보다 효율적으로 구하는 방법을 제시하고자 한다.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1995년도 춘계공동학술대회논문집; 전남대학교; 28-29 Apr. 1995
• /
• pp.880-885
• /
• 1995

This paper deals with the efficient planning of robot motions in the Cartesian space while avoiding the collision with obstacles. The motion planning problem is to find a path from the specified starting robot configuration that avoids collision with a known set of stationary obstacles. A simple and efficient algorithm was developed using "Backward" approach to solve this problem. The computational result was satisfactory enough to real problems. problems.

• 대한수학회지
• /
• 제33권2호
• /
• pp.319-332
• /
• 1996

Many authors have studied multiple stochastic integrals in pursuit of the existence of product processes in terms of multiple integrals. But there has not been much research into the structure of the product processes themselves. In this direction, a study which gives emphasis on sample path continuity and boundedness properties was initiated in Pyke[9]. For details of problem set-ups and necessary notations, see [9]. Recently the weak limits of U-processes are shown to be chaos processes, which is product of the same Brownian measures, see [2] and [7].

• 한국지능정보시스템학회:학술대회논문집
• /
• 한국지능정보시스템학회 2000년도 춘계정기학술대회 e-Business를 위한 지능형 정보기술 / 한국지능정보시스템학회
• /
• pp.365-373
• /
• 2000

Data Envelopment Analysis (DEA), a non-parametric productivity analysis tool, has become an accepted approach for assessing efficiency in a wide range of fields. Despite of its extensive applications and merits, some features of DEA remain bothersome. DEA offers no guideline about to which direction relatively inefficient DMUs improve since a reference set of an inefficient DMU, several efficient DMUs, hardly provides a stepwise path for improving the efficiency of the inefficient DMU.In this paper, we aim to show that DEA can be used to evaluate the efficiency of life insurance companies while overcoming its limitation with the aids of machine learning methods.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국내학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• pp.926-930
• /
• 1993

An efficient method of formulating the equations of motion of multibody systems is presented. The equations of motion for each body are formulated by using Newton-Eulerian approach in their generic form. And then a transformation matrix which relates the global coordinates and relative coordinates is introduced to rewrite the equations of motion in terms of relative coordinates. When appropriate set of kinematic constraints equations in terms of relative coordinates is provided, the resulting differential and algebraic equations are obtained in a suitable form for computer implementation. The system geometry or topology is effectively described by using the path matrix and reference body operator.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1988년도 한국자동제어학술회의논문집(국내학술편); 한국전력공사연수원, 서울; 21-22 Oct. 1988
• /
• pp.92-97
• /
• 1988

The path planning is done at the joint level. Cubic spline functions are used for constructing joint trajectories for industrial robots. For N-joint robot, Cartesian knots are transformed into N sets of joint displacements, with one set for each joint. For industrial application the speed of operation affects the productivity. An algorithm is developed to schedule the time intervals between each pair of adjacent knots such that the total traveling time is minimized subject to the physical constraints on joint velocties acceleration and jerks.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 추계종합학술대회 논문집
• /
• pp.232-235
• /
• 1999

In this paper, we present a coprocessor that can operate with ARM microprocessors. The coprocessor supports IEEE 754 standard single- and double-precision binary floating point arithmetic operations. The design objective is to achieve minimum-area, low-power and acceleration of processing power of ARM microprocessors. The instruction set is compatible with ARM7500FE. The coprocessor is written in verilog HDL and synthesized by the SYNOPSYS Design Compiler. The gate count is 38,115 and critical path delay is 9.52ns.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 추계종합학술대회 논문집
• /
• pp.943-946
• /
• 1999

In this paper, we present a new clock routing algorithm which minimizes total wirelength under any given path-length skew bound. The algorithm onstructs a bounded-skew tree(BST) in two steps:(ⅰ) a bottom-up phase to construct a binary tree of shortest-distance feasible regions which represent the loci of possible placements of clock entry points, and (ⅱ) a top-down phase to determine the exact locations of clock entry points. Experimental results show that our clock routing algorithm, named BST/DME, can produce a set of solutions with skew and wirelength trade-off.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2008년도 International Symposium on Remote Sensing
• /
• pp.107-110
• /
• 2008

In this study, we propose a system for setting a Destination on CNS(Car Navigation System) or PNS(Personal Navigation System). The present Navigation does set the destination by only static method like name search, address search and wire telegraph telephone number search. But, the kind of setting a static destination does not reflect the dynamic moving situation. So we suggest setting the destination of navigation using Identifier of moving terminal. And it includes privacy protection on personal position information

• ETRI Journal
• /
• 제24권3호
• /
• pp.247-250
• /
• 2002

In this paper, we propose three symbol syn-chronization schemes for Orthogonal Frequency Division Multiplex (OFDM) systems. The cyclic extension preceding OFDM symbols is of decisive importance for these schemes. The first scheme uses the phase-differential coding of the received OFDM signal. The second and the third schemes use the length of the received OFDM signal. All three schemes make symbol synchronization possible, even though there is a frequency off-set in the system. Simulation results show that these schemes can be used to synchronize an OFDM system over AWGN and multi-path fading channels.