• Title/Summary/Keyword: metric structure

Search Result 285, Processing Time 0.029 seconds

K0-PROXIMITY INDUCED BY UNIFORMITY

  • Han, Song Ho
    • Korean Journal of Mathematics
    • /
    • v.11 no.1
    • /
    • pp.45-49
    • /
    • 2003
  • We introduce the $k_0$-proximity space as a generalization of the Efremovi$\check{c}$-proximity space. We try to show that $k_0$-proximity structure lies between topological structures and uniform structure in the sense that all topological invariants are $k_0$-proximity invariants and all $k_0$-proximity invariants are uniform invariants.

  • PDF

The Structure of Maximal Ideal Space of Certain Banach Algebras of Vector-valued Functions

  • Shokri, Abbas Ali;Shokri, Ali
    • Kyungpook Mathematical Journal
    • /
    • v.54 no.2
    • /
    • pp.189-195
    • /
    • 2014
  • Let X be a compact metric space, B be a unital commutative Banach algebra and ${\alpha}{\in}(0,1]$. In this paper, we first define the vector-valued (B-valued) ${\alpha}$-Lipschitz operator algebra $Lip_{\alpha}$ (X, B) and then study its structure and characterize of its maximal ideal space.

ON COMPACT GENERIC SUBMANIFOLDS IN A SASAKIAN SPACE FORM

  • SUNG-BAIK LEE;NAM-GIL KIM;SEUNG-GOOK HAN;IN-YEONG YOO
    • Communications of the Korean Mathematical Society
    • /
    • v.9 no.2
    • /
    • pp.401-409
    • /
    • 1994
  • One of typical submanifolds of a Sasakian manifold is the so-called generic submanifolds which are defined as follows: Let M be a submanifold of a Sasakian manifold M with almost contact metric structure (ø, G, ξ) such that M is tangent to the structure vector ξ. If each normal space is mapped into the tangent space under the action of ø, M is called a generic submanifold of M [2], [8].(omitted)

  • PDF

Error Probability Expressions for Frame Synchronization Using Differential Correlation

  • Kim, Sang-Tae;Kim, Jae-Won;Shin, Dong-Joon;Chang, Dae-Ig;Sung, Won-Jin
    • Journal of Communications and Networks
    • /
    • v.12 no.6
    • /
    • pp.582-591
    • /
    • 2010
  • Probabilistic modeling and analysis of correlation metrics have been receiving considerable interest for a long period of time because they can be used to evaluate the performance of communication receivers, including satellite broadcasting receivers. Although differential correlators have a simple structure and practical importance over channels with severe frequency offsets, closedform expressions for the output distribution of differential correlators do not exist. In this paper, we present detection error probability expressions for frame synchronization using differential correlation, and demonstrate their accuracy over channel parameters of practical interest. The derived formulas are presented in terms of the Marcum Q-function, and do not involve numerical integration, unlike the formulas derived in some previous studies. We first determine the distributions and error probabilities for single-span differential correlation metric, and then extend the result to multispan differential correlation metric with certain approximations. The results can be used for the performance analysis of various detection strategies that utilize the differential correlation structure.

3 Dimension Deformation Analysis by Close-Range Photogrammetry (근접사진측량에 의한 3차원 변형해석)

  • 배연성;오원진;한승희
    • Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
    • /
    • 2003.10a
    • /
    • pp.135-140
    • /
    • 2003
  • This study try to surface deformation analyzing and 3-D monitoring of hydro structure by close-range photogrammetry technique using 35mm metric camera. For this, the lens distortion parameters were acquired for 21mm super-wide-angle lens which is mounted in 35mm metric camera. After that, the system designed for absolute deformation analysis of object surface, and examined the application validity Also, optimum photographing condition was derived by calculated the standard deviation of this system. This system can monitor periodically changing of surface area, volume and deformation precisely after placed plate underwater. Finally, this paper suggested efficiency of absolute deformation analysis by using small format camera.

  • PDF

CONNECTIONS ON ALMOST COMPLEX FINSLER MANIFOLDS AND KOBAYASHI HYPERBOLICITY

  • Won, Dae-Yeon;Lee, Nany
    • Journal of the Korean Mathematical Society
    • /
    • v.44 no.1
    • /
    • pp.237-247
    • /
    • 2007
  • In this paper, we establish a necessary condition in terms of curvature for the Kobayashi hyperbolicity of a class of almost complex Finsler manifolds. For an almost complex Finsler manifold with the condition (R), so-called Rizza manifold, we show that there exists a unique connection compatible with the metric and the almost complex structure which has the horizontal torsion in a special form. With this connection, we define a holomorphic sectional curvature. Then we show that this holomorphic sectional curvature of an almost complex submanifold is not greater than that of the ambient manifold. This fact, in turn, implies that a Rizza manifold is hyperbolic if its holomorphic sectional curvature is bounded above by -1.

