• Title/Summary/Keyword: Convex-map

검색결과 94건 처리시간 0.02초

Analysis of sliding/Impacting Wear in T7be to Convex Spring Contact and Relevant Contact Problem

  • Kim, Hyung-Kyu;Lee, Young-Ho;Heo, Sung-Pil;Jung, Youn-Ho;Ha, Jae-Wook;Kim, Seock-Sam;Jeon, Kyeong-Lak
    • KSTLE International Journal
    • /
    • 제3권1호
    • /
    • pp.60-67
    • /
    • 2002
  • Wear on the tube-to-spring contact is investigated experimentally, The vibration of the tube causes the wear while the springs support it As for the supporting conditions, the contacting normal farce of 5 N,0 N and the gap of 0.1 mm are applied. The gap condition is for considering the influence of simultaneous impacting and sliding on wear. The wear volume and depth decreases in the order of the 5 N,0 N and the gap conditions. This is explained from the contact geometry of the spring, which is convex of smooth contour, The contact shear force is regarded smaller in the case of the gap existence compared with the other conditions. The wear mechanism is considered from SEM observation of the worn surface. The variation of the normal contact traction is analysed using the finite element analysis to estimate the slip displacement range on the contact with consulting the fretting map.

WEAK AND STRONG CONVERGENCE TO COMMON FIXED POINTS OF NON-SELF NONEXPANSIVE MAPPINGS

  • Su, Yongfu;Qin, Xiaolong
    • Journal of applied mathematics & informatics
    • /
    • 제24권1_2호
    • /
    • pp.437-448
    • /
    • 2007
  • Suppose K is a nonempty closed convex nonexpansive retract of a real uniformly convex Banach space E with P as a nonexpansive retraction. Let $T_1,\;T_2\;and\;T_3\;:\;K{\rightarrow}E$ be nonexpansive mappings with nonempty common fixed points set. Let $\{\alpha_n\},\;\{\beta_n\},\;\{\gamma_n\},\;\{\alpha'_n\},\;\{\beta'_n\},\;\{\gamma'_n\},\;\{\alpha'_n\},\;\{\beta'_n\}\;and\;\{\gamma'_n\}$ be real sequences in [0, 1] such that ${\alpha}_n+{\beta}_n+{\gamma}_n={\alpha}'_n+{\beta'_n+\gamma}'_n={\alpha}'_n+{\beta}'_n+{\gamma}'_n=1$, starting from arbitrary $x_1{\in}K$, define the sequence $\{x_n\}$ by $$\{zn=P({\alpha}'_nT_1x_n+{\beta}'_nx_n+{\gamma}'_nw_n)\;yn=P({\alpha}'_nT_2z_n+{\beta}'_nx_n+{\gamma}'_nv_n)\;x_{n+1}=P({\alpha}_nT_3y_n+{\beta}_nx_n+{\gamma}_nu_n)$$ with the restrictions $\sum^\infty_{n=1}{\gamma}_n<\infty,\;\sum^\infty_{n=1}{\gamma}'_n<\infty,\; \sum^\infty_{n=1}{\gamma}'_n<\infty$. (i) If the dual $E^*$ of E has the Kadec-Klee property, then weak convergence of a $\{x_n\}$ to some $x^*{\in}F(T_1){\cap}{F}(T_2){\cap}(T_3)$ is proved; (ii) If $T_1,\;T_2\;and\;T_3$ satisfy condition(A'), then strong convergence of $\{x_n\}$ to some $x^*{\in}F(T_1){\cap}{F}(T_2){\cap}(T_3)$ is obtained.

공간구문분석을 위한 공간형상 인식 및 관리 방법 (Methods to Recognize and Manage Spatial Shapes for Space Syntax Analysis)

  • 정상규;반영운
    • KIEAE Journal
    • /
    • 제11권6호
    • /
    • pp.95-100
    • /
    • 2011
  • Although Space Syntax is a well-known technique for spatial analysis, debates have taken place among some researchers because the Space Syntax discards geometric information as both shapes and sizes of spaces, and hence may cause some inconsistencies. Therefore, this study aims at developing methods to recognize and manage spatial shapes for more precise space syntax analysis. To reach this goal, this study employed both a graph theory and binary spatial partitioning (BSP) tree to recognize and manage spatial information. As a result, spatial shapes and sizes could be recognized by checking loops in graph converted from spatial shapes of built environment. Each spatial shape could be managed sequentially by BSP tree with hierarchical structure. Through such recognition and management processes, convex maps composed of the fattest and fewest convex spaces could be drawn. In conclusion, we hope that the methods developed here will be useful for urban planning to find appropriate purposes of spaces to satisfy the sustainability of built environment on the basis of the spatial and social relationships in urban spaces.

라인 레이저 기반 3차원 스캐너에서 투영을 이용한 고속 3D 메쉬 생성 (Fast 3D mesh generation using projection for line laser-based 3D Scanners)

  • 이경미;유훈
    • 한국정보통신학회논문지
    • /
    • 제20권3호
    • /
    • pp.513-518
    • /
    • 2016
  • 본 논문은 라인 레이저 기반 3차원 스캐너에서 투영을 이용한 고속 메쉬 생성 방법을 제안한다. 3차원 공간에서의 메쉬를 생성하기 위한 가장 알려진 방법은 3차원의 점을 4차원으로 변환하고 4차원 컨벡스 헐(convex hull)을 구축하는 방법을 활용한다. 이런 방법은 많은 수의 점 데이터를 가지는 3D 스캔 결과에서는 메쉬를 만들 때 시간이 많이 요구된다. 제안하는 방법에서는 라인 레이저 스캐너에서 중간에 얻어지는 (${\theta}$, y, z)축의 점 정보를 투영하여 얻어진 (${\theta}-y$) 2차원 깊이 지도를 메쉬 생성에 활용한다. 제안된 방법은 2D 영역에서 수행되기 때문에 메쉬를 구성하는 시간이 상당히 단축된다. 제안하는 방법을 평가하기 위해서 라인 레이저 기반 스캐너의 중간 데이터를 이용하여 실험을 진행하였다. 실험 결과는 제안된 방법이 기존방법보다 고속 메시 생성에서 우수함을 보여준다.

3 차원 비디오의 합성영상 경계 잡음 제거 (Boundary artifacts reduction for synthesized views in 3D video)

  • 이도훈;양윤모;오병태
    • 한국방송∙미디어공학회:학술대회논문집
    • /
    • 한국방송∙미디어공학회 2016년도 하계학술대회
    • /
    • pp.302-305
    • /
    • 2016
  • 본 논문에서는 3 차원 영상시스템에서 발생하는 경계 잡음을 Projection onto Convex Sets(POCS) 방법을 활용하여 제거하는 기법에 대해서 소개한다. 3 차원 영상시스템에서의 경계 잡음은 일반적으로 손상된 깊이영상 의하여 가상 시점의 합성 과정에서 발생하는 잡음을 뜻한다. 본 논문에서는 이러한 경계 잡음을 분석하고, 제안 방식을 이용하여 효과적으로 제거할 수 있음을 여러 실험을 통하여 확인하였다.

  • PDF

Some existence theorems for generalized vector variational inequalities

  • Lee, Gue-Myung;Kim, Do-Sang;Lee, Byung-Soo
    • 대한수학회보
    • /
    • 제32권2호
    • /
    • pp.343-348
    • /
    • 1995
  • Let X and Y be two normed spaces and D a nonempty convex subset of X. Let $T : X \ to L(X,Y)$ be a mapping, where L(X,Y) is the space of all continuous linear mappings from X into Y. And let $C : D \to 2^Y$ be a set-valued map such that for each $x \in D$, C(x) is a convex cone in Y such that Int $C(x) \neq 0 and C(x) \neq Y$, where Int denotes the interior.

  • PDF

Feasibility Test of the Numerical Optimization for the Fast IMRT Planning

  • Cheong, Kwang-Ho;Suh, Tae-Suk;Dempsey, James F.
    • 한국의학물리학회:학술대회논문집
    • /
    • 한국의학물리학회 2005년도 제30회 춘계학술대회
    • /
    • pp.79-82
    • /
    • 2005
  • In this study, we have tested the feasibility of the convex non-linear objective model and the line search optimization method for the fluence map optimization (FMO). We've created the convex nonlinear objective function with simple bound constraints and attained the optimal solution using well-known gradient algorithms with an Armijo line search that requires sufficient objective function decrease. The algorithms were applied to 10 head-and-neck cases. The numbers of beamlets were between 900 and 2,100 with a 3 mm isotropic dose grid. Nonlinear optimization methods could efficiently solve the IMRT FMO problem in well under a minute with high quality for clinical cases.

  • PDF

공간구문론(Space Syntax) 분석에 의한 세대별 박물관 공간구성에 관한 연구 - 대공간과 전시공간 연결방식의 변화양상을 중심으로 - (A Study of the Spatial Composition of the Each Generation's Museum Space by Space Syntax Analysis - Focused on Connection Form Changes of the Major Space and Exhibition Space -)

  • 박종구;이성훈
    • 한국실내디자인학회논문집
    • /
    • 제15권5호
    • /
    • pp.247-254
    • /
    • 2006
  • The museum has steadily been evolved by time with its function and social idea differently. As the museum makes its evolution, its architecture has also been changed. This study aims to find out the characteristics of museum architecture by applying Space Syntax for space correspondence of museum architecture changed by the time. And the characteristics could be used as project guide by making data for building up museum architecture changed by social concept with efficient and functional system. The method of the study is to divide the museum into three generations, and give case for each generation. And the each chosen case was analyzed by convex space of space syntax. The order of the analysis is to divide the case as the unit space, make out the Convex Map. And finally get the analysis variable by carrying out a mathematical operation. The characteristics found in these operations are as follows. First, the major space has been planed for convenience of spectators. Second, exhibition space located on specific area in entire plot planning makes spectators easy to recognize in terms of the line of flow toward exhibition space and also relieves character of major and exhibition space. Third, it is getting hard to comprehend the entire space as forming diverse space in process that museum accepts many request from spectators.

ITERATIVE SOLUTION OF NONLINEAR EQUATIONS WITH STRONGLY ACCRETIVE OPERATORS IN BANACH SPACES

  • Jeong, Jae-Ug
    • Journal of applied mathematics & informatics
    • /
    • 제7권2호
    • /
    • pp.605-615
    • /
    • 2000
  • Let E be a real Banach space with property (U,${\lambda}$,m+1,m);${\lambda}{\ge}$0; m${\in}N$, and let C be a nonempty closed convex and bounded subset of E. Suppose T: $C{\leftrightarro}C$ is a strongly accretive map, It is proved that each of the two well known fixed point iteration methods( the Mann and Ishikawa iteration methods.), under suitable conditions , converges strongly to a solution of the equation Tx=f.

FIXED POINTS OF ROTATIVE LIPSCHITZIAN MAPS

  • Park, Sehie;Yie, Sangsuk
    • 대한수학회보
    • /
    • 제23권2호
    • /
    • pp.155-160
    • /
    • 1986
  • Let X be a closed convex subset of a Banach space B and T:X.rarw.X a lipschitzian rotative map, i.e., such that ∥Tx-Ty∥.leq.k∥x-y∥ and ∥T$^{n}$ x-x∥.leq.a∥Tx-x∥ for some real k, a and an integer n>a. We denote by .PHI. (n, a, k, X) the family of all such maps. In [3], [4], K. Goebel and M. Koter obtained results concerning the existence of fixed points of T depending on k, a and n. In the present paper, the main results of [3], [4] are so strengthened that some information concerning the geometric estimations of fixed points are given.

  • PDF