• 제목/요약/키워드: Degree of node

검색결과 318건 처리시간 0.025초

Internet Worm Propagation Model Using Centrality Theory

  • Kwon, Su-Kyung;Choi, Yoon-Ho;Baek, Hunki
    • Kyungpook Mathematical Journal
    • /
    • 제56권4호
    • /
    • pp.1191-1205
    • /
    • 2016
  • The emergence of various Internet worms, including the stand-alone Code Red worm that caused a distributed denial of service (DDoS), has prompted many studies on their propagation speed to minimize potential damages. Many studies, however, assume the same probabilities for initially infected nodes to infect each node during their propagation, which do not reflect accurate Internet worm propagation modelling. Thus, this paper analyzes how Internet worm propagation speed varies according to the number of vulnerable hosts directly connected to infected hosts as well as the link costs between infected and vulnerable hosts. A mathematical model based on centrality theory is proposed to analyze and simulate the effects of degree centrality values and closeness centrality values representing the connectivity of nodes in a large-scale network environment on Internet worm propagation speed.

SNS에서의 개선된 소셜 네트워크 분석 방법 (Improved Social Network Analysis Method in SNS)

  • 손종수;조수환;권경락;정인정
    • 지능정보연구
    • /
    • 제18권4호
    • /
    • pp.117-127
    • /
    • 2012
  • 최근 온라인 소셜 네트워크 서비스(SNS)의 사용자가 크게 늘어나고 있으며 다양한 분야에서 SNS의 사용자 관계 구조 및 메시지를 분석하기 위한 연구를 진행하고 있다. 그러나 대부분의 소셜 네트워크 분석 방법들은 노드 사이의 최단 거리를 기초로 하고 있으므로 계산 시간이 오래 걸린다. 이는 점차 대형화 되어가는 SNS의 데이터를 여러 분야에서 활용하는데 걸림돌이 되고 있다. 이에 따라 본 논문에서는 SNS의 사용자 그래프에서 사용자간 최단거리를 빠르게 찾기 위한 휴리스틱 기반의 최단 경로 탐색 방법을 제안한다. 제안하는 방법은 1) 트리로 표현된 소셜 네트워크에서 시작 노드와 목표 노드를 설정한다. 그리고 2) 만약 목표 노드가 경사 트리의 단말에 있다면 경사 트리가 시작하는 노드를 임시 골 노드로 설정한다. 마지막으로 3) 연결의 차수를 평가값으로 하는 휴리스틱 기반 최단거리 탐색을 수행한다. 이렇게 최단거리를 탐색한 후 매개 중심성 분석(Betweenness Centrality) 및 근접 중심성(Closeness Centrality)를 계산한다. 제안하는 방법을 사용하면 소셜 네트워크 분석에서 가장 많은 시간이 필요한 최단거리 탐색을 빠르게 수행할 수 있으므로 소셜 네트워크 분석의 효율성을 기대할 수 있다. 본 논문에서 제안하는 방법을 검증하기 위하여 약 16만 명으로 구성된 SNS에서의 실제 데이터를 이용하여 매개 중심성 분석과 근접 중심성 분석을 수행하였다. 실험 결과, 제안하는 방법은 전통적 방식에 비하여 매개 중심성, 근접 중심성의 계산 시간이 각각 6.8배, 1.8배 더 빠른 결과를 보였다. 본 논문에서 제안한 방법은 소셜 네트워크 분석의 시간을 향상시켜 여러 분야에서 사회 현상 및 동향을 분석하는데 유용하게 활용될 수 있다.

혼합유한요소모델을 이용한 두꺼운 복합적층판의 불규칙 진동해석(1)-이론적 고찰 (Random Vibration Analysis of Thick Composite Laminated Plate Using Mixed Finite Element Model (1))

  • 석근영;강주원
    • 한국공간정보시스템학회:학술대회논문집
    • /
    • 한국공간정보시스템학회 2004년도 춘계 학술발표회 논문집 제1권1호(통권1호)
    • /
    • pp.190-196
    • /
    • 2004
  • Thick composite laminated plates is considered in 3D finite-element. To consider continuity of transverse stresses and displacement field, mixed finite-element has been developed by using layerwise theory and the minimum potential energy principle. Mixed finite-element has been enforced through the thick direction, Z, of a laminated plate by considering six degree-of-freedoms per node. Six degree-of-freedoms are three displacement components in the coordinate axes directions and three transverse stress components ${\sigma}_z,\;{\tau}_{xz},\;{\tau}_{yz}$. The model maintain the fundamental elasticity relations that are stress-strain relation and displacement-strain relation, because the transverse stress components invoked as nodal degrees of freedom by using the fundamental elasticity relationship between th components of stress and displacement. Random vibration analysis of the model is performed by computing consistent mass matrix and computing covariance in frequency domain technique.

  • PDF

