• Journal of Communications and Networks
• /
• v.18 no.2
• /
• pp.182-189
• /
• 2016

The focus in this paper is on obtaining tight, simple algebraic-form bounds and invertible expressions for the average symbol error probability (ASEP) of M-ary phase shift keying (MPSK) in a class of composite fading channels. We employ the mixture gamma (MG) distribution to approximate the signal-to-noise ratio (SNR) distributions of fading models, which include Nakagami-m, Generalized-K ($K_G$), and Nakagami-lognormal fading as specific examples. Our approach involves using the tight upper and lower bounds that we recently derived on the Gaussian Q-function, which can easily be averaged over the general MG distribution. First, algebraic-form upper bounds are derived on the ASEP of MPSK for M > 2, based on the union upper bound on the symbol error probability (SEP) of MPSK in additive white Gaussian noise (AWGN) given by a single Gaussian Q-function. By comparison with the exact ASEP results obtained by numerical integration, we show that these upper bounds are extremely tight for all SNR values of practical interest. These bounds can be employed as accurate approximations that are invertible for high SNR. For the special case of binary phase shift keying (BPSK) (M = 2), where the exact SEP in the AWGN channel is given as one Gaussian Q-function, upper and lower bounds on the exact ASEP are obtained. The bounds can be made arbitrarily tight by adjusting the parameters in our Gaussian bounds. The average of the upper and lower bounds gives a very accurate approximation of the exact ASEP. Moreover, the arbitrarily accurate approximations for all three of the fading models we consider become invertible for reasonably high SNR.

• Proceedings of the KSME Conference
• /
• 2008.11b
• /
• pp.2744-2749
• /
• 2008

Numerical calculations are carried out for the natural convection induced by temperature difference between a cold outer square cylinder and a hot inner circular cylinder for Rayleigh number of $Ra=10^7$. This study investigates the effect of the inner cylinder location on the heat transfer and fluid flow. The location of inner circular cylinder ($\delta$) is changed vertically along the center-line of square enclosure. The natural convection bifurcates from unsteady to steady state according to $\delta$. Two critical positions of ${\delta}_{C,L}$ and ${\delta}_{C,U}$ as a lower bound and an upper bound are ${\delta}_{C,L}=0.05$ and ${\delta}_{C,U}=0.18$, respectively. Within the defined bounds, the thermal and flow fields are steady state. When the inner cylinder locates at ${\delta}{\geq}{\delta}_{C,U}$, the space between the upper surface of inner cylinder and the top surface of the enclosure forms a relatively shallow layer where the natural convection characterized as the pure Rayleigh-Benard convection forms alternately the upwelling and downwelling plums, as a result that a series of cells known as Benard cells is derived.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1842-1850
• /
• 1997

This paper proposes a new rearrangeable algorithm in multistage reverse shuffle/exchange network. The best known lower bound of stages for rearrangeability in symmetric network is 2logN-1 stages. However, it has never been proved for nonsymmetric networks before. Currently, the best upper bound for the rearrangeability of a shuffle/exchange network in nonsymmetric network is 3logN-3 stages. We describe the rearrangeability of reverse shuffle/exchange multistage interconnection network on every arbitrary permutation with $N{\le}16$. This rearrangeability can be established by setting one more stages in the middle stage of the network to allow the reduced network to be topological equivalent to a class of rearrangeable networks. The results in this paper enable us to establish an upper bound, 2logN stages for rearrangeable reverse shuffle/exchange network with $N{\le}16$, and leads to the possibility of this bound when $N{\le}16$.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.10 no.1
• /
• pp.31-40
• /
• 1985

When an economy has institutional price constraints the relationship between market prices and shadow prices is not yet fully investigated. A pure consumption economy is considered where market prices guide the consumption behavior and shadow prices measure the social value of resources. In this case we show that if the utility function is additively separable there exists a complementarity relation between the difference of the market price and the shadow price and the difference of the market price and the regulated upper (or lower) bound.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1999.04a
• /
• pp.6-10
• /
• 1999

