• 제목/요약/키워드: minimizing

Search Result 5,291, Processing Time 0.03 seconds

SCALED VISUAL CURVATURE AND VISUAL FRENET FRAME FOR SPACE CURVES

  • Jeon, Myungjin
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.34 no.1
    • /
    • pp.37-53
    • /
    • 2021
  • In this paper we define scaled visual curvature and visual Frenet frame that can be visually accepted for discrete space curves. Scaled visual curvature is relatively simple compared to multi-scale visual curvature and easy to control the influence of noise. We adopt scaled minimizing directions of height functions on each neighborhood. Minimizing direction at a point of a curve is a direction that makes the point a local minimum. Minimizing direction can be given by a small noise around the point. To reduce this kind of influence of noise we exmine the direction whether it makes the point minimum in a neighborhood of some size. If this happens we call the direction scaled minimizing direction of C at p ∈ C in a neighborhood Br(p). Normal vector of a space curve is a second derivative of the curve but we characterize the normal vector of a curve by an integration of minimizing directions. Since integration is more robust to noise, we can find more robust definition of discrete normal vector, visual normal vector. On the other hand, the set of minimizing directions span the normal plane in the case of smooth curve. So we can find the tangent vector from minimizing directions. This lead to the definition of visual tangent vector which is orthogonal to the visual normal vector. By the cross product of visual tangent vector and visual normal vector, we can define visual binormal vector and form a Frenet frame. We examine these concepts to some discrete curve with noise and can see that the scaled visual curvature and visual Frenet frame approximate the original geometric invariants.

RISK-MINIMIZING HEDGING FOR A SPECIAL CONTINGENTS

  • YANG, JIANQI;JIANG, QIUYAN
    • Journal of Applied and Pure Mathematics
    • /
    • v.4 no.5_6
    • /
    • pp.287-297
    • /
    • 2022
  • In this paper, we consider a risk-minimization hedging problem for a special European contingent claims. The existence and uniqueness of strategy are given constructively. Firstly, a non-standard European contingent is demonstrated as stochastic payment streams. Then the existence of the risk minimization strategy and also the uniqueness are proved under two kinds market information by using Galtchouk-Kunita-Watanabe decomposition and constructing a 0-achieving strategy risk-minimizing strategies in full information. And further, we have proven risk-minimizing strategies exists and is unique under restrict information by constructing a weakly mean-selffinancing strategy.

A NOTE ON ENERGY MINIMIZING MAP ON MANIFOLD WITH ISOLATED PEAKS

  • SHIN, HEAYONG
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.6 no.1
    • /
    • pp.59-65
    • /
    • 2002
  • In this paper, we consider some homogeneous maps from a cone over 2-spheres and determines whether they become energy minimizing maps or not. In fact, any homogeneous map from a standard cone over 2-sphere of radius smaller than 1 can not be a minimizing harmonic map.

  • PDF

A Lookup Table Based Loss Minimizing Control for FCEV Permanent Magnet Synchronous Motors

  • Lee, Jung-Gi;Nam, Kwang-Hee;Lee, Sun-Ho;Choi, Soe-Ho;Kwon, Soon-Woo
    • Journal of Electrical Engineering and Technology
    • /
    • v.4 no.2
    • /
    • pp.201-210
    • /
    • 2009
  • A loss minimizing controller is developed for a fuel cell electric vehicle (FCEV) permanent magnet synchronous motor (PMSM). The PMSM losses are modeled by some experimental equations. Applying Lagrangian to the loss function, a necessary condition for the optimality appears to be a fourth order polynomial, and the loss minimizing solutions are obtained by a simple numerical approach. On the other hand, the loss minimizing solutions are found by scanning the motor loss in the entire operating region. The two results agree well. The loss minimizing current sets for given torque and speed are made into a table, which is utilized as a look-up in the current control loop.

수송비와 핵심로 수송량의 복합수송문제

  • Choe Chang-Heup;Park Sun-Dal
    • Journal of the military operations research society of Korea
    • /
    • v.10 no.2
    • /
    • pp.43-49
    • /
    • 1984
  • This paper deals with a transportation problem with two objectives, that is, transportation cost and vital-route shipment. In the transportation problem minimizing cost is sometimes conflicting minimizing vital-route shipment. This paper develops an algorithm finding paneto-optimal solutions in minimizing vital-route shipment and cost, and also presents theoretical backgrounds for developing an algorithm.

  • PDF

A Hueristic Algorithm for Nonidentical Parallel Machines Scheduling (동일하지 않는 병렬기계 일정계획을 위한 휴리스틱 방법)

  • 전태웅;박해천
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.23 no.59
    • /
    • pp.37-42
    • /
    • 2000
  • The parallel machines scheduling problems is one of the combinatorial optimization problems that often occurs in the real world. This problem is classified into two cases, one of which is the case which processing time are identical and the other, nonidentical. Not so much researches have been made on the case that nonidentical parallel machines scheduling problem. This study proposes Tabu Search methods for solving parallel machines scheduling problems related to due dates: minimizing mean tardiness, minimizing the number of tardy jobs, minimizing the maximum tardiness.

  • PDF

A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks (불완전하게 규제된 순서회로의 내부상태의 간단화방법)

  • 고경식
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.4 no.3
    • /
    • pp.2-8
    • /
    • 1967
  • A method is illustrated for minimizing the number of internal states in incompletely specified sequential networks. The starting point for minimizing technique in this paper is the set of maximal compatibility classes which covers the original flow table and the minimal covering can be obtained directly by employing three rules. The reduction techniques for prime implicant table or covering and closure table are not employed in this paper. Although the minimizing technique is applied to some specific problems, it is believed that the concepts are general in nature and can be applied to any type of incompletely specified flow tables.

  • PDF

Transition from Cost Minimizing Management to Cost Pass-along Management in U.S. Manufacturing Industries (미국 공업에 있어서 비용 극소화 관리로 부터 비용 전가식 관리로의 변천)

  • Hong, Byeong-Yu
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.6 no.1
    • /
    • pp.9-15
    • /
    • 1980
  • By the mid 1960's the rate of productivity growth in the manufacturing industries of the United States reached the lowest level ever recorded in the American economy. As a result the cost-offsetting operations that had been a century-long part of cost minimizing became less feasible. U.S. manufacturing firins apparently embarked on a pattern of a cost pass-along management. Accounting for price variation as a function of a shift from cost minimizing to cost pass-along is the main subject of this investigation. An econometric model of the inflation process is presented which indicates a clear shift in the modal behavior of manufacturing industries from cost minimizing (1948-1964) to cost pass-along (1965-1975). The latter behavior, initially triggered by the drag of resource diversion on the productivity growth process, undermines the pressure toward productive efficiency that is at the core of industrial engineering, and at the center of U.S. industry's ability to remain competitive.

  • PDF