• Journal of the Korean Magnetics Society
• /
• v.5 no.5
• /
• pp.376-379
• /
• 1995

Employing the muffin-tin-orbital theory combined with pseudo-potential concepts, we have evaluated hybridization matrix elements between R and T sites in $RT_{2}$ compounds. The matrix elements are calculated with two parameters, the interatomic distance between R and T atoms from the crystal structure data, and the expectation values of the radial distances for the radial wave functions of the ground state charge densities, which are obtained from the linearized muffin-tin orbital band method within the local density approximation. It is found that the R 4f/T 3d hybridization matrix elements decrease with an increasing atomic number from R=Ce to Gd, and that they are smaller in $RNi_{2}$ than in $RCo_{2}$, which are consistent with trends observed in recent photoemission spectroscopy experiments. It is also found that the magnitudes of the hybridization matrix elements in $RFe_{2}$ are comparable to those in $RNi_{2}$.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.25 no.3
• /
• pp.107-116
• /
• 2021

We introduce optimization algorithms using Bregman Divergence for solving non-negative matrix factorization (NMF) problems. Bregman divergence is known a generalization of some divergences such as Frobenius norm and KL divergence and etc. Some algorithms can be applicable to not only NMF with Frobenius norm but also NMF with more general Bregman divergence. Matrix Factorization is a popular non-convex optimization problem, for which alternating minimization schemes are mostly used. We develop the Bregman proximal gradient method applicable for all NMF formulated in any Bregman divergences. In the derivation of NMF algorithm for Bregman divergence, we need to use majorization/minimization(MM) for a proper auxiliary function. We present algorithmic aspects of NMF for Bregman divergence by using MM of auxiliary function.

• Proceedings of the Optical Society of Korea Conference
• /
• 1990.02a
• /
• pp.95-101
• /
• 1990

Parallel optical arithmetic techniques have been developed using the correlation property of optical phase conjugate wave generated by degenerated four wave-mixing. In this paper, conventional rectangular-type coded pattern used for optical logic system is replaced by circular one for effective beam coupling in a photorefractive $BaTiO_3$ material. By adequately adjusting the distance between circular-type pixels of the input pattern and grouping the correlated output, optical binary half addition/subtraction, binary multiplication and, matrix-matrix computation are demonstrated.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.6 no.1
• /
• pp.47-52
• /
• 2002

In this paper we propose a simple decoding algorithm for the 4-ary lexicographic codes (or lexicodes) of length 10 with minimum distance 4, write $S_{10,4}$. It is based on the syndrome decoding method. That is, using a syndrome vector we detect an error and it will be corrected an error from the four parity check equations.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1994.10a
• /
• pp.559-564
• /
• 1994

Recently, a visual servoing for an eye-in-hand robot has become an interesting problem. A distance between a camera and a task object is very useful information for visual servoing. In the previous works for visual servoing, the distance can be obtained from the difference between a reference and a measured feature value of the object such as area on image plane. However, since this feature depends on the object, the reference feature value must be changed when other task object is taken. To overcome this difficulty, this paper presents a novel method for visual servoing. In the proposed method, a blur is used to obtain the distance. The blur, one of the most important features, depends on the focal length of camera. Since it is not affected by the change of object, the reference feature value is not changed although other task object is taken. In this paper, we show a relationship between the distance and the blur, and define the feature jacobian matrix based on camera defocusing to operate the robot. A series of experiments is performed to verify the proposed method.

• Speech Sciences
• /
• v.13 no.4
• /
• pp.177-186
• /
• 2006

In an effort to enhance the quality of feature vector classification and thereby reduce the recognition error rate of the speaker-independent speech recognition, we employ the Mahalanobis distance in the calculation of the similarity measure between feature vectors. It is assumed that the metric matrix of the Mahalanobis distance be diagonal for the sake of cost reduction in memory and time of calculation. We propose that the diagonal elements be given in terms of the variations of the feature vector components. Geometrically, this prescription tends to redistribute the set of data in the shape of a hypersphere in the feature vector space. The idea is applied to the speech recognition by hidden Markov model with fuzzy vector quantization. The result shows that the recognition is improved by an appropriate choice of the relevant adjustable parameter. The Viterbi score difference of the two winners in the recognition test shows that the general behavior is in accord with that of the recognition error rate.

• Journal of information and communication convergence engineering
• /
• v.13 no.2
• /
• pp.74-80
• /
• 2015

In cognitive radios, spectrum sensing plays an important role in accurately detecting the presence or absence of a licensed user. However, the intervention of malicious users (MUs) degrades the performance of spectrum sensing. Such users manipulate the local results and send falsified data to the data fusion center; this process is called spectrum sensing data falsification (SSDF). Thus, MUs degrade the spectrum sensing performance and increase uncertainty issues. In this paper, we propose a method based on the Hausdorff distance and a similarity measure matrix to measure the difference between the normal user evidence and the malicious user evidence. In addition, we use the Dempster-Shafer theory to combine the sets of evidence from each normal user evidence. We compare the proposed method with the k-means and Jaccard distance methods for malicious user detection. Simulation results show that the proposed method is effective against an SSDF attack.

