• Title/Summary/Keyword: Nesting 기법

Search Result 23, Processing Time 0.025 seconds

Development of flash flood forecasting model using method (Nesting 기법을 이용한 돌발홍수 예측모형 개발)

  • Ji, Hee-Sook;Bae, Deg-Hyo
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2012.05a
    • /
    • pp.403-403
    • /
    • 2012
  • 최근 단시간 동안에 특정지역에 집중되는 국지적 호우에 의한 돌발홍수가 빈번히 발생하고 있으며, 이에 따른 위험과 손실이 증가하고 있는 추세이다. 현재 국내에서는 이러한 피해를 최소화하고자 돌발홍수 예측모형을 개발하고 예 경보 시스템을 구축하여 다양한 비구조적 대책을 마련하고 있다. 그러나 활용되는 예측모형의 경우 개념적 유출량인 한계유출량으로부터 돌발홍수능(Flash Flood Guidance, FFG)을 결정하여 예측 강우와 상대적인 대소 비교를 통해 돌발홍수의 발생가능성 유무를 판단하게 되는데, 문제는 산정되는 한계유출량은 개념적이기 때문에 검증이 어렵고 산정방법도 다양하여 불확실성이 높다는 단점이 있다. 이에 본 연구에서는 기존의 돌발홍수 예측 방법이 아닌, 수문모형 Nesting 기법을 이용한 돌발 홍수 예측 방법을 개발하였다. 저해상도의 대유역 기반의 유출량이 큰 영역의 경계값이 되고, 대유역을 이루고 있는 소유역을 고해상도의 작은 영역이라 할 때, 경계값인 대유역의 기반의 유출량을 참고 유출량으로 하여 소유역의 유출을 물리적 혹은 개념적으로 보다 타당하게 모의하는 방법이 수문모형 Nesting 기법이다. 이러한 기법에 필요한 강우-유출 모형으로는 대유역의 경우, SURR 모형(Sejong University Rainfall-Runoff model)을 선택하였으며, 대유역을 이루는 소유역의 유출모의는 물리적 기반의 분포형 모형인 CASC2D 모형을 이용하였다. 또한 실시간 활용을 위해서는 CASC2D 모형의 매개변수를 자동으로 추정하는 기술이 요구되며, 본 연구에서는 매개변수 전역 최적화 방법인 SCE-UA(The Shuffled Complex Evolution, University of Arizona) 기법을 활용하였다. 본 연구에서 사용한 수문모형의 적용성을 평가한 결과 대상유역에 대한 적용성이 높은 것으로 나타났으며, 연계된 두 모형의 유출거동이 유사하게 나타난 것으로 확인되었다. 본 연구에서는 Nesting 기법을 이용하여 0.5m 하천 수위의 상승 여부에 따라 돌발홍수의 발생 가능성을 예측하는 기법을 제안하였으며, 돌발홍수 사례와 일반호우사상으로부터 이 방법의 적용성을 평가하였다. 실제 돌발홍수가 발생한 유역을 선정하고 연계된 두 모형을 대상 유역에 적용한 결과 Nesting 기반의 돌발홍수 예측방법은 기존의 한계유출량 산정 방법에서 반영하지 못한 사상을 적절히 반영한 것으로 나타났다. 본 연구에서 개발한 Nesting 기법을 이용한 돌발홍수 예측모형은 일반적인 강우량 비교의 돌발홍수 예측방법에서 벗어나 새로운 돌발홍수 예측방법을 제안한 측면에서 큰 의미가 있다고 사료되며, 이러한 연구 결과는 실시간 돌발홍수 예측 시스템의 기본 모형으로 활용이 가능할 것으로 판단된다.

  • PDF

Nesting Expert System using Heuristic Search (휴리스틱 탐색 기법을 이용한 네스팅 전문가 시스템)

  • Sheen, Dong-Mok
    • Journal of Ocean Engineering and Technology
    • /
    • v.26 no.4
    • /
    • pp.8-14
    • /
    • 2012
  • Two dimensional nesting is a common problem in industries such as the shipbuilding, automotive, clothing, shoe-making, and furniture industries, in which various parts are cut off from stock or packed in a flat space while minimizing waste or unoccupied space. Nesting is known as an NP-complete problem, which has a solution time proportional to the superpolynomial of the input size. It becomes practically impossible to find an optimal solution using algorithmic methods as the number of shapes to nest increases. Therefore, heuristic methods are commonly used to solve nesting problems. This paper presents an expert system that uses a heuristic search method based on an evaluation function for nesting problems, in which parts and stock are represented by pixels. The system is developed in CLIPS, an expert system shell, and is applied to four different kinds of example problems to verify its applicability in practical problems.

