• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.2
• /
• pp.35-42
• /
• 2014

This paper suggests a method that obtains the minimum spanning tree (MST) far more easily and rapidly than the present ones. The suggested algorithm, firstly, simplifies a graph by means of reducing the number of edges of the graph. To achieve this, it applies a method of eliminating the maximum weight edge if the valency of vertices of the graph is equal to or more than 3. As a result of this step, we can obtain the reduced edge population. Next, it applies a method in which the maximum weight edge is eliminated within the cycle. On applying the suggested population minimizing and maximum weight edge deletion algorithms to 9 various graphs, as many as the number of cycles of the graph is executed and MST is easily obtained. It turns out to lessen 66% of the number of cycles and obtain the MST in at least 2 and at most 8 cycles by only deleting the maximum weight edges.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2005.09a
• /
• pp.228-233
• /
• 2005

The protein side-chain packing problem (SCPP) is known to be NP-complete. Various graph theoretic based side-chain packing algorithms have been proposed. However as the size of the protein becomes larger, the sampling space increases exponentially. Hence, one approach to cope with the time complexity is to decompose the graph of the protein into smaller subgraphs. Some existing approaches decompose the graph into biconnected components at an articulation point (resulting in an at-most 21-residue subgraph) or solve the SCPP by tree decomposition (4-, 5-residue subgraph). In this regard, we had also presented a deterministic based approach called as SPWCQ using the notion of maximum edge weight clique in which we reduce SCPP to a graph and then obtain the maximum edge-weight clique of the obtained graph. This algorithm performs well for a protein of less than 500 residues. However, it fails to produce a feasible solution for larger proteins because of the size of the search space. In this paper, we present a new heuristic approach for the side-chain packing problem based on the maximum edge-weight clique finding algorithm that enables us to compute the side-chain packing of much larger proteins. Our new approach can compute side-chain packing of a protein of 874 residues with an RMSD of 1.423${\AA}$.

• International Journal of Highway Engineering
• /
• v.17 no.6
• /
• pp.37-45
• /
• 2015

PURPOSES : The purpose of this study is to validate the design criteria of the concrete modular road system, which is a new semi-bridge-type concept road, through a comparison of numerical analysis results and actual loading test results under static axial loads. METHODS : To design the semi-bridge-type modular road, both the bridge design code and the concrete structural design code were adopted. The standard truck load (KL-510) was applied as the major traffic vehicle for the design loading condition. The dimension of the modular slab was designed in consideration of self-weight, axial load, environmental load, and combined loads, with ultimate limit state coefficients. The ANSYS APDL (2010) program was used for case studies of center and edge loading, and the analysis results were compared with the actual mock-up test results. RESULTS : A full-scale mock-up test was successfully conducted. The maximum longitudinal steel strains were measured as about 35 and 83.5 micro-strain (within elastic range) at center and edge loading locations, respectively, under a 100 kN dual-wheel loading condition by accelerating pavement tester. CONCLUSIONS : Based on the results of the comparison between the numerical analysis and the full-scale test, the maximum converted stress range at the edge location is 32~51% of the required standard flexural strength under the two times over-weight loading condition. In the case of edge loading, the maximum converted stresses from the Westergaard equation, the ANSYS APDL analysis, and the mock-up test are 1.95, 1.7, and 2.3 times of that of the center loading case, respectively. The primary reason for this difference is related to the assumption of the boundary conditions of the vertical connection between the slab module and the crossbeam module. Even though more research is required to fully define the boundary conditions, the proposed design criteria for the concrete modular road finally seems to be reasonable.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.3
• /
• pp.107-113
• /
• 2015

This paper presents a polynomial time algorithm to the minimum cardinality feedback edge set and minimum weight feedback edge set problems. The algorithm makes use of the property wherein the sum of the minimum spanning tree edge set and the minimum feedback edge set equals a given graph's edge set. In other words, the minimum feedback edge set is inherently a complementary set of the former. The proposed algorithm, in pursuit of the optimal solution, modifies the minimum spanning tree finding Kruskal's algorithm so as to arrange the weight of edges in a descending order and to assign cycle-deficient edges to the maximum spanning tree edge set MXST and cycle-containing edges to the feedback edge set FES. This algorithm runs with linear time complexity, whose execution time corresponds to the number of edges of the graph. When extensively tested on various undirected graphs both with and without the weighed edge, the proposed algorithm has obtained the optimal solutions with 100% success and accuracy.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.4
• /
• pp.107-116
• /
• 2013

