• Journal of Environmental Impact Assessment
• /
• v.17 no.2
• /
• pp.133-141
• /
• 2008

The loss, alteration, and fragmentation of habitat have led to a reduction of biodiversity. The growing awareness of the negative effects of habitat fragmentation on natural systems has resulted in conservation strategy that is concerned with not only population and habitat level but also ecosystem and landscape level. Especially, ecological network to link core areas or major habitat patches is one of the most important issues. Recently, landscape connectivity is increasingly used in decision making for fragmented landscape management in order to conserve the biodiversity in the regional scale. The objective of this study was to find potential forest as a ecological corridor in Go-yang city, Gyung-gi province using cost-distance modelling method that can measure connectivity based on animal movement. 'Least cost-distance' modelling based on functional connectivity can be useful to establish ecological network and biodiversity conservation plan. This method calculates the distance modified with the cost to move between habitat patches based on detailed geographical information on the landscape as well as behavioural aspects of the animal movement. The least cost-distance models are based on two biologically assumptions: (1) dispersers have complete knowledge of their surroundings, and (2) they do select the least cost route from this information. As a result of this study, we can find wildlife moving route for biodiversity conservation. The result is very useful for long-term aspect of biodiversity conservation plan in regional scale, because this is reflection of geographical information and behavioural aspects of the animal movement.

• Journal of Navigation and Port Research
• /
• v.35 no.2
• /
• pp.159-165
• /
• 2011

The aim of paper is to calculate the optimized size of Mobile Harbor(MH) which would be operated in South Korea coast area. MH is the combined entity which has the function of both ship and container port. In estimating the optimized size, the total cost concept is applied to the different size of MH. Trade-off factors for calculating total cost are MH cost and the over-capacity lost cost. The factors for MH cost estimation are the cargo demand, distance from origin to destination, voyage route and MH's fixed and variable cost in both sailing and port. The other cost is the over-capacity lost cost which is occurred from dead space in case of oversize compared with a voyage demand. The alternatives for the least cost are 250TEU, 500TEU, 750TEU and 1,000TEU sized vessel. The result of research is that 250TEU sized vessel is optimized in a South Korea costal service. If the coastal area be separated in terms of voyage distance or the specific area in considering trade, the optimized size is changed depending upon distance.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.12
• /
• pp.135-144
• /
• 2020

In graph theory, the least-cost path is discovered by searching the shortest path between a start node and destination node. The least cost is calculated as a one-dimensional value that represents the difference in distance or price between two nodes, and the nodes and edges that comprise the lowest sum of costs between the linked nodes is the shortest path. However, it is difficult to determine the shortest path if each node has multiple attributes because the number of cost types that can appear is equal to the number of attributes. In this paper, a shortest path search scheme is proposed that considers multiple attributes using the Euclidean distance to satisfy various user requirements. In simulation, we discovered that the shortest path calculated using one-dimensional values differs from that calculated using the Euclidean distance for two-dimensional attributes. The user's preferences are reflected in multi attributes and it was different from one-dimensional attribute. Consequently, user requirements could be satisfied simultaneously by considering multiple attributes.

• Korean Journal of Ecology and Environment
• /
• v.57 no.2
• /
• pp.75-82
• /
• 2024

This study examined the spatial morphological patterns of forest habitats and the characteristics of roadkill occurrences in the forests of Mungyeong, Yecheon, Yeongju, Andong, and Bonghwa in Gyeongsangbukdo. It involved building a resistance map between habitats and analyzing connectivity based on the least-cost distance. The analysis of the distance between the forest habitat Cores derived from MSPA and roadkill points showed that roadkill occurrences were concentrated approximately 74.11 m away from the Cores, with most roadkills happening within 360m from the habitats. The connectivity analysis between core habitats larger than 1 km² revealed 141 core habitats and 242 least-cost paths between them. The corridor distance value was found to be highest in Mungyeong city, indicating an urgent need for strategies to enhance habitat connectivity there. This research is expected to serve as foundational data for developing strategies to enhance ecosystem connectivity and restore habitats, by analyzing ecosystem connectivity and roadkill issues due to habitat fragmentation.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06c
• /
• pp.393-396
• /
• 2011

