• Title/Summary/Keyword: 공간 복잡도

Search Result 1,901, Processing Time 0.026 seconds

Design and Implementation of a Geographic Database for Sightseeing Information Using an Object-Relational DBMS (객체-관계 DBMS를 이용한 관광안내 지리정보 데이터베이스 설계 및 구현)

  • 김영란;최은선
    • Journal of the Korea Society of Computer and Information
    • /
    • v.4 no.4
    • /
    • pp.47-56
    • /
    • 1999
  • We design and implement an ORDBMS-based geographic information system for sightseeing information of Chungbuk to verify the performance and applicability of GEUS/XTM ORDBMS. We Acquire the positional coordinates of the boundaries of administrative districts , roads, and railroads, determine the various kinds of information such as the locations of sightseeing sites, lodgings, and so on, design an object-relational schema using OMT, and implement the geographic information system including a database system. Through the examination of selective accessibility on the sightseeing inform ation database by the various queries, we conclude that the ORDBMS is more applicable than other DBMSs in modeling, storing, referring, and managing of non-fixed complex data such as sightseeing information. Therefore, ORDBMSs provide efficient and extensible implementations of databases and information services from various sources for the increasing demand on geographic information service on internet.

  • PDF

Nonlinear Inference Using Fuzzy Cluster (퍼지 클러스터를 이용한 비선형 추론)

  • Park, Keon-Jung;Lee, Dong-Yoon
    • Journal of Digital Convergence
    • /
    • v.14 no.1
    • /
    • pp.203-209
    • /
    • 2016
  • In this paper, we introduce a fuzzy inference systems for nonlinear inference using fuzzy cluster. Typically, the generation of fuzzy rules for nonlinear inference causes the problem that the number of fuzzy rules increases exponentially if the input vectors increase. To handle this problem, the fuzzy rules of fuzzy model are designed by dividing the input vector space in the scatter form using fuzzy clustering algorithm which expresses fuzzy cluster. From this method, complex nonlinear process can be modeled. The premise part of the fuzzy rules is determined by means of FCM clustering algorithm with fuzzy clusters. The consequence part of the fuzzy rules have four kinds of polynomial functions and the coefficient parameters of each rule are estimated by using the standard least-squares method. And we use the data widely used in nonlinear process for the performance and the nonlinear characteristics of the nonlinear process. Experimental results show that the non-linear inference is possible.

옥천변성대 서남부지역 변성퇴적암

  • 김성원;오창환;이덕수;이정후
    • Proceedings of the Petrological Society of Korea Conference
    • /
    • 2002.05a
    • /
    • pp.1-38
    • /
    • 2002
  • 옥천변성대 서남부지역은 변성이질암의 광물조합을 기준으로 남동부부터 북서방향으로 흑운모대, 석류석대, 십자석대의 3개의 변성광물분대로 나누어진다. Oh et al. (1995a)의 연구에서 보고된 남정석들은 산출되지 않는 것이 확인되었고 변성도는 흑운모대에서 석류석대를 거쳐 십자석대로 갈수록 증가한다. 쥬라기 화강암 접촉부의 국부적인 변성암류에서는 화강암에 의한 접촉변성작용에 의해 형성된 홍주석과 규선석이 산출된다. 흑운모대의 변성 압력-온도는 4.2 - 5.1 kb, 400 - 500 $^{\circ}C$이다. 십자석대의 정누대구조를 가지는 석류석과 석류석안의 사장석, 흑운모, 금흥석, 일메나이트포유광물의 공생관계로 추정한 압력-온도 (석류석 주변부: 7.0 - 8.0 kb, 550 - 620 $^{\circ}C$; 석류석 중심부: 4.0 - 5.0 kb, 420 - 520 $^{\circ}C$) 및 십자석대 내에서 후퇴변성작용 및 접촉변성작용 받은 석류석 주변부에 기록된 압력-온도 조건(약 2.0 - 3.0kb, 450 - 55$0^{\circ}C$)과 함께 옥천변성대 서남부지역의 변성암류가 시계방향의 압력-온도 경로를 겪었음을 지시한다. 연구지역 내에서 정밀 기재된 단면들에 대한 퇴적환경을 종합하면 대체 적으로 남동부에서는 천해성 환경이 인지되나 북서쪽으로 갈수록 대륙사면을 거쳐 분지 중심의 환경으로 전이되는 경향을 보인다. 이러한 퇴적상의 공간적 분포는 분지의 남동쪽보다 북서쪽의 침강이 우세하였던 것으로 해석될 수 있으며, 이는 곧 분지가 형성될 때 반지구대 (half graben) 형태로 분지가 열개 (rifting) 되었음을 의미한다. 각 변성분대에서 채취한 변성이질암으로부터 측정된 K-Ar 과 40Ar/39Ar 흑운모와 백운모 연대들은 149 - 167 Ma에 집중된다. 그리고 각 변성분대에서 동일시료에 대한 K-Ar 과 40Ar/39Ar 연대들은 동일시기를 지시함으로 연대적인 신뢰성을 확인 할 수 있었다. 옥천변성대 서남부지역의 변성암류를 관입하는 2개의 괴상의 화강암과 1개의 엽리화강암에서 얻어진 백운모와 흑운모들의 K-Ar 연대는 모두 156 Ma이며 옥천변성대 서남부지역의 변성이 질암의 연대와 유사하다. 이는 연구지역의 변성암류와 화강암류는 40Ar/39Ar 과 K-Ar 계의 흑운모와 백운모의 폐쇄온도 (약 300 - 350 $^{\circ}C$) 까지 동시에 냉각된 사실을 지시한다. 각섬석 편암내의 각섬석들은 복잡한 40Ar/39Ar 연대를 보여주며 일부가 평형연대를 보여주지만 특별한 의미 부여가 힘들다.

  • PDF

