• 제목/요약/키워드: Network theory

검색결과 1,835건 처리시간 0.024초

MFSC: Mean-Field-Theory and Spreading-Coefficient Based Degree Distribution Analysis in Social Network

  • Lin, Chongze;Zheng, Yi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권8호
    • /
    • pp.3630-3656
    • /
    • 2018
  • Degree distribution can provide basic information for structural characteristics and internal relationship in social network. It is a critical procedure for social network topology analysis. In this paper, based on the mean-field theory, we study a special type of social network with exponential distribution of time intervals. First of all, in order to improve the accuracy of analysis, we propose a spreading coefficient algorithm based on intimate relationship, which determines the number of the joined members through the intimacy among members. Then, simulation show that the degree distribution of follows the power-law distribution and has small-world characteristics. Finally, we compare the performance of our algorithm with the existing algorithms, and find that our algorithm improves the accuracy of degree distribution as well as reducing the time complexity significantly, which can complete 29.04% higher precision and 40.94% lower implementation time.

간호학 학술논문의 주제 분석을 위한 텍스트네크워크분석방법 활용 (Using Text Network Analysis for Analyzing Academic Papers in Nursing)

  • 박찬숙
    • Perspectives in Nursing Science
    • /
    • 제16권1호
    • /
    • pp.12-24
    • /
    • 2019
  • Purpose: This study examined the suitability of using text network analysis (TNA) methodology for topic analysis of academic papers related to nursing. Methods: TNA background theories, software programs, and research processes have been described in this paper. Additionally, the research methodology that applied TNA to the topic analysis of the academic nursing papers was analyzed. Results: As background theories for the study, we explained information theory, word co-occurrence analysis, graph theory, network theory, and social network analysis. The TNA procedure was described as follows: 1) collection of academic articles, 2) text extraction, 3) preprocessing, 4) generation of word co-occurrence matrices, 5) social network analysis, and 6) interpretation and discussion. Conclusion: TNA using author-keywords has several advantages. It can utilize recognized terms such as MeSH headings or terms chosen by professionals, and it saves time and effort. Additionally, the study emphasizes the necessity of developing a sophisticated research design that explores nursing research trends in a multidimensional method by applying TNA methodology.

Overlay Multicast Update Strategy Based on Perturbation Theory

  • Shen, Ye;Feng, Jing;Ma, Weijun;Jiang, Lei;Yin, Min
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권1호
    • /
    • pp.171-192
    • /
    • 2017
  • The change of any element in the network is possible to cause performance degradation of the multicast network. So it is necessary to optimize the topology path through the multicast update strategy, which directly affects the performance and user experience of the overlay multicast. In view of the above, a new multicast tree update strategy based on perturbation theory Musp (Multicast Update Strategy based on Perturbation theory) is proposed, which reduces the data transmission interruption caused by the multicast tree update and improves user experiences. According to the multicast tree's elements performance and the topology structure, the Musp strategy defines the multicast metric matrix and based on the matrix perturbation theory it also defines the multicast fluctuation factor. Besides it also demonstrates the calculability of the multicast fluctuation factor presents the steps of the Musp algorithm and calculates the complexity. The experimental results show that compared with other update strategies, as for the sensitivity of the multicast fluctuation factor's energized multicast tree to the network disturbance, the maximum delay of the Musp update strategy is minimal in the case of the local degradation of network performance.

Emergent damage pattern recognition using immune network theory

  • Chen, Bo;Zang, Chuanzhi
    • Smart Structures and Systems
    • /
    • 제8권1호
    • /
    • pp.69-92
    • /
    • 2011
  • This paper presents an emergent pattern recognition approach based on the immune network theory and hierarchical clustering algorithms. The immune network allows its components to change and learn patterns by changing the strength of connections between individual components. The presented immune-network-based approach achieves emergent pattern recognition by dynamically generating an internal image for the input data patterns. The members (feature vectors for each data pattern) of the internal image are produced by an immune network model to form a network of antibody memory cells. To classify antibody memory cells to different data patterns, hierarchical clustering algorithms are used to create an antibody memory cell clustering. In addition, evaluation graphs and L method are used to determine the best number of clusters for the antibody memory cell clustering. The presented immune-network-based emergent pattern recognition (INEPR) algorithm can automatically generate an internal image mapping to the input data patterns without the need of specifying the number of patterns in advance. The INEPR algorithm has been tested using a benchmark civil structure. The test results show that the INEPR algorithm is able to recognize new structural damage patterns.

Adaptive Resonance Theory 2를 이용한 네트워크 기반의 침입 탐지 모델 연구 (Network based Intrusion Detection System using Adaptive Resonance Theory 2)

  • 김진원;노태우;문종섭;고재영;최대식;한광택
    • 정보보호학회논문지
    • /
    • 제12권3호
    • /
    • pp.129-139
    • /
    • 2002
  • 인터넷의 확장에 따라서 네트워크를 통한 침입이 증가되고 있다. 이에 따라 네트워크를 통한 침입에 대하여 즉각적으로 탐지하고 대처하는 기술이 필요하게 되었다. 본 논문은 인터넷의 특성을 악용하여 침입하는 공격들을 탐지하기 위하여 Adaptive Resonance Theory2(ART2) 이론을 이용한다. 정상적인 packet과 여러 가지 공격툴을 사용하여 생산한 인위적인 공격 패킷에 대하여 ART2를 학습한 후 실험한 결과와 기존의 방식들과 비교 분석하였다.

