• Bulletin of the Korean Mathematical Society
• /
• v.30 no.2
• /
• pp.229-238
• /
• 1993

Let M be an n-dimensional compact Riemannian manifold with boundary .part.M. We consider the Neumann eigenvalue problem on M of the equation (Fig.) where .upsilon. is the unit outward normal vector to the boundary .part.M. due to the importance of Poincare inequality for analysis on manifolds, one wishes to obtain the lower bound of the first non-zero eigenvalue .eta.$_{1}$ of (1.1). For the purpose of applications, it is important to relax the dependency of the lower bound on the geometric quantities. For general compact manifolds with convex boundary, Li-Yau [3] obtained the lower bound of .eta.$_{1}$. Recently, Roger Chen [1] investigated the lower bound of the first Neumann eigenvalue .eta.$_{1}$ on compact manifold M with nonconvex boundary. We investigate the lower bound .eta.$_{1}$ with the same conditions as those of Roger chen. But, using the different auxiliary function, we have the following theorem.

• Honam Mathematical Journal
• /
• v.19 no.1
• /
• pp.97-105
• /
• 1997

Let $R_k({\alpha})$, $0{\leq}{\alpha}<1$, $k{\geq}2$ denote certain subclasses of analytic functions in the unit disc E with bounded radius rotation. A function f, analytic in E and given by $f(z)=z+{\sum_{m=2}^{\infty}}a_m{z^m}$, is said to be in the family $R_k(n,{\alpha})n{\in}N_o=\{0,1,2,{\cdots}\}$ and * denotes the Hadamard product. The classes $R_k(n,{\alpha})$ are investigated and same properties are given. It is shown that $R_k(n+1,{\alpha}){\subset}R_k(n,{\alpha})$ for each n. Some integral operators defined on $R_k(n,{\alpha})$ are also studied.

• Honam Mathematical Journal
• /
• v.42 no.2
• /
• pp.301-318
• /
• 2020

In this paper, we introduce and study the concept of hyperbolic type convexity functions and their some algebraic properties. We obtain Hermite-Hadamard type inequalities for this class of functions. In addition, we obtain some refinements of the Hermite-Hadamard inequality for functions whose first derivative in absolute value, raised to a certain power which is greater than one, respectively at least one, is hyperbolic convexity. Moreover, we compare the results obtained with both Hölder, Hölder-İşcan inequalities and power-mean, improved-power-mean integral inequalities.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.4
• /
• pp.339-345
• /
• 2006

An analysis methodology of Decentralized Dynamic Surface Control (DDSC) for the large-scale interconnected nonlinear systems is presented in this paper. While the centralized DSC approach proposed in [14] has a difficulty to check the quadratic stability for the large-scale systems numerically due to dramatic increases of the order of overall augmented error dynamics, DDSC is relatively easy to check the quadratic stability since lower order error dynamics of individual subsystems are used. Then, a systematic procedure for designing DDSC will be developed. Furthermore, after a quadratic function containing a reachable set is defined, it will be calculated numerically to indicate the performance of DDSC in the framework of convex optimization. Finally an illustrative example will be given for showing the advantages of DDSC compared with other decentralized nonlinear control techniques.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1162-1167
• /
• 2004

This paper presents the design methodology of digital fuzzy controller(DFC) for the systems with time-delay. We propose the fuzzy feedback controller whose output is delayed with unit sampling period and predicted. The analysis and the design problem considering time-delay become easy because the proposed controller is syncronized with the sampling time. The stabilization problem of the digital fuzzy system with time-delay is solved by linear matrix inequality(LMI) theory. Convex optimization techniques are utilized to solve the stable feedback gains and a common Lyapunov function for designed fuzzy control system. To show the effectiveness the proposed control scheme, the network control example is presented.

• Journal of Computational Design and Engineering
• /
• v.1 no.2
• /
• pp.88-95
• /
• 2014

Because the cost of performance testing using actual products is expensive, manufacturers use lower-cost computer-aided design simulations for this function. In this paper, we propose using hexahedral meshes, which are more accurate than tetrahedral meshes, for finite element analysis. We propose automatic hexahedral mesh generation with sharp features to precisely represent the corresponding features of a target shape. Our hexahedral mesh is generated using a voxel-based algorithm. In our previous works, we fit the surface of the voxels to the target surface using Laplacian energy minimization. We used normal vectors in the fitting to preserve sharp features. However, this method could not represent concave sharp features precisely. In this proposal, we improve our previous Laplacian energy minimization by adding a term that depends on multi-normal vectors instead of using normal vectors. Furthermore, we accentuate a convex/concave surface subset to represent concave sharp features.

