• Journal of Korea Game Society
• /
• v.18 no.5
• /
• pp.123-132
• /
• 2018

Various methods have been proposed to efficiently animate the motion of soft objects in realtime. In order to maintain the topology between the elements of the objects, it is required to employ constraint forces, which limit the size of the time steps for the numerical integration and reduce the efficiency. To tackle this, an implicit method with larger steps was proposed. However, the method is, in essence, a linear system with a large matrix, of which solution requires heavy computations. Several approximate methods have been proposed, but the approximation is obtained with an increased damping and the loss of accuracy. In this paper, new integration method based on harmonic oscillation with better stability was proposed, and it was further stabilized with the hybridization with approximate implicit method. GPU parallelism can be easily implemented for the method, and large-scale soft objects can be simulated in realtime.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.426-436
• /
• 2000

Given a linear arrangement of n base stations which generate multiple types of traffic among themselves, we consider the problem of finding a set of disjoint clusters to cover n base statons so that a cluster is assigned a location server. Our goal is to minimize the total communication cost for the entire network where the cost of intra-cluster communication is usually lower than that of intercluster communication for each type of traffic. The optimization problem is transformed into an equivavalent problem using the concept of relative cost, which generates the difference of communication costs between intracluster and intercluster communications. Using the relative cost matrix, an efficient algorithm of O($mm^2$), where m is the number of clusters in a partition, is designed by dynamic programming. The algorithm also finds all thevalid partitions in the same polynomial time, given the size constraint on a cluster, and the total allowable communication cost for the entire network.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.34 no.4
• /
• pp.191-197
• /
• 2021

To calculate the induced charge of atoms in molecular dynamics, linear equations for the induced charges need to be solved. As induced charges are determined at each time step, the process involves considerable computational costs. Hence, an efficient method for calculating the induced charge distribution is required when analyzing large systems. This paper introduces the Uzawa method for solving saddle point problems, which occur in linear systems, for the solution of the Lagrange equation with constraints. We apply the accelerated Uzawa algorithm, which reduces computational costs noticeably using the Schur complement and preconditioned conjugate gradient methods, in order to overcome the drawback of the Uzawa parameter, which affects the convergence speed, and increase the efficiency of the matrix operation. Numerical models of molecular dynamics in which two gold nanoparticles are placed under external electric fields reveal that the proposed method provides improved results in terms of both convergence and efficiency. The computational cost was reduced by approximately 1/10 compared to that for the Gaussian elimination method, and fast convergence of the conjugate gradient, as compared to the basic Uzawa method, was verified.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.401-404
• /
• 2003

In this paper, $H_2$, $H_{\infty}$, and mixed $H_2/H_{\infty}$ FIR filters are newly proposed for discrete-time state space signal models. The proposed filters require linearity, unbiased property, FIR structure, and independence of the initial state information in addition to the performance criteria in both $H_2$ and $H_{\infty}$ sense. It is shown that $H_2$, $H_{\infty}$, and mixed $H_2/H_{\infty}$ FIR filter design problems can be converted into convex programming problems via linear matrix inequalities (LMIs) with a linear equality constraint. Simulation studies illustrat that the proposed FIR filter is more robust against uncertainties and has faster convergence than the conventional IIR filters. the conventional IIR filters.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.8
• /
• pp.15-26
• /
• 2011

In this paper, we present a new beamforming scheme for a downlink of multiuser multiple-input multipleoutput (MIMO) communication systems. Recently, a block-diagonalization (BD) algorithm has been proposed for the multiuser MIMO downlink where both a base station and each user have multiple antennas. However, the BD algorithm is not efficient when the number of supported streams per user is smaller than that of receive antennas. Since the BD method utilizes the space based on the channel matrix without considering the receive combining, the degree of freedom for beamforming cannot be fully exploited at the transmitter. In this paper, we optimize the receive beamforming vector under a zero forcing (ZF) constraint, where all inter-user interference is driven to zero. We propose an efficient algorithm to find the optimum receive vector by an iterative procedure. The proposed algorithm requires two phase values feedforward information for the receive combining vector. Also, we present another algorithm which needs only one phase value by using a decomposition of the complex general unitary matrix. Simulation results show that the proposed beamforming scheme outperforms the conventional BD algorithm in terms of error probability and obtains the diversity enhancement by utilizing the degree of freedom at the base station.

• Journal of KIISE:Software and Applications
• /
• v.33 no.5
• /
• pp.481-488
• /
• 2006

