• Journal of applied mathematics & informatics
• /
• 제26권5_6호
• /
• pp.961-972
• /
• 2008

In this paper, we consider the global exponential stability of cellular neural networks with time-varying delays. Based on the Lyapunov function method and convex optimization approach, a novel delay-dependent criterion of the system is derived in terms of LMI (linear matrix inequality). In order to solve effectively the LMI convex optimization problem, the interior point algorithm is utilized in this work. Two numerical examples are given to show the effectiveness of our results.

• 대한전자공학회논문지TE
• /
• 제37권3호
• /
• pp.114-122
• /
• 2000

본 논문에서는 기존의 Fuzzy C-Means, Nearest Neighborring Classification, FMMCNN, Fuzzy -ART등에서 사용하였던 정형에 근거한 분류에서 유기될 수 있던 판단 오류를 최소화하기 위해 단 한가지의 형태적 특징을 갖고 있는 정형에 의존하지 않고 분류를 수행하는 방법을 제안하고i파 한다. 이를 위해 본 논문에서는 주어진 학습 데이터로 학습하는 과정에서 볼록 다면체를 적응적으로 생성하고 다면체의 구조를 수정하는 퍼지 신경회로망을 설계하였다. 따라서, 본 방법은 순차적으로 입력되는 데이터를 분류하여 패턴 유형들을 생성하는 기능을 갖게된다. 본 방법의 유용성을 증명하기 위해, Hyperbox를 정형으로 하는 FMMCNN과의 다양한 시뮬레이션 비교를 수행하였다.

• 대한수학회보
• /
• 제29권2호
• /
• pp.227-232
• /
• 1992

In this paper we prove that if (.ohm., .SIGMA., .mu.) is a non-purely atomic measure space and X is strictly convex, then X has the asymptotic-norming property II if and only if $L_{p}$ (X, .mu.), 1 < p < .inf., has the asymptotic-norming property II. And we prove that if $X^{*}$ is an Asplund space and strictly convex, then for any p, 1 < p < .inf., $X^{*}$ has the .omega.$^{*}$-ANP-II if and only if $L_{p}$ ( $X^{*}$, .mu.) has the .omega.$^{*}$-ANP-II.*/-ANP-II.

• 대한수학회보
• /
• 제52권6호
• /
• pp.1925-1935
• /
• 2015

In this paper, we study right half-plane harmonic mappings $f_0$ and f, where $f_0$ is fIxed and f is such that its dilatation of a conformal automorphism of the unit disk. We obtain a sufficient condition for the convolution of such mappings to be convex in the direction of the real axis. The result of the paper is a generalization of the result of by Li and Ponnusamy [11], which itself originates from a problem posed by Dorff et al. in [7].

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권10호
• /
• pp.4025-4041
• /
• 2020

Mobile edge computing (MEC) is capable of providing services to smart devices nearby through radio access networks and thus improving service experience of users. In this paper, an offloading strategy for the joint optimization of computing and communication resources in multi-user and multi-MEC overlapping scene was proposed. In addition, under the condition that wireless transmission resources and MEC computing resources were limited and task completion delay was within the maximum tolerance time, the optimization problem of minimizing energy consumption of all users was created, which was then further divided into two subproblems, i.e. offloading strategy and resource allocation. These two subproblems were then solved by the game theory and Lagrangian function to obtain the optimal task offloading strategy and resource allocation plan, and the Nash equilibrium of user offloading strategy games and convex optimization of resource allocation were proved. The simulation results showed that the proposed algorithm could effectively reduce the energy consumption of users.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2004년도 추계학술대회 및 정기총회
• /
• pp.250-278
• /
• 2004

The product rate variation problem, to be called the PRVP, is to sequence different type units that minimizes the maximum value of a deviation function between ideal and actual rates. The PRVP is an important scheduling problem that arises on mixed-model assembly lines. A surge of research has examined very interesting methods for the PRVP. We believe, however, that several issues are still open with respect to this problem. In this study, we consider convex bipartite graphs, perfect matchings, permanents and balanced sequences. The ultimate objective of this study is to show that we can provide a more efficient and in-depth procedure with a graph theoretic approach in order to solve the PRVP. To achieve this goal, we propose formal alternative proofs for some of the results stated in the previous studies, and establish several new results.

• ETRI Journal
• /
• 제24권3호
• /
• pp.239-246
• /
• 2002

We investigate an alternative blind adaptive multiuser detection scheme based on a non-canonical linearly constrained constant modulus (LCCM) criterion and prove that, under the constrained condition, the non-canonical linearly constrained constant modulus algorithm (LCCMA) can completely remove multiple -access interference. We further demonstrate that the non-canonical LCCM criterion function is strictly convex in the noise-free state, and that under the constrained condition, it is also strictly convex even where small noise is present. We present a simple method for selecting the constant as well as a stochastic gradient algorithm for implementing our scheme. Numerical simulation results verify the scheme's efficiency.

• 제어로봇시스템학회지
• /
• 제10권3호
• /
• pp.27-33
• /
• 2004

최적화는 시스템공학에서 자주 등장하는 문제이며 흔히 다음과 같은 수학적 계획(mathematical programming) 문제로 표현된다. min f(x) (P) subject to g(x) ≤ 0 h(x) ： 0 여기서 x∈R/sup n/, f：R/sup n/→R, g：R/sup n/→R/sup l/, h：R/sup n/→R/sup m/, 그리고 n m이다. 만약 목적함수(objective function)와 가능 영역(feasible region)이 볼록(convex)하다면, 예를 틀어 f(x)와 g(x)가 아래로 볼록하고 h(x)가 선형이라면. 이는 볼록 문제(convex problem)이며 오직 하나의 지역 최소점(local minimum)을 가진다. 그러나 많은 경우. 예를 들어 h(x)가 비선형이라면, 여러 개의 지역 최소점을 가질 수 있는 비 볼록 문제(nonconvex problem)가 된다. 이때 진정한 최소점을 찾는 것. 즉 전역 최적화 (global optimization)가 요구된다.(중략)

• 충청수학회지
• /
• 제1권1호
• /
• pp.71-76
• /
• 1988

For each continuous convex function ${\phi}$ defined on an open convex subset $A_{\phi}$ of a Banach space X, if we define a positively homogeneous sublinear functional ${\sigma}_x$ on X by ${\sigma}_x(y)=\sup{\lbrace}f(y)\;:\;f{\in}{\partial}{\phi}(x){\rbrace}$, where ${\partial}{\phi}(x)$ is a subdifferential of ${\phi}$ at x, then we get the following characterization theorem of Gateaux differentiability (weak Asplund) sapce. THEOREM. For every ${\phi}$ above, $D_{\phi}={\lbrace}x{\in}A\;:\;\sup_{||u||=1}\;{\sigma}_x(u)+{\sigma}_x(-u)=0{\rbrace}$ contains dense (dense $G_{\delta}$) subset of $A_{\phi}$ if and only if X is a Gateaux differentiability (weak Asplund) space.

• 제어로봇시스템학회논문지
• /
• 제11권4호
• /
• pp.279-283
• /
• 2005

This paper deals with the design of a low-order H/sub ∞/ controller by using an iterative linear matrix inequality (LMI) method. The low-order H/sub ∞/ controller is represented in terms of LMIs with a rank condition. To solve the non-convex rank-constrained LMI problem, the recently developed penalty function method is applied. With an increasing sequence of the penalty parameter, the solution of the penalized optimization problem moves towards the feasible region of the original non-convex problem. Numerical experiments showed the effectiveness of the proposed algorithm.