• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.34 no.3
• /
• pp.329-338
• /
• 2016

As the need of indoor spatial information has grown, many applications have been developed. Nevertheless, the major representations of indoor spatial information are on the 2D or 3D, recently, the service based on omni-directional image has increased. Current service based on omni-directional image is used just for viewer. To provide various applications which can serve the identifying the attribute of indoor space, query based services and so on, topological data which can define the spatial relationships between spaces is required. For developing diverse applications based on omni-directional image, this study proposes the method to generate IndoorGML data which is the international standard of indoor topological data model. The proposed method is consist of 3 step to generate IndoorGML data; 1) Analysis the core elements to adopt IndoorGML concept to image, 2) Propose the method to identify the element of ‘Space’ which is the core element of IndoorGML concept, 3) Define the connectivity of indoor spaces. The proposed method is implemented at the 6-floor of 21centurybuilding of the University of Seoul to generate IndoorGML data and the demo service is implemented based on the generated data. This study has the significance to propose a method to generate the indoor topological data for the indoor spatial information services based on the IndoorGML.

• The Journal of the Korea Contents Association
• /
• v.16 no.2
• /
• pp.129-142
• /
• 2016

This study evaluates the sectoral effects of the regeneration of the idle space and aims to analyze the impact relationship and structure with the quality of residents's life and local economy revitalization. this study verifies the 8 hypotheses from total 11 ones through the PLS structural equation model and suitability test for setting the hypothesis and statistical significance test. The results can be summarized into 3 parts. First, If physical, social and cultural aspects should be considered, Regeneration of idle space could meet the 2 pasts such as quality of residents life and local economy revitalization at the same time. Secondly, the regeneration of idle space from environmental aspect should be led by the local government and let it's effect leaded to local economy revitalization through the collaboration of private and public sector. Finally, it should promote the quality of resident's life and let the satisfaction linked to cyclical effects with local economy revitalization. This study has an significance that it provides the theoretical basis for regeneration of idle space and it is an empirical study for impact structure model.

• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.426-432
• /
• 2008

We introduce a method of rendering a scene lying 3D objects which is like that artist draw on a canvas by brushing. Painting is the art area presenting something created by color and line on 2D plane. We are brushing on billboards on screen space for the 2D brushing effect according to the definition of "Painting". Brushing orientation is haven to rotate for preventing the orientation in the first scene in the case that object or camera are moving. If the brushing isn't rotated, shower-door effect is watched on the scene as undesirable result We present a brushing rotating method for keeping the orientation changing the direction of view and object rigid animation. The brushing direction is computed with Horn's 2D similarity transform by least-square solution. We watched the changing brushing to track the motion of object and view.

• Journal of KIISE:Databases
• /
• v.34 no.5
• /
• pp.420-436
• /
• 2007

The choice of an effective indexing method is crucial to guarantee the performance of the spatial join operator which is heavily used in geographical information systems. The $R^*$-tree based method is renowned as one of the most representative indexing methods. In this paper, we propose an efficient spatial join technique based on the DOT(Double Transformation) index, and compare it with the spatial Join technique based on the $R^*$-tree index. The DOT index transforms the MBR of an spatial object into a single numeric value using a space filling curve, and builds the $B^+$-tree from a set of numeric values transformed as such. The DOT index is possible to be employed as a primary index for spatial objects. The proposed spatial join technique exploits the regularities in the moving patterns of space filling curves to divide a query region into a set of maximal sub-regions within which space filling curves traverse without interruption. Such division reduces the number of spatial transformations required to perform the spatial join and thus improves the performance of join processing. The experiments with the data sets of various distributions and sizes revealed that the proposed join technique is up to three times faster than the spatial join method based on the $R^*$-tree index.

• Journal of Korean Tunnelling and Underground Space Association
• /
• v.9 no.3
• /
• pp.299-307
• /
• 2007

