• Title/Summary/Keyword: point-set

Search Result 2,977, Processing Time 0.027 seconds

WEAK CONVERGENCE OF A HYBRID ITERATIVE SCHEME WITH ERRORS FOR EQUILIBRIUM PROBLEMS AND COMMON FIXED POINT PROBLEMS

  • Kim, Seung-Hyun;Lee, Byung-Soo
    • The Pure and Applied Mathematics
    • /
    • v.21 no.3
    • /
    • pp.195-206
    • /
    • 2014
  • In this paper, we consider, under a hybrid iterative scheme with errors, a weak convergence theorem to a common element of the set of a finite family of asymptotically k-strictly pseudo-contractive mappings and a solution set of an equilibrium problem for a given bifunction, which is the approximation version of the corresponding results of Kumam et al.

SELECTION THEOREMS WITH n-CONNECTDENESS

  • In-Sook Kim
    • Journal of the Korean Mathematical Society
    • /
    • v.35 no.1
    • /
    • pp.165-175
    • /
    • 1998
  • We give a generalization of the selection theorem of Ben-El-Mechaiekh and Oudadess to complete LD-metric spaces with the aid of the notion of n-connectedness. Our new selection theorem is used to obtain new results of fixed points and coincidence points for compact lower semicontinuous set-valued maps with closed values consisting of D-sets in a complete LD-metric space.

  • PDF

FIXED POINT THEOREMS FOR MӦNCH TYPE MAPS IN ABSTRACT CONVEX UNIFORM SPACES

  • Kim, Hoonjoo
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.34 no.4
    • /
    • pp.345-353
    • /
    • 2021
  • In this paper, first, we present new fixed point theorems for Mönch type multimaps on abstract convex uniform spaces and, also, a fixed point theorem for Mönch type multimaps in Hausdorff KKM L𝚪-spaces. Second, we show that Mönch type multimaps in the better admissible class defined on an L𝚪-space have fixed point properties whenever their ranges are Klee approximable. Finally, we obtain fixed point theorems on 𝔎ℭ-maps whose ranges are 𝚽-sets.

An Integer Programming-based Local Search for the Set Partitioning Problem

  • Hwang, Junha
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.9
    • /
    • pp.21-29
    • /
    • 2015
  • The set partitioning problem is a well-known NP-hard combinatorial optimization problem, and it is formulated as an integer programming model. This paper proposes an Integer Programming-based Local Search for solving the set partitioning problem. The key point is to solve the set partitioning problem as the set covering problem. First, an initial solution is generated by a simple heuristic for the set covering problem, and then the solution is set as the current solution. Next, the following process is repeated. The original set covering problem is reduced based on the current solution, and the reduced problem is solved by Integer Programming which includes a specific element in the objective function to derive the solution for the set partitioning problem. Experimental results on a set of OR-Library instances show that the proposed algorithm outperforms pure integer programming as well as the existing heuristic algorithms both in solution quality and time.

Automatic Local Update of Triangular Mesh Models Based on Measurement Point Clouds (측정된 점데이터 기반 삼각형망 곡면 메쉬 모델의 국부적 자동 수정)

  • Woo, Hyuck-Je;Lee, Jong-Dae;Lee, Kwan-H.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.11 no.5
    • /
    • pp.335-343
    • /
    • 2006
  • Design changes for an original surface model are frequently required in a manufacturing area: for example, when the physical parts are modified or when the parts are partially manufactured from analogous shapes. In this case, an efficient 3D model updating method by locally adding scan data for the modified area is highly desirable. For this purpose, this paper presents a new procedure to update an initial model that is composed of combinatorial triangular facets based on a set of locally added point data. The initial surface model is first created from the initial point set by Tight Cocone, which is a water-tight surface reconstructor; and then the point cloud data for the updates is locally added onto the initial model maintaining the same coordinate system. In order to update the initial model, the special region on the initial surface that needs to be updated is recognized through the detection of the overlapping area between the initial model and the boundary of the newly added point cloud. After that, the initial surface model is eventually updated to the final output by replacing the recognized region with the newly added point cloud. The proposed method has been implemented and tested with several examples. This algorithm will be practically useful to modify the surface model with physical part changes and free-form surface design.

Improvement of patient's quality of life by improving patient's set-up line in radiotherapy (방사선 치료 시 환자 Set-up Line 개선을 통한 암환자 삶의 질 만족도 향상)

  • Choi, Jin Hyuk;Ahn, Woo Sang;Lee, Woo Seok;Kim, Dae Yong
    • The Journal of Korean Society for Radiation Therapy
    • /
    • v.30 no.1_2
    • /
    • pp.185-189
    • /
    • 2018
  • Purpose : We evaluated the quality of life satisfaction of patients with radiation therapy while maintaining the set-up line. Materials and Methods : We retrospectively reviewed 60 patients who visited our clinic in January, 2018. The most common complaint was the inconvenience of not being able to wash during treatment (64 %), and a surgical tape was placed on the Set-up Line to help patients wash during the treatment period. A total of 50 patients who underwent surgical tape were evaluated on a 5-point scale (1 point was very unsatisfactory, 2 points were unsatisfactory, 3 points were average, 4 points were satisfied, 5 points were very satisfied). Forty patients out of 50 responded to the first treatment, and 10 patients underwent treatment. Results : In the first survey, 68 % of the patients and 32 % of the males were aged 34 %, 50~60 % and 38 %, respectively. Treatment areas were breast (57 %), chest (13 %), pelvis (10 %). The results of the second questionnaire after applying the surgical tape showed that 25 of the 40 patients and 15 of the male patients were treated. The treatment area was 22 breast and 18 pelvic areas. In the satisfaction of the 5-point scale, 5 to 15 points were satisfied with 1-3 points, and 4-5 points with 35 points (1 point 2 points, 2 points 2 points, 3 point 1 points, 4 point points 17 point points, % And 43 %, respectively. The results of the questionnaire survey of patients who were applied during the treatment showed that 9 out of 10 women and 1 male were treated. The treatment area was 8 breast and 2 pelvic areas. One point was satisfied with one point, and five points with nine points were satisfied with 90 %. Conclusions : The importance of improving the quality of life of patients with cancer is also important. After applying the surgical tape, 88 % of the patients who started the treatment and 90 % of the patients who applied during the treatment were satisfied. Particularly, patients who applied during treatment showed higher satisfaction. If this is not possible for all patients, selective application to patients with discomfort will be helpful in improving the quality of life of cancer patients.

  • PDF

DYNAMICS OF COUNTING

  • Kim, June Gi;Song, Young Sun
    • Korean Journal of Mathematics
    • /
    • v.11 no.1
    • /
    • pp.71-77
    • /
    • 2003
  • In this paper we are going to study the dynamics of counting on the set S of functions from a finite subset of $\mathbb{N}=\{1,2,{\cdots}\}$ into $\mathbb{N}$. We have shown that every point $f{\in}S$ is either an eventually fixed point or an eventually periodic point of period 2 or 3.

  • PDF