• Title/Summary/Keyword: Connectivity Index

Search Result 122, Processing Time 0.033 seconds

A Study on the Analysis of Connectivity for Green Space Planning in Daejeon Metropolitan City (대전시 녹지계획을 위한 연결성 분석에 대한 연구)

  • Cheong, Yong-Moon;Kim, Sun-Tae;Kim, Myoung-Soo
    • Journal of the Korean Society of Environmental Restoration Technology
    • /
    • v.5 no.6
    • /
    • pp.14-23
    • /
    • 2002
  • Daejeon is a large city in Korea and very high-speedly developing city. Recently urban area is expanding and large forest patch is fragmenting into small habitats because of urban sprawl. The fragmentation of large forest patch decreases the size of habitats and increases the loss of biodiversity in urban area. This study is to analysis the connectivity of green space of Daejeon metropolitan city, and suggest the optimum location of greening site and corridor in order to increase the connectivity of green space of Daejeon metropolitan city. The findings of this study are as follows; (1) The result of this study showed that ${\alpha}$ and ${\gamma}$ index are -0.24 and 0.20. A ${\alpha}$ index is very low and a ${\gamma}$ index is relatively low. (2) The dispersion was very high, for urban forest patches were isolated through fragmentation. Therefore, it needed ecological corridors in order to connect the patches. (3) A urban streams were very important in connectivity of urban green space. Urban riparian corridor must be preserved and restored. (4) A urban green space policy and planning must be prepared to increase the connectivity and assessment of alternatives must be accomplished from perspective of connectivity. The results of this study show the practical implications in perspective of green space planning and policy in Daejeon metropolitan city. The suggestions by findings of this study are to connect green space between large forest patch in urban fringe and island green space in inner city. Also, It is required that urban stream is restored to natural feature for use of corridor by wildlife.

A Model for Evaluating the Connectivity of Multimodal Transit Networks (복합수단 대중교통 네트워크의 연계성 평가 모형)

  • Park, Jun-Sik;Gang, Seong-Cheol
    • Journal of Korean Society of Transportation
    • /
    • v.28 no.3
    • /
    • pp.85-98
    • /
    • 2010
  • As transit networks are becoming more multimodal, the concept of connectivity of transit networks becomes important. This study aims to develop a quantitative model for measuring the connectivity of multimodal transit networks. To that end, we select, as evaluation measures of a transit line, its length, capacity, and speed. We then define the connecting power of a transit line as the product of those measures. The degree centrality of a node, which is a widely used centrality measure in social network analysis, is employed with appropriate modifications suited for transit networks. Using the degree centrality of a transit stop and the connecting powers of transit lines serving the transit stop, we develop an index quantifying the level of connectivity of the transit stop. From the connectivity indexes of transit stops, we derive the connectivity index of a transit line as well as an area of a multimodal transit network. In addition, we present a method to evaluate the connectivity of a transfer center using the connectivity indexes of transit stops and passenger acceptance rate functions. A case study shows that the connectivity evaluation model developed in this study takes well into consideration characteristics of multimodal transit networks, adequately measures the connectivity of transit stops, lines, and areas, and furthermore can be used in determining the level of service of transfer centers.

SOME INEQUALITIES FOR GENERAL SUM-CONNECTIVITY INDEX

  • MATEJIC, M.M.;MILOVANOVIC, I.Z.;MILOVANOVIC, E.I.
    • Journal of applied mathematics & informatics
    • /
    • v.38 no.1_2
    • /
    • pp.189-200
    • /
    • 2020
  • Let G be a simple connected graph with n vertices and m edges. Denote by d1 ≥ d2 ≥ ⋯ ≥ dn > 0 and d(e1) ≥ d(e2) ≥ ⋯ ≥ d(em) sequences of vertex and edge degrees, respectively. If vertices vi and vj are adjacent, we write i ~ j. The general sum-connectivity index is defined as 𝒳α(G) = ∑i~j(di + dj)α, where α is an arbitrary real number. Firstly, we determine a relation between 𝒳α(G) and 𝒳α-1(G). Then we use it to obtain some new bounds for 𝒳α(G).

Environment Friendly Urban Open Space Planning - Enhancing the Connectivity of Habitats in Seoul, Korea - (환경친화적인 도시공원녹지계획 연구 - 생물서식처 연결성 향상을 위한 서울시 녹지조성 방안을 중심으로 -)

  • 안동만;김명수
    • Journal of the Korean Institute of Landscape Architecture
    • /
    • v.31 no.1
    • /
    • pp.34-41
    • /
    • 2003
  • Connectivity is a quantitative indicator of landscape structure, and connectivity of urban green areas is an indicator of ecological integrity in urban landscapes. The purposes of this study are to assess the connectivity of urban green areas in Seoul, and to develop a method of siting new green areas for better connectivity. Diverse methods for connectivity assessment and indices of connectivity are reviewed and applied to the connectivity assesment of green areas in Seoul. The indices of connectivity of green areas in Seoul turned out to be higher than expected, maybe because many of them are rather evenly distributed, serving as stepping stones, and because there are many riparian corridors, including the Han River. Analysis also shows the optimum location of new green space patches or corridors will be those spots that would link the mainland, or large green areas outside the city, and existing green areas in the city. Restoration of urban streams as ecological corridors will significantly enhance connectivity. Three different scenarios with increasing numbers of new green areas in the city were then prepared. The changes of connectivity were measured and the possible success rates of animal dispersal were simulated. The results revealed that restoration of streams will increase the connectivity and success rates of animal dispersal.

