English  |  正體中文  |  简体中文  |  Items with full text/Total items : 21921/27947 (78%)
Visitors : 4250921      Online Users : 379
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://140.128.103.80:8080/handle/310901/22616


    Title: Due time setting for peer-to-peer retrieval of teaching material in cloud computing environments
    Authors: Shih W.-C., Tseng S.-S., Yang C.-T.
    Date: 2011
    Issue Date: 2013-05-21T09:12:19Z (UTC)
    Abstract: Cloud computing technologies can be used to store a tremendous amount of learning resources, including educational videos. However, it is difficult for users to retrieve relevant teaching material in cloud environments by submitting a few keywords. We propose a search mechanism based on social networks. Furthermore, the issues of availability and trustworthiness have to be considered in teaching material retrieval process, in order to improve the retrieval performance. Current P2P file sharing applications focus on exact matching and ignore the dynamic nature inherent in P2P networks, which might degrade the retrieval performance in terms of precision and response time. Our idea is to appropriately set the due time to improve response time of P2P teaching material retrieval without sacrificing much precision. In this study, we formulate the due time setting problem as a bi-objective optimization problem and approximately solve it by an interaction-based heuristic method. The proposed approach consists of two phases: construction phase and sharing phase. In construction phase, peer information is acquired and managed in a decentralized manner. In sharing phase, the due time is interactively determined and the results are retrieved. A prototype of cloud platform has been constructed and experiments have been conducted to evaluate the performance of the approach. The experimental results show that the interactive algorithm performs well in P2P networks with low trust and availability. Also, a survey of satisfaction shows that the proposed method is more user-friendly.
    Relation: 2011 International Conference on Information Science and Applications, ICISA 2011
    Appears in Collections:[資訊工程學系所] 會議論文

    Files in This Item:

    File SizeFormat
    2-5.pdf690KbAdobe PDF285View/Open


    All items in THUIR are protected by copyright, with all rights reserved.


    本網站之東海大學機構典藏數位內容,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback