• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1373-1381
• /
• 1999

이 논문에서는 통신망 설계 응용분야의 문제를 그래프 이론 문제로써 고려해 보았다. 개별 기업체가 서로 떨어진 두 곳을 연결하고자 할 때 공용통신망의 회선을 빌려 통신망을 구축하게 되는데 많은 경우 여러 종류의 회선들이 공급됨으로 어떤 회선을 선택하느냐의 문제가 생긴다. 일반적으로 빠른 회선(low delay)은 느린 회선(high delay)에 비해 비싸다. 그러나 서비스의 질(Quality of Service)이라는 요구사항이 종종 종단지연(end-to-end delay)시간에 의해 결정되므로, 무조건 낮은 가격의 회선만을 사용할 수는 없다. 결국 개별 기업체의 통신망을 위한 통로를 공용 통신망 위에 덮어씌워(overlaying) 구축하는 것의 여부는 두 개의 상반된 인자인 가격과 속도의 조절에 달려 있다. 따라서 일반적인 최소경로 찾기의 변형이라 할 수 있는 다음의 문제가 본 논문의 관심사이다. 두 개의 지점을 연결하는데 종단지연시간의 한계를 만족하면서 최소경비를 갖는 경로에 대한 해결을 위하여, 그래프 채색(coloring) 문제와 최단경로문제를 함께 포함하는 그래프 이론의 문제로 정형화시켜 살펴본다. 배낭문제로의 변환을 통해 이 문제는 {{{{NP-complete임을 증명하였고 {{{{O($\mid$E$\mid$D_0 )시간에 최적값을 주는 의사선형 알고리즘과O($\mid$E$\mid$)시간의 근사 알고리즘을 보였다. 특별한 경우에 대한 {{{{O($\mid$V$\mid$ + $\mid$E$\mid$)시간과 {{{{O($\mid$E$\mid$^2 + $\mid$E$\mid$$\mid$V$\mid$log$\mid$V$\mid$)시간 알고리즘을 보였으며 배낭 문제의 해결책과 유사한 그리디 휴리스틱(greedy heuristic) 알고리즘이 그물 구조(mesh) 그래프 상에서 좋은 결과를 보여주고 있음을 실험을 통해 확인해 보았다.Abstract This paper considers a graph-theoretic problem motivated by a telecommunication network optimization. When a private organization wishes to connect two sites by leasing physical lines from a public telecommunications network, it is often the cases that several categories of lines are available, at different costs. Typically a faster (low delay) lines costs more than a slower (high delay) line. However, low cost lines cannot be used exclusively because the Quality of Service (QoS) requirements often impose a bound on the end-to-end delay. Therefore, overlaying a path on the public network involves two diametrically opposing factors: cost and delay. The following variation of the standard shortest path problem is thus of interest: the shortest route between the two sites that meets a given bound on the end-to-end delay. For this problem we formulate a graph-theoretical problem that has both a shortest path component as well as coloring component. Interestingly, the problem could be formulated as a knapsack problem. We have shown that the general problem is NP-complete. The optimal polynomial-time algorithms for some special cases and one heuristic algorithm for the general problem are described.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.3
• /
• pp.679-686
• /
• 2018

A new dust cleaning vehicle is needed to remove fine and ultra-fine particulate matter in subway tunnels. Therefore, the recently developed tunnel cleaning vehicle is equipped with an efficient suction system and cyclone-based prefilter to handle ultra-fine particles. To treat various sizes of particulate matter with an underbody suction system, this paper proposes a cyclone-based prefilter in the suction system and validates the dust removal efficiency through Computational Fluid Dynamics (CFD) analysis using ANSYS FLUENT. Using the created surface and volume mesh, various particle sizes, materials, and fan flow rates, the particles were tracked in the flow with a discrete phase model. As a result, the dust cleaning vehicle at a normal operational speed of 5km/h requires at least a fan flow rate of $1500m^3/min$ and 100mm of suction inlet height from the tunnel track floor. Those suction modules and cyclone-based prefilters in the dust cleaning vehicle reduces the dust accumulation load of the electric precipitator and helps remove the accumulated fine and ultra-fine dust in the subway tunnel.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.5
• /
• pp.25-36
• /
• 2016

The goal of the SmartGrid is to maximize energy efficiency by exchanging bi-directional real-time power information with the help of ICT(Information and Communication Technology). In this paper, we propose a "JRS-MS" (Joint Routing and Scheduling for Multi-channel SmartGrid) algorithm that uses numerical modeling methods in IEEE 802.11s based STDMA multi-channel SmartGrid NAN networks. The proposed algorithm controls the amount of data transmission adaptively at the link layer and finds a high data-rate path which has the least interference between traffic flows in multi-channel SmartGrid NAN networks. The proposed algorithm improve transmission performance by enhancing network utilization. By comparing the results of performance analysis between the proposed algorithm and the JRS-SG algorithm in the previous paper, we showed that the JRS-MS algorithm can improve transmission performance by maximally utilizing given network resources when the number of flows are increasing in the multi-hop NAN wireless mesh networks.

• Journal of the Korean Geotechnical Society
• /
• v.27 no.7
• /
• pp.47-57
• /
• 2011

The p-y curve has been used to design pile foundations subjected to lateral loading. Although the p-y curve has a large influence on the pile lateral behavior, p-y curves have not been clearly suggested. In this study, the p-y curve of clay was evaluated for drilled shafts in marine deposits by using 3-dimensional numerical analyses. First, the optimization study was performed to properly determine boundary extent, mesh size, and interface stiffness. The numerical modeling in the study was verified by comparing the calculated and the pile loading test results. Then, the p-y curves of single and group piles were evaluated from the parametric study. The selected parameters were pile diameter, pile Young's modulus and pile head fixed condition for a single pile, and pile spacing for group piles. Finally, the p-multiplier was evaluated by comparing the p-y curves of a single pile and group piles. As a result, the p-multiplier at pile spacing of 3D was 0.83, 0.67 and 0.78 for the front, middle, and back row piles, respectively, and showed values similar to those of O'Neill and Reese (1999). For the pile group with pile spacing larger than 60, the group effect can be ignorable.