• Title/Summary/Keyword: Data representation

Search Result 1,526, Processing Time 0.032 seconds

Effects of Uncertain Spatial Data Representation on Multi-source Data Fusion: A Case Study for Landslide Hazard Mapping

  • Park No-Wook;Chi Kwang-Hoon;Kwon Byung-Doo
    • Korean Journal of Remote Sensing
    • /
    • v.21 no.5
    • /
    • pp.393-404
    • /
    • 2005
  • As multi-source spatial data fusion mainly deal with various types of spatial data which are specific representations of real world with unequal reliability and incomplete knowledge, proper data representation and uncertainty analysis become more important. In relation to this problem, this paper presents and applies an advanced data representation methodology for different types of spatial data such as categorical and continuous data. To account for the uncertainties of both categorical data and continuous data, fuzzy boundary representation and smoothed kernel density estimation within a fuzzy logic framework are adopted, respectively. To investigate the effects of those data representation on final fusion results, a case study for landslide hazard mapping was carried out on multi-source spatial data sets from Jangheung, Korea. The case study results obtained from the proposed schemes were compared with the results obtained by traditional crisp boundary representation and categorized continuous data representation methods. From the case study results, the proposed scheme showed improved prediction rates than traditional methods and different representation setting resulted in the variation of prediction rates.

Application of Fuzzy Information Representation Using Frequency Ratio and Non-parametric Density Estimation to Multi-source Spatial Data Fusion for Landslide Hazard Mapping

  • Park No-Wook;Chi Kwang-Hoon;Kwon Byung-Doo
    • Journal of the Korean earth science society
    • /
    • v.26 no.2
    • /
    • pp.114-128
    • /
    • 2005
  • Fuzzy information representation of multi-source spatial data is applied to landslide hazard mapping. Information representation based on frequency ratio and non-parametric density estimation is used to construct fuzzy membership functions. Of particular interest is the representation of continuous data for preventing loss of information. The non-parametric density estimation method applied here is a Parzen window estimation that can directly use continuous data without any categorization procedure. The effect of the new continuous data representation method on the final integrated result is evaluated by a validation procedure. To illustrate the proposed scheme, a case study from Jangheung, Korea for landslide hazard mapping is presented. Analysis of the results indicates that the proposed methodology considerably improves prediction capabilities, as compared with the case in traditional continuous data representation.

A Study on the Mental Representation of a Specific Data (특정 정보의 정신적 표상에 대한 연구)

  • Kang, JeongGi;Roh, EunHwan
    • East Asian mathematical journal
    • /
    • v.29 no.4
    • /
    • pp.449-466
    • /
    • 2013
  • This paper started from a question: Can it help a student solve the problem to give supports in point of view of a teacher knowing the solution. We performed a case study to get an answer for the question. We analysed a case which students do not make full use of data in the mathematical problem from this point of view of the mental representation. We examined closely the cause for not making full use of data. We got that the wrong mental representation which the students get from data in the problem lead to not making full use of data. We knew that it is insufficient to present the data not making use of. To help a student truly, it is necessary to give a aid based on a student's mental representation. From the conclusion of study, We got that figuring out student's mental representation is important and hope that many investigation about student's mental representation for various problem occur with frequency.

A Product Data Representation for Engineering Change Management (설계변경 관리를 위한 제품 자료 표현)

  • 도남철
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2000.04a
    • /
    • pp.397-400
    • /
    • 2000
  • This paper provides a product data representation, a data schema and related operations, for the management of engineering changes. The computer Interpretable format of the representation enables itself to be realized through databases and their applications to a component of a product data management system. Supporting general operations for the engineering changes, it resolves problems of the existing information systems in the nested engineering changes and the simultaneous change application to multiple products. To show the feasibility, a prototype system is implemented based on the representation.

  • PDF

A Study of Data Representation Education for Elementary Students (초등학생을 위한 데이터 표현 교육에 관한 연구)

  • Ma, Daisung
    • Journal of The Korean Association of Information Education
    • /
    • v.20 no.1
    • /
    • pp.13-20
    • /
    • 2016
  • Data are numbers and texts, images, sound etc in real world. But, data is represented as a sequence of 1s and 0s in computer. It is very difficult that elementary students understand the concept of data representation through traditional lecture method. In this paper, we analyzed the software education curriculum of KAIE and selected contents of data representation education for the mid-grade elementary students. Also, we developed teaching- learning materials and multimedia contents for data representation education. The method proposed in this paper is expected to contribute to software education for data representation education.

