• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.20 no.11
• /
• pp.3538-3548
• /
• 1996

In this study, as a part of basic study for developing the simulation program for the assemssment of reliability of electronic EMC packaging which covers from EMC mixing step to thermal analysis, comparison between a measured and predicted values of material properties of EMC and finitde element analysis of thermal stress are performed. For the experimental testing specimens of fifty, sixty hive and eighty percent filler($13\mu m$, spherical silica) weight fraction are fabricated using tranfer molding. Coefficient of thermal expansion, elastic modulus and thermla conductivity are measured using these specimens and then these measured values are compared with the predicted values by various equations ( such as dilute suspension method. self consistent method, generalized self consistent method, Hashin-Shtrikman's bounds. Shapery's bounds, Nielsen's method and others). Measured values are distributed within the upper and lower bounds of equations. Measured elastic modulus and coefficient of thermal expansion approaches closely the perdicted values with self consisten mehtod and upper bound of Shaperys equation respectively. However small differences of thermal conductivity between the different filler volume fraction are obserbed. FEM analysis indicates that firstly stress is concentrated at the corner section of EMC and secondly EMC with eighty percent filler weight fraction shows less thermal stress when package is cooling down and relatively high thermal stress when package is heating up.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12C
• /
• pp.1150-1156
• /
• 2006

In this paper we derive some lower bounds on the linear complexity and upper bounds on the 1-error linear complexity over $F_p$ of M-ary Sidel'nikov sequences of period $p^m-1$ when $M\geq3$ and $p\equiv{\pm}1$ mod M. In particular, we exactly compute the 1-error linear complexity of ternary Sidel'nikov sequences when $p^m-1$ and $m\geq4$. Based on these bounds we present the asymptotic behavior of the normalized linear complexity and the normalized 1-error linear complexity with respect to the period.

• Journal of Communications and Networks
• /
• v.17 no.3
• /
• pp.231-240
• /
• 2015

To facilitate the base station planning in high speed railway communication systems, it is necessary to consider the functional relationships between the base station transmit power and space parameters such as train velocity and cell radius. Since these functions are able to present some inherent system properties determined by its spatial topology, they will be referred to as the power-space functions in this paper. In light of the fact that the line-of-sight path persists the most power of the received signal of each passing train, this paper considers the average transmission rate and bounds on power-space functions based on the additive white Gaussian noise channel (AWGN) model. As shown by Monte Carlo simulations, using AWGN channel instead of Rician channel introduces very small approximation errors, but a tractable mathematical framework and insightful results. Particularly, lower bounds and upper bounds on the average transmission rate, as well as transmit power as functions of train velocity and cell radius are presented in this paper. It is also proved that to maintain a fixed amount of service or a fixed average transmission rate, the transmit power of a base station needs to be increased exponentially, if the train velocity or cell radius is increased, respectively.

• Journal of the Korean Mathematical Society
• /
• v.47 no.3
• /
• pp.585-598
• /
• 2010

We deal with Matveev complexity of compact orientable 3-manifolds represented via Heegaard diagrams. This lead us to the definition of modified Heegaard complexity of Heegaard diagrams and of manifolds. We define a class of manifolds which are generalizations of Dunwoody manifolds, including cyclic branched coverings of two-bridge knots and links, torus knots, some pretzel knots, and some theta-graphs. Using modified Heegaard complexity, we obtain upper bounds for their Matveev complexity, which linearly depend on the order of the covering. Moreover, using homology arguments due to Matveev and Pervova we obtain lower bounds.

• Journal of Korean Society for Quality Management
• /
• v.35 no.2
• /
• pp.99-105
• /
• 2007

Most of systems used in real fields are considered as multistate systems with multistate components. As one of methods for performance evaluation of the system, reliability analysis has been popularly used. In this paper, we propose an improved reliability analysis method which is based on state space decomposition method of Aven (1985). In deriving upper bounds, our method uses sets of unspecified states whereas Aven (1985) excludes sets of unacceptance states. Also, closer lower bounds to an exact reliability are obtained by considering of importance of min-path vectors.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.13 no.4
• /
• pp.267-280
• /
• 2009

In this paper we investigate a simple two-level additive Schwarz preconditioner for the P1 symmetric interior penalty Galerkin method of the Poisson equation on rectangular meshes. The construction is based on the decomposition of the global space of piecewise linear polynomials into the sum of local subspaces, each of which corresponds to an element of the underlying mesh, and the global coarse subspace consisting of piecewise constants. This preconditioner is a direct combination of the block Jacobi iteration and the cell-centered finite difference method, and thus very easy to implement. Explicit upper and lower bounds for the maximum and minimum eigenvalues of the preconditioned matrix system are derived and confirmed by some numerical experiments.

• Journal of Korean Institute of Industrial Engineers
• /
• v.34 no.2
• /
• pp.205-215
• /
• 2008

convergence networks (BcN). The problem seeks to minimize the total cost of switch and cable while satisfying the requirement of demand and quality of service (QoS). We develop mixed integer programming models to obtain the optimal switch location of the access network. We develop a Tabu Search (TS) heuristic algorithm for finding a good feasible solution within a reasonable time limit. We propose real networks with up to 25 nodes and 180 demands. In order to demonstrate the effectiveness of the proposed algorithm, we generate lower bounds from nonlinear QoS relaxation problem. Computational results show that the proposed heuristic algorithm provides upper bounds within 5% optimality gap in 10 seconds.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.6
• /
• pp.1845-1856
• /
• 2016

In this paper our aim is to study the classical Bessel-Struve kernel. Monotonicity and log-convexity properties for the Bessel-Struve kernel, and the ratio of the Bessel-Struve kernel and the Kummer confluent hypergeometric function are investigated. Moreover, lower and upper bounds are given for the Bessel-Struve kernel in terms of the exponential function and some $Tur{\acute{a}}n$ type inequalities are deduced.

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