• Journal of the Korean Society of Environmental Restoration Technology
• /
• v.25 no.1
• /
• pp.25-38
• /
• 2022

Urban problems are constantly occurring around the world due to rapid industrialization and population decline. In particular, as the number of vacant houses is gradually increasing as the population decreases, it is necessary to prepare countermeasures. A plan to utilize vacant houses has emerged to restore the natural environment of the urban ecosystem where forest destruction, damage to habitats of wild animals and plants, and disconnection have occurred due to large-scale development. Through connectivity analysis, it is possible to understand the overall ecosystem flow based on the movement of species and predict the effect when vacant houses are converted into green spaces. Therefore, this study analyzed the green area network to confirm the possibility of greening of vacant houses neglected in Jeonju based on circuit theory. Using Circuitscape and Least-cost path, we tried to identify the connectivity of green areas and propose an ecological axis based on the analysis. In order to apply the resistance values required for analysis based on previous studies, the 2020 subdivision land cover data were integrated into the major classification evaluation items. When the eight forests in the target site were analyzed as the standard, the overall connectivity and connectivity between forests in the area were high, so it is judged that the existing green areas can perform various functions, such as species movement and provision of habitats. Based on the results of the connectivity analysis, the importance of vacant houses was calculated and the top 20 vacant houses were identified, and it was confirmed that the higher the ranking, the more positive the degree of landscape connectivity was when converted to green areas. In addition, it was confirmed that the results of analyzing the least-cost path based on the resistance values such as connectivity analysis and the existing conceptual map showed some differences when comparing the ecological axes in the form. As a result of checking the vacant houses corresponding to the relevant axis based on the width standards of the main and sub-green areas, a total of 30 vacant houses were included in the 200m width and 6 vacant houses in the 80m width. It is judged that the conversion of vacant houses to green space can contribute to biodiversity conservation as well as connectivity between habitats of species as it is coupled with improved green space connectivity. In addition, it is expected to help solve the problem of vacant houses in the future by showing the possibility of using vacant houses.

• Nuclear Engineering and Technology
• /
• v.51 no.3
• /
• pp.825-836
• /
• 2019

One of the most challenging safety precautions for workers in dynamic, radioactive environments is avoiding radiation sources and sustaining low exposure. This paper presents a sampling-based algorithm, DL-RRT*, for minimum dose walk-path re-planning in radioactive environments, expedient for occupational workers in nuclear facilities to avoid unnecessary radiation exposure. The method combines the principle of random tree star ($RRT^*$) and $D^*$ Lite, and uses the expansion strength of grid search strategy from $D^*$ Lite to quickly find a high-quality initial path to accelerate convergence rate in $RRT^*$. The algorithm inherits probabilistic completeness and asymptotic optimality from $RRT^*$ to refine the existing paths continually by sampling the search-graph obtained from the grid search process. It can not only be applied to continuous cost spaces, but also make full use of the last planning information to avoid global re-planning, so as to improve the efficiency of path planning in frequently changing environments. The effectiveness and superiority of the proposed method was verified by simulating radiation field under varying obstacles and radioactive environments, and the results were compared with $RRT^*$ algorithm output.

• 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.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.1
• /
• pp.36-40
• /
• 2002

Routing algorithm uses metric to choose the route of Least cost to destination network, the best suited routing investigates all routes to the shortest destination among networks and is decided on the route given the minimum metric. This paper analyzed packet flow for setting up the best fitted path on the same network using RIP and EIGRP as the distance vector algorithm and measured the Link-efficiency.

• Management Science and Financial Engineering
• /
• v.20 no.2
• /
• pp.7-12
• /
• 2014

Content Delivery Network (CDN) has evolved to overcome a network bottleneck and improve user perceived Quality of Service (QoS). A CDN replicates contents from the origin server to replica servers to reduce the overload of the origin server. CDN providers would try to achieve an acceptable performance at the least cost including the storage space or processing power. In this paper, we introduce a new optimization model for the CDN design problem considering the user perceived QoS and single path (non-bifurcated) routing constraints and analyze the computational complexity for some special cases.

• Journal of Korean Institute of Industrial Engineers
• /
• v.16 no.1
• /
• pp.17-25
• /
• 1990

Most of the least cost transportation network design problems are frequently formulated as the minimum spanning arborescence problems in directed networks with bitype are costs. These costs are classified whether the arc is included in the path from the root to a specified node over a given spanning arborescence. We prove that this problem is NP-hard, and develop a polynomial time algorithm for acyclic networks. The probelm in acyclic networks is initially formulated as 0-1 integer programming. Next, we prove that the 0-1 relaxed linear programming has an integral optimum solution by complementary slackness conditions. In this paper, we present an $O(n^2)$ algorithm based on a shortest path algorithm.

• Spatial Information Research
• /
• v.17 no.3
• /
• pp.251-259
• /
• 2009

