• Title/Summary/Keyword: network topological measure

Search Result 15, Processing Time 0.024 seconds

Bridge-edges Mining in Complex Power Optical Cable Network based on Minimum Connected Chain Attenuation Topological Potential

  • Jiang, Wanchang;Liu, Yanhui;Wang, Shengda;Guo, Jian
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.3
    • /
    • pp.1030-1050
    • /
    • 2021
  • The edges with "bridge characteristic" play the role of connecting the communication between regions in power optical cable network. To solve the problem of mining edges with "bridge characteristic" in provincial power optical cable network, the complex power optical cable network model is constructed. Firstly, to measure the generated potential energy of all nodes in n-level neighborhood local structure for one edge, the n-level neighborhood local structure topological potential is designed. And the minimum connected chain attenuation is designed to measure the attenuation degree caused by substituted edges. On the basis of that, the minimum connected chain attenuation topological potential based measurement is designed. By using the designed measurement, a bridge-edges mining algorithm is proposed to mine edges with "bridge characteristic". The experiments are conducted on the physical topology of the power optical cable network in Jilin Province. Compared with that of other three typical methods, the network efficiency and connectivity of the proposed method are decreased by 3.58% and 28.79% on average respectively. And the proposed method can not only mine optical cable connection with typical "bridge characteristic" but also can mine optical cables without obvious characteristics of city or voltage, but it have "bridge characteristic" in the topology structure.

A Measure of Electric Network Centrality Due to Multiple Contingencies (다중고장에 대한 전기 네트워크 구심성 척도)

  • Dosanoa, Rodel D.;Song, Hwa-Chang;Lee, Byong-Jun
    • Proceedings of the KIEE Conference
    • /
    • 2008.07a
    • /
    • pp.286-287
    • /
    • 2008
  • This paper proposes a power system blackout model and devises a method of identification and selection of higher-order contingencies that may threaten power system security. To study how failures spread in power grids, network observability based on topological concept is utilized which provide a means of monitoring network evolutions due to multiple contingencies. The simulations and results are presented using the IEEE 118-bus test system.

  • PDF

Analysis of the fokker-plank equation for the dynamics of langevine cometitive learning neural network (Fokker-plank 방정식의 해석을 통한 Langevine 경쟁학습의 동역학 분석)

  • 석진욱;조성원
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.34C no.7
    • /
    • pp.82-91
    • /
    • 1997
  • In this paper, we analyze the dynamics of langevine competitive learning neural network based on its fokker-plank equation. From the viewpont of the stochastic differential equation (SDE), langevine competitive learning equation is one of langevine stochastic differential equation and has the diffusin equation on the topological space (.ohm., F, P) with probability measure. We derive the fokker-plank equation from the proposed algorithm and prove by introducing a infinitestimal operator for markov semigroups, that the weight vector in the particular simplex can converge to the globally optimal point under the condition of some convex or pseudo-convex performance measure function. Experimental resutls for pattern recognition of the remote sensing data indicate the superiority of langevine competitive learning neural network in comparison to the conventional competitive learning neural network.

  • PDF

The Need for Paradigm Shift in Semantic Similarity and Semantic Relatedness : From Cognitive Semantics Perspective (의미간의 유사도 연구의 패러다임 변화의 필요성-인지 의미론적 관점에서의 고찰)

  • Choi, Youngseok;Park, Jinsoo
    • Journal of Intelligence and Information Systems
    • /
    • v.19 no.1
    • /
    • pp.111-123
    • /
    • 2013
  • Semantic similarity/relatedness measure between two concepts plays an important role in research on system integration and database integration. Moreover, current research on keyword recommendation or tag clustering strongly depends on this kind of semantic measure. For this reason, many researchers in various fields including computer science and computational linguistics have tried to improve methods to calculating semantic similarity/relatedness measure. This study of similarity between concepts is meant to discover how a computational process can model the action of a human to determine the relationship between two concepts. Most research on calculating semantic similarity usually uses ready-made reference knowledge such as semantic network and dictionary to measure concept similarity. The topological method is used to calculated relatedness or similarity between concepts based on various forms of a semantic network including a hierarchical taxonomy. This approach assumes that the semantic network reflects the human knowledge well. The nodes in a network represent concepts, and way to measure the conceptual similarity between two nodes are also regarded as ways to determine the conceptual similarity of two words(i.e,. two nodes in a network). Topological method can be categorized as node-based or edge-based, which are also called the information content approach and the conceptual distance approach, respectively. The node-based approach is used to calculate similarity between concepts based on how much information the two concepts share in terms of a semantic network or taxonomy while edge-based approach estimates the distance between the nodes that correspond to the concepts being compared. Both of two approaches have assumed that the semantic network is static. That means topological approach has not considered the change of semantic relation between concepts in semantic network. However, as information communication technologies make advantage in sharing knowledge among people, semantic relation between concepts in semantic network may change. To explain the change in semantic relation, we adopt the cognitive semantics. The basic assumption of cognitive semantics is that humans judge the semantic relation based on their cognition and understanding of concepts. This cognition and understanding is called 'World Knowledge.' World knowledge can be categorized as personal knowledge and cultural knowledge. Personal knowledge means the knowledge from personal experience. Everyone can have different Personal Knowledge of same concept. Cultural Knowledge is the knowledge shared by people who are living in the same culture or using the same language. People in the same culture have common understanding of specific concepts. Cultural knowledge can be the starting point of discussion about the change of semantic relation. If the culture shared by people changes for some reasons, the human's cultural knowledge may also change. Today's society and culture are changing at a past face, and the change of cultural knowledge is not negligible issues in the research on semantic relationship between concepts. In this paper, we propose the future directions of research on semantic similarity. In other words, we discuss that how the research on semantic similarity can reflect the change of semantic relation caused by the change of cultural knowledge. We suggest three direction of future research on semantic similarity. First, the research should include the versioning and update methodology for semantic network. Second, semantic network which is dynamically generated can be used for the calculation of semantic similarity between concepts. If the researcher can develop the methodology to extract the semantic network from given knowledge base in real time, this approach can solve many problems related to the change of semantic relation. Third, the statistical approach based on corpus analysis can be an alternative for the method using semantic network. We believe that these proposed research direction can be the milestone of the research on semantic relation.

