• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.28 no.2
• /
• pp.265-271
• /
• 2010

This paper discusses a new software package, DEM_Comp, developed for effectively compressing large digital elevation model (DEM) data sets based on Lempel-Ziv-Welch (LZW) compression and Huffman coding. DEM_Comp was developed using the $C^{++}$ language running on a Windows-series operating system. DEM_Comp was also tested on various test sites with different territorial attributes, and the results were evaluated. Recently, a high-resolution version of the DEM has been obtained using new equipment and the related technologies of LiDAR (LIght Detection And Radar) and SAR (Synthetic Aperture Radar). DEM compression is useful because it helps reduce the disk space or transmission bandwidth. Generally, data compression is divided into two processes: i) analyzing the relationships in the data and ii) deciding on the compression and storage methods. DEM_Comp was developed using a three-step compression algorithm applying a DEM with a regular grid, Lempel-Ziv compression, and Huffman coding. When pre-processing alone was used on high- and low-relief terrain, the efficiency was approximately 83%, but after completing all three steps of the algorithm, this increased to 97%. Compared with general commercial compression software, these results show approximately 14% better performance. DEM_Comp as developed in this research features a more efficient way of distributing, storing, and managing large high-resolution DEMs.

• 한국신재생에너지학회:학술대회논문집
• /
• 2011.11a
• /
• pp.41.2-41.2
• /
• 2011

NREL NWTC Deside codes are analyzed and introduced to develop the system performance simulation program for wind turbine generator systems. In this paper, The AirfoilPrep generating the airfoil data, the IECWind generating hub-height wind data with extreme condition following IEC 61400-1, the TurbSim generating stochastic full-field turbulent wind data, the PreComp calculating structural and dynamic properties of composite blade and the BModes making mode shapes of blade and tower are explained respectively.

• Proceedings of the CALSEC Conference
• /
• 2001.08a
• /
• pp.671-679
• /
• 2001

사례연구를 통하여 UML Component Design Process의 일관성 및 정확성을 검증한다. Business Concept Model과 Use Case Model을 이용하여 Component Specification Process의 산출물인 Interface, Component Specification 및 Component Architecture 작성 UML Notation을 확장해서 Component 명세에 적용하는 것이 올바른 것인지 확인한다. <>,<>,<>,<>,<>, <>:로 Component Specification이 충분한지를 확인 OCL을 이용하여 Component Specification 중 Component Specification, Interface Specification, Operation Specification, Constraint, Pre/Post Condition의 정의에 유용한지 확인(중략)

• 기계와재료
• /
• v.23 no.4
• /
• pp.74-83
• /
• 2011

풍력발전기 동적 시뮬레이션 프로그램 개발을 위해 미국풍력기술연구센터(NWTC)의 프로그램군에 대해 분석하고 이를 소개하였다. 본 편에서는 에어포일 데이터를 생성하는 AirfoilPrep, IEC 61400-1 기준의 극한 조건에 해당하는 허브 높이의 바람 데이터를 생성하는 IECWind, 통계적인 방법에 의해 전 영역에 대한 난류 바람 데이터를 생성하는 TurbSim, 복합재료 블레이드의 구조적 특성치를 계산하는 PreComp, 블레이드와 타워의 모드 형상을 구하는 BModes와 같은 전처리기를 중심으로 설명하였다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.3
• /
• pp.1451-1458
• /
• 2013

This paper deals with the programs and algorithms that generate the full data set that satisfy the basic combinatorial requirement of combination, permutation, partial permutation or shortly r-permutation, which are used in the application of the total data testing or the simulation input. We search the programs able to meet the rules which is permutations and combinations, r-permutations, select the fastest program by field. With further study, we developed a new program reducing the time required to processing. Our research performs the following pre-study. Firstly, hundreds of algorithms and programs in the internet are collected and corrected to be executable. Secondly, we measure running time for all completed programs and select a few fast ones. Thirdly, the fast programs are analyzed in depth and its pseudo-code programs are provided. We succeeded in developing two programs that run faster. Firstly, the combination program can save the running time by removing recursive function and the r-permutation program become faster by combining the best combination program and the best permutation program. According to our performance test, the former and later program enhance the running speed by 22% to 34% and 62% to 226% respectively compared with the fastest collected program. The programs suggested in this study could apply to a particular cases easily based on Pseudo-code., Predicts the execution time spent on data processing, determine the validity of the processing, and also generates total data with minimum access programming.