In this paper, we propose a constrained alternating least squares nonnegative matrix factorization algorithm (cALSNMF) to detect active brain regions from single subject's task-related fMRI data. In cALSNMF, we define a new cost function which considers the uncorrelation and noisy problems of fMRI data by adding decorrelation and smoothing constraints in original Euclidean distance cost function. We also generate a novel training procedure by modifying the update rules and combining with optimal brain surgeon (OBS) algorithm. The experimental results on visuomotor task fMRI data show that our cALSNMF fits fMRI data better than original ALSNMF in detecting task-related brain activation from single subject's fMRI data.

• The KIPS Transactions:PartA
• /
• v.14A no.5
• /
• pp.317-326
• /
• 2007

We propose more enhanced heuristic for the GOSST(Grade of Services Steiner Minimum Tree) problem in this paper. GOSST problem is a variation of Steiner Tree problem and to find a network topology satisfying the G-Condition with minimum network construction cost. GOSST problem is known as one of NP-Hard or NP-Complete problems. In previous our research, we proposed a heuristic employing Direct Steiner Point Locating strategy with Distance Preferring MST building strategy. In this paper, we propose new Steiner point locating strategy, Zigzag Steiner point Locating strategy. Through the results of out experiments, we can assert this strategy is better than our previous works. The Distance Zigzag GOSST method which hires the Distance Preferring MST building strategy and Zigzag Steiner point Locating strategy defrays the least network construction cost and brings 31.5% cost saving by comparison to G-MST, the experimental control and 2.2% enhancement by comparison to the Distance Direct GOSST method, the best GOSST method in our previous research.

• Journal of the Korean Society of Environmental Restoration Technology
• /
• v.18 no.5
• /
• pp.13-26
• /
• 2015

Urban park and green space provide various functions. Among the functions, human benefit and increase of biodiversity are known to be important. Therefore, it is important to consider human and biotic aspect in the process of selecting suitable site for park and green space. However, there is insufficient research on both aspects. In this study, we used green network to analyze human and biotic aspect to select suitable site for park and green space in Seongnam City in Korea. To analyze the green network, we used accessibility for human aspect and used dispersal distance and habitat size for biotic aspect. We conducted least-cost path modelling using movement cost. In case of biotic aspect, GFS (generic focal species) is used to estimate habitat size and dispersal distance. To find out suitable site for park and green space, we used an overlay analysis method. As the result, old residential areas are shown have insufficient green network which needs park and green space. Furthermore, the green network for biotic aspect is insufficient in old residential areas comapred to green network for human aspect. The result of this study could contribute in planning of park and green space to maximize their functions.

• The Bulletin of The Korean Astronomical Society
• /
• v.40 no.2
• /
• pp.50.4-51
• /
• 2015

Current and planned deep multicolor wide-area cosmological surveys will map in detail the spatial distribution of galaxies and quasars over unprecedented volumes, and provide a number of objects with photometric redshifts more than an order of magnitude bigger than that of spectroscopic redshifts. Photometric information is statistically more significant for studying cosmological evolution, dark energy, and the expansion history of the universe at a fraction of the cost of a full spectroscopic survey, but intrinsically carries a bias due to noise in the distance estimates. We provide convolution- and deconvolution-based algorithms capable of removing this bias -- thus able to exploit the full cosmological information -- in order to reconstruct intrinsic distributions and correlations between distance-dependent quantities. We then show some direct applications of our techniques to the VIMOS Public Extragalactic Redshift Survey (VIPERS) and the Sloan Digital Sky Survey (SDSS) datasets. Our methods impact a broader range of studies, when at least one distance-dependent quantity is involved; hence, they will be useful for upcoming large-volume surveys, some of which will only have photometric information.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.1
• /
• pp.189-199
• /
• 1994

This paper considers the covering network design problem (CNDP). In the CNDP, an undirected graph is given where nodes correspond to potential facility sites and arcs to potential links connecting facilities. The objective of the CNDP is to identify the least cost connected subgraph whose nodes cover the given demand points. The problem difines a demand point to be covered if some node in the selected graph is present within an appropriate distance from the demand point. We present an integer programming formulation for the problem and develop a dual-based solution procedure. The computational results for randomly generated test problems are also shown.

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