• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.24 no.1
• /
• pp.65-71
• /
• 2006

There has been equipped wireless network infrastructure making possible to contact mobile computing at buildings, university, airport etc. Due to increase of mobile user dramatically, it raises interest about application and importance of LBS. The purpose of this study is to develop an indoor positioning system which is position of mobile users using Wireless LAN signal strength. We present Euclidean distance model and Bayesian inference model for analyzing position determination. The experimental results showed that the positioning of Bayesian inference model is more accurate than that of Euclidean distance model. In case of static target, the positioning accuracy of Bayesian inference model is within 2 m and increases when the number of cumulative tracking points increase. We suppose, however, Bayesian inference model using 5- cumulative tracking points is the most optimized thing, to decrease operation rate of mobile instruments and distance error of tracking points by movement of mobile user.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.8
• /
• pp.126-135
• /
• 2014

The Euclidean distance between error probability density functions (EDEP) has been used as a performance criterion for supervised adaptive signal processing in impulsive noise environments. One of the drawbacks of the EDEP algorithm is a heavy computational complexity due to the double summation operations at each iteration time. In this paper, a recursive method to reduce its computational burden in the estimation of the EDEP and its gradient is proposed. For the data block size N, the computational complexity for the estimation of the EDEP and its gradient can be reduced to O(N) by the proposed method, while the conventional estimation method has $O(N^2)$. In the performance test, the proposed EDEP and its gradient estimation yield the same estimation results in the steady state as the conventional block-processing method. The simulation results indicates that the proposed method can be effective in practical adaptive signal processing.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.12
• /
• pp.135-144
• /
• 2020

In graph theory, the least-cost path is discovered by searching the shortest path between a start node and destination node. The least cost is calculated as a one-dimensional value that represents the difference in distance or price between two nodes, and the nodes and edges that comprise the lowest sum of costs between the linked nodes is the shortest path. However, it is difficult to determine the shortest path if each node has multiple attributes because the number of cost types that can appear is equal to the number of attributes. In this paper, a shortest path search scheme is proposed that considers multiple attributes using the Euclidean distance to satisfy various user requirements. In simulation, we discovered that the shortest path calculated using one-dimensional values differs from that calculated using the Euclidean distance for two-dimensional attributes. The user's preferences are reflected in multi attributes and it was different from one-dimensional attribute. Consequently, user requirements could be satisfied simultaneously by considering multiple attributes.

• Development and Reproduction
• /
• v.22 no.3
• /
• pp.283-288
• /
• 2018

The author carried out PCR-based genetic platform to investigate the hierarchical polar dendrogram of Euclidean genetic distances of one bastard halibut population, particularly for Paralichthys olivaceus, which was further connected with those of the other fish population, by involving with the precisely designed oligonucleotide primer sets. Eight oligonucleotides primers were used generating excessively alterating fragments, ranging in size of DNA bands from larger than approximately 100 bp to less than 2,000 bp. As regards average bandsharing value (BS) results, individuals from Hampyeong population (0.810) displayed lower bandsharing values than did individuals from Wando population (0.877). The genetic distance between individuals approved the existence of close relationship in the cluster II. Relatively, individuals of one bastard halibut population were fairly related to that of the other fish population, as shown in the polar hierarchical dendrogram of Euclidean genetic distances. The points of a noteworthy genetic distance between two P. olivaceus populations demonstrated this PCR procedure is one of the quite a few means for individuals and/or populations biological DNA investigates, for species security and proliferation of bastard halibut individuals in coastal region of the Korea.

• Development and Reproduction
• /
• v.25 no.1
• /
• pp.59-65
• /
• 2021