The Study of Physical Properties for the Organic Compounds and their Binary Mixture according to Molecular Connectivity Method (Molecular Connectivity法을 이용한 有機化合物과 二成分 混合物에 對한 物理化學的 性質에 關한 硏究 (Ⅱ))

  • Ui-Rak Kim;Kyung-Sub Min;Myung-Jae Lee;Sang-Hae Kim;Bong-Jin Jeong
    • Journal of the Korean Chemical Society
    • /
    • v.36 no.4
    • /
    • pp.485-495
    • /
    • 1992
  • The viscosities of organic compounds (alcohols, acetates, alkanes, acids, substituted $NH_2$) in liquid states, gas states and the binary mixtures of n-alkane / 1-chloroalkane were calculated by molecular modeling techniques. The molecular descriptors of molecular modeling technique are Molecular connectivity indices, Wiener indices and ad hoc descriptors, which can encode the information of compound properties about the effect of size, branching, cyclization, unsaturation, heteroatom content, polarizability, and so on. The successful results among method have been Molecular connectivity indices, binary mixtures of n-alkane / 1-chloroalkane, Wiener indices for gas state and ad hoc descriptor for liquid states. Also we obtained the regression equations for viscosities using molecular modeling indices for gas, liquid states and binary mixtures of n-alkane / 1-chloroalkane. The calculated viscosity values for organic compounds are in good agreement with experimental results.

  • PDF

Indexing Method for Constraint Moving Objects Using Road Connectivity (도로의 연결성을 이용한 제약적 이동 객체에 대한 색인 기법)

  • Bok, Kyoung-Soo;Yoon, Ho-Won;Seo, Dong-Min;Rho, Jin-Seok;Cho, Ki-Hyung;Yoo, Jae-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.7
    • /
    • pp.1-10
    • /
    • 2007
  • In this paper, we propose an indexing method for efficiently updating current positions of moving objects on road networks. The existing road network models increase update costs when objects move to adjacent road segments because their connectivity is not preserved. We propose an intersection based network model and a new index structure to solve this problem. The proposed intersection based network model preserves network connectivity through splitting road networks to contain intersection nodes always. The proposed index structure In our experiments, we show that our method is about 3 times faster than an existing index structure in terms of update costs.

Highly Correlating Distance/Connectivity-Based Topological Indices. 1:QSPR Studies of Alkanes

  • Shamsipur, Mojtaba;Hemmateenejad, Bahram;Akhond, Morteza
    • Bulletin of the Korean Chemical Society
    • /
    • v.25 no.2
    • /
    • pp.253-259
    • /
    • 2004
  • Some new topological indices based on the distance matrix and Randic connectivity (as graph invariants) are proposed. The calculation of these indices is simple and they have good discriminating ability toward alkanes. Incorporating the number of carbon atoms to one of the calculated indices gives a highly correlating topological index (Sh index) which found to correlate with selected physicochemical properties of wide range of alkanes, specially, their boiling points. Most of the investigated properties are well modeled (with $r^2$> 0.99) by the Sh index. Meanwhile, the resulting regressions were compared with the results based on the well-established Randic and newly reported Xu indices and, in most cases, better results were obtained by the Sh index. Moreover, multiple linear regression analysis of the alkane properties via calculated indices gives highly correlating models with low standard errors.

EXTREMAL ATOM-BOND CONNECTIVITY INDEX OF CACTUS GRAPHS

  • ASHRAFI, ALI REZA;DEHGHAN-ZADEH, TAYEBEH;HABIBI, NADER
    • Communications of the Korean Mathematical Society
    • /
    • v.30 no.3
    • /
    • pp.283-295
    • /
    • 2015
  • The atom-bond connectivity index of a graph G (ABC index for short) is defined as the summation of quantities $\sqrt{\frac{d(u)+d(v)-2}{d(u)d(v)}}$ over all edges of G. A cactus graph is a connected graph in which every block is an edge or a cycle. The aim of this paper is to obtain the first and second maximum values of the ABC index among all n vertex cactus graphs.

Inter-city Flight Connectivity and Polycentricity in the Yeongnam Region (영남권 도시 간 화물 연계성과 다중심성)

  • Choi, Byung-Doo;Song, Minjeong
    • Journal of the Korean association of regional geographers
    • /
    • v.21 no.1
    • /
    • pp.39-61
    • /
    • 2015
  • This paper reviews literature on urban connectivity, and reconsiders the concept of polycentric urban region and its analysis methods, and then, applying them, explores the inter-city flight connectivity and polycentricity in the Yeongnam Region. As results of analysis, it has been identified that the entropy index shows a relatively dispersing pattern of the urban network of the region, and that the dominance index reveals a more polycentric (that is, less hierarchic) character of the region than that of the Capital Region, while some differences are found among individual cities in the symmetry of connectivity and the dominance and/or dependence index. Even though flows of products in textile, basic metals, and automobile industries in sub-divisions of manufacture appear a pattern of concentring into the first central city, the urban network of the Yeongnam Region in general can be characterized as a polycentrism, and policy for polycentric regional development would be suggested.

  • PDF

Comparison of clustering with yeast microarray gene expression data (효모 마이크로어레이 유전자발현 데이터에 대한 군집화 비교)

  • Lee, Kyung-A;Kim, Jae-Hee
    • Journal of the Korean Data and Information Science Society
    • /
    • v.22 no.4
    • /
    • pp.741-753
    • /
    • 2011
  • We accomplish clustering analyses for yeast cell cycle microarray expression data. We compare model-based clustering, K-means, PAM, SOM and hierarchical Ward method with yeast data. As the validity measure for clustering results, connectivity, Dunn Index and silhouette values are computed and compared.