• 대한기계학회논문집A
• /
• 제30권6호
• /
• pp.691-697
• /
• 2006

Metamodel, model of model, has been widely used to improve an efficiency of optimization process in engineering fields. However, global metamodels of constraints in a constrained optimization problem are required good accuracy around neighborhood of optimum point. To satisfy this requirement, more sampling points must be located around the boundary and inside of feasible region. Therefore, a new sampling strategy that is capable of identifying feasible domain should be applied to select sampling points for metamodels of constraints. In this research, we suggeste sequential feasible domain sampling that can locate sampling points likely within feasible domain by using penalty function method. To validate the excellence of feasible domain sampling, we compare the optimum results from the proposed method with those form conventional global space-filling sampling for a variety of optimization problems. The advantages of the feasible domain sampling are discussed further.

• 한국시뮬레이션학회논문지
• /
• 제9권2호
• /
• pp.75-87
• /
• 2000

In this paper, nonstationary multiple sampling plans are discussed which are difficult to solve by analytical method when there exists dependency between the sample data. The initial solution is found by the sequential sampling plan using the sequential probability ration test. The number of acceptance and rejection in each step of the multiple sampling plan are found by grouping the sequential sampling plan's solution initially. The optimal multiple sampling plans are found by simulation. Four search methods are developed U and the optimum sampling plans satisfying the Type I and Type ll error probabilities. The performance of the sampling plans is measured and their algorithms are also shown. To consider the nonstationary property of the dependent sampling plan, simulation method is used for finding the lot rejection and acceptance probability function. As a numerical example Markov chain model is inspected. Effects of the dependency factor and search methods are compared to analyze the sampling results by changing their parameters.

• Journal of the Korean Data and Information Science Society
• /
• 제15권4호
• /
• pp.867-877
• /
• 2004

The sequential sampling inspection method is an extension of the multiple-sampling methods, and its theory is based on the sequential probability ratio test (SPRT) of Wald. In this paper, the characteristics of SPRT for testing the number of defects are approximated by using the estimated excess over the boundaries. The use of the estimated excess shows good performances in estimating the operating characteristic function and the average sample number of SPRT compared to the method by neglecting the excess. It also makes it possible to determine the boundary values which satisfy the desired error probabilities.

• 대한기계학회논문집A
• /
• 제31권1호
• /
• pp.55-61
• /
• 2007

Recently simulation model becomes an essential tool for analysis and design of a system but it is often expensive and time consuming as it becomes complicate to achieve reliable results. Therefore, high-fidelity simulation model needs to be replaced by an approximate model, the so-called metamodel. Metamodeling techniques include 3 components of sampling, metamodel and validation. Cross-validation approach has been proposed to provide sequnatially new sample point based on cross-validation error but it is very expensive because cross-validation must be evaluated at each stage. To enhance the cross-validation of metamodel, sequential sampling method using candidate points and representative cross-validation is proposed in this paper. The candidate and representative cross-validation approach of sequential sampling is illustrated for two-dimensional domain. To verify the performance of the suggested sampling technique, we compare the accuracy of the metamodels for various mathematical functions with that obtained by conventional sequential sampling strategies such as maximum distance, mean squared error, and maximum entropy sequential samplings. Through this research we team that the proposed approach is computationally inexpensive and provides good prediction performance.

• 산업경영시스템학회지
• /
• 제21권45호
• /
• pp.101-112
• /
• 1998

Data mining, which is also referred to as knowledge discovery in database, means a process of nontrivial extraction of implicit, previously unknown and potentially useful information (such as knowledge rules, constraints, regularities) from data in databases. The discovered knowledge can be applied to information management, decision making, and many other applications. In this paper, a new data mining problem, discovering sequential patterns, is proposed which is to find all sequential patterns using sampling method. Recognizing that the quantity of database is growing exponentially and transaction database is frequently updated, sampling method is a fast algorithm reducing time and cost while extracting the trend of customer behavior. This method analyzes the fraction of database but can in general lead to results of a very high degree of accuracy. The relaxation factor, as well as the sample size, can be properly adjusted so as to improve the result accuracy while minimizing the corresponding execution time. The superiority of the proposed algorithm will be shown through analyzing accuracy and efficiency by comparing with Apriori All algorithm.

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

