• Journal of the Korean Geophysical Society
• /
• v.3 no.1
• /
• pp.1-12
• /
• 2000

A palaeomagnetic study was carried out on Early through Late Cretaceous sandstones and volcanic sequences (the Songnaedong Formation, Chaeyaksan Volcanics, Konchonri Formation, and Jusasan Andesite it ascending order) from Konchonri area in the northern Milyang subbasin of the Kyongsang Basin, Korea. A high-temperature stable remanence with direction of $d=22.9^{\circ},\;i=59.1^{\circ}\;({\alpha}_{95}=3.0^{\circ})$ has been isolated and a corresponding pole was $71.6^{\circ}N,\;199.6^{\circ}E\;(A_{95}=4.2^{\circ})$. The characteristic high-temperature component resides in both hematite and magnetite. The primary nature of this remanence is confirmed from positive fold and reversals tests, The palaeopole is consistent with those of the Hayang Group in other parts of the Kyongsang Basin. A comparison of the palaeomagnetic pole position from the studied area with the contemporary pole from China west of the Tan-Lu fault presents that Konchonri area has experienced little latitudinal displacement nor vertical-axis block rotation relative to the Chinese blocks since the Cretaceous. Based on the formations indicating dual polarity, radiometric and paleontologic data, the magnetostratigraphic age of the studied sequence from the Songnedong Formation to the Jusasan Andesite ranges from upper Albian to lower Campanian reverse polarity chronozone. On the other hand, volcanic samples of the Chaeyaksan Volcanics and the Jusasan Andesite showed the scattered directions considered in group, even though individual sample showed a stable remanent magnetization in response to thermal demagnetization. It indicates that they have been reworked after acquisition of the stable remanent magnetization.

• Proceedings of the Korea Database Society Conference
• /
• 1997.10a
• /
• pp.504-514
• /
• 1997

관계형 데이터베이스의 성능을 향상시키는데 중요한 요소 중의 하나는 트랜잭션을 처리하기 위해 데이터를 디스크에서 주기억장치로 옮기는데 필요한 디스크 액세스(access) 횟수이다. 본 연구는 관계형 데이터베이스에서 트랜잭션을 처리할 때, 릴레이션(relation)을 수직분할하여 디스크에 단편(fragment)으로 저장하므로써 필요한 단편만 액세스하여 액세스 횟수를 감소시키는데 목적이 있다. 단편에 속성을 중복할당하여 수직분할하므로써 트랜잭션을 만족시키는 단편의 수를 감소시켜 중복할당을 고려하지 않은 방법보다 디스크 액세스 횟수를 감소시킬 수 있다. 갱신트랜잭션의 경우 하나의 속성이 갱신되면 중복된 속성을 모두 갱신하여야 하므로 액세스 횟수가 증가하지만, 조회트랜잭션의 경우 각 단편에 속성을 중복할당하여 액세스 횟수를 감소시킬 수 있다. 본 연구에서는 속성의 중복을 허용하여 단편을 구성하는 경우에 중복을 고려하지 않은 경우를 포함하므로 효과적으로 디스크 액세스 횟수를 감소시킬 수 있다. 본 연구에서는 중복할당을 고려하여 디스크의 액세스 횟수를 최소화시킬 수 있는 수직분할문제의 0-1 정수계획모형을 개발하고, 모형에 대한 최적해법으로 분지한계법을 제안한다.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.4
• /
• pp.1-9
• /
• 2010

In this paper, we consider a two-machine re-entrant permutation flowshop scheduling problem with the objective of minimizing total flowtime, and suggest branch and bound algorithms for the scheduling problem. In this scheduling problem, each job must be processed twice on each machine, that is, each job should be processed on the two machines in the order of machine 1, machine 2 and then machine 1 and machine 2. In this research, based on the results of existing researches for re-entrant permutation flowshop scheduling problems, various dominance properties, lower bound and heuristic algorithm are suggested for the problem, and those are used to develop branch and bound algorithms. In the computational experiments for evaluation of the performance of the algorithms, the suggested branch and bound algorithms are tested on randomly generated test problems and results are reported.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.2
• /
• pp.83-101
• /
• 1998

Assembly U-lines are increasingly accepted in industry, especially just-in-time production systems, for the efficient utilization of workforce. In this paper, we present an integer programming formulation and a branch-and-bound method for balancing the U-line with the objective of minimizing the number of workstations with a fixed cycle time. In the mathematical model, we provide the method that can reduce the number of variables and constraints. The proposed branch-and-bound method searches the optimal solution based on a depth-first-search. To efficiently search for the optimal solutions to the problems, an assignment rule is used in the method. Bounding strategies and dominance rules are also utilized. Some problems require a large amount of computation time to find the optimal solutions. For this reason. some heuristic fathoming rules are also proposed. Extensive experiments with test-bed problems in the literature are carried out to show the performance of the proposed method. The computational results show that our method is promising in solution quality.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.4
• /
• pp.61-70
• /
• 2005