A Flexible and Expandable Representation Framework for Computational Science Data

  • Kim, Jaesung;Ahn, Sunil;Lee, Jeongchoel;Lee, Jongsuk Ruth
    • Journal of Internet Computing and Services
    • /
    • v.21 no.3
    • /
    • pp.41-51
    • /
    • 2020
  • EDISON is a web-based platform that provides easy and convenient use of simulation software on high-performance computers. One of the most important roles of a computational science platform, such as EDISON, is to post-process and represent the simulation results data so that the user can easily understand the data. We interviewed EDISON users and collected requirements for post-processing and represent of simulation results, which included i) flexible data representation, ii) supporting various data representation components, and iii) flexible and easy development of view template. In previous studies, it was difficult to develop or contribute data representation components, and the view templates were not able to be shared or recycled. This causes a problem that makes it difficult to create ecosystems for the representation tool development of numerous simulation software. EDISON-VIEW is a framework for post-processing and representing simulation results produced from the EDISON platform. This paper proposes various methods used in the design and development of the EDISON-VIEW framework to solve the above requirements and problems. We have verified its usefulness by applying it to simulation software in various fields such as material, computational fluid dynamics, computational structural dynamics, and computational chemistry.

Multi-view Clustering by Spectral Structure Fusion and Novel Low-rank Approximation

  • Long, Yin;Liu, Xiaobo;Murphy, Simon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.3
    • /
    • pp.813-829
    • /
    • 2022
  • In multi-view subspace clustering, how to integrate the complementary information between perspectives to construct a unified representation is a critical problem. In the existing works, the unified representation is usually constructed in the original data space. However, when the data representation in each view is very diverse, the unified representation derived directly in the original data domain may lead to a huge information loss. To address this issue, different to the existing works, inspired by the latest revelation that the data across all perspectives have a very similar or close spectral block structure, we try to construct the unified representation in the spectral embedding domain. In this way, the complementary information across all perspectives can be fused into a unified representation with little information loss, since the spectral block structure from all views shares high consistency. In addition, to capture the global structure of data on each view with high accuracy and robustness both, we propose a novel low-rank approximation via the tight lower bound on the rank function. Finally, experimental results prove that, the proposed method has the effectiveness and robustness at the same time, compared with the state-of-art approaches.

Merging of Topological Map and Grid Map using Standardized Map Data Representation (표준화된 지도 데이터 표현방법을 이용한 위상지도와 격자지도의 병합)

  • Jin, Hee-Seon;Yu, Wonpil;Moon, Hyungpil
    • The Journal of Korea Robotics Society
    • /
    • v.9 no.2
    • /
    • pp.104-110
    • /
    • 2014
  • Mapping is a fundamental element for robotic services. There are available many types of map data representation such as grid map, metric map, topology map, etc. As more robots are deployed for services, more chances of exchanging map data among the robots emerge and standardization of map data representation (MDR) becomes more valuable. Currently, activities in developing MDR standard are underway in IEEE Robotics and Automation Society. The MDR standard is for a common representation and encoding of the two-dimensional map data used for navigation by mobile robots. The standard focuses on interchange of map data among components and systems, particularly those that may be supplied by different vendors. This paper aims to introduce MDR standard and its application to map merging. We have applied the basic structure of the MDR standard to a grid map and Voronoi graph as a kind of topology map and performed map merging between two different maps. Simulation results show that the proposed MDR is suitable for map data exchange among robots.

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.

A Compact and Efficient Polygonal Mesh Representation (간결하고 효율적인 폴리곤 메쉬의 표현 구조)

  • Park S. K.;Lee S. H.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.9 no.4
    • /
    • pp.294-305
    • /
    • 2004
  • Highly detailed geometric models are rapidly becoming commonplace in computer graphics and other applications. These complex models, which is often represented as complex1 triangle meshes, mainly suffer from the vast memory requirement for real-time manipulation of arbitrary geometric shapes without loss of data. Various techniques have been devised to challenge these problems in views of geometric processing, not a representation scheme. This paper proposes the new mesh structure for the compact representation and the efficient handling of the highly complex models. To verify the compactness and the efficiency, the memory requirement of our representation is first investigated and compared with other existing representations. And then we analyze the time complexity of our data structure by the most critical operation, that is, the enumeration of the so-called one-ring neighborhood of a vertex. Finally, we evaluate some elementary modeling functions such as mesh smoothing, simplification, and subdivision, which is to demonstrate the effectiveness and robustness of our mesh structure in the context of the geometric modeling and processing.