• The Journal of Information Systems
• /
• v.29 no.3
• /
• pp.237-251
• /
• 2020

Purpose The research was studied the hierarchical Hangul emotion index by organizing all the emotions which SNS users are thinking. As a preliminary study by the researcher, the English-based Plutchick (1980)'s emotional standard was reinterpreted in Korean, and a hashtag with implicit meaning on SNS was studied. To build a multidimensional emotion dictionary and classify three-dimensional emotions, an emotion seed was selected for the composition of seven emotion sets, and an emotion word dictionary was constructed by collecting SNS hashtags derived from each emotion seed. We also want to explore the priority of each Hangul emotion index. Design/methodology/approach In the process of transforming the matrix through the vector process of words constituting the sentence, weights were extracted using TF-IDF (Term Frequency Inverse Document Frequency), and the dimension reduction technique of the matrix in the emotion set was NMF (Nonnegative Matrix Factorization) algorithm. The emotional dimension was solved by using the characteristic value of the emotional word. The cosine distance algorithm was used to measure the distance between vectors by measuring the similarity of emotion words in the emotion set. Findings Customer needs analysis is a force to read changes in emotions, and Korean emotion word research is the customer's needs. In addition, the ranking of the emotion words within the emotion set will be a special criterion for reading the depth of the emotion. The sentiment index study of this research believes that by providing companies with effective information for emotional marketing, new business opportunities will be expanded and valued. In addition, if the emotion dictionary is eventually connected to the emotional DNA of the product, it will be possible to define the "emotional DNA", which is a set of emotions that the product should have.

• Health Policy and Management
• /
• v.27 no.3
• /
• pp.229-240
• /
• 2017

Background: This study purposed to analyze the spatial accessibility of women in childbearing age to the healthcare organizations (HCOs) providing delivery services in Gangwon-do. Methods: Network analysis was applied to assess the spatial accessibility based on the travel time and road travel distance. Travel time and travel distance were measured between the location of HCOs and the centroid of the smallest administrative areas, eup, myeon, and dong in Gangwon-do. Korean Transport Database Center provided road network GIS (Geographic Information System) Database in 2015 and it was used to build the network dataset. Two types of network analysis, service area analysis and origin-destination (OD)-cost matrix analysis, applied to the created network dataset. Service area analysis defined all-accessible areas that are within a specified time, and OD-cost matrix analysis measured the least-cost paths from the HCOs to the centroids. The visualization of the number of the HCOs and the number of women in childbearing age on the Ganwon-do map and network analysis were performed with ArcGIS ver. 10.0 (ESRI, Redlands, CA, USA). Results: Twenty HCOs were providing delivery services in Gangwon-do in 2016. Over 50% of the women in childbearing age were aged more than 35 years. Service area analysis found that 89.56% of Gangwon-do area took less than 60 minutes to reach any types of HCOs. For tertiary hospitals, about 74.37% of Gangwon-do area took more than 60 minutes. Except Wonju-si and Hoengseong-gun, other regions took more than 60 minutes to reach the tertiary hospital. Especially, Goseong-gun, Donghae-si, Samcheok-si, Sokcho-si, Yanggu-gun, Cheorwon-gun, and Taebaek-si took more than 100 minutes to the tertiary hospital. Conclusion: This study provided that the accessibility toward the tertiary hospital was limited and it may cause problems in high-risk delivery patients such as over 35 years. Health policy makers will need to handle the obstetric accessibility issues in Gangwon-do.

• Journal of KIISE:Software and Applications
• /
• v.34 no.7
• /
• pp.595-602
• /
• 2007

This paper proposes a method that discriminates signal peptide and predicts the cleavage site of the secretory proteins cleaved by the signal peptidase I. The preprocessing stage uses hydrophobicity scales of amino acids in order to predict the presence of signal sequence and the cleavage site. The preprocessing enhances the performance of the prediction method by eliminating the non-secretory proteins in the early stage of prediction. for the effective use of support vector machine for the signal sequence prediction, the biologically relevant distance between the amino acid sequences is defined by using the hydrophobicity and substitution matrix; the hydrophobicity can be used to Predict the location of amino acid in a cell and the substitution matrix represents the evolutionary relationships of amino acids. The proposed method showed 98.9% discrimination rates from signal sequences and 88% correct rate of the cleavage site prediction on Swiss-Prot release 50 protein database using the 5-fold-cross-validation. In the comparison tests, the proposed method has performed significantly better than other prediction methods.