• 산업경영시스템학회지
• /
• 제32권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.

• 한국통신학회논문지
• /
• 제21권6호
• /
• pp.1546-1553
• /
• 1996

The bit error probability of RS/trellis concatenated coded-modualtion system in the mobile radio channel is analyzed. A new upper bound to the symbol error probability of the inner TCM in the mobile radio channel is obtained by exploiting the unequal symbol error probability of the TCM. This bound is applied to the derivation of the upper bound to the bit error probability of the concatenated coded-modulation system. An efficient way of searching distance spectrum of the TCM in mobile radio channel is devised. Our new bounds are tighter than the earlier studied other bounds.

• 한국컴퓨터정보학회논문지
• /
• 제3권4호
• /
• pp.44-48
• /
• 1998

본 는문에서는 RT콤포넌트를 이용한 맵핑 방법으로 HDL로 기술된 연산자들을 RT콤포넌트에 맞도록 CDFG를 구성한 후 그래프를 최소화하고 cost와 bound를 계산하여 적합한 라이브러리를 선정하여 맵핑할 수 있는 콤포넌트 합성 알고리즘(Component Synthesis Algorithm)을 제안하였다.

• 전자공학회논문지A
• /
• 제28A권12호
• /
• pp.73-87
• /
• 1991

This paper presents a new approach to the scheduling problem in the high level synthesis. In this approach, iterative rescheduling processes starting with ASAP(As Soon As Possible) scheduling result are performed in a branch-and-bound manner so to arrive at the scheduling result of the lowest hardware cost under the given timing constraint. At each iteration step, only the selected nodes are considered for rescheduling, and the lower bound cost estimation is performed to avoid the unnecessary attempts to search for an optimal result. This branch-and-bound method turns out to be effective in pruning the search space, and thus reducing run time considerably in many cases.

• 한국터널공학회:학술대회논문집
• /
• 한국터널공학회 2005년도 학술발표회 논문집
• /
• pp.77-86
• /
• 2005

In urban areas, new tunnel construction work is often taking place adjacent to existing piled foundations. In this case, careful assessment for the pile-soil-tunnel interaction is required. However, research on this topic has not been much reported, and currently only limited information is available. In this study, the complex pile-soil-tunnel interaction is investigated using the upper and lower bound methods based on kinematically possible failure mechanism and statically admissible stress field respectively. It is believed that the limit theorem is useful in understanding the complicated interaction behaviour mechanism and applicable to the pile-soil-tunnel interaction problem. The results are compared with numerical analysis. The material deformation patterns and strain data from the FE output are shown to compare well with the equivalent physical model tests. Admissible stress fields and the failure mechanisms are presented and used to develop upper and lower bound solutions to assess minimum support pressures within the tunnel.

• 산업경영시스템학회지
• /
• 제33권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.

• 한국자기공명학회논문지
• /
• 제2권1호
• /
• pp.33-40
• /
• 1998

The cross peak intensities versus mixing times of 2D NOESY spectrum for a corepressor L-trp were simulated for the case of a ligand exchanging between free (AX) and bound (A'X') forms in protein/DNA complex. The direct NOE (I(AX)) of the free ligand exhibited a small positive intensity indicative of the strong dominant influence of the bound ligand. The exchange-mediated NOE peak (I(AX')) was very sensitive to corepressor exchange. However, both diagonal (I(A'A')) and direct NOE (I(A'X')) intensities of the bound ligand were not affected much at initial stage. Both peaks were severely influenced by exchange at mixing times of greater than 100 ms. In conclusion, since the NOE intensity is a function of exchange rate, the exchange effect should be considered to properly extract accurate distance information for bound ligand in the presence of conformational exchange.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제52권7호
• /
• pp.418-423
• /
• 2003

In order to describe the upper bound of the uncertainties without any information of the structure, we assume that the upper bound is represented as a Fredholm integral equation of the first kind, that is, an integral of the product of a predefined kernel with an unknown influence function. Based on the improved Lyapunov function, we propose an adaptation law that is capable of estimating the upper bound and we design a sliding mode control, which controls effectively for uncertain dynamic systems.

• 한국항행학회논문지
• /
• 제11권4호
• /
• pp.447-453
• /
• 2007

논문에서 우리는 이산무기억통신로 (Discrete Memoryless Channel)에 대한 갈라거 랜덤 코딩 바운드를 개념적으로 이해하기 어려운 랜덤코딩 방법론을 따르지 않고 순전히 대수부등식들만을 이용함으로써 유도해 낸다. 갈라거 랜덤코딩바운드는 결정영역(Decision Region)을 알수 없는 경우에도 적용될 뿐만아니라 채널코딩정리까지 유도할 수 있는 매우 강력한 바운드로서 정보 및 부호이론 연구에 있어서 매우 중요한 도구이다. 그동안 개념적으로 이해하기 어려웠던 갈라거 랜덤코딩바운드를 대수적으로 차근차근 유도해 봄으로써 다양한 문제에 쉽게 적용할 수 있는 이론적 바탕을 마련해 보고자 한다.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2002년도 추계학술발표논문집 (하)
• /
• pp.1815-1818
• /
• 2002

사용자에게 서비스 할 데이터가 많을 경우 데이터베이스의 여러 볼륨에 저장해서 처리해야 할 경우가 발생한다. 볼륨이 여러 개일 경우 효과적이고 효율적인 접근 방법이 필요하다. 본 논문에서는 SHORE 저장 시스템을 이용할 경우에 효과적이고 효율적인 접근 방법을 알아보고자 한다. single thread, multi thread, multi process, socket 을 이용한 접근 방법을 살펴보고 multi thread 를 이용하는 방법이 가장 효율적인 것을 실험 결과를 통해서 보인다. SHORE thread 는 CPU bound 에 과련된 job 이 많은 경우는 process 를 사용했을 때에 비해 큰 효과가 없으나 I/0 bound 에 관련에 것일 경우는 multi process 를 사용한 것과 비슷한 효과가 있음을 알 수 있다.