• Title/Summary/Keyword: 맵 파일

Search Result 74, Processing Time 0.029 seconds

Design and Implementation of Retargetable Software Debugger based on GDB (GDB 기반의 재목적 소프트웨어 디버거 설계 및 구현)

  • Ji, Jung-Hoon;Lee, Gun-Woo;Woo, Gyun
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2007.11a
    • /
    • pp.538-541
    • /
    • 2007
  • 최근 SoC 기술이 발달하면서, 내장형 시스템을 위한 프로세서 개발이 활발해졌다. 새로운 프로세서가 개발되면, 운영체제 및 소프트웨어 개발을 위해 컴파일러 및 디버거가 필요하다. 컴파일러는 소스코드를 타겟 프로세서에서 실행 가능한 목적파일로 변환하고, 디버거는 프로그램의 개발에서 오류를 찾기 위한 도구로 소프트웨어 개발에 매우 중요한 도구들이다. 본 논문에서는 KAIST에서 개발하는 32bit 프로세서인 Core-A를 위한 소프트웨어 디버거를 설계 및 구현한다. Core-A용 디버거는 공개 소스 디버거 시스템인 GDB를 참조모델로 했으며, 레지스터와 메모리 맵과 같은 프로세서 종속적인 부분을 확장하고 외부 인터페이스 모듈과 같은 프로세스 독립적인 모듈은 재사용함으로써 개발기간을 단축시켰다. 그리고 Core-A용 디버거의 검증을 위해 상용 디버거 시스템인 ARM용 AXD 디버거와 비교 실험을 진행하였다.

A Bitmap Index for Chunk-Based MOLAP Cubes (청크 기반 MOLAP 큐브를 위한 비트맵 인덱스)

  • Lim, Yoon-Sun;Kim, Myung
    • 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.

Comparison of the transformation methods for Flash Videos to Web Videos (플래시 비디오에서 웹비디오로의 변환기법 비교)

  • Lee, Hyun-Lee;Kim, Kyoung-Soo;Ceong, Hee-Taek
    • Journal of Digital Contents Society
    • /
    • v.11 no.4
    • /
    • pp.579-588
    • /
    • 2010
  • Generalization of the web, development of one-person media such as the blog and mini homepage, and integration of video digital devices have generalized multimedia video services on the web. However, flash videos, the previously used bit map-based multimedia videos, exhibit problems like the waterfall phenomenon, lag phenomenon, or non-synchronization of audios or videos. Thereupon, This study is conducted to suggest a converting technique to provide efficient web video service on the web by solving problems of bitmap-based flash video through file format-converting software and movie editing programs. And this paper also conducts experiments on five videos for 13 CODECs and analyzes converted results comparatively. The recommendable method considering the characteristics of each videos is to utilize MainConcept H.264 Video CODEC using SWF2Video pro. The result of this research can be used to produce web videos on the web more effectively.

Design and Implementation of Optimal Path Search Service Using GPS Information in Photo File (사진에 포함된 GPS정보를 이용한 최적화된 경로탐색 서비스 설계 및 구현)

  • Kim, Jun-Yeong;Kim, Seog-Gyu
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.12
    • /
    • pp.199-207
    • /
    • 2012
  • In this paper, we designed and implemented path search system using GPS information in photo. The system extracts EXIF information included in a photo to get path information and performs path search by applying the shortest path algorithm with the use of GPS information out of information, which was extracted in this way. And then it shows the obtained path information on web by utilizing Yahoo Map API. For this, the system is designed using a method of extracting location information in a photo and path sorting through applying the shortest path algorithm. UI(User Interface) was implemented using Yahoo Map API. Based on that, we implemented path search service using photo file that is included GPS information.

Compensation for Distorted WDM Signals by Periodic-shaped Dispersion Map and Non-midway Optical Phase Conjugator (주기적 구조의 분산 맵과 Non-midway 광 위상 공액기에 의한 왜곡된 WDM 신호의 보상)

  • Kweon, Soon-Nyu;Lee, Seong-Real
    • Journal of Advanced Navigation Technology
    • /
    • v.26 no.1
    • /
    • pp.22-28
    • /
    • 2022
  • In order to install ultra wide band and ultra long-haul transmission link based on standard single mode fiber, optical signal distortion due to chromatic dispersion and nonlinear Kerr effect must to be compensated. In this paper, optical link consisted of dispersion management and optical phase conjugation is proposed for compensation of the distorted wavelength division multiplexed (WDM) channels. Dispersion map profile in the proposed dispersion-managed link is configured by periodic repetitive shape, and optical phase conjugator is placed at various position including the midway of total transmission length. It is confirmed from simulation results that when the residual dispersion per span (RDPS) selected in the proposed dispersion-managed link to be large, the compensation of distorted WDM channels in the non-midway OPC system is more improved than the conventional dispersion-managed link.

Research on optimal safety ship-route based on artificial intelligence analysis using marine environment prediction (해양환경 예측정보를 활용한 인공지능 분석 기반의 최적 안전항로 연구)

  • Dae-yaoung Eeom;Bang-hee Lee
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2023.05a
    • /
    • pp.100-103
    • /
    • 2023
  • Recently, development of maritime autonomoust surface ships and eco-friendly ships, production and evaluation research considering various marine environments is needed in the field of optimal routes as the demand for accurate and detailed real-time marine environment prediction information expands. An algorithm that can calculate the optimal route while reducing the risk of the marine environment and uncertainty in energy consumption in smart ships was developed in 2 stages. In the first stage, a profile was created by combining marine environmental information with ship location and status information within the Automatic Ship Identification System(AIS). In the second stage, a model was developed that could define the marine environment energy map using the configured profile results, A regression equation was generated by applying Random Forest among machine learning techniques to reflect about 600,000 data. The Random Forest coefficient of determination (R2) was 0.89, showing very high reliability. The Dijikstra shortest path algorithm was applied to the marine environment prediction at June 1 to 3, 2021, and to calculate the optimal safety route and express it on the map. The route calculated by the random forest regression model was streamlined, and the route was derived considering the state of the marine environment prediction information. The concept of route calculation based on real-time marine environment prediction information in this study is expected to be able to calculate a realistic and safe route that reflects the movement tendency of ships, and to be expanded to a range of economic, safety, and eco-friendliness evaluation models in the future.

  • PDF

