• Kyungpook Mathematical Journal
• /
• 제55권1호
• /
• pp.169-180
• /
• 2015

We study the braid indices of the Kanenobu knots. It is known that the Kanenobu knots have the same HOMFLYPT polynomial and the same Khovanov-Rozansky homology. The MFW inequality is known for giving a lower bound of the braid index of a link by applying the HOMFLYPT polynomial. Therefore, it is not easy to determine the braid indices of the Kanenobu knots. In our previous paper, we gave upper bounds and sharper lower bounds of the braid indices of the Kanenobu knots by applying the 2-cable version of the zeroth coefficient HOMFLYPT polynomial. In this paper, we give sharper upper bounds of the braid indices of the Kanenobu knots.

• Communications for Statistical Applications and Methods
• /
• 제24권6호
• /
• pp.641-649
• /
• 2017

Multivariate confidence regions were defined using a chi-square distribution function under a normal assumption and were represented with ellipse and ellipsoid types of bivariate and trivariate normal distribution functions. In this work, an alternative confidence region using the multivariate quantile vectors is proposed to define the normal distribution as well as any other distributions. These lower and upper bounds could be obtained using quantile vectors, and then the appropriate region between two bounds is referred to as the quantile confidence region. It notes that the upper and lower bounds of the bivariate and trivariate quantile confidence regions are represented as a curve and surface shapes, respectively. The quantile confidence region is obtained for various types of distribution functions that are both symmetric and asymmetric distribution functions. Then, its coverage rate is also calculated and compared. Therefore, we conclude that the quantile confidence region will be useful for the analysis of multivariate data, since it is found to have better coverage rates, even for asymmetric distributions.

• 한국IT서비스학회지
• /
• 제10권1호
• /
• pp.117-133
• /
• 2011

In this paper, we present a frequency reassignment problem (FRP) arising from the reconfiguration of radio networks such as adding new base stations (BSs) and changing the number of frequencies assigned to BSs. For this problem, we develop an integer programming (IP) model that minimizes the sum of frequency reassignment cost and the cost for unsatisfied frequency demands, while avoiding interference among frequencies. To obtain tight lower bounds, we develop some valid inequalities and devise an objective function relaxation scheme. Also, we develop a simple but efficient heuristic procedure to solve large size problems. Computational results show that the developed valid inequalities are effective for improving lower bounds. Also, the proposed tabu search heuristic finds tight upper bounds with average optimality gap of 2.3%.

• 한국통신학회논문지
• /
• 제24권7A호
• /
• pp.1080-1089
• /
• 1999

병렬 연쇄 컨볼루션 부호 및 직렬 연쇄 컨볼루션 부호의 ML 연판정 복호에 대한 비트오율확률의 상한치는 가중치 열거함수(Weight Enumerating Function; WEF)를 통해서 구할 수 있으며, 이 상한치는 반복 택 알고리듬과 양방향 탐색 알고리듬을 혼합한 새로운 오류사건 탐색 알고복호를 통해 얻을 수 있는 비트오류확률의 하한치가 된다. 본 논문에서는 스리듬을 제안하고, 얻어진 오류사건을 이용하여 WEF를 계산하는 알고리듬을 제안한다. 컴퓨터 시뮬레이션을 통해, 반복복호를 통해 얻을 수 있는 비트오류확률의 하한치가 됨을 확인하였다.

• 한국경영과학회지
• /
• 제34권4호
• /
• pp.113-121
• /
• 2009

In this paper, we consider the departure process from the open and nested tandem Queueing network with population constraint and constant service times. It is known that the Queueing network can be transformed into a simple Queueing network which can be easy to analyze. Using this simple Queueing network, upper and lower bounds on the interdeparture time are obtained. We prove that the variance of the interdeparture time is bounded within these two bounds. Validation against simulation data is shown that how it works the variance of the interdeparture time within two bounds. These bounds can be applied to obtain the better variance of the interdeparture time using a suitable method.

• 대한산업공학회지
• /
• 제23권4호
• /
• pp.769-778
• /
• 1997

Assembly/Disassembly Queueing Networks (ADQNs) with finite buffers have been used as a major tool for evaluating the performances of manufacturing and parallel processing systems. In this study, we present simple but effective methods which yield throughput upper and lower bounds for ADQNs with exponential service times and finite buffers. These methods are based on the monotonicity properties of throughputs with respect to service times and buffer capacities. The throughput-upper bounding method is elaborated on with general network configuration (specifically acyclic configuration). But our lower bounding method is restricted to the ADQNs with more specialized configuration. Computational experiments will be performed to confirm the effectiveness of our throughput-bounding methods.

• 한국경영과학회지
• /
• 제22권3호
• /
• pp.59-80
• /
• 1997

Designing highly survivable interoffice telecommunication networks is considered. The problem is formulated as a minimum-cost network design problem with three node connectivity constraints. These valid and facet-defining inequalities for the convex hull of the solution are presented. A branch and cut algorithm is proposed based on the inequalities to obtain the optimal solution. With the lower bound by the cutting plane algorithm, a delete-ink heuristic is proposed to otain a good upper bound in the branch and bound procedure. The effeciveness of the branch and cut algorithm is demonstrated with computational results for a variety of problem sets : different lower bounds, two types of link costs and large number of links. The cutting plane procedure based on the three inequalities provides excellent lower bounds to the optimal solutions.

• Advances in materials Research
• /
• 제5권4호
• /
• pp.263-277
• /
• 2016

Mechanical properties of $Al/Al_2O_3$ and $Al/B_4C$ composites prepared through powder metallurgy are estimated up to 50% $Al_2O_3$ and 35% $B_4C$ weight fractions using micromechanics models and experiments. The experimental Young's modulus up to 0.40 weight fraction of ceramic is found to lie closely between Ravichandran's/Hashin-Shtrikman lower/upper bounds, and close to self consistent method/Miller and Lannutti method/modified rule of mixture/fuzzy logic method single value predictions. Measured Poisson's ratio lies between rule of mixture/Ravichandran lower and upper bound/modified Ravichandran upper bounds. Experimental Charpy energy lies between Hopkin-chamis method/equivalent charpy energy/Ravichandran lower limit up to 20%, and close to the reciprocal rule of mixture for higher $Al_2O_3$ content. Rockwell hardness (RB) and Micro-hardness of $Al/Al_2O_3$ are closer to modified rule of mixture predictions.

• 응용통계연구
• /
• 제26권3호
• /
• pp.495-509
• /
• 2013

본 논문에서는 캔달의 타우(Kendall's tau)의 다차원으로의 확장과 그의 통계적 추론 및 해석에 대해 알아본다. 특히 다차원 캔달의 타우가 음의 값을 가질 때 의미를 해석하기 위해, 그것의 하한이 얻어지는 경우를 직관적으로 이해할 수 있도록 변수들간의 관계의 관점에서 설명하여본다. 또한 다차원 캔달의 타우를 실제 사례에 적용해 본후, 최근 Lee와 Ahn에서 연구된 d-countermonotonicity와 partially m-countermonotonic와 같은 새로운 개념을 통하여 캔달의 타우가 음의 값이 가질 때의 의미에 대해서 논의한다.

• East Asian mathematical journal
• /
• 제7권2호
• /
• pp.179-184
• /
• 1992