• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.33 no.4
• /
• pp.1639-1650
• /
• 2013

Road pavement management is an important activity that affects to national economy, movement and safety of people, and also demands huge amount of budget. Therefore, its management strategy must be established under objective information. In addition, decision support system that produces the management strategy needs to consider practical benefits from various aspects. Considering these aspects, this paper aimed to develop a customized Korean life cycle cost analysis model estimating various effects on road users and socio-environmental costs based on pavement condition. The suggested LCCA model focused on Korean national highway, and tried to adopt a national guideline recommended by Korean government for securing credibility of estimation results. In the development processes, some of the suggestions that do not fit well in the situations of pavement management field were added, altered, or partially modified. These attempts to develop customized asset management system would be an important step to break away from passive attitudes relying on ready-made software, but also to improve awareness about the social benefits from the better maintenance strategy.

• Korean Chemical Engineering Research
• /
• v.57 no.1
• /
• pp.51-57
• /
• 2019

A plant layout problem has a large impact on the overall construction cost of a plant. When determining a plant layout, various constraints associating with safety, environment, sufficient maintenance area, passages for workers, etc have to be considered together. In general plant layout problems, the main goal is to minimize the length of piping connecting equipments as satisfying various constraints. Since the process may suffer from the heat and friction loss, the piping length between equipments should be shorter. This problem can be represented by the mathematical formulation and the optimal solutions can be investigated by an optimization solver. General researches have overlooked many constraints such as maintenance spaces and safety distances between equipments. And, previous researches have tested benchmark processes. What the lack of general researches is that there is no realistic comparison. In this study, the plant layout of a real industrial C3MR (Propane precooling Mixed Refrigerant) process is studied. A MILP (Mixed Integer Linear Programming) including various constraints is developed. To avoid the violation of constraints, penalty functions are introduced. However, conventional optimization solvers handling the derivatives of an objective functions can not solve this problem due to the complexities of equations. Therefore, the PSO (Particle Swarm Optimization), which investigate an optimal solutions without differential equations, is selected to solve this problem. The results show that a proposed method contributes to saving the capital expenditures.

• Resources Recycling
• /
• v.23 no.3
• /
• pp.3-12
• /
• 2014

This study aims at providing an economic assessment for incineration plants which recover heat during its incineration process. In this study, Life Cycle Cost(LCC) of incineration plants is performed based on each regression analysis formula for construction cost, operation cost, and heat generation in order to compare economic feasibility. The result shows that the incineration plant recovering waste heat while processing 80 tons of waste per day increases both initial investment and operation cost but this type of an incineration plant has economical predominance from the recovered waste heat over the one that does not recover heat when being operated for more than eleven years if the retrieved heat replaces the use of LNG. And its payback time reaches more than 19 years in case of selling heat and performing emission trading.

• Journal of Korea Port Economic Association
• /
• v.22 no.4
• /
• pp.59-79
• /
• 2006

In this paper, we analyse the comparative competitiveness of the 10 major logistic hub cities in China. First, using the input distance function, we calculated the technical efficiencies and the opportunity costs of the transport infra structure investments. Then, based on not only these supply side factors but also demand side, the overall comparative competitiveness by cities are analyzed. Our main findings are as follows: early developed, larger cities such as Shanghai, Guangzhou, Shenzhen are technically efficient but their opportunity costs of the additional transport investments are higher than the other cities. We also found that overall competitiveness of these larger and leading logistic hub cities are dominant over the small and newly developed logistic cities.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2017.05a
• /
• pp.309-309
• /
• 2017

EPANET은 U.S. EPA(U.S. Environmental Protection Agency, 미 환경청)에서 개발한 상수관망 시스템의 수리해석 모의 프로그램으로서, 다양한 상수관망의 설계 및 운영을 모의하기 위해 세계적으로 활발히 활용되고 있다. EPANET 프로그램은 사용자 친화적인 GUI(Graphic User Interface) 환경으로 개발되었으며, 직관적인 네트워크 요소와 폭 넓은 모의 옵션을 제공한다는 장점이 있다. 특히, 상수관망의 실무 및 연구 분야에서는 공학용 분석프로그램과 프로그래밍 언어의 활용이 활발해짐에 따라, 이를 EPANET 프로그램과 연계시킬 수 있는 EPANET Toolkit이 개발되면서 그 활용도는 계속해서 확장될 전망이다. 그러나 지속적인 보완에도 불구하고, 기존의 EPANET Toolkit에서 제공하고 있는 기능은 EPANET 프로그램을 전부 반영하지 못하고 있어 실용성 있는 프로그램의 개발이 제한되고 있는 실정이다. 기존 연구에서는 EPANET Toolkit의 미비한 기능에 대해, "프로그램 수행 - 결과 확인 - EPANET 네트워크 수정"을 반복 수행하여 문제를 해결하였으며, 따라서 복잡하고 세밀한 상수관망 모의 연구에 많은 제약이 존재하였다. 본 연구에서는 EPANET Toolkit의 내부를 수정, 보완하여 기존에 고려하지 못하였던 다양한 기능을 추가하여 관련 연구에 활용할 수 있도록 하였다. 구체적으로는 Pump Curve를 변경 및 입력하여 Pump 교체를 위한 최적 펌프용량을 결정하거나, Energy Pattern을 입력하여 손쉽게 전력비용을 산정하는 등의 기능이 개선되었다. 그밖에도 EPANET Toolkit의 활용성을 향상시키기 위한 다양한 함수들을 추가적으로 구성하였으며, 이는 펌프 용량 및 효율 곡선과 배수지 설계 등 상수관망 구성요소의 설계에도 폭 넓게 활용할 수 있을 것으로 기대된다.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.10
• /
• pp.123-131
• /
• 1999

