• Nonlinear Functional Analysis and Applications
• /
• v.27 no.4
• /
• pp.743-756
• /
• 2022

We obtained results on upper hemi-continuous and pseudo-monotone type two mappings for sets which are not compact. M.S.R. Chowdhury and K.-K. Tan's improved result on Ky Fan's minimax inequality will be used.

• Bulletin of the Korean Mathematical Society
• /
• v.44 no.3
• /
• pp.419-428
• /
• 2007

The space of periodic Boehmians with $\Delta$-convergence is a complete topological algebra which is not locally convex. A family of Boehmians $\{T_\lambda\}$ such that $T_0$ is the identity and $T_{\lambda_1+\lambda_2}=T_\lambda_1*T_\lambda_2$ for all real numbers $\lambda_1$ and $\lambda_2$ is called a one-parameter group of Boehmians. We show that if $\{T_\lambda\}$ is strongly continuous at zero, then $\{T_\lambda\}$ has an exponential representation. We also obtain some results concerning the infinitesimal generator for $\{T_\lambda\}$.

• Journal of the Korean Mathematical Society
• /
• v.42 no.1
• /
• pp.129-134
• /
• 2005

Lpt X be a reduced Stein space and L a holomorphic line bundle on X. L is spanned by its global sections and the associated holomorphic map $h_L\;:\;X{\to}P(H^0(X, L)^{\ast})$ is an embedding. Choose any locally convex vector topology ${\tau}\;on\;H^0(X, L)^{\ast}$ stronger than the weak-topology. Here we prove that $h_L(X)$ is sequentially closed in $P(H^0(X, L)^{\ast})$ and arithmetically Cohen -Macaulay. i.e. for all integers $k{\ge}1$ the restriction map ${\rho}_k\;:\;H^0(P(H^0(X, L)^{\ast}),\;O_{P(H^0(X, L)^{\ast})}(k)){\to}H^0(h_L(X),O_{hL_(X)}(k)){\cong}H^0(X, L^{\otimes{k}})$ is surjective.

• Communications of the Korean Mathematical Society
• /
• v.10 no.3
• /
• pp.759-766
• /
• 1995

In this paper, we give equivalent forms of the selection theorem of Ding-Kim-Tan. As applications of the selection theorem of Ding-Kim-Tan, we obtain a fixed point theroem of Gale and Mas-Colell type and establish an equilibrium existence theorem for a qualitative game under suitable assumptions in a locally convex Hausdorff topological vector space.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.3
• /
• pp.925-933
• /
• 2015

It is well-known that the area of parabolic region between a parabola and any chord $P_1P_2$ on the parabola is four thirds of the area of triangle ${\Delta}P_1P_2P$. Here we denote by P the point on the parabola where the tangent is parallel to the chord $P_1P_2$. In the previous works, the first and third authors of the present paper proved that this property is a characteristic one of parabolas. In this paper, with respect to triangles ${\Delta}P_1P_2PQ$ where Q is the intersection point of two tangents to X at $P_1$ and $P_2$ we establish some characterization theorems for parabolas.

• Journal of applied mathematics & informatics
• /
• v.20 no.1_2
• /
• pp.209-224
• /
• 2006

This paper presents an optimization model with performance constraints for two kinds of graph elements layout problem. The layout problem is partitioned into finite subproblems by using graph theory and group theory, such that each subproblem overcomes its on-off nature about optimal variable. Furthermore each subproblem is relaxed and the continuity about optimal variable doesn't change. We construct a min-max problem which is locally equivalent to the relaxed subproblem and develop the first order necessary and sufficient conditions for the relaxed subproblem by virtue of the min-max problem and the theories of convex analysis and nonsmooth optimization. The global optimal solution can be obtained through the first order optimality conditions.

• Journal of Advanced Marine Engineering and Technology
• /
• v.31 no.1
• /
• pp.58-66
• /
• 2007

Genetic Algorithms (GA) have some difficulties in practical applications because of too many function evaluations. To overcome these limitations, an approximated modeling method such as Response Surface Modeling(RSM) is coupled to GAs. Original RSM method predicts linear or convex problems well but it is not good for highly nonlinear problems cause of the average effect of the least square method(LSM). So the locally approximated methods. so called as moving least squares method(MLSM) have been used to reduce the error of LSM. In this study, the efficient evolutionary GAs tightly coupled with RSM with MLSM are constructed and then a 2-dimensional inviscid airfoil shape optimization is performed to show its efficiency.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10b
• /
• pp.1043-1048
• /
• 1990

The degenerate case of multivariable hyperbolic distributed-parameter systems (systems of hyperbolic partial differential equations) in time coordinate t and space coordinate x is characterized by a property that all the characteristic curves of the state equations are parallel to the coordinate axes of independent variables. It is a disturbing fact, although not well known, that the so-called maximum principle as applied to these systems does not exist for the control that depend on time alone. In this paper, however, it is shown that a set of necessary conditions in the small can exist for unconstrained as well as magnitude constrained controls in a locally convex set. The necessary conditions thus derived can be used conveniently to find the optimal control for degenerate hyperbolic distributed-parameter control systems.

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.1
• /
• pp.169-178
• /
• 2019

Let $M^{2n+1}$, $n{\geq}1$, be a smooth manifold with a pseudoconvex integrable CR structure of hypersurface type. We consider a sequence of CR invariant subsets $M={\mathcal{S}}_0{\supset}{\mathcal{S}}_1{\supset}{\cdots}{\supset}{\mathcal{S}}_n$, where $S_q$ is the set of points where the Levi-form has nullity ${\geq}q$. We prove that ${\mathcal{S}}{_q}^{\prime}s$ are locally given as common zero sets of the coefficients $A_j$, $j=0,1,{\ldots},q-1$, of the characteristic polynomial of the Levi-form. Some sufficient conditions for local existence of complex submanifolds are presented in terms of the coefficients $A_j$.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.7
• /
• pp.23-31
• /
• 2012

Resource allocation, such as joint rate control and scheduling, is an important issue in cognitive radio networks. However, it is difficult to jointly consider the rate control and scheduling problem due to the stochastic behavior of channel availability in cognitive radio networks. In this paper, we propose an asymmetric joint rate control and scheduling technique under reliability constraints in cognitive radio networks. The joint rate control and scheduling problem is formulated as a convex optimization problem and substantially decomposed into several sub-problems using a dual decomposition method. An algorithm for secondary users to locally update their rate that maximizes the utility of the overall system is also proposed. The results of simulations revealed that the proposed algorithm converges to a globally optimal solution.