• 환경영향평가
• /
• 제17권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.

• 한국항해항만학회지
• /
• 제35권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.

• 한국컴퓨터정보학회논문지
• /
• 제25권12호
• /
• pp.135-144
• /
• 2020

그래프 이론에서 최소비용 경로는 시작 노드와 도착 노드 사이의 최단 경로를 탐색하여 구한다. 최소비용은 두 노드 사이의 거리나 가격의 차이를 1차원 값으로 계산하며 연결된 노드 사이의 최소비용의 합을 구성하는 노드와 간선이 최단 경로다. 그러나 각 노드가 다중속성을 갖는 경우에는 경로에서 나타날 수 있는 비용의 종류 또한 속성의 개수만큼이므로 최단 경로를 판단하기에는 어려움이 있다. 본 논문에서는 사용자의 다양한 요구사항을 만족할 수 있도록 유클리드 거리를 사용하여 다중속성을 반영한 최단 경로 탐색 기법을 제안한다. 실험에서는 1차원 값에 대한 최단 경로와 2차원 속성에 대한 유클리드 거리를 이용한 최단 경로가 다르게 탐색 되었다. 다중 속성에서도 단일 속성과 차별화된 사용자의 선호 속성이 반영된 것으로 나타났다. 결과적으로 다중속성이 반영됨으로써 사용자의 다양한 요구사항을 만족시킬 수 있게 되었다.

• 생태와환경
• /
• 제57권2호
• /
• pp.75-82
• /
• 2024

이 연구는 경상북도 문경, 예천, 영주, 안동, 봉화 일대의 산림서식지 공간형태학적 패턴과 로드킬 발생 간의 특성을 확인하고, 서식지 간의 저항지도를 구축하여 최소비용거리 기반 연결성을 분석하였다. MSPA에서 도출된 산림서식지 Core와 로드킬 발생지점 간의 거리를 분석한 결과, Core로부터 약 74.11 m 떨어진 지역에서 로드킬 발생이 집중되었고, 대부분의 로드킬이 서식지로부터 360 m 이내에서 발생하는 것으로 확인되었다. 1 km² 이상의 Core인 핵심서식지 간의 연결성 분석 결과, 141개의 핵심서식지와 서식지 간의 최소거리 경로(path) 242개가 도출되었고, 통로거리(corridor distance) 값은 문경시가 가장 높게 분석되어 대상지 중 연결성이 가장 낮은 것으로 나타났다. 본 연구는 서식지 단절에 따른 생태계 연결성과 로드킬 문제를 분석하여, 생태통로 설치 등 생태계의 연결성 강화 및 서식지 복원 전략 개발을 위한 기초자료로 사용될 수 있을 것으로 기대된다.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2011년도 한국컴퓨터종합학술대회논문집 Vol.38 No.1(C)
• /
• 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.

• 정보처리학회논문지A
• /
• 제14A권5호
• /
• pp.317-326
• /
• 2007

본 논문에서 GOSST(Grade of Services Steiner Minimum Tree) 문제에 대한 개선된 휴리스틱을 제안한다. GOSST 문제는 스타이너 포인트 문제의 한 변형으로 G-Condition을 만족하는 최소비용의 네트워크 구성을 찾는 문제이며, NP-Hard 혹은 NP-Complete 문제로 알려져 있다. 이 문제에 대한 이전의 연구에서 우리는 거리 우선 최소 신장 트리 생성방법과 직접 스타이너 포인트 배치 방법을 결합한 휴리스틱을 제안했었다. 본 논문에서는 스타이너 포인트 배치 방법으로 지그재그 스타이너 포인트 배치방법을 새롭게 제안한다. 이 방법과 거리우선 최소 신장 트리 생성 방법을 결합한 거리 지그재그 GOSST 휴리스틱은 컨트롤인 G-MST에 비해 31.5%의 네트워크 구축 비용의 절감을 얻었고 이전의 가장 좋은 GOSST 휴리스틱인 거리 직접 GOSST 휴리스틱에 비해 2.2%의 비용 개선을 보였다.

• 한국환경복원기술학회지
• /
• 제18권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.

• 천문학회보
• /
• 제40권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.

• 한국경영과학회지
• /
• 제19권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.

• 한국정보통신학회논문지
• /
• 제6권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.