• Proceedings of the KIEE Conference
• /
• 1990.11a
• /
• pp.235-238
• /
• 1990

This paper presents a method of finding the optimal path of which is considered the switching cost and the reliability index. The problem is formulated as an optimization problem and solved by the maximum flow/mimimum cut method. The objective of this paper is to find the optimal path and minimize the failure cost and switching cost. Presented method has been simulated and the results are discussed.

• Proceedings of the Korean Reliability Society Conference
• /
• 2001.06a
• /
• pp.455-462
• /
• 2001

We propose a new method to evaluate the network reliability which greatly reduces the intermediate steps toward calculations of maximum capacity flow by excluding unnecessary simple paths contained in the set of failure simple paths. By using signed simple paths and signed flow, we show that our method is more efficient than that of Lee and Park (2001a) in the number of generated composite paths and in the procedure for obtaining minimal success composite paths. Numerical examples are given to illustrate the use and the efficiency of the method.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2001.05a
• /
• pp.49-53
• /
• 2001

Recently hydroforming process became a process which is increasingly applied in the automotive industry. As the hydroforming process is a new technology, there is no abundant data to assist manufacturing the products. To investigate the effects of process parameters on the tube hydroforming process, simple bulging, circular bulging and Tee-fitting tests are performed. The optimal leading path to escape the failure modes(bursting, wrinkling) is determined and the effects of the process parameters, the internal pressure and axial feeding on the product quality, such as thickness distribution, forming height and branch dome shape are investigated.

• Journal of information and communication convergence engineering
• /
• v.13 no.4
• /
• pp.248-256
• /
• 2015

With the dramatic increase in mobile traffic in recent years, some of the limitations of mobility management frameworks have magnified. The current centralized mobility management (CMM) strategy has various problems, such as a suboptimal routing path, low scalability, signaling overhead, and a single point of failure. To overcome these weaknesses in the CMM strategy, the Internet Engineering Task Force has been discussing distributed mobility management (DMM) strategies. The fundamental concept of a DMM strategy is to distribute the mobility anchors closer to the users. While the distribution of mobility anchors results in low-cost traffic delivery, it increases the signaling cost. To reduce this higher signaling cost, we propose a new DMM strategy applying the pointer forwarding technique. The proposed strategy keeps the existing tunnels and extends the traffic path as much as possible. In this paper, we analyze the performance of the pointer forwarding-DMM strategy and discuss its pros and cons.

• Proceedings of the KSME Conference
• /
• 2003.11a
• /
• pp.424-429
• /
• 2003

Hot gas path components, which are made of nickel based superalloys, are subject to periodic replacement due to degradation of thermomechanical properties that might bring catastrophic failure during normal operation of gas turbine units. In order to rejuvenate the metallurgical condition of the serviced components, heat treating techniques such as solution annealing and aging heat treatments have widely been employed. However, the effectiveness of those typical heat treatments is not apparent enough in terms of quantitative grounds. On the other hand the demand of the rejuvenation heat treatment and hot isostatic pressing (HIP) have constantly been raised by the end users. Therefore it is necessary to verify how the typical heat treating techniques affect to the aged and degraded material. As the result of experimental work in this study, GTD-111 and GTD-222 Ni-based superalloys were collected and analyzed quantitatively through microscopic observation, microhardness evaluation and creep test.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.167-168
• /
• 2006

Mobile Ad Hoc Networks (MANETs) has the characteristics such as dynamic network topology, constrained power capacity, constrained wireless bandwidth and quality, etc. For MANETs AODV (Ad-Hoc On-Demand Distance Vector) routing protocol has been proposed. However AODV routing protocol has some inefficiency related to re-routing path establishment corresponding to node's failure. In this paper, we propose a Self-Healing Routing Technique for MANETs that uses the one-hop nodes from the failed node to set up the routing path efficiently. We also include simulation results to show the performance of our method.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.24 no.63
• /
• pp.33-43
• /
• 2001