Indices Characterizing Road Network on Geo-Spatial Imagery as Transportation Network Analysis

  • Lee, Ki-Won
    • Korean Journal of Remote Sensing
    • /
    • v.20 no.1
    • /
    • pp.57-64
    • /
    • 2004
  • In GIS-based network analysis, topological measure of network structure can be considered as one of important factors in the urban transportation analysis. Related to this measure, it is known that the connectivity indices such as alpha index and gamma index, which mean degree of network connectivity and complexity on a graph or a circuit, provide fundamental information. On the other hand, shimbel index is one of GIS-based spatial metrics to characterize degree of network concentration. However, the approach using these quantitative indices has not been widely used in practical level yet. In this study, an application program, in complied as extension, running on ArcView- GIS is implemented and demonstrated case examples using basic layers such as road centerline and administrative boundary. In this approach, geo-spatial imagery can be effectively used to actual applications to determine the analysis zone, which is composed of networks to extract these indices. As the results of the implementation and the case examples, it is notified that alpha and gamma indices as well as shimbel index can be used as referential data or auxiliary information for urban planning and transportation planning.

An Analysis of Broadband Accessibility at the County Level in the United Slates: a Spatial Analytical Approach Using GIS (미국 카운티의 초고속 인터넷 서비스에 대한 접근성 분석: GIS를 이용한 공간 분석적 접근)

  • Lee, Gun-Hak
    • Journal of the Korean Geographical Society
    • /
    • v.43 no.2
    • /
    • pp.202-219
    • /
    • 2008
  • As demand for high speed Internet service has explosively increased in the United States for the past decade, the construction or upgrades of telecommunication infrastructure has also been rapidly followed. Though currently many people in urbanized areas can be provided advanced broadband services, there are still challengeable areas to be served, such as remote or low populated areas because those areas are potentially non-profitable to commercial broadband service providers. This paper addresses the spatial disparity or in a broader term, the 'digital divide' of the broadband access by the county level in the United States. We propose the quantified measure of the county level broadband accessibility for identifying such digital divide. The developed measure is a hybrid form of the classical gravity based potential model and network topological accessibility, encouraged from the lack of prior efforts eying to explicitly incorporate the understanding of the whole process of the Internet access. The computational tasks are performed in a GIS platform, which includes several programmed functions.

Distributed Prevention Mechanism for Network Partitioning in Wireless Sensor Networks

  • Wang, Lili;Wu, Xiaobei
    • Journal of Communications and Networks
    • /
    • v.16 no.6
    • /
    • pp.667-676
    • /
    • 2014
  • Connectivity is a crucial quality of service measure in wireless sensor networks. However, the network is always at risk of being split into several disconnected components owing to the sensor failures caused by various factors. To handle the connectivity problem, this paper introduces an in-advance mechanism to prevent network partitioning in the initial deployment phase. The approach is implemented in a distributed manner, and every node only needs to know local information of its 1-hop neighbors, which makes the approach scalable to large networks. The goal of the proposed mechanism is twofold. First, critical nodes are locally detected by the critical node detection (CND) algorithm based on the concept of maximal simplicial complex, and backups are arranged to tolerate their failures. Second, under a greedy rule, topological holes within the maximal simplicial complex as another potential risk to the network connectivity are patched step by step. Finally, we demonstrate the effectiveness of the proposed algorithm through simulation experiments.

