• Title/Summary/Keyword: 공간적 거리

Search Result 1,802, Processing Time 0.028 seconds

Landscape Elements and User Satisfaction in National Street: Focusing on Gwangwhamun Square (국가상징거리의 구성요소 특징과 만족도에 관한 연구: 광화문 광장을 중심으로)

  • Choi, Hyun-Ah;Cho, Young-Tae;Lee, Woo-Kyun
    • Land and Housing Review
    • /
    • v.5 no.4
    • /
    • pp.215-224
    • /
    • 2014
  • National street has become one of open space for enhancing environmental qualities of city and country. In the developed countries such as France, U.K. U.S.A are designed symbolic malls, squares and street which are represented the historicity, culture and symbolic place. For place identity, we analyzed the relationship between element and user satisfaction in Sejong Avenue, Gwangwhamun Square. Data were analyzed using statistical methods such as descriptive statistics, ANOVA and correlation. Results of this study are as follows, i) factor analysis is carried out to extract spatial components and satisfaction. The satisfaction concerning transportation access was the higher than other factors, ii) user satisfaction was strongly correlated on the spatial elements, iii) user showed high user perception to study site. Results of this study can identify representative street management plan based on landscape elements and user satisfaction.

Grid Cell Based Spatial Clustering Method (그리드 셀 기반 공간 클러스터링 방법)

  • 이동규;정정수;문상호
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2001.04b
    • /
    • pp.10-12
    • /
    • 2001
  • 대용량의 공간 데이터베이스로부터 임시적이고 유용한 지식을 자동적으로 추출하는 공간데이터 마이닝은 데이터양의 급격히 증가하면서 필요성이 더욱 증대되고 있다. 공간데이타 마이닝에서 데이터를 분석하여 유사한 그룹으로 분류하는 것은 중요한 분야이며, 이를 위해서는 공간 클러스터링 과정이 먼저 수행되어야 한다. 이러한 공간 클러스터링에서 가장 중요한 점은 클러스터링에 드는 비용의 감소와 점 공간객체에 한정된 클러스터링이 아닌 선 및 다각형 객체들의 클러스터링도 가능해야 한다. 본 본문은 이를 위하여 공간지역성을 보장하는 대표적인 공간분할 방법인 그리드 셀을 이용한다. 기존의 클러스터링에서 사용되는 객체들 간의 거리 계산을 인접한 그리드 셀들 간의 관계 연산으로 대체시키는 것이 핵심아이디어이다. 이 방법은 기존 클러스터링에서 객체들 간의 거리 계산으로 인한 비용을 현저하게 줄일 수 있고, 선 및 다각형 객체들의 클러스터링도 가능하게 하는 장점이 있다.

  • PDF

Effects of familiarity on the construction of psychological distance (친숙감이 심리적 거리에 미치는 영향)

  • Bae, Heekyung;Kim, Kyungmi;Yi, Do-Joon
    • Korean Journal of Cognitive Science
    • /
    • v.25 no.2
    • /
    • pp.109-133
    • /
    • 2014
  • Psychological distance refers to the perceived gap between a stimulus and a person's direct experience and its activation influences the decisions and actions that the person makes towards the stimulus. We investigated whether the level of familiarity affects the construction of psychological distance. Specifically, we hypothesized that a familiar stimulus, relative to an unfamiliar stimulus, is perceived to be psychologically closer to the observer and so its perception might be modulated by the perceived spatial distance. The familiarity of stimuli was manipulated in terms of preexposure frequency and preexposure perceptual fluency. In experiments, participants were first exposed with three nonsense words in a lexical decision task. The nonsense words were presented in nonword trials with different levels of frequency (frequent vs. rare, Experiment 1) or with different levels of visibility (less blurred vs. more blurred, Experiment 2). Participants then performed a distance Stroop task with the most familiar and the least familiar nonwords. Each of them appeared in either proximal or distant spatial locations in scenes with clear depth cues. The results showed a significant interaction between the word familiarity and the spatial distance: the familiar word was judged faster in proximal locations but slower in distant locations relative to the unfamiliar word. The current findings suggest that metacognitive evaluation of familiarity could be one of the critical factors that underlie the construction of psychological distance.

