• Title/Summary/Keyword: Spatial memory

Search Result 460, Processing Time 0.023 seconds

Conflicts and Resolutions due to the Expansion of Urban Heritage - Focusing on Historic Sites and Hanok Areas in Seoul -

  • Hyun Chul Youn;Seong Lyong Ryoo
    • Architectural research
    • /
    • v.25 no.2
    • /
    • pp.29-40
    • /
    • 2023
  • The purpose of this study is to analyze the conflicts caused by the spatial expansion in two types of urban heritage in Seoul. To explain the national and professional orientation found in each spatial transformation, the study brought the concept of 'historic state' and 'epitome,' thereby examining the operating system of the conflicts. Field observations and stakeholder interviews were performed based on literature and historical research. The study results are as follows. ①In the case of Gwanghwamun and Donuimun, the spatial expansion is to find the historic state of the sites. Gwanghwamun with high national status and substance, conflicts show a pattern that spreads to memory conflicts. Donuimun is relatively unknown and has no substance so that a flexible method of digital restoration was applied. ② In the case of Ikseon-dong and Bukchon hanok, they show heterogeneous spatial expansion. The conflicts in relation to this is caused by the epitome of hanok. In Ikseon-dong, illegal installation of structures(non-epitome) is prevalent, while in Bukchon, there was a process of transferring the new basement(non-epitome) as part of the hanok. ③Conflicts in Gwanghwamun can be coordinated by referring to the digital restoration of Donuimun, and conflicts in Ikseon-dong can be resolved by taking Bukchon as a precedent.

A Spatial Index for PDA using Minimum Bounding Rectangle Compression and Hashing Techniques (최소경계사각형 압축 및 해슁 기법을 이용한 PDA용 공간색인)

  • 김진덕
    • Spatial Information Research
    • /
    • v.10 no.1
    • /
    • pp.61-76
    • /
    • 2002
  • Mobile map services using PDA are prevailing because of the rapid developments of techniques of the internet and handhold devices recently. While the volume of spatial data is tremendous and the spatial operations are time-intensive, the PDA has small size memory and a low performance processor. Therefore, the spatial index for PDA should be small size and efficiently filter out the candidate objects of spatial operation as well. This paper proposes a spatial index far PDA called MHF(Multilevel Hashing File). The MHF has simple structure for storage efficiency and uses a hashing technique, which is direct search method, for search efficiency. This paper also designs a compression technique for MBR. which occupies almost 80% of index data in the two dimensional case. We call it HMBR. Although the HMBR technique reduces the MB\ulcorner size to almost a third, it shows good filtering efficiency because of no information loss by quantization in case of small objects that occupy a major portion. Our experimental tests show that the proposed MHF index using HMBR technique is appropriate for PDA in terms of the size of index, the Number of MBR comparisons, the filtering efficiency and the execution time of spatial operations.

  • PDF

Query Processing System for Multi-Dimensional Data in Sensor Networks (센서 네트워크에서 다차원 데이타를 위한 쿼리 처리 시스템)

  • Kim, Jang-Soo;Kim, Jeong-Joon;Kim, Young-Gon;Lee, Chang-Hoon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.1
    • /
    • pp.139-144
    • /
    • 2017
  • As technologies related to sensor network are currently emerging and the use of GeoSensor is increasing along with the development of IoT technology, spatial query processing systems to efficiently process spatial sensor data are being actively studied. However, existing spatial query processing systems do not support a spatial-temporal data type and a spatial-temporal operator for processing spatial-temporal sensor data. Therefore, they are inadequate for processing spatial-temporal sensor data like GeoSensor. Accordingly, this paper developed a spatial-temporal query processing system, for efficient spatial-temporal query processing of spatial-temporal sensor data in a sensor network. Lastly, this paper verified the utility of System through a scenario, and proved that this system's performance is better than existing systems through performance assessment of performance time and memory usage.