Hierarchical Folded Hyper-Star Network(HFH): A New Interconnection Network Based on Folded Hyper-Star Network (계층적 Folded 하이퍼-스타 연결망(HFH): Folded 하이퍼-스타 연결망을 기반으로 하는 새로운 상호연결망)

  • Kim, Jong-Seok;Lee, Hyeong-Ok
    • The KIPS Transactions:PartA
    • /
    • v.15A no.2
    • /
    • pp.95-100
    • /
    • 2008
  • In this paper, we propose a new interconnection network topology, hierarchical folded hyper-star network HFH($C_n,\;C_n$), which is based on folded hyper-star network. Our results show that the proposed hierarchical folded hyper-star network performs very competitively in comparison to folded hyper-star network and hierarchical network HCN(m,m), HFN(m,m) have been previously proposed, when diameter ${\times}$ degree is used as a network cost measure. We also investigate various topological properties of HFH($C_n,\;C_n$) including connectivity, routing algorithm, diameter, broadcasting.

Validity Study of Kohonen Self-Organizing Maps

  • Huh, Myung-Hoe
    • Communications for Statistical Applications and Methods
    • /
    • v.10 no.2
    • /
    • pp.507-517
    • /
    • 2003
  • Self-organizing map (SOM) has been developed mainly by T. Kohonen and his colleagues as a unsupervised learning neural network. Because of its topological ordering property, SOM is known to be very useful in pattern recognition and text information retrieval areas. Recently, data miners use Kohonen´s mapping method frequently in exploratory analyses of large data sets. One problem facing SOM builder is that there exists no sensible criterion for evaluating goodness-of-fit of the map at hand. In this short communication, we propose valid evaluation procedures for the Kohonen SOM of any size. The methods can be used in selecting the best map among several candidates.

Social Network Analysis for the Effective Adoption of Recommender Systems (추천시스템의 효과적 도입을 위한 소셜네트워크 분석)

  • Park, Jong-Hak;Cho, Yoon-Ho
    • Journal of Intelligence and Information Systems
    • /
    • v.17 no.4
    • /
    • pp.305-316
    • /
    • 2011
  • Recommender system is the system which, by using automated information filtering technology, recommends products or services to the customers who are likely to be interested in. Those systems are widely used in many different Web retailers such as Amazon.com, Netfix.com, and CDNow.com. Various recommender systems have been developed. Among them, Collaborative Filtering (CF) has been known as the most successful and commonly used approach. CF identifies customers whose tastes are similar to those of a given customer, and recommends items those customers have liked in the past. Numerous CF algorithms have been developed to increase the performance of recommender systems. However, the relative performances of CF algorithms are known to be domain and data dependent. It is very time-consuming and expensive to implement and launce a CF recommender system, and also the system unsuited for the given domain provides customers with poor quality recommendations that make them easily annoyed. Therefore, predicting in advance whether the performance of CF recommender system is acceptable or not is practically important and needed. In this study, we propose a decision making guideline which helps decide whether CF is adoptable for a given application with certain transaction data characteristics. Several previous studies reported that sparsity, gray sheep, cold-start, coverage, and serendipity could affect the performance of CF, but the theoretical and empirical justification of such factors is lacking. Recently there are many studies paying attention to Social Network Analysis (SNA) as a method to analyze social relationships among people. SNA is a method to measure and visualize the linkage structure and status focusing on interaction among objects within communication group. CF analyzes the similarity among previous ratings or purchases of each customer, finds the relationships among the customers who have similarities, and then uses the relationships for recommendations. Thus CF can be modeled as a social network in which customers are nodes and purchase relationships between customers are links. Under the assumption that SNA could facilitate an exploration of the topological properties of the network structure that are implicit in transaction data for CF recommendations, we focus on density, clustering coefficient, and centralization which are ones of the most commonly used measures to capture topological properties of the social network structure. While network density, expressed as a proportion of the maximum possible number of links, captures the density of the whole network, the clustering coefficient captures the degree to which the overall network contains localized pockets of dense connectivity. Centralization reflects the extent to which connections are concentrated in a small number of nodes rather than distributed equally among all nodes. We explore how these SNA measures affect the performance of CF performance and how they interact to each other. Our experiments used sales transaction data from H department store, one of the well?known department stores in Korea. Total 396 data set were sampled to construct various types of social networks. The dependant variable measuring process consists of three steps; analysis of customer similarities, construction of a social network, and analysis of social network patterns. We used UCINET 6.0 for SNA. The experiments conducted the 3-way ANOVA which employs three SNA measures as dependant variables, and the recommendation accuracy measured by F1-measure as an independent variable. The experiments report that 1) each of three SNA measures affects the recommendation accuracy, 2) the density's effect to the performance overrides those of clustering coefficient and centralization (i.e., CF adoption is not a good decision if the density is low), and 3) however though the density is low, the performance of CF is comparatively good when the clustering coefficient is low. We expect that these experiment results help firms decide whether CF recommender system is adoptable for their business domain with certain transaction data characteristics.