• The Journal of the Korea Contents Association
• /
• v.16 no.8
• /
• pp.706-716
• /
• 2016

Because of efficient space utilization and fast key search times, B-trees have been widely accepted for the use of indexes in HDD-based DBMSs. However, when the B-ree is stored in flash memory, its costly operations of node updates may impair the performance of a DBMS. This is because the random updates in B-tree's leaf nodes could tremendously enlarge I/O costs for the garbage collecting actions of flash storage. To solve the problem, we make all the parents of leaf nodes the virtual nodes, which are not stored physically. Rather than, those nodes are dynamically generated and buffered by referring to their child nodes, at their access times during key searching. By performing node updates and tree reconstruction within a single flash block, our proposed B-tree can reduce the I/O costs for garbage collection and update operations in flash. Moreover, our scheme provides the better performance of key searches, compared with earlier flash-based B-trees. Through a mathematical performance model, we verify the performance advantages of the proposed flash B-tree.

• Journal of the Korean Geosynthetics Society
• /
• v.14 no.4
• /
• pp.147-158
• /
• 2015

In this study, sewer backfill material was developed to prevent sewer damage and ground subsidence. Laboratory test was performed in the field of CA replacement ratio, accelerator type and replacement ratio and W/M. The compression strength of backfill material was 0.55~0.64MPa below in W/M 70% and 0.20MPa over W/B 80%. Ice block was used to simulate the ground cavity and subsidence caused by sewer damage in application study. The existing sand compaction and the new backfill material was comparative estimated in field. The ground settlement of cross section was 23.4cm and that of longitudinal section was 27cm in sand compaction section, but the ground had not sunk in backfill material section.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.10C
• /
• pp.787-797
• /
• 2008

In this paper, we propose a fast disparity estimation method considering temporal and spatial redundancy based on a dynamic programming for stereo matching. For the first step, the dynamic programming is performed to estimate disparity vectors with correlation between neighboring pixels in an image. Next, we efficiently compensate regions, which disparity vectors are not allocated, with neighboring disparity vectors assuming that disparity vectors in same object are quite similar. Moreover, in case of video sequence, we can decrease a complexity with temporal redundancy between neighboring frames. For performance comparison, we generate an intermediate-view image using the estimated disparity vector. Test results show that the proposed algorithm gives $0.8{\sim}2.4dB$-increased PSNR(peak signal to noise ratio) compared to a conventional block matching algorithm, and the proposed algorithm also gives approximately 0.1dB-increased PSNR and $48{\sim}68%$-lower complexity compared to the disparity estimation method based on general dynamic programming.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.2A
• /
• pp.137-145
• /
• 2002

In the method of 3D modeling, stereo matching method which obtains three dimensional depth information from the two images is taken from the different view points. In general, it is very essential work for the 3D modeling from 2D stereo images to estimate the exact disparity through fading the conjugate pair of pixel from the left and right image. In this paper to solve the problems of the stereo image disparity estimation, we introduce a novel approach method to improve the exactness and efficiency of the disparity. In the first place, we perform a wavelet transformation of the stereo images and set the reference points in the image by the feature-based matching method. This reference points have very high probability over 95 %. In the base of these reference points we can decide the size of the variable block searching windows for estimating dense disparity of area based method and perform the ordering constraint to prevent mismatching. By doing this, we could estimate the disparity in a short time and solve the occlusion caused by applying the fried-sized windows and probable error caused by repeating patterns.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2001.05a
• /
• pp.143-143
• /
• 2001

