• Journal of Information Processing Systems
• /
• v.10 no.1
• /
• pp.69-80
• /
• 2014

The free distance of (n, k, l) convolutional codes has some connection with the memory length, which depends on not only l but also on k. To efficiently obtain a large memory length, we have constructed a new class of (2k, k, l) convolutional codes by (2k, k) block codes and (2, 1, l) convolutional codes, and its encoder and generation function are also given in this paper. With the help of some matrix modules, we designed a single structure Viterbi decoder with a parallel capability, obtained a unified and efficient decoding model for (2k, k, l) convolutional codes, and then give a description of the decoding process in detail. By observing the survivor path memory in a matrix viewer, and testing the role of the max module, we implemented a simulation with (2k, k, l) convolutional codes. The results show that many of them are better than conventional (2, 1, l) convolutional codes.

• Korean Management Science Review
• /
• v.11 no.3
• /
• pp.55-65
• /
• 1994

Given the flow matrix, plant size and department sizes, the algorithms in this paper provide the layout with rectilinear distance. To construct automated facility design, cut tree approach is employed. A branch and bound computer code developed by Tillinghast is modifided to find the feasible fits of departments without shape distortion in the plant rectangle.

• 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.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.18 no.1
• /
• pp.57-60
• /
• 2008

Since human listening is very sensitive to sound, for evaluating of a sound quality is required. Therefore, in the analysis for each situation, the sound evaluation is composed with sound quality factor. My 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 highly dependent on jury test and have many difficulties due to various environmental factors. 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.

• Communications for Statistical Applications and Methods
• /
• v.6 no.1
• /
• pp.237-249
• /
• 1999

It has been issued that the irreconcilability of the classical test for a point null and standard Bayesian formulation for testing such a point null. The infimum of the posterior probability of the null hypothesis is used as measure of evidence against the null hypothesis in Bayesian approach; here the infimum is over the family of priors on the alternative hypotheses which includes all density that are a priori reasonable. For iid observations from a multivariate normal distribution in $\textit{p}$ dimensions with an unknown mean and a covariance matrix propotional to the Identity we consider the difference and the Wolfowitz distance of the distributions of the P-value and the lower bound of the posterior probability over the family of all normal priors. The Wolfowitz distance is interpreted as the average difference of the quantiles of the two distrbutions.

• Communications for Statistical Applications and Methods
• /
• v.22 no.4
• /
• pp.321-331
• /
• 2015

The K-means clustering algorithm is a popular and widely used method for clustering. For covariance matrices, we consider a geodesic clustering algorithm based on the K-means clustering framework in consideration of symmetric positive definite matrices as a Riemannian (non-Euclidean) manifold. This paper considers a geodesic clustering algorithm for data consisting of symmetric positive definite (SPD) matrices, utilizing the Riemannian geometric structure for SPD matrices and the idea of a K-means clustering algorithm. A K-means clustering algorithm is divided into two main steps for which we need a dissimilarity measure between two matrix data points and a way of computing centroids for observations in clusters. In order to use the Riemannian structure, we adopt the geodesic distance and the intrinsic mean for symmetric positive definite matrices. We demonstrate our proposed method through simulations as well as application to real financial data.

• Kyungpook Mathematical Journal
• /
• v.62 no.2
• /
• pp.389-405
• /
• 2022

We study the Fisher Information (FI) of m-generalized order statistics (m-GOSs) and their concomitants about the shape-parameter vector of the Iterated Farlie-Gumbel-Morgenstern (IFGM) bivariate distribution. We carry out a computational study and show how the FI matrix (FIM) helps in finding information contained in singly or multiply censored bivariate samples from the IFGM. We also run numerical computations about the FIM for the sub-models of order statistics (OSs) and sequential order statistics (SOSs). We evaluate FI about the mean and the shape-parameter of exponential and power distributions, respectively. Finally, we investigate the Kullback-Leibler distance in concomitants of m-GOSs.

• Journal of Korea Multimedia Society
• /
• v.4 no.3
• /
• pp.215-221
• /
• 2001

In this paper, we propose a algorithm that apply different weight-sampling values according to the directions of the contour to reduce errors that can arise in extracting the feature of an contoured object. Especially, it 8is designed to have invariant property under the circumstances like the rotation, transition and scaling. The output matrix of feature set is made through the size function of the proposed algorithm, and the euclidean distance between the output matrix and that of the original image is calculated. Experimental result shows that the proposed algorithm reduces the euclidean distance between the original image and the changed image-by 57% in rotation and by 91% in scaling.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.121-124
• /
• 1996

In general, cellular manufacturing system can be constructed by the following two steps. The first step forms machine cells and part families, and the second step determines cell layout based on the result of first step. Cell layout has to be considered when cell is formed becauese the result of cell formation affects it. This paper presents a cell formation algorithm and proposes an integrated mathematical model for cell formation and cell layout. The cell formation algorithm minimizes the number of exceptional element in cellular manufacturing system. New concept for similarity and incapability is introduced, based on machine-operation incidence matrix and part-operation incidence matrix. One is similarity between the machines, the other is similarity between preliminary machine cells and machines. The incapability identifies relations between machine cells and parts. In this procedure, only parts without an exceptional element are assigned to machine cell. Bottleneck parts are considered with cell layout design in an integrated mathematical model. The integrated mathematical model determines cell layout and assigns bottleneck parts to minimize the number of exceptional element and intercell moving distance, based on linearixed 0-1 integer programming. The proposed algorithm is illustrated by using numerical examples.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.33 no.2 s.109
• /
• pp.1-15
• /
• 2005

The purpose of this paper is to classify zones disrupting green spaces in city and to evaluate of their grades. The results are as follows; L There were 158 green spaces in Dalsu-gu. The 158 green spaces were classified 4 patterns and minutely classified into 9 types. The area of the 'nature park' type was turned out to be $70.1\%$ of the total area of green spaces in Dalsu-gu, then the type was considered as a important part of the green-network in Dalsu-gu. The 9 types such as 'nature park', 'river', 'neighborhood park' and so on were analysed with ecological indexes. 2. Based on the ecological indexes of 'ratio of the green space', 'features of the surrounding matrix' and 'travel distance of the wildlives' , zones disrupting green spaces were ranging widely and re-divided to 236 sectors. 3. The analysis results for classifying the grades were that grade I appeared over industrial complex and housing complex widely. On the other side, grade II and III appeared around or between nature park and neighboring park Consequently, it was necessary to consider the grade and make zones disrupting green spaces into green space for improving green network.