[1]郭优,卢海洋,曹铷,等.基于加权网络的教科书知识结构分析——以韩国高一《科学》教材为例[J].延边大学学报(自然科学版),2015,41(01):74-78.
 GUO You,LU Haiyang,CAO Ru,et al.Analysis of textbook knowledge structure based on weighted network:taking the textbook of Science in Senior One of Korea for example[J].Journal of Yanbian University,2015,41(01):74-78.
点击复制

基于加权网络的教科书知识结构分析——以韩国高一《科学》教材为例

参考文献/References:

[1] Watts D J, Strogatz S H. Collective dynamics of‘small-world’ networks[J]. Nature,1998,393:440-442.
[2] Barabási A L, Albert R, Jeong H, et al. Power-law distribution of the world wide web[J]. Science,2000,287(5461):2115.
[3] Barabási A L,Albert R. Emergence of scaling in random networks[J]. Science, 1999,286:509-512.
[4] Jeong H, Mason S P, Barabási A L, et al. Lethality and centrality in protein networks[J]. Nature, 2001,411:41-42.
[5] Amaral L A N, Scala A, Barthélémy M, et al. Classes of small-world networks[J]. Proc Natl Acad Sci USA, 2000,97:11149-11152.
[6] Goh K I, Cusick M E, Valle D, et al. The human disease network[J]. Proc Natl Acad Sci USA, 2007,104:8685-8690.
[7] Newman M E J, Girvan M. Finding and evaluating community structure in networks[J]. Phys Rev E, 2004,69:026113.
[8] Newman M E J. Fast algorithm for detecting community structure in networks[J]. Phys Rev E, 2004,69:066133.
[9] Kim D H, Noh J D, Jeong H W. Scale-free trees: the skeletons of complex networks[J]. Phys Rev E, 2004,70:046126.
[10] 崔雪梅,李凤月, Han SeungKee.物理知识网络的特性分析[J].复杂系统与复杂性科学,2013,10(2):30-36.
[11] Korea Foundation for the Advancement of Science & Creativity. Development of a National Science Curriculum(2010-14)[M]. Seoul: Korea Foundation for the Advancement of Science & Creativity, 2010.
[12] Cha D W, Kim H S, Lee M S, et al. High School Science[M]. Seoul: Chunjae Education, 2002.
[13] Lee M W, Jeon S W, Choi B S, et al. High School Science[M]. Seoul: Kumsung Publishing, 2002.
[14] Cho H S, Kang D H, Kang T W, et al. High School Science[M]. Seoul: Chunjae Education, 2011.
[15] Ahn T I, Ahn J S, Hahn I S, et al. High School Science[M]. Seoul: Kumsung Publishing, 2011.
[16] Kruskal J B. On the shortest spanning subtree and the traveling salesman problem[J]. Proc Am Math Soc, 1956,7:48-50.
[17] Batagelj V, Mrvar A. Pajek: program for large networks analysis[DB/OL].
[2013-11-20]. http://vlado.fmf.uni-lj.si/pub/networks/pajek/.

备注/Memo

收稿日期: 2015-02-12 基金项目: 吉林省教育科学“十二五”规划课题(GH14018)*通信作者: 崔雪梅(1969—),女,博士,副教授,研究方向为物理课程与教学论和复杂网络.

更新日期/Last Update: 2015-03-20