• 정보과학회지
• /
• 제1권1호
• /
• pp.72-74
• /
• 1983

Traditionally, polynomials have been used to approximte functions with prescribed values at a number of points(called the knots) on a given interal on the real line. The method of splines recently developed is more flexible. It approximates a function in a piece-wise fashion, by means of a different polynomial in each subinterval. The cubic spline gas ets origins in beam theory. It possessed continuous first and second deriatives at the knots and is characterised by a minimum curvature property which es rdlated to the physical feature of minimum potential energy of the supported beam. Translated into mathematical terms, this means that between successive knots the approximation yields a third-order polynomial sith its first derivatives continuous at the knots. The minimum curvature property holds good for each subinterval as well as for the whole region of approximation This means that the integral of the square of the second derivative over the entire interval, and also over each subinterval, es to be minimized. Thus, the task of determining the spline lffers itself as a textbook problem in discrete computer programming, since the integral of ghe square of the second derivative can be obviously recognized as the criterion function whicg gas to be minimized. Starting with the initial value of the function and assuming an initial solpe of the curve, the minimum norm property of the curvature makes sequential decision of the slope at successive knots (points) feasible. It is the aim of this paper to derive the cubic spline by the methods of computer programming and show that the results which is computed the all the alues in each subinterval of the spline approximations.

• 한국산업경영시스템학회:학술대회논문집
• /
• 한국산업경영시스템학회 2002년도 춘계학술대회
• /
• pp.9-18
• /
• 2002

A capital investment problem is essentially one of determining whether the anticipated cash Inflows from a proposed project are sufficiently attractive to invest funds in the project. The net present value(NPV) criterion and internal rate of return(IRR) criterion are widely used as means of making investment decisions. A positive NPV means the equivalent worth of the inflows is greater than the equivalent worth of outflows, so, the project makes profit. Business people are familiar with rates of return because they all borrow money to finance ventures, even If the money they borrow is their own. Thus they are apt to use the IRR in preference to the NPV. The IRR can be defined as the discount rate that causes the net present value of a cash flow to equal zero. Why the project are accepted if the project's IRR is greater than the investor's minimum attractive rate of return. Against the NPV, the definition cannot distinctly explain the concept of the IRR as decision criterion. We present a new definition of the IRR as the ratio of profit on the invested capital.

• Communications for Statistical Applications and Methods
• /
• 제18권3호
• /
• pp.343-355
• /
• 2011

두 분포함수의 혼합모형을 가정한 자료에서 적절한 분류점을 찾고 평가하는 것은 중요한 문제이다. 분류정확도 측도로 많이 사용하는 아홉 종류의 MVD, Youden지수, (0,1)까지 최단기준, 수정된(0,1)까지 최단 기준, SSS, 대칭점, 정확도면적, TA, TR에 대하여 설명하고, 이 측도들의 관계를 발견하면서 정확도 측도들의 조건을 몇 개의 범주로 군집화한다. 정규혼합분포를 가정하여 군집된 측도들에 기반하는 분류점들을 구하고, 그 분류점에 대응하는 제I종 오류율과 제II종 오류율 그리고 두 종류의 오류율합을 구하여 크기를 비교하고 토론하다. 추정된 혼합분포에 대하여 어떤 분류 정확도 측도의 제I종과 II종 오류율 또는 오류율합이 최소인지를 탐색할 수 있으며 자주 인용하는 정확도 측도의 장점과 단점을 파악할 수 있다.

• Journal of Positioning, Navigation, and Timing
• /
• 제12권1호
• /
• pp.43-49
• /
• 2023

In modern wireless communication systems including beamformers or location-based services (LBS), which employ multiple antenna elements, estimating the number of signals is essential for accurately determining the quality of the communication service. Representative signal number estimation algorithms including the Akaike information criterion (AIC) and minimum description length (MDL) algorithms, which are information theoretical criterion models, determine the number of signals based on a reference value that minimizes each criterion. In general, increasing the number of elements mounted onto the array antenna enhances the performance of estimating the number of signals; however, it increases the computational complexity of the estimation algorithm. In addition, various configurations of array antennas for the increased number of antenna elements should be considered to efficiently utilize them in a limited location. In this paper, we introduce an efficient signal number estimation algorithm based on the beamspace based AIC and MDL techniques that reduce the computational complexity by reducing the dimension of a uniform circular array antenna. Since this algorithm is based on a uniform circular array antenna, it presents the advantages of a circular array antenna. The performance of the proposed signal number estimation algorithm is evaluated through computer simulation examples.

