• Title/Summary/Keyword: Probability of Connectivity

Search Result 54, Processing Time 0.019 seconds

Selecting Protected Area Using Species Richness

  • Kwon, Hyuksoo;Kim, Jiyoen;Seo, Changwan
    • Korean Journal of Environment and Ecology
    • /
    • v.29 no.1
    • /
    • pp.14-20
    • /
    • 2015
  • We created species richness maps of mammals, birds and plants using "Nnational Ecosystem Survey" data and identified correlations between species richness maps of each taxa. We examine the distribution of species richness of each taxa and calculated conservation priority rank through plotting species-area curves using an additive benefit function in Zonation. The conclusions of this study are as follows. First, plant showed high species richness in Gangwon province and Baekdudaegan, and mammals showed high species richness at eastern slope of Baekdudaegan in Gangwon province unusually and the species richness of mammals distributed equally except Gyeonggi and Chungnam province. However, birds showed high species richness in the west costal because the area is the major route of winter migratory birds. Second, correlation of each taxa's distribution is not significant. Correlation between mammals and birds is positive but correlations between birds and others are negative. Because mammals inhabit in forest but birds mostly live in coastal wetlands and rivers. Therefore, bird's habitats are not shared with other habitats. Third, the probability of mammals occurrence is very low under 25% in species-area curve, others increase proportionally to area. Birds increase dramatically richness at 10% because bird's habitat is concentrated in coastal wetlands and rivers. Plants increased gently species richness due to large forest in Gangwon province. We can calculate the predicted number of species in curves and plan various conservation strategies using the marginal number of species. Finally, high priority ranks for conservation distributed mainly in Gangwon province and Baekdudaegan. When we compared with priority map and terrestrial national parks, the parks were evaluated as high priority ranks. However, the rank of parks away from Baekdudaegan was low. This study has the meaning of selecting conservation priority area using National Ecosystem Survey. In spite of the omission of survey data in national parks and Baekdudaegan, the results were good. Therefore, the priority rank method using species distribution models is useful to selecting protected areas and improving conservation plans. However, it is needed to select protected areas considering various evaluation factors, such as rarity, connectivity, representativeness, focal species and so on because there is a limit to select protected area only using species richness.

A Vine-Based Stochastic Loading Technique in Pedestrian Networks Considering Space Syntax Theory (Space Syntax Theory를 반영한 덩굴망기반 확률적 보행네트워크 배정기법)

  • Kim, Jong Hyung;Lee, Mee Young;Nam, Doo Hee
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.15 no.6
    • /
    • pp.71-79
    • /
    • 2016
  • Evaluation of the walkability of the urban pedestrian network requires construction of a pedestrian network model that reflects Space Syntax Theory. Space Syntax Theory deduces an integration value through which materials for evaluation of the pedestrian network's connectivity can be produced; and can aid in illustrating the ease of walkability through the model's calculation of pedestrian indices such as movability, comfort, and safety. But the representation of space syntax theory in the pedestrian network requires that turn delay be added by means of a network-type construction method. While tree-based Dial Algorithm proposed for the logit-based probability walkability distribution model may be effective for link-based pedestrian volume distribution, it requires further network expansion to reflect turn delays. In this research, Vine-based Dial Algorithm is executed in order to obtain a measure reflecting the integration value for Space Syntax Theory. The Vine-based Dial Algorithm of two adjacent links, which forms the minimum unit of the Vine network, has the advantage of encompassing turn delay, and thus eliminates the need for network expansion. Usage of the model to evaluation of complicated pedestrian spheres such as urban roads is left to further research. Especially the progression of the proposed method is deduced through case study.

A Study on the Constructing Discrete Fracture Network in Fractured-Porous Medium with Rectangular Grid (사각 격자를 이용한 단열-다공암반내 분리 단열망 구축기법에 대한 연구)

  • Han, Ji-Woong;Hwang, Yong-Soo;Kang, Chul-Hyung
    • Journal of Nuclear Fuel Cycle and Waste Technology(JNFCWT)
    • /
    • v.4 no.1
    • /
    • pp.9-15
    • /
    • 2006
  • For the accurate safety assessment of potential radioactive waste disposal site which is located in the crystalline rock it is important to simulate the mass transportation through engineered and natural barrier system precisely, characterized by porous and fractured media respectively. In this work the methods to construct discrete fracture network for the analysis of flow and mass transport through fractured-porous medium are described. The probability density function is adopted in generating fracture properties for the realistic representation of real fractured rock. In order to investigate the intersection between a porous and a fractured medium described by a 2 dimensional rectangular and a cuboid grid respectively, an additional imaginary fracture is adopted at the face of a porous medium intersected by a fracture. In order to construct large scale flow paths an effective method to find interconnected fractures and algorithms of swift detecting connectivities between fractures or porous medium and fractures are proposed. These methods are expected to contribute to the development of numerical program for the simulation of radioactive nuclide transport through fractured-porous medium from radioactive waste disposal site.

  • PDF

Multi-Hop Vehicular Cloud Construction and Resource Allocation in VANETs (VANET 망에서 다중 홉 클라우드 형성 및 리소스 할당)

  • Choi, Hyunseok;Nam, Youngju;Lee, Euisin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.8 no.11
    • /
    • pp.263-270
    • /
    • 2019
  • Vehicular cloud computing is a new emerging technology that can provide drivers with cloud services to enable various vehicular applications. A vehicular cloud is defined as a set of vehicles that share their own resources. Vehicles should collaborate with each other to construct vehicular clouds through vehicle-to-vehicle communications. Since collaborating vehicles to construct the vehicular cloud have different speeds, directions and locations respectively, the vehicular cloud is constructed in multi-hop communication range. Due to intermittent wireless connectivity and low density of vehicles with the limited resources, the construction of vehicular cloud with multi-hop communications has become challenging in vehicular environments in terms of the service success ratio, the service delay, and the transmitted packet number. Thus, we propose a multi-hop vehicular cloud construction protocol that increases the service success ratio and decreases the service delay and the transmitted packet number. The proposed protocol uses a connection time-based intermediate vehicle selection scheme to reduce the cloud failure probability of multi-hop vehicular cloud. Simulation results conducted in various environments verify that the proposed protocol achieves better performance than the existing protocol.