• Proceedings of the Korea Water Resources Association Conference
• /
• 2009.05a
• /
• pp.997-1001
• /
• 2009

GIS 기반의 HEC-HMS를 이용하여 유량자료가 있는 소하천인 정자천 유역을 대상으로 장기 강우 유출 분석을 하였다. 일반적으로 홍수량 산정은 단기해석으로 분석하나 평 갈수기와 홍수기 때의 하천 유황이 다르기 때문에 매개변수가 불일치할 것이라 생각되고, 이에 대한 보정이 필요한지 판단이 필요하다. 이를 위해 장기 연속모의를 통하여 매개변수의 보정 필요성을 검토하였다. 연구는 수치지도를 조합하여 ARC-VIEW로부터 Map파일 및 Basin파일을 생성하였고, 토지이용도와 토양도를 ARC-VIEW를 이용하여 CN value를 추출하였다. 계산조건중 손실량 산정방법은 SCS Curve Number법으로 하였고, 단위도 방법은 Clark UH법, 하도추적방법은 Muskingum방법, 기저유량산정방법은 Constant monthly로 설정하였다. 유역면적, 도달시간자료, 저류상수 값 등의 추출은 GIS기법을 이용하여 추출하였다. HEC-HMS의 장기 연속모의(Continuous Simulation)로 얻어진 Element Graph를 보면 대략적인 형태가 일치하나 2006년도에 대한 모의에서는 홍수기의 결과만 일치하는 것으로 보이고, 2007년도에 대한 모의에서는 평 갈수기와 홍수기의 그래프 형태가 유사하게 나타났다. 실측 유량보다 유량 값이 약간 크게 산출되어 홍수량 산정에서 볼 때 안정성에 무리가 없다고 판단되지만, 평 갈수기 기간에서 볼 때 연마다 하천의 매개변수가 일치하지 않는다고 생각되며, 홍수 후 유역의 변화로 매개변수가 변화한 것이라 생각된다. 향후 정자천유역의 보다 많은 강우사상과 실측유량을 통해 HEC-HMS의 유출량을 비교 분석하면 보다 더 정확한 해석이 가능할 것이며, 홍수가 빈번한 지역의 경우 유수지의 검토와 저수지의 시간당 방류량을 알 수 있다면 오차의 범위를 줄일 수 있다고 생각된다. 더 나아가 우리나라에 적합한 매개변수와 GIS 프로그램이 개발된다면 보다 쉽고 정확한 해석이 가능할 것이라고 생각된다.

• Journal of Intelligence and Information Systems
• /
• v.13 no.3
• /
• pp.101-117
• /
• 2007

In this paper, we propose a customized genetic algorithm (GA) to find the minimum-cost guideway network (GN) of personal rapid transit (PRT) subject to connectivity, reliability, and traffic capacity constraints. PRT is a novel transportation concept, where a number of automated taxi-sized vehicles run on an elevated GN. One of the most important problems regarding PRT is how to design its GN topology for given station locations and the associated inter-station traffic demands. We model the GN as a directed graph, where its cost, connectivity, reliability, and node traffics are formulated. Based on this formulation, we develop the GA with special genetic operators well suited for the GN design problem. Such operators include steady state selection, repair algorithm, and directed mutation. We perform numerical experiments to determine the adequate GA parameters and compare its performance to other optimization algorithms previously reported. The experimental results verify the effectiveness and efficiency of the proposed approach for the GN design problem having up to 210 links.

• Journal of Advanced Navigation Technology
• /
• v.18 no.2
• /
• pp.151-157
• /
• 2014

