• 한국시뮬레이션학회논문지
• /
• 제5권1호
• /
• pp.91-106
• /
• 1996

Control Variate (CV) is very useful technique for variance reduction in a wide class of queueing network simulations. However, the loss in variance reduction caused by the estimation of the optimum control coefficients is an increasing function of the number of control variables. Therefore, in some situations, it is required to select an optimal set of control variables to maximize the variance reduction . In this paper, we develop the Adaptive Control Variates (ACV) method which selects an optimal set of control variates during the simulation adatively. ACV is useful to maximize the simulation efficiency when we need iterated simulations to find an optimal solution. One such an example is the Simulated Annealing (SA) because, in SA algorithm, we have to repeat in calculating the objective function values at each temperature, The ACV can also be applied to the queueing network optimization problems to find an optimal input parameters (such as service rates) to maximize the throughput rate with a certain cost constraint.

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

In this paper, a specified number of actuators are selected from a given set of admissible actuators. The selected set of actuators is likely to use minimum control energy while required output variance constraints are guaranteed to be satisfied. The actuator selection procedure is an iterative algorithm composed of two parts; an output variance constrained control and an input variance constrained control algorithm. The idea behind this algorithm is that the solution to the first control problem provides the necessary weighting matrix in the objective function of the second optimization problem, and the sensitivity information from the second problem is utilized to delete one actuator. For variance constrained control problems, by considering a dual version of each control problem an efficient algorithm is provided, whose convergence properties turn out to be better than an existing algorithm. Numerical examples with a simple beam are given for both the input/output variance constrained control problem and the actuator selection problem.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.1173-1176
• /
• 1996

Multilayer feedforward networks may be applied to identify the deterministic relationship between input and output data. When the results from the network require a high level of assurance, considering of the stochastic relationship between the data may be very important. The variance is one of the useful parameters to represent the stochastic relationship. This paper presents a new algorithm for a multilayer feedforward network to learn the variance of dispersed data without preliminary calculation of variance. In this paper, the network with this learning algorithm is named as a variance learning neural network(VALEAN). Computer simulation examples are utilized for the demonstration and the evaluation of VALEAN.

• Journal of the Korean Data and Information Science Society
• /
• 제22권3호
• /
• pp.381-387
• /
• 2011

본 논문은 일원 확률모형의 가정하에 실험자료를 분석할 때 확률모형과 관련된 분산성분을 추정하는 문제를 다루고 있다. 분산성분의 추정방법으로 적률법을 이용하고 있다. 적률법을 이용할 때 필요한 두 가지 계산과정은 요인의 변동에 따른 제곱합과 제곱합의 기대값 계산이다. 제곱합의 계산으로 사영을 어떻게 이용하는 가를 논의하고 있다. 제곱합의 기대값 계산을 위해 분산성분의 계수로 관측되는 관련행렬의 고유근을 이용하는 방법을 다루고 있다. 분산성분의 적률추정량으로 사영과 고유근을 이용한 분산성분의 추정방법이 Hartley (1967)의 합성법보다 간편하고 효율적인 방법임을 논의하고 있다.

• Asian-Australasian Journal of Animal Sciences
• /
• 제10권5호
• /
• pp.510-513
• /
• 1997

This study examined the effects of ignoring inbreeding depression on (co)variance components for weaning weight through the use of Monte Carlo simulation. Weaning weight is of particular interest as a trait for which additive direct and maternal genetic components exist and there then is the potential for a direct-maternal genetic covariance. Ignoring inbreeding depression in the analytical model (.8 kg reduction of phenotypic value per 1% inbreeding) led to biased estimates of all genetic (co) variance components, all estimates being larger than the true values of the parameters. In particular, a negative bias in the direct-maternal genetic covariance was observed in analyses that ignored inbreeding depression. A small spurious sire-by-year interaction variance was also observed.

• Communications for Statistical Applications and Methods
• /
• 제9권2호
• /
• pp.305-313
• /
• 2002

Regarding to inference about a scalar measure of internal scatter of Ρ-variate normal population, this paper considers an interval estimation of the generalized variance, │$\Sigma$│. Due to complicate sampling distribution, fully parametric frequentist approach for the interval estimation is not available and thus Bayesian method is pursued to calculate the highest probability density (HPD) interval for the generalized variance. It is seen that the marginal posterior distribution of the generalized variance is intractable, and hence a weighted Monte Carlo method, a variant of Chen and Shao (1999) method, is developed to calculate the HPD interval of the generalized variance. Necessary theories involved in the method and computation are provided. Finally, a simulation study is given to illustrate and examine the proposed method.

• Journal of the Korean Statistical Society
• /
• 제24권2호
• /
• pp.563-568
• /
• 1995

It is well-known that the sample mean and the sample variance are jointly sufficient under normality assumption. In this paper a proof of the joint sufficiency is given without using the factorization criterion. It is related to a finite Sanov-type conditional theorem, i.e., the conditional probability density of $Y_1$ given sample mean $\mu$ and sample variance $\sigma^2$, where $Y_1, Y_2, \cdots, Y_n$ are independently and identically distributed (i.i.d.) normal random variables with mean m and variance $\delta^2$, equals that of $Y_1$ given sample mean $\mu$ and sample variance $\sigma^2$, where $Y_1, Y_2, \cdots, Y_n$ are i.i.d. normal random variables with mean $\mu$ and variance $\sigma^2$.

• Journal of the Korean Data and Information Science Society
• /
• 제16권2호
• /
• pp.289-300
• /
• 2005

In this article quick variance change point (VCP) detection problem for time series is considered. For this variance VCP detector equipped with tuning parameters is proposed. A major tool for the detector is moving variance ratio (MVR) which monitors variance change of a given time series. Tuning process of detector is investigated via simulation, which shows that tuning parameters are critical in achieving sensitivity and adaptiveness of detector.

• 한국전자파학회논문지
• /
• 제11권5호
• /
• pp.707-714
• /
• 2000

본 논문에서는 PLL 시스템의 보다 실제적 분석 모델인 3차 시스템을 통하여 저주파 대역에서 문제가 되는 flicker noise가 어떠한 양상을 나타내는가를 알아보려 한다. 3차에서 해석의 복잡성으로 수학적인 분석이 난해하지만 최적화 된 2차 필터를 통한 pseudo-damping factor의 도입으로 3차 시스템에서의 flicker variance의 해석이 용이하도록 시도하였다. 3차에서의 flicker variance의 수식적인 유도를 보이고 이를 2차 시스템에서 발생되는 flicker noise에 대한 variance와 비교하려 한다.

• 응용통계연구
• /
• 제18권3호
• /
• pp.689-699
• /
• 2005

우리는 모분산 ${\sigma}^2$에 대한 추정량으로서 표본분산 $S^2=\frac{{\Sigma}^n_{i=1}(X_i-\={X})^2}{n-1}$을 주로 사용한다. 그러나, 제 7차 교육과정에 따른 고등학교 수학 교과서(10-가, 수학 I과 실용수학)에서는 표본분산의 정의를 $S^2_n=\frac{{\Sigma}^n_{i=1}(X_i-\={X})^2}{n}$로 사용하고 있다. 이 두 표본분산들의 관계를 알아보고, 시뮬레이션을 통하여 확인하여 본다. 또한, 이 두 표본분산들을 포함하여 일반적으로 정의할 수 있는 표본분산을 제안한다.