• Advances in materials Research
• /
• v.5 no.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.

• Structural Engineering and Mechanics
• /
• v.21 no.2
• /
• pp.185-204
• /
• 2005

Variations in system parameters due to uncertainties may result in system performance deterioration. Uncertainties in modeling of structures are often considered to ensure that control system is robust with respect to response errors. Hence, the uncertain concept plays an important role in vibration control of the engineering structures. The paper discusses the robustness of the stability of vibration control systems with uncertain parameters. The vibration control problem of an uncertain system is approximated by a deterministic one. The uncertain parameters are described by interval variables. The uncertain state matrix is constructed directly using system physical parameters and avoided to use bounds in Euclidean norm. The feedback gain matrix is determined based on the deterministic systems, and then it is applied to the actual uncertain systems. A method to calculate the upper and lower bounds of eigenvalues of the close-loop system with uncertain parameters is presented. The lower bounds of eigenvalues can be used to estimate the robustness of the stability the controlled system with uncertain parameters. Two numerical examples are given to illustrate the applications of the present approach.

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.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.

• Communications for Statistical Applications and Methods
• /
• v.24 no.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.

• Communications for Statistical Applications and Methods
• /
• v.11 no.3
• /
• pp.455-463
• /
• 2004

In this paper, we derive sharp upper and lower expectation bounds on the extreme order statistics from possibly dependent random variables whose marginal distributions are only known. The marginal distributions of the considered random variables may not be the same and the expectation bounds are completely determined by the marginal distributions only.

• Kyungpook Mathematical Journal
• /
• v.55 no.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.

• Kyungpook Mathematical Journal
• /
• v.61 no.3
• /
• pp.583-590
• /
• 2021

In this work we give new upper and lower bounds for the numerical radius of a complex square matrix A using the entries and the trace of A.

• Journal of information and communication convergence engineering
• /
• v.15 no.1
• /
• pp.21-27
• /
• 2017

In this research, we study the outage probability for distributed space-time coding-based cooperative (DSTC) systems with amplify-and-forward relaying over Rayleigh fading channels with a high temporal correlation where the direct link between the source and the destination is available. In particular, we derive the upper and lower bounds of the outage probability as well as their corresponding asymptotic expressions. In addition, using only the average channel powers for the source-to-relay and relay-to-destination links, we propose an efficient power allocation scheme between the source and the relay to minimize the asymptotic upper bound of the outage probability. Through a numerical investigation, we verify the analytical expressions as well as the effectiveness of the proposed efficient power allocation. The numerical results show that the lower and upper bounds tightly correspond to the exact outage probability, and the proposed efficient power allocation scheme provides an outage probability similar to that of the optimal power allocation scheme that minimizes the exact outage probability.

• Korean Journal of Mathematics
• /
• v.10 no.1
• /
• pp.67-74
• /
• 2002

Suppose linear forms whose coefficients are arithmetic progressions are given. In this paper, we will find the upper and lower bounds of the minimal ranks of subforms of these forms which left the Frobenius numbers invariant. This is an improvement of Ritter's bounds.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7A
• /
• pp.1080-1089
• /
• 1999

The union upper bounds to the bit error probability of maximum likelihood(ML) soft-decoding of parallel concatenated convolutional codes(PCCC) and serially concatenated convolutional codes(SCCC) can be evaluated through the weight enumerating function(WEF). This union upper bounds become the lower bounds of the BER achievable when iterative decoding is used. In this paper, to compute the WEF, an efficient error event search algorithm which is a combination of stack algorithm and bidirectional search algorithm is proposed. By computor simulation, it is shown that the union boounds obtained by using the proposed algorithm become the lower bounds to BER of concatenated convolutional codes with iterative decoding.