• The Transactions of the Korea Information Processing Society
• /
• v.5 no.4
• /
• pp.1033-1043
• /
• 1998

In this paper, we present an improved multicasting path assignment algorithm based on the minimum cost spanning tree. In the method presented in this paper, a multicasting path is assigned preferentially when a node to be received is found among the next degree nodes of the searching node in the multicasting path assignment of the constrained steiner tree (CST). If nodes of the legacy group exist between nodes of the new group, a new path among the nodes of new group is assigned as long as the nodes may be excluded from the new multicasting path assignment taking into consideration characteristics of nodes in the legacy group. In assigning the multicasting path additionally, where the source and destination nodes which can be set for the new multicasting path exist in the domain of identical network (local area network) and conditions for degree constraint are satisfied, a method of producing and assigning a new multicasting path is used. The results of comparison of CST with MCSTOP, MCSTOp algorithm enhanced performance capabilities about the communication cost, the propagation delay, and the computation time for the multicasting assignment paths more than CST algorithm. Further to this, research activities need study for the application of the international standard protocol(multicasting path assignment technology in the multipoint communication service (MCS) of the ITU-T T.120).

• Journal of Korea Spatial Information System Society
• /
• v.8 no.1 s.16
• /
• pp.107-118
• /
• 2006

In this paper, several network algorithms were tested to find an optimal one for telecommunication network design. Algorithms such as Dijkstra's shortest path algorithm, Ford-Bellman's shortest path algorithm, Prim's minimum spanning tree algorithm, and Kruscal's minimum spanning tree algorithm were reviewed and compared in terms of feasibility and resulted network construction cost. Then an optimal algorithm that is most suitable for telecommunication network design was selected. For more specific and quantitative analysis of the selected algorithm, it was implemented to a real telecommunication network construction site. The analyzed results showed that the suggested design method when compared with the conventional one, reduced the network construction cost considerably. The total network length estimated by the conventional method were 5267 meters while the suggested method resulted in 4807 meters. Thus the new method reduced the total network length by 8.7 percent which is equivalent to 97,469,000 Won of construction cost. Considering the frequent telecommunication network constructions, due to new urban developments in the nation, the economic benefit of the suggested telecommunication network design method will be significant. In addition to the construction cost savings, the suggested telecommunication network design procedure possesses several other economic benefits. Since the design procedure can be standardized and automatized, it can reduce the design cost itself and the skill acquirement periods required for new or inapt design crews. Further, due to the standardized and automatized design procedure, any telecommunication network design results can accessed more objectively.

• Proceedings of the Earthquake Engineering Society of Korea Conference
• /
• 2000.10a
• /
• pp.440-447
• /
• 2000

In order to evaluate the cost effectiveness of seismic isolation for bridges in low and moderate seismic region, a method of calculation minimum life-cycle cost of seismic-isolated bridges under specific acceleration level and soil condition is developed. Input ground motion is modeled as spectral density function compatible with response spectrum for combination of acceleration coefficient and site coefficient. Failure probability is calculated by spectrum analysis based on random vibration theories to simplify repetitive calculations in the minimization procedure. Ductility of piers and its effects on cost effectiveness are considered by stochastic linearization method. Cost function and cost effectiveness index are defined by taking into consideration the characteristics of seismic isolated bridges. Limit states for calculation of failure probability are defined on superstructure, isolator and pier, respectively. The results of example design and analysis show that seismic isolation is more cost-effective in low and moderate seismic region than in high seismic region.

• Journal of Power System Engineering
• /
• v.2 no.3
• /
• pp.60-67
• /
• 1998

Edge detection is the first step and very important step in image analysis. We cast edge detection as a problem in cost minimization. This is achieved by the formulation of a cost function that evaluates the quality of edge configurations. The cost function can be used as a basis for comparing the performances of different detectors. This cost function is made of desirable characteristics of edges such as thickness, continuity, length, region dissimilarity. And we use a simulated annealing algorithm for minimum of cost function. Simulated annealing are a class of adaptive search techniques that have been intensively studied in recent years. We present five strategies for generating candidate states. Experimental results(building image and test image) which verify the usefulness of our simulated annealing approach to edge detection are better than other operator.

• Korean Management Science Review
• /
• v.25 no.2
• /
• pp.73-80
• /
• 2008

