• Title/Summary/Keyword: 최적점

Search Result 2,263, Processing Time 0.028 seconds

Determination of the Optimal Cutoff Point using Adjusted Stratum-Specific Likelihood Ratios when Disease Verification is subject to Verification Bias (선택편향이 존재할 때, 수정 층화우도비를 이용한 최적절사점의 결정)

  • Kim, Hu-Nam;Park, Yong-Gyu
    • The Korean Journal of Applied Statistics
    • /
    • v.20 no.3
    • /
    • pp.515-530
    • /
    • 2007
  • Stratum-specific likelihood ratio, which is ratio of the sensitivity to 1-the specificity in each stratum of the test, could be biased if the sensitivity and specificity of diagnostic test are affected by verification bias. Therefore, the optimal cutoff point determined by biased stratum-specific likelihood ratios is incorrect. In this study, we derived adjusted stratum-specific likelihood ratios using the adjusted sensitivity and specificity, and obtained the adjusted optimal cutoff point. The influence of the verification bias on the optimal cutoff point was described through the relation between adjusted and unadjusted stratum-specific likelihood ratios.

Robust Designs of the Second Order Response Surface Model in a Mixture (2차 혼합물 반응표면 모형에서의 강건한 실험 설계)

  • Lim, Yong-Bin
    • The Korean Journal of Applied Statistics
    • /
    • v.20 no.2
    • /
    • pp.267-280
    • /
    • 2007
  • Various single-valued design optimality criteria such as D-, G-, and V-optimality are used often in constructing optimal experimental designs for mixture experiments in a constrained region R where lower and upper bound constraints are imposed on the ingredients proportions. Even though they are optimal in the strict sense of particular optimality criterion used, it is known that their performance is unsatisfactory with respect to the prediction capability over a constrained region. (Vining et at., 1993; Khuri et at., 1999) We assume the quadratic polynomial model as the mixture response surface model and are interested in finding efficient designs in the constrained design space for a mixture. In this paper, we make an expanded list of candidate design points by adding interior points to the extreme vertices, edge midpoints, constrained face centroids and the overall centroid. Then, we want to propose a robust design with respect to D-optimality, G-optimality, V-optimality and distance-based U-optimality. Comparing scaled prediction variance quantile plots (SPVQP) of robust designs with that of recommended designs in Khuri et al. (1999) and Vining et al. (1993) in the well-known examples of a four-component fertilizer experiment as well as McLean and Anderson's Railroad Flare Experiment, robust designs turned out to be superior to those recommended designs.

An Algorithm for Optimized Accuracy Calculation of Hull Block Assembly (선박 블록 조립 후 최적 정도 계산을 위한 알고리즘 연구)

  • Noh, Jac-Kyou
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.19 no.5
    • /
    • pp.552-560
    • /
    • 2013
  • In this paper, an optimization algorithm for the block assembly accuracy control assessment is proposed with consideration for the current block assembly process and accuracy control procedure used in the shipbuilding site. The objective function of the proposed algorithm consists of root mean square error of the distances between design and measured data of the other control points with respect to a specific point of the whole control points. The control points are divided into two groups: points on the control line and the other points. The grouped data are used as criteria for determining the combination of 6 degrees of freedom in the registration process when constituting constraints and calculating objective function. The optimization algorithm is developed by using combination of the sampling method and the point to point relation based modified ICP algorithm which has an allowable error check procedure that makes sure that error between design and measured point is under allowable error. According to the results from the application of the proposed algorithm with the design and measured data of two blocks data which are verified and validated by an expert in the shipbuilding site, it implies that the choice of whole control points as target points for the accuracy calculation shows better results than that of the control points on the control line as target points for the accuracy of the calculation and the best optimized result can be acquired from the accuracy calculation with a fixed point on the control line as the reference point of the registration.

