• Nuclear Engineering and Technology
• /
• v.54 no.10
• /
• pp.3803-3810
• /
• 2022

OpenMC is a community-driven open-source Monte Carlo neutron and photon transport simulation code. The Weight Window Mesh (WWM) function and an automatic Global Variance Reduction (GVR) method was recently developed and implemented in a developmental branch of OpenMC. This WWM function and GVR method broaden OpenMC's usage in general purposes deep penetration shielding calculations. However, the Local Variance Reduction (LVR) method, which suits the source-detector problem, is still missing in OpenMC. In this work, the Weight Window Generator (WWG) function has been developed and benchmarked for the same branch. This WWG function allows OpenMC to generate the WWM for the source-detector problem on its own. Single-material cases with varying shielding and sources were used to benchmark the WWG function and investigate how to set up the particle histories utilized in WWG-run and WWM-run. Results show that there is a maximum improvement of WWM generated by WWG. Based on the above results, instructions on determining the particle histories utilized in WWG-run and WWM-run for optimal computation efficiency are given and tested with a few multi-material cases. These benchmarks demonstrate the ability of the OpenMC WWG function and the above instructions for the source-detector problem. This developmental branch will be released and merged into the main distribution in the future.

• The KIPS Transactions:PartD
• /
• v.19D no.2
• /
• pp.147-150
• /
• 2012

While LDA is a supervised dimension reduction method which finds projective directions to maximize separability between classes, the performance of LDA is severely degraded when the number of labeled data is small. Recently semi-supervised dimension reduction methods have been proposed which utilize abundant unlabeled data and overcome the shortage of labeled data. However, matrix computation usually used in statistical dimension reduction methods becomes hindrance to make the utilization of a large number of unlabeled data difficult, and moreover too much information from unlabeled data may not so helpful compared to the increase of its processing time. In order to solve these problems, we propose an ensemble approach for semi-supervised dimension reduction. Extensive experimental results in text classification demonstrates the effectiveness of the proposed method.

• Journal of Environmental Impact Assessment
• /
• v.22 no.3
• /
• pp.195-201
• /
• 2013

Local governments are establishing their own greenhouse gas reduction goal and are playing a important role to respond to climatic changes. However, there are difficulties in quantitative analyses such as estimation of future greenhouse gas emission and computation of reduction potential, which are procedures required to establish mid to long term strategies to realize of low carbon society by each local governments. Also, reduction measures must reflect characteristics of each local government, since the reduction power of each local government can differ according to characteristics of each. In order to establish strategies that reflect characteristics of local governments, types of greenhouse gas emission from cities were classified largely into residential city, commercial city, residential commercial city, agriculture and fishery city, convergence city, and industrial city. As a result of analyzing basic unit of greenhouse gas emission by local government during 2007 in terms of per population, household and GRDP based on the type classification, significant results were deduced for each type. To manage the amount of the national greenhouse gas, reduction measures should be focused on the local governments that emits more than the average of each type's GHG emission.

• Journal of Korea Multimedia Society
• /
• v.18 no.11
• /
• pp.1289-1301
• /
• 2015

Pedestrian detection (PD) is an essential task in various applications and sliding window-based methods utilizing HOG (Histogram of Oriented Gradients) or HOG-like descriptors have been shown to be very effective for accurate PD. However, due to exhaustive search across images, PD methods based on sliding window usually require heavy computational time. In this paper, we propose a real-time PD method for embedded visual surveillance with fixed backgrounds. The proposed PD method employs HOG descriptors as many PD methods does, but utilizes selective search so that it can save processing time significantly. The proposed selective search is guided by restricting searching to candidate regions extracted from Adaptive Gaussian Mixture Model (AGMM)-based background subtraction technique. Moreover, approximate computation of HOG descriptor and implementation in fixed-point arithmetic mode contributes to reduction of processing time further. Possible accuracy degradation due to approximate computation is compensated by applying an appropriate one among three offline trained SVM classifiers according to sizes of candidate regions. The experimental results show that the proposed PD method significantly improves processing speed without noticeable accuracy degradation compared to the original HOG-based PD and HOG with cascade SVM so that it is a suitable real-time PD implementation for embedded surveillance systems.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.1
• /
• pp.97-102
• /
• 1998