An efficient space-leaping method using double leaping (이중 도약을 이용한 효율적인 공간 도약법)

  • 이정진;신병석;신영길
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.30 no.3_4
    • /
    • pp.109-116
    • /
    • 2003
  • Space leaping is one of accelerated image-order volume rendering. This method accelerates rendering speed by finding and leaping the empty space. Although its rendering speed is very fast, it takes long pre-processing time to make the data structure to leap the space. In this paper we propose the look-ahead sampling algorithm to double the leaping distance comparing with previous approaches. This algorithm reduces the preprocessing time to make the distance map without significant changes of rendering time. Also, it accelerates the rendering time.

Design of Spatial Clustering Method for Data Mining of Various Spatial Objects (다양한 공간객체의 데이터 마이닝을 위한 공간 클러스터링 기법의 설계)

  • 문상호;최진오;김진덕
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.4
    • /
    • pp.955-959
    • /
    • 2004
  • Existing Clustering Methods for spatial data mining process only Point objects, not spatial objects with polygonometry such as lines and areas. It is because that distance computation between objects with polygonometry for clustering is more complex than distance computation between point objects. To solve this problem, we design a clustering method based on regular grid cell structures. In details, it reduces cost and time for distance computation using cell relationships in grid cell structures.

Charicteristics of directing a publishing cartoon according to an angel and a distance setting (각도와 거리 설정에 따른 출판 만화 연출의 특징)

  • Jeung, Kiu-Ha;Kim, So-won
    • Cartoon and Animation Studies
    • /
    • s.25
    • /
    • pp.87-108
    • /
    • 2011
  • Published comics are widely recognized as a popularity-gaining media as well as Soap opera and the movies, and it also has a established characteristic of category. However, compare to the multimedia such as the movies, soap opera and playes, the research on direction is not yet satisfactory This research mainly tries to investigate on, first, whether the theoretically classified functions do actually practice their parts or not, and else, what other additional functions should be considered, by classifying the set up of basic direction functions, angles and range, which the most-cited angle and distance notion of 'Ahn Su Cheol' in comic education field. First, although we tried to approach with the expectation of angle and distance set up that will have a high frequency of certain set ups according to the atmospheres of comics of genre, unlike the expectation, they are rather displayed depending on the personal taste of the writers. The functional aspects of angles and distance set up are the fixing that are only limited in the space of representation, and it is the set up of physical space that should come first as the function of expressing the intensity. As we investigate the characteristics of comic direction, this research will help the range of comic direction to be broadened.

GIS를 이용한 교통망상 시간거리 지도화 방법 및 접근성의 구조 분석

  • Kim, So-Yeon;Lee, Geum-Suk
    • Proceedings of the Conference
    • /
    • 2005.12a
    • /
    • pp.40-47
    • /
    • 2005
  • 카토그램(Cartogram)은 통계데이터를 이용하여 지리공간에 나타나는 현상을 효과적으로 표현하는 방법 중 하나이다. 카토그램이란 넓은 의미에서 모든 통계지도를 포함하지만, 좁은 의미에서 지도의 변형을 통해 통계데이터의 특징을 표현하는 시각화 방법을 의미한다. 이 연구에서는 후자의 의미에서 카토그램이란 용어를 사용하였으며, 우리나라를 대상으로 절대적 공간을 시간거리 접근성에 의한 공간 카토그램으로 재구성하여 지도화하고, 변화된 공간패턴을 분석하고자 하였다. 카토그램은 특정한 목적을 위해 기본도의 형상이나 지역간의 연속성을 강조시켜서 만든 변형된 지도의 일종으로 전통적인 지도와는 매우 다른 이미지를 주게 되지만, 표현하고자 하는 현상의 공간적 구조를 매우 효과적으로 나타낼 수 있다.

  • PDF

