• Title/Summary/Keyword: VECTOR

Search Result 14,366, Processing Time 0.037 seconds

FENCHEL DUALITY THEOREM IN MULTIOBJECTIVE PROGRAMMING PROBLEMS WITH SET FUNCTIONS

  • Liu, Sanming;Feng, Enmin
    • Journal of applied mathematics & informatics
    • /
    • v.13 no.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.

On the Property of Harmonic Vector Field on the Sphere S2n+1

  • Han, Dongsoong
    • Honam Mathematical Journal
    • /
    • v.25 no.1
    • /
    • pp.163-172
    • /
    • 2003
  • In this paper we study the property of harmonic vector fields. We call a vector fields ${\xi}$ harmonic if it is a harmonic map from the manifold into its tangent bundle with the Sasaki metric. We show that the characteristic polynomial of operator $A={\nabla}{\xi}\;in\;S^{2n+1}\;is\;(x^2+1)^n$.

  • PDF

WHEN CAN SUPPORT VECTOR MACHINE ACHIEVE FAST RATES OF CONVERGENCE?

  • Park, Chang-Yi
    • Journal of the Korean Statistical Society
    • /
    • v.36 no.3
    • /
    • pp.367-372
    • /
    • 2007
  • Classification as a tool to extract information from data plays an important role in science and engineering. Among various classification methodologies, support vector machine has recently seen significant developments. The central problem this paper addresses is the accuracy of support vector machine. In particular, we are interested in the situations where fast rates of convergence to the Bayes risk can be achieved by support vector machine. Through learning examples, we illustrate that support vector machine may yield fast rates if the space spanned by an adopted kernel is sufficiently large.

Efficient Motion Refinement Algorithm based on ASW for Reduced Frame-Rate Video Transcoder (시간해상도 감소 트랜스코딩을 위한 ASW움직임벡터 정밀화 알고리즘에 관한 연구)

  • 서동완;권혁민;최윤식
    • Proceedings of the IEEK Conference
    • /
    • 2003.07e
    • /
    • pp.2044-2047
    • /
    • 2003
  • In this paper, we propose efficient motion vector refinement algorithm for frame-rate reduction transcoding. The proposed algorithm is to set the search range for motion refinement based on the incoming motion vector. The algorithm calculates the importance of motion vector of the skipped frame and then selects two motion vector to set search range. Through this process, we determine the accuracy of incoming motion vector and set the search range lot refinement adaptively by means of the accuracy. In experiments, we show efficiency of our algorithm to reduce the search points for refinement.

  • PDF

CRITICALITY OF CHARACTERISTIC VECTOR FIELDS ON ALMOST COSYMPLECTIC MANIFOLDS

  • Pak, Hong-Kyun;Kim, Tae-Wan
    • Journal of the Korean Mathematical Society
    • /
    • v.44 no.3
    • /
    • pp.605-613
    • /
    • 2007
  • Main interest of the present paper is to investigate the criticality of characteristic vector fields on almost cosymplectic manifolds. Killing critical characteristic vector fields are absolute minima. This paper contains some examples of non-Killing critical characteristic vector fields.

SECOND CHERN NUMBERS OF VECTOR BUNDLES AND HIGHER ADELES

  • Osipov, Denis V.
    • Bulletin of the Korean Mathematical Society
    • /
    • v.54 no.5
    • /
    • pp.1699-1718
    • /
    • 2017
  • We give a construction of the second Chern number of a vector bundle over a smooth projective surface by means of adelic transition matrices for the vector bundle. The construction does not use an algebraic K-theory and depends on the canonical ${\mathbb{Z}}-torsor$ of a locally linearly compact k-vector space. Analogs of certain auxiliary results for the case of an arithmetic surface are also discussed.

ON SECOND ORDER NECESSARY OPTIMALITY CONDITIONS FOR VECTOR OPTIMIZATION PROBLEMS

  • Lee, Gue-Myung;Kim, Moon-Hee
    • Journal of the Korean Mathematical Society
    • /
    • v.40 no.2
    • /
    • pp.287-305
    • /
    • 2003
  • Second order necessary optimality condition for properly efficient solutions of a twice differentiable vector optimization problem is given. We obtain a nonsmooth version of the second order necessary optimality condition for properly efficient solutions of a nondifferentiable vector optimization problem. Furthermore, we prove a second order necessary optimality condition for weakly efficient solutions of a nondifferentiable vector optimization problem.

UNIFORMITY OF HOLOMORPHIC VECTOR BUNDLES ON INFINITE-DIMENSIONAL FLAG MANIFOLDS

  • Ballico, E.
    • Bulletin of the Korean Mathematical Society
    • /
    • v.40 no.1
    • /
    • pp.85-89
    • /
    • 2003
  • Let V be a localizing infinite-dimensional complex Banach space. Let X be a flag manifold of finite flags either of finite codimensional closed linear subspaces of V or of finite dimensional linear subspaces of V. Let E be a holomorphic vector bundle on X with finite rank. Here we prove that E is uniform, i.e. that for any two lines $D_1$ R in the same system of lines on X the vector bundles E$\mid$D and E$\mid$R have the same splitting type.

EINSTEIN SPACES AND CONFORMAL VECTOR FIELDS

  • KIM DONG-SOO;KIM YOUNG HO;PARK SEONG-HEE
    • Journal of the Korean Mathematical Society
    • /
    • v.43 no.1
    • /
    • pp.133-145
    • /
    • 2006
  • We study Riemannian or pseudo-Riemannian manifolds which admit a closed conformal vector field. Subject to the condition that at each point $p{\in}M^n$ the set of conformal gradient vector fields spans a non-degenerate subspace of TpM, using a warped product structure theorem we give a complete description of the space of conformal vector fields on arbitrary non-Ricci flat Einstein spaces.