• 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.

• 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.

• 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.

• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.5
• /
• pp.120-127
• /
• 1998

Differential inequalities occurring in problems of obstacle contact problems are recast into variational inequalities and analyzed by finite element methods. A new a posteriori error estimator, which is essential in adaptive finite element method, is introduced to capture the errors in finite element approximations of these variational inequalities. In order to construct a posteriori error estimates, saddle point problems are introduced using Lagrange parameters and upper bounds are provided. The global upper bound is localized by a special mixed formulation, which leads to upper bounds of the element errors. A numerical experiment is performed on an obstacle contact problem to check the effectivity index both in a local and a global sense.

• East Asian mathematical journal
• /
• v.7 no.2
• /
• pp.179-184
• /
• 1992

• Journal of the Korean Operations Research and Management Science Society
• /
• v.34 no.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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.193-214
• /
• 2017

In this paper, we study the problem of network utility maximization in a CSMA based multi-hop wireless network. Existing work in this aspect typically adopted continuous time Markov model for performance modelling, which fails to consider the channel conflict impact in actual CSMA networks. To maximize the utility of a CSMA based wireless network with channel conflict, in this paper, we first model its weighted network capacity (i.e., network capacity weighted by link queue length) and then propose a distributed link scheduling algorithm, called CSMA based Maximal-Weight Scheduling (C-MWS), to maximize the weighted network capacity. We derive the upper and lower bounds of network utility based on C-MWS. The derived bounds can help us to tune the C-MWS parameters for C-MWS to work in a distributed wireless network. Simulation results show that the joint optimization based on C-MWS can achieve near-optimal network utility when appropriate algorithm parameters are chosen and also show that the derived utility upper bound is very tight.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1A
• /
• pp.43-47
• /
• 2000

In regions of low signal-to-noise ratio (SNR), performance analysis uses simulations of hybrid concatenated coding systems. However, for higher SNR regions beyond simulation capabilities, average upper bounds to bit error rate (BER) and word error rate (WER) are used. In [1], all weight enumerating functions are needed to obtain average bounds. In this paper, we use RSC as constituent codes, by using effective free distances instead of WEF, we derive average BER and WER bounds of hybrid concatenated convolutional codes (HCCC) and analyze the BER and WER over AWGN and Rayleigh/Rician fading channels.

• Journal of the Korean Mathematical Society
• /
• v.42 no.6
• /
• pp.1215-1230
• /
• 2005

In this paper we establish some results on the increments of a d-dimensional Gaussian process with the usual Euclidean norm. In particular we obtain the law of iterated logarithm and the Book-Shore type theorem for the increments of ad-dimensional Gaussian process, via estimating upper bounds and lower bounds of large deviation probabilities on the suprema of the d-dimensional Gaussian process.

• Journal of applied mathematics & informatics
• /
• v.34 no.3_4
• /
• pp.319-330
• /
• 2016

The hyper-Zagreb index HM(G) of a simple graph G is defined as the sum of the terms (d_u+d_v)² over all edges uv of G, where d_u denotes the degree of the vertex u of G. In this paper, we present several upper and lower bounds on the hyper-Zagreb index in terms of some molecular structural parameters and relate this index to various well-known molecular descriptors.