• KSTLE International Journal
• /
• v.3 no.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.

• Journal of applied mathematics & informatics
• /
• v.24 no.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.

• KIEAE Journal
• /
• v.11 no.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.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.3
• /
• pp.513-518
• /
• 2016

This paper presents a fast 3D mesh generation method using projection for line laser-based 3D scanners. The well-known method for 3D mesh generation utilizes convex hulls for 4D vertices that is converted from the input 3D vertices. This 3D mesh generation for a large set of vertices requires a lot of time. To overcome this problem, the proposed method takes (${\theta}-y$) 2D depth map into account. The 2D depth map is a projection version of 3D data with a form of (${\theta}$, y, z) which are intermediately acquired by line laser-based 3D scanners. Thus, our 2D-based method is a very fast 3D mesh generation method. To evaluate our method, we conduct experiments with intermediate 3D vertex data from line-laser scanners. Experimental results show that the proposed method is superior to the existing method in terms of mesh generation speed.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2016.06a
• /
• pp.302-305
• /
• 2016

This paper proposes a boundary artifacts reduction method for synthesized views in 3D video system using Projection onto Convex Sets (POCS). In 3D video system, boundary artifacts are occurred in synthesized views by distorted depth map. In this paper, we analyze boundary artifacts, and show the experimental results by the proposed algorithm on various situations.

• Bulletin of the Korean Mathematical Society
• /
• v.32 no.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.

• Proceedings of the Korean Society of Medical Physics Conference
• /
• 2005.04a
• /
• 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.

• Korean Institute of Interior Design Journal
• /
• v.15 no.5 s.58
• /
• 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.

• Journal of applied mathematics & informatics
• /
• v.7 no.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.

• Bulletin of the Korean Mathematical Society
• /
• v.23 no.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.