To estimate the reliability of a large and complex network with a small variance, we propose two dynamic Monte Carlo sampling methods: the sequential minimal cut set (SMCS) and the sequential minimal path set (SMPS) methods. These methods do not require all minimal cut sets or path sets to be given in advance and do not simulate all arcs at each trial, which can decrease the valiance of network reliability. Based on the proposed methods, we develop the importance sampling estimators, the total hazard (or safety) estimator and the hazard (or safety) importance sampling estimator, and compare the performance of these simulation estimators. It is found that these estimators can significantly reduce the variance of the raw simulation estimator and the usual importance sampling estimator. Especially, the SMCS algorithm is very effective in case that the failure probabilities of arcs are low. On the contrary, the SMPS algorithm is effective in case that the success Probabilities of arcs are low.

• Structural Engineering and Mechanics
• /
• v.36 no.5
• /
• pp.529-544
• /
• 2010

Nonlinear equations of structures are generally solved numerically by the iterative solution of linear equations. However, this iterative procedure diverges when the tangent stiffness is ill-conditioned which occurs near limit points. In other words, a major challenge with simple iterative methods is failure caused by a singular or near singular Jacobian matrix. In this paper, using the Newton-Raphson algorithm based on Davidenko's equations, the iterations can traverse the limit point without difficulty. It is argued that the propose algorithm may be both more computationally efficient and more robust compared to the other algorithm when tracing path through severe nonlinearities such as those associated with structural collapse. Two frames are analyzed using the proposed algorithm and the results are compared with the previous methods. The ability of the proposed method, particularly for tracing the limit points, is demonstrated by those numerical examples.

• Journal of KIISE:Information Networking
• /
• v.27 no.2
• /
• pp.187-196
• /
• 2000

Failures in ATM networks can occur at virtual path (VP) links, virtual path switches, and virtual channel (VC) switches. Restoration schemes have been proposed for VP link and VP switch failures, however, none for VC switch failures. In general, VC switches are used for edge nodes in protection domains. Since even only one VC switch failure can cause a critical problem, new restoration schemes for VC switch failures are highly required. Restoration schemes at the VP level proposed so far can be categorized into those using the flooding algorithm and those using the backup virtual path (BVP) concept. Even though the latter cannot handle unpredictable failures, it has some advantages such as fast restoration and low spare capacity requirement. In this paper, we propose new restoration schemes using a new type of BVPs to handle VC switch failures. The simulation results show that the proposed schemes can restore virtual connection failures due to VC switch failures without degrading restorability for VP failures.

• Restorative Dentistry and Endodontics
• /
• v.40 no.2
• /
• pp.123-127
• /
• 2015

Objectives: Glide path preparation is recommended to reduce torsional failure of nickel-titanium (NiTi) rotary instruments and to prevent root canal transportation. This study evaluated whether the repetitive insertions of G-files to the working length maintain the apical size as well as provide sufficient lumen as a glide path for subsequent instrumentation. Materials and Methods: The G-file system (Micro-Mega) composed of G1 and G2 files for glide path preparation was used with the J-shaped, simulated resin canals. After inserting a G1 file twice, a G2 file was inserted to the working length 1, 4, 7, or 10 times for four each experimental group, respectively (n = 10). Then the canals were cleaned by copious irrigation, and lubricated with a separating gel medium. Canal replicas were made using silicone impression material, and the diameter of the replicas was measured at working length (D0) and 1 mm level (D1) under a scanning electron microscope. Data was analysed by one-way ANOVA and post-hoc tests (p = 0.05). Results: The diameter at D0 level did not show any significant difference between the 1, 2, 4, and 10 times of repetitive pecking insertions of G2 files at working length. However, 10 times of pecking motion with G2 file resulted in significantly larger canal diameter at D1 (p < 0.05). Conclusions: Under the limitations of this study, the repetitive insertion of a G2 file up to 10 times at working length created an adequate lumen for subsequent apical shaping with other rotary files bigger than International Organization for Standardization (ISO) size 20, without apical transportation at D0 level.