조선 산업에서의 이익 극대화를 위해서는, 공기 단축을 통한 매출 증대, 주어진 생산 자원(인력, 설비 등)의 효율적인 이용을 통한 생산비 절감이 필수적인 사안이다. 다시 말하면, 효율적인 자원의 이용으로 선박의 건조 공기를 줄임으로써 조선 산업에서의 이익 극대화를 도모할 수 있고 이는 효과적인 생산 계획과 관리를 통해 얻을 수 있다. 조선 산업에서의 생산 계획과 관리는 내업, 선행, 선내 등 선박 건조의 전 과정에서 이루어지고 있는데, 조선 산업은 타 산업에 비해 환경변화에 따른 단기간의 불확실성은 비교적 적은 반면에, 가공, 절단, 조립, 의장, 도장, 선행탑재, 탑재, 안벽 작업 등 다단계 제조 프로세스가 장기간에 걸쳐 상당히 복잡하게 구성되어 있다. 또한, 유연하게 적용할 수 있는 인적자원과 공정순서, 그리고 각종 시간적 공간적 자원 제약 등으로 인하여 효과적이고 일관된 생산 계획을 신속하게 수립하기가 어려울 뿐만 아니라, 주문 생산 방식이기 때문에 정확한 일정계획 데이터의 생성도 어려운 실정이다. 본 연구는, 조선의 혁신적인 생산관리 능력 향상을 지원하기 위한 "조선 통합 생산계획 시스템 개발" 에 관련된 연구이다. 본 연구에서는 조선 생산계획에 적합한 일정계획 방법론 및 엔진 소프트웨어를 활용하고 총체적인 생산계획 및 일정계획 업무의 개념 재정립을 통하여, 통합 최적화를 실시간에 지원하는 조선 최적 일정계획 시스템 구축에 궁극적인 목적을 두고 있다. 이를 위해 본 연구에서는 조선 프로세스와 일정계획 업무규칙을 분석하고 이를 바탕으로 "조선 최적 일정계획 시스템"을 개발하였다. 조선 최적 일정계획 시스템은 블록, PE, 탑재, 선내 단계의 일정계획 최적화와 What-if Simulation을 지원하기 위하여 ILOG Solver/scheduler로 구현하였으며, 구현된 시스템에 대해 실제 계획에서 사용하는 데이터를 대상으로 다양한 최적화 기능에 대한 실험을 실시하였다. 실제 데이터를 이용한 실험결과, 풀이시간과 최적해 측면 모두에서 비교적 만족할 만한 결과를 보여주었다.교적 만족할 만한 결과를 보여주었다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1C
• /
• pp.28-36
• /
• 2009

Time-memory trade-off (TMTO) cryptanalysis proposed by Hellman can be applied for the various crypto-systems such as block ciphers, stream ciphers, and hash functions. In this paper, we propose a novel method to reduce memory size for storing TMTO tables. The starting points in a TMTO table can be substituted by the indices of n-bit samples from a sequence in a family of pseudo-random sequences with good cross-correlation, which results in the reduction of memory size for the starting points. By using this method, it is possible to reduce the memory size by the factor of 1/10 at the cost of the slightly increasing of operation time in the online phase. Because the memory is considered as more expensive resource than the time, the TMTO cryptanalysis will be more feasible for many real crypto systems.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2017.05a
• /
• pp.21-21
• /
• 2017

최근 서울, 부산, 울산 등에서 도시 돌발홍수가 빈번히 발생하고 있고 이에 따른 인명 손실 및 재산 피해가 빠르게 증가하고 있다. 그러나 집중 호우의 대부분은 저고도 대기에서 생성 및 발달되며, 소멸까지의 시간은 2-3 시간에 불과하여 기존의 우리나라 수문기상 관측시스템은 이러한 유형의 강우량 예측에 많은 어려움을 겪고 있는 실정이다. 이 문제를 해결하기 위해 기상, 재난 관련 정부 기관들이 저고도 수문기상 관측을 위한 도시형 X-밴드 레이더 네트워크 구축을 계획하고 있다. 본 연구의 목적은 그보다 선행하여 돌발성 수문기상 재해연구를 위해 한국건설기술연구원에서 도입한 X-band 이중 편파 레이더 시스템을 이용하여 보다 간단하고 정확한 재난 감시 및 예경보 시스템을 개발하는데 있다. 본 연구에서는 X-밴드 레이더 데이터로부터 추정된 정량적 강수량을 모니터링 하여 도시 지역의 돌발홍수를 자동으로 경고하는 방법을 제안한다. 또한 Google 어스 플랫폼을 사용하여 정확한 3D QPE-GIS 매칭 기법을 개발함으로써, 심각한 수문기상 현상이 발생하는 정확한 위치를 추적하고 직관적인 경보서비스를 가능케 한다. 본 연구에서 제안하는 경보시스템은 레이더 데이터 분석도구, 위험결정 도구 및 위험경고 표시 도구의 세 가지 기술로 구성된다. 제안된 돌발홍수 경보시스템은, 시뮬레이션을 통해 X-밴드 레이더 데이터로부터 정량적 강수량이 계산되며, GIS 상에서 레이더 반사도 및 강우강도가 3차원 이미지 형태로 표시된다. 그런 다음 Google 어스에서 3D 큐브 블록으로 대표되는 강수량이 동시에 누적표출 되도록 설계되었다. 또한 분석된 X-밴드 레이더 데이터로부터 지역별 누적 강수량을 업데이트 및 모니터링하고 기 설정된 돌발홍수 발생 한계치(trigger)에 도달하면 홍수경보 메시지를 표시한다. 향후, 제안된 경보시스템에 대한 기술적 도구를 개선하면서 대규모 수문기상 레이더 네트워크로 광범위한 강우를 모니터링하면 전국적인 돌발홍수 경보시스템으로 확대가 가능하다.

