• 산업경영시스템학회지
• /
• 제19권39호
• /
• pp.9-18
• /
• 1996

Many algorithms have been developed for optimizing the asymmectric traveling salesman problem known as a representative NP-Complete problem. The most efficient ones of them are branch and bound algorithms based on the subtour elimination approach. To increase efficiency of the branch and bound algorithm. number of decision nodes should be decreased. For this the minimum bound that is more close at the optimal solution should be found or an effective bounding strategy should be used. If the optimal solution has been known, we may apply it usefully to branching. Because a good feasible solution should be found as soon as possible and have similar features of the optimal solution. By the way, the upper bound solution in branch and bound algorithm is most close at the optimal solution. Therefore, the upper bound solution can be used instead of the optimal solution and information of which can be applied to new branching criteria. As mentioned above, this paper will propose an effective branching rule using the information of the upper bound solution in the branch and bound algorithm. And superiority of the new branching rule will be shown by comparing with Bellmore-Malone's one and carpaneto-Toth's one that were already proposed.

• 한국해안·해양공학회논문집
• /
• 제31권1호
• /
• pp.17-27
• /
• 2019

Bound mode의 외중력파와 이로 인한 보강간섭이 이상파 생성 기작이라는 가설을 확인하기 위해 OpenFoam 기반 Tool box인 ihFoam과 Bi-spectrum에 기초한 수치모의를 수행하였다. 수치모의는 건설 과정에서 이상파가 관측된 삼척 LNG 생산기지 전용부두를 대상으로 수행되었으며, Bound mode의 외중력파는 Bi-spectrum에 기반하여 출현빈도가 높은 주기가 7초인 국지 풍성파와 11.4초인 너울의 difference interaction으로 생성하였다. 또한 비교를 위해 비선형 Cnoidal wave, linear wave를 대상으로 한 수치모의도 병행하여 수행하였다. 모의결과 N 계열 bound mode의 외중력파에 의해 삼척 LNG 생산기지 전용부두를 따라 진행되는 연파가 생성되며, 이상파는 전술한 연파와 남측 도류제로부터의 반사파가 더해져 출현하는 것으로 모의되었다.

• Journal of Communications and Networks
• /
• 제10권1호
• /
• pp.5-9
• /
• 2008

Researchers have investigated many upper bound techniques applicable to error probabilities on the maximum likelihood (ML) decoding performance of turbo-like codes and low density parity check (LDPC) codes in recent years for a long codeword block size. This is because it is trivial for a short codeword block size. Previous research efforts, such as the simple bound technique [20] recently proposed, developed upper bounds for LDPC codes and turbo-like codes using ensemble codes or the uniformly interleaved assumption. This assumption bounds the performance averaged over all ensemble codes or all interleavers. Another previous research effort [21] obtained the upper bound of turbo-like code with a particular interleaver using a truncated union bound which requires information of the minimum Hamming distance and the number of codewords with the minimum Hamming distance. However, it gives the reliable bound only in the region of the error floor where the minimum Hamming distance is dominant, i.e., in the region of high signal-to-noise ratios. Therefore, currently an upper bound on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix cannot be calculated because of heavy complexity so that only average bounds for ensemble codes can be obtained using a uniform interleaver assumption. In this paper, we propose a new bound technique on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix using ML estimated weight distributions and we also show that the practical iterative decoding performance is approximately suboptimal in ML sense because the simulation performance of iterative decoding is worse than the proposed upper bound and no wonder, even worse than ML decoding performance. In order to show this point, we compare the simulation results with the proposed upper bound and previous bounds. The proposed bound technique is based on the simple bound with an approximate weight distribution including several exact smallest distance terms, not with the ensemble distribution or the uniform interleaver assumption. This technique also shows a tighter upper bound than any other previous bound techniques for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국제학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• pp.372-377
• /
• 1993

In this paper, we investigate a set-membership identification approach to the quantification of an upper bound of model uncertainty in frequency domain, which is required in the H$_{\infty}$ robust control system design. First we formulate this problem as a set-membership identification of a nominal model error in the presence f unknown noise input with unknown bound, while the ordinary set-membership approaches assume that an upper bound of the uncertain input is known. For this purpose, the proposed algorithm includes the estimation of the bound of the uncertain input. thus the proposed method can obtain the hard bound of the model error in frequency domain as well as a parametric lower-order nominal model. Finally numerical simulation results are shown to confirm the validity of the presented algorithm..