To collect the data of deduction of distance Estimating Position of Mobiles by Multi-Criteria Decision Making System (거리추정 데이터를 수집하여 공간적 의사결정을 이용한 이동물체 위치 인식 시스템)

  • Jang, Hae-Suk;Jung, Kyu-Cheol;Lee, Jin-Kwan;Park, Ki-Hong
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2005.11a
    • /
    • pp.1215-1218
    • /
    • 2005
  • 이동물체의 인식기능은 인간을 대신하여 수행하기위한 컴퓨터비젼 시스템이다. 공간적 의사결정지원시스템(SDSS: Spatial Decision Support Systems)을 이용한 이동물체의 위치를 인식하는 시스템은 실세계의 복잡하고 다양한 조건들을 만족시키는 대안들을 도출시키고 보다 객관적이고 과학적으로 평가받는 연구가 될것이다.본 연구에서는 거리 추정 데이터를 수집하여 공간적 의사결정을 이용하여 이동 물체의 위치를 인식하는 방법을 제안한다.

  • PDF

Improved Parallel Computation for Extended Edit Distances (개선된 확장편집거리 병렬계산)

  • Kim, Youngho;Sim, Jeong Seop
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2014.11a
    • /
    • pp.62-65
    • /
    • 2014
  • 근사문자열매칭 알고리즘은 검색엔진, 컴퓨터보안, 생물정보학 등 많은 분야에서 연구되고 있다. 근사문자열매칭에서는 거리함수를 이용하여 오차를 측정한다. 거리함수로는 해밍거리, 편집거리, 확장편집거리 등이 있다. 이때 확장편집거리는 mn) 시간과 공간에 계산할 수 있으며, 최근 m개의 쓰레드를 이용하여 O(m+n) 시간과 O(mn) 공간을 이용한 병렬알고리즘이 제시되었다. 본 논문에서는 기존의 확장편집거리를 계산하는 병렬알고리즘을 개선한 효율적인 병렬알고리즘을 제시한다. 기존의 병렬알고리즘을 최적화하고, 기존의 병렬알고리즘, 전역메모리만 사용한 최적화된 병렬알고리즘, 공유메모리를 활용한 최적화된 병렬알고리즘의 수행시간을 비교한다. 실험 결과, 개선된 병렬알고리즘이 기존의 병렬알고리즘보다 전처리단계에서 16 ~ 63배 이상, 모든 단계에 대해 19 ~ 24배 이상 빠른 수행시간을 보였다.

Spatial Autocorrelation Analysis of Carex humilis on Mt. Giri by RAPD (RAPD에 의한 지리산 내 산거울 집단의 공간적 상관관계 분석)

  • Lee, Bok-Kyu;Lee, Byeong-Ryong;Huh, Man-Kyu
    • Journal of Life Science
    • /
    • v.20 no.9
    • /
    • pp.1287-1293
    • /
    • 2010
  • The spatial distribution of alleles and geographical distances of a Carex humilis population on Mt. Giri in Korea were studied. A total of 102 DNA fragments (bands) were found among 107 plants. Among these 102 bands, 48 (47.1%) bands were polymorphic. In a simple variability of subpopulations by the percentage of polymorphic bands, distances I and V exhibited the lowest variation (16.7%). Distance VIII showed the highest variation (22.6%). The total genetic diversity (H) was 0.076 across species. Class VIII had the highest H (0.093), while class I had the lowest (0.063). Genetic similarity of individuals was found among subpopulations at up to a scale of 60 m distance, and this was partly due to a combination of alleles. Within the Mt. Giri population, a strong spatial structure was observed for RAPD markers, indicating a very low amount of migration among subpopulations and that the distribution of individual genotypes of a given population was clumped. The present study demonstrated that analysis of RAPD markers could be successfully used to study the spatial and genetic structures of C. humilis.