• Communications of the Korean Mathematical Society
• /
• v.35 no.1
• /
• pp.161-184
• /
• 2020

In this article, we establish some new weighted Hardy-type inequalities involving some variants of extended Riemann-Liouville fractional derivative operators, using convex and increasing functions. As special cases of the main results, we obtain the results of [18,19]. We also prove the boundedness of the k-fractional integral operator on L_p[a, b].

• Journal of the Korean Operations Research and Management Science Society
• /
• v.16 no.2
• /
• pp.118-127
• /
• 1991

In this paper, criteria and algorithms for the optimal service rate in a closed queueing network have been established. The objective is to minimize total cost. It is shown that system throughput is increasing concave over the service rate of a node and cycle time is increasing convex over the set of service times with a single calss of cubsomers. This enables developing an algorithm using a steepest descent method when the cost function for service rate is convex. The efficiency of the algorithm rests on the fact that the steepest descent direction is readily obtained at each iteration from the MVA algorithm. Several numerical examples are presented. The major application of this research is optimization of facility capacity in a manufacturing system.

• Bulletin of the Korean Mathematical Society
• /
• v.43 no.3
• /
• pp.589-598
• /
• 2006

In the present investigation, sharp upper bounds of $|a3-{\mu}a^2_2|$ for functions $f(z)=z+a_2z^2+a_3z^3+...$ belonging to certain subclasses of starlike and convex functions with respect to symmetric points are obtained. Also certain applications of the main results for subclasses of functions defined by convolution with a normalized analytic function are given. In particular, Fekete-Szego inequalities for certain classes of functions defined through fractional derivatives are obtained.

• Journal of Multimedia Information System
• /
• v.1 no.1
• /
• pp.87-93
• /
• 2014

The aim of microscopic image restoration is to recover the image by applying the inverse process of degradation, and the results facilitate automated and improved analysis of the image. In this work, we consider the problem of image restoration as a minimization problem of convex cost function, which consists of a least-squares fitting term and regularization terms with non-negative constraints. The finite step method is proposed to solve this constrained convex optimization problem. We demonstrate the convergence of this method. Efficiency and restoration capability of the proposed method were tested and illustrated through numerical experiments.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.988-991
• /
• 1996

The purpose of this thesis is to develop methods of designing robust LQR/LQG controllers for time-varying systems with real parametric uncertainties. Controller design that meet desired performance and robust specifications is one of the most important unsolved problems in control engineering. We propose a new framework to solve these problems using Linear Matrix Inequalities (LMls) which have gained much attention in recent years, for their computational tractability and usefulness in control engineering. In Robust LQR case, the formulation of LMI based problem is straightforward and we can say that the obtained solution is the global optimum because the transformed problem is convex. In Robust LQG case, the formulation is difficult because the objective function and constraint are all nonlinear, therefore these are not treatable directly by LMI. We propose a sequential solving method which consist of a block-diagonal approach and a full-block approach. Block-diagonal approach gives a conservative solution and it is used as a initial guess for a full-block approach. In full-block approach two LMIs are solved sequentially in iterative manner. Because this algorithm must be solved iteratively, the obtained solution may not be globally optimal.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.7
• /
• pp.82-91
• /
• 1997

In this paper, we analyze the dynamics of langevine competitive learning neural network based on its fokker-plank equation. From the viewpont of the stochastic differential equation (SDE), langevine competitive learning equation is one of langevine stochastic differential equation and has the diffusin equation on the topological space (.ohm., F, P) with probability measure. We derive the fokker-plank equation from the proposed algorithm and prove by introducing a infinitestimal operator for markov semigroups, that the weight vector in the particular simplex can converge to the globally optimal point under the condition of some convex or pseudo-convex performance measure function. Experimental resutls for pattern recognition of the remote sensing data indicate the superiority of langevine competitive learning neural network in comparison to the conventional competitive learning neural network.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.628-631
• /
• 2005

In this paper, we propose tuning method of PID-PD controller to satisfy design specifications in frequency domain as well as time domain. The proposed tuning method of PID-PD controller that consist of the convex set of PID and PI-PD controller controls the closed-loop response to locate between the step responses, and Bode magnitudes of closed-loop transfer functions controlled by PID and PI-PD controller. The controller is designed by the optimum tuning method to minimize the proposed specific cost function subject to sensor noise insensitivity and robust stability. Its effectiveness is examined by the case study and analysis.

• Journal of applied mathematics & informatics
• /
• v.26 no.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.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.37 no.3
• /
• pp.114-122
• /
• 2000

This paper proposes a classification method using an amorphous Prototype to minimize classification error caused by such fixed-Prototype-based methods as Fuzzy C-Means, Nearest Neighborring Classification, FMMCNN, and Fuzzy-ART. For this method, a new fuzzy neural network is introduced, in which a convex polytope is generated or adaptively reshaped to classify the given datum into a proper group. Thus, this method contains a function to classify sequential data set. To show the validity of this method, various numerical experiments including comparison results with FMMCNN are presented

• Bulletin of the Korean Mathematical Society
• /
• v.29 no.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.