• 환경생물
• /
• 제20권3호
• /
• pp.232-236
• /
• 2002

The morphological patterns and the cytopathogenicity time of the Vero cells induced by free $Cd^{2+}$ and pigment-bound $Cd^{2+}$ were observed by inverted microscope in order to investigate the difference of cadmium toxicity. The Vero cells induced by Hee $Cd^{2+}$ of 0.1 mM were shown to have a fatal toxic effect and the cytopathogenicity could be seen early after 6$\pm$2 hours of incubation. Partially affected cells induced by pigment-bound $Cd^{2+}$ of 0.1 mM were shown and the cytopathogenicity could be seen after 20 hours of incubation. The Vero cells grown with free 0.001 mM $Cd^{2+}$ were also affected and the cytopathogenicity could be seen after 17 hours of incubation, whereas the Vero cells grown with 0.001 mM pigment- bound $Cd^{2+}$ were unaffected. The sensitivity of Escherichia coli DH5$\alpha$ bacterial cells was also examined after a short treatment with free $Cd^{2+}$ or pigment-bound $Cd^{2+}$. About 5% of cells survived after 0.01 mM of free $Cd^{2+}$ treatment, while about 68% of cells survived after 0.01 mM of pigment- bound $Cd^{2+}$.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제14권2호
• /
• pp.93-111
• /
• 2010

The purpose of this paper is to obtain new complexity results for a second-order cone optimization (SOCO) problem. We define a proximity function for the SOCO by a kernel function. Furthermore we formulate an algorithm for a large-update primal-dual interior-point method (IPM) for the SOCO by using the proximity function and give its complexity analysis, and then we show that the new worst-case iteration bound for the IPM is $O(q\sqrt{N}(logN)^{\frac{q+1}{q}}log{\frac{N}{\epsilon})$, where $q{\geqq}1$.

• Kyungpook Mathematical Journal
• /
• 제63권2호
• /
• pp.167-173
• /
• 2023

Let G be a finite group and let ν(G) be the probability that two randomly selected elements of G produce a nilpotent group. In this article we show that for every positive integer n > 0, there is a finite group G such that ${\nu}(G)={\frac{1}{n}}$. We also classify all groups G with ${\nu}(G)={\frac{1}{2}}$. Further, we prove that if G is a solvable nonnilpotent group of even order, then ${\nu}(G){\leq}{\frac{p+3}{4p}}$, where p is the smallest odd prime divisor of |G|, and that equality exists if and only if $\frac{G}{Z_{\infty}(G)}$ is isomorphic to the dihedral group of order 2p where Z_∞(G) is the hypercenter of G. Finally we find an upper bound for ν(G) in terms of |G| where G ranges over all groups of odd square-free order.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.366-370
• /
• 2003

This paper is on weighted model reduction using structurally balanced truncation. For a given weighted(single or double-sided) transfer function, a state space realization with the linear fractional transformation form is obtained. Then we prove that two block diagonal LMI(linear matrix inequality) solutions always exist, and it is possible to get a reduced order model with guaranteed stability and a priori error bound. Finally, two examples are used to show the validity of proposed weighted reduction method, and the method is compared with other existing methods.

• 한국경영과학회지
• /
• 제22권3호
• /
• pp.1-9
• /
• 1997

We present an extension of the well-known generalized upper bound (GUB) constraint and consider a linear knapsack problem with both the extended GUB constraints and the simple upper bound (SUB) constraints. An efficient algorithm of order O($n^2log n$) is developed by exploiting structural properties and applying binary search to ordered solution sets, where n is the total number of variables. A numerical example is presented.

• 대한수학회논문집
• /
• 제33권2호
• /
• pp.437-444
• /
• 2018

Let S denote the class of analytic and univalent functions in the open unit disk $D=\{z:{\mid}z{\mid}<1\}$ with the normalization conditions f(0) = 0 and f'(0) = 1. In the present article, an upper bound for third order Hankel determinant $H_3(1)$ is obtained for a certain subclass of univalent functions generated by Ruscheweyh derivative operator.

• 대한수학회논문집
• /
• 제20권4호
• /
• pp.861-873
• /
• 2005

In this paper we approximate a cylindrical helix by bi-conic and bi-quadratic Bezier curves. Each approximation method is $G^1$ end-points interpolation of the helix. We present a sharp upper bound of the Hausdorff distance between the helix and each approximation curve. We also show that the error bound has the approximation order three and monotone increases as the length of the helix increases. As an illustration we give some numerical examples.

• 대한수학회지
• /
• 제47권6호
• /
• pp.1167-1182
• /
• 2010

We study codes meeting a generalized version of the Singleton bound for higher weights. We show that some of the higher weight enumerators of these codes are uniquely determined. We give the higher weight enumerators for MDS codes, the Simplex codes, the Hamming codes, the first order Reed-Muller codes and their dual codes. For the putative [72, 36, 16] code we find the i-th higher weight enumerators for i = 12 to 36. Additionally, we give a version of the generalized Singleton bound for non-linear codes.

• 한국산업정보학회:학술대회논문집
• /
• 한국산업정보학회 2001년도 춘계학술대회논문집:21세기 신지식정보의 창출
• /
• pp.145-151
• /
• 2001

An extension of interaction matrix formulation to the problem of system and disturbance identification for a plant that is corrupter by both process and output disturbances is presented. With only an assumed upper bound on the order of the system and an assumed upper bound on the number of disturbance frequencies, it is shown that both the disturbance-free model and disturbance effect can be recovered exactly from disturbance-corrupted input-output data without direct measurement of the periodic disturbances. The rich information returned by the identification can be used by a performance-oriented model-based loaming or repetitive control system to eliminate unwanted periodic disturbances.

• 경영과학
• /
• 제10권1호
• /
• pp.207-216
• /
• 1993

The purpose of this paper is to develop a branch and bound algorithm for the transportation problem with a limited number of company owned vehicles. First, we find an initial solution by solving quasi-assignment subproblem induced by relaxing constraints of the vehicle capacity and illegal tours elimination equations. Second, we build routing from the assignment, and if there is a routings which violates relaxed constraints, we introduce branches of the subproblem in order to remove it. After all branches are searched, we get the optimal solution.