• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.10
• /
• pp.11-15
• /
• 2015

In this paper, we introduce three modulation codes of the code rate 1/2 with different minimum distances, respectively, and investigate the performance of the codes according to the minimum distance. We simulate the codes in accordance with blur and misalignment. As the minimum distance increases, the complexity of encoder and decoder also grows. However, it can improve the error correcting capability and shows good performance with blur and misalignment.

• Journal of the Korean Statistical Society
• /
• v.27 no.1
• /
• pp.113-132
• /
• 1998

In this paper, we consider a minimum distance (M.D.) estimation based on kernels for U-statistics. We use Cramer-von Mises type distance function which measures the discrepancy between U-empirical distribution function(d.f.) and modeled d.f. of kernel. In the distance function, we allow various integrating measures, which can be finite, $\sigma$-finite or discrete. Then we derive the asymptotic normality and study the qualitative robustness of M. D. estimates.

• The KIPS Transactions:PartA
• /
• v.16A no.6
• /
• pp.509-518
• /
• 2009

In this paper, a mechanism that produces an approximation edges minimum spanning tree swiftly using virtual nodes called portals dividing given edges into same distance sub-edges. The approximation edges minimum spanning tree can be used in many useful areas as connecting communication lines, road networks and railroad systems. For 3000 random input edges, when portal distance is 0.3, tree building time decreased 29.74% while the length of the produced tree increased 1.8% comparing with optimal edge minimum spanning tree in our experiment. When portal distance is 0.75, tree building time decreased 39.96% while the tree length increased 2.96%. The result shows this mechanism might be well applied to the applications that may allow a little length overhead, but should produce an edge connecting tree in short time. And the proposed mechanism can produce an approximation edge minimum spanning tree focusing on tree length or on building time to meet user requests by adjusting portal distance or portal discard ratio as parameter.

• Journal of the Korean Data and Information Science Society
• /
• v.16 no.4
• /
• pp.1159-1165
• /
• 2005

Basu et al. (1998) proposed a new density-based estimator, called the minimum density power divergence estimator (MDPDE), which avoid the use of nonparametric density estimation and associated complication such as bandwidth selection. Woodward et al. (1995) examined the minimum Hellinger distance estimator (MHDE), proposed by Beran (1977), in the case of estimation of the mixture proportion in the mixture of two normals. In this article, we introduce the MDPDE for a mixture proportion, and show that both the MDPDE and the MHDE have the same asymptotic distribution at a model. Simulation study identifies some cases where the MHDE is consistently better than the MDPDE in terms of bias.

• Journal of Ocean Engineering and Technology
• /
• v.20 no.6 s.73
• /
• pp.82-87
• /
• 2006

Numerical analysis is performed on the wave transmission coefficient of various crown widths of the double-submerged breakwater and the triple-submerged breakwater, varying the distance between submerged breakwaters. The finite element method is used, and the fluid motion is considered as linearized two-dimensional potential flow. In case of the double- and triple-submerged breakwaters, as the width of submerged breakwater increases, the minimum wave transmission coefficient decreases and the wave period at which the minimum wave transmission coefficient occurs moves to a longer wave period the distance between submerged breakwaters at which the minimum wave transmission coefficient occurs becomes larger.

• Journal of Institute of Control, Robotics and Systems
• /
• v.3 no.5
• /
• pp.461-468
• /
• 1997

A real-time collision-free trajectory control method for dual arm robot system is proposed. The proposed method is composed of two stages; one is to calculate the minimum distance between two robot arms and the other is to control the trajectories of the robots to ensure collision-free motions. The calculation of minimum distance between two robots is, also, composed of two steps. To reduce the calculation time, we, first, apply a simple modeling technique to the robots arms and determine the interested part of the robot arms. Next, we apply more precise modeling techniques for the part to calculate the minimum distance. Simulation results show that the whole algorithm runs within 0.05 second using Pentium 100MHz PC.

• Journal of Advanced Marine Engineering and Technology
• /
• v.40 no.9
• /
• pp.847-851
• /
• 2016

Due to global warming it is estimated that the arctic ocean route will be avaliable and traffic will increase by approximately year 2030. However, most navigation in the arctic is based on the ice breaker captains'orders, there is no exact measurement of convoy speed and distance between ships. So, this research was conducted to find out the minimum safe separation distance and minimum breaking distance via ship controling simulations, and the results are as stated. For breaking distances, for ships that have a lead distance which is 2~4 times the width of the ship and traveling less than 7 knots, crash astern and crash astern & hard rudder showed no significant difference. But ships traveling at 10 knots there was a decrease in breaking distance of 1L, from 3.5L to 2.5L. By analyzing 10 subject ships by crash astern the breaking distance for 5 knots is 0.98L~1.8L, for 8 knots is 1.9L~4.0L. The minimum safe separation distance in narrow sea-ways is 6L, but as the arctic sea-way is only one-way 3L is required. As the result, it is found that in the arctic the safe escort speed is less than 5 knots, if the escort speed is 8knots or more and by using crash astern & hard rudder to break the safe distance should be kept at 3.4L.

• Communications for Statistical Applications and Methods
• /
• v.12 no.1
• /
• pp.149-167
• /
• 2005

The minimum disparity estimators introduced by Lindsay and Basu (1994) are studied empirically. An extensive simulation in this paper provides a location estimate of the small sample and supplies empirical evidence of the estimator performance for the univariate contaminated normal model. Empirical results show that the minimum generalized negative exponential disparity estimator (MGNEDE) obtains high efficiency for small sample sizes and dominates the maximum likelihood estimator (MLE) and the minimum blended weight Hellinger distance estimator (MBWHDE) with respect to efficiency at the contaminated model.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.1
• /
• pp.1-10
• /
• 2001

In order to generate the gray scale image by the binary state imaging devices such as a digital printer, the gray scale image needs to be converted into the binary image by the halftoning techniques. This paper presents a new error diffusion technique to achieve the homogeneous dot distributions on the binary images. In this paper,'the minimum pixel distance'from the current pixel under binarization to the nearest minor pixel is defined first. Also, the gray levels of the input image are converted into a new variable based on the principal distance for the error diffusion. In the proposed method, the difference in the principal distances is utilized for the error propagation, whereas the gray level difference due to the binarization is diffused to the neighboring pixels in the existing error diffusion techniques. The quantization is accomplished by comparing the updated principal distance with the minimum pixel distance. In order to calculate the minimum pixel distance, MPOA(Minor Pixel Offset Array) is employed to reduce the computational loads and memory resources.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.15 no.8
• /
• pp.639-647
• /
• 1990

Dynamic time warp(DTW) needs for interative calculations and the design of PE cell suitable for the operations is very important. Accordingly, this paper aims at the real time recognition design which enables large dictionary hardware realization using DTW algorithm. The DTW PE cell is seperated into three large blocks. "MIN" is the one block for counting accumulated minimum distance, "ADD" block calculates these minimum distances, and "ABS" seeks for the absolute values to the total sum of local distances. We have accomplisehd circuit design and verification for the MIN blocks, and performed MIN layout and DRC(design rule check) using 3um CMOS N-Well rule base.ing 3um CMOS N-Well rule base.