We present a simulation result to the analysis of the effects of cell residence time distributions upon the expected channel occupancy time based on an analytic mobility model. Numerical examples show that exponential distribution provides upper and lower bound to the expected channel occupancy times of new calls and handoff calls. This fact reveals that the assumption of exponential distribution as the cell residence time distribution as the cell residence time distribution may over- or under-estimate cellular mobile systems.

• Journal of Internet Computing and Services
• /
• v.23 no.2
• /
• pp.97-105
• /
• 2022

Web services show a rapid evolution and integration to meet the increased users' requirements. Thus, web services undergo updates and may have performance degradation due to undetected faults in the updated versions. Due to these faults, many performances and regression anomalies in web services may occur in real-world scenarios. This paper proposed applying the deep learning model and innovative explainable framework to detect performance and regression anomalies in web services. This study indicated that upper bound and lower bound values in performance metrics provide us with the simple means to detect the performance and regression anomalies in updated versions of web services. The explainable deep learning method enabled us to decide the precise use of deep learning to detect performance and anomalies in web services. The evaluation results of the proposed approach showed us the detection of unusual behavior of web service. The proposed approach is efficient and straightforward in detecting regression anomalies in web services compared with the existing approaches.

• Management Science and Financial Engineering
• /
• v.9 no.2
• /
• pp.13-20
• /
• 2003

For inferring criteria in a performance appraisal. linear programming (LP) has been utilized as an alternative to policy capturing (PC). Previous policy capturing LP (PCLP) studies were limited to the criteria of exact numerical ratings. However. under certain evaluation circumstances, a ranged rating with a lower and upper bound may be preferred over an exact numerical value. Therefore, this study introduces a new LP model that allows ranged ratings. A simple example is given to illustrate our model.

• Journal of applied mathematics & informatics
• /
• v.15 no.1_2
• /
• pp.265-275
• /
• 2004

In this paper, multi-objective models for designing 3D trajectory of horizontal wells are developed in a fuzzy environment. Here, the objectives of minimizing the length of the trajectory and the error of entry target point are fuzzy in nature. Some parameters, such as initial value, end value, lower bound and upper bound of the curvature radius, tool-face angle and the arc length of each curve section, are also assumed to be vague and imprecise. The impreciseness in the above objectives have been expressed by fuzzy linear membership functions and that in the above parameters by triangular fuzzy numbers. Models have been solved by the fuzzy non-linear programming method based on Zimmermann [1] and Lee and Li [2]. Models are applied to practical design of the horizontal wells. Numerical results illustrate the accuracy and efficiency of the fuzzy models.

• Journal of the Korean Mathematical Society
• /
• v.56 no.4
• /
• pp.1017-1029
• /
• 2019

In this paper, blows-up and global solutions for a class of nonlinear divergence form parabolic equations with the abstract form of $({\varrho}(u))_t$ and time dependent coefficients are considered. The conditions are established for the existence of a solution globally and also the conditions are established for the blow up of the solution at some finite time. Moreover, the lower bound and upper bound of the blow-up time are derived if blow-up occurs.

• ETRI Journal
• /
• v.21 no.4
• /
• pp.9-22
• /
• 1999

This paper considers a problem of configuring both physical backbone and logical virtual path (VP) networks in a reconfigurable asynchronous transfer mode (ATM) network where links are subject to failures. The objective is to determine jointly the VP assignment, the capacity assignment of physical links and the bandwidth allocation of VPs, and the routing assignment of traffic demand at least cost. The network cost includes backbone link capacity expansion cost and penalty cost for not satisfying the maximum throughput of the traffic due to link failures or insufficient link capacities. The problem is formulated as a zero-one non-linear mixed integer programming problem, for which an effective solution procedure is developed by using a Lagrangean relaxation technique for finding a lower bound and a heuristic method exploited for improving the upper bound of any intermediate solution. The solution procedure is tested for its effectiveness with various numerical examples.