The location area planning is to assign cells to the location areas of a wireless communication network in an optimum manner. The two important cost components are cost of location update and cost of paging that are of conflicting in nature; i.e., minimizing the registration cost might increase the search cost. Hence, it is important to find a compromise between the location update and paging operations such that the cost of mobile terminal location tracking cost is a minimum. The complete mobile network is divided into location areas. Each location area consists of a group of cells. In fact this is shown to be an NP-complete problem in an earlier study. In this paper, we use an ant colony optimization method to obtain the best/optimal group of cells for a given a network.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.24 no.4
• /
• pp.386-393
• /
• 2015

A study is carried out on investigation on pattern costs, identification of geometric parameters for the cost, and development of cost estimation models for casting patterns. Pattern costs for machine tool structures are collected and analyzed to identify the important geometric parameters that affect the costs. The parameters are used for the development of the costing models. It is found that the geometric parameters can be easily obtained from a CAD system and then the costing models estimate a pattern cost in a minimum time. The models are verified with the structures whose pattern cost was used for this study. It is expected that this costing models can evaluate the cost of casting structures of machine tools in search of a near-optimal design based on manufacturing cost and, for example, weight at the design stage.

• Korean Journal of Human Ecology
• /
• v.24 no.2
• /
• pp.237-253
• /
• 2015

The purpose of this study was to examine the relative deprivation of the households in poverty, comparing with the households in non-poverty, and to find out the characteristics of household groups by the level of relative deprivation. The data for this study was from the 6th Korea Welfare Panel Survey(KOWEPS), consisting of total 5,552 households. The results are as follows: There were statistically significant differences in the objective cost of living, the subjective minimum cost of living, and the subjective adequate cost of living between households in poverty and households in non-poverty. There was statistically significant difference in the relative deprivation between households in poverty and households in non-poverty. Poverty was the factor for the relative deprivation of households.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.12
• /
• pp.2208-2212
• /
• 2008

This paper deals with the cost reduction design of a single-phase line-start permanent magnet(LSPM) motor. Due to high cost of the permanent magnet(PM), cost reduction can be effectively achieved by reducing PM volume. Therefore, motor characteristics according to the PM volume are calculated by using d-q axis equivalent circuit analysis, and the characteristic map is made. In the characteristic map, maximum torque and efficiency are shown according to motor parameters such as back electromotive force(back emf) and inductances; back emf represents the PM volume. Minimum back emf and inductances satisfying output performance are determined in the characteristic map. Then, motor geometry based on the prototype motor is optimized to get the determined parameters using response surface methodology(RSM) and finite element method(FEM). Through the presented cost reduction design, total PM volume is reduced to 32% of prototype model.

• KIEE International Transactions on Power Engineering
• /
• v.5A no.1
• /
• pp.9-15
• /
• 2005

In the operation of distribution systems, DGs (Distributed Generations) are installed as an alternative to extension and the establishment of substations, transmission and distribution lines according to the increasing power demand. In the operation planning of DGs, determining optimal capacity and allocation achieves economical profitability and improves the reliability of power distribution systems. This paper proposes a determining method for the optimal number, size and allocation of DGs in order to minimize the operation costs of distribution systems. Capacity and allocation of DGs for economical operation planning duration are determined to minimize total cost composed with power buying cost, operation cost of DGs, loss cost and outage cost using the GA (Genetic Algorithm).

• The KIPS Transactions:PartC
• /
• v.10C no.3
• /
• pp.367-376
• /
• 2003

This study deals with the DCMST (Delay constrained Capacitated Minimum Spanning Tree) problem applied in the topological design of local networks or finding several communication paths from root node. While the traditional CMST problem has only the traffic capacity constraint served by a port of root node, the DCMST problem has the additional mean delay constraint of network. The DCMST problem consists of finding a set of spanning trees to link end-nodes to the root node satisfying the traffic requirements at end-nodes and the required mean delay of network. The objective function of problem is to minimize the total link cost. This paper presents two-phased heuristic algorithm, which consists of node exchange, and node shift algorithm based on the trade-off criterions, and mean delay algorithm. Actual computational experience and performance analysis show that the proposed algorithm can produce better solution than the existing algorithm for the CMST problem to consider the mean delay constraint in terms of cost.