Genetic Algorithm Using-Floating Point Representation for Steiner Tree (스타이너 트리를 구하기 위한 부동소수점 표현을 이용한 유전자 알고리즘)

  • 김채주;성길영;우종호
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.5
    • /
    • pp.1089-1095
    • /
    • 2004
  • The genetic algorithms have been used to take a near optimal solution because The generation of the optimal Steiner tree from a given network is NP-hard problem,. The chromosomes in genetic algorithm are represented with the floating point representation instead of the existing binary string for solving this problem. A spanning tree was obtained from a given network using Prim's algorithm. Then, the new Steiner point was computed using genetic algorithm with the chromosomes in the floating point representation, and it was added to the tree for approaching the result. After repeating these evolving steps, the near optimal Steiner tree was obtained. Using this method, the tree is quickly and exactly approached to the near optimal Steiner tree compared with the existing genetic algorithms using binary string.

Optimal Threshold from ROC and CAP Curves (ROC와 CAP 곡선에서의 최적 분류점)

  • Hong, Chong-Sun;Choi, Jin-Soo
    • The Korean Journal of Applied Statistics
    • /
    • v.22 no.5
    • /
    • pp.911-921
    • /
    • 2009
  • Receiver Operating Characteristic(ROC) and Cumulative Accuracy Profile(CAP) curves are two methods used to assess the discriminatory power of different credit-rating approaches. The points of optimal classification accuracy on an ROC curve and of maximal profit on a CAP curve can be found by using iso-performance tangent lines, which are based on the standard notion of accuracy. In this paper, we offer an alternative accuracy measure called the true rate. Using this rate, one can obtain alternative optimal threshold points on both ROC and CAP curves. For most real populations of borrowers, the number of the defaults is much less than that of the non-defaults, and in such cases the true rate may be more efficient than the accuracy rate in terms of cost functions. Moreover, it is shown that both alternative scores of optimal classification accuracy and maximal profit are the identical, and this single score coincides with the score corresponding to Kolmogorov-Smirnov statistic used to test the homogeneous distribution functions of the defaults and non-defaults.

Constant Time RMESH Algorithms for Computing the Visibility Polygon in a Polygon with Holes (구멍이 있는 다각형에서 가시성 다각형을 구하는 상수 시간 RMESH 알고리즘)

  • 김수환
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2000.10a
    • /
    • pp.548-550
    • /
    • 2000
  • 본 논문은 재구성 가능한 메쉬(RMESH) 병렬 모델에서 상수 시간에 구멍이 있는 다각형의 한 점으로부터의 가시성 다각형을 구하는 문제를 고려한다. 알고리즘의 기본 전략은 프로세서의 수에 있어 준-최적인 상수 시간 알고리즘을 사용하여 문제의 크기를 감소시킴으로써 최적인 상수 시간 알고리즘을 얻는 것이다. 이 전략을 사용해 모두 N개의 에지로 구성된 구멍이 있는 다각형에 대한 가시성 다각형을 N$\times$N RMESH에서 상수 시간에 구하는 알고리즘을 제시한다. 이 알고리즘은 다각형들의 집합이 주어져 있을 때 외부의 한 점에서 가시 영역을 구하거나, 선분들의 집합이 주어져 있을 때 평면상의 한 점에서 가시 영역을 구하는 문제도 해결할 수 있다.

  • PDF

Global Optimum Searching Technique Using DNA Coding and Evolutionary Computing (DNA 코딩과 진화연산을 이용한 함수의 최적점 탐색방법)

  • Paek, Dong-Hwa;Kang, Hwan-Il;Kim, Kab-Il;Han, Seung-Soo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.11 no.6
    • /
    • pp.538-542
    • /
    • 2001
  • DNA computing has been applied to the problem of getting an optimal soluting since Adleman's experiment. DNA computing uses strings with various length and four-type bases that makes more useful for finding a global optimal solutions of the complex multi-modal problems This paper presents DNA coding method finding optimal solution of the multi-modal function and compares the efficiency of this method with the genetic algorithms(GA). GA searches efffectively an optimal solution via the artificial evolution of individual group of binary string and DNA coding method uses DNA molecules and four-type bases denoted by the A(Ademine) C(Gytosine);G(Guanine)and T(Thymine). The selection, crossover, mutation operators are applied to both DNA coding algorithm and genetic algorithms and the comparison has been performed. The results show that the DNA based algorithm performs better than GA.

  • PDF

