检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《复杂系统与复杂性科学》2009年第2期33-39,共7页Complex Systems and Complexity Science
基 金:上海市重点学科建设资助项目(T0502);上海市自然科学基金(06ZR14144)
摘 要:通过搜集上海理工大学图书馆1年内的图书外借信息,构建了图书及其借阅者的数据库及描述二者关系的二分图。根据图书和读者之间是否存在借阅关系和读者借阅书籍的天数这两种情况分别建立了无权和加权网络,并且通过复杂网络的理论和方法分析得到相关统计属性。研究发现这些统计属性均服从指数分布,且无权和加权网中相应的统计属性正相关。这表明,与无权网络相比,加权网不仅能描述合作竞争关系和结构,还能精确地描述竞争结果。并且,结合实际讨论了二分图中读者和图书内部及其之间的合作竞争关系和各项统计指标所具有的现实意义。We collect the lending information of the library about the University of Shanghai for Science and Technology during one year and construct the database between the books and readers, then structure the bipartite graphs to describe the relationship between them based on our database. We establish the corresponding un-weighted network and weighted network through the lending relationship and the lending days about the books, then obtain the statistical properties of the bipartite graph via the theory and methods of complex network. We find these properties are subject to exponential distribution and there is a positive correlation between the corresponding properties in un-weighted and weighted networks. This shows that, compared with the un-weighted network, the properties considered the lending time can describe not only the collaboration competition relationship and configuration but also the competition results accurately. Besides, we discuss the practical significance of the collaboration competition relation- ship and the statistical properties about the bipartite graphs.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.142.243.141