The Differences in Processing Type of Working Memory in Music Reading between Experts and Novices (악보 읽기에서 나타나는 전문가와 초보자의 작업기억에서의 처리 유형의 차이)

  • 전명훈;한광희
    • Science of Emotion and Sensibility
    • /
    • v.6 no.3
    • /
    • pp.21-28
    • /
    • 2003
  • This study investigated the differences in processing type of working memory between experts and novices when they read music scores. Two experiments were conducted with the articulatory suppression condition. In Experiment 1, eight half notes were shown on the screen for a brief period of time, participants were then requested to write the notes on a music sheet. the stimuli were divided into two: melodious and unmelodious. In similar fashion, Experiment 2 consisted of four-chord sequences, which contained three notes each. The stimuli were also divided into two: harmonious and disharmonious. As an analysis of the results in Experiment 1 & 2, novices commonly showed better performances in the non-articulatory suppression condition than the articulatory suppression condition with both stimuli types. However, experts were relatively affected little by the articulatory suppression with harmonious stimuli. These findings support that while novices entirely depend on the articulatory loop, experts may encode the notes through the visuo-spatial sketchpad before they transfer the information to the phonological store when they are familiar with material.

  • PDF

A Study on a Conceptualization-oriented SDSS Model for Landscape Design (조경설계를 위한 공간개념화 지향의 공간의사결정지원시스템 모델에 대한 연구)

  • Kim, Eun Hyung
    • Spatial Information Research
    • /
    • v.22 no.6
    • /
    • pp.55-65
    • /
    • 2014
  • By combining the role of current GIS technology and design behaviors from the cognitive perspective, spatial conceptualization can be extended efficiently and creatively for ill-structured problems. This study elaborates the model of a conceptualization-oriented SDSS(Spatial Decision Support System) for a landscape design problem. Current information-oriented GIS technology plays a minor role in planning and design. The three attributes in planning and design problems describe how the deficiencies of current GIS technology can be seen as a failure of the technology. These are summarized: (1) Information Explosion/Information Ignorance (2) Dilemma of Rigor and Relevance (3) Ill-structured Nature of planning and Design. In order to implement the conceptualization idea in the current GIS environment, it will be necessary to shift from traditional, information-oriented GISs to conceptualization-oriented SDSSs. The conceptualization-oriented SDSS model reflects the key elements of six important theories and techniques. The six useful theories and techniques are as follows; (1) Human Information Processing (2) Tool/Theory Interaction (3) The Sciences of the Artificial and Epistemology of Practice (4) Decision Support Systems (DSSs) (5) Human-Computer Interaction (HCI) (6) Creative Thinking. The future conceptualization-oriented SDSS can provide capabilities for planners and designers to figure out some "hidden organizations" in spatial planning and design, and develop new ideas through its conceptualization capability. The facilitation of conceptualization has been demonstrated by presenting three key ideas for the framework of the SDSS model: (1) bubble-oriented design support system (2) prototypes as an extension of semantic memory, and (3) scripts as an extension of episodic memory in a cognitive pschology perspective. The three ideas can provide a direction for the future GIS technology in planning and design.

Making Cache-Conscious CCMR-trees for Main Memory Indexing (주기억 데이타베이스 인덱싱을 위한 CCMR-트리)

  • 윤석우;김경창
    • Journal of KIISE:Databases
    • /
    • v.30 no.6
    • /
    • pp.651-665
    • /
    • 2003
  • To reduce cache misses emerges as the most important issue in today's situation of main memory databases, in which CPU speeds have been increasing at 60% per year, and memory speeds at 10% per year. Recent researches have demonstrated that cache-conscious index structure such as the CR-tree outperforms the R-tree variants. Its search performance can be poor than the original R-tree, however, since it uses a lossy compression scheme. In this paper, we propose alternatively a cache-conscious version of the R-tree, which we call MR-tree. The MR-tree propagates node splits upward only if one of the internal nodes on the insertion path has empty room. Thus, the internal nodes of the MR-tree are almost 100% full. In case there is no empty room on the insertion path, a newly-created leaf simply becomes a child of the split leaf. The height of the MR-tree increases according to the sequence of inserting objects. Thus, the HeightBalance algorithm is executed when unbalanced heights of child nodes are detected. Additionally, we also propose the CCMR-tree in order to build a more cache-conscious MR-tree. Our experimental and analytical study shows that the two-dimensional MR-tree performs search up to 2.4times faster than the ordinary R-tree while maintaining slightly better update performance and using similar memory space.

