• International Journal of Precision Engineering and Manufacturing
• /
• v.3 no.3
• /
• pp.76-81
• /
• 2002

In order to study the fatigue crack and retardation mechanism in variable loading, the effects of crack tip branching in crack growth retardation were examined. The characteristics of crack tip branching behavior were considered with respect to microstructure and crack tip branching angle was examined. Crack tip branching was observed along the grain boundary of finite and pearlite structure. It was found that the branching angle ranges from 25 to 53 degrees. Using the finite element method, the variable of crack driving farce to branching angle was examined. The effective crack driving farce (K$\_$eff/) decreased as the branching angle increased. The rate of decrease was 33% for kinked type and 29% for forked one. It was confirmed that the effect of crack tip branching is a very important factor in crack growth retardation. Therefore, crack branching effect should be considered in building the hypothetical model to predict crack growth retardation.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.2
• /
• pp.123-134
• /
• 2000

This paper addresses a new triangulation method for constructing surface model from a set of wire-frame contours. The most important problem of contour triangulation is the branching problem, and we provide a new solution for the double branching problem, which occurs frequently in real data. The multiple branching problem is treated as a set of double branchings and an algorithm based on contour merging is developed. Our double branching algorithm is based on partitioning of root contour by Toussiant's polygon triangulation algorithml[14]. Our double branching algorithm produces quite natural surface model even if the branch contours are very complicate in shape. We treat the multiple branching problem as a problem of coarse section sampling in z-direction, and provide a new multiple branching algorithm which iteratively merge a pair of branch contours using imaginary interpolating contours. Our method is a natural and systematic solution for the general branching problem of contour triangulation. The result shows that our method works well even though there are many complicated branches in the object.

• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.452-472
• /
• 2005

We propose XIR-Branching, a novel method for processing partial match queries on heterogeneous XML documents using information retrieval(IR) techniques and novel instance join techniques. A partial match query is defined as the one having the descendent-or-self axis '//' in its path expression. In its general form, a partial match query has branch predicates forming branching paths. The objective of XIR-Branching is to efficiently support this type of queries for large-scale documents of heterogeneous schemas. XIR-Branching has its basis on the conventional schema-level methods using relational tables(e.g., XRel, XParent, XIR-Linear[21]) and significantly improves their efficiency and scalability using two techniques: an inverted index technique and a novel prefix match join. The former supports linear path expressions as the method used in XIR-Linear[21]. The latter supports branching path expressions, and allows for finding the result nodes more efficiently than containment joins used in the conventional methods. XIR-Linear shows the efficiency for linear path expressions, but does not handle branching path expressions. However, we have to handle branching path expressions for querying more in detail and general. The paper presents a novel method for handling branching path expressions. XIR-Branching reduces a candidate set for a query as a schema-level method and then, efficiently finds a final result set by using a novel prefix match join as an instance-level method. We compare the efficiency and scalability of XIR-Branching with those of XRel and XParent using XML documents crawled from the Internet. The results show that XIR-Branching is more efficient than both XRel and XParent by several orders of magnitude for linear path expressions, and by several factors for branching path expressions.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.8 no.2
• /
• pp.126-136
• /
• 1999