An Efficient Address Mapping Table Management Scheme for NAND Flash Memory File System Exploiting Page Address Cache (페이지 주소 캐시를 활용한 NAND 플래시 메모리 파일시스템에서의 효율적 주소 변환 테이블 관리 정책)

  • Kim, Cheong-Ghil
    • Journal of Digital Contents Society
    • /
    • v.11 no.1
    • /
    • pp.91-97
    • /
    • 2010
  • Flash memory has been used by many digital devices for data storage, exploiting the advantages of non-volatility, low power, stability, and so on, with the help of high integrity, large capacity, and low price. As the fast growing popularity of flash memory, the density of it increases so significantly that its entire address mapping table becomes too big to be stored in SRAM. This paper proposes the associated page address cache with an efficient table management scheme for hybrid flash translation layer mapping. For this purpose, all tables are integrated into a map block containing entire physical page tables. Simulation results show that the proposed scheme can save the extra memory areas and decrease the searching time with less 2.5% of miss ratio on PC workload and can decrease the write overhead by performing write operation 33% out of total writes requested.

A GPU-enabled Face Detection System in the Hadoop Platform Considering Big Data for Images (이미지 빅데이터를 고려한 하둡 플랫폼 환경에서 GPU 기반의 얼굴 검출 시스템)

  • Bae, Yuseok;Park, Jongyoul
    • KIISE Transactions on Computing Practices
    • /
    • v.22 no.1
    • /
    • pp.20-25
    • /
    • 2016
  • With the advent of the era of digital big data, the Hadoop platform has become widely used in various fields. However, the Hadoop MapReduce framework suffers from problems related to the increase of the name node's main memory and map tasks for the processing of large number of small files. In addition, a method for running C++-based tasks in the MapReduce framework is required in order to conjugate GPUs supporting hardware-based data parallelism in the MapReduce framework. Therefore, in this paper, we present a face detection system that generates a sequence file for images to process big data for images in the Hadoop platform. The system also deals with tasks for GPU-based face detection in the MapReduce framework using Hadoop Pipes. We demonstrate a performance increase of around 6.8-fold as compared to a single CPU process.

Fabrication Process of a Nano-precision Polydimethylsiloxane Replica using Vacuum Pressure-Difference Technique (진공 압력차이법에 의한 나노 정밀도를 가지는 폴리디메틸실록산 형상복제)

  • 박상후;임태우;양동열;공홍진;이광섭
    • Polymer(Korea)
    • /
    • v.28 no.4
    • /
    • pp.305-313
    • /
    • 2004
  • A vacuum pressure-difference technique for making a nano-precision replica is investigated for various applications. Master patterns for replication were fabricated using a nano-replication printing (nRP) process. In the nRP process, any picture and pattern can be replicated from a bitmap figure file in the range of several micrometers with resolution of 200nm. A liquid-state monomer is solidified by two-photon absorption (TPA) induced by a femto-second laser according to a voxel matrix scanning. After polymerization, the remaining monomers were removed simply by using ethanol droplets. And then, a gold metal layer of about 30nm thickness was deposited on the fabricated master patterns prior to polydimethylsiloxane molding for preventing bonding between the master and the polydimethylsiloxane mold. A few gold particles attached on the polydimethylsiloxane stamp during detaching process were removed by a gold selecting etchant. After fabricating the polydimethylsiloxane mold, a nano-precision polydimethylsiloxane replica was reproduced. More precise replica was produced by the vacuum pressure-difference technique that is proposed in this paper. Through this study, direct patterning on a glass plate, replicating a polydimethylsiloxane mold, and reproducing polydimethylsiloxane replica are demonstrated with a vacuum pressure-difference technique for various micro/nano-applications.

Distributed Table Join for Scalable RDFS Reasoning on Cloud Computing Environment (클라우드 컴퓨팅 환경에서의 대용량 RDFS 추론을 위한 분산 테이블 조인 기법)

  • Lee, Wan-Gon;Kim, Je-Min;Park, Young-Tack
    • Journal of KIISE
    • /
    • v.41 no.9
    • /
    • pp.674-685
    • /
    • 2014
  • The Knowledge service system needs to infer a new knowledge from indicated knowledge to provide its effective service. Most of the Knowledge service system is expressed in terms of ontology. The volume of knowledge information in a real world is getting massive, so effective technique for massive data of ontology is drawing attention. This paper is to provide the method to infer massive data-ontology to the extent of RDFS, based on cloud computing environment, and evaluate its capability. RDFS inference suggested in this paper is focused on both the method applying MapReduce based on RDFS meta table, and the method of single use of cloud computing memory without using MapReduce under distributed file computing environment. Therefore, this paper explains basically the inference system structure of each technique, the meta table set-up according to RDFS inference rule, and the algorithm of inference strategy. In order to evaluate suggested method in this paper, we perform experiment with LUBM set which is formal data to evaluate ontology inference and search speed. In case LUBM6000, the RDFS inference technique based on meta table had required 13.75 minutes(inferring 1,042 triples per second) to conduct total inference, whereas the method applying the cloud computing memory had needed 7.24 minutes(inferring 1,979 triples per second) showing its speed twice faster.