A Study on Characteristics of Observation Time Found in Image Evaluation of Interior Space - Focusing on Acquisition of Spatial Information by Interior Space Types - (실내공간의 이미지 평가에 나타난 주시시간 특성에 관한 연구 - 실내공간 유형별 정보획득을 중심으로 -)

  • Choi, Joo-Young;Kim, Joo-Hyun;Kim, Jong-Ha;Lee, Jeong-Ho
    • Korean Institute of Interior Design Journal
    • /
    • v.20 no.5
    • /
    • pp.96-104
    • /
    • 2011
  • Assuming that different spatial types involves the change of observation time to acquire the spatial information, this study intended to analyze the observation time by interior space types and derive the proper time for spatial evaluation. Coming to the study method, in order to analyze the characteristics of observation time in the image evaluation of interior space by types, it looked into the observation time chosen by the testees during evaluation. The findings of this study are as follows: First, the observation time differed by genders and spatial types: men's average time was longest for modern (93.3 sec.) and natural (89.4 sec.) spaces; women's average time was longest for classic space (110.7 sec.), which was the shortest for men. Second, the intensity of observation time zone differed by spatial types: this finding can imply that different design types require different establishment of observation time for evaluation even if the spatial elements are the same. Third, analyzing the distribution of time zones chosen by most testees showed that men's observation time zones were more intensely distributed than those of women. Fourthly, the observation lime for general space could be derived from the gender-based comparison that excluded the difference by types, but considering that different design types lead to different observation time, it could be seen as proper for evaluation of interior space to establish the difference of observation time by spatial types. Finally, Analysis showed the highest preference to the time '(3)'. However, obtaining information presented is the most highly effective time is '(6). Thus, the preferred time zone is different and effective, according to the results of the analysis.

An Efficient Adaptive Bitmap-based Selective Tuning Scheme for Spatial Queries in Broadcast Environments

  • Song, Doo-Hee;Park, Kwang-Jin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.10
    • /
    • pp.1862-1878
    • /
    • 2011
  • With the advances in wireless communication technology and the advent of smartphones, research on location-based services (LBSs) is being actively carried out. In particular, several spatial index methods have been proposed to provide efficient LBSs. However, finding an optimal indexing method that balances query performance and index size remains a challenge in the case of wireless environments that have limited channel bandwidths and device resources (computational power, memory, and battery power). Thus, mechanisms that make existing spatial indexing techniques more efficient and highly applicable in resource-limited environments should be studied. Bitmap-based Spatial Indexing (BSI) has been designed to support LBSs, especially in wireless broadcast environments. However, the access latency in BSI is extremely large because of the large size of the bitmap, and this may lead to increases in the search time. In this paper, we introduce a Selective Bitmap-based Spatial Indexing (SBSI) technique. Then, we propose an Adaptive Bitmap-based Spatial Indexing (ABSI) to improve the tuning time in the proposed SBSI scheme. The ABSI is applied to the distribution of geographical objects in a grid by using the Hilbert curve (HC). With the information in the ABSI, grid cells that have no objects placed, (i.e., 0-bit information in the spatial bitmap index) are not tuned during a search. This leads to an improvement in the tuning time on the client side. We have carried out a performance evaluation and demonstrated that our SBSI and ABSI techniques outperform the existing bitmap-based DSI (B DSI) technique.

Partition-based Operator Sharing Scheme for Spatio-temporal Data Stream Processing (시공간 데이터 스트림 처리를 위한 영역 기반의 연산자 공유 기법)

  • Chung, Weon-Il;Kim, Young-Ki
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.12
    • /
    • pp.5042-5048
    • /
    • 2010
  • In ubiquitous environments, many continuous query processing techniques make use of operator network and sharing methods on continuous data stream generated from various sensors. Since similar continuous queries with the location information intensively occur in specific regions, we suggest a new operator sharing method based on grid partition for the spatial continuous query processing for location-based applications. Due to the proposed method shares moving objects by the given grid cell without sharing spatial operators individually, our approach can not only share spatial operators including similar conditions, but also increase the query processing performance and the utilization of memory by reducing the frequency of use of spatial operators.

Query Optimization Scheme using Query Classification in Hybrid Spatial DBMS (하이브리드 공간 DBMS에서 질의 분류를 이용한 최적화 기법)

  • Chung, Weon-Il;Jang, Seok-Kyu
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.1
    • /
    • pp.290-299
    • /
    • 2008
  • We propose the query optimization technique using query classification in hybrid spatial DBMS. In our approach, user queries should to be classified into three types: memory query, disk query, and hybrid query. Specialty, In the hybrid query processing, the query predicate is divided by comparison between materialized view creating conditions and user query conditions. Then, the deductions of the classified queries' cost formula are used for the query optimization. The optimization is mainly done by the selection algorithm of the smallest cost data access path. Our approach improves the performance of hybrid spatial DBMS than traditional disk-based DBMS by $20%{\sim}50%$.