Recently UAV(unmanned aerial vehicle) is frequently used not only for military purpose but also for civil purpose. UAV automatically navigates following the coordinates input in advance using GPS information. However it is impossible when GPS cannot be received because of jamming or external interference. In order to solve this problem, we propose a real-time segmentation and classification algorithm for the specific regions from UAV image in this paper. We use the super-pixels algorithm using graph-based image segmentation as a pre-processing stage for the feature extraction. We choose the most ideal model by analyzing various color models and mixture color models. Also, we use support vector machine for classification, which is one of the machine learning algorithms and can use small quantity of training data. 18 color and texture feature vectors are extracted from the UAV image, then 3 classes of regions; river, vinyl house, rice filed are classified in real-time through training and prediction processes.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.83-86
• /
• 1996

In this paper we study the problem of augmenting a physical network to improve the topology for new survivable network architectures. We are given a graph G=(V,E,F), where V is a set of nodes that represents transmission systems which be interconnected by physical links, and E is a collection of edges that represent the possible pairs of nodes between which a direct transmission link can be placed. F, a subset of E is defined as a set of the existing direct links, and E/F is defined as a set of edges for the possible new connection. The cost of establishing network $N_{H}$=(V,H,F) is defined by the sum of the costs of the individual links contained in new link set H. We call that $N_{H}$=(V,H,F) is feasible if certain connectivity constrints can be satisfied in $N_{H}$=(V,H,F). The computational goal for the suggested model is to find a minimum cost network among the feasible solutions. For a k edge (node) connected component S .subeq. F, we charactrize some optimality conditions with respect to S. By this characterization we can find part of the network that formed by only F-edges. We do not need to augment E/F edges for these components in an optimal solution. Hence we shrink the related component into a node. We study some good primal heuristics by considering construction and exchange ideas. For the construction heuristics, we use some greedy methods and relaxation methods. For the improvement heuristics we generalize known exchange heuristics such as two-optimal cycle, three-optimal cycle, pretzel, quezel and one-optimal heuristics. Some computational experiments show that our heuristic is more efficient than some well known heuristics.stics.

• Korean Journal of Clinical Laboratory Science
• /
• v.39 no.3
• /
• pp.156-160
• /
• 2007

We evaluated the newly developed plastic sodium citrate tubes for routine coagulation test by direct comparison with glass citrate theophylline adenosine dipyridamole (CTAD) tubes. Blood was drawn from 100 patients into glass CTAD tubes and plastic sodium citrate tubes. After collection, samples were centrifuged at 1500 ${\times}$g for 15 min at $22^{\circ}C$. Prothrombin time (PT), activated partial thromboplastin time (aPTT), fibrinogen were measured by using the Coagrex-800 (IRC, Japan). We used comparison plot by linear regression model and difference plot graphs to compare the results of the independent measurements of PT, aPTT, fibrinogen between glass CTAD tubes and plastic sodium citrate tubes. On the comparison study between glass CTAD tubes and plastic sodium citrate tubes, the correlation coefficients (R) were 0.99 for PT, 0.97 for aPTT and 0.97 for fibrinogen. This results implicated good correlation of each parameter between two tubes. Although the difference plot graph analysis showed statistically significant differences between glass and plastic tubes for PT, aPTT and fibrinogen, the range of difference was acceptable according to the CLSI/NCCLS guideline. The plastic sodium citrate tubes showed good correlation with the glass CTAD tubes, so it can substitute glass citrate tube for routine coagulation tests.

• Journal of Computing Science and Engineering
• /
• v.7 no.4
• /
• pp.285-299
• /
• 2013

