• 화약ㆍ발파
• /
• 제33권4호
• /
• pp.7-13
• /
• 2015

최근에 지하공간의 개발과 활용 기술에 대한 수요가 전 세계적으로 급증함에 따라 역학적 안정성과 활용 효율의 측면에서 발파굴착 시 발생하는 손상대 평가는 주요 관심사가 되고 있다. 본 연구에서는 지하공동주변 발파손상대(blast-damaged zone; BDZ)에 대한 폭원모델링을 검증하기 위하여 모멘텀 트랩(momentum trap; MT) 개념을 이용한 일련의 소규모 시험발파를 실시하고, 시험 결과에 따라 LS-DYNA 수치모델의 입력변수들을 수정하였다. 연구 결과, 본 연구에서 제안한 MT 개념을 이용한 모형발파 실험 및 수치모델링 기법은 주어진 조건 하에서 MT의 비산속도를 잘 모사하는 것으로 나타났다.

• 한국자동차공학회논문집
• /
• 제2권5호
• /
• pp.58-65
• /
• 1994

In order to reduce particulate emissions from diesel vehicles, mathematical model is established and analyzed on ceramic wall-flow monolith filter. A wall-flow monolith filter placed in the exhaust stream of a diesel engine can effectively limit the emission of diesel particulates through the monolith. The accumulated particulates can then be periodically combusted inside the monolith by directing hot gas to the monolith while normal engine exhaust is routed around the monolith system. The resulting low flow rates through the monolith require consideration of gas dynamics through the channels as well as particulate combustion to analyze this regeneration process. A mathematical model of the regeneration is formulated as a system of nonlinear partial differential equations describing the conservation of mass, momentum and energy. Numerical solutions are obtained by using a finite difference techniques for the spatial discretization. So we can use filter simulation program for the purpose of filter design and actual filter regeneration

• 대한전기학회논문지:전력기술부문A
• /
• 제48권3호
• /
• pp.234-240
• /
• 1999

This paper presents a new approach for large-scale generator maintenance scheduling optimizations. The generator preventive maintenance scheduling problems are typical discrete dynamic n-dimensional vector optimization ones with several inequality constraints. The considered objective function to be minimized a subset of{{{{ { R}^{n } }}}} space is the variance (i.g., second-order momentum) of operating reserve margin to levelize risk or reliability during a year. By its nature of the objective function, the optimal solution can only be obtained by enumerating all combinatorial states of each variable, a task which leads to computational explosion in real-world maintenance scheduling problems. This paper proposes a new priority search mechanism based on each generator's discrete sensitivity value which was analytically developed in this study. Unlike the conventional capacity-based priority search, it can prevent the local optimal trap to some extents since it changes dynamically the search tree in each iteration. The proposed method have been applied to two test systems (i.g., one is a sample system with 10 generators and the other is a real-world lage scale power system with 280 generators), and the results anre compared with those of the conventional capacith-based search method and combinatorial optimization method to show the efficiency and effectiveness of the algorithm.