• Bulletin of the Korean Mathematical Society
• /
• v.61 no.3
• /
• pp.585-595
• /
• 2024

We show that a pseudo-Anosov map constructed as a product of the large power of Dehn twists of two filling curves always has a geodesic axis on the curve graph of the surface. We also obtain estimates of the stable translation length of a pseudo-Anosov map, when two filling curves are replaced by multicurves. Three main applications of our theorem are the following: (a) determining which word realizes the minimal translation length on the curve graph within a specific class of words, (b) giving a new class of pseudo-Anosov maps optimizing the ratio of stable translation lengths on the curve graph to that on Teichmüller space, (c) giving a partial answer of how much power is needed for Dehn twists to generate right-angled Artin subgroup of the mapping class group.

• Tunnel and Underground Space
• /
• v.15 no.5 s.58
• /
• pp.369-377
• /
• 2005

The stability of underground openings is a major concern for the safety and productivity of mining operations. Rock mass classification methods provide the basis of many empirical design methods as well as a basis for numerical analysis. Of the many factors which influence the stability of openings, the span of the opening for a given rock mass condition provides an important parameter of design. In this paper, the critical span curves proposed by Lang, the Mathews stability graph method and the modified critical span curve suggested by the authors have been assessed. The modified critical span curve was proposed by using Mathews stability graph method. The modified critical span curve by the author have been used to assess the stability of underground openings in several limestone mines.

• Journal of Computational Design and Engineering
• /
• v.3 no.1
• /
• pp.14-23
• /
• 2016

The problem of fitting B-spline curves to planar point clouds is studied in this paper. A novel method is proposed to deal with the most challenging case where multiple intersecting curves or curves with self-intersection are necessary for shape representation. A method based on Delauney Triangulation of data points is developed to identify connected components which is also capable of removing outliers. A skeleton representation is utilized to represent the topological structure which is further used to create a weighted graph for deciding the merging of curve segments. Different to existing approaches which utilize local shape information near intersections, our method considers shape characteristics of curve segments in a larger scope and is thus capable of giving more satisfactory results. By fitting each group of data points with a B-spline curve, we solve the problems of curve structure reconstruction from point clouds, as well as the vectorization of simple line drawing images by drawing lines reconstruction.

• Journal of the Chungcheong Mathematical Society
• /
• v.23 no.2
• /
• pp.251-256
• /
• 2010

In this article, we consider a minimal graph in $R^3$ which is bounded by a Jordan curve and a straight line. Suppose that the boundary is symmetric with the reflection under a plane, then we will prove that the minimal graph is itself symmetric under the reflection through the same plane.

• International Journal of Advanced Culture Technology
• /
• v.4 no.1
• /
• pp.19-27
• /
• 2016

Technology in the animation industry has evolved significantly over the past decade. The tools to create animation are becoming more intuitive to use. Animators now spend more time on the artistic quality of their work than wasting time figuring out how to use the software that they rely on. However, one particular tool that is still unintuitive for animators is the motion graph editor. A motion graph editor is a tool to manipulate the interpolation of the movements generated by the software. Although the motion graph editor contains a lot of options to control the outcome of the animation, the emotional rhythm of the movements desired by the animator still depends on the animator's skill, which requires a very steep learning curve. More often than not, animators had to resort to trial and error methods to achieve good results. This inevitably leads to slow productivity, susceptible to mistakes, and waste of resources. This research will study the connection between the motion graph profile and the emotions they portray in movements. The findings will hopefully be able to provide animators reference materials to achieve the emotional animation they need with less effort.

• Tunnel and Underground Space
• /
• v.18 no.4
• /
• pp.243-251
• /
• 2008