학교 보건사업 협력 네트워크 분석 (The network analysis for school health program)

  • 배상수
    • 보건교육건강증진학회지
    • /
    • 제33권3호
    • /
    • pp.1-11
    • /
    • 2016
  • Objectives: The challenging issue of public health program is to strengthen partnership and network between health resources. This study identified the structure and characteristics of school health program network. Methods: In this paper we collected data from schools and organizations in 4 local communities in 2014 that participated to school health program. Using social network analysis techniques we measured the number of component, diameter, density, average degree, node centralization for each network. Results: We determined that networks shared some common organizational structure such as less density, low average degree, and short diameter. Networks were dominated by the health center, and directions of collaborations between nodes were mostly one-way. Conclusions: These findings can help to depict the network of school health program. The further research is necessary to define causal relationship between network effectiveness and public health outcomes.

Angular MST-Based Topology Control for Multi-hop Wireless Ad Hoc Networks

  • Kim, Hwang-Nam;Park, Eun-Chan;Noh, Sung-Kee;Hong, Sung-Back
    • ETRI Journal
    • /
    • 제30권2호
    • /
    • pp.341-343
    • /
    • 2008
  • This letter presents an angular minimum spanning tree (AMST) algorithm for topology control in multi-hop wireless ad hoc networks. The AMST algorithm builds up an MST for every angular sector of a given degree around each node to determine optimal transmission power for connecting to its neighbors. We demonstrate that AMST preserves both local and network-wide connectivity. It also improves robustness to link failure and mitigates transmission power waste.

  • PDF

팬케익 그래프의 망비용을 개선한 하프팬케익 연결망 (A Half Pancake network that improve the network cost for Pancake graph)

  • 김주봉;서정현;이형옥
    • 한국멀티미디어학회논문지
    • /
    • 제17권6호
    • /
    • pp.716-724
    • /
    • 2014
  • The pancake graph is node symmetric and is utilized on the data sorting algorithm. We propose a new half pancake graph that improve pancake graph's network cost. The half pancake degree is approximately half of pancakes degree and diameter is 3n+4. The pancake graph's network cost is $O(1.64n^2)$ and half pancake's is $O(1.5n^2)$. Additionally half pancake graph is sub graph of pancake graph. As this result, The several algorithms developed in pancake graph has the advantage of leverage on the pancake by adding constant cost.

소셜 네트워크를 위한 확산기반 영향력 극대화 기법 (Diffusion-Based Influence Maximization Method for Social Network)

  • 응웬트리하이;유명식
    • 한국통신학회논문지
    • /
    • 제41권10호
    • /
    • pp.1244-1246
    • /
    • 2016
  • 정보 확산 극대화 문제는 소셜 네트워크에서 정보 확산을 최대로 할 수 있는 Seed 노드 군을 설정하는 것이다. 기존의 Greedy 알고리즘은 최적에 근접한 해를 제시하였으나 높은 계산량의 문제가 있다. 몇몇 Heuristic 알고리즘들이 계산량 감소를 목표로 제안되었으나 정보 확산 성능 측면에서 한계점이 있다. 본 논문에서는 General Degree Discount 알고리즘을 제안하고, 제안된 알고리즘이 계산량 측면 및 정보 확산 성능 측면에서 기존 Heuristic 알고리즘 대비 우수한 성능을 보임을 입증하고자 한다.

