• Journal of applied mathematics & informatics
• /
• v.33 no.3_4
• /
• pp.365-377
• /
• 2015

For a (molecular) graph, the first and second Zagreb indices (M₁ and M₂) are two well-known topological indices, first introduced in 1972 by Gutman and Trinajstić. The first Zagreb index M₁ is equal to the sum of the squares of the degrees of the vertices, and the second Zagreb index M₂ is equal to the sum of the products of the degrees of pairs of adjacent vertices. Let $K_{n_1,n_2}^{P}$ with n₁ $\leq$ n₂, n₁ + n₂ = n and p < n₁ be the set of bipartite graphs obtained by deleting p edges from complete bipartite graph K_n1,n2. In this paper, we determine sharp upper and lower bounds on Zagreb indices of graphs from $K_{n_1,n_2}^{P}$ and characterize the corresponding extremal graphs at which the upper and lower bounds on Zagreb indices are attained. As a corollary, we determine the extremal graph from $K_{n_1,n_2}^{P}$ with respect to Zagreb coindices. Moreover a problem has been proposed on the first and second Zagreb indices.

• Journal of Communications and Networks
• /
• v.1 no.3
• /
• pp.182-188
• /
• 1999

The optimal joint maximum-likelihood sequence estima-for using an array of antennas is derived for synchronous direct sequence-code division multiple access (DS-CDMA) system. Each user employs a rate 1/n convolutional code for channel coding for the additive white Gaussian noise (AWGN) channel. The array re-ceiver structure is composed of beamformers in the users' direc-tions followed by a bank of matched filters. The decoder is imple-mented using a Viterbi algorithm whose states depend on the num-ber of users and the constraint length of the convolutional code. The asymptotic array multiuser coding gain(AAMCG)is defined to encompass the asymptotic multiuser coding gain and the spatial information on users' locations in the system. We derive the upper and lower bounds of the AAMCG. As an example, the upper and lower bounds of AAMCG are obtained for the two user case where each user employes the maximum free distance convolutional code with rate 1/2. The enar-far resistance property is also investigated considering the number of antenna elements and user separations in the space.

• International Journal of Internet, Broadcasting and Communication
• /
• v.12 no.2
• /
• pp.37-44
• /
• 2020

The fifth generation (5G) mobile communication has been commercialized and the 5G applications, such as the artificial intelligence (AI) and the internet of things (IoT), are deployed all over the world. The 5G new radio (NR) wireless networks are characterized by 100 times more traffic, 1000 times higher system capacity, and 1 ms latency. One of the promising 5G technologies is non-orthogonal multiple access (NOMA). In order for the NOMA performance to be improved, sometimes the additive signal-dependent Gaussian noise (ASDGN) channel model is required. However, the channel capacity calculation of such channels is so difficult, that only lower and upper bounds on the capacity of ASDGN channels have been presented. Such difficulties are due to the specific constraints on the dependency. Herein, we provide the capacity of ASDGN channels, by removing the constraints except the dependency. Then we obtain the ASDGN channel capacity, not lower and upper bounds, so that the clear impact of ASDGN can be clarified, compared to additive white Gaussian noise (AWGN). It is shown that the ASDGN channel capacity is greater than the AWGN channel capacity, for the high signal-to-noise ratio (SNR). We also apply the analytical results to the NOMA scheme to verify the superiority of ASDGN channels.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10A
• /
• pp.958-964
• /
• 2007

In this paper, we derive the relationship between the bit error probability (BEP) of maximum a posteriori (MAP) bit detection and the bit minimum mean square error (MMSE), that is, the BEP is greater than a quarter of the bit USE and less than a half of the bit MMSE. By using this result, the lower and upper bounds of the derivative of the mutual information are derived from the BEP and the lower and upper bounds are easily obtained in the multiple-input multiple-output (MIMO) communication systems with the bit-linear linear-dispersion (BLLD) codes in the Gaussian channel.

• Architectural research
• /
• v.9 no.1
• /
• pp.31-37
• /
• 2007

