• Journal of applied mathematics & informatics
• /
• v.19 no.1_2
• /
• pp.93-104
• /
• 2005

The present article discusses the number of empty convex 4-gons and empty convex 5-gons in a finite planar point set. New proofs are provided for the two related important results.

• Communications of the Korean Mathematical Society
• /
• v.23 no.2
• /
• pp.241-250
• /
• 2008

In this article, we find a counter example which shows that the well-known necessary condition about the boundary regularity of a stable strictly convex body is not a sufficient condition.

• Kyungpook Mathematical Journal
• /
• v.18 no.1
• /
• pp.37-46
• /
• 1978

The first part of this note is concerned with a neighbourhood base characterisation of locally order-convex spaces. The notions of order*-inductive limits and order ultrabornologicity in the class of locally order-convex spaces are introduced and studied in the latter part. These are the non-convex generalisation of o-inductive limits and o-bornological spaces.

• Honam Mathematical Journal
• /
• v.40 no.2
• /
• pp.239-250
• /
• 2018

In this paper, we establish some new Newton's type integral inequalities for p-harmonic convex functions. Some special cases are also discussed as applications of our main results. Results obtained in this paper may be starting point for further research.

• Journal of applied mathematics & informatics
• /
• v.28 no.5_6
• /
• pp.1507-1518
• /
• 2010

In this article some generalized refinements of some inequalities for real quasi-cinvex, convex, concave, s-convex, s-concave, and $\alpha$-star s-convex mappings are obtained.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.314-319
• /
• 2005

When a robot navigates in the real environment, it frequently meets various environments that can be expressed by simple geometrical shapes such as fiat floor, uneven floor, floor with obstacles, slopes, concave or convex corners, etc. Among them, the convex corner composed of two plain surfaces is the most difficult one for the robot to negotiate. In this paper, we propose a gait planning algorithm to help the robot overcome the convex environment. The trajectory of the body is derived from the maximum distance between the edge boundary of the corner and the bottom of the robot when it travels in the convex environment. Additionally, we find the relation between kinematical structure of the robot and its ability of avoiding collision. The relation is realized by considering the workspace and the best posture of the robot in the convex structure. To provide necessary information for the algorithm, we use an IR sensor attached in the leg of the robot to perceive the convex environment. The validity of the gait planning algorithm is verified through simulations and the performance is demonstrated using a quadruped walking robot, called "MRWALLSPECT III"( Multifunctional Robot for WALL inSPECTion version 3).

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.9
• /
• pp.1167-1174
• /
• 1999

In this paper, we present a new technique for the local decomposition of convex structuring elements for morphological image processing. Local decomposition of a structuring element consists of local structuring elements, in which each structuring element consists of a subset of origin pixel and its eight neighbors. Generally, local decomposition of a structuring element reduces the amount of computation required for morphological operations with the structuring element. A unique feature of our approach is the use of linear integer programming technique to determine optimal local decomposition that guarantees the minimal amount of computation. We defined a digital convex polygon, which, in turn, is defined as a convex structuring element, and formulated the necessary and sufficient conditions to decompose a digital convex polygon into a set of basis digital convex polygons. We used a set of linear equations to represent the relationships between the edges and the positions of the original convex polygon, and those of the basis convex polygons. Further. a cost function was used represent the total processing time required for computation of dilation/erosion with the structuring elements in a decomposition. Then integer linear programming was used to seek an optimal local decomposition, that satisfies the linear equations and simultaneously minimize the cost function.

• Journal of Korean Academy of Oral and Maxillofacial Radiology
• /
• v.24 no.2
• /
• pp.227-236
• /
• 1994