교통망 평형리론을 응용한 결합 모형의 개발

  • 전경수
    • 대한교통학회지
    • /
    • 제7권2호
    • /
    • pp.45-52
    • /
    • 1989
  • The network equilibrium theory is to estimate the travel choices on a transportation network when the resulting travel times and costs are one basis for the choices. Increasing use of this principle on travel assignment problem lead to develop the combined choice models including not only travel options such as mode and route, but location options like trip distribution problems. This paper, first, reviews earlier developments of variable demand network equilibrium models, combined modeles of trip distribution and assignment, and entropy constrained combined models. Then various model structures of combining travel choice models based on network equilibrium theory and entropy constraints are discussed.

  • PDF

A Belief Network Approach for Development of a Nuclear Power Plant Diagnosis System

  • I.K. Hwang;Kim, J.T.;Lee, D.Y.;C.H. Jung;Kim, J.Y.;Lee, J.S.;Ha, C.S .m
    • 한국원자력학회:학술대회논문집
    • /
    • 한국원자력학회 1998년도 춘계학술발표회논문집(1)
    • /
    • pp.273-278
    • /
    • 1998
  • Belief network(or Bayesian network) based on Bayes' rule in probabilistic theory can be applied to the reasoning of diagnostic systems. This paper describes the basic theory of concept and feasibility of using the network for diagnosis of nuclear power plants. An example shows that the probabilities of root causes of a failure are calculated from the measured or believed evidences.

  • PDF

Decision making for Shipping Network based on Adaptive Cumulative Prospect Theory

  • Pham Thi Yen;Nguyen Phung Hung;Truong Ngoc Cuong;Hwan-Seong Kim
    • 한국항해항만학회:학술대회논문집
    • /
    • 한국항해항만학회 2023년도 춘계학술대회
    • /
    • pp.256-257
    • /
    • 2023
  • This paper aims to propose optimal method to assess and cumulate the daily profit for liner shipping to support the shipping lines in making optimal decision with the highest average daily profit. This paper not only explains the actual calculated results align with decision-makers' behavior from concepts indicated in cumulative prospect theory but also contributes to an easy-to-apply method for liner shipping network predictability in and provides optimal decision-making is helpful for shipping managers for the best effective selection of the most appropriate alternative under uncertainties.

  • PDF

복잡계 네트워크 기반 무선 네트워크를 위한 브로드캐스트 스케줄링 기법 (Broadcast Scheduling for Wireless Networks Based on Theory of Complex Networks)

  • 박종홍;서순호;정종문
    • 인터넷정보학회논문지
    • /
    • 제17권5호
    • /
    • pp.1-8
    • /
    • 2016
  • 본 논문에서는 복잡계 네트워크 이론에 기반한 무선 네트워크 토폴로지를 구성하고, 실제 환경의 토폴로지 구성을 반영한 척도없는 네트워크의 노드 링크 분포 확률을 분석하여 실제 무선 네트워크를 위한 브로드캐스트 전송 스케줄링 알고리즘 기법을 제안한다. 본 논문에서는 기존의 브로드캐스트 스케줄링 알고리즘 기법들이 반영하지 못한 복잡계 네트워크의 특성을 분석하고 그 특성에 맞는 알고리즘 기법과 분석 기법에 대하여 제안한다. 실험 결과를 통해 제안하는 방식의 알고리즘법이 네트워크의 지연시간 감소와 전송효율에 있어서의 우수함을 밝히고, 복잡계 네트워크 기반 무선 네트워크의 전송효율과 전체지연시간에 대한 최적화 방식의 기법을 제안한다.

Social-Aware Resource Allocation Based on Cluster Formation and Matching Theory in D2D Underlaying Cellular Networks

  • Zhuang, Wenqin;Chen, Mingkai;Wei, Xin;Li, Haibo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권5호
    • /
    • pp.1984-2002
    • /
    • 2020
  • With the appearance of wireless spectrum crisis in traditional cellular network, device-to-device (D2D) communication has been regarded as a promising solution to ease heavy traffic burden by enabling precise content delivery among mobile users. However, due to the channel sharing, the interference between D2D and cellular users can affect the transmission rate and narrow the throughput in the network. In this paper, we firstly present a weighted interference minimization cluster formation model involving both social attribute and physical closeness. The weighted-interference, which is evaluated under the susceptible-infected(SI) model, is utilized to gather user in social and physical proximity. Then, we address the cluster formation problem via spectrum clustering with iterative operation. Finally, we propose the stable matching theory algorithm in order to maximize rate oriented to accomplish the one-to-one resource allocation. Numerical results show that our proposed scheme acquires quite well clustering effect and increases the accumulative transmission rate compared with the other two advanced schemes.