• Journal of Korean Society of Transportation
• /
• v.16 no.1
• /
• pp.151-164
• /
• 1998

본 논문은 통행배정과 교통신호제어기의 결합문제를 풀기 위한 새로운 해법의 제시를 목적으로 한다. 통행배정과 신호제어 결합모형은 네트웍 디자인 문제(Network Design Problem)로 비선형 비분리 목적함수(Nonlinear and Nonseparable Objective Function)와 비선형제약 및 비컴백스 집합(Nonlinear and Non-Convex Set)형태로 인해 다수의 국지해(Multiple Local Optima)를 갖는 특징이 있다. 따라서 이렇게 복잡하고 난해한 문제를 푸는 해법은 많은 국지해중에 가장 최소한 값(Global Optima)을 찾을수 있는 방법을 제공하여야한다. 전체최적해(Global Optima)를 찾 을 수 있는 기존의 방법들은 확률적최적화방법(Stochastic Optimization Methods)에 속한다. 본연구에서는 이러한 방법중 금속공학에서 발 견된 모의담금빌법(Simulated Annealing Method)에 근거한 해법을 제시한다. 이방법이 통행배정과 신호제어 결합문제에 적용되는지 검토하기 위해 이해법의 수렴성(Convergence)을 증명했으며 또한 실제 프로그램된 모형을 작은 고안된 네트워크에 적 용했다. 마지막으로는 개발된 해법의 실용성을 실험하기 위해 두 가지의 보다 큰 도로망에 적용 및 분석을 했다.

• Journal of the military operations research society of Korea
• /
• v.30 no.1
• /
• pp.70-80
• /
• 2004

In discrete red and black, you can stake any amount s in your possession, but the value of s takes positive integer value. Suppose your goal is N and your current fortune is f, with 0＜f＜N. You win back your stake and as much more with probability p and lose your stake with probability, q = 1-p. In this study, we consider optimum strategies for this game with the value of p greater than $\frac{1}{2}$ where the player has the advantage over the house. The optimum strategy at any f when p>$\frac{1}{2}$ is to play timidly, which is to bet 1 all the time. This is called as Timid1 strategy. In this paper, we perform the simulation study to show that the Timid1 strategy is optimum in discrete red and black when p＞\frac{1}{2}.

• Proceedings of the KIEE Conference
• /
• 2003.11b
• /
• pp.3-6
• /
• 2003

뱀형 로봇은 일반적인 바퀴형 이동로봇과 운동 메카니즘이 상이하며 다관절로 이루어져 있기 때문에 장애물 회피에 있어 빠른 정보의 처리와 이를 위한 특별한 정보가 요구된다. 이를 실현하기 위하여 로봇은 자신의 위치를 지속적으로 파악하면서 장애물의 좌표 값과 일정한 거리의 간격을 두고 움직여야 한다. 주행 궤도 및 장애물 회피를 위한 알고리즘을 검증하기 위하여 가상 뱀형 시뮬레이터를 제작하였다. 시뮬레이터는 이동 주행 궤도를 생성하고, 지나온 궤도를 재현할 수 있는 재현기(Back Tracker), 앞으로 이루어질 뱀형 로봇의 위치와 자세를 알아보는 예견기(Predictor)로 구성된다. 시뮬레이터를 통하여 주위의 장애물을 안전하게 통과할 수 있는 일반적인 알고리즘인 포텐셜함수의 특성을 알아보고, 국소 최소점(Local Minima)에 빠지기 쉬운 단점을 극복하기 위한 방안을 제시한다. 본 논문에서는 뱀의 이동 주행 궤적을 알아보고, 주위의 장애물을 안전하게 통과할 수 있도록 하는 알고리즘에 대한 고찰과 제안한 알고리즘을 소프트웨어적인 3D 시뮬레이션을 통하여 걸과를 분석하고 검증한다.

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.2
• /
• pp.417-430
• /
• 2013

Let X be a Banach space and ${\psi}$ a continuous convex function on ${\Delta}_{K+1}$ satisfying certain conditions. Let $(X{\bigoplus}X{\bigoplus}{\cdots}{\bigoplus}X)_{\psi}$ be the ${\psi}$-direct sum of X. In this paper, we characterize the K strict convexity, K uniform convexity and uniform non-$l^N_1$-ness of Banach spaces using ${\psi}$-direct sums.