To enable hard real-time systems to take advantage of multicore processors, it is crucial to obtain the worst-case execution time (WCET) for programs running on multicore processors. However, this is challenging and complicated due to the inter-thread interferences from the shared resources in a multicore processor. Recent research used the combined cache conflict graph (CCCG) to model and compute the worst-case inter-thread interferences on a shared L2 cache in a multicore processor, which is called the CCCG-based approach in this paper. Although it can compute the WCET safely and accurately, its computational complexity is exponential and prohibitive for a large number of cores. In this paper, we propose three counter-based approaches to significantly reduce the complexity of the multicore WCET analysis, while achieving absolute safety with tightness close to the CCCG-based approach. The basic counter-based approach simply counts the worst-case number of cache line blocks mapped to a cache set of a shared L2 cache from all the concurrent threads, and compares it with the associativity of the cache set to compute the worst-case cache behavior. The enhanced counter-based approach uses techniques to enhance the accuracy of calculating the counters. The hybrid counter-based approach combines the enhanced counter-based approach and the CCCG-based approach to further improve the tightness of analysis without significantly increasing the complexity. Our experiments on a 4-core processor indicate that the enhanced counter-based approach overestimates the WCET by 14% on average compared to the CCCG-based approach, while its averaged running time is less than 1/380 that of the CCCG-based approach. The hybrid approach reduces the overestimation to only 2.65%, while its running time is less than 1/150 that of the CCCG-based approach on average.

• The Journal of the Korea Contents Association
• /
• v.7 no.2
• /
• pp.1-10
• /
• 2007

In this paper, we propose a face recognition system using AAM and Gabor feature vectors. EBGM, which is prominent among face recognition algorithms employing Gabor feature vectors, requires localization of facial feature points where Gabor feature vectors are extracted. However, localization of facial feature points employed in EBGM is based on Gator jet similarity and is sensitive to initial points. Wrong localization of facial feature points affects face recognition rate. AAM is known to be successfully applied to localization of facial feature points. In this paper, we propose a facial feature point localization method which first roughly estimate facial feature points using AAM and refine facial feature points using Gabor jet similarity-based localization method with initial points set by the facial feature points estimated from AAM, and propose a face recognition system based on the proposed localization method. It is verified through experiments that the proposed face recognition system using the combined localization performs better than the conventional face recognition system using the Gabor similarity-based localization only like EBGM.

• Journal of Satellite, Information and Communications
• /
• v.11 no.4
• /
• pp.102-106
• /
• 2016

With the popularity of smart phones and the help of high-speed wireless communication technology, high-quality multimedia contents have become common in mobile devices. Especially, the release of Oculus Rift opens a new era of virtual reality technology in consumer market. At the same time, 3D audio technology which is currently used to make computer games more realistic will soon be applied to the next generation of mobile phone and expected to offer a more expansive experience than its visual counterpart. This paper surveys concepts, algorithms, and systems for modeling 3D sound virtual environment applications. To do this, we first introduce an important design principle for audio rendering based on physics-based geometric algorithms and multichannel technologies, and introduce an audio rendering pipeline to a scene graph-based virtual reality system and a hardware architecture to model sound propagation.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.1
• /
• pp.67-71
• /
• 2009

Recently, the string non-inclusion related problems have been studied vigorously. Given a set of strings F over a constant size alphabet, consider a string x such that x does not include any string in F as a substring. We call x a Common Non-SuperString(CNSS for short) of F. Among the CNSS's of F, the longest one with finite length is called the Longest Common Non-SuperString(LCNSS for short) of F. In this paper, we first propose a new graph model using prefixes of F. Next, we suggest an O(N)-time algorithm for finding the LCNSS of F, where N is the sum of the lengths of all the strings in F.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.1
• /
• pp.86-96
• /
• 1998

The class hierarchy structure in an object-oriented design model is effective to the software reusabilily and lhe design of complex syslem. This paper suggests lhe objecl-orienled class hierarchy structure design melhod using lhe rapid prololyping lechniques. In this method, relationship recognition and similarity are estimated by the new class classification in object modeling level. Then lhe estimation of aUribute and method in class is needed. Each design module such as class hierarchy struclure which is generaled wilh inleractive and repealed work consisls of reference relationship, inheritance relationship and composite relationship. These information are slored in lhe table to maintenance lhe program and implementation, the class relationship is represented with graph and the node class is iconized. This method is effective in reslructuring of class hierarchy are reusing of design information, because of addition of new class and deletion with ease. The efficiency of syslem analysis, design and implementation is enhanced by converting into prololype system and real system.