• The KIPS Transactions:PartD
• /
• v.13D no.5 s.108
• /
• pp.717-724
• /
• 2006

The cost estimation of software is getting more important as the portion of software is increasing in acquiring weapon systems. However, the cost estimation of embedded software in a weapon system follows the cost estimation method for general purpose softwares and uses the PRICE S model as a tool. However, any validation result of the estimated cost through an evaluated software size is not well known. Hence, we propose an approach to estimate the cost through evaluating the embedded software site in weapon systems. In order to achieve our research goal, we evaluate the software size of using the line of codes and function points which are produced by the PRICE S model. Finally, we compare the estimated cost data the actual cost data provided by the production company. As a result, we propose an approach to estimate the size and the cost of embedded software in weapon systems which are not easy to estimate objectively. We also expect that the Proposed approach is used for the cost validation and negotiation in the acquisition of weapon systems in the future.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.22 no.5
• /
• pp.561-566
• /
• 2021

The optimum kernel size for error-distribution estimation with given error samples cannot be used in the weight adjustment of minimum Euclidean distance between error distributions (MED) algorithms. In this paper, a new adaptive kernel estimation method for convergence enhancement of MED algorithms is proposed. The proposed method uses the average rate of change in error power with respect to a small interval of the kernel width for weight adjustment of the MED learning algorithm. The proposed kernel adjustment method is applied to experiments in communication channel compensation, and performance improvement is demonstrated. Unlike the conventional method yielding a very small kernel calculated through optimum estimation of error distribution, the proposed method converges to an appropriate kernel size for weight adjustment of the MED algorithm. The experimental results confirm that the proposed kernel estimation method for MED can be considered a method that can solve the sensitivity problem from choosing an appropriate kernel size for the MED algorithm.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.1
• /
• pp.320-324
• /
• 2015

Mutual coupling between antenna elements of a linear microstrip patch antenna array positioned along the H-plane including the effect of edge reflections is investigated. Simple formulas are presented for the estimation of the grounded dielectric substrate size with minimum mutual coupling. The substrate sizes calculated by these formulas are in good agreement with those obtained by the full-wave simulation and experimental measurement. The substrate size with minimum mutual coupling is a function of the effective dielectric constant for surface waves and the distance between the antenna centers. The substrate size with minimum mutual coupling decreases as the effective dielectric constant for surface waves on a finite grounded dielectric substrate increases.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.469-472
• /
• 2005

In this paper, we propose a new deinterlacing algorithm based on motion estimation and compensation with variable block size. Motion compensated methods using a fixed block size tend to produce undesirable artifacts when there exist complicated motion and high frequency components. In the proposed algorithm, the initial block size of motion estimation is determined based on the existence of global motion. Then, the block is divided depending on block characteristics. Since motion compensated deinterlacing may not always provide satisfactory results, the proposed method also use an intrafield spatial deinterlacing. Experimental results show that the proposed method provides noticeable improvements compared to motion compensated deinterlacing with a fixed block size.

• Journal of Institute of Control, Robotics and Systems
• /
• v.21 no.1
• /
• pp.52-58
• /
• 2015

In this paper, The ET-MBEF algorithm is presented for CCD imaging seeker. At the imaging seeker, target size information is important factor for accurate tracking. The MBEF algorithm was proposed to estimate target size at IIR seeker. However, the MBEF algorithm can't be applied at CCD imaginary target size estimation. In order to overcome the problem, we propose ET-MBEF algorithm which based on ET (Edge Template) and MBEF algorithm. The performance of proposed method is tested at target intercept scenario. The experiment results show that the proposed algorithm has the accurate target intercept performance.

• Journal of Preventive Medicine and Public Health
• /
• v.40 no.2
• /
• pp.114-121
• /
• 2007

Power and sample size estimation is one of the crucially important steps in planning a genetic association study to achieve the ultimate goal, identifying candidate genes for disease susceptibility, by designing the study in such a way as to maximize the success possibility and minimize the cost. Here we review the optimal two-stage genotyping designs for genomewide association studies recently investigated by Wang et al(2006). We review two mathematical frameworks most commonly used to compute power in genetic association studies prior to the main study: Monte-Carlo and non-central chi-square estimates. Statistical powers are computed by these two approaches for case-control genotypic tests under one-stage direct association study design. Then we discuss how the linkage-disequilibrium strength affects power and sample size, and how to use empirically-derived distributions of important parameters for power calculations. We provide useful information on publicly available softwares developed to compute power and sample size for various study designs.

• Journal of Korea Multimedia Society
• /
• v.3 no.4
• /
• pp.372-379
• /
• 2000

In this paper, we propose a fast variable-size block matching algorithm for motion estimation based on bit-pattern. Motion estimation in the proposed algorithm is performed after the representation of image sequence is transformed 8bit pixel values into 1bit ones depending on the mean value of search block, which brings a short searching time by reducing the computational complexity. Moreover, adaptive searching methods according to the motion information of the block make the procedure of motion estimation efficient by eliminating an unnecessary searching of low motion block and deepening a searching procedure in high motion block. Experimental results show that the proposed algorithm provides better performance-0.5dB PSNR improvement-than full search block matching algorithm with a fixed block size.

• Journal of the Korean Home Economics Association
• /
• v.29 no.2
• /
• pp.121-134
• /
• 1991

The farm housewive's labor has not been properly evaluated, although it has traditionally shared and devoted a substantial portion of the farm household economy. The objective of this study is to estimate the money value of rural women's labor. The data were got from the result of time analysis of farm housewives in 1988. Among the four estimation methods used in this study, the mixed approach of houskeeper replacement cost with individual function cost showed the greatest value in the decision criteria of different farming region, farming size, housewive's age, family size and children number. The opportunity cost approach showed the lowest value, however, is considered as the most appropriate estimation approach in rural situation in this study. It is expected that the appropriate estimation approach should be estimate the money value of rural housewive's labor and their economic position.

• The Journal of the Acoustical Society of Korea
• /
• v.35 no.1
• /
• pp.55-62
• /
• 2016

The least-mean fourth (LMF) algorithm is well known for its fast convergence and low steady-state error especially in non-Gaussian noise environments. Recently, there has been increasing interest in the least mean square (LMS) algorithms with variable step size. It is because the variable step-size LMS algorithms have shown to outperform the conventional fixed step-size LMS in the various situations. In this paper, a variable step-size LMF algorithm is proposed, which adopts an algebraic optimal step size as a variable step size. It is expected that the proposed algorithm also outperforms the conventional fixed step-size LMF. The superiority of the proposed algorithm is confirmed by the simulations in the time invariant and time variant channels.

• Journal of IKEEE
• /
• v.20 no.3
• /
• pp.273-278
• /
• 2016

In HEVC variable block size motion estimation, same search window data are duplicatedly used in each block size. It increases memory bandwidth, and it is difficult to exploit early termination. In this paper, largest block size and its corresponding smaller block sizes with same positions are performed at the same time. It reduces memory bandwidth and computation by reusing search window data and computation results. In the early termination, image quality can be degraded when it determines early termination by observing largest block size only, since smaller block sizes cannot be equally terminated due to their relative positions. So, in this paper, processing order of early termination is changed to perform smaller block sizes in turns. The designed motion estimation engine was described in Verilog HDL and it was synthesized and verified in 0.18um process technology. Its gate count and maximum operating frequency are 36,101 gates and 263.15 MHz, respectively.