Globalization and the Politics of "Forgetting" : A Study on a Foreign Immigrant Community in Wongok-dong, Ansan (세계화와 "잊어버림"의 정치 : 안산시 원곡동의 외국인 노동자 거주지역에 대한 연구)

  • Park, Bae-Gyoon;Jung, Keun-Hwa
    • Journal of the Korean association of regional geographers
    • /
    • v.10 no.4
    • /
    • pp.800-823
    • /
    • 2004
  • This paper aims at examining the ways in which foreign immigrant workers in South Korea have been "forgotten" and "marginalized" in the regulatory politics of globalization and how the politics of "forgetting" has influenced the formation of immigrant local communities in South Korea. More specifically, by focusing on the immigrant community in Wongok dong, Ansan, it explores the forming questions. First, under what conditions has Wongok' dong become one of the biggest communities for foreign workers in South Korea? Second, how has the growth of the Wongok-dong immigrant community been influenced by the politics of "exclusion", and "inclusion" taking place at various geographical scales? Based on this case study, this paper suggests that the practices of "exclusion" and "forgetting" should not be seen as an inevitable outcome of globalization; instead, they need to be seen as an outcome of political processes, in which the practices of "exclusion" and "inclusion" are intertwined with one another through interactions and negotiations among different interests and ideas that take place in the multi-scalar regulatory processes, which contribute to the (material and discursive) construction of globalization.

  • PDF

Practical Intelligent Cleaning Robot Algorithm Based on Grouping in Complex Layout Space (복잡한 공간에서 그룹화 기반의 실용적 지능형 청소 로봇 알고리즘)

  • Jo Jae-Wook;Noh Sam-H.;Jeon Heung-Seok
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.12 no.5
    • /
    • pp.489-496
    • /
    • 2006
  • The random-based cleaning algorithm is a simple algorithm widely used in commercial vacuum cleaning robots. This algorithm has two limitations, that is, cleaning takes a long time and there is no guarantee that the cleaning will cover the whole cleaning area. This has lead to customer dissatisfaction. Thus, in recent years, many intelligent cleaning algorithms that takes into consideration information gathered from the cleaning area environment have been proposed. The plowing-based algorithm, which is the most efficient algorithm known to date when there are no obstacles in the cleaning area, has a deficiency that when obstacle prevail, its performance is not guaranteed. In this paper, we propose the Group-k algorithm that is efficient for that situation, that is, when obstacle prevail. The goal is not to complete the cleaning as soon as possible, but to clean the majority of the cleaning area as fast as possible. The motivation behind this is that areas close to obstacles are usually difficult for robots to handle, and hence, many require human assistance anyway In our approach, obstacles are grouped by the complexity of the obstacles, which we refer to as 'complex rank', and then decide the cleaning route based on this complex rank. Results from our simulation-based experiments show that although the cleaning completion time takes longer than the plowing-based algorithm, the Group-k algorithm cleans the majority of the cleaning area faster than the plowing algorithm.

Classification of Warm Temperate Vegetation Using Satellite Data and Management System (위성영상을 이용한 난대림 식생 분류와 관리 시스템)

  • 조성민;오구균
    • Korean Journal of Environment and Ecology
    • /
    • v.18 no.2
    • /
    • pp.231-235
    • /
    • 2004
  • Landsat satellite images were analyzed to study vegetation change patterns of warm-temperate forests from 1991 to 2002 in Wando. For this purpose, Landsat TM satellite image of 1991 and Landsat ETM image of 2002 were used for vegetation classification using ENVI image processing software. Four different forest types were set as a classification criteria; evergreen broadleaf, evergreen conifer, deciduous broadleaf, and others. Unsupervised classification method was applied to classily forest types. Although it was impossible to draw exact forest types in rocky areas because of differences in data detection time and rough resolution of image, 2002 data revealed that total 2,027ha of evergreen broadleaf forests were growing in Wando. Evergreen broadleaves and evergreen conifers increased in total areas compared to 11 years ago, but there was sharp decrease in deciduous broadleaves. GIS-based management system for warm-temperate forest was done using Arc/Info. Geographic and attribute database of Wando such as vegetation, soils, topography, land owners were built with Arc/Info and ArcView. Graphic user interface which manages and queries necessary data was developed using Avenue.

