• 충청수학회지
• /
• 제24권2호
• /
• pp.303-311
• /
• 2011

Every topology is generated by a quasi-uniform distance system. The quasi-uniform distance system is a uniform distance system. The topology is uniformizable if and only if it is generated by the uniform distance system with the symmetric distance function.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제19권4호
• /
• pp.337-347
• /
• 2012

The taxicab distance and Chinese-checker distance in the plane are practical distance notions with a wide range of applications compared to the Euclidean distance. The ${\alpha}$-distance was introduced as a generalization of these two distance functions. In this paper, we study alpha circle, trigonometry, and the area of a triangle in the plane with ${\alpha}$-distance.

• 지식경영연구
• /
• 제18권3호
• /
• pp.163-178
• /
• 2017

Recent advances in technology are evolving to enable individuals to perform various activities necessary for their lives, without being constrained by physical, temporal, and spatial constraints. The online services and experiences that originated from solving the discomfort in the actual offline space have created the newness that can only be experienced in the digital world and furthermore uniquely new experiences in actual space as well. While many previous studies have suggested several interpretations of unique individual behaviors in virtual environments, a recent research approaches virtuality as an interesting perspective of the change of thinking style. Virtuality is defined as how far apart we are from everyday reality, and if the individual faces a situation far from reality, the psychological distance of the individual becomes distant and ultimately leads to the thinking style of high construal level. Otherwise, it is said to have a relatively low construal level of thinking style. In this study, I try to confirm the virtual distance as the role of psychological distance in new virtual contexts. Simultaneously considering temporal distance, which are most used in psychological distance, and virtual distance based on virtuality, this study tries to find whether the effect of virtual distance on product attitude is the same as that of temporal distance and check the relationship between virtual distance and temporal distance in the context of consumers' product evaluations depending on product information type.

• Journal of Korea Trade
• /
• 제25권4호
• /
• pp.60-87
• /
• 2021

Purpose - This study examines the role of e-commerce resulting from technological innovation as a new approach toward internationalization. We study the relationship between e-commerce export and country distance, measured in CAGE distance, which has hindered traditional internationalization. As a control variable, entrepreneurship was introduced to check the moderating effect on the relationship between country distance and e-commerce export. Design/methodology - Based on empirical analysis, e-commerce exports from the Republic of Korea to 96 countries were used as dependent variables. First, hierarchical regression analysis was conducted to test the hypothesis about each country's distance, measured by CAGE distance, and each dimension of CAGE, on e-commerce exports. Next, the hypothesis was tested through the interaction term to examine the moderating effect of entrepreneurship. Findings - The analysis showed that the hypothesis, which postulated e-commerce exports as affected negatively by the country's distance, was supported but not that all CAGE dimensions affected it. Specifically, geographical distance and economic distance have negative effects, but cultural distance and administrative distance did not affect e-commerce exports. Thus, in contrast to the expectation that distance restrictions in e-commerce would not exist, this study confirmed that distance still matters to internationalization and that entrepreneurship can mitigate the adverse effects. Originality/value - Through these results, when export firms try to enter new markets and start internationalization through e-commerce, the entrepreneurship of the importing country should be considered.

• Journal of Information Processing Systems
• /
• 제16권5호
• /
• pp.1158-1168
• /
• 2020

The distance vector-hop wireless sensor node location method is one of typical range-free location methods. In distance vector-hop location method, if a wireless node A can directly communicate with wireless sensor network nodes B and C at its communication range, the hop count from wireless sensor nodes A to B is considered to be the same as that form wireless sensor nodes A to C. However, the real distance between wireless sensor nodes A and B may be dissimilar to that between wireless sensor nodes A and C. Therefore, there may be a discrepancy between the real distance and the estimated hop count distance, and this will affect wireless sensor node location error of distance vector-hop method. To overcome this problem, it proposes a wireless sensor network node location method by modifying the method of distance estimation in the distance vector-hop method. Firstly, we set three different communication powers for each node. Different hop counts correspond to different communication powers; and so this makes the corresponding relationship between the real distance and hop count more accurate, and also reduces the distance error between the real and estimated distance in wireless sensor network. Secondly, distance difference between the estimated distance between wireless sensor network anchor nodes and their corresponding real distance is computed. The average value of distance errors that is computed in the second step is used to modify the estimated distance from the wireless sensor network anchor node to the unknown sensor node. The improved node location method has smaller node location error than the distance vector-hop algorithm and other improved location methods, which is proved by simulations.

