• Journal of the Korean Data and Information Science Society
• /
• 제17권3호
• /
• pp.861-869
• /
• 2006

Burn-in is a widely used method to improve the quality of products or systems after they have been produced. In this paper, the problem of determining optimal burn-in time for a system which performs given mission is considered. It is assumed that the given mission time is not a fixed constant but a random variable which follows an exponential distribution. Assuming that the underlying lifetime distribution of a system has an eventually increasing failure rate function, an upper bound for the optimal burn-in time which maximizes the probability of performing given mission is derived. The obtained result is also applied to an illustrative example.

• Ocean and Polar Research
• /
• 제44권2호
• /
• pp.179-190
• /
• 2022

Data missing in optical satellite images caused by natural variations have been a crucial barrier in observing the status of marine surfaces. Although there have been many attempts to fill the gaps of non-observation, there is little research to analyze the ratio of missing grids to overall sea grids and their seasonal patterns. This report introduces the method of quantifying the distribution of missing points and then shows how the missing points have spatial correlation and seasonal trends. Both temporal and spatial integration methods are compared to assess the effectiveness of reducing missing data. The temporal integration shows more outstanding performance than the spatial integration. Moran's I and K-function with statistical hypothesis testing show that missing grids are clustered and there is a non-random distribution from daily integration. The result of the seasonality test for Moran's I through a periodogram shows dependency on full-year, half-year, and quarter-year periods respectively. These analysis results can be used to deduce appropriate integration periods with permissible estimation errors.

• 품질경영학회지
• /
• 제24권4호
• /
• pp.103-111
• /
• 1996

This paper provides a test of the composite hypothesis that a random sample is (two parameter) gamma distributed when both the scale and shape parameters are estimated from the data. The test statistic is a variant of the usual Anderson-Darling statistic, the primary difference being that the statistic is based on the maximum likelihood estimator of the shape parameter of the assumed gamma distribution. The percentage points are developed via simulation and are presented graphically. Examples are provided.

• 한국경영과학회지
• /
• 제8권1호
• /
• pp.31-40
• /
• 1983

An uncertain dynamic evolving process has been a continuing challenge to decision problems. The dynamic random variable (drv) changes which characterize such a process are very important for the decision-maker in selecting a course of action in a world that is perceived as uncertain, complex, and dynamic. Using this subjective point prediction algorithm based on a modified recursive filter, the decision-maker becomes to have periodically changing plausible points with the passage of time.

• 호남수학학술지
• /
• 제25권1호
• /
• pp.117-127
• /
• 2003

In this note we perform an extreme point analysis on two natural definitions of negative quadrant dependence of three random variables and examine how different these two notions of dependence. We also characterize some special distributions which are both negatively lower orthant dependent and negatively upper orthant dependent.

• 대한수학회지
• /
• 제44권3호
• /
• pp.525-539
• /
• 2007

Consider the regression model $Y_i=g(x_i)+e_i\;for\;i=1,\;2,\;{\ldots},\;n$, where: (1) $x_i$ are fixed design points, (2) $e_i$ are independent random errors with mean zero, (3) g($\cdot$) is unknown regression function defined on [0, 1]. Under $Y_i$ are censored randomly, we discuss the asymptotic normality of the weighted kernel estimators of g when the censored distribution function is known or unknown.

• ETRI Journal
• /
• 제32권3호
• /
• pp.362-369
• /
• 2010

While the elliptic curve cryptosystem (ECC) is getting more popular in securing numerous systems, implementations without consideration for side-channel attacks are susceptible to critical information leakage. This paper proposes new power attack countermeasures for ECC over Koblitz curves. Based on some special properties of Koblitz curves, the proposed methods randomize the involved elliptic curve points in a highly regular manner so the resulting scalar multiplication algorithms can defeat the simple power analysis attack and the differential power analysis attack simultaneously. Compared with the previous countermeasures, the new methods are also noticeable in terms of computational cost.

• 품질경영학회지
• /
• 제35권1호
• /
• pp.136-141
• /
• 2007

For many products failures depend on age and usage and, in this case, failures are random points in a two-dimensional plane with the two axes representing age and usage. Models play an important role in decision-making. In this research, an accelerate failure test (AFT) model is proposed to deal with the two-dimensional data. The parameters are proposed to be estimated through maximum likelihood estimators.

• 한국정보전자통신기술학회논문지
• /
• 제3권2호
• /
• pp.12-17
• /
• 2010

본 논문에서는 자동적으로 얼굴 특징점을 검출하는 시스템을 제안하였다. 얼굴은 Gabor 특징에 의하여 지정된 특징점의 교점 그래프와 공간적 연결을 나타내는 에지 그래프로 표현하였으며, 제안된 탄력적 특징 정합은 모델과 입력 영상에 상응하는 특징을 취하였다. 정합 모델은 국부적으로 경쟁적이고 전체적으로 협력적인 구조를 이룸으로서 영상공간에서 불규칙 확산 처리와 같은 역할을 하도록 하였다. 복잡한 배경이나 자세의 변화, 그리고 왜곡된 얼굴 영상에서도 원활하게 동작하는 얼굴 식별 시스템을 구성함으로서 제안된 방법의 효율성을 증명하였다.

• 산업경영시스템학회지
• /
• 제21권48호
• /
• pp.37-52
• /
• 1998

In many distribution systems important cost reductions and/or service improvements may be achieved by adopting an efficient inventory policy and proper selection of facilities. These efficiency improvements and service enhancements clearly require an integrated approach towards various logistical planning functions. The areas of inventory control and transportation planning need to be closely coordinated. The purpose of this paper is to construct an integrated model that can minimize the total cost of the transportation and inventory systems between multiple origin and destination points, where in origin point i has the supply of commodities and in destination point j requires the commodities. In this case, demands of the destination points are assumed random variables which have a known probability distribution. Using the lot-size reorder-point policy and the safety stock level that minimize total cost we find optimal distribution centers which transport the commodities to the destination points and suggest an optimal inventory policy to the selected distribution center. We also show if a demand greater than one unit will occur at a particular time, we describe the approximate optional replenishment policy from computational results of this lot-size reorder-point policy. This model is formulated as a 0-1 nonlinear integer programming problem. To solve the problem, this paper proposes heuristic computational procedures and a computer program with UNIX C language. In the usefulness review, we show the meaning and validity of the proposed model and exhibit the results of a comparison between our approach and the traditional approach, respectively.