• Title/Summary/Keyword: Structure-mapping

Search Result 662, Processing Time 0.03 seconds

A Building Modeling using the Library-based Texture Mapping

  • Song, Jeong-Heon;Cho, Young-Wook;Han, Dong-Yeob;Kim, Yong-Il
    • Proceedings of the KSRS Conference
    • /
    • 2003.11a
    • /
    • pp.744-746
    • /
    • 2003
  • A 3D modeling of urban area can be composed the terrain modeling that can express specific and shape of the terrain and the object modeling such as buildings, trees and facilities which are found in urban areas. Especially in a 3D modeling of building, it is very important to make a unit model by simplifying 3D structure and to take a texture mapping, which can help visualize surface information. In this study, the texture mapping technique, based on library for 3D urban modeling, was used for building modeling. This technique applies the texture map in the form of library which is constructed as building types, and then take mapping to the 3D building frame. For effectively apply, this technique, we classified buildings automatically using LiDAR data and made 3D frame using LiDAR and digital map. To express the realistic building texture, we made the texture library using real building photograph.

  • PDF

Preventing ID Mapping Attacks on DHT Networks through Non-Voluntary Node Locating (비 자율적 노드 위치 결정을 통한 DHT 네트워크 ID 매핑 공격 방지)

  • Lee, Cheolho;Choi, Kyunghee;Chung, Kihyun;Kim, Jongmyung;Yun, Youngtae
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.23 no.4
    • /
    • pp.695-707
    • /
    • 2013
  • DHT(Distributed Hash Table) networks such as Kademlia are vulnerable to the ID mapping attack caused by the voluntary DHT mapping structure where the location of a node is solely determined by itself on the network topology. This causes security problems such as eclipse, DRDoS and botnet C&C on DHT networks. To prevent ID mapping attacks, we propose a non-voluntary DHT mapping scheme and perform analysis on NAT compatibility, attack resistance, and network dynamicity. Analysis results show that our approach may have an equivalent level of attack resistance comparing with other defense mechanisms and overcome their limitations including NAT compatibility and network dynamicity.

Three-Dimensional Automated Crystal Orientation and Phase Mapping Analysis of Epitaxially Grown Thin Film Interfaces by Using Transmission Electron Microscopy

  • Kim, Chang-Yeon;Lee, Ji-Hyun;Yoo, Seung Jo;Lee, Seok-Hoon;Kim, Jin-Gyu
    • Applied Microscopy
    • /
    • v.45 no.3
    • /
    • pp.183-188
    • /
    • 2015
  • Due to the miniaturization of semiconductor devices, their crystal structure on the nanoscale must be analyzed. However, scanning electron microscope-electron backscatter diffraction (EBSD) has a limitation of resolution in nanoscale and high-resolution electron microscopy (HREM) can be used to analyze restrictive local structural information. In this study, three-dimensional (3D) automated crystal orientation and phase mapping using transmission electron microscopy (TEM) (3D TEM-EBSD) was used to identify the crystal structure relationship between an epitaxially grown CdS interfacial layer and a $Cu(In_xGa_{x-1})Se_2$ (CIGS) solar cell layer. The 3D TEM-EBSD technique clearly defined the crystal orientation and phase of the epitaxially grown layers, making it useful for establishing the growth mechanism of functional nano-materials.

An XML Structure Translation System using Schema Structure Data Mapping (스키마 구조 데이타 매핑을 이용한 XML 구조변환 시스템)

  • 송종철;김창수;정회경
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.10 no.5
    • /
    • pp.406-418
    • /
    • 2004
  • Last days, various kinds of applications and system were individually introduced into specific groups or enterprises by different objective without considering interoperability among those. However, the environment for data processing is changing rapidly in these days. And now the necessity is growing to integrate and couple applications and system in the process dimension for more flexible and quicker data processing on these application programs and system. When integrating these application programs or system, an integration based on XML is recommended as it is one of good methods which will the additional cost and satisfy the requirements of the integration. This is because the XML is not only device-independent data type which can be used any platform, but also it uses XSLT, the document conversion standard established by W3C, which allows easy data conversion from one to another type on occasion of demands. This paper studies a design and implementation of system to convert XML structure. This system shows the structure of source- side providing data and destination-side processing data with using XML schema that defines structural information of a XML document. And this system defines the structure relationship of desired form as mapping structural information and data. This system creates the XSLT document that defines conversion rule between two structures based information which is defined. The XSLT document which is created as described above will convert data to be appropriate to the structure of the destination- side. By implementing this system, it is able to apply a document into various kinds of structure without considering specific system or platform and it is able to construct XSLT document to which meaning of desired form can be given. This paper aims to offer a process conversion between documents and to improve interoperability and scalability, so that we can contribute to build XML document processing environment

Design of the Automotive Gateway Based on a Mapping Table (매핑 테이블 기반의 자동차용 게이트웨이 설계)

  • Oh, Se-Chun;Kim, Eui-Ryong;Kim, Young-Gon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.12
    • /
    • pp.1959-1968
    • /
    • 2016
  • The recent automobiles, a number of ECU inside the vehicle has been used. Also, each ECU is connected to different types of networks in accordance with the characteristics. Therefore, efficient data exchange between discrete network has emerged as a very important element. The gateway is responsible for the ability to exchange data between discrete network. In this study, we propose the new gateway algorithm to provide the structure of the mapping table to improve the efficiency of data exchange between discrete network. Also it provides a structure of a new gateway algorithm with a function of adjusting the priority of the data to be transmitted to another network arbitrarily. Moreover, the proposed gateway structure may simultaneously convert the transmission data input from a particular network to multiple networks. Another advantage is easy to change the entire data structure only if we change the table structure in the gateway.