The author established a PCR-based genetic platform to examine the hierarchical polar dendrogram of Euclidean genetic distances of one tailfin anchovy population, especially for Coilia nasus, which was further associated with other fish population, by connecting with specifically designed oligonucleotide primer sets. Five oligonucleotide primers were used to generate a total of 260 and 211 scorable fragments in Coilia populations I and II, respectively. The DNA fragments ranged from greater than (approximately) 100 to more than 2,000 bp. The average bandsharing values (BS) of individuals from the anchovy population I (0.693) displayed higher values than individuals from population II (0.675). The genetic distance between individuals established the existence of a close relationship in group II. Comparatively, individuals of one anchovy population were fairly related to other fish populations, as shown in the polar hierarchical dendrogram of Euclidean genetic distances. The noteworthy genetic distance determined between two Coilia nasus populations demonstrates that this PCR technique can be applied as one of the several devices for individuals and/or population biological DNA researches undertaken for safeguarding species and for production of anchovies in the littoral area of Korea.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.533-535
• /
• 2003

The Euclidean distance is sensitive to the absolute offsets of time sequences, so it is not a suitable similarity measure in terms of shape. In this paper. we propose an indexing scheme for efficient matching and retrieval of time sequences based on the minimum distance. The minimum distance can give a better estimation of similarity in shape between two time sequences. Our indexing scheme can match time sequences of similar shapes irrespective of their vortical positions and guarantees no false dismissals

• East Asian mathematical journal
• /
• v.17 no.2
• /
• pp.303-308
• /
• 2001

Let K($z,\gamma$) denote the euclidean curvature of the curve $\gamma$ at the point z. Flinn and Osgood proved that if f is a univalent mapping of the open unit disk D={z:|z|<1} into itself with f(0)=0 and |f'(0)|<1, then $K(0,\gamma){\leq}K(0,f\;o\;\gamma)$ for any $C^2$ curve $\gamma$ on D through the origin with $K(0,\gamma){\geq}4$. In this paper we establish a generalization of the Flinn-Osgood Monotonicity Theorem.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.5
• /
• pp.2390-2395
• /
• 2011

For intersymbol interference (ISI) compensation from communication channels with multi-path fading and impulsive noise, a decision feedback equalizer algorithm that minimizes Euclidean distance of error probability is proposed. The Euclidean distance of error probability is defined as the quadratic distance between the probability error signal and Dirac-delta function. By minimizing the distance with respect to equalizer weight based on decision feedback structures, the proposed decision feedback algorithm has shown to have significant effect of residual ISI cancellation on severe multipath channels as well as robustness against impulsive noise.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.6
• /
• pp.559-566
• /
• 2008

In this paper, we propose a range subsequence matching under dynamic time warping (DTW) distance. We exploit Dual Match, which divides data sequences into disjoint windows and the query sequence into sliding windows. However, Dual Match is known to work under Euclidean distance. We argue that Euclidean distance is a fragile distance, and thus, DTW should be supported by Dual Match. For this purpose, we derive a new important theorem showing the correctness of our approach and provide a detailed algorithm using the theorem. Extensive experimental results show that our range subsequence matching performs much better than the sequential scan algorithm.

• Journal of Communications and Networks
• /
• v.17 no.6
• /
• pp.634-646
• /
• 2015

Assuming perfect channel state information (CSI) at the transmitter and receiver, the optimization problem of maximizing the minimum Euclidean distance between two received signals by a linear precoder is considered for multiple-input multiple-output (MIMO) systems with arbitrary dimensions and arbitraryary quadrature amplitude modulation (QAM) input. A general precoding framework is first presented based on the Gram matrix, which is shown for 2-dimensional (2-D) and 3-dimensional (3-D) MIMO systems when employing the ellipse expanding method (EEM). An extended precoder for high-dimensional MIMO system is proposed following the precoding framework, where the Gram matrix for high-dimensional precoding matrix can be generated through those chosen from 2-D and 3-D results in association with a permutation matrix. A complexity-reduced maximum likelihood detector is also obtained according to the special structure of the proposed precoder. The analytical and numerical results indicate that the proposed precoder outperforms the other precoding schemes in terms of both minimum distance and bit error rate (BER).