• Journal of the Korean Society of Safety
• /
• v.17 no.1
• /
• pp.68-71
• /
• 2002

A research on accident loss calculation for polyol process without safety management activities, and safety cost estimation using process risk assessment has been implemented. In order to estimate a magnitude of loss, accident scenarios were made by combining result made from HAZOP Study method with accident possibility analysis results implemented with FTA. Also effect assessment was implement for accident consequence of each scenario. And minimum possible loss cost has been calculated when safety investment do or not. Result from cost-benefit analysis was shown as approximately \335 billion(=USS44,000 billion), as cost after subtracting safety management cost from minimum possible loss cost.

• Journal of Communications and Networks
• /
• v.11 no.5
• /
• pp.500-508
• /
• 2009

We have designed an algorithm for a problem in multicast communication. The problem is to construct a multicast tree while minimizing its cost, which is known to be NP-complete. Our algorithm, which employs new concepts defined as potential cost and spanning cost, generates a multicast tree more efficiently than the well-known heuristic called Takahashi and Matsuyama (TM) [1] in terms of tree cost. The time complexity of our algorithm is O($kn^2$) for an n-node network with k members in the multicast group and is comparable to the TM. Our empirical performance evaluation comparing the proposed algorithm with TM shows that the enhancement is up to 1.25%~4.23% for each best case.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10a
• /
• pp.69-72
• /
• 1996

This paper considers a global resolution of kinematic redundancy under inequality constraints as a constrained optimal control. In this formulation, joint limits and obstacles are regarded as state variable inequality constraints, and joint velocity limits as control variable inequality constraints. Necessary and sufficient conditions are derived by using Pontryagin's minimum principle and penalty function method. These conditions leads to a two-point boundary-value problem (TPBVP) with natural, periodic and inequality boundary conditions. In order to solve the TPBVP and to find a global minimum, a numerical algorithm, named two-stage algorithm, is presented. Given initial joint pose, the first stage finds the optimal joint trajectory and its corresponding minimum performance cost. The second stage searches for the optimal initial joint pose with globally minimum cost in the self-motion manifold. The effectiveness of the proposed algorithm is demonstrated through a simulation with a 3-dof planar redundant manipulator.

• Journal of the Korean Home Economics Association
• /
• v.40 no.4
• /
• pp.139-152
• /
• 2002

This study was performed to estimate living cost for the elderly couple living in a city in Korea. Living cost means expenditure per month for elderly couple. It was assumed that the elderly couple will need different living cost according to their circumstances. The circumstances are health status, retirement status, and the level of living they want. The subjects were the elderly couple households over the age 65 of household head. Total number of subject was 1,649 households. Used data was Annual Report surveyed by National Statistical Office on the Family Income and Expenditure. Analysis of data was done through frequency, percentage, means, median using SAS Program. The results of this study were as follows: Their standard living cost was 844,980 won by pure relative standard line and 842,300 won by quasi relative standard lines. And minimum living cost was 713,400 won by the former, by the latter was 557,600 won (3/2 of median). And abundant Living cost was 1,068,020 won by the former, by the latter 1,263,450 won. The living cost of elderly households was about 81-83%, comparing with non-elderly households. Among the item of expenditure, the proportion of housing and medical care cost was larger than any other items.

• 한국신재생에너지학회:학술대회논문집
• /
• 2011.05a
• /
• pp.136.2-136.2
• /
• 2011

In this work, we analyzed correlations between life-cycle greenhouse gas (GHG) emissions and life-cycle cost of energy resources. Energy resources studied in this paper include coal, natural gas, nuclear power, hydropower, geothermal energy, wind power, solar thermal energy, and solar photovoltaic energy, and all of them are used to generate electricity. We calculated the mean values, ranges of maximum minus minimum values, and ranges of 90% confidence interval of life-cycle GHG emissions and life-cycle cost of each energy resource. Based on the values, we plotted them in two dimensional graphs to analyze a relationship and characteristics between GHG emissions and cost. Besides, to analyze the technical maturity, the GHG emissions and the range of minimum and maximum values were compared to each other. For the electric generation, energy resources are largely inverse proportional to the GHG emission and the corresponding cost.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2021.06a
• /
• pp.145-145
• /
• 2021

