• Title/Summary/Keyword: 매핑 테이블

Search Result 108, Processing Time 0.03 seconds

Data Security Technology for the Desktop Virtualization Environment using the Graphic Offloading (SW 분할 실행을 이용한 데스크탑 가상화 환경에서 데이터 보안 기술)

  • Chung, Moonyoung;Choi, Won-Hyuk;Jang, Su-Min;Yang, Kyung-Ah;Kim, Won-Young;Choi, Jihoon
    • KIISE Transactions on Computing Practices
    • /
    • v.20 no.10
    • /
    • pp.555-560
    • /
    • 2014
  • This paper proposes the data security technology for the desktop virtualization environment using the separated software execution method. In the virtual environment where allocates separate VMs to the users, there is a benefit that the programs in one guest machine are isolated from the programs running in another guest machine, whereas in the separated execution environment that supports application virtualization, the isolation is not offered and it causes the data security problem because the applications are executed by the one root privilege in the server. To solve this problem, we provides the data security method using the server storage filter, the viewer filter, and the file mapping table in this paper.

A Study of Schema Mapping Technique for Efficient Establishment of Geospatial DB (지형DB의 효율적 구축을 위한 스키마매핑 기법 연구)

  • Kang, Joon-Mook;Park, Joon-Kyu;Jo, Hyeon-Wook;Lee, Cheol-Hee
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.26 no.1
    • /
    • pp.1-7
    • /
    • 2008
  • The government is spending a large amount of budget to establish NGIS due to the importance of geospatial information. This paper deals with the study of schema mapping technique which can efficiently establish military topographic DB forest layer using digital forest map and other existing geospatial DB. In order to accomplish this each schema of these types of DB was analyzed then, mapping table which connects related attributes was created and finally, military topographical DB forest layer of the area of interest was efficiently established. This research was able to display solutions that resolved compatibility issues between existing geospatial DB of these types, established by the schema mapping techniques described in this research.

Performance Evaluation of HMB-Supported DRAM-Less NVMe SSDs (HMB를 지원하는 DRAM-Less NVMe SSD의 성능 평가)

  • Kim, Kyu Sik;Kim, Tae Seok
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.8 no.7
    • /
    • pp.159-166
    • /
    • 2019
  • Unlike modern Solid-State Drives with DRAM, DRAM-less SSDs do not have DRAM because they are cheap and consume less power. Obviously, they have performance degradation problem due to lack of DRAM in the controller and this problem can be alleviated by utilizing host memory buffer(HMB) feature of NVMe, which allows SSDs to utilize the DRAM of host. In this paper, we show that commercial DRAM-less SSDs surely exhibit lower I/O performance than other SSDs with DRAM, but they can be improved by utilizing the HMB feature. Through various experiments and analysis, we also show that DRAM-less SSDs mainly exploit the DRAM of host as mapping table cache rather than read cache or write buffer to improve I/O performance.

Memory Improvement Method for Extraction of Frequent Patterns in DataBase (데이터베이스에서 빈발패턴의 추출을 위한 메모리 향상기법)

  • Park, In-Kyu
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.19 no.2
    • /
    • pp.127-133
    • /
    • 2019
  • Since frequent item extraction so far requires searching for patterns and traversal for the FP-Tree, it is more likely to store the mining data in a tree and thus CPU time is required for its searching. In order to overcome these drawbacks, in this paper, we provide each item with its location identification of transaction data without relying on conditional FP-Tree and convert transaction data into 2-dimensional position information look-up table, resulting in the facilitation of time and spatial accessibility. We propose an algorithm that considers the mapping scheme between the location of items and items that guarantees the linear time complexity. Experimental results show that the proposed method can reduce many execution time and memory usage based on the data set obtained from the FIMI repository website.

PMG : Project Management Negotiating Model and Process among Stakeholders in Project Development Phase (PMG : 프로젝트 개발단계에서 Stakeholder 간의 문제점 협상모델 및 프로세스)

  • Moon, Jae-Hyun;Kim, Jin-Hyung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.05a
    • /
    • pp.300-303
    • /
    • 2008
  • IT 관련 프로젝트를 진행 시 프로젝트 진행 도중 예상치 못한 많은 문제에 봉착하게 된다. 본 논문에서는 IT 프로젝트 대부분이 도입, 사용하는 요구사항분석-설계-개발-테스트-배포-유지보수단계 중 개발단계 및 유지보수 단계에서 발생할 수 있는 문제점에 초점을 맞추었다. PMG 란 Project Management Negotiator 의 약자로서 개발 시 고객의 요구사항이 변경되면 고객과 개발자 간의 개발에 소요되는 난이도, 일정, 비용에 따른 관점이 다를 수 있으므로, 이러한 차이점을 서로 이해 할 수 있는 범위 내에서 감소시킬 수 있는 모델을 제시한다. 또한 제시한 모델에 근거한 매핑테이블과 프로세스를 개발하고 실제 pilot 시스템을 구축하여 효용성을 검증한다. 제시한 프로젝트 관리 협상 모델을 통하여 일정에 차질 없는 프로젝트가 수행 가능하며 비용절감 및 고객만족 효과를 거둘 수 있다. 결과적으로 일정, 비용 측면 및 고객 만족 세 가지 측면에서 기존의 프로젝트 개발 방법론보다 더 나은 일정준수, 효율성, 정확성 등의 정량적, 정성적 만족을 확보할 수 있다.

