• Title/Summary/Keyword: Euclidean

Search Result 1,101, Processing Time 0.022 seconds

On Partitioning Ideals of Semirings

  • Gupta, Vishnu;Chaudhari, Jayprakash Ninu
    • Kyungpook Mathematical Journal
    • /
    • v.46 no.2
    • /
    • pp.181-184
    • /
    • 2006
  • We prove the following results: (1) Let R be a strongly euclidean semiring. Then an ideal A of $R_{n{\times}n}$ is a partitioning ideal if and only if it is a subtractive ideal. (2) A monic ideal M of R[$x$], where R is a strongly euclidean semiring, is a partitioning ideal if and only if it is a subtractive ideal.

  • PDF

CMC SURFACES FOLIATED BY ELLIPSES IN EUCLIDEAN SPACE E3

  • Ali, Ahmad Tawfik
    • Honam Mathematical Journal
    • /
    • v.40 no.4
    • /
    • pp.701-718
    • /
    • 2018
  • In this paper, we will study the constant mean curvature (CMC) surfaces foliated by ellipses in three dimensional Euclidean space $E^3$. We prove that: (1): Surfaces foliated by ellipses are CMC surfaces if and only if it is a part of generalized cylinder. (2): All surfaces foliated by ellipses are not minimal surfaces. (3): CMC surfaces foliated by ellipses are developable surfaces. (4): CMC surfaces foliated by ellipses are translation surfaces generated by a straight line and plane curve.

KILLING MAGNETIC FLUX SURFACES IN EUCLIDEAN 3-SPACE

  • Ozdemir, Zehra;Gok, Ismail;Yayli, Yusuf;Ekmekci, F. Nejat
    • Honam Mathematical Journal
    • /
    • v.41 no.2
    • /
    • pp.329-342
    • /
    • 2019
  • In this paper, we give a geometric approach to Killing magnetic flux surfaces in Euclidean 3-space and solve the differential equations which expressed the mentioned surfaces. Furthermore we give some examples and draw their pictures by using the programme Mathematica.

A Study on the Extraction of Feature by State-Space Concept with Euclidean Distance Operator (Euclidean 거리연산자와 결합된 상태공간 기법에 의한 영상추출)

  • Choi, Kap Seok;Yoon, Dong Han
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.23 no.6
    • /
    • pp.846-852
    • /
    • 1986
  • An efficient and reliable method for the extraction of features is presented. The method utilizes by a state technique with Euclidean distance operator. The proposed method is compared with the Sobel Operator. Simulation results show that our method performs as well as the Sobel operator.

  • PDF

SOME RESULTS RELATED TO NON-DEGENERATE LINEAR TRANSFORMATIONS ON EUCLIDEAN JORDAN ALGEBRAS

  • K. Saravanan;V. Piramanantham;R. Theivaraman
    • Korean Journal of Mathematics
    • /
    • v.31 no.4
    • /
    • pp.495-504
    • /
    • 2023
  • This article deals with non-degenerate linear transformations on Euclidean Jordan algebras. First, we study non-degenerate for cone invariant, copositive, Lyapunov-like, and relaxation transformations. Further, we study that the non-degenerate is invariant under principal pivotal transformations and algebraic automorphisms.

ON GENERALIZED SPHERICAL SURFACES IN EUCLIDEAN SPACES

  • Bayram, Bengu;Arslan, Kadri;Bulca, Betul
    • Honam Mathematical Journal
    • /
    • v.39 no.3
    • /
    • pp.363-377
    • /
    • 2017
  • In the present study we consider the generalized rotational surfaces in Euclidean spaces. Firstly, we consider generalized spherical curves in Euclidean (n + 1)-space ${\mathbb{E}}^{n+1}$. Further, we introduce some kind of generalized spherical surfaces in Euclidean spaces ${\mathbb{E}}^3$ and ${\mathbb{E}}^4$ respectively. We have shown that the generalized spherical surfaces of first kind in ${\mathbb{E}}^4$ are known as rotational surfaces, and the second kind generalized spherical surfaces are known as meridian surfaces in ${\mathbb{E}}^4$. We have also calculated the Gaussian, normal and mean curvatures of these kind of surfaces. Finally, we give some examples.

ON GENERALIZED ROTATIONAL SURFACES IN EUCLIDEAN SPACES

  • Arslan, Kadri;Bulca, Betul;Kosova, Didem
    • Journal of the Korean Mathematical Society
    • /
    • v.54 no.3
    • /
    • pp.999-1013
    • /
    • 2017
  • In the present study we consider the generalized rotational surfaces in Euclidean spaces. Firstly, we consider generalized tractrices in Euclidean (n + 1)-space $\mathbb{E}^{n+1}$. Further, we introduce some kind of generalized rotational surfaces in Euclidean spaces $\mathbb{E}^3$ and $\mathbb{E}^4$, respectively. We have also obtained some basic properties of generalized rotational surfaces in $\mathbb{E}^4$ and some results of their curvatures. Finally, we give some examples of generalized Beltrami surfaces in $\mathbb{E}^3$ and $\mathbb{E}^4$, respectively.

Edge Tracing Algorithm for Computation of Euclidean Voronoi Diagram for Protein and its Applications (3차원에서 단백질의 보로노이 다이아그램 계산을 위한 모서리추적 알고리즘 및 응용)

  • Jo, Yeong-Song;Kim, Dong-Uk;Jo, Cheol-Hyeong;Kim, Deok-Su
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2005.05a
    • /
    • pp.842-847
    • /
    • 2005
  • Although there are many applications of Euclidean Voronoi diagram for spheres in a 3D space in various disciplines from sciences and engineering, it has not been studied as much as it deserves. In this paper, we present an edge-tracing algorithm to compute the Euclidean Voronoi diagram of 3-dimensional spheres in O(mn) in the worst-case, where m is the number of edges of Voronoi diagram and n is the number of spheres. After building blocks for the algorithm, we show an example of Voronoi diagram for atoms using actual protein data and discuss its applications for protein analysis.

  • PDF

A Design of Modified Euclidean Algorithm using Finite State Machine (FSM을 이용한 수정된 유클리드 알고리즘 설계)

  • Kang, Sung-Jin
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.6
    • /
    • pp.2202-2206
    • /
    • 2010
  • In this paper, an architecture for modified Euclidean(ME) algorithm is proposed, which is using finite-state machine(FSM) instead of degree computation. Since the proposed architecture does not have degree computation circuits, it is possible to reduce the hardware complexity of RS(Reed-Solomon) decoder, so that a very high-speed RS decoder can be implemented. RS(255,239) decoder with the proposed architecture is implemented using Verilog-HDL and requires about 13% fewer gate counts than conventional one.