• Communications for Statistical Applications and Methods
• /
• 제20권1호
• /
• pp.23-28
• /
• 2013

We propose a version of Cook's distance (called local distance) in the multivariate linear model. The proposed version is a matrix, while the existing version of Cook's distance (called global distance) is a scalar. The existing Cook's distance is the trace of the proposed Cook's distance. In addition, we argue that the proposed Cook's distance has a more natural extension of the Cook's distance in the univariate linear model than the existing Cook's distance. An illustrative example based on a real data set is given.

• 대한수학회지
• /
• 제37권2호
• /
• pp.269-284
• /
• 2000

We discuss completeness with respect to the Caratheodory distance, the Kobayashi distance and the Beraman distance, respectively.

• 한국CDE학회논문집
• /
• 제15권2호
• /
• pp.115-123
• /
• 2010

We present an efficient algorithm for computing the Hausdorff distance between two planar curves. The algorithm is based on an efficient trimming technique that eliminates the curve domains that make no contribution to the final Hausdorff distance. The input curves are first approximated with biarcs within a given error bound in a pre-processing step. Using the biarc approximation, the distance map of an input curve is then approximated and stored into the graphics hardware depth-buffer by rendering the distance maps (represented as circular cones) of the biarcs. We repeat the same procedure for the other input curve. By sampling points on each input curve and reading the distance from the other curve (stored in the hardware depth-buffer), we can easily estimate a lower bound of the Hausdorff distance. Based on the lower bound, the algorithm eliminates redundant curve segments where the exact Hausdorff distance can never be obtained. Finally, we employ a multivariate equation solver to compute the Hausdorff distance efficiently using the remaining curve segments only.

• International Journal of Contents
• /
• 제11권2호
• /
• pp.9-14
• /
• 2015

We propose a new distance measure between 2-dimensional points to provide a total order for an entire point set and to reflect the correct geometric meaning of the naturalness of the point ordering. In general, there is no total order for 2-dimensional point sets, so curve reconstruction algorithms do not solve the self-intersection problem because the distance used in the previous methods is the Euclidean distance. A natural distance based on Brownian motion was previously proposed to solve the self-intersection problem. However, the distance reflects the wrong geometric meaning of the naturalness. In this paper, we correct the disadvantage of the natural distance by introducing a polar-natural distance, and we also propose a new curve reconstruction algorithm that is based on the polar-natural distance. Our experiments show that the new distance adequately reflects the correct geometric meaning, so non-simple curve reconstruction can be solved.

• 정보처리학회논문지D
• /
• 제18D권5호
• /
• pp.323-328
• /
• 2011

정확한 내용 기반 이미지 검색을 위하여 Earth mover's distance와 Optimal color composition distance와 같은 거리함수들이 제안되었다. 이 거리함수들은 정확도가 높은 검색 결과를 가져오지만 검색 시간이 매우 크기 때문에 대용량 데이터베이스에서 사용하기 어렵다는 문제점을 가지고 있다. 본 논문에서는 이러한 문제를 해결하기 위하여 선형 시간에 근사 Earth mover's distance를 구하기 위한 새로운 거리 함수를 제안한다. 제안하는 방법은 선형 시간에 두 이미지의 거리를 계산하기 위하여 공간 채움 곡선을 이용한다. 다양한 실험을 통하여 본 논문에서 제안하는 방법의 우수성을 검증한다. 실험 결과, 제안하는 기법이 Earth mover's distance에 비해 약 160배 정도의 검색 속도 향상 효과를 보이면서도 매우 유사한 결과를 검색하는 것으로 나타났다.