A Study on the Generating Piece and Arrangement Method Using the Parametric Macro (파라메트릭 매크로기법에 의한 부재생성 및 부재배치방법에 관한 연구)

  • 한창봉;박제웅
    • Journal of the Korean Society of Propulsion Engineers
    • /
    • v.3 no.1
    • /
    • pp.55-64
    • /
    • 1999
  • Large size shipyards have peformed the generating of piece and the nesting using shipbuilding-oriented CAD program, which requires higher skilled operators and lots of costs. So, medium and small size shipyards have pursued different types of piece generation and nesting (arrangement method). This research is to develop a program for the generating of pieces with parametric macro method and a STRIP program for the nesting of pieces by PC, which can be applied in such shipyards.

  • PDF

An Effective Method for the Nesting on Several Irregular Raw Sheets (임의 형상의 여러 원자재 위에서의 효과적인 배치방안)

  • 조경호;이건우
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.19 no.8
    • /
    • pp.1854-1868
    • /
    • 1995
  • An effective nesting algorithm has been proposed to allocate the arbitrary shapes on one or several raw sheets by applying the well-known simulated annealing algorithm as the optimization technique. In this approach, both the shapes to be allocated and the raw sheets are represented as the grid-based models. This algorithm can accommodate every possible situations encountered in cutting apparel parts from the raw leather sheets. In other words, the usage of the internal hole of a shape for other small shapes, handling of the irregular boundaries and the interior defects of the raw sheets, and the simultaneous allocation on more than one raw sheets have been tackled on successfully in this study. Several computational experiments are presented to verify the robustness of the proposed algorithm.

Analyzing Access Histories for Detecting First Races in Shared-memory Programs (공유메모리 프로그램의 최초경합 탐지를 위한 접근역사 분석)

  • 강문혜;김영주;전용기
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.31 no.1_2
    • /
    • pp.41-50
    • /
    • 2004
  • Detecting races is important for debugging shared-memory Parallel programs, because races result in unintended nondeterministic executions of the programs. Particularly, the first races to occur in an execution of a program must be detected because they can potentially affect other races that occur later. Previous on-the-fly techniques that detect such first races based on candidate events that are likely to participate in the first races monitor access events in order to collect the candidate events during a program execution, and try to report the races only from determining the concurrency relationships of the candidates. Such races reported in this way. however, are not guaranteed to be first races, because they are not determined by taking into account how they are affected with each other. This paper presents a new post-mortem technique that analyzes, on each nesting level, candidate events collected from an execution of a shared-memory program with nested parallelism in order to report only first races. This technique is efficient, because it guarantees that first races reported by analyzing a nesting level are the races that occur first at the level, and does not require more analyses to the higher nesting levels than the current level. The Proposed technique facilitates more practical and effective debugging than the previous techniques, because it guarantees to detect first races if candidate events are collected from an execution instance of the program with nested parallelism.

Grid Nesting Scheme for High Accuracy of Tsunami Propagation Numerical Model (지진해일 전파 수치모형의 고도화를 위한 격자접속기법)

  • Lim, Chae-Ho;Bae, Jae-Seok;Jeon, Young-Joon;Yoon, Sung-Bum
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2007.05a
    • /
    • pp.2130-2134
    • /
    • 2007
  • 선형 Boussinesq 형태의 파동방정식을 지배방정식으로 사용하는 능동적인 분산보정 지진해일 전파 유한 차분모형의 정확도를 향상시키기 위한 새로운 동시격자접속기법을 개발하였다. 이 격자접속기법은 공간에 대해 3차 보간식을 사용하므로 짧은 파에 대해서 보간에 따른 오차를 최소화할 수 있고, 시간에 대해 2차 보간식을 사용하기 때문에 기존 기법에 비해 더 정확한 값을 얻을 수 있다. 개발된 격자접속기법의 정확성을 평가하기 위해 수중 원형천퇴상을 전파하는 Gaussian 형상의 가상지진에 대해 격자접속기법을 적용하지 않고 계산한 결과와 격자접속기법을 적용하여 계산한 결과를 FUNWAVE에 포함되어 있는 선형화된 Boussinesq방정식에 의해 계산된 수치해와 비교하였다. 그 결과 개발된 동시격자접속기법의 우수함이 검증되었다.

  • PDF

