• Journal of applied mathematics & informatics
• /
• 제10권1_2호
• /
• pp.245-250
• /
• 2002

Consider the Convex Polygon Pm={Al , A2, ‥‥, Am} With Vertex points A$\_$i/ = (a$\_$i/, b$\_$i/),i : 1,‥‥, m, interior P$\^$0/$\_$m/, and length of perimeter denoted by L(P$\_$m/). Let R$\_$n/ = {B$_1$,B$_2$,‥‥,B$\_$n/), where B$\_$i/=(x$\_$i/,y$\_$I/), i =1,‥‥, n, denote a regular polygon with n sides of equal length and equal interior angle. Kaiser[4] used the regular polygon R$\_$n/ to approximate P$\_$m/, and the problem examined in his work is to position R$\_$n/ with respect to P$\_$m/ to minimize the area of the symmetric difference between the two figures. In this paper we give the quality of a approximating regular polygon R$\_$n/ to approximate P$\_$m/.

• 한국경영과학회지
• /
• 제25권4호
• /
• pp.15-25
• /
• 2000

In this paper, we introduce a point-to-multipoint minimum cost flow problem with convex and demand splitting. A source node transmits the traffic along the tree that includes members of the point-to-multipoint connection. The traffic is replicated by the nodes only at branch points of the tree. In order to minimize the sum of arc costs, we assume that the traffic demand can be splitted and transmitted to destination nodes along different trees. If arc cost is linear, the problem would be a Steiner tree problem in networks eve though demand splitting is permitted. The problem would be applied in transmitting large volume of traffic from a serve to clients in Internet environments. Optimality conditions of the problem are presented in terms of fair tree routing. The proposed algorithm is a finite terminating algorithm for $\varepsilon$-optimal solution. convergence of the algorithm is obtained under monotonic condition and strict convexity of the cost function. Computational experiences are included.

• 대한수학회보
• /
• 제52권1호
• /
• pp.275-286
• /
• 2015

It is well known that the area U of the triangle formed by three tangents to a parabola X is half of the area T of the triangle formed by joining their points of contact. In this article, we consider whether this property and similar ones characterizes parabolas. As a result, we present three conditions which are necessary and sufficient for a strictly convex curve in the plane to be an open part of a parabola.

• 한국경영과학회지
• /
• 제22권3호
• /
• pp.11-22
• /
• 1997

The aim of this paper is to develop the B & B type algorithms for globally minimizing concave function under 0-1 knapsack constraint. The linear convex envelope underestimating the concave object function is introduced for the bounding operations which locate the vertices of the solution set. And the simplex containing the solution set is sequentially partitioned into the subsimplices over which the convex envelopes are calculated in the candidate problems. The adoption of cutting plane method enhances the efficiency of the algorithm. These mean valid inequalities with respect to the integer solution which eliminate the nonintegral points before the bounding operation. The implementations are effectively concretized in connection with the branching stategys.

• 대한수학회보
• /
• 제33권1호
• /
• pp.1-16
• /
• 1996

Earlier in 1935[12], M. S. Robertson introduced the class of quadrant preserving functions. More precisely, let Q be the class of all functions f(z) analytic in the unit disk $D = {z : $\mid$z$\mid$ < 1}$ such that f(0) = 0, f'(0) = 1, and the range f(z) is in the j-th quadrant whenever z is in the j-th quadrant of D, j = 1,2,3,4. This class Q contains the subclass of normalized, odd univalent functions which have real coefficients. On the other hand, this class Q is contained in the class T of odd typically real functions which was introduced by W. Rogosinski [13]. Clearly, if $f \in Q$, then f(z) is real when z is real and therefore the coefficients of f are all real. Recently, it was observed by Y. Abu-Muhanna and T. H. MacGregor [1] that any function $f \in Q$ is odd. Instead of functions "preserving quadrants", the authors [1] have introduced the notion of "preserving sectors".

• International Journal of Automotive Technology
• /
• 제5권1호
• /
• pp.17-22
• /
• 2004

An experimental investigation was conducted to study the characteristics of turbulent swirling flow in an axisymmetric annuli. The swirl angle measurements were performed using a flow visualization technique using smoke and dye liquid for Re=60,000-80,000. Using the two-dimensional Particle Image Velocimetry method, this study found the time-mean velocity distribution and turbulence intensity in water with swirl for Re=20,000, 30,000, and 40,000 along longitudinal sections. There were neutral points for equal axial velocity at y/(R-r)=0.7-0.75, and the highest axial velocity was recorded near y/(R-r)=0.9. Negative axial velocity was observed near the convex tube along X/(D-d)=3.0-18.0 for Re=20,000.

• 제어로봇시스템학회논문지
• /
• 제21권11호
• /
• pp.1003-1007
• /
• 2015

Depth calibration is a procedure for finding the conversion function that maps disparity data from a depth-sensing camera to actual distance information. In this paper, we present an optimal depth calibration method for Kinect$^{TM}$ sensors based on an experimental design and convex optimization. The proposed method, which utilizes multiple measurements from only two points, suggests a simplified calibration procedure. The confidence ellipsoids obtained from a series of simulations confirm that a simpler procedure produces a more reliable calibration function.

• 한국수학사학회지
• /
• 제27권6호
• /
• pp.395-402
• /
• 2014

When the circle inscribed in a square is projected to a picture plane, one sees, in general, an ellipse in a convex quadrilateral. This ellipse is poorly described in the works of Alberti and Durer. There are one parameter family of ellipses inscribed in a convex quadrilateral. Among them only one ellipse is the perspective image of the circle inscribed in the square. We call this ellipse "the projected ellipse." One can easily find the four tangential points of the projected ellipse and the quadrilateral. Then we show how to find the center of the projected ellipse. Finally, we describe a pair of conjugate vectors for the projected ellipse, which finishes the construction of the desired ellipse. Using this algorithm, one can draw the perspective image of the squared-circle tiling.

• 대한수학회지
• /
• 제49권4호
• /
• pp.671-686
• /
• 2012

This paper mainly deals with the tilted Carath$\acute{e}$odory class by angle ${\lambda}$ ${\in}$ ($-{\pi}/2$, ${\pi}/2$), denoted by $P{\lambda}$) an element of which maps the unit disc into the tilted right half-plane {<${\omega}$ : Re $e^{i{\lambda}}{\omega}$ > 0}. Firstly we will characterize $P{\lambda}$ from different aspects, for example by subordination and convolution. Then various estimates of functionals over $P{\lambda}$ are deduced by considering these over the extreme points of $P{\lambda}$ or the knowledge of functional analysis. Finally some subsets of analytic functions related to $P{\lambda}$ including close-to-convex functions with argument ${\lambda}$, ${\lambda}$-spirallike functions and analytic functions whose derivative is in $P{\lambda}$ are also considered as applications.

• 대한수학회보
• /
• 제37권4호
• /
• pp.729-741
• /
• 2000

In this paper, we study in Banach spaces the existence of fixed points of asymptotically regular mapping T satisfying: for each x, y in the domain and for n=1, 2,…, $$\parallelT^nx-T^ny\parallel\leq$\leq$a_n\parallelx-y\parallel+b_n (\parallelx-T^nx\parallel+\parallely-T^ny\parallely)$$ where $a_n,\; b_n,\; C_n$ are nonnegative constants satisfying certain conditions. We also establish some fixed point theorems for these mappings in a Hibert space, in L(sup)p spaces, in Hardy space H(sup)p, and in Soboleve space $H^{k,p} for 1<\rho<\infty \; and \; k\geq0$. We extend results from papers [10], [11], and others.