RISS 학술연구정보서비스

검색
다국어 입력

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

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

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

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제

      오늘 본 자료

      • 오늘 본 자료가 없습니다.
      더보기
      • 무료
      • 기관 내 무료
      • 유료
      • Research on Database Remote Disaster Recovery and Backup Technology Based on Multi Point and Multi Hop

        Guoyong Lin,Fan Huang 보안공학연구지원센터 2016 International Journal of Database Theory and Appli Vol.9 No.6

        Object: With the continuous advancement of information technology, more and more systems use database to store basic data, the security of data is an important part of the design of the business system. Method: In order to effectively improve the viability of data, this paper proposes a kind of multi point and multi hop database remote disaster recovery and backup technology. Process: Based on the in-depth analysis of the functions and demand of database, this paper introduces the working principles and key technologies of disaster recovery technology, describes the principles and realization process of multi point and multi hop database remote disaster recovery and backup technology, and carries on the experimental analysis. Conclusion: Theoretical analysis and experimental results show that this method is an effective new way of database remote disaster recovery and backup. So this technology has many advantages, such as multi point and multi hop backup, good real-time performance, fine backup granularity and so on.

      • Improving Recommendation Accuracy and Diversity through Cost-Awareness Probabilistic Spreading

        Guoyong Cai,Dong Zhang,Yumin Lin 보안공학연구지원센터 2016 International Journal of Grid and Distributed Comp Vol.9 No.11

        Recommender systems provide users with personalized suggestions for products. A key challenge is how to improve the diversity of recommendation results as much as possible, while maintaining reliably accurate suggestions. Although the bipartite graph based probabilistic spreading algorithm has its advantages of good accuracy and low computational complexity, its diversity is poor. In this paper, we introduce a cost-aware probabilistic spreading algorithm, and show how it can improve both recommendation accuracy and diversity by designing different spreading costs. Comparative experiments on widely used datasets confirm the effectiveness of the cost-aware probabilistic spreading approach in terms of accuracy, aggregate diversity and individual diversity of recommendation results. In addition, the time complexity of the proposed algorithm is also analyzed.

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