• Title/Summary/Keyword: euclidean

Search Result 1,111, Processing Time 0.031 seconds

A Study on Data Fusion of ARPA/AIS using Euclidean Distance (Euclidean Distance를 이용한 ARPA/AIS 데이터 융합에 대한 연구)

  • Kim, Young-Ki;Park, Gyei-Kark
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.21 no.6
    • /
    • pp.775-780
    • /
    • 2011
  • GPS, ARPA, AIS, NAVTEX, VHF as modern aids-to-navigation equipments improve the safe navigation and help to reach a reduction in marine accidents by providing images, numeric values, texts, audio-based information for mates, However, we also noticed that it's complicate and difficult for a mate to acquire and analyze such information from these devices while he should devote himself to bridge watchkeeping especially in the urgent situation. Language is another way to get information and free the eyes and hands, so, to solve the problem above, we are trying to propose a new aids-to-navigation system, which can understand and merge multimedia marine safety information, analyze the situation and provide the necessary information in language. In this paper, we try to fuse data of ARPA/AIS using Euclidean distance for providing integrated information.

Novel Class of Entanglement-Assisted Quantum Codes with Minimal Ebits

  • Dong, Cao;Yaoliang, Song
    • Journal of Communications and Networks
    • /
    • v.15 no.2
    • /
    • pp.217-221
    • /
    • 2013
  • Quantum low-density parity-check (LDPC) codes based on the Calderbank-Shor-Steane construction have low encoding and decoding complexity. The sum-product algorithm(SPA) can be used to decode quantum LDPC codes; however, the decoding performance may be significantly decreased by the many four-cycles required by this type of quantum codes. All four-cycles can be eliminated using the entanglement-assisted formalism with maximally entangled states (ebits). The proposed entanglement-assisted quantum error-correcting code based on Euclidean geometry outperform differently structured quantum codes. However, the large number of ebits required to construct the entanglement-assisted formalism is a substantial obstacle to practical application. In this paper, we propose a novel class of entanglement-assisted quantum LDPC codes constructed using classical Euclidean geometry LDPC codes. Notably, the new codes require one copy of the ebit. Furthermore, we propose a construction scheme for a corresponding zigzag matrix and show that the algebraic structure of the codes could easily be expanded. A large class of quantum codes with various code lengths and code rates can be constructed. Our methods significantly improve the possibility of practical implementation of quantum error-correcting codes. Simulation results show that the entanglement-assisted quantum LDPC codes described in this study perform very well over a depolarizing channel with iterative decoding based on the SPA and that these codes outperform other quantum codes based on Euclidean geometries.

An Effective Method for Approximating the Euclidean Distance in High-Dimensional Space (고차원 공간에서 유클리드 거리의 효과적인 근사 방안)

  • Jeong, Seung-Do;Kim, Sang-Wook;Kim, Ki-Dong;Choi, Byung-Uk
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.42 no.5
    • /
    • pp.69-78
    • /
    • 2005
  • It is crucial to compute the Euclidean distance between two vectors efficiently in high dimensional space for multimedia information retrieval. In this paper, we propose an effective method for approximating the Euclidean distance between two high-dimensional vectors. For this approximation, a previous method, which simply employs norms of two vectors, has been proposed. This method, however, ignores the angle between two vectors in approximation, and thus suffers from large approximation errors. Our method introduces an additional vector called a reference vector for estimating the angle between the two vectors, and approximates the Euclidean distance accurately by using the estimated angle. This makes the approximation errors reduced significantly compared with the previous method. Also, we formally prove that the value approximated by our method is always smaller than the actual Euclidean distance. This implies that our method does not incur any false dismissal in multimedia information retrieval. Finally, we verify the superiority of the proposed method via performance evaluation with extensive experiments.

Designing and Implementing High School Geometry Lessons Emphasizing the Connections between Euclidean and Analytic Geometries (GeoGebra를 활용한 논증기하와 연결된 해석기하 수업자료 개발 및 적용)

  • Kim, Eun Hye;Lee, Soo Jin
    • Journal of the Korean School Mathematics Society
    • /
    • v.19 no.4
    • /
    • pp.373-394
    • /
    • 2016
  • The "Figure Equation" chapter of current high school curriculum prevents students from relating the concept with what they studied in middle school Euclidean geometry. Woo(1998) concerns that the curriculum introduces the concept merely in algebraic ways without providing students with opportunities to relate it with their prior understanding of geometry, which is based on Euclidean one. In the present study, a sequence of GeoGebra-embedded-geometry lessons was designed so that students could be introduced to and solve problems of the Analytic Geometry by triggering their prior understanding of the Euclidean Geometry which they had learnt in middle school. The study contributes to the field of mathematics education by suggesting a sequence of geometry lessons where students could introduce to the coordinate geometry meaningfully and conceptually in high school.