In this paper, we proposed stereo matching algorithm by dynamic programming with edges emphasized. Existing algorithms show blur generally at depth discontinuities owing to smoothness constraint and non-existence of matching pixel in occlusion regions. Also it accompanies matching error by lackness of matching information in the untextured regions. This paper defines new cost function to make up for the problems occurred to existing algorithms. It is possible through deriving matching of edges in left and right images to be carried out between edge regions anf deriving that in the other regions to be peformed between the other regions. In case of the possibility that edges can be Produced in a large amount, matching between edge information adds weight to cost function in proportion to Path distance. Proposed algorithm was applied to various images obtained by convergent camera model as well as parallel camera model. As the result, proposed algorithm showed improved performance in the aspect of matching error and processing in the occlusion regions compared to existing algorithms. Also it could improve blur especially in discontinuity regions.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.5
• /
• pp.777-786
• /
• 1995

This paper describes several algorithms for technology mapping of logic functions into interesting and popular FPGAs that use look-up table memories. In order to improve the technology mapping for FPGA, some existing multi-level logic synthesis, decomposition reduction and packing techniques are analyzed and compared. And then new algorithms such as node-pair decomposition, merging fanin, unified reduction and multiple output decomposition which are used for combinational logic design, are proposed. The cost function is used to minimize the number of CLBs and edges of the network. The cost is a linear combination of each weight that is given by user. Finally we compare our new algorithm with previous logic design technique［8］. In an experimental comparison our algorithm requires 10% fewer CLB and nets than SIS-pga.

• Journal of Korea Port Economic Association
• /
• v.29 no.3
• /
• pp.159-174
• /
• 2013

This paper mainly deals with the appropriation of ship voyage allocation, using a heuristic regression model, in order to reduce total costs incurred in port, yard and at sea under the specific port condition. Because of different behavior of costs incurred in port, yard and at sea, an effort to minimize these costs by adjusting the number of voyages for three ship classes(50,000, 100,000, and 150,000-ton) should be made. For instance, if the port managers attempt to reduce the sea transport cost by increasing the annual allocated number of ship voyages classed 150,000-ton for economies of scale, they have no choice but to suffer a significant increase in queueing cost due to port congestion. To put it differently, there are trade-off relationships among the costs incurred in port, yard, and at sea. We utilized a computer simulation result to perform a couple of regression analyses in order to figure out the appropriate range of allocated number of voyages of each ship class using a heuristic approach. The detailed analytical results will be shown at the main paper. We also suggested a net present value(NPV) model to make a proper investment decision for an additional berth of 200,000-ton class that alleviates port congestion and reduces transport cost incurred both in port and at sea.

• Journal of KIISE:Information Networking
• /
• v.30 no.2
• /
• pp.207-221
• /
• 2003

A hash chain is highly efficient, attractive structure to use in electronic cash. Previous systems using hash chain were, however, either credit-based vendor-specific cash or debit-based general-purpose cash which lacks efficiency due to double spending problem. In this paper, we propose a new divisible cash system using hash chain. This newly proposed cash is general-purpose, debit-based, anonymous, and offline. The efficiency of the system results from its capacity to pay variable amounts with no additional costs. A client always performs a single blind signature in the withdrawal phase, independent of the length of the chain. During payment, a client performs a single challenge-and-response or generates a single signature, independent of the amount paid. This system provides a new refund mechanism, which uses a refund ticket, that allows clients to refund the unspent part of the chain without revealing any connection to the spent part.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.11
• /
• pp.2886-2896
• /
• 1996

The Type of Service based multicast routing algorithm is necessary to support efficiently herogeneous applications in ATM network. In this paper I propose the Constrained Multicast Tree with Virtual Destination(DMTVD) heuristic algorithm as least cost multicast routing algorithm. The service is categorized into two types, as delay sensitive and non in CMTVD algorithm. For the delay sensitive service type, the cost optimized route is the Minimum Cost Stenier Tree connecting all the destination node group, virtual destination node group and source node with least costs, subject to the delay along the path being less than the maximum allowable end to end delay. The other side for the non-delay sensitive service, the cost optimized route is the MCST connecting all the multicast groups with least costs, subject to the traffic load is balanced in the network. The CMTVD algorithm is based on the Constrained Multicasting Tree algorithm but regards the nodes branching multiple destination nodes as virtural destination node. The experimental results show that the total route costs is enhanced 10%-15% than the CTM algorithm.