An Automatic Relational Schema Generating System for an XML Schema (XML Schema에 대한 관계형 스키마 자동 생성 시스템)

  • 김정섭;박창원;정진완
    • Journal of KIISE:Databases
    • /
    • v.31 no.5
    • /
    • pp.527-539
    • /
    • 2004
  • As more and more documents are published in XML, generating relational schemas to store XML documents in a relational database is also getting important. This paper describes a technique as well as its implementation to produce a relational schema from the XML Schema, a standard recently recommended by W3C. The DTD-based inlining technique cannot be applied to the XML Schema, because the XML Schema has many new features, which don't exist in the DTD. Various built-in data types, inheritance, and polymorphism, for example, strengthen the XML Schema, but make the generation of a relational schema from an XML Schema more difficult. We propose an XML Schema Inlining Technique, based on the previous work. The technique first maps various data types in the XML Schema to those of the relational database. After that, it construct the schema graph and the type graph from types and elements defined in the XML Schema. The relational schema is generated while traversing the type graphs. Besides, we describe techniques for handling xsi:type, used for the polymorphism, and the anon#moos type. We also propose a couple of heuristic methods for enhancing the performance of the system. Finally, we conducted experiments to show that our technique is better than the binary table approach.

Analysis of Music Mood Class using Folksonomy Tags (폭소노미 분위기 태그를 이용한 음악의 분위기 유형 분석)

  • Moon, Chang Bae;Kim, HyunSoo;Kim, Byeong Man
    • Science of Emotion and Sensibility
    • /
    • v.16 no.3
    • /
    • pp.363-372
    • /
    • 2013
  • When retrieving music with folksonomy tags, internal use of numeric tags (AV tags: tags consisting of Arousal and Valence values ) instead of word tags can partially solve the problem posed by synonyms. However, the two predecessor tasks should be done correctly; the first task is to map word tags to their numeric tags; the second is to get numeric tags of the music pieces to be retrieved. The first task is verified through our prior study and thus, in this paper, its significance is seen for the second task. To this end, we propose the music mapping table defining the relation between AV values and music and ANOVA tests are performed for analysis. The result shows that the arousal values and valence values of music have different distributions for 12 mood tags with or without synonymy and that their type I error values are P<0.001. Consequently, it is checked that the distribution of AV values is different according to music mood.

  • PDF

A Text Processing Method for Devanagari Scripts in Andriod (안드로이드에서 힌디어 텍스트 처리 방법)

  • Kim, Jae-Hyeok;Maeng, Seung-Ryol
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.12
    • /
    • pp.560-569
    • /
    • 2011
  • In this paper, we propose a text processing method for Hindi characters, Devanagari scripts, in the Android. The key points of the text processing are to device automata, which define the combining rules of alphabets into a set of syllables, and to implement a font rendering engine, which retrieves and displays the glyph images corresponding to specific characters. In general, an automaton depends on the type and the number of characters. For the soft-keyboard, we designed the automata with 14 consonants and 34 vowels based on Unicode. Finally, a combined syllable is converted into a glyph index using the mapping table, used as a handle to load its glyph image. According to the multi-lingual framework of Freetype font engine, Dvanagari scripts can be supported in the system level by appending the implementation of our method to the font engine as the Hindi module. The proposed method is verified through a simple message system.

Assembling Disjoint Korean Syllables Using Two-Step Rules (2단계 규칙을 이용한 해체된 한글 음절의 결합)

  • Lee, Joo-Ho;Kim, Hark-Soo
    • Korean Journal of Cognitive Science
    • /
    • v.19 no.3
    • /
    • pp.283-295
    • /
    • 2008
  • With increasing usages of a messenger and a SMS, many young people are habitually using a new-style of sentences with intentionally disjoint Korean syllables. To develop a natural language interface system in these environments, we should first develop a technique that converts a sequence of disjoint Korean syllables to a correct sentence. Therefore, we propose a method to assemble a sequence of disjoint Korean syllables into a correct sentence by using two-step rules. In the first step, the proposed method assembles CVC (consonant-vowel-consonant) forms of simple-disjoint Korean syllables by using manual heuristic rules. In the second step, the proposed method assembles CCVCC forms of double-disjoint Korean syllables by using a mapping table and a transformation-based learning technique. In the experiment, the proposed method showed the perfect precision of 100% in assembling simple-disjoint Korean syllables and the high precision of 99.98% in assembling double-disjoint Korean syllables.

  • PDF

Study on the New Re-identification Process of Health Information Applying ISO TS 25237 (ISO TS 25237을 적용한 보건의료정보의 새로운 재식별 처리에 관한 연구)

  • Kim, Soon Seok
    • Convergence Security Journal
    • /
    • v.19 no.5
    • /
    • pp.25-36
    • /
    • 2019
  • With the development of information and communication technology, hospitals that electronically process and manage medical information of patients are increasing. However, if medical information is processed electronically, there is still room for infringing personal information of the patient or medical staff. Accordingly, in 2017, the International Organization for Standardization (ISO) published ISO TS 25237 Health Information - Pseudonymization[1]. In this paper, we examine the re - identification process based on ISO TS 25237, the procedure and the problems of our proposed method. In addition, we propose a new processing scheme that adds a re-identification procedure to our secure differential privacy method [2] by keeping a mapping table between de-identified data sets and original data as ciphertext. The proposed method has proved to satisfy the requirements of ISO TS 25237 trust service providers except for some policy matters.