Mineral Potential Mapping of Gagok Mine Using 3D Geological Modeling (3차원 지질모델링을 이용한 가곡광산 광상 포텐셜 지도 작성)

  • Park, Gyesoon;Cho, Seong-Jun;Oh, Hyun-Joo;Lee, Chang-Won
    • Journal of the Korean earth science society
    • /
    • v.35 no.6
    • /
    • pp.412-421
    • /
    • 2014
  • In order to develop an effective mineral exploration technique, this study was carried out about the potential mapping of Gagok mine. The deposit model of Gagok mine is widely known. Based on the deposit model, we constructed mining indicator indices using related igneous rocks, faults, and carbonate rocks. By analyzing the spatial correlation between ore and indicator index structures, we decided the weighting values of indices according to the distance from the index structure. The 3D potential mapping was performed using 3D geological model and geological indices. The analyzed potential map verified that the locations and patterns of high potential regions of the results were well matched with those of the known ore bodies. Using the potential mapping results, we could effectively predict the location of a high potential area that has similar geological settings with ore.

Workload-Driven Adaptive Log Block Allocation for Efficient Flash Memory Management (효율적 플래시 메모리 관리를 위한 워크로드 기반의 적응적 로그 블록 할당 기법)

  • Koo, Duck-Hoi;Shin, Dong-Kun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.37 no.2
    • /
    • pp.90-102
    • /
    • 2010
  • Flash memory has been widely used as an important storage device for consumer electronics. For the flash memory-based storage systems, FTL (Flash Translation Layer) is used to handle the mapping between a logical page address and a physical page address. Especially, log buffer-based FTLs provide a good performance with small-sized mapping information. In designing the log buffer-based FTL, one important factor is to determine the mapping structure between data blocks and log blocks, called associativity. While previous works use static associativity fixed at the design time, we propose a new log block mapping scheme which adjusts associativity based on the run-time workload. Our proposed scheme improves the I/O performance about 5~16% compared to the static scheme by adjusting the associativity to provide the best performance.

A Comparison Analysis of Various Approaches to Multidimensional Scaling in Mapping a Knowledge Domain's Intellectual Structure (지적 구조 분석을 위한 MDS 지도 작성 방식의 비교 분석)

  • Lee, Jae-Yun
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.41 no.2
    • /
    • pp.335-357
    • /
    • 2007
  • There has been many studies representing intellectual structures with multidimensional scaling(MDS) However MDS configuration is limited in representing local details and explicit structures. In this paper, we identified two components of MDS mapping approach; one is MDS algorithm and the other is preparation of data matrix. Various combinations of the two components of MDS mapping are compared through some measures of fit. It is revealed that the conventional approach composed of ALSCAL algorithm and Euclidean distance matrix calculated from Pearson's correlation matrix is the worst of the compared MDS mapping approaches. Otherwise the best approach to make MDS map is composed of PROXSCAL algorithm and z-scored Euclidean distance matrix calculated from Pearson's correlation matrix. These results suggest that we could obtain more detailed and explicit map of a knowledge domain through careful considerations on the process of MDS mapping.

Virtual Network Mapping Algorithm for Minimizing Piecewise Linear Cost Function (Piecewise Linear 비용함수의 최소화를 위한 가상 네트워크 매핑 알고리즘)

  • Pyoung, Chan-kyu;Baek, Seung-jun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.6
    • /
    • pp.672-677
    • /
    • 2016
  • Development of Internet has been successfully inspired with extensive deployment of the network technology and application. However, increases in Internet usage had caused a lot of traffic overload in these days. Thus, we need a continuous research and development on the network virtualization for effective resource allocation. In this paper, we propose a minimal cost virtual network mapping algorithm using Piecewise Linear Cost Function. We exploited an algorithm with Linear Programming and D-VINE for node mapping, and Shortest Path Algorithm based on linear programming solution is used for link mapping. In this way, we compared and analyzed the average cost for arrival rate of VN request with linear and tree structure. Simulation results show that the average cost of our algorithm shows better efficiency than ViNEyard.

Automatic Creation of ShEx Schemas for RML-Based RDF Knowledge Graph Validation

  • Choi, Ji-Woong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.27 no.11
    • /
    • pp.67-80
    • /
    • 2022
  • In this paper, we propose a system which automatically generates the ShEx schemas to describe and validate RDF knowledge graphs constructed by RML mapping. ShEx schemas consist of constraints. The proposed system generates most of the constraints by converting the RML mapping rules. The schemas consisting only of constraints obtained from mapping rules can help users to figure out the structure of the graphs generated by RML mapping, but they are not sufficient for sophisticated validation purposes. For users who need a schema for validation, the proposed system is also able to provide the schema with added constraints generated from metadata extracted from the input data sources for RML mapping. The proposed system has the ability to handle CSV, XML, JSON or RDBMS as input data sources. Testing results from 297 cases show that the proposed system can be applied for RDF graph validation in various practical cases.