• Korean Journal of Acupuncture
• /
• v.33 no.1
• /
• pp.18-32
• /
• 2016

Objectives : This study aims to analyze the co-occurrence of pathological symptoms and corresponding acupoints as documented by the comprehensive acupuncture and moxibustion records in the classical texts of Far East traditional medicine as an aid to a more efficient understanding of the tacit treatment principles of ancient physicians. Methods : The Classic of Nourishing Life with Acupuncture and Moxibustion(Zhenjiu Zisheng Jing; hereinafter ZZJ) was selected as the primary reference book for the analysis. The pathology-acupoint co-occurrence analysis was performed by applying 4 values of vector space measures(weighted Euclidean distance, Euclidean distance, $Cram\acute{e}r^{\prime}s$ V and Canberra distance), which measure the distance between the observed and expected co-occurrence counts, and 3 values of probabilistic measures(association strength, Fisher's exact test and Jaccard similarity), which measure the probability of observed co-occurrences. Results : The treatment records contained in ZZJ were preprocessed, which yielded 4162 pathology-acupoint sets. Co-occurrence was performed applying 7 different analysis variables, followed by a prediction simulation. The prediction simulation results revealed the Weighted Euclidean distance had the highest prediction rate with 24.32%, followed by Canberra distance(23.14%) and association strength(21.29%). Conclusions : The weighted Euclidean distance among the vector space measures and the association strength among the probabilistic measures were verified to be the most efficient analysis methods in analyzing the correlation between acupoints and pathologies found in the classical medical texts.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.7 no.2
• /
• pp.41-48
• /
• 1982

This paper presents an efficient algorithm for finding a new facility(center) in the Euclidean plane in accordance with minimax criterion: that is, the facility is located to minimize the maximum weighted Euclidean distance. The method given in this paper involves computational geometry. Some possible extensions of this problem are also discussed.

• Journal of the Korea Society for Simulation
• /
• v.14 no.3
• /
• pp.137-146
• /
• 2005

In parametric approach to a signature verification, it generally uses so many redundant features unsuitable for each individual signature that it causes harm, instead. This paper proposes a method of determining personalized weights of a feature set in signature verification with parametric approach by identifying the characteristics of each feature. For an individual signature, we define a degree of how difficult it is for any other person to forge the one's (called 'DFD' as the Degree of Forgery Difficulty). According to the statistical characteristics and the intuitional characteristics of each feature, the standard features are classified into four types. Four types of DFD functions are defined and applied into the distance calculation as a personalized weight factor. Using this method, the error rate of signature verification is reduced and the variation of the performance is less sensitive to the changes of decision threshold.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.10
• /
• pp.1422-1432
• /
• 1993

Nonlinear mapping function of the HCNN( Hidden Control Neural Network ) can change over time to model the temporal variability of a speech signal by combining the nonlinear prediction of conventional neural networks with the segmentation capability of HMM. We have two things in this paper. first, we showed that the performance of the HCNN is better than that of HMM. Second, the HCNN with its prediction error measure given by weighted distance is proposed to use suitable distance measure for the HCNN, and then we showed that the superiority of the proposed system for speaker-independent speech recognition tasks. Weighted distance considers the differences between the variances of each component of the feature vector extraced from the speech data. Speaker-independent Korean digit recognition experiment showed that the recognition rate of 95%was obtained for the HCNN with Euclidean distance. This result is 1.28% higher than HMM, and shows that the HCNN which models the dynamical system is superior to HMM which is based on the statistical restrictions. And we obtained 97.35% for the HCNN with weighted distance, which is 2.35% better than the HCNN with Euclidean distance. The reason why the HCNN with weighted distance shows better performance is as follows : it reduces the variations of the recognition error rate over different speakers by increasing the recognition rate for the speakers who have many misclassified utterances. So we can conclude that the HCNN with weighted distance is more suit-able for speaker-independent speech recognition tasks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.1
• /
• pp.268-278
• /
• 2017

In this paper, we propose two novel detection schemes with low-complexity based on the unified receiver architecture which minimizes a fundamental tradeoff at rate-energy region in SWIPT system. The proposed detection schemes are twofold: The two-stage detection scheme and Euclidean distance combination detection scheme. The two-stage detection scheme detects amplitude information of symbols from rectified signals for energy harvesting. In the sequel, it detects symbols based on phase information of baseband signals for information decoding. The Euclidean distance combination detection scheme detects symbols using linear positive-weighted sum of two metrics: Euclidean distance based on baseband signals for information decoding and Euclidean distance based on rectified signals for energy harvesting. For numerical results, we confirm that the proposed detection scheme can achieve better performance than the conventional scheme in terms of symbol error rate, symbol success rate-energy region and achievable rate-energy region.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.396-399
• /
• 2009

In this paper, we present a method to define a color similarity between color images using Octree-based quantization and similar color integration. The proposed method defines major colors from each image using Octree-based quantization. Two color palettes to consist of major colors are compared based on Euclidean distance and similar color bins between palettes are matched. Multiple matched color bins are integrated and major colors are adjusted. Color histogram based on the color palette is constructed for each image and the difference between two histograms is computed by the weighted Euclidean distance between the matched color bins in consideration of the frequency of each bin. As an experiment to validate the usefulness, we discriminated the same clothing from CCD camera images based on the proposed color similarity analysis. We retrieved the same clothing images with the success rate of 88 % using only color analysis without texture analysis.

• International Journal of CAD/CAM
• /
• v.7 no.1
• /
• pp.91-101
• /
• 2007

To understand the structure of molecules, various computational methodologies have been extensively investigated such as the Voronoi diagram of the centers of atoms in molecule and the power diagram for the weighted points where the weights are related to the radii of the atoms. For a more improved efficiency, constructs like an $\alpha$-shape or a weighted $\alpha$-shape have been developed and used frequently in a systematic analysis of the morphology of molecules. However, it has been recently shown that $\alpha$-shapes and weighted $\alpha$-shapes lack the fidelity to Euclidean distance for molecules with polysized spherical atoms. We present the theory as well as algorithms of $\beta$-shape and $\beta$-complex in $\mathbb{R}^3$ which reflects the size difference among atoms in their full Euclidean metric. We show that these new concepts are more natural for most applications and therefore will have a significant impact on applications based on particles, in particular in molecular biology. The theory will be equivalently useful for other application areas such as computer graphics, geometric modeling, chemistry, physics, and material science.

• International Journal of Computer Science & Network Security
• /
• v.22 no.1
• /
• pp.139-148
• /
• 2022

Research into wireless sensor networks (WSNs) is a trendy issue with a wide range of applications. With hundreds to thousands of nodes, most wireless sensor networks interact with each other through radio waves. Limited computational power, storage, battery, and transmission bandwidth are some of the obstacles in designing WSNs. Clustering and routing procedures have been proposed to address these concerns. The wireless sensor network's most complex and vital duty is routing. With the Greedy Perimeter Stateless Routing method (GPSR), an efficient and responsive routing protocol is built. In packet forwarding, the nodes' locations are taken into account while making choices. In order to send a message, the GPSR always takes the shortest route between the source and destination nodes. Weighted directed graphs may be constructed utilising four distinct distance metrics, such as Euclidean, city block, cosine, and correlation distances, in this study. NS-2 has been used for a thorough simulation. Additionally, the GPSR's performance with various distance metrics is evaluated and verified. When compared to alternative distance measures, the proposed GPSR with correlation distance performs better in terms of packet delivery ratio, throughput, routing overhead and average stability time of the cluster head.

• The Journal of the Korea Contents Association
• /
• v.19 no.2
• /
• pp.186-193
• /
• 2019

This article compares the weighted geometric median with the centroid, from the question why they use the centroid when they would find the single facility location(the weighted geometric median) which minimize the sum of weighted Euclidean distances in some text books and papers. Firstly, we show that the demand point whose volume of demand exceeds the half of total demand is the weighted geometric median differently from the centroid, and we examine the weighed geometric median when every demand point is located on a line. Meanwhile, we could simply see that the geometric median and the centroid are coincident in the special case when every demand point is located at a vertex of a regular polygon, and every volume of demand is equal. Furthermore, the geometric medians of convex tetragons could be simply attained unlike triangles.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.2
• /
• pp.126-134
• /
• 1990

In this study, eight function discrimination and recognition of the EMG signal from the biceps and triceps of 4 subjects were executed, using the Euclidean and weighted cepstral distance measure with LPC cepstrum coefficients. In case of Euclidean cepstral distance measure, as the number of LPC cepstrum coefficients was increased in 8, 10, 12, 14 the recognition rates of functions are 94.69, 95.63, 96.56, and 96.88[%], respectively, but increasing rates of recognition were inclined to decrease. In case of weighted cepstral distance measure, when the number of LPC cepstrum coefficients was 8, 10, 12 and 14, the recognition rates of functions were 91.88, 95, 99.69, and 96.63[%], respectively.