A fault attack on elliptic curve scalar multiplication based on Euclidean Addition Chain (Euclidean Addition Chain을 사용하는 타원곡선 스칼라 곱셈 연산에 대한 오류 주입 공격)

  • Lee, Soo Jeong;Cho, Sung Min;Hong, Seokhie
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.22 no.5
    • /
    • pp.1019-1025
    • /
    • 2012
  • Fault attacks manipulate the computation of an algorithm and get information about the private key from the erroneous result. It is the most powerful attack for the cryptographic device. Currently, the research on error detection methods and fault attacks have been studied actively. S. Pontarelli et al. introduced an error detection method in 2009. It can detect an error that occurs during Elliptic Curve Scalar Multiplication (ECSM). In this paper, we present a new fault attack. Our attack can avoid the error detection method introduced by S. Pontarelli et al. We inject a bit flip error in the Euclidean Addition Chain (EAC) on the private key in ECSM and retrieve the private key.

ON SOME GEOMETRIC PROPERTIES OF QUADRIC SURFACES IN EUCLIDEAN SPACE

  • Ali, Ahmad T.;Aziz, H.S. Abdel;Sorour, Adel H.
    • Honam Mathematical Journal
    • /
    • v.38 no.3
    • /
    • pp.593-611
    • /
    • 2016
  • This paper is concerned with the classifications of quadric surfaces of first and second kinds in Euclidean 3-space satisfying the Jacobi condition with respect to their curvatures, the Gaussian curvature K, the mean curvature H, second mean curvature $H_{II}$ and second Gaussian curvature $K_{II}$. Also, we study the zero and non-zero constant curvatures of these surfaces. Furthermore, we investigated the (A, B)-Weingarten, (A, B)-linear Weingarten as well as some special ($C^2$, K) and $(C^2,\;K{\sqrt{K}})$-nonlinear Weingarten quadric surfaces in $E^3$, where $A{\neq}B$, A, $B{\in}{K,H,H_{II},K_{II}}$ and $C{\in}{H,H_{II},K_{II}}$. Finally, some important new lemmas are presented.

SOME CHARACTERIZATIONS OF QUATERNIONIC RECTIFYING CURVES IN THE SEMI-EUCLIDEAN SPACE 𝔼24

  • Erisir, Tulay;Gungor, Mehmet Ali
    • Honam Mathematical Journal
    • /
    • v.36 no.1
    • /
    • pp.67-83
    • /
    • 2014
  • The notion of rectifying curve in the Euclidean space is introduced by Chen as a curve whose position vector always lies in its rectifying plane spanned by the tangent and the binormal vector field t and $n_2$ of the curve, [1]. In this study, we have obtained some characterizations of semi-real spatial quaternionic rectifying curves in $\mathbb{R}^3_1$. Moreover, by the aid of these characterizations, we have investigated semi real quaternionic rectifying curves in semi-quaternionic space $\mathbb{Q}_v$.

Quasi-Cyclic Low-Density Parity-Check Codes with Large Girth Based on Euclidean Geometries (유클리드 기하학 기반의 넓은 둘레를 가지는 준순환 저밀도 패리티검사 코드)

  • Lee, Mi-Sung;Jiang, Xueqin;Lee, Moon-Ho
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.11
    • /
    • pp.36-42
    • /
    • 2010
  • This paper presents a hybrid approach to the construction of quasi-cyclic (QC) low-density parity-check (LDPC) codes based on parallel bundles in Euclidean geometries and circulant permutation matrices. Codes constructed by this method are shown to be regular with large girth and low density. Simulation results show that these codes perform very well with iterative decoding and achieve reasonably large coding gains over uncoded system.

TENSOR PRODUCT SURFACES WITH POINTWISE 1-TYPE GAUSS MAP

  • Arslan, Kadri;Bulca, Betul;Kilic, Bengu;Kim, Young-Ho;Murathan, Cengizhan;Ozturk, Gunay
    • Bulletin of the Korean Mathematical Society
    • /
    • v.48 no.3
    • /
    • pp.601-609
    • /
    • 2011
  • Tensor product immersions of a given Riemannian manifold was initiated by B.-Y. Chen. In the present article we study the tensor product surfaces of two Euclidean plane curves. We show that a tensor product surface M of a plane circle $c_1$ centered at origin with an Euclidean planar curve $c_2$ has harmonic Gauss map if and only if M is a part of a plane. Further, we give necessary and sufficient conditions for a tensor product surface M of a plane circle $c_1$ centered at origin with an Euclidean planar curve $c_2$ to have pointwise 1-type Gauss map.

Weight Vector Analysis to Portfolio Performance with Diversification Constraints (비중 상한 제약조건에 따른 포트폴리오 성과에 대한 투자 비중 분석)

  • Park, Kyungchan;Kim, Hongseon;Kim, Seongmoon
    • Korean Management Science Review
    • /
    • v.33 no.4
    • /
    • pp.51-64
    • /
    • 2016
  • The maximum weight of single stock in mutual fund is limited by regulations to enforce diversification. Under incomplete information with added constraints on portfolio weights, enhanced performance had been reported in previous researches. We analyze a weight vector to examine the effects of additional constraints on the portfolio's performance by computing the Euclidean distance from the in-sample tangency portfolio, as opposed to previous researches which analyzed ex-post return only. Empirical experiment was performed on Mean-variance and Minimum-variance model with Fama French's 30 industry portfolio and 10 industry portfolio for the last 1,000 months from August 1932 to November 2015. We find that diversification-constrained portfolios have 7% to 26% smaller Euclidean distances with the benchmark portfolio compared to those of unconstrained portfolios and 3% to 11% greater Sharpe Ratio.