• Journal of applied mathematics & informatics
• /
• v.14 no.1_2
• /
• pp.185-191
• /
• 2004

Given a connected graph G, we say that a set EC\;{\subseteq}\;V(G)$ is convex in G if, for every pair of vertices x, $y\;{\in}\;C$, the vertex set of every x - y geodesic in G is contained in C. The convexity number of G is the cardinality of a maximal proper convex set in G. In this paper, we show that every pair k, n of integers with $2\;{\leq}k\;{\leq}\;n\;-\;1$ is realizable as the convexity number and order, respectively, of some connected triangle-free graph, and give a lower bound for the convexity number of k-regular graphs of order n with n > k+1.

• Kyungpook Mathematical Journal
• /
• v.50 no.3
• /
• pp.371-378
• /
• 2010

In this paper, we establish new inequalities of Ostrowski's type for functions whose derivatives in absolute value are (${\alpha}$, m)-convex.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.2 s.308
• /
• pp.81-92
• /
• 2006

This paper proposes a robustness watermarking for 3D mesh model based on projection onto convex sets (POCS). After designing the convex sets for robustness and invisibility among some requirements for watermarking system, a 3D-mesh model is projected alternatively onto two constraints convex sets until the convergence condition is satisfied. The robustness convex set are designed for embedding the watermark into the distance distribution of the vertices to robust against the attacks, such as mesh simplification, cropping, rotation, translation, scaling, and vertex randomization. The invisibility convex set are designed for the embedded watermark to be invisible. The decision values and index that the watermark was embedded with are used to extract the watermark without the original model. Experimental results verify that the watermarked mesh model has invisibility and robustness against the attacks, such as translation, scaling, mesh simplification, cropping, and vertex randomization.

• Communications of the Korean Mathematical Society
• /
• v.32 no.1
• /
• pp.165-173
• /
• 2017

In this paper, we prove that the automorphism group of a quasi-homogeneous properly convex affine domain in ${\mathbb{R}_n}$ acts transitively on the set of all the extreme points of the domain. This set is equal to the set of all the asymptotic cone points coming from the asymptotic foliation of the domain and thus it is a homogeneous submanifold of ${\mathbb{R}_n}$.

• Honam Mathematical Journal
• /
• v.20 no.1
• /
• pp.135-145
• /
• 1998

In this paper, we focus on the convex-valued selection theorem out of four main selection theorems; zero-dimensional, convex-valued, compact-valued, finite-dimensional theorems based on Michael's papers. We prove some theorems about lower semi-continuous set-valued mappings, and derive some applications to closed continuous set-valued mappings and to functional analysis. We also give a partial solution to the open problem posed by Engelking, Heath, and Michael.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.3
• /
• pp.369-374
• /
• 2004

A cluster merging algorithm that merges convex clusters resulted by the Fuzzy Convex Clustering(FCC) method into non-convex clusters was proposed. This was achieved by proposing a fast and reliable distance measure between two convex clusters using Support Vector Machines(SVM) to improve accuracy and speed over other existing conventional methods. In doing so, it was possible to reduce cluster number without losing its representation of the data. In this paper, results for several data sets are given to show the validity of our distance measure and algorithm.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.11a
• /
• pp.476-479
• /
• 2000

This paper deals with a robust pole placement method for uncertain linear systems. For all admissible uncertain parameters, a static output feedback controller is designed such that all the poles of the closed loop system are located within the prespecfied disk. It is shown that the existence of a positive definite matrix belonging to a convex set such that its inverse belongs to another convex set guarantees the existence of the output feedback gain matrix for our control problem. By a sequence of convex optimization the aforementioned matrix is obtained. A numerical example is solved in order to illustrate efficacy of our design method.

• Journal of Korea Multimedia Society
• /
• v.8 no.12
• /
• pp.1572-1580
• /
• 2005

The common requirements for watermarking are usually invisibility, robustness, and capacity. We proposed the watermarking for 3D mesh model based on projection onto convex sets for invisibility and robustness among requirements. As such, a 3D mesh model is projected alternatively onto two convex sets until it converge a point. The robustness convex set is designed to be able to embed watermark into the distance distribution of vertices. The invisibility convex set is designed for the watermark to be invisible based on the limit range of vertex movement. The watermark can be extracted using the decision values and index that the watermark was embedded with. Experimental results verify that the watermarked mesh model has both robustness against mesh simplification, cropping, affine transformations, and vertex randomization and invisibility.

• Honam Mathematical Journal
• /
• v.40 no.3
• /
• pp.509-519
• /
• 2018

In this paper, we introduce a new class of reciprocal convex set which is called as relative reciprocal convex set. We establish a necessary and sufficient condition for the minimum of the differentiable relative reciprocal convex function. This condition can be viewed as a new class of variational inequality which is called relative reciprocal variational inequality. Using the auxiliary principle technique we discuss the existence criteria for the solution of relative reciprocal variational inequality. Some special cases which are naturally included in our main results are also discussed.

• Journal of Korea Society of Industrial Information Systems
• /
• v.7 no.1
• /
• pp.58-65
• /
• 2002

When we estimate the optimal solution satisfy the objective function and subjective equation in the integer programming, The optimal solution of the objective function Z is decided by the positive integer at extreme point or revised extreme point in the convex set. The convex set is made up the linear subjective equation. The purpose of the paper is thus to establish a stepwise optimization in the integer programming model by estimating the variation △C/sub j/ of the constant term C/sub j/ in the linear objective function, after an application of the modified Branch & Bound method.