Water distribution networks (WDNs) are designed to satisfy water requirement of an urban community. One of the central issues in human history is providing sufficient quality and quantity of water through WDNs. A WDN consists of a great number of pipelines with different ages, lengths, materials, and sizes in varying degrees of deterioration. The available annual budget for rehabilitation of these infrastructures only covers part of the network; thus it is important to manage the limited budget in the most cost-effective manner. In this study, a novel pipe replacement scheduling approach is proposed in order to smooth the annual investment time series based on a life cycle cost assessment. The proposed approach is applied to a real WDN currently operating in South Korea. The proposed scheduling plan considers both the annual budget limitation and the optimum investment on pipes' useful life. A non-dominated sorting genetic algorithm is used to solve a multi-objective optimization problem. Three decision-making objectives, including the minimum imposed LCC of the network, the minimum standard deviation of annual cost, and the minimum average age of the network, are considered to find optimal pipe replacement planning over long-term time period. The results indicate that the proposed scheduling structure provides efficient and cost-effective rehabilitation management of water network with consistent annual budget.

• ETRI Journal
• /
• v.42 no.1
• /
• pp.118-128
• /
• 2020

A semitransparent photovoltaic-thermal (PV/T) air collector can produce electricity and heat simultaneously. To maximize the thermal and overall efficiency of the semitransparent PV/T air collector, its availability should be maximum; this can be determined through a Markov analysis. In this paper, a Markov model is developed to select an optimized number of semitransparent PV modules in service with five states and two states by considering two parameters, namely failure rate (λ) and repair rate (μ). Three artificial neural network (ANN) models are developed to obtain the minimum cost, minimum temperature, and maximum thermal efficiency of the semitransparent PV/T air collector by setting its type appropriately and optimizing the number of photovoltaic modules and cost. An attempt is also made to achieve maximum thermal and overall efficiency for the semitransparent PV/T air collector by using ANN after obtaining its minimum temperature and available solar radiation.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.53 no.4
• /
• pp.210-215
• /
• 2004

This paper proposes an implicit method for computing the minimum cost feedback vertex set for a graph. For an arbitrary graph, a Boolean function is derived, whose satisfying assignments directly correspond to feedback vertex sets of the graph. Importantly, cycles in the graph are never explicitly enumerated, but rather, are captured implicitly in this Boolean function. This function is then used to determine the minimum cost feedback vertex set. Even though computing the minimum cost satisfying assignment for a Boolean function remains an NP-hard problem, it is possible to exploit the advances made in the area of Boolean function representation in logic synthesis to tackle this problem efficiently in practice for even reasonably large sized graphs. The algorithm has obvious application in flip-flop selection for partial scan. The algorithm proposed in this paper is the first to obtain the MFVS solutions for many benchmark circuits.

• Journal of the military operations research society of Korea
• /
• v.24 no.2
• /
• pp.162-169
• /
• 1998

This study presents an single machine scheduling algorithm minimize lateness of product by controlling machining speed. Generally, production scheduling uses the information of process planning. But the production scheduling algorithm has not considered the control of machining speed in its procedures. Therefore, the purpose of this study is to consider the machining speed in production scheduling algorithm for efficient production scheduling. Machining time and machining cost required to manufacture a piece of a product are expressed as a unimodal convex function with respect to machining speed, so it has minimal point at minimum time speed or the minimum cost speed. Therefore, because of considering the machining cost, the control of machining speed for the algorithm is executed between minimum speed and maximum speed. An example is demonstrated to explain the algorithm.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.11 no.6
• /
• pp.971-974
• /
• 1987

Considering heat transfer and heat loss processes for the heat engine operating between two fixed heat reservoirs, it may be qualitatively explained that the maxima of power output and its efficiency depending upon operating conditions are extreme maxima. Furthermore, it is also found that from an economic point of view the above two extremes are related to extreme minima of plant cost per unit power output and operation cost per unit power output respectively, and the condition of minimum cost per unit power output exists between the extreme minimum conditions of plant cost per unit power output and that of operation cost per unit power output.