• Journal of applied mathematics & informatics
• /
• 제19권1_2호
• /
• pp.93-104
• /
• 2005

The present article discusses the number of empty convex 4-gons and empty convex 5-gons in a finite planar point set. New proofs are provided for the two related important results.

• Journal of Electrical Engineering and Technology
• /
• 제12권1호
• /
• pp.72-77
• /
• 2017

This paper proposes the explicit tuning rule of multi-loop PID controller for brushless direct current motors to predict the system behaviors in time and frequency domains, using properties of the convex combination method. The convex set of the proposed controllers formulates the envelope to satisfy the performances in time and frequency domains. The final control parameters are determined by solving the convex optimization problem subject to the constraints which are represented as convex set of time domain performances. The effectiveness of the proposed control method is shown in the numerical simulation, in which controller tuning algorithm and dynamics of brushless DC motor are well taken into account.

• 충청수학회지
• /
• 제23권3호
• /
• pp.481-486
• /
• 2010

In this paper, we introduce the concepts of strongly c-convex( strongly c-concave) function, almost c-convex function on preconvex spaces. We investigate the relationships between such concepts and several types of preconvex sets.

• 대한수학회보
• /
• 제54권6호
• /
• pp.2053-2063
• /
• 2017

In this paper we prove a condition under which a hyperbolic starshaped set has a center of hyperbolic symmetry. We also give the definition of isometric diameters for a hyperbolic convex set, which behave similar to affine diameters for Euclidean convex sets. Using this concept, we give a definition of constant hyperbolic width and we prove that the only hyperbolic sets with constant hyperbolic width and with a hyperbolic center of symmetry are hyperbolic discs.

• 한국군사과학기술학회지
• /
• 제14권2호
• /
• pp.313-320
• /
• 2011

SPH(Smoothed Particle Hydrodynamics) is a gridless Lagrangian technique that is useful as an alternative numerical analysis method used to analyze high deformation problems as well as astrophysical and cosmological problems. In SPH, all points within the support of the kernel are taken as neighbours. The accuracy of the SHP is highly influenced by the method for choosing neighbours from all particle points considered. Typically a linked-list method or tree search method has been used as an effective tool because of its conceptual simplicity, but these methods have some liability in anisotropy situations. In this study, convex hull algorithm is presented as an improved method to eliminate this artifact. A convex hull is the smallest convex set that contains a certain set of points or a polygon. The selected candidate neighbours set are mapped into the new space by an inverse square mapping, and extract a convex hull. The neighbours are selected from the shell of the convex hull. These algorithms are proved by Fortran programs. The programs are expected to use as a searching algorithm in the future SPH program.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2012년도 추계학술발표대회
• /
• pp.330-332
• /
• 2012

본 논문에서는 임의의 정렬되지 않은 평면 점집합(Plane Point Set)에서 정렬을 고려한 개선된 Convex Hull 알고리즘을 제안한다. 이 알고리즘은 Convex Hull의 극점(Extreme Point) 특성을 이용하여 처리 데이터를 한정하기 때문에 계산복잡도를 낮춘다. 각 단계마다 볼록 정점(Convex Vertex)만을 판별하는 조건을 이용하여 한 번의 스캔으로 온전한 Convex Set이 구한다. 알고리즘 초기에 점집합의 정렬이 필요한데, 이때 걸리는 시간이 알고리즘 전체 동작시간의 대부분을 차지하는 만큼, 특성에 맞는 방법을 사용하여 빠르게 정렬하였다. 일반적인 상황을 가정하고 점집합을 랜덤하게 구성하여 실험하였으며 기존의 알고리즘에 비해 약 두 배의 속도 향상이 있음을 확인하였다.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1993년도 추계학술대회발표논문집; 서강대학교, 서울; 25 Sep. 1993
• /
• pp.127-127
• /
• 1993

Separating Hyperplane의 기하학적인 성질을 이용하여, 일반적인 Closed Convex Set들의 교집합에 속하는 점을 찾아가는 방법을 제안하고, 교집합에 속하는 점을 찾아가는 과정에서 그 교집합의 공집합 여부를 판정할 수 있는 방법을 제안하였다. 이 기법은 기존의 방법들이 가정하는 수렴조건보다 더 일반적인 조건 하에서도 수렴성을 갖는 것을 증명할 수 있었으며, 그 교집합의 공집합 여부를 선형부동식 해의 존재 유무로 판정할 수 있는 방법을 제시하였다. 몇가지 특수한 경우의 Convex Set들의 경우에 대한 기법의 적용 결과도 알아 보기로 한다.

• Journal of applied mathematics & informatics
• /
• 제15권1_2호
• /
• pp.277-284
• /
• 2004

An m-transversal to a family of convex sets in the plane is an m-point set which intersects every members of the family. One of Grubaum's conjectures says that a planar family of translates of a convex compact set has a 3-transversal provided that any two of its members intersect. Recently the conjecture has been proved affirmatively (see [4]). In the present paper we provide a different and straightforward proof for the conjecture for the family of translates of a closed trapezoid in the plane and give several concrete 3-transversals.

• Journal of applied mathematics & informatics
• /
• 제13권1_2호
• /
• pp.139-152
• /
• 2003

In this paper, we characterize a vector-valued convex set function by its epigraph. The concepts of a vector-valued set function and a vector-valued concave set function we given respectively. The definitions of the conjugate functions for a vector-valued convex set function and a vector-valued concave set function are introduced. Then a Fenchel duality theorem in multiobjective programming problem with set functions is derived.

• Nonlinear Functional Analysis and Applications
• /
• 제26권5호
• /
• pp.1077-1089
• /
• 2021

In this article, we introduce the quasi strongly E-convex function and pseudo strongly E-convex function on strongly E-convex set which generalizes strongly E-convex function defined by Youness [10]. Some non trivial examples have been constructed that show the existence of these functions. Several interesting properties of these functions have been discussed. An important characterization and relationship of these functions have been established. Furthermore, a nonlinear programming problem for quasi strongly E-convex function has been discussed.