The purpose of this study was to observe mandibular condyle shape in an asymptomatic population. In order to carry out this study, 96 temporomandibular joints in 48 adults(22 males, 26 females), who were asymptomatic for temporomandibular disturbances and had no history of prosthodontic or orthodontic treatments, were selected, and radiographed using the Sectograph(Denar Co., U.S.A.) for lateral and frontal individualized corrected TMJ tomograph and submentovertex radiograph. Mandibular condyles were classified morphologically, and measured medioateral and anteroposterior dimensions and condylar angulation. The obtained results were as follows. 1. In the classification of condyle shape on lateral tomographs, 94.8% were convex type and 5.2% were angled type. 2. In the classification of condyle shape on frontal tomographs, 45.3% were convex type, 32.0% were round type, 16.0% were flat type, and 6.7% were angled type. 3. In the classification of condyle shape on submentovertex radiographs, 34.5% were flat-convex type, 22.9% were flat-flat type, 20.8% were concave-convex type, 19.8% were convex-convex type, and 1.0% were concave-flat type and convex-flat type. Concave-concave type, convex-concave type, and flat-concave type were not observed. 4. The average mediolateral legth of the condyle was 19.3㎜ and the average anteroposterior length was 9.4㎜. The average angle between the long axis of condyle and the coronal plane made on submentovertex view was 19.6 degrees.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.14 no.2
• /
• pp.313-320
• /
• 2011

SPH(Smoothed Particle Hydrodynamics) is a gridless Lagrangian technique that is useful as an alternative numerical analysis method used to analyze high deformation problems as well as astrophysical and cosmological problems. In SPH, all points within the support of the kernel are taken as neighbours. The accuracy of the SHP is highly influenced by the method for choosing neighbours from all particle points considered. Typically a linked-list method or tree search method has been used as an effective tool because of its conceptual simplicity, but these methods have some liability in anisotropy situations. In this study, convex hull algorithm is presented as an improved method to eliminate this artifact. A convex hull is the smallest convex set that contains a certain set of points or a polygon. The selected candidate neighbours set are mapped into the new space by an inverse square mapping, and extract a convex hull. The neighbours are selected from the shell of the convex hull. These algorithms are proved by Fortran programs. The programs are expected to use as a searching algorithm in the future SPH program.

• Restorative Dentistry and Endodontics
• /
• v.17 no.1
• /
• pp.141-152
• /
• 1992

Four endodontic instruments from different manufacturers(K - file, Hedstrom - file, K - flex - file, Cavi - Endo) were used to shape 80 mesial canals of extracted posterior teeth. The instrument's ability to enlarge and shape the canals as the original canal shape was assessed by superimposing radiographs of canals obtained before and after canal shaping. The results were as follows 1. Hedstrom - file enlarged canals greater than K - file, K - flex - file, and Cavi - Endo(P<0.05). There are no differences in canal enlargement among K - flex, K - flex - file, and Cavi - Endo(P<0.05). 2. All the instruments showed no difference in canal enlargement between convex side and concave side of B point in proximal and clinical radiographic views, but at the concave side of C point canals were enlarged greater than at the convex side(proximal view of K - file: P<0.05, the others: P<0.01). 3. There was no difference m canal enlargement between convex side and concave side in proximal view of A and D points of K - file and K - flex - file(P<0.05). But in clinical view, canal enlargement at convex side of A point and concave side of D point was greater than that at concave side of A point and convex side of D point respectively. 4. Hedstrom - files showed greater canal enlargement at convex side of A points and concave side of D points (P<0.05 or P<0.01). Cavi - Endo showed no difference in canal enlargement between convex side and concave side at A and D points in proximal view(P<0.05). Bur canal enlargement was greater at concave side than at convex side of D point in clinical view. 5. K - file and Cavi - Endo showed no differences in canal enlargement between convex and concave side in proximal and clinical view (P<0.05). K - flex - file showed greater canal enlargement at concave side in proximal and clinical view(P<0.0:5). Hedstrom file showed no difference in canal enlargement between convex side and concave side in proximal view, but showed greater canal enlargement at concave side in clinical view(P<0.05).