• The KIPS Transactions:PartC
• /
• v.11C no.5
• /
• pp.677-682
• /
• 2004

In the present paper routing and wavelength assignment (RWA) in optical WDM networks is considered. Previous techniques based on the combination of integer linear programming and graph coloring are complex and require extensive use of heuristics. Such methods are mostly slow and sometimes impossible to get results due to infeasibility. An alternative approach applied to RWA employs on the greedy algorithm for obtaining the maximum edge disjoint paths. Even though this approach is fast, it produces a solution for any connection request, which is very far from the optimal utilization of wavelengths. We propose a novel algorithm, which is based on the maximum flow technique to obtain the maximum quantity of edge, disjoint paths. Here we compare the offered method with previous maximum edge disjoint paths algorithms ap plied to the RWA.

• Journal of Forest and Environmental Science
• /
• v.37 no.3
• /
• pp.260-268
• /
• 2021

This study was conducted to grasp users' preferences and behavior of forest paths and to provide basic data for forest path construction in the future. Among forest path users, males and females over 20 years old were surveyed on forest path preferences, motives for visiting, using time and distance, companions, and sources for obtaining information on forest paths. A total of 587 people participated in the questionnaire, and cross-analysis was conducted simultaneously using the SPSS statistical program. In analyzing the preference of forest paths, it was found that male and the general public preferred trekking path for activities while female and foresters preferred forest path for relaxation and healing (p<0.05). As for the motives for visiting forest paths, the response that they visited for a walk/rest was the highest in gender, occupation, and age group. As for the number of annual visits, less than 5 was the highest in overall, and foresters tended to visit forest path more often than the general public, and the number of visits to the forest paths increased with age (p<0.01). The most common route to acquire information about forest paths is the Internet, while the Internet use is relatively low in those over 60s (p<0.05). The response ratio of accompanying their family in visiting forest paths were the highest, while the response in their 20s and 60s was the most in accompanying their friends (p<0.05).

• Nuclear Engineering and Technology
• /
• v.56 no.1
• /
• pp.132-140
• /
• 2024

In the event of a severe accident in Sodium Cooled Fast Reactors (SFR), the sodium combustion aerosols along with fission product aerosols would migrate to the environment through leak paths of the Reactor Containment Building (RCB) concrete wall under positive pressure. Understanding the characteristics of sodium aerosol transport through concrete leak paths is important as it governs the environmental source term. In this context, experiments are conducted to study the influence of various parameters like pressure, initial mass concentration, leak path diameter, humidity etc., on the transport and deposition of sodium aerosols in straight leak paths of concrete. The leak paths in concrete specimens are prepared by casting and the diameter of the leak path is measured using thermography technique. Aerosol transport experiments are conducted to measure the transported and plugged aerosol mass in the leak paths and corresponding plugging times. The values of differential pressure, aerosol concentration and relative humidity taken for the study are in the ranges 10-15 kPa, 0.65-3.04 g/m³ and 30-90% respectively. These observations are numerically simulated using 1-Dimensional transport equation. The simulated values are compared with the experimental results and reasonable agreement among them is observed. From the safety assessment view of reactor, the approach presented here is conservative as it is with straight leak paths.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.11
• /
• pp.181-188
• /
• 2019

The migration path of a multiple-generation technology that occurs during a technological substitution by a new technology is important to understanding the phenomenon of technological substitution, and can contribute to understanding the process of technological innovation. This research defines the concept of migration path and develops a model of the types of migration paths by multiple dimensions (actor, generation, and time) in a multiple-generation technology. Based on a literature review and tracking of migration paths according to multiple dimensions, the definitions and types of migration paths were provided, and the accuracy of the model was verified based on a case study of the semiconductor industry. The migration paths of suppliers are modeled with three types (switching, leapfrogging, and new entrance paths), and the migration paths of customers are modeled with four types (switching, leapfrogging, new entrance, and diffusion paths) in a multiple-generation technology. This research will be useful for understanding the migration paths in the phenomenon of technological substitution, and can be applied to other industries in addition to the semiconductor industry, including various actors. In addition, suppliers and customers can understand technological substitution and can establish a technology strategy against their competitors.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.5_6
• /
• pp.176-186
• /
• 2007

An interconnection network can be represented as a graph where a vertex corresponds to a node and an edge corresponds to a link. The diameter of an interconnection network is the maximum length of the shortest paths between all pairs of vertices. The fault diameter of an interconnection network G is the maximum length of the shortest paths between all two fault-free vertices when there are $_k(G)-1$ or less faulty vertices, where $_k(G)$ is the connectivity of G. The fault diameter of an R-regular graph G with diameter of 3 or more and connectivity ${\tau}$ is at least diam(G)+1 where diam(G) is the diameter of G. We show that the fault diameter of a 2-dimensional $m{\times}n$ torus with $m,n{\geq}3$ is max(m,n) if m=3 or n=3; otherwise, the fault diameter is equal to its diameter plus 1. We also show that in $d({\geq}3)$-dimensional $k_1{\times}k_2{\times}{\cdots}{\times}k_d$ torus with each $k_i{\geq}3$, there are 2d mutually disjoint paths joining any two vertices such that the lengths of all these paths are at most diameter+1. The paths joining two vertices u and v are called to be mutually disjoint if the common vertices on these paths are u and v. Using these mutually disjoint paths, we show that the fault diameter of $d({\geq}3)$-dimensional $k_1{\times}k_2{\times}{\cdots}{\times}k_d$ totus with each $k_i{\geq}3$ is equal to its diameter plus 1.

