• Title/Summary/Keyword: adjacency

Search Result 233, Processing Time 0.027 seconds

Topology Representation for the Voronoi Diagram of 3D Spheres

  • Cho, Young-Song;Kim, Dong-Uk;Kim, Deok-Soo
    • International Journal of CAD/CAM
    • /
    • v.5 no.1
    • /
    • pp.59-68
    • /
    • 2005
  • Euclidean Voronoi diagram of spheres in 3-dimensional space has not been explored as much as it deserves even though it has significant potential impacts on diverse applications in both science and engineering. In addition, studies on the data structure for its topology have not been reported yet. Presented in this, paper is the topological representation for Euclidean Voronoi diagram of spheres which is a typical non-manifold model. The proposed representation is a variation of radial edge data structure capable of dealing with the topological characteristics of Euclidean Voronoi diagram of spheres distinguished from those of a general non-manifold model and Euclidean Voronoi diagram of points. Various topological queries for the spatial reasoning on the representation are also presented as a sequence of adjacency relationships among topological entities. The time and storage complexities of the proposed representation are analyzed.

Scheduling for Virtual MIMO in Single Carrier FDMA (SC-FDMA) System

  • Kim, Jinwoo;Hwang, In Seok;Kang, Chung Gu
    • Journal of Communications and Networks
    • /
    • v.17 no.1
    • /
    • pp.27-33
    • /
    • 2015
  • In this paper, we consider a joint frequency-domain scheduling and user-pairing problem for virtual MIMO in the single carrier frequency division multiple access (SC-FDMA) system, e.g., the uplink transmission for third generation partnership project-long term evolution (3GPP-LTE) standard. Due to the subcarrier adjacency constraint inherent to SC-FDMA, its complexity becomes unmanageable. We propose a greedy heuristic algorithm for PF scheduling so as to deal with the complexity issue in this joint problem. It has been shown that its performance can reach up to 90% of its upper bound.

Phonetic and Phonological Constraints on Fixed Meters of English Poetry (영시 정형율에 나타난 음성, 음운론적 제약)

  • Son, Il-Gwon
    • Proceedings of the KSPS conference
    • /
    • 2004.05a
    • /
    • pp.161-163
    • /
    • 2004
  • This study concerns the constraints of English Poetic Fixed Meter. In English poems, the metrical pattern doesn't always match the linguistic stress on the lines. These mismatches are found differently among the poets. For the lexical stress mismatched with the weak metrical position, ${\ast}W{\Rightarrow}$ Strength is established by the concept of the strong syllable. The peaked monosyllabic word mismatched with weak metrical position is divided according to which side of the boundary of a phonological domain it is adjacent to. In most poets, ${\ast}$Peak] is ranked higher than ${\ast}$[Peak. In Shakespeare, Adjacency Constraint is ranked higher than ${\ast}$Peak].

  • PDF

A Study on the Flora of Osik Island and its Neighboring Two Islands (筽篒度와 燐近 島嶼의 植物相에 關한 硏究)

  • Kim, Doo Young;Jeom Sook Lee
    • The Korean Journal of Ecology
    • /
    • v.7 no.3
    • /
    • pp.158-169
    • /
    • 1983
  • An investigation on the floras of Osik island and its neighboring two islands, 13km west of Gunsan, showed that there were a total of 305 kinds belonging to 81 families, 132 genus, 259 species, 42 varieties, 4 formas. Of the 305 kinds collected 213 kinds were herb and 92 kinds were woody plant. Seven species of evergreen broad-leaved trees including Euonymus japonica T., Eurya japonica T. and Elaeagnus macrophylla T. etc. are listed in the Norae-sum and Ga-do. The vegetations of Norae-sum and Ga-do were more favorable than that of Osik-do which vegetation was destructed by human inerferences. Coastal plants in these areas were about 30 species. It is interest that the floras of these areas were very similar to that of Gogunsangun-do (r=0.97) inspite of adjacency to inland area.

  • PDF

Categorial Grammar and Quantifer Floating (범주문법과 양화사 유동)

  • 강범모
    • Korean Journal of Cognitive Science
    • /
    • v.2 no.1
    • /
    • pp.73-86
    • /
    • 1990
  • This study aims to give a syntactic and semantic analysis of the phe- nomenon of Quantifier Floating in the framework of Generalixed Cate- gorial Grammar. Floated quantifiers like neys-i as in Hakayngtul-i neys-i swul-ul masyessta are syntactically analyxed as VP modifiers(VP/VP), and semantically as involving nominalixed properties. Related forms like neys(NP/NP) and neys-ul(TV-TV) are also given rigorous syntactic and semantic analysis. A successful anaysis sheds light on the possiblity of using Categorial Grammar, which is subject to adjacency principle, for the (computer) processing od Korean.