Isogeometric Shape Design Optimization of Structural Systems Subjected to Design-dependent Loads (설계의존형 하중조건을 갖는 시스템의 아이소-지오메트릭 형상 최적설계)

  • Koo, Bon-Yong;Ha, Seung-Hyun;Cho, Seon-Ho
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2010.04a
    • /
    • pp.512-515
    • /
    • 2010
  • 본 논문에서는 등기하 해석법을 이용하여 설계의존형 하중조건을 갖는 구조물에 대한 형상 최적설계를 수행하였다. 유한요소법 기반 형상 최적설계는 CAD 모델과 해석 모델의 차이로 인해, 설계영역 매개변수화에 어려움이 있다. 등기하 해석법은 CAD 모델과 동일한 NURBS 기저 함수와 조정점을 해석에 이용함으로써 설계의 기하학적 변화를 해석모델에 직접적으로 표현할 수 있는 장점을 가진다. 하중조건이 설계 영역이 변화함에 따라 변하는 최적설계 문제의 경우, 정확한 설계 영역 표현은 법선 벡터, 즉 변화하는 하중의 방향과 곡률과 같은 고차항의 정보를 정확하게 표현할 수 있고, 따라서 목적함수를 최소 또는 최대화시키는 최적의 해로 이끌어 낸다. 유한요소법 또는 밀도법을 이용한 형상 최적설계에서 설계의존형 하중조건을 갖는 구조물의 문제를 푸는 경우, 최적설계가 진행됨에 있어 변화하는 경계의 부정확성 때문에 정확한 설계민감도를 얻기가 어려운 점이 있다. 본 논문에서는, 수치 예제를 통해 등기하 해석 기반의 형상 최적설계 방법론이 설계의존형 하중조건을 갖는 구조물 문제에서 수월성을 가짐을 확인하였다.

  • PDF

Study on the Optimum Positions of Theodolite Station for Control Surveying (기준점측량(基準點測量)을 위한 데오돌라이트 관측점(觀測點)의 최적위치(最適位置)에 관한 연구(研究))

  • Yeu, Bock Mo;Lee, Jae Ki;Park, Hong Gi
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.4 no.4
    • /
    • pp.95-103
    • /
    • 1984
  • This paper is a study on improving the accuracy of control points by suggesting angular requirements which make geometric conditions to be optimum. For this purpose, a equation, by which the accuracy of control point coordinates measured in an arbitrary station can be estimated, is derived. This equation is integrated and average standard error of the coordinates is computed, so that the optimum location of observatory station is determined. In the case of triangulation, a regular triangle has been generally considered as the best geometric condition, but because the precision of each side is different, the $52.77^{\circ}$ isosceles triangle is founded to be the best one. Also in trigonometric leveling, the geometric condition is founded to be optimum when the base angle of a isosceles triangle is $45^{\circ}$. In control surveying for close-range photogrammetry the optimum relation between base length($B_0$) and object distance($D_0$) can be founded to be as follow; $D_0=0.357587-0.357967B_0+0.308555B_0{^2}$.

  • PDF

Control Gain Optimization for Mobile Robots Using Neural Networks and Genetic Algorithms (신경회로망과 유전알고리즘에 기초한 이동로봇의 제어 이득 최적화)

  • Choi, Young-kiu;Park, Jin-hyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.4
    • /
    • pp.698-706
    • /
    • 2016
  • In order to move mobile robots to desired locations in a minimum time, optimal control problems have to be solved; however, their analytic solutions are almost impossible to obtain due to robot nonlinear equations. This paper presents a method to get optimal control gains of mobile robots using genetic algorithms. Since the optimal control gains of mobile robots depend on the initial conditions, the initial condition range is discretized to form some grid points, and genetic algorithms are applied to provide the optimal control gains for the corresponding grid points. The optimal control gains for general initial conditions may be obtained by use of neural networks. So the optimal control gains and the corresponding grid points are used to train neural networks. The trained neural networks can supply pseudo-optimal control gains. Finally simulation studies have been conducted to verify the effectiveness of the method presented in this paper.