In the most cases of eigen value problems in the social sciences, the object matrix to analyze is real-valued symmetric matrix. And many cases of eigen value problems in this field needs 2-4 eigen pairs according to the magnitude of their absolute values. The methods to obtain eigen pairs by numerical computation using computer, we would face the problem of round off error because matrix computation needs a number of calculations. In this paper, an algorithm which make us to get some needed eigcn pairs according to the magnitude of their absolute values is designed. And in this algorithm, the power method is used to obtain some eigen pairs. This algorithm is expected to be effective by the reduction of the number of calculations.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.1 s.307
• /
• pp.1-8
• /
• 2006

This paper presents a fast full search algorithm for motion estimation applicable to multiple reference images. The proposed method is an extended version of the rate constrained successive elimination algorithm (RSEA) for multiple reference frame applications. We will show that motion estimation for the reference images temporally preceding the first reference image can be less intensive in computation compared with that for the first reference image. for computational reduction, we will drive a new condition to lead the smaller number of candidate blocks for the best matched block. Simulation results explain that our method reduces computation complexity although it has the same quality as RSEA.

• The Journal of the Korea Contents Association
• /
• v.8 no.4
• /
• pp.48-54
• /
• 2008

This paper analyzes cost tradeoffs between memory usage and computation for window-based operators in data stream environments. It identifies generic operator network constructs, and sets up a cost model for the estimation of the expected memory reduction and the computation overheads when window memory relocations are applied to each operator network construct. This cost model helps to identify the utility of window memory relocations. It also helps to apply window memory relocation to improve a query execution plan to save memory usage. The proposed approach contributes to expand the scope of query processing and optimization in data stream environments. It also provides a basis to develop a cost estimation model for the query optimization using window memory relocations.

• Wind and Structures
• /
• v.22 no.3
• /
• pp.349-368
• /
• 2016

A preconditioning technique is presented for a simultaneous solution to wind-membrane interaction. In the simultaneous equations, a linear elastic model was employed to deal with the fluid-structure data transfer at the interface. A Lagrange multiplier was introduced to impose the specified boundary conditions at the interface and strongly coupled simultaneous equations are derived after space and time discretization. An initial linear elastic model preconditioner and modified one were derived by treating the linearized elastic model equation as a saddle point problem, respectively. Accordingly, initial and modified fluid-structure interaction (FSI) preconditioner for the simultaneous equations were derived based on the initial and modified linear elastic model preconditioners, respectively. Wind-membrane interaction analysis by the proposed preconditioners, for two and three dimensional membranous structures respectively, was performed. Comparison was made between the performance of initial and modified preconditioners by comparing parameters such as iteration numbers, relative residuals and convergence in FSI computation. The results show that the proposed preconditioning technique greatly improves calculation accuracy and efficiency. The priority of the modified FSI preconditioner is verified. The proposed preconditioning technique provides an efficient solution procedure and paves the way for practical application of simultaneous solution for wind-structure interaction computation.

• The Journal of the Acoustical Society of Korea
• /
• v.19 no.1
• /
• pp.67-72
• /
• 2000

Particularly based on the signal bias removal(SBR) algorithm for compensating the corrupted speech, this paper presents a new algorithm which is independent of environments, minimizes the amount of computation, and is readily applicable to the conventional recognition system. To this end, a multiple-bias algorithm and a partial codebook search algorithm have been added to the conventional SBR algorithm. The simulation results show that combining the two algorithms proposed in this paper provides a reduction of computation time to 1/8 times as well as an improvement of the recognition rate from 77.58% of the conventional system to 81.32%.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.12
• /
• pp.3166-3179
• /
• 2013

A pre-processing system for adaptive noise removal is proposed based on the principle of identifying and filtering object regions and background regions. Human perception of images depends on bright, well-focused object regions; these regions can be treated with the best filters, while simpler filters can be applied to other regions to reduce overall computational complexity. In the proposed method, bright region segmentation is performed, followed by segmentation of object and background regions. Noise in dark, background, and object regions is then removed by the median, fast bilateral, and bilateral filters, respectively. Simulations show that the proposed algorithm is much faster than and performs nearly as well as the bilateral filter (which is considered a powerful noise removal algorithm); it reduces computation time by 19.4 % while reducing PSNR by only 1.57 % relative to bilateral filtering. Thus, the proposed algorithm remarkably reduces computation while maintaining accuracy.