• 한국산업보건학회지
• /
• 제21권1호
• /
• pp.62-71
• /
• 2011

There is widespread concern that particulate filtering respirators (PFRs) available in Korea will be efficient for nanoparticles. The purpose of this review study was to analyse research literature and recommend PFRs suitable for protection against nanoparticles. In all studies, respirators containing electret filter media (N95, P100 and FFP2, FFP3) consistently have their MPPS below 100 nm and particle penetration levels at the MPPS can vary widely, but they comply with NIOSH or EN certification criterion. Electret filtering facepieces respirators (FFRs) were found to shift in the Most-Penetrating Particle Size(MPPS) from 30-60 to 200-300 nm range after the electric charges were removed, and FFRs were above their minimum penetrations of criterion. Korean special class and first class FFRs (the same as FFP3 and FFP2, respectively) would be effcient for nanoparticles unless FFRs are removed electric charges. It is difficult to evaluate if mechanical PFRs is efficient for nanoparticles due to the lack of related materials.

• Communications for Statistical Applications and Methods
• /
• 제12권3호
• /
• pp.625-634
• /
• 2005

A procedure is proposed to identify multiple outliers in the logistic regression. It detects the leverage points by means of hierarchical clustering of the robust distances based on the minimum covariance determinant estimator, and then it employs a V-mask type criterion on the scatter plot of robust residuals against robust distances to classify the observations into vertical outliers, bad leverage points, good leverage points, and regular points. Effectiveness of the proposed procedure is evaluated on the basis of the classic and artificial data sets, and it is shown that the procedure deals very well with the masking and swamping effects.

• 한국군사과학기술학회지
• /
• 제4권2호
• /
• pp.9-16
• /
• 2001

In this paper, general design process for Tracked Fighting Vehicle has been suggested. Stress analysis and optimal design for ply angle of IFV's composite upper hull has been calculated using KMA CIFV and it is contained exploratory development of design process. In this point, this paper applied composite to IFV's upper hull. Finite element mesh has been made using Matlab program, and we have analyzed stress based on the given material properties and ply arrangement. For each load condition, load distribution in plane and failure index are calculated by using Tasi-Hill criterion, which is composite failure criterion and analyzing change of failure index as change of ply angle. Finally, optimal ply angles of upper hull are calculated using KMA CIFV. We can estimate the decrease of weight for IFV's upper hull.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 제36회 하계학술대회 논문집 A
• /
• pp.557-559
• /
• 2005

This paper proposes a method for choosing the best composite power system expansion plan considering a contingency security criterion. The proposed method minimizes the investment budget fer constructing new transmission lines subject to contingency criterion. it models the power system expansion problem as an integer programming one. The method solves for the optimal strategy using a branch and bound method that utilizes a network flow approach and the maximum flow-minimum cut set theorem. Although the proposed method is applied to a simple sample study, the test results demonstrate that the proposed method is suitable for solving the power system expansion-planning problem subject to practical future uncertainties.

• 산업기술연구
• /
• 제24권A호
• /
• pp.139-155
• /
• 2004

A room and pillar mining method has been adopting at the Jeungsun limestone mine. To check stability of pillar with multiple and irregular openings, the size, shape and spacing of rib pillar were first designed using some empirical suggestions. The Finite Difference Method(FDM)was used to analyze the pillar stability. Twelve different cases with the variation of K(horizontal/vertical stress)values, different height and different spacing of pillar were used in this study. Finally Mohr-Coulomb criterion was adopted to calculate the safety factors. Horizontal and vertical displacement, maximum and minimum principal stresses, range of plastic zone and safety factors were calculated at each case. As a result of analysis, the size of one block is 160m long, 70m wide, 40m high with 20m wide rib pillar and 20m square column pillar. The overall recovery at this case can be estimated about 40%.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 신호처리소사이어티 추계학술대회 논문집
• /
• pp.505-508
• /
• 2003

The current paper proposes a new vertex selection scheme for polygon-based contour ceding. To efficiently characterize the shape of an object, we incorporate the curvature information in addition to the conventional maximum distance criterion in vertex selection process. The proposed method consists of “two-step procedure.” At first, contour pixels of high curvature value are selected as key vertices based on the curvature scale space (CSS), thereby dividing an overall contour into several contour-segments. Each segment is considered as an open contour whose end points are two consecutive key vertices and is processed independently. In the second step, vertices for each contour segment are selected using progressive vertex selection (PVS) method in order to obtain minimum number of vertices under the given maximum distance criterion ( $D_{MAX}$). Experimental results are presented to compare the approximation performances of the proposed and conventional methods.s.