• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2007.11a
• /
• pp.318-321
• /
• 2007

Since human listening is very sensitive to sound, a subjective index of a sound quality is required. Therefore, in the analysis for each situation, the sound evaluation is composed with sound quality factor. Many researchers spends their effort to make a more reliable and more accurate of sound in term of sound quality index for various system noise. The previous methods to evaluation of the SQ about vehicle interior noise are linear regression analysis of subjective SQ metrics by statistics and the estimation of the subjective SQ values by neural network. But these are so depended on jury test very much that they result in many difficulties. So, to reduce jury test weight, we suggested a new method using Mahalanobis distance for SQ evaluation. Threrefore, in this study Mahalanobis distance for the vehicle interior noise was derived using the objective SQ except jury test. Finnaly, the results of the SQ evaluation was analyzed discrimination between reference and abnormal group.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.2
• /
• pp.633-647
• /
• 2018

We compare the Lee and homogenous weights over the chain ring $S_{q,m}={\mathbb{F}}_q[u]/(u^m)$ by computing the minimum distance of random codes for small values of n, q, m.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.6
• /
• pp.2011-2023
• /
• 2015

This paper determines the structures of one-homogeneous weight codes over finite chain rings and studies the algebraic properties of these codes. We present explicit constructions of one-homogeneous weight codes over finite chain rings. By taking advantage of the distance-preserving Gray map defined in [7] from the finite chain ring to its residue field, we obtain a family of optimal one-Hamming weight codes over the residue field. Further, we propose a generalized method that also includes the examples of optimal codes obtained by Shi et al. in [17].

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.53.5-53
• /
• 2001

In continuous galvanizing process at steel making plant, coating weight on the surface of strip that pass through air knife is controlled by the pressure at the chamber of air knife and the gap between the nozzle of air knife and strip. The pressure can be easily measured and controlled. But it is difficult to measure the distance between Air knife nozzle and strip, and also difficult to decide how much distance air knife move. Because, the gap between nozzle and strip varies with the height of air knife, intermesh of stabilizing roll and welding of strips that have different thickness. In this research, we developed a gap sensor that can measure the relative distance between Air knife nozzle and strip. And several tests are performed to find optimal condition for application at real plant. We performed test in which the possibility of the sensor to apply ...

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.39 no.4
• /
• pp.369-374
• /
• 2015

In order to efficiently optimize the problem involving complex computer codes or computationally expensive simulation, surrogate models are widely used. Because their accuracy significantly depends on sample points, many experimental designs have been proposed. One approach is the sequential design of experiments that consider existing information of responses. In earlier research, the correlation coefficients of the kriging surrogate model are introduced as weight parameters to define the scaled distance between sample points. However, if existing information is incorrect or lacking, new sample points can be misleading. Thus, our goal in this paper is to propose a weight function derived from correlation coefficients to generate new points robustly. To verify the performance of the proposed method, several existing sequential design methods are compared for use as mathematical examples.

• 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 The Korean Society of Grassland and Forage Science
• /
• v.20 no.2
• /
• pp.91-96
• /
• 2000

This research was concluded under dryland condition in Thrace region in 1994-1995 growing season. This experiment was arranged in randomised block design with three replications. Yield and some important yield components (plant height, number of pods per plant, number of seeds per pod and 1000 seed weight) were determined. According to the results, it can be concluded that the best sowing rate and row distance of chickling vetch for the region are $100\;seed/\textrm{m}^2$ and 20 cm, respectively.

• Communications for Statistical Applications and Methods
• /
• v.13 no.3
• /
• pp.719-732
• /
• 2006

A set of clustering algorithms with proper weight on the formulation of distance which extend to mixed numeric and multiple binary values is presented. A simple matching and Jaccard coefficients are used to measure similarity between objects for multiple binary attributes. Similarities are converted to dissimilarities between i th and j th objects. The performance of clustering algorithms with balancing weight on different similarity measures is demonstrated. Our experiments show that clustering algorithms with application of proper weight give competitive recovery level when a set of data with mixed numeric and multiple binary attributes is clustered.

• PNF and Movement
• /
• v.16 no.3
• /
• pp.345-353
• /
• 2018

Purpose: The purpose of the present study was to compare the effects of proprioceptive neuromuscular facilitation (PNF) and static stretching on weight distribution and flexibility for trunk flexion. Method: Sixty participants who had no musculoskeletal disorders were recruited from a local university within six months of this study. The participants were randomly assigned to a PNF stretching group (N=30) and a static stretching group (N=32). For the pre-and post-measurement design, the left-right weight distribution, anterior-posterior weight distribution, and finger-to-floor distance (FFD) were measured before and after the stretching interventions. Result: The FFD results were significantly improved after the interventions, regardless of the group differentiation (p<0.05). The PNF stretching intervention significantly increased the differences between anterior and posterior weight distribution compared to the static stretching group (p<0.05). Conclusions: Both the PNF and static stretching interventions could improve flexibility for trunk flexion mobility. Although the PNF intervention improved the weight distribution in the anterior-posterior direction, further research is required to investigate the various PNF interventions on left-and-right and anterior-posterior weight distribution.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1346-1349
• /
• 2004

In this paper, we have proposed the new link-weight calculating function using for routing decision in WDM networks. The proposed link-weight calculating functions includes following factors those are available wavelengths per link, distance loss, total wavelengths, and limited wavelength conversion. The calculated link-weight is applied into the algorithm of routing decision in order to determine the available lightpath that qualifies user requests. The objective is to improve the performance of wavelengths assignment with fast determining the suitable lightpath by using the proposed link-weights calculating function. The analytical model of WDM switching networks is introduced for numerical analysis. The link-weight calculating function is performed. Finally, the performance of proposed algorithm is displayed with numerical results in term of the blocking probability, the probability that connection requests from users are rejected due to there are no available lightpath to be assigned for them. It is also shown that the blocking probability is varied in depending on the number of available wavelengths and the degree of wavelength conversion. The numerical results also show that the proposed link-weight calculating function is more cost-effective choice for the routing decision in WDM switching networks.