We studied on crack growth retardation in single overloading condition. Crack tip branching which as the second mechanism on crack growth retardation was examined. Crack tip branching was observed to kinked type and forked type. It was found that the branching angle range was from 25 to 53 degree. The variations of crack driving force with branching angle were calculated with finite element method The variation of {{{{ KAPPA _I}}}}, {{{{ KAPPA _II}}}} and total crack driving force(K) were examined respectively So {{{{ KAPPA _I}}}}, {{{{ KAPPA _II}}}} and K mean to mode I, II and total crack driving force. Present model(Willenborg's model) for crack growth retardation prediction was modified to take into consideration the effects of crack tip branching When we predicted retardation with modified model. it was confirmed that predicted and experimental results coincided with well each other.

• Journal of the Korean Society for Precision Engineering
• /
• v.14 no.6
• /
• pp.83-89
• /
• 1997

In order to study on fatigue crack retardation and retardation mechanism in variable loading, the effects of crack tip branching in fatigue crack growth retardation were examined. The characteristics of crack tip banching behavior was considered to micro structure. It was examined that the variation of crack tip branching angle. Crack tip branching was observed along the grain boundary of ferrite and pearlite structure. It was found that the abanching angle ranges from 25 to 53 degrees. Using the finite element method, the variable of crack driving force to branching angle was examined. The effective crack driving force ( $K_{\eff}$ ) decreased as the braching angle increases. The rate of decrease was 33% for the kinked type and 29% for the forked one. It was confirmed that the effect of crack tip branching is a very important factor in fatigue crack growth retardation. Therefore, crack branching effect should be considered building the hypoth- etical model to predict crack growth retardation.

• Journal of the Korean Society for Precision Engineering
• /
• v.20 no.4
• /
• pp.174-182
• /
• 2003

Recently, medical imaging has taken interest on CAD based solution for anatomical part fabrication or finite element analysis of human body. In principle, contours representing object boundary are obtained through image processing techniques. Surface models are then approximated by a skinning method. For this, various methods should be applied to medical images and contours. The major bottleneck of the reconstruction is to remove shape inconsistency between contours and to generate the branching surface. In order to solve these problems, bi-directional smoothing and the composite contour generation method are proposed. Bi-directional smoothing has advantage of removing the shape inconsistency between contours and minimizing shrinkage effect with a large number of iterations. The composite contour by the proposed method ensures smooth transition in branching region.

• International Journal of CAD/CAM
• /
• v.12 no.1
• /
• pp.29-37
• /
• 2012

A new algorithm has been developed to construct surface from the contours having branches and the final smooth surface is obtained by the reversible Catmull-Clark subdivision. In branching, a particular layer has more than one contour that correspond with at least one contour at the adjacent layer. In the next step, three-dimensional composite curve is constructed from contours of a layer having correspondence with at least one contour at the adjacent layer by inserting points between them and joining the contours. The points are inserted in such a way that the geometric center of the contours should merge at the center of the contours at the adjacent layer. This process is repeated for all layers having branching problems. Polyhedra are constructed in the next step with the help of composite curves and the contours at adjacent layer. The required smooth surface is obtained in the proposed work by providing the level of smoothness.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.36 no.4
• /
• pp.361-371
• /
• 2012

In order to improve the efficiency of the branch-and-bound method for mixed-discrete nonlinear programming, a nonuniform convergence tolerance scheme is proposed for the continuous subproblem optimizations. The suggested scheme assigns the convergence tolerances for each continuous subproblem optimization according to the maximum constraint violation obtained from the first iteration of each subproblem optimization in order to reduce the total number of function evaluations needed to reach the discrete optimal solution. The proposed tolerance scheme is integrated with five branching order options. The comparative performance test results using the ten combinations of the five branching orders and two convergence tolerance schemes show that the suggested non-uniform convergence tolerance scheme is obviously superior to the uniform one. The results also show that the branching order option using the minimum clearance difference method performed best among the five branching order options. Therefore, we recommend using the "minimum clearance difference method" for branching and the "non-uniform convergence tolerance scheme" for solving discrete optimization problems.

• International journal of advanced smart convergence
• /
• v.10 no.2
• /
• pp.64-72
• /
• 2021

XML message brokers have a lot of importance because XML has become a practical standard for data exchange in many applications. Message brokers covered in this document store many users. This paper is a study of the processing of twig pattern queries in XML documents using branching node streams in XML message broker structures. This work is about query processing in XML documents, especially for query processing with XML twig patterns in the XML message broker structure and proposed a method to reduce query processing time when parsing documents with XML twig patterns by processing information. In this paper, the twig pattern query processing method of documents using the branching node stream removes the twigging value of the branch node that does not include the labeling value of the branch node stream when it receives a twig query from the client. In this paper, the leaf node discovery time can be reduced by reducing the navigation time of nodes in XML documents that are matched to leaf nodes in twig queries for client twig queries. Overall, the overall processing time to respond to queries is reduced, allowing for rapid question-answer processing.

• Korean Management Science Review
• /
• v.26 no.3
• /
• pp.1-9
• /
• 2009

In this paper, we present mathematical models for the ring covering problems arising in the design of multi-ring WDM networks. Also, we present efficient algorithms to solve the suggested models. By the computational experiment, our model can solve the medium-sized networks efficiently and shows better performance than the existing heuristic method. Although we propose an efficient method for the column generation procedure, branching rule that does not destroy the column generation structure is unsolved. Further research is required to develop an effective branching rule.