This study presents the so-called Modified Allowable Stress Design (MASD) method for structural designs. The objective of this study is to qualitatively estimate uncertainties of tensile steel member's cross-sectional structural designs and find the optimal resulting design which can resist all uncertainty cases. The design parameters are assumed to be interval associated with lower and upper bounds and consequently interval methods are implemented to non-stochastically produce design results including the structural uncertainties. By seeking optimal uncertainty combinations among interval parameters, engineers can qualitatively describe uncertain design solutions which were not considered in conventional structural designs. Under the assumption that structures have basically uncertainties like displacement responses, the safety range of resulting designs is represented by lower and upper bounds depending on given tolerance error and structural parameters. As a numerical example uncertain cross-sectional areas of members that can resist applied loads are investigated and it demonstrates that the present design method is superior to conventional allowable stress designs (ASD) with respect to a reliably structural safety as well as an economical material.

• Journal of Information Technology Services
• /
• v.9 no.3
• /
• pp.107-121
• /
• 2010

In this paper, we present a frequency reassignment problem (FRP) that arises when we install new base stations or reconfigure radio networks to increase the capacity or to expand service area. For this problem, we develop an integer programming (IP) model, and develop cutting planes to enhance the mathematical representation of the model. Also, we devise an effective tabu search algorithm to obtain tight upper bounds within reasonable time bounds. Computational results exhibit that the developed cutting planes are effective for reducing the computing time as well as for increasing lower bounds. Also, the proposed tabu search algorithm finds a feasible solution of good quality within reasonable time bound.

• Management Science and Financial Engineering
• /
• v.11 no.2
• /
• pp.19-43
• /
• 2005

This paper considers a variation of the customer order scheduling problem, and the variation is the case where the machine-job assignment is fixed. We examine the parallel machine environment, and the objective is to minimize the sum of the completion times of the batches. While a machine can process only one job at a time, different machines can simultaneously process different jobs in a batch. The recognition version of this problem is known to be NP-complete in the strong sense even if there exist only two parallel machines. When there are an arbitrary number of parallel machines, we establish three lower bounds and develop a dynamic programming (DP) algorithm which runs in exponential time on the number of batches. We present two simple but intuitive heuristics, SB and GR, and find some special cases where SB and GR generate an optimal schedule. We also find worst case upper bounds on the relative error. For the case of the two parallel machines, we show that GR generates an optimal schedule when processing times of all batches are equal. Finally, the heuristics and the lower bounds are empirically evaluated.

• Proceedings of the Korea Concrete Institute Conference
• /
• 1998.10b
• /
• pp.712-717
• /
• 1998

Represtressed preflex beams do not allow tensile stress under service load by introducing additional prestressing at the lower concrete of beams. In this study, optimal design of represetressed preflex beams are numerically investigated. Design variables are dimension of plate girder. Object function is the total weight of plate girder. Constraints of the stress of plate girder and upper and lower concrete flange and lower and upper bounds on the design variables are imposed. Structural analysis is performed by D.A.R.P.(Design and Analysis of Represtressed Preflex beams). For numerical optimization, ADS(Garret N. Vanderplaats) program is used. From result of application examples, optimum designs of different cases are successfully obtained. The design program developed in this study seems efficient and robust for the optimization of represtressed preflex beams.

• Industrial Engineering and Management Systems
• /
• v.3 no.2
• /
• pp.100-115
• /
• 2004

The network representation and branch and bound algorithm with efficient lower and upper bounding procedures are developed to determine a global optimal production schedule on a machine that minimizes sequence-dependent setup cost and earliness/tardiness penalties. Lower bounds are obtained based on heuristic and Lagrangian relaxation. Priority dispatching rule with local improvement procedure is used to derive an initial upper bound. Two dominance criteria are incorporated in a branch and bound procedure to reduce the search space and enhance computational efficiency. The computational results indicate that the proposed procedure could optimally solve the problem with up to 40 jobs in a reasonable time using a personal computer.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.1
• /
• pp.35-49
• /
• 2008

To load a container in a yard block onto a ship, a Transfer Crane (TC) moves to a target yard bay, then its hoist picks up a selected container and loads it onto a waiting Yard Truck (YT). An optimal routing problem of Transfer Crane is a decision problem which determines a given TC's the visiting sequence of yard-bays and the number of containers to transfer from each yard-bay. The objective is to minimize the travel time of the TC between yard-bays and setup time for the TC in a visiting yard. In this paper, we shows that the problem is NP-complete, and suggests a new formulation for it. Using the new formulation for the problem, we investigate some characteristics of solutions, a lower and upper bounds for it. Moreover, our lower and upper bound is very efficient to applying some instances suggested in a previous work.