• Proceedings of the IEEK Conference
• /
• 2001.06b
• /
• pp.129-132
• /
• 2001

This paper presents an efficient method to estimate the maximum SSN (simultaneous switching noise) for ground interconnection networks in CMOS systems using Taylor's series and analyzes the truncation error that has occurred in Taylor's series approximation. We assume that the curve form of noise voltage on ground interconnection networks is linear and derive a polynomial expression to estimate the maximum value of SSN using $\alpha$-power MOS model. The maximum relative error due to the truncation is shown to be under 1.87% through simulations when we approximate the noise expression in the 3rd-order polynomial.

• Journal of the Korean Statistical Society
• /
• v.22 no.2
• /
• pp.325-337
• /
• 1993

This paper propose two test statistics which enable us to proceed the variable selection in Fisher's linear discriminant function for the case of heterogeneous discrimination with equal training sample size. Simultaneous confidence intervals associated with the test are also given. These are exact and approximate results. The latter is based upon an approximation of a linear sum of Wishart distributions with unequal scale matrices. Using simulated sampling experiments, powers of the two tests have been tabulated, and power comparisons have been made between them.

• Communications for Statistical Applications and Methods
• /
• v.3 no.1
• /
• pp.235-242
• /
• 1996

When the linear growth birth and death process observed at a set of equidistant time points, McNeil and Weiss (1997) present a method for simultaneously estimating the Malthusian parameter and the sum of the two parameters under wery restricted assumptions using a diffusion approximation. This article suggests a method, which does not require the restrictions given by Weiss, for estimating simultaneously the Malthusian parameter and the sum of the two parameters.

• Proceedings of the KIEE Conference
• /
• 2002.07d
• /
• pp.2721-2723
• /
• 2002

Electrical impedance tomograpy(EIT) determines the resistivity distribution inside an inhomogeneous target by means of voltage and current measurements conducted at the target boundary. In this paper, a simultaneous perturbation stochastic approximation(SPSA) approach is proposed for the solution of the EIT image reconstruction. Results of numerical experiments of EIT solved by the SPSA approach are presented and compared to that obtained by the modified Newton-Raphson(mNR) method.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.22 no.51
• /
• pp.99-108
• /
• 1999

B-ISDN link dimensioning is often known as a difficult problem because of the characteristics of Asynchronous Transfer Mode(ATM) such as various Quality of Services of different service requirements, and the statistical multiplexing resulting from virtual path/virtual circuit connections. In this paper, we propose a nonlinear integer optimization model for dimensioning B-ISDN considering the statistical multiplexing effects of virtual path connections(VPCs) and the modularity of resources allocated to a transmission link. The algorithm based on the simultaneous linear approximation technique as well as some numerical results will be also presented.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.12 no.4
• /
• pp.87-94
• /
• 2013

This study estimated the changes in delays and speeds of vehicles in exclusive bus lane and road when the High Occupancy Vehicles(HOV) use the median bus lane. Synchro simulation tool was used to optimize the traffic signal time on the network and VISSIM was applied to simulate various scenarios. Here, drivers behavior parameters in VISSIM was optimized using Simultaneous Perturbation Stochastic Approximation(SPSA) algorithm in order to represent real traffic condition. Based on the simulation results, the delay in Doan daero was decreased when the volume of HOV in current condition runs on the median bus lane, whereas delay in Doan dongro was increased in all scenarios. The changes in bus speed was not sharply decreased for both study sites, even though the number of HOV increased to 10%. Thus, it could be allowed that the HOV use the median bus lane in Doan dongro and Doan daero. Future research tasks include studying about changes in delay when the HOV use the curb bus lane.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.12 no.6
• /
• pp.545-553
• /
• 1987

An approximation algorithm has been obtained to analyze the network of single server tandem queues with a finite length. In the queueing network with a finite queue length, the blocking which is mutually dependent, occure due to the limitation of the queue length. Thus, it is difficults to analyze such a queueing network. In this paper each queue has been regarded as the independent M/M/1/K system to analyze the queueing network with the blocking, which is based on the assumption that an arrival rate to the present station is increased by the blocking of the following stations. The performance measures, such as state probability, average queue length and tha waiting time, can be easily obtained using the proposed algorithm. In order to justify this approximation algorithm, comparison of the results of this algorithm with those of state transition simultaneous equations has been made an verified with computer simulation.

• International Journal of Control, Automation, and Systems
• /
• v.5 no.3
• /
• pp.251-268
• /
• 2007

A Gaussian sum filter (GSF) is proposed in this paper on simultaneous localization and mapping (SLAM) for mobile robot navigation. In particular, the SLAM problem is tackled here for cases when only bearing measurements are available. Within the stochastic mapping framework using an extended Kalman filter (EKF), a Gaussian probability density function (pdf) is assumed to describe the range-and-bearing sensor noise. In the case of a bearing-only sensor, a sum of weighted Gaussians is used to represent the non-Gaussian robot-landmark range uncertainty, resulting in a bank of EKFs for estimation of the robot and landmark locations. In our approach, the Gaussian parameters are designed on the basis of minimizing the representation error. The computational complexity of the GSF is reduced by applying the sequential probability ratio test (SPRT) to remove under-performing EKFs. Extensive experimental results are included to demonstrate the effectiveness and efficiency of the proposed techniques.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2001.05a
• /
• pp.979-983
• /
• 2001

We develop a new method of simultaneous optimization of trajectory and shape of redundant flexible manipulators for collision-free utilizing the B-spline function and a mathematical programming method We adopt an approximate flexible manipulator model which consists of rigid bar elements and spring elements. We use B-spline function for determining the approximate trajectory and the expressions of the outline of obstacles. The used total performance index consists of 2 performance indices. The first is the driving energy, and the second is the trajectory deviation which is caused by the approximate modeling for the flexible manipulator. We design optimal collision-free trajectory of flexible manipulators by searching optimum positions of the control points for B-spline approximation which minimize the performance index subject to constraint condition for collision-free. Some examinations through numerical examples show the effectiveness of the method

• Journal of the Korean Mathematical Society
• /
• v.57 no.2
• /
• pp.401-414
• /
• 2020

It is computationally expensive to compute principal components from scratch at every update or downdate when new data arrive and existing data are truncated from the data matrix frequently. To overcome this limitations, incremental principal component analysis is considered. Specifically, we present a sliding window based efficient incremental principal component computation from a covariance matrix which comprises of two procedures; simultaneous update and downdate of principal components, followed by the rank-one matrix update. Additionally we track the accurate decomposition error and the adaptive numerical rank. Experiments show that the proposed algorithm enables a faster execution speed and no-meaningful decomposition error differences compared to typical incremental principal component analysis algorithms, thereby maintaining a good approximation for the principal components.