• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2008.10a
• /
• pp.308-311
• /
• 2008

The ant colony optimization (ACO) is a metaheuristic inspired by the behavior of real ants. Recently, ACO has been widely used to solve the difficult combinatorial optimization problems. In this paper, we propose an ACO algorithm to solve the two disjoint paths problem with dual link cost structure (TDPDCP). We propose a dual pheromone structure and a procedure for solution construction which is appropriate for the TDPDCP. Computational comparisons with the state-of-the-arts algorithms are also provided.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.5
• /
• pp.1193-1199
• /
• 1996

This paper introduces an algorithm which uses MUIO and the shortest paths to minimize the length of test sequence. The length of test sequence is equal to the total number of the edges in a symmetric test graph $G^{*}$. Therefore, it is important to make a $G^{*}$ with the least number of the edges. This algorithm is based on the one proposed Shen[2]. It needs the complexity to make shortest paths but reduces the thest sequence by 1.0~9.8% over the Shen's algorithm. and this technique, directly, derives a symmetric test graph from an FMS.

• The Bulletin of The Korean Astronomical Society
• /
• v.42 no.2
• /
• pp.59.4-59.4
• /
• 2017

We present a way of quantitatively characterizing solar active regions on the basis of their evolutionary paths. To determine characteristic properties of active regions with different sizes and configurations, we use a physics-based model to derive a relation between emerged magnetic flux and injected magnetic helicity (Flux-Helicity relation), the former of which gives scale information while the latter represents the magnetic field configuration of an active region. We demonstrate how this relation provides evolutionary paths of active regions and determines their characteristic properties, through a comparison with modeled active regions obtained from magnetohydrodynamic simulations.

• International Journal of CAD/CAM
• /
• v.4 no.1
• /
• pp.47-53
• /
• 2004

The subdivision surface is the limit of recursively refined polyhedral mesh. It is quite intuitive that the multi-resolution feature can be utilized to simplify generation of NC (Numerical Control) tool paths for rough machining. In this paper, a new method of parallel NC tool path generation for subdivision surfaces is presented. The basic idea of the method includes two steps: first, extending G-Buffer to a strip buffer (called S-Buffer) by dividing the working area into strips to generate NC tool paths for objects of large size; second, generating NC tool paths by parallel implementation of S-Buffer based on MPI (Message Passing Interface). Moreover, the recursion depth of the surface can be estimated for a user-specified error tolerance, so we substitute the polyhedral mesh for the limit surface during rough machining. Furthermore, we exploit the locality of S-Buffer and develop a dynamic division and load-balanced strategy to effectively parallelize S-Buffer.

• Journal of Information Technology Applications and Management
• /
• v.18 no.4
• /
• pp.41-53
• /
• 2011

Trust prediction between users in social network based on the trust propagation assumes properties of transitivity and composability of trust propagation. But it has been hard to find studies which test on how those properties have been operated in real social network. This study aims to validate if the longer the distance of trust paths and the less the numbers of trust paths, the higher prediction error occurs using two real social network data set. As a result, the longer the distance of trust paths, we can find higher prediction error when predicting level of trust between source and target users. But we can not find decreasing trend of prediction error though the possible number of trust paths between source and target users increases.

• Journal of the Korean Ceramic Society
• /
• v.49 no.3
• /
• pp.226-230
• /
• 2012

This paper presents a novel structure for a diesel particulate filter (DPF) with inclined gas paths, which was designed so that the gas paths offered a fluent flow of exhaust gases, and particulate matter (PM) was collected at pores formed in the body. The alumina porous filter was prepared by a conventional sintering process at $1200^{\circ}C$ for 2 h. Straight gas paths with $30^{\circ}$ of inclination from the gas flow direction were formed in the filter body. It is shown that this filter structure worked as a PM filter, in which 90.2% of soot filtration efficiency and 59.6 mbar of pressure drop were achieved.

• Journal of Korea Multimedia Society
• /
• v.18 no.9
• /
• pp.1083-1090
• /
• 2015

A generalized recursive circulant network(GR) is widely used in the design and implementation of local area networks and parallel processing architectures. In this paper, we investigate the routing of a message on this network, that is a key to the performance of this network. We would like to transmit maximum number of packets from a source node to a destination node simultaneously along paths on this network, where the i^th packet traverses along the i^th path. In order for all packets to arrive at the destination node securely, the i^th path must be node-disjoint from all other paths. For construction of these paths, employing the Hamiltonian Circuit Latin Square(HCLS), a special class of (n x n) matrices, we present O(n²) parallel routing algorithm on generalized recursive circulant networks.

• Journal of applied mathematics & informatics
• /
• v.4 no.2
• /
• pp.535-543
• /
• 1997

The application of Hadamard matrix to the paral-lel routings on the hypercube network was presented by Rabin. In this matrix every two rows differ from each other by exactly n/2 positions. A set of n disjoint paths on n-dimensional hypercube net-work was designed using this peculiar property of Hadamard ma-trix. Then the data is dispersed into n packets and these n packet are transmitted along these n disjoint paths. In this paper Rabin's routing algorithm is analyzed in terms of covering problem and as-signment problem. Finally we conclude that n packets dispersed are placed in well-distributed positions during transmisson and the ran-domly selected paths are almost a set of n edge-disjoint paths with high probability.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.12 no.3
• /
• pp.75-81
• /
• 2003

Pocket machining is metal removal operation commonly used for creating depressions in machined parts. Numerically controlled milling is the primary means for machining complex die surface. These complex surfaces are generated by a milling cutter which removes material as it traces out pre-specified tool paths. To machine, a component on a CNC machine, part programs which define the cutting tool path are needed. This tool path is usually planned from CAD, and converted to a CAM machine input format. In this paper I proposed a new method for generating NC tool paths. This method generates automatically NC tool paths with dynamic elimination of machining errors in 2$\frac{1}{2}$ arbitrary shaped pockets. This paper generates a spiral-like tool path by dynamic computing optimal pocket of the pocket boundary contour based on the type and size of the milling cutter, the geometry of the pocket contour and surface finish tolerance requirements. This part programming system is PC based and simultaneously generates a G-code file.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2006.04a
• /
• pp.387-392
• /
• 2006

3D-based information is needed increasingly as well as 2D Information as cities grow and buildings become large and complex, and use of 3D-models is getting attention to handle such problems. However, there are limitations in using 3D-models because most applications and research efforts using them have been for visual analysis. This study presents a method to find optimal paths in indoor spaces as an illustration for using 3D-models in spatial analysis. We modeled rooms, paths and other facilities in a building as individual 3D objects. We made it possible to find paths based on network structure by integrating the vector-based networks of 2D-GIS and 3D-model.