비부합 절점으로 이루어진 구조물의 합성과 재해석 (On a Substructure Synthesis Having Non-Matching Nodes)

  • 정의일;박윤식
    • 한국소음진동공학회:학술대회논문집
    • /
    • 한국소음진동공학회 2001년도 추계학술대회논문집 I
    • /
    • pp.155-160
    • /
    • 2001
  • Actual engineering structure is frequently very complex, and parts of structure are designed independently by different engineers. Also each structure contains so many degree of freedom. For these reason, methods have been developed which permits the structure to be divided into components or substructures, with analysis being done on a small substructure in order to obtain a full structural system. In such case, because of different mesh size among finite element model (FEM) or different matching points among FEM models and experimentally obtained models, their interfacing points may be non-matching. Solving this non-matching problem is useful to other application such as structural dynamic modification or model updating. In this work, virtual node concept is introduced. Lagrange multipliers are used to enforce the interface compatibility constraint, and interface displacement is approximated by polynomial presentation. The governing equation of whole structure is derived using hybrid variational principle. The eigenvalue of whole structure are calculated using the determinant search method. The number of degree of freedom in the eigenvalue problem can be drastically reduced to just the number of interface degree of freedom. Some numerical simulation is performed to show usefulness of synthesis method.

  • PDF

B-ISDN UNI에서 폭주를 예방하기 위한 B-NT의 트래픽 흐름 제어 (Traffic Flow Control of B-NT for Prevention of Congestion in B-ISDN UNI)

  • 이숭희;최흥문
    • 한국통신학회논문지
    • /
    • 제19권6호
    • /
    • pp.1085-1094
    • /
    • 1994
  • 본 논문에서는 망 노드에서의 폭주를 B-ISDN UNI에서 예방하기 위해 B-NT에서 일시적인 셀 저장 및 선택적 셀 폐기를 수행하는 트래픽 흐름 제어를 제안하였다. 제안된 구조는 B-NT 시스템에서 T 접속을 향하는 출력 셀 흐름을 감소 또는 억제시키도록 구성하고, 인접 망 노드의 상태를 정상, 준폭주, 폭주의 세상태로 정의하였다. 준폭주 상태에서는 손실에 민감한 트래픽은 일시적으로 저장되어 출력 셀 흐름의 속도를 저하시키고, 폭주 상태에서는 손실에 민감한 트래픽의 셀 저장과 더불어 지연에 민감한 트래픽의 셀이 선택적으로 폐기되어 최대한 출력 트래픽 흐름을 억제시킨다. 입력 셀 흐름과 망 노드 상태의 변화를 IBP와 3 상태 마르코프 체인으로 모델링하여 B-NT 시스템에서 제안된 구조의 성능 분석을 위한 시뮬레이션을 수행하여 적당한 버퍼 사이즈를 구하고 망 노드의 상태에 따른 제안한 구조의 성능 변화를 조사한 결과 망 노드에서의 폭주 정도가 극심한 경우에는 제안한 방법으로 제어가 거의 불가능하지만, 그 외의 경우에는 2,000셀 이상의 버퍼 사이즈로 제어가 가능함을 알 수 있었다.

  • PDF

Differential Diagnosis of CT Images in Children with Neuroblastomas and Ganglioneuroblastomas

  • Zhuang, Bo;Lv, Deng-Kun;Gao, Si-Ju;Meng, Jing-Jing
    • Asian Pacific Journal of Cancer Prevention
    • /
    • 제15권23호
    • /
    • pp.10509-10512
    • /
    • 2015
  • Objective: To investigate the differential features of CT images in children with neuroblastomas (N) and ganglioneuroblastomas (G). Materials and Methods: Clinical data of 12 children in group G and 15 in group N undergoing CT examination and definitely diagnosed by pathology were retrospectively analyzed. The focal conditions were observed and compared in the two groups, including location, size, boundaries, morphology, enhanced degree and mode, abdominal vascular involvement, presence or absence of spanning the midline, infiltration of peripheral organs, angiography manifestations in tumors or surroundings, presence or absence of calcification and vascular tumor emboli as well as metastases of distal organs and lymph nodes. Results: In group N, the incidence of tumors in the adrenal area was conspicuously higher than in group G (P<0.05), while that of tumors with regular morphology and clear boundaries was significantly lower than in group G (P<0.01); Angiography manifestation rate and incidences of vascular embedding, lymph node metastasis, infiltration and organic metastasis in group N were all markedly higher than in group G (P<0.05). There was no statistical significance between the two groups in terms of focal size, presence or absence of calcification and spanning the midline, and enhanced degree and mode, as well as vascular tumor emboli (P>0.05). Conclusions: Mostly located in adrenal areas and with vascular embedding as a primary manifestation, the neuroblastoma extremely readily metastases to lymph nodes and other organs as well as infiltrating local tissues, with dilation on angiography frequent in or around the tumors. With vascular displacement as a primary manifestation, ganglioneuroblastoma has a regular morphology and clear boundaries.