The sequential sampling inspection method is an extension of the double-sampling and multiple-sampling methods and its theory is based on the sequential probability ratio test(SPRT). In this paper, the characteristics of SPRT for testing the propotion of defectives are approximated by using the estimated excess over the boundaries. The use of the estimated excess shows good performances in estimating the operating characteristic function and the average sample number of SPRT compared to the method by neglecting the excess. It also makes it possible to determine the boundary values which satisfy the desired error probabilities.

• 대한기계학회논문집A
• /
• 제33권12호
• /
• pp.1464-1470
• /
• 2009

RBDO approach based on a sampling method with the Kriging metamodel and Constraint Boundary Sampling (CBS), which is sequential sampling method to generate metamodels is proposed. The major advantage of the proposed RBDO approach is that it does not require Most Probable failure Point (MPP) which is essential for First-Order Reliability Method (FORM)-based RBDO approach. The Monte Carlo Sampling (MCS), most well-known method of the sampling methods for the reliability analysis is used to assess the reliability of constraints. In addition, a Cumulative Distribution Function (CDF) of the constraints is approximated using Moving Least Square (MLS) method from empirical distribution function. It is possible to acquire a probability of failure and its analytic sensitivities by using an approximate function of the CDF for the constraints. Moreover, a concept of inactive design is adapted to improve a numerical efficiency of the proposed approach. Computational accuracy and efficiency of the proposed RBDO approach are demonstrated by numerical and engineering problems.

• 대한기계학회논문집A
• /
• 제29권9호
• /
• pp.1199-1208
• /
• 2005

Nowadays, it is performed actively to optimize by using an approximate model. This is called the approximate optimization. In addition, the sequential approximate optimization (SAO) is the repetitive method to find an optimum by considering the convergence of an approximate optimum. In some recent studies, it is proposed to increase the fidelity of approximate models by applying the sequential sampling. However, because the accuracy and efficiency of an approximate model is directly connected with the design area and the termination criteria are not clear, sequential sampling method has the disadvantages that could support an unreasonable approximate optimum. In this study, the SAO is executed by using trust region, Kriging model and Optimal Latin Hypercube design (OLHD). Trust region is used to guarantee the convergence and Kriging model and OLHD are suitable for computer experiment. finally, this SAO method is applied to various optimization problems of highly nonlinear mathematical functions. As a result, each approximate optimum is acquired and the accuracy and efficiency of this method is verified by comparing with the result by established method.

• 농업과학연구
• /
• 제47권3호
• /
• pp.615-624
• /
• 2020

An effective sampling method is necessary to monitor potato tuber moths (Phthorimaea operculella) because they are the biggest concern in potato-cultivating areas. In this study, a sequential sampling method was developed based on the results of field surveys of potato tuber moths in South Korea. Potato tuber moths were collected in fields cultivating potatoes at six sites, and their spatial distribution was investigated using the Taylor power law. The optimal sampling size and cumulative number of potato tuber moths in traps to stop sampling were determined based on the spatial distribution pattern and mean density of the collected potato tuber moths. Finally, the developed sampling method was applied to propose a control action, and its sampling efficiency was compared with that of the traditional sampling method using a binomial distribution. The potato tuber moths tended to aggregate; the optimal number was approximately 5 - 16 traps for sampling, and the number varied with the mean density of potato tuber moths according to the sampling sites. In addition, one, two, and three sites might require the following actions: Continued sampling, control, and no control, respectively. Sampling with the binomial distribution showed the minimum sample size was 12 when considering the economic threshold level. Here, we propose an effective sampling method that can be applied for future monitoring and field surveys of potato tuber moths in South Korea.

• 한국정보처리학회논문지
• /
• 제7권4호
• /
• pp.1044-1049
• /
• 2000

In detection of a scene change of the moving pictures which has massive information capacity, the temporal sampling method has faster searching speed than the sequential searching method for the whole moving pictures, yet employed searching algorithm and detection interval greatly affect searching time and searching precision. In this study, the whole moving pictures were primarily retrieved by the temporal sampling method. When there exist a scene change within the sampling interval, we suggested a fast searching algorithm using binary searching and derived an equation formula to determine optimal primary retrieval which can minimize computation, and showed the result of the experiment on MPEG moving pictures. The result of the experiment shows that the searching speed of the suggested algorithm is maximum 13 times faster than the one of he sequential searching method.