• Communications of the Korean Mathematical Society
• /
• v.11 no.4
• /
• pp.881-885
• /
• 1996

We give the optimal lower bound for the Picard number of certain surfaces in the Noether-Lefschetz locus.

• Journal of the Korean Mathematical Society
• /
• v.29 no.1
• /
• pp.117-125
• /
• 1992

• Journal of Nutrition and Health
• /
• v.30 no.7
• /
• pp.743-750
• /
• 1997

The hypoglycemic effects of 2 mushrooms, Pleurotus ostreatus and Lentinus edodes, on streptozotocin(STZ) induced diabetic rats were investigated in this study . Diabets mellitus was induced in male Sprague-Dawley rats by the injection of STZinto the tail vein at a dose of 45mg/kg. Sprague-Dawley male rats(200-250g) were assigned to one control and three STZ-diabetic groups. Diabetic groups were assigned to STZ-control, pleurotus ostreatus and Lenitinus edodes groups. All groups were fed a AIN 76 diet. The two experimental groups were fed with each protein-bound polysaccharide(150mg/kg BW) for 14 days and with carboxymethyl cellulose for STZ-control group. The body weight gain was monitored and the blood levels of glucose and cholesterol were measured . Levels of protein triglyceride, and free fatty acid in plasma were analysed. Serum aminotransferase activity as also measured. The body weight gain was lower in the all diabetic groups than in the of normal group. The weight of spleen was reduced by adminstration of the Lentinus edodes protein-bound polysaccharides. The result suggest that orally administered Lentinus edodes protein-bound polysaccharides exhibited hypoglycemic effect in STZ -induced diabetic rats and that these protein-bound polysaccharides may be useful for the management of diabetes mellitus.

• Journal of Korean Institute of Industrial Engineers
• /
• v.19 no.2
• /
• pp.3-13
• /
• 1993

In this study, we develop a B & B type algorithm for the concave minimization problem with 0-1 knapsack constraint. Our algorithm reformulates the original problem into the singly linearly constrained concave minimization problem by relaxing 0-1 integer constraint in order to get a lower bound. But this relaxed problem is the concave minimization problem known as NP-hard. Thus the linear function that underestimates the concave objective function over the given domain set is introduced. The introduction of this function bears the following important meanings. Firstly, we can efficiently calculate the lower bound of the optimal object value using the conventional convex optimization methods. Secondly, the above linear function like the concave objective function generates the vertices of the relaxed solution set of the subproblem, which is used to update the upper bound. The fact that the linear underestimating function is uniquely determined over a given simplex enables us to fix underestimating function by considering the simplex containing the relaxed solution set. The initial containing simplex that is the intersection of the linear constraint and the nonnegative orthant is sequentially partitioned into the subsimplices which are related to subproblems.

• Proceedings of the Korean Geotechical Society Conference
• /
• 2005.03a
• /
• pp.521-528
• /
• 2005

The evaluation process of rock mass properties intrinsically contains some uncertainty due to the inhomogeneity of rock mass and the measurement error. Although various empirical methods for the determination of rock mass properties were suggested, there is no way of integrating various information on rock mass properties except averaging. For these reasons, this research introduces evidence theory which can model epistemic uncertainty and yield reasonable rock mass properties through combining various information such as empirical equations, in-situ test results, and so on. Through the application of evidence theory to the real site investigation and in situ experiment results, an interval of deformation modulus, cohesion and friction angle of rock mass were obtained. The ratios between lower and upper bound of those properties ranges from 1.6 to 3.6. Numerical analyses of circular hole using the properties for TYPE-2 rock mass were carried out. The magnitude or size of plastic region and radial displacement in case of lower bound properties is about 4 times larger than that of upper bound properties.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.7 no.2
• /
• pp.426-434
• /
• 2015

In this paper we proposed a dada-aided Doppler estimation method for underwater acoustic communication. The training sequence is non-dedicate, hence it can be designed for Doppler estimation as well as channel equalization. We assume the channel has been equalized and consider only flat-fading channel. First, based on the training symbols the theoretical received sequence is composed. Next the least square principle is applied to build the objective function, which minimizes the error between the composed and the actual received signal. Then an iterative approach is applied to solve the least square problem. The proposed approach involves an outer loop and inner loop, which resolve the channel gain and Doppler coefficient, respectively. The theoretical performance bound, i.e. the Cramer-Rao Lower Bound (CRLB) of estimation is also derived. Computer simulations results show that the proposed algorithm achieves the CRLB in medium to high SNR cases.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.11
• /
• pp.830-835
• /
• 2006

Because of its exponential growth of data and voice transmissions through wireless communications, efficient resource management became more important factor when we design wireless networks. One of those limited resources in the wireless communications is frequency bandwidth. As a solution of increasing reusability of resources, the efficient frequency assignment problems on wireless networks have been widely studied. One suitable approach to solve these frequency assignment problems is transforming the problem into traditional graph coloring problems in graph theory. However, most of frequency assignments on arbitrary network topology are NP-Complete problems. In this paper, we consider the Chromatic Bandwidth Problem on the cellular topology wireless networks. It is known that the lower bound of the necessary number of frequencies for this problem is $O(k^2)$. We prove that the lower bound of the necessary number of frequencies for the Chromatic Bandwidth Problem is $O(k^3)$ which is tighter lower bound than the previous known result.

• Bulletin of the Korean Mathematical Society
• /
• v.44 no.1
• /
• pp.103-108
• /
• 2007

In this paper, we obtain some lower bounds for area of non-simply connected compact singular surfaces of nonpositive curvature. One inequality involves systole and area of the surface.

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.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 the Korean Mathematical Society
• /
• v.33 no.3
• /
• pp.513-525
• /
• 1996

Let the operator A be self-adjoint with domain, Dom(A), dense in $(H)$ which is a separable Hilbert space with norm $\left\$\mid$ \cdot \right\$\mid$$ and inner product $<\cdot, \cdot>$.