• Structural Engineering and Mechanics
• /
• 제24권6호
• /
• pp.727-740
• /
• 2006

A simple plane-strain solution is derived in this paper for the functionally graded multilayered isotropic elastic cylinder under static deformation. The solution is obtained using method of separation of variables and is expressed in terms of the summation of the Fourier series in the circumferential direction. While the solution for order n = 0 corresponds to the axisymmetric deformation, that for n = 2 includes the special deformation frequently utilized in the upper and lower bounds analysis. Numerical results for a three-phase cylinder with a middle functionally graded layer are presented for both axisymmetric (n = 0) and general (n = 2) deformations, under either the traction or displacement boundary conditions on the surface of the layered cylinder. The solution to the general deformation case (n = 2) is further utilized for the first time to find the upper and lower bounds of the effective shear modulus of the layered cylinder with a functionally graded middle layer. These results could be useful in the future study of cylindrical composites where FGMs and/or multilayers are involved.

• Journal of applied mathematics & informatics
• /
• 제33권1_2호
• /
• pp.145-155
• /
• 2015

In this paper, we study the bounds of the coefficients of the characteristic polynomial of the Frobenius endomorphism of the Jacobian of dimension three over a finite field. We provide explicitly computable bounds for the coefficients of the characteristic polynomial. In addition, we present the counting points algorithm for computing a group of the Jacobian of genus 3 hyperelliptic curves over a finite field with large characteristic. Based on these bounds, we found an efficient search space that was used in the counting points algorithm on genus 3 curves. The algorithm was explained and verified through simple examples.

• 한국IT서비스학회지
• /
• 제10권1호
• /
• pp.117-133
• /
• 2011

In this paper, we present a frequency reassignment problem (FRP) arising from the reconfiguration of radio networks such as adding new base stations (BSs) and changing the number of frequencies assigned to BSs. For this problem, we develop an integer programming (IP) model that minimizes the sum of frequency reassignment cost and the cost for unsatisfied frequency demands, while avoiding interference among frequencies. To obtain tight lower bounds, we develop some valid inequalities and devise an objective function relaxation scheme. Also, we develop a simple but efficient heuristic procedure to solve large size problems. Computational results show that the developed valid inequalities are effective for improving lower bounds. Also, the proposed tabu search heuristic finds tight upper bounds with average optimality gap of 2.3%.

• Nuclear Engineering and Technology
• /
• 제32권6호
• /
• pp.618-635
• /
• 2000

A total of 17 experimental data for the onset of slugging, which is assumed to be the precursor of the condensation-induced waterhammer (CIWH), have been obtained for various How rates of water Incorporating the most recent correlations of interfacial heat transfer and friction factor developed for a circular geometry and using an improved criterion of transition from stratified to a slug flow, two existing analytical models to predict lower and upper bounds for CIWH have been upgraded. Applicability of the present as well as existing CIWH models has been tested by comparison with two sets of CIWH data. The result of this comparison shows that the applicability of the present as well as existing models is reasonably good. Based on the present models for CIWH, a computer code entitled as“KAIST-CIWH”has been developed and sample guide charts to find CIWH free regions for a given combination of major flow parameters in a long horizontal pipe have been presented along with the results of parametric studies of major parameters (D, P, $T_{f,in}$, and L/D) on the critical inlet water flow rate（$W_{f,in}_crit$ for both lower and upper bounds. In addition, two simple formulas for lower and upper bounds that can be used in an emergency for quick results have been presented.

• 한국전자파학회논문지
• /
• 제11권3호
• /
• pp.352-357
• /
• 2000

이 논문에서는 동기 MPSK 신호에 대하여 새로운 간단한 심볼 오류 확률 하한식을 유도하고 분석한다. 보통 심볼 오류 확률 유도는 먼저 덧셉꼴 백색 정규잡음(AWGN) 환경에서 유도하고 이에 대한 결과를 바탕으로 여러 페이딩 환경에서의 심볼 오류 확률을 구하는 것이 일반적인 방법이다. 그러나 동기 MPSK의 경우는 여러 페 이딩 환경에서의 오류 확률 식이 구해져 있으나 가장 기본이 되는 덧셈팔 백색 정규 잡음 환경에서는 정확히 closed-form으로 유도하지 못하는 것으로 알려져 있다. 여기서는 먼저 나카가미 페이딩 환경에서 동기 MPSK 신호의 심볼 오류 확률식을 이용하여 나카가미 페이딩 지수가 무한대로 감에 따라 페이딩이 없는 덧셈꼴 백색 정규 잡음 채널로 돌아가는 성질을 이용하여 새로운 근사식을 유도하고 분석한다.

• 대한수학회보
• /
• 제54권6호
• /
• pp.2149-2154
• /
• 2017

In this paper, we obtain a simple lower bound for the number of positive (resp. negative) crossings in oriented link diagrams in terms of the maximal (resp. minimal) degree of the Jones polynomial.

• Journal of Communications and Networks
• /
• 제10권1호
• /
• pp.5-9
• /
• 2008

Researchers have investigated many upper bound techniques applicable to error probabilities on the maximum likelihood (ML) decoding performance of turbo-like codes and low density parity check (LDPC) codes in recent years for a long codeword block size. This is because it is trivial for a short codeword block size. Previous research efforts, such as the simple bound technique [20] recently proposed, developed upper bounds for LDPC codes and turbo-like codes using ensemble codes or the uniformly interleaved assumption. This assumption bounds the performance averaged over all ensemble codes or all interleavers. Another previous research effort [21] obtained the upper bound of turbo-like code with a particular interleaver using a truncated union bound which requires information of the minimum Hamming distance and the number of codewords with the minimum Hamming distance. However, it gives the reliable bound only in the region of the error floor where the minimum Hamming distance is dominant, i.e., in the region of high signal-to-noise ratios. Therefore, currently an upper bound on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix cannot be calculated because of heavy complexity so that only average bounds for ensemble codes can be obtained using a uniform interleaver assumption. In this paper, we propose a new bound technique on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix using ML estimated weight distributions and we also show that the practical iterative decoding performance is approximately suboptimal in ML sense because the simulation performance of iterative decoding is worse than the proposed upper bound and no wonder, even worse than ML decoding performance. In order to show this point, we compare the simulation results with the proposed upper bound and previous bounds. The proposed bound technique is based on the simple bound with an approximate weight distribution including several exact smallest distance terms, not with the ensemble distribution or the uniform interleaver assumption. This technique also shows a tighter upper bound than any other previous bound techniques for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix.

• Management Science and Financial Engineering
• /
• 제11권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.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1996년도 추계학술대회 논문집 학회본부
• /
• pp.52-54
• /
• 1996

A number of algorithm using the VSS(Variable Structure System) for uncertain dynamic system are developed. But, in these algorithms, the assumption that the uncertainties are bounded and their bounds are available to the designer is involved. And bounds on the uncertainties are an important clue to guarantee the stability of the closed loop system. However, sometimes bounds on the uncertainties may not be easily obtained because of the complexity of the structure of the uncertainties. Therefore, a methodology by which the boundary values on the uncertainties can be easily obtained is required. The VSS proposed in this proposal employ the new adaptive VSS scheme for uncertain dynamic system being estimated on line. The resulting control law is simple and easy to apply to on line computer control. It can also suppress chattering and maintain good tracking precision even if unmodeled dynamics are considered. And, a new method using nonlinear switching surface is introduced so that the speed response is improved and the good transient response can be obtained. Simulation results are presented and show the advantage of the proposed adaptive VSS with nonlinear switching surfaces.

• 대한산업공학회지
• /
• 제23권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.