GENERIC LIGHTLIKE SUBMANIFOLDS OF AN INDEFINITE TRANS-SASAKIAN MANIFOLD WITH A NON-SYMMETRIC NON-METRIC CONNECTION OF TYPE (ℓ, m)

  • Lee, Chul Woo;Lee, Jae Won
    • Communications of the Korean Mathematical Society
    • /
    • v.35 no.4
    • /
    • pp.1203-1219
    • /
    • 2020
  • Jin [7] defined a new connection on semi-Riemannian manifolds, which is a non-symmetric and non-metric connection. He said that this connection is an (ℓ, m)-type connection. Jin also studied lightlike hypersurfaces of an indefinite trans-Sasakian manifold with an (ℓ, m)-type connection in [7]. We study further the geometry of this subject. In this paper, we study generic lightlike submanifolds of an indefinite trans-Sasakian manifold endowed with an (ℓ, m)-type connection.

Metrics for Measuring a Structural Complexity of Softwares Based on SOA (SOA 기반 소프트웨어의 구조적 복잡도 측정을 위한 메트릭스)

  • Kim, Eun-Mi
    • Convergence Security Journal
    • /
    • v.10 no.1
    • /
    • pp.29-34
    • /
    • 2010
  • It is very important to evaluate the quality of soft wares based on SOA, which develops rapidly. Particularly, one of the most important properties influencing on the quality of system is complexity. Therefore, we propose the metrics for measuring a structural complexity of softwares based on SOA. The proposed metrics is composed of the size of a service, the depth of a service and interdependency from the viewpoint of system structure, and finally we applied the proposed metric to an example.

PARABOLIC QUATERNIONIC MONGE-AMPÈRE EQUATION ON COMPACT MANIFOLDS WITH A FLAT HYPERKÄHLER METRIC

  • Zhang, Jiaogen
    • Journal of the Korean Mathematical Society
    • /
    • v.59 no.1
    • /
    • pp.13-33
    • /
    • 2022
  • The quaternionic Calabi conjecture was introduced by Alesker-Verbitsky, analogous to the Kähler case which was raised by Calabi. On a compact connected hypercomplex manifold, when there exists a flat hyperKähler metric which is compatible with the underlying hypercomplex structure, we will consider the parabolic quaternionic Monge-Ampère equation. Our goal is to prove the long time existence and C convergence for normalized solutions as t → ∞. As a consequence, we show that the limit function is exactly the solution of quaternionic Monge-Ampère equation, this gives a parabolic proof for the quaternionic Calabi conjecture in this special setting.

Korean Approximate String Searching System by Hierarchical Metric Space Structure (계층적 메트릭 공간(metric space) 구조의 한글 근사 단어 검색 시스템)

  • Yoon, Taijin;Cho, Hwan-Gue
    • Annual Conference of KIPS
    • /
    • 2010.04a
    • /
    • pp.397-400
    • /
    • 2010
  • 우리는 지난 연구에서 변형 비속어 필터링 시스템을 위하여 근사 문자열 검색 시스템을 적용하여 서열 정렬 횟수를 비약적으로 줄일 수 있었다. 다차원 데이터 구조를 이용한 한글 근사 검색 시스템은 기준축인 Base-Pivot의 숫자에 따라 검색 결과의 정확도를 높일 수 있으나 BP이 증가한 만큼 질의 단어의 좌표를 계산하기 위한 시간이 오래 걸린다. 소규모 데이터 검색에는 문제가 되지 않으나 60,000단어 이상의 데이터가 수록되는 국어사전과 같은 대규모 데이터를 검색하게 될 경우 요구되는 BP의 숫자도 증가하여 많은 연산시간을 필요로 한다. 본 논문에서는 기존의 근사 단어 검색 시스템을 계층구조화 하여 요구되는 BP 숫자를 감소 시켜 성능을 향상 시키는 방법을 제안하고자 한다. 그리고 실험을 통하여 본 아이디어의 실효성을 증명하였다. 본 아이디어는 기존의 6000개의 비속어에 대하여 약 20%정도의 성능향상을 보였다.