State Assignment Method for Control Part Implementation of Effective-Area (효율적인 면적의 제어부 실현을 위한 상태 할당 방법)

  • Park, S.K.;Choi, S.J.;Cho, J.W.;Jong, C.W.;Lim, I.C.
    • Proceedings of the KIEE Conference
    • /
    • 1987.07b
    • /
    • pp.1556-1559
    • /
    • 1987
  • In this paper, a new state assignment method is proposed for the implementation of the area-effective control part. Introducing the, concept of adjacency matrix to control table generated by SDL(Symbolic Description Language) hardware compiler, a state assignment method is proposed with which minimal number of flip flops and effective number of product terms can be obtained to accomplish the area-effective implementation. Also, with substituting the assigned code to state transition table, boolean equations are obtained through 2-level logic minimization. Proposed algorithm is programmed in C-language on VAX-750/UNIX and b efficiency is shown by the practical example.

  • PDF

A postprocessing method for korean optical character recognition using eojeol information (어절 정보를 이용한 한국어 문자 인식 후처리 기법)

  • 이영화;김규성;김영훈;이상조
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.35C no.2
    • /
    • pp.65-70
    • /
    • 1998
  • In this paper, we will to check and to correct mis-recognized word using Eojeol information. First, we divided into 16 classes that constituents in a Eojeol after we analyzed Korean statement into Eojeol units. Eojeol-Constituent state diagram constructed these constitutents, find the Left-Right Connectivity Information. As analogized the speech of connectivity information, reduced the number of cadidate words and restricted case of morphological analysis for mis-recognition Eojeol. Then, we improved correction speed uisng heuristic information as the adjacency information for Eojeol each other. In the correction phase, construct Reverse-Order Word Dictionary. Using this, we can trace word dictionary regardless of mis-recongnition word position. Its results show that improvement of recognition rate from 97.03% to 98.02% and check rate, reduction of chadidata words and morpholgical analysis cases.

  • PDF

Optional Storage of Non-manifold Information for Solid Models (선택 저장을 이용한 복합 다양체 자료구조)

  • 최국헌;한순흥;이현찬
    • Korean Journal of Computational Design and Engineering
    • /
    • v.2 no.3
    • /
    • pp.150-160
    • /
    • 1997
  • Existing non-manifold data structures which use the ordered topological representation method, are designed based on a "Model" which is the highest topological entity. Their non-manifold information is always included in edges and vertices even if they are in the manifold situation. Thus they require large storage spaces than manifold data structures. The proposed data structure reduces its storage space by removing unnecessary information stored in edges and vertices. Topological information is classified into manifold and non-manifold information. The main non-manifold information is radial cycles and disk cycles. The proposed data structure always stores manifold information. For the non-manifold situation, the edge stores radial cycles, and the vertex stores disk cycles. The storage space can be reduced in the later stage of CAD design when the ratio of non-manifold to manifold entities is small.

  • PDF

SOME INEQUALITIES FOR THE HARMONIC TOPOLOGICAL INDEX

  • MILOVANOVIC, E.I.;MATEJIC, M.M.;MILOVANOVIC, I.Z.
    • Journal of applied mathematics & informatics
    • /
    • v.36 no.3_4
    • /
    • pp.307-315
    • /
    • 2018
  • Let G be a simple connected graph with n vertices and m edges, with a sequence of vertex degrees $d_1{\geq}d_2{\geq}{\cdots}{\geq}d_n$ > 0. A vertex-degree topological index, referred to as harmonic index, is defined as $H={\sum{_{i{\sim}j}}{\frac{2}{d_i+d_j}}$, where i ~ j denotes the adjacency of vertices i and j. Lower and upper bounds of the index H are obtained.

The Three Dimensional Modeling Method of Structure in Urban Areas using Airborne Multi-sensor Data (다중센서 데이터를 이용한 구조물의 3차원 모델링)

  • Son, Ho-Woong;Kim, Ki-Young;Kim, Young-Kyung
    • Journal of the Korean Geophysical Society
    • /
    • v.9 no.1
    • /
    • pp.7-19
    • /
    • 2006
  • Laser scanning is a new technology for obtaining Digital Surface Models(DSM) of the earth surface.It is a fast method for sampling the earth surface with high density and high point accuracy. This paper is for buildings extraction from LiDAR points data. The core part of building construction is based on a parameters filter for distinguishing between terrain and non-terrain laser points. The 3D geometrical properties of the building facades are obtained based on plane fitting using least-squares adjustment. The reconstruction part of the procedure is based on the adjacency among the roof facades. Primitive extraction and facade intersections are used for building reconstruction. For overcome the difficulty just reconstruct of laser points data used with digital camera images. Also, 3D buildings of city area reconstructed using digital map. Finally, In this paper show 3D building Modeling using digital map and LiDAR data.

  • PDF