浅论图书馆文献资源建设与共享

阐述了现今文献资源建设与共享的概念,讨论了文献资源建设与共享二者间的关系,提出了文献资源建设与共享的保障措施。     

基于信息共享空间环境的图书馆员的素质和技能

概述了信息共享空间,探讨了在信息共享空间环境下图书馆员应具备的素质和技能.     

公共图书馆如何应对社会老龄化的挑战

简述了我国人口老龄化的特点,分析了人口老龄化在服务对象和事业经费等方面给我国公共图书馆事业发展带来的挑战,指出图书馆应在资源配置、资源共享、发展规划以及政策法规方面采取相应对策,促进图书馆事业的健康发展.     

我国文献资源整体化建设的障碍及对策

分析了我国文献资源整体化建设的现状，探讨了我国文献资源整体化建设的障碍和存在问题，针对这些问题提出了相应的对策。     

高师院校图书馆为本地区基础教育服务的途径探讨

鉴于高师院校图书馆具有的资源优势，探讨了为本地区基础教育服务的必要性和可行性，提出了以阅读、开放、科教指导、讲座等具体服务基础教育的形式和途径。     

《急就篇》亡佚文献考

《急就篇》是西汉史游编撰的一部教学童识字用的教材，它不仅在我国传统语文教育史上产生过重要的作用，于书法也有着非常的意义，吸引了各领域的众多学者来研究它，影响及于海外。但是由于时日久远，许多相关文献先后亡佚掉了。本文就是对这些亡佚文献所作的一个考证。     

图书馆档案价值的利用研究

阐述了档案统计数据在图书馆文献资源建设中的作用,提出了在图书馆建设中充分利用档案价值的新思路。     

Dynamic Niching Genetic Algorithm with Data Attraction for Automatic Clustering

A genetic clustering algorithm was developed based on dynamic niching with data attraction. The algorithm uses the concept of Coulomb attraction to model the attraction between data points. Then, the niches with data attraction are dynamically identified in each generation to automatically evolve the optimal number of clusters as well as the cluster centers of the data set without using cluster validity functions or a variance-covariance matrix. Therefore, this clustering scheme does not need to pre-specify the number of clusters as in existing methods. Several data sets with widely varying characteristics are used to demonstrate the superiority of this algorithm. Experimental results show that the performance of this clustering algorithm is high, effective, and flexible.     

Improved spectrum sharing algorithm based on feedback control information in cognitive radio networks

In order to avoid the system performance deterioration caused by the wireless fading channel and imperfect channel estimation in cognitive radio networks, the spectrum sharing problem with the consideration of feedback control information from the primary user is analyzed. An improved spectrum sharing algorithm based on the combination of the feedback control information and the optimization algorithm is proposed. The relaxation method is used to achieve the approximate spectrum sharing model, and the spectrum sharing strategy that satisfies the individual outage probability constraints can be obtained iteratively with the observed outage probability. Simulation results show that the proposed spectrum sharing algorithm can achieve the spectrum sharing strategy that satisfies the outage probability constraints and reduce the average outage probability without causing maximum transmission rate reduction of the secondary user.     

Anonymous multipath routing protocol based on secret sharing in mobile ad hoc networks

Because the intrinsic characteristics of mobile ad hoc networks(MANETs) cause several vulnerabilities,anonymous routing protocols attract much more attention in secure mobile ad hoc networks for the purposes of security and privacy concerns.Until recently,lots of anonymous routing protocols have been proposed.However,most of them are single path or use one path at a time,and the multipath schemes can not thwart both the passive attacks and active attacks simultaneously.Thus an anonymous multipath routing protocol based on secret sharing is proposed.The protocol provides identity anonymity,location anonymity,data and traffic anonymity by employing cryptograph technology and secret sharing in MANET communication process.Meanwhile,a hash function is introduced to detect active attacks in the data transmission process.The protocol can effectively thwart various passive attacks and reduce the successful probability of active attacks(such as interception and physical destroy attacks).Simulation results show that the proposed scheme provides a reasonably good level of network security and performance.