The performance of face recognition methods using subspace projection is directly related to the characteristics of their basis images, especially in the cases of local distortion or partial occlusion. In order for a subspace projection method to be robust to local distortion and partial occlusion, the basis images generated by the method should exhibit a part-based local representation. We propose an effective part-based local representation method named locally salient ICA (LS-ICA) method for face recognition that is robust to local distortion and partial occlusion. The LS-ICA method only employs locally salient information from important facial parts in order to maximize the benefit of applying the idea of 'recognition by parts.' It creates part-based local basis images by imposing additional localization constraint in the process of computing ICA architecture I basis images. We have contrasted the LS-ICA method with other part-based representations such as LNMF (Localized Non-negative Matrix Factorization) and LFA (Local Feature Analysis). Experimental results show that the LS-ICA method performs better than PCA, ICA architecture I, ICA architectureII, LFA, and LNMF methods, especially in the cases of partial occlusions and local distortions.

• Journal of Korean Society of Transportation
• /
• v.18 no.4
• /
• pp.117-126
• /
• 2000

Conventional methods for collecting origin-destination trips have been mainly relied on the surveys of home or roadside interview. However, the methods tend to be costly, labor intensive and time disruptive to the trip makers, thus the methods are not considered suitable for Planning applications such as routing guidance, arterial management and information Provision, as the parts of deployments in Intelligent Transport Systems Motivated by the problems, more economic ways to estimate origin-destination trip tables have been studied since the late 1970s. Some of them, which have been estimating O-D table from link traffic counts are generally Entropy maximizing, Maximum likelihood, Generalized least squares(GLS), and Bayesian inference estimation etc. In the Paper, with user equilibrium constraint we formulate GLS problem for estimating O-D trips and develop a solution a1gorithm by using Genetic Algorithm, which has been known as a g1oba1 searching technique. For the purpose of evaluating the method, we apply it to Seoul inner ringroad and compare it with gradient method proposed by Spiess(1990). From the resu1ts we fond that the method developed in the Paper is superior to other.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.16 no.4
• /
• pp.591-598
• /
• 2021

The digital phase-locked loops(DPLL) is a circuit used for phase synchronization and has been generally used in various fields such as communication and circuit fields. State estimators are used to design digital phase-locked loops, and infinite impulse response state estimators such as the well-known Kalman filter have been used. In general, the performance of the infinite impulse response state estimator-based digital phase-locked loop is excellent, but a sudden performance degradation may occur in unexpected situations such as inaccuracy of initial value, model error, and disturbance. In this paper, we propose a minimum variance finite impulse response filter with optimal horizon for designing a new digital phase-locked loop. A numerical method is introduced to obtain the measured value interval length, which is an important parameter of the proposed finite impulse response filter, and to obtain a gain, the covariance matrix of the error is set as a cost function, and a linear matrix inequality is used to minimize it. In order to verify the superiority and robustness of the proposed digital phase-locked loop, a simulation was performed for comparison and analysis with the existing method in a situation where noise information was inaccurate.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.13 no.2
• /
• pp.95-109
• /
• 1993

In this study, the optimal configuration of arch structure has been tested by a decomposition technique. The object of this study is to provide the method of optimizing the shapes of both two hinged and fixed arches. The problem of optimal configuration of arch structures includes the interaction formulas, the working stress, and the buckling stress constraints on the assumption that arch ribs can be approximated by a finite number of straight members. On the first level, buckling loads are calculated from the relation of the stiffness matrix and the geometric stiffness matrix by using Rayleigh-Ritz method, and the number of the structural analyses can be decreased by approximating member forces through sensitivity analysis using the design space approach. The objective function is formulated as the total weight of the structures, and the constraints are derived by including the working stress, the buckling stress, and the side limit. On the second level, the nodal point coordinates of the arch structures are used as design variables and the objective function has been taken as the weight function. By treating the nodal point coordinates as design variable, the problem of optimization can be reduced to unconstrained optimal design problem which is easy to solve. Numerical comparisons with results which are obtained from numerical tests for several arch structures with various shapes and constraints show that convergence rate is very fast regardless of constraint types and configuration of arch structures. And the optimal configuration or the arch structures obtained in this study is almost the identical one from other results. The total weight could be decreased by 17.7%-91.7% when an optimal configuration is accomplished.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.28 no.1
• /
• pp.9-18
• /
• 2015

In this paper, we verify the optimal topology design for heat conduction problems in steady stated which is obtained numerically using the adjoint design sensitivity analysis(DSA) method. In adjoint variable method(AVM), the already factorized system matrix is utilized to obtain the adjoint solution so that its computation cost is trivial for the sensitivity. For the topology optimization, the design variables are parameterized into normalized bulk material densities. The objective function and constraint are the thermal compliance of the structure and the allowable volume, respectively. For the experimental validation of the optimal topology design, we compare the results with those that have identical volume but designed intuitively using a thermal imaging camera. To manufacture the optimal design, we apply a simple numerical method to convert it into point cloud data and perform CAD modeling using commercial reverse engineering software. Based on the CAD model, we manufacture the optimal topology design by CNC.