• Structural Engineering and Mechanics
• /
• v.49 no.5
• /
• pp.597-618
• /
• 2014

For the structures containing multiple discontinuities (voids, inclusions, and cracks), the simulation technologies in the framework of extended finite element method (XFEM) are discussed in details. The level set method is used for representing the location of inner discontinuous interfaces so that the mesh does not need to align with these discontinuities. Several illustrations have been given to verify that the implemented XFEM program is effective. Then, the implemented XFEM program is used to investigate the effects of the voids, inclusions, and minor cracks on the path of major crack propagation. For a plate containing cracks and voids, two possibly crack path can be observed: i) the crack propagates into the void; ii) the crack initially curves towards the void, then, the crack reorients itself and propagates along its original orientation. For a plate with a soft inclusion, the final predicted crack paths tend to close with the inclusion, and an evident difference of crack paths can be observed with different inclusion material properties. However, for a plate with a hard inclusion, the paths tend to away from the inclusion, and a slightly difference of crack paths can only be seen with different inclusion material properties. For a plate with several minor cracks, the trend of crack paths can still be described as that the crack initially curves towards these minor cracks, and then, the crack reorients itself and propagates almost horizontally along its original orientation.

• ETRI Journal
• /
• v.31 no.5
• /
• pp.534-544
• /
• 2009

Finding link-disjoint or node-disjoint paths under multiple constraints is an effective way to improve network QoS ability, reliability, and so on. However, existing algorithms for such scheme cannot ensure a feasible solution for arbitrary networks. We propose design principles of an algorithm to fill this gap, which we arrive at by analyzing the properties of optimal solutions for the multi-constrained link-disjoint path pair problem. Based on this, we propose the link-disjoint optimal multi-constrained paths algorithm (LIDOMPA), to find the shortest link-disjoint path pair for any network. Three concepts, namely, the candidate optimal solution, the contractive constraint vector, and structure-aware non-dominance, are introduced to reduce its search space without loss of exactness. Extensive simulations show that LIDOMPA outperforms existing schemes and achieves acceptable complexity. Moreover, LIDOMPA is extended to the node-disjoint optimal multi-constrained paths algorithm (NODOMPA) for the multi-constrained node-disjoint path pair problem.

• Journal of Korean Institute of Industrial Engineers
• /
• v.32 no.3
• /
• pp.226-235
• /
• 2006

Telematics is expected to be one of the fastest growing businesses in information technology area. It may create a new emerging market in industry related to automotive, telecommunications, and information services. Especially vehicle navigation service is considered as a killer application among telematics service applications. The current vehicle navigation service typically recommends a single path that is based on the traveling time or distance from the origin to the destination. The system provides two options for users to choose either via highway or via any road. Since the traffics and road conditions of big cities are very complicated and dynamic, the demand of multi-path guidance system is increasing in telematics market. The multi-path guidance system should allow drivers to choose a path based on their individual preferences such as traveling time, distance, or route familiarity. Using the Lawler's algorithm, it is possible to find multiple paths; however, due to the lengthy computational time, it is not suitable for the real-time services. This study suggests a computationally feasible and efficient heuristic multiple paths finding algorithm that is reliable for the real-time vehicle navigation services.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.9_10
• /
• pp.421-428
• /
• 2008

A. Ghafoor proposed Even networks as a class of fault-tolerant multiprocessor networks in [1] and analyzed so many useful properties include node disjoint paths. By introducing node disjoint paths in [1], fault diameter of Even networks is d+2(d=odd) and d+3(d=even). But the lengths of node disjoint paths proved in [1] are not the shortest. In this paper, we show that Even network Ed is node symmetric. We also propose the shortest lengths of node disjoint paths using cyclic permutation, and fault diameter of Even networks is d+1.

• Communications for Statistical Applications and Methods
• /
• v.27 no.3
• /
• pp.385-395
• /
• 2020

We present a new maximum likelihood approach to estimate demographic history using genomic data sampled from two populations. A demographic model such as an isolation-with-migration (IM) model explains the genetic divergence of two populations split away from their common ancestral population. The standard probability model for an IM model contains a latent variable called genealogy that represents gene-specific evolutionary paths and links the genetic data to the IM model. Under an IM model, a genealogy consists of two kinds of evolutionary paths of genetic data: vertical inheritance paths (coalescent events) through generations and horizontal paths (migration events) between populations. The computational complexity of the IM model inference is one of the major limitations to analyze genomic data. We propose a fast maximum likelihood approach to estimate IM models from genomic data. The first step analyzes genomic data and maximizes the likelihood of a coalescent tree that contains vertical paths of genealogy. The second step analyzes the estimated coalescent trees and finds the parameter values of an IM model, which maximizes the distribution of the coalescent trees after taking account of possible migration events. We evaluate the performance of the new method by analyses of simulated data and genomic data from two subspecies of common chimpanzees in Africa.