Reliable Cascaded Delegation Scheme for Mobile Agent Environments (이동 에이전트 환경을 위한 안전한 연속 위임 구현 기법)

  • Lee, Hyun-Suk;Eom, Young-Ik
    • The KIPS Transactions:PartC
    • /
    • v.11C no.1
    • /
    • pp.31-38
    • /
    • 2004
  • In mobile agent environments, migration of an agent occurs continuously due to the mobility of agents. So cascaded delegation can occur among places for delegating the privilege to execute the agent. Because the existing delegation scheme considers only the delegation between two places that participate in migration of an agent, it does not support secure cascaded delegation. In this paper, we propose a cascaded delegation scheme that provides agents with secure cascaded delegation in mobile agent environments. Depending on the trust-relationship among places, the proposed scheme achieves the goal by nesting each delegation token or by nesting only initial token signed by creator of the agent within the signed part of the next immediate delegation token. And we prove that the proposed scheme is secure against the attack of replaying a message and the attack of substituting a delegation token.

A Post-mortem Detection Tool of First Races to Occur in Shared-Memory Programs with Nested Parallelism (내포병렬성을 가진 공유메모리 프로그램에서 최초경합의 수행후 탐지도구)

  • Kang, Mun-Hye;Sim, Gab-Sig
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.4
    • /
    • pp.17-24
    • /
    • 2014
  • Detecting data races is important for debugging shared-memory programs with nested parallelism, because races result in unintended non-deterministic executions of the program. It is especially important to detect the first occurred data races for effective debugging, because the removal of such races may make other affected races disappear or appear. Previous dynamic detection tools for first race detecting can not guarantee that detected races are unaffected races. Also, the tools does not consider the nesting levels or need support of other techniques. This paper suggests a post-mortem tool which collects candidate accesses during program execution and then detects the first races to occur on the program after execution. This technique is efficient, because it guarantees that first races reported by analyzing a nesting level are the races that occur first at the level, and does not require more analyses to the higher nesting levels than the current level.

Simulation of the Ocean Circulation Around Ulleungdo and Dokdo Using a Numerical Model of High-Resolution Nested Grid (초고해상도 둥지격자 수치모델을 이용한 울릉도-독도 해역 해양순환 모의)

  • Kim, Daehyuk;Shin, Hong-Ryeol;Choi, Min-bum;Choi, Young-Jin;Choi, Byoung-Ju;Seo, Gwang-Ho;Kwon, Seok-Jae;Kang, Boonsoon
    • Journal of Korean Society of Coastal and Ocean Engineers
    • /
    • v.32 no.6
    • /
    • pp.587-601
    • /
    • 2020
  • The ocean circulation was simulated in the East Sea and Ulleungdo-Dokdo region using ROMS (Regional Ocean Modeling System) model. By adopting the East Sea 3 km model and the HYCOM 9 km data, Ulleungdo 1 km model and Ulleungdo-Dokdo 300 m model were constructed with one-way grid nesting method. During the model development, a correction method was proposed for the distortion of the open boundary data which may be caused by the bathymetry data difference between the mother and child models and the interpolation/extrapolation method. Using this model, a super-high resolution ocean circulation with a horizontal resolution of 300 m near the Ulleungdo and Dokdo region was simulated for year 2018. In spite of applying the same conditions except for the initial and boundary data, the numerical models result indicated significantly different characteristics in the study area. Therefore, these results were compared and verified by using the surface current data estimated by satellites altimeter data and temperature data from NIFS (National Institute of Fisheries Science). They suggest that in general, the improvement of the one-way grid nesting with the HYCOM data on RMSE, Mean Bias, Pattern correlation and Vector correlation is greater in 300 m model than in the 1 km model. However, the nesting results of using East Sea 3 km model showed that simulations of the 1 km model were better than 300 m model. The models better resolved distinct ridge/trough structures of isotherms in the vertical sections of water temperature when using the higher horizontal resolution. Furthermore, Karman vortex street was simulated in Ulleungdo-Dokdo 300 m model due to the terrain effect of th islands that was not shown in the Ulleungdo 1 km model.