• The Korean Journal of Food And Nutrition
• /
• v.8 no.3
• /
• pp.230-238
• /
• 1995

Iron and zinc were bound by neutral detergent fiber (NDF) obtained from 15 kinds of vegetables being consumed commonly in Korea. Binding capacity of Fe and Zn of NDF ranged from 37.8% to 85.5% and from 81% to 25.5%, respectively showing higher binding capacity of Fe to NDF than of Zn. Both Fe and Zn binding capacity of NDF increased as pH increased and reached to a maximum at pH 7 In all vegetables. The amount of mineral (Fe and Zn) bound to NDF increased as mineral concentration Increased.

• Communications for Statistical Applications and Methods
• /
• v.12 no.3
• /
• pp.653-657
• /
• 2005

Eigenstructure of a spatial design matrix of Matheron's variogram estimator in $R^1$ is derived. It is shown that the spatial design matrix in $R^1$ with n/2$\le$h < n has a nice spectral decomposition. The mean, variance, and covariance of this estimator are obtained using the eigenvalues of a spatial design matrix. We also found that the lower bound and the upper bound of the normalized Matheron's variogram estimator.

• The Pure and Applied Mathematics
• /
• v.17 no.2
• /
• pp.189-197
• /
• 2010

We give an upper bound for the estimation of the difference between both sides of the well-known H$\ddot{o}$lder's inequality. Moreover, an upper bound for the estimation of the difference of the integral form of H$\ddot{o}$lder's inequality is also obtained. The results of this paper are natural generalizations and refinements of those of [2-4].

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

In this paper we find an explicit form of upper bound of Hausdorff distance between given cubic spline curve and its quadratic spline approximation. As an application the approximation of offset curve of cubic spline curve is presented using our explicit error analysis. The offset curve of quadratic spline curve is exact rational spline curve of degree six, which is also an approximation of the offset curve of cubic spline curve.

• Journal of the Korean Society of Safety
• /
• v.7 no.4
• /
• pp.85-94
• /
• 1992

This paper, discribes analysis of theree - dimensional extrusion with the use of dual stream functions, By this method admissible velocity fields for the extrusion of three- dimensional flow was newly derived kinematically. For square section the extrusion pressure was calculated by numerical solution program which was based on the upper bound analysis. The relationship between relative extrusion pressure and reduction of area, relative die length and constant friction factors were successfully calculated which was newly developed in this study. The results could be applied to design extrusion die.

• Bulletin of the Korean Mathematical Society
• /
• v.48 no.3
• /
• pp.637-646
• /
• 2011

Cho and Kim [4] and Kim [6] introduced the concept of the competition index of a digraph. Cho and Kim [4] and Akelbek and Kirkland [1] also studied the upper bound of competition indices of primitive digraphs. In this paper, we study the upper bound of competition indices of strongly connected digraphs. We also study the relation between competition index and ordinary index for a symmetric strongly connected digraph.

• Korean Journal of Mathematics
• /
• v.18 no.4
• /
• pp.465-472
• /
• 2010

In this paper, we investigate the extent of the set on which the modulus of a meromorphic function is lower bounded by a term related to some Nevanlinna Theory functionals. A. I. Shcherba estimate the size of the set on which the modulus of an entire function is lower bounded by 1. Our theorem in this paper shows that the same result holds in the case that the lower bound is replaced by$lT(r,f)$, $0{\leq}l$ < 1, which improves Shcherba's result. We also give a similar estimation for meromorphic functions.

• Journal of the Korean Mathematical Society
• /
• v.33 no.4
• /
• pp.709-716
• /
• 1996

Nielsen coincidence theory is concerned with the determinatin of a lower bound of the minimal number MC[f,g] of coincidence points for all maps in the homotopy class of a given map (f,g) : X $\to$ Y. The Nielsen Nielsen number $N_R(f,g)$ (similar to [9]) is introduced in [3], which is a lower bound for the number of coincidence points in the relative homotopy class of (f,g) and $N_R(f,g) \geq N(f,g)$.

• Proceedings of the KIPE Conference
• /
• 2000.07a
• /
• pp.624-627
• /
• 2000

An adaptive fuzzy sliding-mode control system which combines the merits of sliding-mode control the fuzzy inference mechanism and the adaptive algorithm is proposed. A fuzzy sliding-mode controller is investigated in which a simple fuzzy inference mechamism is used to estimate the upper bound of uncertainties., The fuzzy inference mechanism with centre adaptation of membership functions is investigated to estimate the optimal bound of uncertainties.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.2
• /
• pp.1-19
• /
• 1994

A generalized network problem is a special class of linear programming problem whose coefficient matrix contains at most two nonzero elements per column. A generalized network problem with 0-1 flow restrictions is called an integer generalized network(IGN) problem. In this paper, we presented a branch and bound algorithm for the IGN that uses network relaxation. To improve the procedure, we develop various strategies, each of which employs different node selection criterion and/or branching variable selection criterion. We test these solution strategies and compare their efficiencies with LINDO on 70 randomly generated problems.