In this Paper, we develop an improved branch and bound algorithm for the (un)weighted unconstrained two-dimensional cutting problem. In the proposed algorithm, we improve the branching strategies of the existing exact algorithm and reduce the size of problem by removing the dominated pieces from the problem. We apply the newly Proposed definition of dominated cutting pattern and it can reduce the number of nodes that must be searched during the algorithm procedure. The efficiency of the proposed algorithm is presented through comparison with the exact algorithm known as the most efficient.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.37
• /
• pp.241-249
• /
• 1996

In this paper, a 0-1 integer programming model for solving vertical partitioning problem minimizing the number of disk accesses is formulated and a branch-and-bound method is used to solve the binary vertical partitioning problem. In relational databases, the number of disk accesses depends on the amount of data transferred from disk to main memory for processing the transactions. Vertical partitioning of the relation can often result in a decrease in the number of disk accesses, since not all attributes in a tuple are required by each transactions. The algorithm is illustrated with numerical examples and is shown to be computationally efficient. Numerical experiments reveal that the proposed method is more effective in reducing access costs than the existing algorithms.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.32 no.1
• /
• pp.79-84
• /
• 2009

In this paper, a best-first branch and bound algorithm based upon the bottom-up approach for the unweighted unconstrained two-dimensional cutting problem is proposed to find the optimal solution to the problem. The algorithm uses simple and effective methods to prevent constructing duplicated patterns and reduces the searching space by dividing the branched node set. It also uses a efficient bounding strategy to fathom the set of patterns. Computational results are compared with veil-known exact algorithms and demonstrate the efficiency of the proposed algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.3
• /
• pp.154-161
• /
• 2010

This paper considers the simultaneously firing model for the artillery operations. The objective of this paper is to find the optimal fire sequence minimizing the final completion time of the firing missions of multiple artillery units for multiple targets. In the problem analysis, we derive several solution properties to reduce the solution space. Moreover, two lower bounds of objective are derived and tested along with the derived properties within a branch-and-bound scheme. Two efficient heuristic algorithms are also developed. The overall performances of the proposed branch-and-bound and heuristic algorithms are evaluated through various numerical experiments.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.2
• /
• pp.213-220
• /
• 2007

This paper considers a two-stage hybrid flow shop scheduling problem for the objective of minimizing the number of tardy jobs. Each job is processed through the two production stages in stages, each of which has multiple identical parallel machines. The problem is to determine the allocation and sequence of jobs at each stage. A branch and bound algorithm that gives the optimal solutions is suggested that incorporates the methods to obtain the lower and upper bounds. Dominance properties are also suggested to reduce the search space. To show the performance of the algorithm, computational experiments are done on randomly generated problems, and the results are reported.

• Korean Journal of Plant Taxonomy
• /
• v.34 no.2
• /
• pp.173-183
• /
• 2004

한국산 미나리아재비속 미나리아재비(Acris Schur)절에 속하는 미나리아재비(Ranunculus japonicus)와 근연종인 산미나리아재비(R. acris var. nipponicus) 및 바위미나리아재비(R. crucilobus)의 실체와 분류학적 한계를 파악하기위해 속, 종간 규명에 많이 이용하고 있는 핵리보좀(ribosomal) DNA의 internal transcribed spacer 구간의 염기서열을 분석하였다. 본 연구는 6개의 군외군을 포함하여 총 18개의 DNA 재료(accessions)의 정열된 염기서열들을 바탕으로 bootsrap을 포함한 maximum parsimony와 maximum likelihood 분석법에 의한 계통수로 평가하였다. 연구 결과 Acris절에 속하는 미나리아재비, 산미나리아재비 및 바위미나리아재비는 단계통군으로 나타났으며 특히 미나리아재비(R. japonicus)와 산미나리아재비(R. acris var. nipponicus)는 같은 분계조를 형성하였다. 이와 달리 바위미나리아재비는 미나리아재비와 산미나리아재비에서 분지된 결과를 보여, 한라산 해발 1500m이상의 높은 지역에 분포하는 바위미나리아재비는 미나리아재비의 아종(R. japonicus Thunb. subsp. chrysotrichus (Nakai) Y. N. Lee, comb. nud.)으로 처리하기보다는, 독립된 고유종인 R. crucilobus H. L$\acute{e}$v.으로의 처리를 지지하였다.