• Honam Mathematical Journal
• /
• v.45 no.4
• /
• pp.648-654
• /
• 2023

Schwarz lemma at the non-smooth boundary point for holomorphic self-map on the intersection of two balls in ℂ² is obtained. At the complex tangent point in the corner of the boundary of the domain, the tangential eigenvalue of the complex Jacobian of the holomorphic map is estimated if the map is transversal.

• Korean Journal of Computational Design and Engineering
• /
• v.7 no.2
• /
• pp.75-80
• /
• 2002

This paper details a robust and efficient algorithm for point classification with respect to a polygon in 2D real number domain. The concept of tolerance makes this algorithm robust and consistent. It enables to define‘on-boundary’ , which can be interpreted as either‘in-’or‘out-’side region, and to manage rounding errors in floating point computation. Also the tolerance is used as a measure of reliability of point classifications. The proposed algorithm is based on a ray-intersection technique known as the most efficient, in which intersections between a ray originating from a given test point and the boundary of a region are counted. An odd number of intersections indicates that the point is inside region. For practical examples the algorithm is most efficient because most edges of the polygon region are processed by simple bit operations.

• The Journal of the Convergence on Culture Technology
• /
• v.4 no.4
• /
• pp.367-372
• /
• 2018

This paper proposed an algorithm that detects boundary nodes effectively in wireless sensor network. A boundary node is a sensor that lies on the border of network holes or the outer boundary of wireless sensor network. Proposed algorithm detects boundary nodes using only the position information of sensors. In addition, to improve detect performance, sensor computes the overlap area of nearest sensor first. Simulation is performed to validate the process of the proposed algorithm. In Simulation, several obstacles are placed and varying number of sensors in the range of 500~1500 are deployed in the area in order to reflect real world. The simulation results shows that proposed algorithm detects boundary nodes effectively that are located on the border of holes and the outer boundary of wireless sensor network.

• Korean Journal of Computational Design and Engineering
• /
• v.22 no.1
• /
• pp.59-69
• /
• 2017

Internal capacity of a refrigerator is an important indicator for design and purchasing criteria. The components facing the internal space may have holes or gaps between parts. In traditional way, design engineers manually remodeled the parts to fill the holes and the gaps for enclosed boundary of the internal space. Then they calculated internal volume by subtracting the assembly of parts from its enclosing volume. However, filling holes and gaps is not an automated process requiring a plenty of labor and time. In this research, we have developed a voxel-based method to estimate the internal volume of a refrigerator automatically. It starts transforming all components facing the interior space into voxels and fills all holes and gaps automatically by the developed hole-filling algorithm to form a completely closed boundary of the assembly. Then, it identifies the boundary voxels that are facing to the internal voxels with any part of the component. After getting the intersection points between the boundary voxels and the surfaces of components, it generates the boundary surface of triangular facets with the intersection points. Finally, it estimates the internal volume by adding volume of each tetrahedron composed of a triangle of boundary surface and an arbitrary point.

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.2
• /
• pp.543-557
• /
• 2017

In this paper, we investigate the notion of q-pseudoconvexity to discuss and describe some geometric characterizations of q-pseudoconvex domains ${\Omega}{\subset}{\mathbb{C}}^n$. In particular, we establish that ${\Omega}$ is q-pseudoconvex, if and only if, for every boundary point, the Levi form of the boundary is semipositive on the intersection of the holomorphic tangent space to the boundary with any (n-q+1)-dimensional subspace $E{\subset}{\mathbb{C}}^n$. Furthermore, we prove that the Kiselman's minimum principal holds true for all q-pseudoconvex domains in ${\mathbb{C}}^p{\times}{\mathbb{C}}^n$ such that each slice is a convex tube in ${\mathbb{C}}^n$.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.12
• /
• pp.1911-1918
• /
• 2001

