• Bulletin of the Korean Mathematical Society
• /
• v.56 no.2
• /
• pp.391-397
• /
• 2019

In this paper, we give a simple proof of the improved Johnson bound for A(n, d), the maximum number of codewords in a binary code of length n and minimum distance d, given by Mounits, Etzion and Litsyn.

• Transactions of Materials Processing
• /
• v.6 no.3
• /
• pp.233-238
• /
• 1997

The estimation of the forming force required for metal forming process is unavoidable for selecting suitable machine and dimensioning die and punch parts. For this purpose the upper-bound method turns out to be very practical in simple two-dimensional cases under well-known boundary conditions. However, the application of this method for complicated two-or three-dimentional cases is very limited or practically impossible. The modified application of FEM in a manner of applying the upper bound method(the so-called Upper-bound Finite Element Simulation Method) fortunately provides the posibility of getting important information about the forming process in a simple and quick way before realizing the process on the machine. It is expected to function successfully even in three-dimentional cases. The application procedure has been explained for two-dimensional cases and its usefulness shown.

• Journal of Advanced Navigation Technology
• /
• v.11 no.4
• /
• pp.447-453
• /
• 2007

In this letter, we derive the Gallager random coding bound for discrete memoryless channels purely by simple manipulations of algebraic inequalities rather than invoking conceptually difficult random coding arguments. Gallager random coding bound is a very useful tool in information and coding theory due to its applicability to situations in which it is difficult to determine the decision regions and due to the fact that it can be used to derive the channel coding theorem. The readers will find it relatively easy to apply to many practical problems of interest the step-by-step algebraic derivations of the Gallager random coding bound with appropriate modifications.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2A
• /
• pp.138-143
• /
• 2006

We present upper bounds for the maximum-likelihood decoding performance of particular LDPC codes and turbo-like codes with particular interleavers. Previous research developed upper bounds for LDPC codes and turbo-like codes using ensemble codes or the uniformly interleaved assumption, which bound the performance averaged over all ensemble codes or all interleavers. Proposed upper bounds are based on the simple bound and estimated weight distributions including the exact several smallest distance terms because if either estimated weight distributions on their own or the exact several smallest distance terms only are used, an accurate bound can not be obtained.

• Journal of the Korean Mathematical Society
• /
• v.39 no.4
• /
• pp.593-609
• /
• 2002

The order of speciality of an ample invertible Sheaf L on a curve is the least integer m so that $L^{ m}$ is nonspecial. There is a reasonable upper bound of the order of speciality for a simple invertible sheaf in terms of its degree and projective dimension. We study the case where it reaches the upper bound. Moreover we for mulate Castelnuovo's genus bound involving the order of speciality.ality.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.45
• /
• pp.291-299
• /
• 1998

We present a variant for the generalized continuous multiple-choice knapsack problem[1], which additionally has the well-known generalized lower bound constraints. The presented problem is characterized by some variables which only belong to the simple upper bound constraints and the others which are partitioned into both the continuous multiple-choice constraints and the generalized lower bound constraints. By exploiting some extended structural properties, an efficient algorithm of order Ο($n^2$1og n) is developed, where n is the total number of variables. A numerical example is presented.

• Structural Engineering and Mechanics
• /
• v.30 no.3
• /
• pp.351-368
• /
• 2008

The purpose of this paper is to propose a simple analysis method of axial deformation of base-isolation rubber bearings in a building subjected to earthquake loading and present its applicability to the analysis of the bound of the aspect ratio of base-isolated buildings. The base shear coefficient is introduced as a key parameter for the bound analysis. The bound of the aspect ratio of base-isolated buildings is analyzed based on the relationship of the following four quantities; (i) ultimate state of the tensile stress of rubber bearings based on a proposed simple recursive analysis for seismic loading, (ii) ultimate state of drift of the base-isolation story for seismic loading, (iii) ultimate state of the axial compressive stress of rubber bearings under dead loads, (iv) prediction of the overturning moment at the base for seismic loading. In particular, a new recursive analysis method of axial deformation of rubber bearings is presented taking into account the nonlinear tensile behavior of rubber bearings and it is shown that the relaxation of the constraint on the ultimate state of the tensile stress of rubber bearings increases the limiting aspect ratio.

• Transactions on Control, Automation and Systems Engineering
• /
• v.1 no.1
• /
• pp.44-49
• /
• 1999

This paper presents a new T-S(Tae-Sugeno) fuzzy controller design method satisfying the output energy bound. Maximum output energy via a quadratic Lyapunov function to obtain the bound on output energy is derived. LMI(Linear Matrix Inequality) problems which satisfy an output energy bound for both of the continuous-time and discrete-time T-S fuzzy control system are also derived. Solving these LMIs simultaneously, we find a common symmetric positive definite matrix P which guarantees the global asymptotic stability of the system and stable feedback gains K's satisfying the output energy bound. A simple example demonstrates validity of the proposed design method.

• Structural Engineering and Mechanics
• /
• v.51 no.4
• /
• pp.565-579
• /
• 2014

The pullout capacity of plate anchors has been studied extensively over the past 40 years. However, very few studies have attempted to calculate the pullout capacity of anchors in sandy slopes. In this paper, three upper bound approaches are used to study the effect of a sloping ground surface and friction angle on pullout capacity and failure of plate anchors. This includes the use of; simple upper bound mechanisms; the block set mechanism approach; and finite element upper bound limit analysis. The aim of this research is to better understand the various failure mechanisms and to develop a simple methodology for estimating the pullout capacity of anchors in sandy slopes.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.635-638
• /
• 1998

This paper proposes a simple method to measure system's performance in target tracking problems. Essentially employing the Cramer-Rao lower bound (CRLB) on trakcing accuracy, an algorithm of predicting system's performance under various scenarios is developed. The input data is a collection of measurements over time fromsensors embedded in gaussian noise. The target of interest may not maneuver over the processing time interval while the own ship observing platform may maneuver in an arbitrary fashion. Th eproposed approach is demonstrated and discussed through simulation results.