跳到主要內容

臺灣博碩士論文加值系統

(44.192.22.242) 您好!臺灣時間:2021/08/03 19:29
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:江姝昀
研究生(外文):Jiang Shu-Yun
論文名稱:同儕式SCORM學習教材系統分析
論文名稱(外文):Analysis of Peer-to-Peer SCORM Learning SystemsAnalysis of Peer-to-Peer SCORM Learning Systems
指導教授:蔡正雄蔡正雄引用關係
指導教授(外文):Chang-Hsiung Tsai
學位類別:碩士
校院名稱:國立花蓮教育大學
系所名稱:學習科技研究所
學門:教育學門
學類:教育科技學類
論文種類:學術論文
論文出版年:2007
畢業學年度:95
語文別:中文
論文頁數:56
中文關鍵詞:數位學習對等式同儕點對點
外文關鍵詞:e-learningSCORMpeer-to-peer
相關次數:
  • 被引用被引用:0
  • 點閱點閱:111
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
由於全球化、自由化與需求多樣化,造就資訊、通訊、軟/硬體與網路等技術的快速發展,導致知識經濟時代來臨,以往侷限於紙本或課程所交流的知識,也因而數位化於網際網路上,數位學習普及化的今日,有效提升數位教材分享及增進下載效率及有用性,更是備受關切。
為提升數位教材分享交換率,改善過去一般數位學習系統主從式架構(Client-Server)連線方式可能造成的不便,以避免因服務之伺服器斷線而一切作業亦隨之中斷的情況發生,故本研究以對等式點對點(peer-to-peer)之分散式有組織性架構(Decentralized and structured)為數位學習系統連線方式。並採用鄰點規則(k-Nearest Neighbor)針對不只一項回傳結果,以和使用者查詢作相似程度比對、排序,以供使用者作下載選取參考,以提升數位教材分享及搜尋系統之功能性。
The advance of network technology has turned the Internet into a popular open system. Services of information retrieval and resource sharing have brought a convenient way of learning of knowledge. Inherent limits of paper or curriculum of knowledge also result them to be digitalized onto the Internet. Beside, a more significant issue is to improve the share efficiency of network teaching material and download accuracy.
A fundamental problem that e-learning applications confront are its inefficiency of exchange the network teaching material and the failure of network that using client-server architecture. This study propose a decentralized and structured peer-to-peer infrastructure for sharing learning object. We apply k-Nearest Neighbor approach in compared with the feature of the user’s query and digital teaching material to reveal semantic simulation. After simulation, we sort them and build a download list for user to make decision easier.
第壹章 緒論
1.1 研究動機與目的 …………………………………………………………1
1.2 章節概述 ………………………………………………………………… 2
第貳章 文獻探討
2.1 Sharable Content Object Reference Model ………………………… 3
2.1.1 綜述………………………………………………………………… 3
2.1.2 Content Aggregation Model …………………………………… 3
2.1.3 Run-Time Environment …………………………………………… 7
2.1.4 Sequencing and Navigation …………………………………… 9
2.2 Peer to Peer Overlay Network …………………………………………10
2.2.1概述 …………………………………………………………………10
2.2.2 P2P架構 …………………………………………………………10
2.2.2.1 Centralized-ALL ………………………………………11
2.2.2.2 Decentralized but unstructured ……………………12
2.2.2.3 Decentralized and structured ………………………13
2.2.3分散式雜湊表與教材系統搜尋 …………………………………15
2.3 k-Nearest eighbor …………………………………………………………16
第參章 各種同儕式教材系統分析
3.1 Napster and Gnutella………………………………………………… 17
3.2 BitTorrent ………………………………………………………………23
3.3 eDonkey、eMule………………………………………………………… 26
第肆章 研究方法
4.1 問題分析與定義 …………………………………………………………30
4.2 系統流程與方法 …………………………………………………………31
4.2.1 DHT之檔案索引值建立 ……………………………………………31
4.2.2 教材關鍵值近似向量建立(LFV) …………………………………35
4.2.3 向量轉換與距離計算………………………………………………38
4.3 流程模擬……………………………………………………………………41
第伍章 結論與未來展望
5.1 結論…………………………………………………………………………46
5.2 未來展望……………………………………………………………………46
參考文獻 ……………………………………………………………………………44
[1]Advanced Distributed Learning http://www.adlnet.gov/index.cfm
[2]BitTorrent. http://bittorrent.com.
[3]Bram Cohen. Incentives Build Robustness in BitTorrent. 2003. http://bittorrent.com/bittorrentecon.pdf.
[4]eDonkey2000 http://www.edonkey2000.com
[5]eMule http://www.emule-project.net/.
[6]eMule. The emule file-sharing application homepage, 2004. http://www.emule-project.net/.
[7]Gnutella http://www.gnutella.com.
[8]mlDonkey http://mldonkey.org
[9]Napster http://www.napster.com/
[10]The Gnutella protocol specification v0.4. http://www9.limewire.com/developer/gnutella_protocol_0.4.pdf.
[11]The Gnutella protocol specification v0.6. http://rfcgnutella.sourceforge.net.
[12]A.-L. Barab´asi. Linked: The New Science of Networks. Perseus Publishing, 2002.
[13]I. Abraham , B. Awerbuch , Y. Azar , Y. Bartal , D. Malkhi , E. Pavlov, “A Generic Scheme for Building Overlay Networks in Adversarial Scenarios”, Proceedings of the 17th International Symposium on Parallel and Distributed Processing, p.40.2, April 22-26, 2003
[14]K. Aberer, F. Klemm, M. Rajman, and J. Wu,” An Architecture for Peer-to-Peer Information Retrieval”, July 2, 2004
[15]E. Adar and B. A. Huberman, Free riding on gnutella. First Monday, 2000.
[16]R. Ahmed and R. Boutaba, “Distributed Pattern Matching for P2P Systems”, to appear in Proceedings of the 10th IEEE/IFIP Network Operations and Management Symposium (NOMS’06), Vancouver, Canada, April 2006.
[17]A. Amrou, K.Maly, and M.Zubair,“Freelib: peer-to-peer-based digital libraries”, Advanced Information Networking and Applications, 2006. AINA 2006. 20th International Conference on
Publication Date: 18-20 April 2006
Volume: 1, On page(s): 6
[18]A.Ganguly,A. Agrawal, P. Oscar Boykin, and R. Figueiredo“Enabling Self-configuring Virtual IP Networks for Grid Computing” ,IPDPS, 2006
[19]Bar1s, and Boyvat, “A P2P RPC system using the Kademlia DHT,” in proceedings of the HUT T-110.551 Seminar on Internetworking Conference, Helsinki, 2005.
[20]J. Broekstra, M. Ehrig, P. Haase, F. van Harmelen, M. Menken, P. Mika, B. Schnizler and R. Siebes "Bibster - A Semantics-Based Bibliographic Peer-to-Peer System," The Second Workshop on Semantics in Peer-to-Peer and Grid Computing at the Thirteenth International World Wide Web Conference, 18 May 2004
[21]M. Castro, P. Druschel, A.-M. Kermarrec, A. Nandi, A. Rowstron, and A. Singh, “Splitstream: high-bandwidth multicast in cooperative environments”, Proceedings of the nineteenth ACM symposium on Operating systems principles,pp.298-313,2003
[22]H. Chen, H. Jin and X. Ning “Semantic Peer-to-Peer Overlay for Efficient Content Locating”, Proceedings of MEGA’06, Harbin, China, Jan.16-18, 2006
[23]H. Chen , Z. Huang and Z. Gong , “Efficient content locating in peer-to-peer systems” ,IEEE International Conference on Publication, Oct. 2005, pp. 253- 256
[24]Z. Chen, Z. Huang, B. and J. Li, “A Keyword Based Join Operation in Relational Database Enabled Peer-to-Peer Systems,” IEEE Proceedings of the 17th International Conference on Database and Expert Systems Applications,2006
[25]Jerry C.-Y. Chou, Tai-Yi Huang, Kuang-Li Huang, Tsung-Yen Chen, “A Scalable and Load-Balanced Peer-to-Peer Lookup Protocol,” IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 17, NO. 5, MAY 2006
[26]A. Crespo and H. Garcia-Molina,”Routing Indices for Peer-to-Peer Systems,” In ICDCS, July 2002.
[27]A. Datta, S. Girdzijauskas, K. Aberer,“On de Bruijn routing in distributed hash tables: There and back again,” IEEE Posted online, September 2004.
[28]S. Datta, K. Bhaduri, C. Giannella, R. Wolff and H. Kargupta, “Distributed Data Mining in Peer-to-Peer Networks.”, Invited article, IEEE Internet Computing Special Issue on Distributed Data Mining,July-August,2006.
[29]P. Dolog,” Building Open Systems Using Edutella - Edutella framework and integration possibilities,” Technical Report, Learning Lab Lower Saxony, University of Hannover, May 2003
[30]M. Frans Kaashoek , D. R. Karger ,“A simple degree-optimal distributed hash table”,"Proceedings of the 2nd International Workshop on Peer-to-Peer Systems,2003
[31]C. Gkantsidis and P. Rodriguez,” Network Coding for Large Scale Content Distribution,” Technical Report MSR-TR-2004-80, Microsoft Research, 2004.
[32]A.-T. Gai, L. Viennot, “Broose: a practical distributed hashtable based on the de Bruijn topology”, Technical Report 5238, INRIA, 2004.
[33]M. Hatala, and G. Richards, “Making a SPLASH: A Heteregeneous Peer-to-Peer Learning Object Repository,” in proceedings of WWW 2003: The Twelfth International World Wide Web Conference, Association of Computing Machinery (ACM),2003.
[34]D. Hausheer, V. Darlagiannis (Editors): Design, Scalability, and Application of Peer-to-peer Overlay Networks. Deliverable 5.1 of the MMAPPS Project, August 2004
[35]S.-Y. Hu, A. Sinica, J.-F. Chen and T.-H. Chen,“A Scalable Peer-to-Peer Network for Virtual Environments,”IEEE Network July/August 2006,2006.
[36]D. Hull, “Improving Text Retrieval for the Routing Problem using Latent Semantic Indexing” , Proceedings of the 17th annual international ACM SIGIR conference on Research and development in information retrieval, pp. 282-191, 1994.
[37]R. Jain,” The Art of Computer Systems Performance Analysis”, John Wiley and Sons, 1991.
[38]H. Jin, X. Ning, and H. Chen,”Efficient search for peer-to-peer information retrieval using semantic small world,” In Proceedings of the 15th International Conference on World Wide Web (Edinburgh, Scotland, WWW '06. ACM Press, New York, NY, pp. 1003-1004, May 23 - 26, 2006).
[39]J. Lindroos, “Peer-to-Peer Content Distribution”.
[40]J. lu, and J. Callan,” Content-Based retrieval in hybrid peer-to-peer networks,” In: Frieder O, Hammer J, et al. eds. Proc. of the 12th Int'l Conf. on Information and Knowledge Management, New York: ACM Press, 2003.
[41]H. Jin, X. Ning, H. Chen and Z. Yin , “Efficient Query Routing for Information Retrieval in Semantic Overlays,” Proceedings of the 2006 ACM symposium on Applied computing,2006.
[42]Y.-J. Joung, and L.-W. Yang,“Multi-Dimensional Prefix Search in P2P Networks,”Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06)0-7695-2679-9/06,2006.
[43]M. Izal, G. Urvoy-Keller, E.W. Biersack, P. Felber, A. Al Hamra, and L. Garc´es-Erice,” Dissecting BitTorrent: Five Months in a Torrent’s Lifetime,” PAM, Apr. 2004.
[44]A. Löser,”Data Source Discovery in Educational P2P Networks,”In Proceedings of the IASTED Intl. Conference on Web-Based Education (WBE 2004), ACTA Press, 2004.
[45]A. L¨oser, W. Siberski, M. Wolpers and W. Nejdl , “Information Integration in Schema-Based Peer-To-Peer Networks”, Proceedings of the Conference on Advanced Information Systems Engineering.
[46]D. Malkhi, M. Naor, D. Ratajczak,“A Scalable and Dynamic Emulation of the Butterfly,” Principles of Distributed Computing (PODC 2002), 2002.
[47]G. D. Marco, M. Leoncini, and M. Montangero,”Distributed Algorithm for a Color Assignment on Asynchronous Rings,” Parallel and Distributed Processing Symposium, International,pp. 25-29 ,April 2006
[48]F. M. Cuenca-Acuna,and T. D. Nguyen, “Text-Based Content Search and Retrieval in Ad Hoc P2P Communities,” Proc. Int'l Workshop Peer-to-Peer Computing, pp.220-234, 2002.
[49]P. Maymounkov and D. Mazieres, “Kademlia: A peer-to-peer information system based on the xor metric,” In Proceedings of the 1st Int'l Workshop on Peer-to-Peer Systems (IPTPS 2002),pp.153-161,March 2002.
[50] W. Mueller, P. O. Boykin, N. Sarshar, and V. P. Roychowdhury, “Comparison Of Image Similarity Queries In P2P Systems,” In Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing (P2P2006), pp. 98–105, 2006
[51]K. Nakauchi, H. Morikawa, and T. Aoyama,” Design and Implementation of a Semantic Peer-to-Peer Network,” HSNMC ,2004
[52]Beomseok Nam Sussman, A. UMIACS, Maryland Univ., College Park,” DiST: fully decentralized indexing for querying distributed multidimensional datasets,” Parallel and Distributed Processing Symposium, 2006. IPDPS 2006. 20th International, 25-29 April 2006
[53]W. Nejdl, B. Wolf, W. Siberski, C. Qu, S. Decker, M. Sintek, A. Naeve, M. Nilsson, M. Palmer, T. Risch, “Edutella: P2P Networking for the Semantic Web Technical Report,” 2003.
[54]W. Nejdl, B. Wolf, S. Staab, and J. Tane, “EDUTELLA: Searching and Annotating Resources within an RDF-based P2P Network,” Technical Report, Dec. 2001
[55]W. Nejdl , M. Schlosser ,W. Siberski , M. Wolpers , B. Simon , and S. Decker , M. Sintek,“RDF-based Peer-to-Peer-Networks for Distributed(Learning) Repositories,” Technical Report, November 2002.
[56]N.J.A. Harvey, J. Dunagan,M. B.Jones,S. Saroiu,M. Theimer, and A. Wolman,“A Scalable Overlay Network with Practical Locality Properties,” In Proceedings of USITS, March 2003.
[57]M. Nilsson, A. Naeve, M. Palmér ,“The Edutella P2P Network - Supporting Democratic E-learning and Communities of Practice,” Online Education Using Learning Objects, New York, 2004.
[58]O. D. Sahin, F. Emekçi, D. Agrawal,and A. E. Abbadi,” Content-Based Similarity Search over Peer-to-Peer Systems,” DBISP2P 2004,2004
[59]R. Schollmeier,“SIGNALING AND NETWORKING IN UNSTRUCTURED PEER-TO-PEER NETWORKS,”2005.
[60]I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan , “Chord: A scalable peer-to-peer lookup service for internet applications,” in proceedings of Technical Report TR-819, 2001
[61]E.-A. Sameh and S. Haridi,” An Overview of Structured P2P Overlay Networks,” Book chapter to appear in the upcoming book:Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless and Peer-to-Peer Networks, (Editor: Prof. JieWu), CRC Press, July 2005.
[62]J.A. Pouwelse, P. Garbacki, D.H.J. Epema, and H.J. Sips,” A Measurement Study of the BitTorrent Peer-to-Peer File-Sharing System,”Delft University of Technology, April 2004.
[63]D. Qiu and R. Srikant, “Modeling and Performance Analysis of BitTorrent-like Peer-to-Peer Networks,” SIGCOMM, Sep. 2004.
[64]C. Qu, W. Nejdl,and M. Kriesell,” Cayley DHTs - A Group-Theoretic Framework for Analyzing DHTs Based on Cayley Graphs,” ISPA ,2004.
[65]C. Qu, W. Nejdl, S. Decker, M. Sintek, A. Naeve, M. Nilsson, M. Palmer, and T. Risch, “Exploring jxtasearch for p2p educational media discovery,” In Proceedings: IEEE International Workshop on Knowledge Media Networking (IEEE KMN'02),2002.
[66]S. Saroiu and P. K. Gummadi and S. D. Gribble, “A Measurement Study of Peer-to-Peer File Sharing Systems,” In Proceedings of Multimedia Computing and Networking 2002 (MMCN ’02), Jan 2002.
[67]M. Schlosser, M. Sintek, S. Decker, W. Nejdl,” HyperCuP -- Shaping Up Peer-To-Peer Networks” Submitted to DISC 2002.
[68]M. Schlosser, M. Sintek, S. Decker, and W. Nejdl, "HyperCuP -- Hypercubes, Ontologies and Efficient Search on P2P Networks," Workshop on Agents and P2P Computing, 2002.
[69]H. Shen and C.-Z. Xu ,” Hash-based proximity clustering for load balancing in heterogeneous DHT networks”, Parallel and Distributed Processing Symposium, 2006.
[70]H. T. Shen, Y. Shu, and B. Yu, “Efficient Semantic-Based Content Search in P2P Network,” Knowledge and Data Engineering, IEEE Transactions on, Volume: 16, Issue: 7, pp. 813- 826 , July 2004,
[71]R. Siebes,”combining Content Clustering and Distributed Hash Tables”, P2PKM,2005.
[72]M. Srivatsa, B. Gedik, Member, L. Liu,“Large Scaling Unstructured Peer-to-Peer Networks with Heterogeneity-Aware Topology and Routing,” IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 17, NO. 11, NOVEMBER 2006.
[73]J. Strauss, D. Katabi, and F. Kaashoek,” A measurement study of available bandwidth estimation tools,” In IMC, 2003.
[74]T. Tanner, “Distributed Hash Tables in P2P Systems - A literary survey,” in Proceeding of the T-110.551 Seminar on Internetworking, spring 2005.
[75]C. Tang, S. Dwarkadas, Z. Xu,“On Scaling Latent Semantic Indexing for Large Peer-to-Peer Systems”,Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval,2004
[76]C. Tempich, S. Staab, A. Wranik,“Semantic Query Routing in Peer-to-Peer Networks based on Social Metaphors,” Proceedings of the Thirteenth International conference on the World Wide Web. ACM, New York, NY, USA,2004
[77]V. Vishnevsky, A. Safonov, M. Yakimov,“Scalable Blind Search and Broadcasting in Peer-to-Peer Networks,”IEEE Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing ,2006.
[78]C. Wang and Bo Li, “Peer-to-Peer Overlay Networks: A Survey,” [EB/OL].http://citeseer.ist.psu.edu/706822.html,2003.
[79]C. Wang, Li X., Y. Liu,and P. Zheng,” DiCAS: An Efficient Distributed Caching Mechanism for P2P Systems,” IEEE Trans. Parallel Distrib, 2006.
[80]D. Wu, Y. Tian, and K.-W. Ng, “Analytical Study on Improving DHT Lookup Performance under Churn,” in Proc. of IEEE International Conference on Peer-to-Peer Computing (P2P 2006), Cambridge, UK, Sep. 2006.
[81]M. Zhong,J. Moore,K. Shen, and A. L. Murphy, “An Evaluation and Comparison of Current PeertoPeer FullText Keyword Search Techniques”, Eighth International Workshop on the Web and Databases (WebDB 2005), June 2005.
[82]Zualkernan,and I.A. , “HYDRA: a light-weight, SCORM-based P2P e-learning architecture”, Fifth IEEE International Conference on Publication,pp.484-486 ,July 2005.
[83]Z. Yang,”Interactive content-based image retrieval in the peer-to-peer network using Self-Organizing Maps,” In Proceedings of Seminar on Internetworking (Peer-to-peer technologies, networks and systems), 2005.
[84]李長峰,“合乎國際標準的學習教材管理系統與點對點搜尋工具,” 國立中正大學資訊工程所碩士論文,2003.
[85]陳宗宏,黃詠豪,“應用遞增式演算法於點對點式數位學習系統之研究,”網際網路技術學刊,pp.157-163,2005.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
1. [85] 陳宗宏,黃詠豪,“應用遞增式演算法於點對點式數位學習系統之研究,”網際網路技術學刊,pp.157-163,2005.
2. 鄭茂春(1999)。自我歸因論與學習動機的探討。國教天地,135期,37-42頁。
3. 楊淑萍(1995)。自我效能在認知技巧學習和生涯發展上的應用(上)(下)。諮商與輔導,110、111期,20-25頁。
4. 黃德祥(1995)。學習輔導與學生發展。學生輔導通訊,38期,22-31頁。
5. 黃毓華、鄭英耀(1996)。一般性自我效能量表之修訂。測驗年刊,43卷1期,279-286頁。
6. 莊耀嘉、黃光國(1981)。國中學生的成敗歸因與無助感特徵。中華心理學刊,23卷2期,155-164。
7. 陳李綢(1992)。國小男女生後設認知能力與數學作業表現的關係研究。教育心理學報,25期,97-109。
8. 陳李綢(1980)。近代後設認知理論的發展與研究趨勢。資優教育季刊,37期,9-12頁。
9. 張蕊苓(1997)。兒童學習內化歷程中的影響因素探討。花蓮師院學報,9期,35-59頁。
10. 張景媛(1994)。國中生數學學習歷程統整模式之研究。教育心理學報,27期,141-174頁。
11. 張景媛(1992)。自我調整、動機信念、選題策略與作業表現關係的研究暨自我調整訓練課程效果之評估。教育心理學報,25期,201-243頁。
12. 柯永河(1994)。同一量尺,類似受試,不同作答方式會產生甚麼測驗結果?測驗年刊,41輯,55-72頁。
13. 林建平(1995)。學習動機的歸因輔導。諮商與輔導,115,42-45頁。
14. 吳毓瑩(1996)。量表奇偶點數的效度議題。調查研究,2,5-34頁。
15. 吳知賢(1994)。歸因理論及歸因再訓練的探討。臺南師院學報,27,1-29頁。