Recently the non-destructive test technique which uses the grain boundary etching characteristics owing to the variation of material structures has been proposed. However, during in-serviced GEM test there are a lot of variables such as the changes of temperature and concentration of etching solution, the roughness condition of surface polished etc.. The purpose of this paper is to investigate the influences of these test variables on GEM test results in order to establish a reliable and sensitive of GEM evaluation technique. The experiments are conducted in various solution temperatures, 10$\^{C}$, 15$\^{C}$, 20$\^{C}$, and 25$\^{C}$ and in 70% and 100% concentrations of that, and in various surface roughnesses polished by #800, #2000, and 0.3㎛ alumina powder. Through the test with variables, it is verified that the decrease of temperature and concentration of etching solution and the coarsened surface roughness by not using polishing cloth and powder induce some badly and/or greatly influences on GEM test results like grain boundary etching width(W$\_$GB) and intersecting point ratio(N$\_$i/N$\_$0/). Therefore, to get reliable and good GEM test results, it must be prepared the surface of specimen polished by polishing cloth and 0.3㎛ alumina powder and the saturated picric acid solution having 25$\^{C}$ and be maintained the constant temperature(25$\^{C}$) during GEM test.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11
• /
• pp.3140-3149
• /
• 1999

Skew correction for document images can be using a rotational transformation of pixel coordinates. In this paper we propose a method which corrects the document skew, by an amount of $\theta$ degrees, using block information, where the block is defined as a rectangular area containing adjacent black pixels. Processing speed of the proposed method is faster than that of the method using pixel transformation, since the number of floating-point operations can be reduced significantly. In the proposed method, we rotate only the four corner points of each block, and then identify the pixels inside the block. Two methods for inside pixel identification are proposed; the first method finds two points intersecting the boundary of the rotated block in each row, and determines the pixels between the two intersection points as the inside pixel. The second method finds boundary points based on Bresenham's line drawing algorithm, using fixed-point operation, and fills the region surrounded by these boundaries as black pixels. We have measured the performance of the proposed method by experimenting it with 2,016 images of various English and Korean documents. We have also proven the superiority of our algorithm through performance comparison with respect to existing methods based on pixel transformation.

• Journal of the Society of Naval Architects of Korea
• /
• v.58 no.2
• /
• pp.90-96
• /
• 2021

In this study, the method of determining the state of grid points in the adaptable surface particle method based on grid system developed as a free-surface tracing method was improved. The adaptable surface particle method is a method of determining the state of the grid point according to the shape of the free-surface and obtaining the intersection of the given free-surface and grid line where the state of the grid point changes. It is difficult to determine the state of grid points in the event of rapid flow, such as collision or separation of free-surfaces, and this study suggests a method for determining the state of current grid points using the state of surrounding grid points where the state of grid point are known. A grid layer value was assigned sequentially to a grid away from the free-surface, centering on the boundary cell where the free-surface exists, to identify the connection information that the grid was separated from the free-surface, and to determine the state of the grid point sequentially from a grid away from the free-surface to a grid close to the free-surface. To verify the improved method, a numerical analysis was made on the problem of dam break in which a sudden collision of free-surface occurred and the results were compared, and the results were relatively reasonable.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.7
• /
• pp.1064-1072
• /
• 2001

It is very important to evaluate material degradation like temper and carbide embrittlements to secure the reliable and efficient operational conditions and to prevent brittle failure in service. The extent of material deterioration can be accurately evaluated by mechanical test such as impact test or creep test. But it is almost impossible to sample a large specimen from in-service plants. Thus, the material degradation evaluation by a non-destructive method is earnestly required. Recently the non-destructive test technique which uses the grain boundary etching characteristics owing to the variation of material structures has been proposed. However the program for material degradation evaluation using the grain boundary etching method(GEM) in Windows 98 domain doesnt be developed now. The aims of this paper are to develop the program and to complete the new master curve equations for the evaluation of material degradation on in-serviced high temperature components.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.8
• /
• pp.1-8
• /
• 2020

Air ducts installed for ventilation inside buildings accumulate contaminants during their service life. Robots are installed to clean the air duct at low cost, but they are still not fully automated and depend on manpower. In this study, an intersection detection algorithm for autonomous driving was applied to an air duct cleaning robot. Autonomous driving of the robot was achieved by calculating the distance and angle between the extracted point and the center point through the intersection detection algorithm from the camera image mounted on the robot. The training data consisted of CAD images of the duct interior as well as the cross-point coordinates and angles between the two boundary lines. The deep learning-based CNN model was applied as a detection algorithm. For training, the cross-point coordinates were obtained from CAD images. The accuracy was determined based on the differences in the actual and predicted areas and distances. A cleaning robot prototype was designed, consisting of a frame, a Raspberry Pi computer, a control unit and a drive unit. The algorithm was validated by video imagery of the robot in operation. The algorithm can be applied to vehicles operating in similar environments.