• IMMUNE NETWORK
• /
• 제9권5호
• /
• pp.158-168
• /
• 2009

Tumor therapy using cytokines has been developed for last two decades. Several recombinant cytokines and tumor cell vaccines produced by cytokine gene transfer have been in clinical trials, but several side effects hamper routine clinical applications. Many cytokines are originally expressed as membrane-bound form and then processed to secretory form exerting paracrine effects. Though functional differences of these two types of cytokines are elusive yet, the membrane-bound form of cytokine may exert its effects on restricted target cells as a juxtacrine, which are in physical contacts. With the efforts to improve antitumor activities of cytokines in cancer patients, developing new strategies to alleviate life-threatening side effects became an inevitable goal of tumor immunologists. Among these, tumor cell vaccines expressing cytokines as membrane-bound form on tumor cell surface have been developed by genetic engineering techniques with the hope of selective stimulation of the target cells that are in cell-to-cell contacts. In this review, recent progress of tumor cell vaccines expressing membrane-bound form of cytokines will be discussed.

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

• Geomechanics and Engineering
• /
• 제11권4호
• /
• pp.587-605
• /
• 2016

This study aimed to develop upper and lower bounds to predict the tunnel support pressure under the pile tip during the circular tunnel excavation. Most previous studies on the upper and lower bound methods were carried out for the single ground structures, e.g., retaining wall, foundation, ground anchor and tunnel, in the homogeneous ground conditions, since the pile-soil-tunnel interaction problem is very complicated and sophisticated to solve using those bound methods. Therefore, in the lower bound approach two appropriate stress fields were proposed for single pile and tunnel respectively, and then they were superimposed. In addition, based on the superimposition several failure mechanisms were proposed for the upper bound solution. Finally, these upper bound mechanisms were examined by shear strain data from the laboratory model test and numerical analysis using finite element method.

• Transactions on Control, Automation and Systems Engineering
• /
• 제1권1호
• /
• pp.44-49
• /
• 1999

This paper presents a new T-S(Tae-Sugeno) fuzzy controller design method satisfying the output energy bound. Maximum output energy via a quadratic Lyapunov function to obtain the bound on output energy is derived. LMI(Linear Matrix Inequality) problems which satisfy an output energy bound for both of the continuous-time and discrete-time T-S fuzzy control system are also derived. Solving these LMIs simultaneously, we find a common symmetric positive definite matrix P which guarantees the global asymptotic stability of the system and stable feedback gains K's satisfying the output energy bound. A simple example demonstrates validity of the proposed design method.

• 소성∙가공
• /
• 제6권3호
• /
• pp.233-238
• /
• 1997

The estimation of the forming force required for metal forming process is unavoidable for selecting suitable machine and dimensioning die and punch parts. For this purpose the upper-bound method turns out to be very practical in simple two-dimensional cases under well-known boundary conditions. However, the application of this method for complicated two-or three-dimentional cases is very limited or practically impossible. The modified application of FEM in a manner of applying the upper bound method(the so-called Upper-bound Finite Element Simulation Method) fortunately provides the posibility of getting important information about the forming process in a simple and quick way before realizing the process on the machine. It is expected to function successfully even in three-dimentional cases. The application procedure has been explained for two-dimensional cases and its usefulness shown.

• Management Science and Financial Engineering
• /
• 제16권1호
• /
• pp.81-117
• /
• 2010

Semi-supervised learning incorporates unlabeled examples, whose labels are unknown, as well as labeled examples into learning process. Although transductive support vector machine (TSVM), one of semi-supervised learning models, was proposed about a decade ago, its application to large-scaled data has still been limited due to its high computational complexity. Our previous research addressed this limitation by introducing a branch-and-bound algorithm for finding an optimal solution to TSVM. In this paper, we propose three new techniques to enhance the performance of the branch-and-bound algorithm. The first one tightens min-cut bound, one of two bounding strategies. Another technique exploits a graph-based approximation to a support vector machine problem to avoid the most time-consuming step. The last one tries to fix the labels of unlabeled examples whose labels can be obviously predicted based on labeled examples. Experimental results are presented which demonstrate that the proposed techniques can reduce drastically the number of subproblems and eventually computational time.