• Proceedings of the KSPS conference
• /
• 2006.11a
• /
• pp.88-91
• /
• 2006

Steered response power(SRP) based algorithm uses a focused beamformer which steers the array to various locations and searches for a peak in output power to localize sound sources. SRP-PHAT, a phase transformed SRP, shows high accuracy, but requires a large amount of computation time. This paper proposes an algorithm that clusters search spaces in advance to reduce computation time of SRP based algorithms.

• Proceedings of the Korean Statistical Society Conference
• /
• 2005.05a
• /
• pp.215-219
• /
• 2005

We consider penalized likelihood regression with exponential family responses. Parallel to recent development in Gaussian regression, the fast computation through asymptotically efficient low-dimensional approximations is explored, yielding algorithm that scales much better than the O($n^3$) algorithm for the exact solution. Also customizations of the direct cross-validation strategy for smoothing parameter selection in various distribution families are explored and evaluated.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2006.05a
• /
• pp.1432-1436
• /
• 2006

Feasibility of optimizing Zwicker's loudness has been shown by using MSC/NASTRAN, SYSNOISE, and a semi-analytical design sensitivity by Wang and Kang. Design sensitivity analysis of Zwicker's loudness is developed by using ANSYS, COMET, and an adjoint variable method in order to reduce computation. A numerical example shows significant reduction of computation time for design sensitivity analysis.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2001.06a
• /
• pp.77-80
• /
• 2001

This paper presents a new threshold-based denoising method by using undecimated discrete wavelet transform (UDWT). It proved excellency of the UDWT compared with orthogonal wavelet transform (OWT), spatia1ly selective noise filtration (SSNF) and NSSNF added new parameter. Methods using the spatial correlation are effectual at edge detection and image enhancement, whereas algorithm is complex and needs more computation However, UDWT is effective at denoising and needs less computation and simple algorithm.

• Journal of the Korean Data and Information Science Society
• /
• v.11 no.2
• /
• pp.139-155
• /
• 2000

An exclusive simulation study is conducted in computing means for order statistics in standard normal variate. Monte Carlo moments are used in Shapiro-Francia W' statistic computation. Finally, quantiles for Shapiro-Francia W' are generated. The study shows that in computing means for order statistics in standard normal variate, complicated distributions and intensive numerical integrations can be avoided by using Monte Carlo simulation. Lack of accuracy is minimal and computation simplicity is noteworthy.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.7 no.4
• /
• pp.67-82
• /
• 1970

In this paper, formulas are developed for computing induced line voltages incommunication lines due to power line failure. Formulas are expressed in terms of fault current, mutual impedance andlength of line. Computed results are shown for various power line valtages and length of line. (Computation is done by IBM 1130-3B Computer system at Soong Sil Compute Center)

• Proceedings of the Optical Society of Korea Conference
• /
• 2003.02a
• /
• pp.242-243
• /
• 2003

A CGH is a hologram generated by computer. It is widely applied to wavefront manipulation, synthesis, optical information processing and interferometer. Some methods have been used to determine the optimum phase pattern to achieve high diffraction efficiency and uniform intensity such as DBS (Direct Binary Search), SA (Simulated Annealing), GA(Genetic Algorithm). These methods require long computation time to generate a hologram. (omitted)

• Nuclear Engineering and Technology
• /
• v.41 no.4
• /
• pp.381-390
• /
• 2009

This article provides selects of outstanding problems in computational neutron transport, with some suggested approaches thereto, as follows: i) ray effect in discrete ordinates method, ii) diffusion synthetic acceleration in strongly heterogeneous problems, iii) method of characteristics extension to three-dimensional geometry, iv) fission source and $k_{eff}$ convergence in Monte Carlo, v) depletion in Monte Carlo, vi) nuclear data evaluation, and vii) uncertainty estimation, including covariance data.

• Proceedings of the KIEE Conference
• /
• 1997.07a
• /
• pp.12-14
• /
• 1997

The analysis of eigenvalue and eigenvector is a crucial procedure for many electromagnetic computation problems. However, eigenpair computation is timing-consuming task. Thus, its parallelization is required for designing large-scale and precision three-dimensional electromagnetic machines. In this paper, the Davidson method is parallelized on a cluster of workstations. Performance of the parallelization scheme is reported. This scheme is applied to a ridged waveguide design problem.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.989-990
• /
• 2006

This paper presents a design of 3D Graphics Geometry processor. A geometry processor needs to cope with a large amount of computation and consists of transformation processor and lighting processor. To deal with the huge computation, a vector processing structure based on pipeline chaining is proposed. The proposed geometry processor performs 4.3M vertices/sec at 100MHz using 11 floating-point units.