RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제
      • 좁혀본 항목 보기순서

        • 원문유무
        • 원문제공처
        • 등재정보
        • 학술지명
        • 주제분류
        • 발행연도
        • 작성언어
        • 저자
          펼치기

      오늘 본 자료

      • 오늘 본 자료가 없습니다.
      더보기
      • 무료
      • 기관 내 무료
      • 유료
      • SCIESCOPUSKCI등재

        Assessing the Vulnerability of Network Topologies under Large-Scale Regional Failures

        Peng, Wei,Li, Zimu,Liu, Yujing,Su, Jinshu The Korea Institute of Information and Commucation 2012 Journal of communications and networks Vol.14 No.4

        Natural disasters often lead to regional failures that can cause network nodes and links co-located in a large geographical area to fail. Novel approaches are required to assess the network vulnerability under such regional failures. In this paper, we investigate the vulnerability of networks by considering the geometric properties of regional failures and network nodes. To evaluate the criticality of node locations and determine the critical areas in a network, we propose the concept of ${\alpha}$-critical-distance with a given failure impact ratio ${\alpha}$, and we formulate two optimization problems based on the concept. By analyzing the geometric properties of the problems, we show that although finding critical nodes or links in a pure graph is a NP-complete problem, the problem of finding critical areas has polynomial time complexity. We propose two algorithms to deal with these problems and analyze their time complexities. Using real city-level Internet topology data, we conducted experiments to compute the ${\alpha}$-critical-distances for different networks. The computational results demonstrate the differences in vulnerability of different networks. The results also indicate that the critical area of a network can be estimated by limiting failure centers on the locations of network nodes. Additionally, we find that with the same impact ratio ${\alpha}$, the topologies examined have larger ${\alpha}$-critical-distances when the network performance is measured using the giant component size instead of the other two metrics. Similar results are obtained when the network performance is measured using the average two terminal reliability and the network efficiency, although computation of the former entails less time complexity than that of the latter.

      • KCI등재

        Assessing the Vulnerability of Network Topologies under Large-Scale Regional Failures

        Wei Peng,Zimu Li,Yujing Liu,Jinshu Su 한국통신학회 2012 Journal of communications and networks Vol.14 No.4

        Natural disasters often lead to regional failures that can cause network nodes and links co-located in a large geographical area to fail. Novel approaches are required to assess the network vulnerability under such regional failures. In this paper, we investigate the vulnerability of networks by considering the geometric properties of regional failures and network nodes. To evaluate the criticality of node locations and determine the critical areas in a network, we propose the concept of α-critical-distance with a given failure impact ratio α, and we formulate two optimization problems based on the concept. By analyzing the geometric properties of the problems, we show that although finding critical nodes or links in a pure graph is a NP-complete problem, the problem of finding critical areas has polynomial time complexity. We propose two algorithms to deal with these problems and analyze their time complexities. Using real city-level Internet topology data, we conducted experiments to compute the α-critical-distances for different networks. The computational results demonstrate the differences in vulnerability of different networks. The results also indicate that the critical area of a network can be estimated by limiting failure centers on the locations of network nodes. Additionally, we find that with the same impact ratio α, the topologies examined have larger α-critical-distances when the network performance is measured using the giant component size instead of the other two metrics. Similar results are obtained when the network performance is measured using the average two terminal reliability and the network efficiency, although computation of the former entails less time complexity than that of the latter.

      • SCIESCOPUSKCI등재

        Scanning Rayleigh Doppler Lidar for Wind Profiling Based on Non-polarized Beam Splitter Cube Optically Contacted FPI

        Jun Zheng,Dongsong Sun,Tingdi Chen,Ruocan Zhao,Yuli Han,Zimu Li,Anran Zhou,Nannan Zhang 한국광학회 2018 Current Optics and Photonics Vol.2 No.2

        A Scanning Rayleigh Doppler lidar for wind profiling based on a non-polarized beam splitter cube optically contacted FPI is developed for wind measurement from high troposphere to low stratosphere in 5-35 km. Non-polarized beam splitter cube optically contacted to the FPI are used for a stable optical receiver. Zero Doppler shift correction is used to correct for laser or FPI frequency jitter and drift and the timing sequence is designed. Stability of the receiver for Doppler shift discrimination is validated by measuring the transmissions of FPI in different days and analyzed the response functions. The maximal relative wind deviation due to the stability of the optical receiver is about 4.1% and the standard deviation of wind velocity is 1.6% due to the stability. Wind measurement comparison experiments were carried out in Jiuquan (39.741°N, 98.495°E), Gansu province of China in 2015, showing good agreement with radiosonde result data. Continuous wind field observation was performed from October 16th to November 12th and semi-continuous wind field of 19 nights are presented.

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