• Title/Summary/Keyword: branch point

Search Result 406, Processing Time 0.027 seconds

COMMON FIXED POINT THEOREMS FOR A CLASS OF WEAKLY COMPATIBLE MAPPINGS IN D-METRIC SPACES

  • Kim, Jong-Kyu;Sedghi, Shaban;Shobe, Nabi
    • East Asian mathematical journal
    • /
    • v.25 no.1
    • /
    • pp.107-117
    • /
    • 2009
  • In this paper, we give some new definitions of D-metric spaces and we prove a common fixed point theorem for a class of mappings under the condition of weakly compatible mappings in complete D-metric spaces. We get some improved versions of several fixed point theorems in complete D-metric spaces.

Numerical solution of singular integral equation for multiple curved branch-cracks

  • Chen, Y.Z.;Lin, X.Y.
    • Structural Engineering and Mechanics
    • /
    • v.34 no.1
    • /
    • pp.85-95
    • /
    • 2010
  • In this paper, numerical solution of the singular integral equation for the multiple curved branch-cracks is investigated. If some quadrature rule is used, one difficult point in the problem is to balance the number of unknowns and equations in the solution. This difficult point was overcome by taking the following steps: (a) to place a point dislocation at the intersecting point of branches, (b) to use the curve length method to covert the integral on the curve to an integral on the real axis, (c) to use the semi-open quadrature rule in the integration. After taking these steps, the number of the unknowns is equal to the number of the resulting algebraic equations. This is a particular advantage of the suggested method. In addition, accurate results for the stress intensity factors (SIFs) at crack tips have been found in a numerical example. Finally, several numerical examples are given to illustrate the efficiency of the method presented.

An Instance Segmentation using Object Center Masks (오브젝트 중심점-마스크를 사용한 instance segmentation)

  • Lee, Jong Hyeok;Kim, Hyong Suk
    • Smart Media Journal
    • /
    • v.9 no.2
    • /
    • pp.9-15
    • /
    • 2020
  • In this paper, we propose a network model composed of Multi path Encoder-Decoder branches that can recognize each instance from the image. The network has two branches, Dot branch and Segmentation branch for finding the center point of each instance and for recognizing area of the instance, respectively. In the experiment, the CVPPP dataset was studied to distinguish leaves from each other, and the center point detection branch(Dot branch) found the center points of each leaf, and the object segmentation branch(Segmentation branch) finally predicted the pixel area of each leaf corresponding to each center point. In the existing segmentation methods, there were problems of finding various sizes and positions of anchor boxes (N > 1k) for checking objects. Also, there were difficulties of estimating the number of undefined instances per image. In the proposed network, an effective method finding instances based on their center points is proposed.

SOME NEW APPLICATIONS OF S-METRIC SPACES BY WEAKLY COMPATIBLE PAIRS WITH A LIMIT PROPERTY

  • Afra, J. Mojaradi;Sabbaghan, M.
    • The Pure and Applied Mathematics
    • /
    • v.28 no.1
    • /
    • pp.1-13
    • /
    • 2021
  • In this note we use a generalization of coincidence point(a property which was defined by [1] in symmetric spaces) to prove common fixed point theorem on S-metric spaces for weakly compatible maps. Also the results are used to achieve the solution of an integral equation and the bounded solution of a functional equation in dynamic programming.