http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
권순달(Soondal Kwon),김선곤(Sun-Kon Kim),이성한(Soung-Han Lee),박권규(Kwon Gyu Park) 대한자원환경지질학회 2012 자원환경지질 Vol.45 No.3
이 연구에서는 경기육괴내에 존재하는 것으로 알려진 대규모 단층대인 신갈단층을 기흥지역에서 확인하였다. 기흥 저수지 지역의 지질공학적 조사를 실시하여 단층대 위치 및 특징을 파악하였다. 이 단층대는 신갈단층으로 알려져 있으 며, 남북방향으로 발달된 이 단층대는 추가령 열곡 내에서 리델 타입(Riedel-type)의 주향이동 단층으로 해석된다. 단 층대를 따라서 62공의 시추조사와 전기비저항탐사 약 11 km, 바이브로사이즈 탄성파탐사 약 500 m를 실시하였다. 시 추조사 및 물리탐사 결과, 최대 폭 300미터의 단층대는 주로 가우지 및 단층각력으로 구성되며, 망상의 2차 균열이 단층대 안에 서로 평행하게 발달함이 확인되었다. 시추조사 및 물리탐사 결과, 신갈단층의 휘어지는 부분인 기흥저수 지 지역에서 꽃 구조(flower structure)와 유사한 지질구조의 발달 가능성이 있을 것으로 예측되지만, 연구지역의 특성 상 노두 확인이 불가능하기 때문에 이와 같은 해석에는 불확실성이 있다. 따라서 단층대의 기하학적 특징, 단층간의 연결 형태 등에 대한 자세한 조사가 이루어질 필요가 있다. In this study, the Singal fault zone in the Gyeonggi massif is identified in the Kiheung area. Geotechnical investigations were carried out to locate and characterize of the Singal fault zone in the Kiheung reservoir area. The N-S striking Shingal fault is known to be a Riedel-type strike-slip fault within the Choogaryung rift. Along the fault zone, 62 bore holes were drilled and electrical resistivity survey of about 11 km, and vibroseis seismic refraction and reflection survey of about 500 m were done. From the result of investigations, it is found that the fault zone, consisting mainly of gouge and breccia, has maximum width of 300 meters with anastomosing geometry of secondary fractures developed subparallel to the fault zone. We interpret these geometric features to be the result of structural development of flower-structure type at the restraining band of strike-slip fault. However, there are uncertainties of this interpretation because there are virtually no outcrops in the area. Further investigation to understand geometric features and linkage style of the fault zone.
내부점기법에 있어서 효율적인 순서화와 자료구조 : 최소부족순서화를 중심으로 Putting Emphasis on the Minimum Deficiency Ordering
박순달,김병규,성명기 한국경영과학회 1996 韓國經營科學會誌 Vol.21 No.3
Ordering plays an important role in solving an LP problem with sparse matrix by the interior point method. Since ordering is NP-complete, we try to find an efficient heuristic method. The objective of this paper is to present an efficient heuristic ordering method for implementation of the minimum deficiency method. Both the ordering method and the data structure play important roles in implementation. First we define a new heuristic pseudo-deficiency ordering method and a data structure for the method - quotient graph and clique storage. Next we show an experimental result in terms of time and nonzero numbers by NETLIB problems.
단체법 프로그램 LPAKO 개발에 관한 연구 : software of Simplex Method for Liner Programming
박순달,김우제,박찬규,임성묵 한국경영과학회 1998 經營 科學 Vol.15 No.1
The purpose of this paper is to develope a large-scale simplex method program LPAKO. Various up-to-date techniques are argued and implemented. In LPAKO, basis matrices are stored in a LU factorized form, and Reid's method is used to update LU maintaining high sparsity and numerical stability, and further Markowitz's ordering is used in factorizing a basis matrix into a sparse LU form. As the data structures of basis matrix, Gustavson's data structure and row-column linked list structure are considered. The various criteria for reinversion are also discussed. The dynamic steepest-edge simplex algorithm is used for selection of an entering variable, and a new variation of the MINOS' perturbation technique is suggested for the resolution of degeneracy. Many preprocessing and scaling techniques are implemented. In addition, a new, effective initial basis construction method are suggested, and the criteria for optimality and infeasibility are suggested respectively. Finally, LPAKO is compared with MINOS by test results.
박순달,임성목,도승용,이승석,김호동 한국경영과학회 2002 經營 科學 Vol.19 No.1
ORED is a Web-Based educational system for operations research. It consists of operation research theories, help system for theories, cases, application programs and management system. Users can study theories and cases through HTML documents and solve problems with java applet and servelet programs. The help system provides users with detailed explanations of theories. And the management system provides the administrator with efficient tools necessary for managing the ORED in the Web.
박찬규,박순달,진희채 한국경영과학회 1998 韓國經營科學會誌 Vol.23 No.3
Shortest path problem in road network with turn penalties and prohibitions frequently arises from various transportation optimization models. In this paper, we propose a new algorithm for the shortest path problem with turn prohibitions and delays. The proposed algorithm maintains distance labels of arcs, which is similar to labels of nodes of Dijkstra's algorithm. Fibonacci heap implementation of the proposed algorithm solves the problem in O(mn+mlogm). We provide a new insight in transforming network with turn penalties and prohibitions into another network in which turn penalties and prohibitions are implicitly considered. The proposed algorithm is implemented using new data structure and compared with Ziliaskopoulos' algorithm. Computational results show that proposed algorithm is very efficient.
설동렬,박순달,정호원 한국경영과학회 1997 經營 科學 Vol.14 No.2
The computational speed of interior point method of linear programming depends on the speed of Cholesky factorization. If the coefficient matrix A has dense columns then the matrix A??A^T becomes a dense matrix. This causes Cholesky factorization to be slow. We study an efficient implementation method of the dense column splitting among dense column resolving techniques and analyze the relation between dense column splitting and ordering methods to improve the sparsity of Cholesky factor.