A Compact Stereo Matching Algorithm Using Modified Population-Based Incremental Learning (변형된 개체기반 증가 학습을 이용한 소형 스테레오 정합 알고리즘)

  • Han, Kyu-Phil;Chung, Eui-Yoon;Min, Gak;Kim, Gi-Seok;Ha, Yeong-Ho
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.10
    • /
    • pp.103-112
    • /
    • 1999
  • Genetic algorithm, which uses principles of natural selection and population genetics, is an efficient method to find out an optimal solution. In conventional genetic algorithms, however, the size of gene pool needs to be increased to insure a convergency. Therefore, many memory spaces and much computation time were needed. Also, since child chromosomes were generated by chromosome crossover and gene mutation, the algorithms have a complex structure. Thus, in this paper, a compact stereo matching algorithm using a population-based incremental learning based on probability vector is proposed to reduce these problems. The PBIL method is modified for matching environment. Since th proposed algorithm uses a probability vector and eliminates gene pool, chromosome crossover, and gene mutation, the matching algorithm is simple and the computation load is considerably reduced. Even though the characteristics of images are changed, stable outputs are obtained without the modification of the matching algorithm.

  • PDF

Sequential Nonlinear Recurrence Quantification Analysis of Attentional Visual Evoked Potential (집중 시각자극 유발전위의 순차적 비선형 RQA 분석)

  • Lee, Byung-Chae;Yoo, Sun-Kook;Kim, Hye-Jin
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.11
    • /
    • pp.195-205
    • /
    • 2013
  • The analysis of electroencephalographic signal associated with the attention is essential for the understanding of human cognition. In this paper, the characteristic differences between the attention and inattention status in the brain were inspected by nonlinear analysis. The recurrence quantification analysis was applied to the relatively small number of samples of evoked potential having time varying characteristics, where the recurrence plot (RP), the color recurrence plot (CRP), and mean and time-sequential trend parameters were extracted. The dimension and the time delay in phase transformation can be determined by the paired set of extracted parameters. It is observed from RP, CRP, and parameters that the brain dynamics in attention is more complex than that in the inattention, as well as the synchronized brain response is stable in the mean sense but locally time varying. It is feasible that the non-linear analysis method can be useful for the analysis of complex brain dynamics associated during visual attentional task.

Biped robot gait pattern generation using frequency feature of human's gait torque analysis (인간의 보행 회전력의 주파수 특징 분석을 이용한 이족로봇의 적응적 보행 패턴 생성)

  • Ha, Seung-Suk;Han, Young-Joon;Hahn, Hern-Soo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.18 no.1
    • /
    • pp.100-108
    • /
    • 2008
  • This paper proposes a method of adaptively generating a gait pattern of biped robot. The gait synthesis is based on human's gait pattern analysis. The proposed method can easily be applied to generate the natural and stable gait pattern of any biped robot. To analyze the human's gait pattern, sequential images of the human's gait on the sagittal plane are acquired from which the gait control values are extracted. The gait pattern of biped robot on the sagittal plane is adaptively generated by a genetic algorithm using the human's gait control values. However, galt trajectories of the biped robot on the sagittal Plane are not enough to construct the complete gait pattern because the bided robot moves on 3-dimension space. Therefore, the gait pattern on the frontal plane, generated from Zero Moment Point (ZMP), is added to the gait one acquired on the sagittal plane. Consequently, the natural and stable walking pattern for the biped robot is obtained.

Dead Time Compensation Algorithm for the 3-Phase Inverter using SVPWM (SVPWM 방식의 3상 인버터에 대한 간단한 데드타임 보상 알고리즘)

  • Kim, Hong-Min;Choo, Young-Bae;Lee, Dong-Hee
    • The Transactions of the Korean Institute of Power Electronics
    • /
    • v.16 no.6
    • /
    • pp.610-617
    • /
    • 2011
  • This paper proposes a novel and direct dead-time compensation method of the 3-phase inverter using space vector pulse width modulation(SVPWM) topology. The proposed dead-time compensation method directly compensates the dead-time to the turn-on time of the effective voltage vector according to the current direction of the medium voltage reference. Each phase voltages are determined by the switching times of the effective voltage vectors, and the practical switching times have loss according to the current direction by the dead-time effect in the 3-phase inverter. The proposed method adds the dead-time to the switching time of the effective voltage vector according to the current direction, so it does not require complex d-q transform and controller to compensate the voltage error. The proposed dead-time compensation scheme is verified by the computer simulation and experiments of 3-phase R-L load.