In this study, a new concept for simulating a physical damage of tunnel shotcrete lining due to a long-term chemical deterioration has been proposed. It is known that the damage takes place mainly by internal cracks, reduction of stiffness and strength, which results mainly from volume expansion of the lining and corrosion of cement materials, respectively. This damage mechanism of shotcrete lining appears similar in most kinds of chemical reactions in tunnels. Therefore, the mechanical deterioration mechanism induced by a series of chemical reactions was generalized in this study and mathematically formulated in the framework of thermodynamics. The numerical model was implemented to a 3D finite element code, which can be used to simulate behaviour of tunnel structures undergoing external loads as well as chemical deterioration in time. A number of illustrative examples were given to show a feasibility of the model in tunnel designs.

• 한국공간정보시스템학회:학술대회논문집
• /
• 2005.05a
• /
• pp.165-174
• /
• 2005

고압전류가 흐르는 송전탑이 주거 밀집지역 인근에 설치되거나 송전탑과 가까운 곳에 아파트가 건설되면서 주민들이 한전을 상대로 손해배상 청구소송을 추진하는 등 전자파 피해에 따른 민원이 끊이지 않고 있다. 이와 같은 문제에 대해 해결책을 제시하기 위해서는 송전선 주변 전자파의 실체에 대해 과학적이고 객관적인 조사를 거쳐 국민에게 납득할 수 있는 대안을 제시하는 것이 선행되어야할 작업이다. 그러나 현재 전자파 데이터는 조사 지점만의 단편적인 측정치를 보여주는 수준에 머물러 있어 전자파 확산 등 광역적인 분포 추이에 대한 시각적인 정보를 입수하는 데 상당한 한계가 있다. 따라서 본 연구에서는 GIS기반의 공간 모델링 기법을 활용하여 거리와 전류를 토대로 분포되는 송전선 주변의 전자파 시뮬레이션 기법을 제안하고자 한다. 이와 같은 문제에 대해 대안을 제시하고자, 지역주민이 일상생활에서 접하고 있는 지역의 지도(건물, 도로망 등)를 전자파 유동에 관한 이론에 의거하여 3차원 상에서 전자파 시뮬레이션을 수행하였다. 전자파 시뮬레이션 결과를 검증하기 위해 사용한 실측 데이터는 인천광역시 서구 가정2동에 위치한 봉수 초등학교의 학생들에게 전자파 측정장비를 부착하도록 하여 확보하였다 송전선에서 전자파 방출에 개입하는 거리와 전류의 세기에 의거하여 전자파의 분포를 예측하였으며 실측 데이터와 이론적인 데이터를 비교하여 상관성을 평가했다. 통상 전자파 조사과정은 지도에 표기된 조사지점을 일일이 확인하는 등 모든 측정 작업을 수작업에 의존하고 있다. 따라서 DB구축에 시간이 많이 소요되고 정확도도 많이 떨어질 수밖에 없어 다양한 조건으로 방대한 자료를 공간상에서 검색하는 것 자체가 불가능하였다. 전자파의 분포를 그래픽정보로 가공하여 광역적인 전자파 변화 추이를 풍부한 시각 정보로 디스플레이 하는 것도 어려웠다. 또한 수작업으로 인한 실수도 많이 발생하고 그에 따른 교정 작업도 복잡하였다. 본 연구에서는 송전선에서 방출되어지는 전자파의 이론적인 데이터와 실측 데이터의 상관성에 따른 분석 결과를 가지고 실측 데이터 없이 GIS 기반의 3D 시뮬레이션에 의거하여 전자파의 공간적인 가시화를 수행할 수 있었다. 본 전자파 시뮬레이션 기법이 실무에 이용될 경우, 일반인이 전자파의 분포에 대한 전문지식을 습득할 필요 없이, 검색하고자 하는 지역과 송전선, 전철 등 각종 전자파의 발생 공간 객체를 선택하여 실생활과 관련된 전자파 정보에 예측할 수 있어, 대민 환경정보 서비스 질의 개선측면에서 획기적인 계기를 마련할 것으로 사료된다.

• Journal of KIISE:Databases
• /
• v.31 no.5
• /
• pp.468-478
• /
• 2004