As a result of the current trend towards promoting conservation of the ecosystem, there have been various studies conducted to determine ways to establish an ecological network. The development of analytical methods and an environmental database of GIS has made the creation of this network more efficient. This study focuses on the development of an urban spatial decision support system based on 'Landscape Ecology Theory'. The spatial decision support system suggested in this study consists of four stages. First, landscape patch for the core areas, which are major structures of the ecological network, was determined using the GIS overlay method. Second, a forest habitat was investigated to determine connectivity assessment. Using the gravity model, connectivity assessment at the habitat forest was conducted to select the needed connecting area. Third, the most suitable corridor routes for the eco-network were presented using the least-cost path analysis. Finally, a brief investigation was conducted to determine the conflict areas between the study result and landuse. The results of this study can be applied to urban green network planning. Moreover, the method developed in this study can be utilized to control urban sprawl, promote biodiversity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.11
• /
• pp.763-770
• /
• 2014

In traditional routing protocols including LEACH for wireless sensor networks, nodes suffer from unbalanced energy consumption because the nodes require large transmission energy as the distance to the sink node increase. Multi-hop based routing protocols have been studied to address this problem. In existing protocols, each cluster head usually chooses the closest head as a relay node. We propose LEACH-CHT, in which cluster heads choose the path with least energy consumption to send data to the sink node. In our research, each hop, a cluster head selects the least cost path to the sink node. This method solves the looping problem efficiently as well as make it possible that a cluster head excludes other cluster heads placed farther than its location from the path, without additional energy consumption. By balancing the energy consumption among the nodes, our proposed scheme outperforms existing multi-hop schemes by up to 36% in terms of average network lifetime.

• Journal of Construction Engineering and Project Management
• /
• v.9 no.3
• /
• pp.1-21
• /
• 2019

The management of mega construction projects which incorporate a large number of stakeholders, technologies, data, work culture etc., is cumbersome. The experts in the construction arena advocate that interface management serves as a precise tool in resolving these conflict points due to the intricate nature of the construction projects. Interface management is a current trending management practice in the construction industry which is also a beneficiary to mega/fast track projects in enhancing the project performance. The main objective of this study is to validate a model for assessing the relationships among interface management, IT applications, project performance & project benefits. The mediating effect of interface management in relationship between project performance & interfacial factors was also investigated. The research model was validated using PLS-SEM (Partial Least Square-Structural Equation Modelling) approach. Data were collected from clients, contractors, consultants in large scale projects through questionnaire survey and smart-PLS software was used to analyse the conceptual model. The research model comprises eleven hypothesis and the significance of these hypothesis were tested using T- statistics values. The research implies that people/participants factor is greatly influenced by interface management with the path coefficient of 0.608 and also enhancement of project's schedule performance due to the interface management is strongly appealing (Path coefficient = 0.711). The results also reveal IT application is significantly associated with interface management practice (Path coefficient =0.723) and also the effect of IT application on project performance (schedule, cost, quality & safety) is successfully mediated through interface management practice. The practical application of this validated model was done through case study. The case study aims at measuring the impact of interface management on interfacial factors and role of interface management in improving the project performance in the construction organisations.

• Journal of Korean Society of Transportation
• /
• v.23 no.2
• /
• pp.117-130
• /
• 2005

In both deteministic user Optimal Traffic Assignment Model (UOTAM) and stochastic UOTAM, travel time, which is a major ccriterion for traffic loading over transportation network, is defined by the sum of link travel time and turn delay at intersections. In this assignment method, drivers actual route perception processes and choice behaviors, which can become main explanatory factors, are not sufficiently considered: therefore may result in biased traffic loading. Even though there have been some efforts in Stochastic UOTAM for reflecting drivers' route perception cost by assuming cumulative distribution function of link travel time, it has not been fundamental fruitions, but some trials based on the unreasonable assumptions of Probit model of truncated travel time distribution function and Logit model of independency of inter-link congestion. The critical reason why deterministic UOTAM have not been able to reflect route perception cost is that the route perception cost has each different value according to each origin, destination, and path connection the origin and destination. Therefore in order to find the optimum route between OD pair, route enumeration problem that all routes connecting an OD pair must be compared is encountered, and it is the critical reason causing computational failure because uncountable number of path may be enumerated as the scale of transportation network become bigger. The purpose of this study is to propose a method to enable UOTAM to reflect route perception cost without route enumeration between an O-D pair. For this purpose, this study defines a link as a least definition of path. Thus since each link can be treated as a path, in two links searching process of the link label based optimum path algorithm, the route enumeration between OD pair can be reduced the scale of finding optimum path to all links. The computational burden of this method is no more than link label based optimum path algorithm. Each different perception cost is embedded as a quantitative value generated by comparing the sub-path from the origin to the searching link and the searched link.