• Journal of Cadastre & Land InformatiX
• /
• v.53 no.1
• /
• pp.21-36
• /
• 2023

Activity-based modeling systems have increasingly been developed to address the limitations of widely used traditional four-step transportation demand forecasting models. Accordingly, this paper introduces the Activity-BAsed Traveler Analyzer (ABATA) system. This system consists of multiple components, including an hourly total population estimator, activity profile constructor, hourly activity population estimator, spatial activity population estimator, and origin/destination estimator. To demonstrate the proposed system, the emission impact of land use changes in the 5-1 block Sejong smart city is evaluated as a case study. The results indicate that the land use with the scenario of work facility dispersed plan produced more emissions than the scenario of work facility centralized plan due to the longer travel distance. The proposed ABATA system is expected to provide a valuable tool for simulating the impacts of future changes in population, activity schedules, and land use on activity populations and travel demands.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.38 no.1
• /
• pp.79-85
• /
• 2001

In this paper, we propose a new technology mapping algorithm for CPLD consider area under time constraint(TMFCPLD). This technology mapping algorithm detect feedbacks from boolean networks, then variables that have feedback are replaced to temporary variables. Creating the temporary variables transform sequential circuit to combinational circuit. The transformed circuits are represented to DAG. After traversing all nodes in DAG, the nodes that have output edges more than two are replicated and reconstructed to fanout free tree. This method is for reason to reduce area and improve total run time of circuits by TEMPLA proposed previously. Using time constraints and delay time of device, the number of graph partitionable multi-level is decided. Initial cost of each node are the number of OR-terms that it have. Among mappable clusters, clusters of which the number of multi-level is least is selected, and the graph is partitioned. Several nodes in partitioned clusters are merged by collapsing, and are fitted to the number of OR-terms in a given CLB by bin packing. Proposed algorithm have been applied to MCNC logic synthesis benchmark circuits, and have reduced the number of CLBs by 62.2% than those of DDMAP. And reduced the number of CLBs by 17.6% than those of TEMPLA, and reduced the number of CLBs by 4.7% than those of TMCPLD. This results will give much efficiency to technology mapping for CPLDs.

• The Journal of the Convergence on Culture Technology
• /
• v.9 no.1
• /
• pp.649-654
• /
• 2023

This paper proposes the design of a neural network structure search model using graph convolutional neural networks. Deep learning has a problem of not being able to verify whether the designed model has a structure with optimized performance due to the nature of learning as a black box. The neural network structure search model is composed of a recurrent neural network that creates a model and a convolutional neural network that is the generated network. Conventional neural network structure search models use recurrent neural networks, but in this paper, we propose GC-NAS, which uses graph convolutional neural networks instead of recurrent neural networks to create convolutional neural network models. The proposed GC-NAS uses the Layer Extraction Block to explore depth, and the Hyper Parameter Prediction Block to explore spatial and temporal information (hyper parameters) based on depth information in parallel. Therefore, since the depth information is reflected, the search area is wider, and the purpose of the search area of the model is clear by conducting a parallel search with depth information, so it is judged to be superior in theoretical structure compared to GC-NAS. GC-NAS is expected to solve the problem of the high-dimensional time axis and the range of spatial search of recurrent neural networks in the existing neural network structure search model through the graph convolutional neural network block and graph generation algorithm. In addition, we hope that the GC-NAS proposed in this paper will serve as an opportunity for active research on the application of graph convolutional neural networks to neural network structure search.