It is essential in various application areas of data mining and bioinformatics to effectively retrieve the occurrences of interesting patterns from sequence databases. For example, let's consider a network event management system that records the types and timestamp values of events occurred in a specific network component(ex. router). The typical query to find out the temporal casual relationships among the network events is as fellows: 'Find all occurrences of CiscoDCDLinkUp that are fellowed by MLMStatusUP that are subsequently followed by TCPConnectionClose, under the constraint that the interval between the first two events is not larger than 20 seconds, and the interval between the first and third events is not larger than 40 secondsTCPConnectionClose. This paper proposes an indexing method that enables to efficiently answer such a query. Unlike the previous methods that rely on inefficient sequential scan methods or data structures not easily supported by DBMSs, the proposed method uses a multi-dimensional spatial index, which is proven to be efficient both in storage and search, to find the answers quickly without false dismissals. Given a sliding window W, the input to a multi-dimensional spatial index is a n-dimensional vector whose i-th element is the interval between the first event of W and the first occurrence of the event type Ei in W. Here, n is the number of event types that can be occurred in the system of interest. The problem of‘dimensionality curse’may happen when n is large. Therefore, we use the dimension selection or event type grouping to avoid this problem. The experimental results reveal that our proposed technique can be a few orders of magnitude faster than the sequential scan and ISO-Depth index methods.hods.

• Journal of KIISE:Databases
• /
• v.30 no.3
• /
• pp.225-236
• /
• 2003

MOLAP systems store data in a multidimensional away called a 'cube' and access them using way indexes. When a cube is placed into disk, it can be Partitioned into a set of chunks of the same side length. Such a cube storage scheme is called the chunk-based MOLAP cube storage scheme. It gives data clustering effect so that all the dimensions are guaranteed to get a fair chance in terms of the query processing speed. In order to achieve high space utilization, sparse chunks are further compressed. Due to data compression, the relative position of chunks cannot be obtained in constant time without using indexes. In this paper, we propose a bitmap index for chunk-based MOLAP cubes. The index can be constructed along with the corresponding cube generation. The relative position of chunks is retained in the index so that chunk retrieval can be done in constant time. We placed in an index block as many chunks as possible so that the number of index searches is minimized for OLAP operations such as range queries. We showed the proposed index is efficient by comparing it with multidimensional indexes such as UB-tree and grid file in terms of time and space.

• The KIPS Transactions:PartB
• /
• v.10B no.7
• /
• pp.735-742
• /
• 2003

In the information retrieval system, document clustering technique is to provide user convenience and visual effects by rearranging documents according to the specific topics from the retrieved ones. In this paper, we clustered documents using K-Means algorithm and present the effect of index terms weighting scheme on the document clustering. To verify the experiment, we applied Latent Semantic Indexing approach to illustrate the clustering results and analyzed the clustering results in 2-dimensional space. Experimental results showed that in case of applying local weighting, global weighting and normalization factor, the density of clustering is higher than those of similar or same weighting schemes in 2-dimensional space. Especially, the logarithm of local and global weighting is noticeable.

• Journal of KIISE:Databases
• /
• v.36 no.3
• /
• pp.198-214
• /
• 2009

Trajectories of RFID tags can be modeled as a line, denoted by tag interval, captured by an RFID reader and indexed in a three-dimensional domain, with the axes being the tag identifier (TID), the location identifier (LID), and the time (TIME). Distribution of tag intervals in the domain space is an important factor for efficient processing of a query for tracing tags and is changed according to arranging coordinates of each domain. Particularly, the arrangement of LIDs in the domain has an effect on the performance of queries retrieving the traces of tags as times goes by because it provides the location information of tags. Therefore, it is necessary to determine the optimal ordering of LIDs in order to perform queries efficiently for retrieving tag intervals from the index. To do this, we propose LID proximity for reordering previously assigned LIDs to new LIDs and define the LID proximity function for storing tag intervals accessed together closely in index nodes when a query is processed. To determine the sequence of LIDs in the domain, we also propose a reordering scheme of LIDs based on LID proximity. Our experiments show that the proposed reordering scheme considerably improves the performance of Queries for tracing tag locations comparing with the previous method of assigning LIDs.