- 1、本文档共9页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
Dependency Matrix and Duration in Time Based Composition of Learning Paths Planning Learning Paths for L.L.L. Environment Digital, Collaborative, Asynchronous, Social, Personalized, Interest-Based.... Challenges Immersiveness, Learner Support, Sustainability, Usability, communication... Context of work, an introduction Contemporary challenges in L.L.L. Curriculum planning and development Learner’s learning path composition Contingency planning in competence development Providing tools for learner support Simple approach suggested Based on R.D.M. Addresses a basic scenario Provides an infrastructure for automation Basic Scenario A professional planning to study virtual sets production technologies Effort: average of 6 h/week Curriculum: Small set of interdependent CDPs Accredited Tasks: Explore learner’s possible choices Partially automate process planning Computing Dependency Matrix Each CDP represented as a vector of competences prerequisite competences define a transitive relation CDPs can be sorted by dependency relations RDM can also encompass the learning goal and the learner’s current position Path existance Path Existance CDPs with no prerequisite competences offer a set of competences C0 ? C / ? c ? C0, A0(c) = 1. ? Starting points A1 = step(A0) represents the set of CDPs accessible from A0 Path(A0, A1) = true if CR1 ? ?, CR1 = {? c ? C0 / A1(c) = -1}. a goal is attainable by RCDP if ? A0 ? ? / Path(A0, G) = true. Path segmentation and length Path Steps and Segmentation Any segmentation of Path(A0, G) is a composition of these unitary steps: A0 ? A1 ? A2 ……. An ? G Segments are more or less homogeneous in time and respect dependency relations among CDPs. Path length LENGTH( Path(A0, G) ) = ? LENGTH( Path(Ai, Aj) ) = ? TIME(Ai) Pre-planning: identifying choices Conclusions Two main factors govern the planning process Time restrictions / requirements Competence dependency and prerequisites This work forms a foundation for learner support
您可能关注的文档
- Dean De Cock University of Iowa爱荷华大学的院长.ppt
- Dealing with Attendance issues TAG Home Page处理考勤问题标签主页.ppt
- Dear user, Universit libre de Bruxelles亲爱的用户大学和233布鲁塞尔.ppt
- Death and Dying Module 118 Murrieta Valley 死亡和垂死的模块118 穆列塔谷.ppt
- Dear Mama” Boston College“亲爱的妈妈”波士顿学院.ppt
- Dealing with Difference NOAA Workforce 处理的区别NOAA的劳动力.ppt
- Death of a Naturalist Biddick Academy死亡naturalist biddick Academy of a.ppt
- Death of a Naturalist HinchingbrookeDeath of a博物学家 hinchingbrooke.ppt
- Death of Low Mass Stars 8 Solar Masses or less低质量恒星的死亡8太阳质量或更少.ppt
- Death and Grief Helping in Congregations Baylor 死亡和悲痛帮助教会贝勒.ppt
文档评论(0)