This algorithm suggests a method in which a minimum spanning tree can be obtained fast by reducing the number of an algorithm execution. The suggested algorithm performs a select-and-delete process. In the select process, firstly, it performs Borůvka's first stage for all the vertices of a graph. Then it re-performs Borůvka's first stage for specific vertices and reduces the population of the edges. In the delete process, it deletes the maximum weight edge if any cycle occurs between the 3 edges of the edges with the reduced population. After, among the remaining edges, applying the valency concept, it gets rid of maximum weight edges. Finally, it eliminates the maximum weight edges if a cycle happens among the vertices with a big valency. The select-and-delete algorithm was applied to 9 various graphs and was evaluated its applicability. The suggested select process is believed to be the vest way to choose the edges, since it showed that it chose less number of big edges from 6 graphs, and only from 3 graphs, comparing to the number of edges that is to be performed when using MST algorithm. When applied the delete process to Kruskal algorithm, the number of performances by Kruskal was less in 6 graphs, but 1 more in each 3 graph. Also, when using the suggested delete process, 1 graph performed only the 1st stage, 5 graphs till 2nd stage, and the remaining till 3rd stage. Finally, the select-and-delete algorithm showed its least number of performances among the MST algorithms.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.10
• /
• pp.155-165
• /
• 2012

This paper suggests traveling salesman problem algorithm that have been unsolved problem with NP-Hard. The proposed algorithm is a heuristic with edge-swap method. The classical method finds the initial solution starts with first node and visits to mostly adjacent nodes then decides the traveling path. This paper selects minimum weight edge for each nodes, then perform Min-Min method that start from minimum weight edge among the selected edges and Min-Max method that starts from maximum weight edges among it. Then we decide tie initial solution to minimum path length between Min-Min and Min-Max method. To get the final optimal solution, we apply previous two-opt to initial solution. Also, we suggest extended 3-opt and 4-opt additionally. For the 7 actual experimental data, this algorithm can be get the optimal solutions of state-of-the-art with fast and correct.

• Journal of KIISE:Information Networking
• /
• v.31 no.2
• /
• pp.123-130
• /
• 2004

Routing and wavelength assignment(RWA) problem is an important issue in optical transport networks based on wavelength division multiplexing(WDM) technique. It is typically solved using a combination of linear programming and graph coloring, or path selection based graph algorithms. Such methods are either complex or make extensive use of heuristics. In this paper we propose a novel and efficient approach which basically obtains the maximum edge disjoint paths (EDPs) for each source-destination demand pair. And those EDPs obtained are stored in Lookup Table and used for the update of weight matrix. Routes are determined in order by the weight matrix for the demand set. The comprehensive computer simulation shows that the Proposed algorithm uses similar or fewer wavelengths with significantly less execution time than bounded greedy approach (BGA) for EDP which is currently known to be effective in practice.

• The KIPS Transactions:PartA
• /
• v.18A no.5
• /
• pp.215-224
• /
• 2011

In this paper, a mechanism connecting all weighted migration routes with minimum cost with EGOSST is proposed. Weighted migration routes may be converted to weighted input edges considered as not only traces but also traffics or trip frequencies of moving object on communication lines, roads or railroads. Proposed mechanism can be used in more wide and practical area than mechanisms considering only moving object traces. In our experiments, edge number, maximum weight for input edges, and detail level for grid are used as input parameters. The mechanism made connection cost decrease average 1.07% and 0.43% comparing with the method using weight minimum spanning tree and weight steiner minimum tree respectively. When grid detail level is 0.1 and 0.001, while each execution time for a connecting solution increases average 97.02% and 2843.87% comparing with the method using weight minimum spanning tree, connecting cost decreases 0.86% and 1.13% respectively. This shows that by adjusting grid detail level, proposed mechanism might be well applied to the applications where designer must grant priority to reducing connecting cost or shortening execution time as well as that it can provide good solutions of connecting migration routes with weights.

• Proceedings of the PSK Conference
• /
• 2003.10b
• /
• pp.247.2-247.2
• /
• 2003

To increase skin permeability of LMWH (Low Molecular Weight Heparin), ultradeformable liposomes were developed. Ultradeformable liposomes were developed by Egg phosphatidylcholine (Egg-PC) and edge activator. Entrapment efficiency, vesicle size and zeta potential of vesicles were determined and characterized for deformability and stability. Transepidermal permeation of LMWH was compared to saturated aqueous control in vitro. The steady-state flux and its maximum time were calculated from the flux curves. (omitted)

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.20 no.6
• /
• pp.735-739
• /
• 2011

In this study, a chair with 5 or 6 legs was designed using the commercial program CATIA V5 in order to efficiently design considering the load conditions. In addition, the stress analysis and shape optimization were carried out using ANSYS Workbench for the chair consisting of stainless steel, aluminum alloys, magnesium alloys and structural steel. As a result, a chair with five legs showed the maximum equivalent stress at the end of the edge of the wheel parts and on the other hand, a chair with six legs showed the maximum equivalent stress at the corner of the connecting parts of the pillar and leg. In addition, the material and the weight was reduced by shape optimization for the chair model with 5 legs and maximum equivalent stress for stainless steel was found that greatly relaxed, compared with that of before shape optimization model.