• 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.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.381-385
• /
• 2003

We consider the bandwidth parking problem arising from telecommunication networks The problem is to determine the set of calls to be routed and an assignment or them to the paths in arc capacitated network. The objective is to maximize profit. We formulate the problem as an integer programming and propose an algorithm to solve it. Column generation technique to solve the linear programming relxation is proposed with two types of columns in addition, to obtain an optimum integer solution, we consider a new branching strategy. Computational experiments show that the algorithm gives option at solutions within reasonably small time limits.

• Journal of Mechanical Science and Technology
• /
• v.15 no.12
• /
• pp.1822-1828
• /
• 2001

The experiment for the sympathetic detonation (Sudo et al., 1951) (Fukuyama et al., 1958) in water was conducted. Composition B (RDX: 64%, TNT: 36%, Detonation velocity: 7900m/s) was used for both donor (the thickness was 50mm, and the diameter was 31mm) and receptor charges. The distance between the donor and the receptor, and the thickness (5, 7.5, 10mm) of the receptor were varied in the experiments. In order to investigate the basic characteristics of the underwater sympathetic detonation of high explosive, the sympathetic detonation phenomena were visualized by a high-speed camera (HADLAND PHOTONICS, IMACON790) in forms of streak and framing photographs. The 200ns/mm streak velocity was 2㎲. Manganin gauges (KYOWA Electronic INSTRUMENTS CO. SKF-21725) were used for the pressure measurements. The gauges were set under the receptor. The pressures during the complete and incomplete explosions were measured.

• Management Science and Financial Engineering
• /
• v.12 no.2
• /
• pp.37-62
• /
• 2006

This paper considers the problem of designing logical tunnels in virtual private networks considering QoS guarantee which restricts the number of tunnel hops for each traffic routing. The previous researches focused on the design of logical tunnel itself and Steiner-tree based solution algorithms were proposed. However, we show that for some objective settings it is not sufficient and is necessary to consider both physical and logical connectivity at the same time. Thereupon, the concept of the layered network is applied to the logical tunnel design problem in virtual private networks. The layered network approach considers the design of logical tunnel as well as its physical routing and we propose a modified branch-and-price algorithm which is known to solve layered network design problems effectively. To show the performance of the proposed algorithm, computational experiments have been done and the results show that the proposed algorithm solves the given problem efficiently and effectively.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.27 no.4
• /
• pp.87-109
• /
• 2002

A satisfiability problem in propositional logic is the problem of checking for the existence of a set of truth values of atomic prepositions that renders an input propositional formula true. This paper describes an empirical investigation of a particular integer programming approach, using the set covering model, to solve satisfiability problems. Our satisfiability engine, SETSAT, is a fully integrated, linear programming based, branch and bound method using various symbolic routines for the reduction of the logic formulas. SETSAT has been implemented in the integer programming shell MINTO which, in turn, uses the CPLEX linear programming system. The logic processing routines were written in C and integrated into the MINTO functions. The experiments were conducted on a benchmark set of satisfiability problems that were compiled at the University of Ulm in Germany. The computational results indicate that our approach is competitive with the state of the art.

• Journal of Biomedical Engineering Research
• /
• v.29 no.5
• /
• pp.348-354
• /
• 2008

Segmenting vessels in lower extremity CT images is very difficult because of gray level variation, connection to bones, and their small sizes. Instead of segmenting vessels, we propose an approach that segments bones and subtracts them from the original CT images. The subtracted images can contain not only connected vessel structures but also isolated vessels, which are very difficult to detect using conventional vessel segmentation methods. The proposed method initially grows a 3-dimensional (3D) volume with a seeded region growing (SRG) using an adaptive threshold and then detects junctions and forked branches. The forked branches are classified into either bone branches or vessel branches based on appearance, shape, size change, and moving velocity of the branch. The final volume is re-grown by collecting connected bone branches. The algorithm has produced promising results for segmenting bone structures in several tens of vessel-enhanced CT image data sets of lower extremities.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.31 no.2
• /
• pp.80-93
• /
• 2008

This paper improves algorithms for an assembly-type flowshop scheduling problem in which each job is to assemble two types of components and makespan is the objective measure. For the assembly, one type of the components is outsourced with job-dependent lead time but the other type is fabricated in-house. When both components for a job are prepared, the assembly operation for the job can be started. This problem had been proved to be NP-Complete, so branch-and-bound (B&B) and heuristic algorithms have already been developed. In this paper, we suggest other dominance rules, lowerbound and heutistic algorithms. Also, we develop a new B&B algorithm using these improved bound and dominance rules. The suggested heuristics and B&B algorithm are compared with existing algorithms on randomly-generated test problems.

• Structural Engineering and Mechanics
• /
• v.55 no.1
• /
• pp.205-228
• /
• 2015

The results of a numerical investigation pertaining to the hysteretic behaviour of concrete filled steel tubular (CFT) column to I-beam connections are discussed in detail. Following the verification of the numerical results against the available experimental tests, the nonlinear finite element (FE) analysis was implemented to evaluate the effects of different parameters including the column axial load, beam lateral support, shape and arrangement of stiffeners, stiffness of T-stiffeners, and the number of shear stiffeners. Pursuing this objective, an external CFT column to beam connection, tested previously, was selected as the case-study. The lateral forces on the structure were simulated, albeit approximately, using an incremental cyclic loading reversal applied at the beam tip. The results were compared in terms of hysteretic load-displacement curves, stress distributions in connection, strength, rotation, and energy dissipation capacity. It was shown that external T-stiffeners combined with internal shear stiffeners play an important role in the hysteretic performance of CFT columns to I-beam connections.

• Journal of the Korean Chemical Society
• /
• v.55 no.4
• /
• pp.633-637
• /
• 2011

Iron (III) phosphate was employed as an efficient catalyst for the chemo selective acetylation of alcohols and phenols under solvent free condition at room temperature and with high yields. Iron (III) phosphate is also a potential green catalyst due to solid intrinsically, reusable and with high catalytic activity.

• Journal of Navigation and Port Research
• /
• v.28 no.2
• /
• pp.129-133
• /
• 2004

Column subtraction, originally proposed by Harche and Thompson(1994), is an exact method for solving large set covering, packing and partitioning problems. Since the constraint set of ship scheduling problem(SSP) have a special structure, most instances of SSP can be solved by LP relaxation This paper aim, at applying the column subtraction method to solve SSP which am not be solved by LP relaxation For remained instances of unsolvable ones, we subtract columns from the finale simplex table to get another integer solution in an iterative manner. Computational results having up to 10,000 0-1 variables show better performance of the column subtraction method solving the remained instances of SSP than complex branch and-bound algorithm by LINDO.