Recently, the mining methods are changing from surface mining to underground mining because of the increment of the environmental issues and legal regulations. Therefore, the stability of underground openings is a major concern for the safety and productivity of mining operations. In this paper, a survey of structural geology and discontinuities were carried out at a limestone mine. The relevant mechanical properties of rocks were determined by the laboratory tests and rock mass classifications (RMR and Q-system) for the mine design and input data for the stability analysis. The dimensions of unsupported span for underground openings and pillar were decided based on the RMR values of rock mass classifications. The stability analysis for the suggested mine design was examined through the empirical methods (stability graph method and critical span curve) and 3-D numerical analysis (Visual-FEA).

• Transactions of the Korean Society of Automotive Engineers
• /
• v.6 no.3
• /
• pp.34-44
• /
• 1998

It is clear that when an automobile negotiates a curve the lateral acceleration causes an increase in tire normal load for the wheels on the outside of the curve and a decrease in load for the inside wheels. However, just how the details of the suspension linkages and the parameters of the springs and shock absorbers affect the dynamics of the load transfer os not easily understood. One even encounters the false idea that since it is the compression and extension of the main suspension springs spring body role which largely determines the changes in normal load, of roll could be reduced, the load transfer would also be reduced. Using free body diagrams, one can explain quite clearly how the load is transferred for steady state cornering, and, using complex multibody models of particular vehicles one can simulate in good fidelity how load transfer occurs dynamically. Here we adopt a middle ground by using the concept of roll center and using a series of half-car bond graph models to point out main effects. Since bond graph junction structures automatically and consistently constrain geometric and force variables simultaneously, they can be used to point out hidden assumptions of other simplified vehicle models.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.7 no.1
• /
• pp.28-35
• /
• 1983

Quantitative analysis have been carried out on the micro-cracks on the surface and into the depth of unnotched smooth mild steel specimen under cyclic stains by rotating bending fatigue tests. Some of the results are; (1) Cracks initiate at the early stage of fatigue life N$_{I}$/ N$_{f}$=10 to 20%, and propagate during the rest of fatigue life. (2) Coalescence of highly crowded small fatigue cracks of random distribution seems to induce the final fracture at higher stress level. (3) The curves of crack initiation and the equal crack length on the graph of stress versus number of cycles are parallel to the S-N curve. (3) The curves of crack initiation and the equal crack length on the graph of stress versus number of cycles are parallel to the S-N curve. (4) The distributions of micro-surface crack length and depth show the composite Weibull distributions which are approximated to two straight lines separated by the value of transient region between stage I and stage II crack.k.k.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.27 no.2
• /
• pp.68-77
• /
• 2004

This paper considers the workforce assignment problem to minimize both the deviations of workloads assigned to workers and to maximize the total preference between each worker and each machine. Because of the high expense of technology education and the difficulties of firing employees, there is no part time workers in semiconductor industry. Therefore, multi-skilled workers are trained for performing various operations in several machines. The bicriteria workforce assignment problem in this paper is not easy to obtain the optimal solution considering the aisle structure and it is belong to NP-class. The proposed heuristic algorithms are developed based on the combination of spacefilling curve technique, simulated annealing technique and graph theory focusing on the multiple-row machine layout. Examples are presented for the proposed algorithms how to find a good solution.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.2
• /
• pp.41-50
• /
• 2004

Since the MPEG-4 visual standard enables content-based functionalities, it is necessary to extract video objects from video sequences. Segmentation algorithms can largely be classified into two different categories: automatic segmentation and user-assisted segmentation. In this paper, we propose a new user-assisted image segmentation method based on the active contour. If we define a shape space as a set of all possible variations from the initial curve and we assume that the shape space is linear, it can be decomposed into the column space and the left null space of the shape matrix. In the proposed method, the shape space vector in the column space describes changes from the initial curve to the imaginary feature curve, and a dynamic graph search algorithm describes the detailed shape of the object in the left null space. Since we employ the shape matrix and the SUSAN operator to outline object boundaries, the proposed algorithm can ignore unwanted feature points generated by low-level image processing operations and is, therefore, applicable to images of complex background. We can also compensate for limitations of the shape matrix with a dynamic graph search algorithm.