基于Fish算法的实时搜索系统的实现

介绍了著名的实时搜索算法Fish算法，并对该算法进行了改进，实现了一个实时搜索系统。新的系统能够帮助用户有效、准确的获得所需信息，滤除大量与自己需求无关的信息，从而在网上信息量爆炸性增长的时代，满足用户不断增长的对信息个性化的需求。     

基于特征分解的知识网络结构关系提取

[目的/意义]对知识网络中结构关系的有效识别与提取，有助于从纷繁的数据中探测知识网络的拓扑结构及其演化模式。[方法/过程]本文提出一种基于邻接矩阵特征分解的知识网络结构关系提取方法。基于真实数据分别从静态结构关系提取和动态结构演化两个方面，对特征分解法和传统关联频度法进行对比分析，并与Pathfinder算法进行对比。对基于特征分解法提取知识网络结构关系的有效性进行验证。[结果/结论]研究结果表明：特征分解法能够识别原始知识网络中的主要成分信息，能够准确识别低频次的对网络整体拓扑结构较为重要的关联关系，且提取方法灵活自由。     

基于Apriori改进算法的局部反馈查询扩展

提出面向查询扩展的Apriori改进算法，采用三种剪枝策略，极大提高挖掘效率；针对现有查询扩展存在的缺陷，提出基于Apriori改进算法的局部反馈查询扩展算法，该算法用Apriori改进算法对前列初检文档进行词间关联规则挖掘，提取含有原查询词的词间关联规则，构造规则库，从库中提取扩展词，实现查询扩展。实验结果表明该算法能够提高信息检索性能，与现有算法比较，在相同查全率水平级下其平均查准率有了明显提高。     

一种基于词间关联规则挖掘的查询扩展方法

针对现有信息检索系统中存在的词不匹配问题,提出一种基于词间关联规则的查询扩展算法,该算法利用现有挖掘算法自动对前列初检文档进行词间关联挖掘,提取含有原查询词的词间关联规则,从中提取扩展词,实现查询扩展。实验结果表明,该算法能改善和提高信息检索系统的查全率和查准率,具有很高的应用价值,与未进行查询扩展时相比,采用本文查询扩展算法后,平均准确率提高了13.34%,与传统的局部上下文分析查询扩展算法比较,其平均准确率提高了4.87%。     

面向学术资源集成的真值发现算法

在构建多渠道元数据资源建设体系时,往往存在着大量的元数据冲突的问题,即对同一对象的属性存在多种描述,造成了元数据的组织与揭示的困难。本文处理的原则是遵从原文,优先选取原文的值作为唯一的真值,将数据冲突问题视为单真值冲突问题。考虑到数据提供商均需要加工数据,将数据源之间的关系视为相互独立。根据以上,本文提出了一种面向学术资源集成的真值发现算法。该算法基于贝叶斯算法,考虑了有关联关系的属性。实验证明本文方法所构造的真值发现算法在保证准确率的同时,大大节省了人力的工作时间。     

Multiple Versions Revisited

Summary

The entityrelationship model in the IFLA draft Functional Requirements of Bibliographic Records (FRBR) provides a useful mechanism for reexamining the multipleversions problem in serials cataloging. The model provides a hierarchy of levels of abstraction that accommodates versions at both the concrete level of an exact reproduction of text, etc. (the manifestation level), and a more abstract level of an approximate reproduction of essential content (the expression level). Such a flexible model is especially useful given the expansion of novel version classes, especially that of dynamic remotely-accessible electronic documents. But along with the increase in usefulness afforded by the FRBR model comes an inevitable increase in ambiguity regarding what constitutes a version within the model, and at what level of that model, and ultimately what constitutes a work.     

Structural Analysis for Replicating Japanese Cultural Property Braids

ABSTRACT

Historic Japanese textiles from over 1000 years ago generally show marked deterioration and only very rare examples show their original forms and much information about textile reproduction has been lost. The replication of textile braids lacks systematic methodology and is still being practiced by only few individual braiding experts. The recreation of original braids as close as possible to original braids is a part of Japan’s intangible cultural heritage. The aim of this study is to clarify the decision-making procedure through which the braiding experts can decipher the original braiding structures. As a preliminary study of this project, interviews of a braid researcher and a replicating expert, Makiko Tada were performed regarding her working practices. It is important to clarify the braiding parameters for structural analysis such as the number of transits and the balance of ridges, and it became clear that the orientation of multiple colored threads plays an important role. The expert’s replicate works were also analyzed using a text-mining statistical technique to clarify the relationship of braiding parameters. The relationship between each braiding parameter and production method such as loop manipulation and Taka-dai became clear. As a result, the process of deciphering the original braid structure has been compiled in simplified workflows, which could contribute to the standardization and improvement in efficiency of replication of cultural property braids.     

特征词抽取和相关性融合的伪相关反馈查询扩展

针对现有信息检索系统中存在的词不匹配问题,提出一种基于特征词抽取和相关性融合的伪相关反馈查询扩展算法以及新的扩展词权重计算方法。该算法从前列n篇初检局部文档中抽取与原查询相关的特征词,根据特征词在初检文档集中出现的频度以及与原查询的相关度,将特征词确定为最终的扩展词实现查询扩展。实验结果表明,该方法有效,并能提高和改善信息检索性能。     

基于改进PageRank算法的核心专利发现研究

[目的/意义]核心专利的发现是技术创新的重要环节,对于技术改进和专利战略布局意义重大。[方法/过程]首先界定核心专利的概念,然后在对原始PageRank算法模型介绍的基础上,结合专利的被引次数和专利的年龄对原始的PageRank算法进行改进,提出PatentRank算法（简称PTR）,并将其应用到OLED领域中来识别核心专利。[结果/结论]研究发现,相比被引次数,PTR不仅能将该领域的核心专利识别出来,而且还可以识别出一些重要性的基础性专利,为研究OLED相关技术提供追本溯源的研究思路;相比原始PageRank算法,PTR具有更高的值区分度,在局部改善了PR的排名。     

基于Hadoop与Mahout的协同过滤图书推荐研究

基于Hadoop开源分布式计算框架和Mahout协同过滤推荐引擎技术构建图书推荐引擎系统,并利用云模型和Pearson系数对传统协同过滤推荐算法进行改进,改善传统单机推荐算法在高维稀疏矩阵上进行运算所导致的系统性能不佳及推荐结果不准确的问题。利用实验对分布式推荐平台的整体性能及改善后的协同过滤推荐算法进行测试评估,发现当虚拟机节点不断增加时,协同过滤推荐引擎的计算时间不断减少,这表明推荐引擎系统的总体性能较传统单机推荐引擎得到提升;利用MAE分别对原始协同过滤推荐效果和改进后的推荐算法进行测评,发现改进后的推荐引擎算法的推荐准确率较改进前提高13.1%。     

图书馆常态基础上人力资源动态匹配管理的概念和模式

文章给出了图书馆人力资源常态基础上的动态匹配管理的概念,动态匹配是在常态工作的基础上,为了完成一定的临时性、批量性、突发性或紧迫性工作任务,对人力资源进行动态调配的过程,完成该项任务后,员工再回到原来的岗位。建立了图书馆人力资源常态基础上的动态匹配管理模型。参考文献9。     

The parallel paths of conservation of contemporary art and indigenous collections

This paper uses a range of case studies from contemporary art and indigenous collections to explore synergies between the disciplines and pose questions about contemporary perceptions of condition and durability. The idea that value is only connected to original material or specific perceptions of condition has been challenged repeatedly by the very makers and primary users of these collections. Nevertheless, old expectations in relation to collections may still affect conservation processes. The conservator is positioned at the center of these tensions, trying to understand, negotiate and mediate the interests and values of dynamic layers of significance associated with the object being treated. Attempting to homogenize or generalize these relationships would directly affect the complexity of the meanings of the artworks and run the risk of hollowing them.     

一种改进的K-means算法最佳聚类数确定方法

对BWP方法进行研究,从嵌入式NSTL个性化推荐的文本聚类需求入手,分析BWP方法的不足,提出一种改进的K-means算法最佳聚类数确定方法。对单一样本类的类内距离计算方法进行优化,扩展BWP方法适用的聚类数范围,使原有局部最优的聚类数优化为全局最优。实验结果可以验证该方法具有良好性能。     

一种数字水印在数字防伪中的应用研究*

分析数字水印的理论基础，对比几种常用的数字水印算法，详细介绍Arnold数字图像置乱和逆变换还原原理及算法思想，使用Matlab对算法可行性和健壮性进行验证。实现一种基于Inter OpenCV库和Arnonld变换数字水印模型。     

知识管理理论在档案记忆再生产中的应用探究

知识管理作为新兴的管理模式在商业活动中被广泛应用,将知识管理应用于档案记忆再生产中有利于科学系统地获取、组织、存储、共享档案记忆,挖掘档案记忆的知识价值,为知识创新提供资源的土壤,为档案记忆的传承与发展带来新视角。文章首先从档案、记忆、知识的关系,知识管理理论与档案记忆理论的研究路线的相似性,知识管理理论为档案记忆再生产提供方法论指导三个方面对知识管理理论在档案记忆再生产中应用的适用性进行分析。然后勾勒出基于知识管理的档案记忆再生产架构,提炼出三条应用方式:以档案部门为主体的记忆重构,以公众为客体的记忆生成,档案部门与公众相互作用的记忆升华。     

A Heuristic Algorithm for Isolated Obstacle Detection by a Mobile Robot Based on Ranging Data

An algorithm for single isolated obstacle detection by a mobile robot using a range finder is described. The main algorithm block is constructed as a system of production rules that introduce logical relationships that make it possible to determine whether there is an obstacle in the field of normals to the surface. Detected obstacles are plotted on a 2D map. Obstacle mapping methods are discussed.     

数字成像设备的信噪比及其用途

信噪比用于衡量数字成像系统的性能,为此需要计算成像系统的信噪比,并了解信噪比的计量单位。由于数字照相机和扫描仪的动态范围与噪声有关,因而测量数字成像设备的动态范围时应该考虑噪声,这使得信噪比增量法在测量动态范围时有了用武之地。     

Cost-optimal dynamic data replication for distributed database systems: DYVO

In this paper, we present a dynamic replication algorithm, DYVO, which could provide an optimal cost for operating replicas according to a read/write pattern of transactions. Unlike previous algorithms for dynamic replication, in which read one and write all available approach is used for preserving consistency of replicas, DYVO basically uses quorum approach for managing replicas. The quorum approach is basically able to encompass a large class of failures. Moreover, the quorum approach simplifies considerably the task maintaining the consistency of replicated data. As a result, DYVO is fault-tolerant to all kinds of failures and gives a way that minimizes overload for managing a replication algorithm.     

ACTC：一种基于改进的蚁群算法的中文文本聚类算法

在对标准蚁群算法分析研究基础上,结合中文文本数据的特点,对蚁群算法存在的缺点进行改进,提出一种基于改进的蚁群算法的中文文本聚类方法——ACTC。算法中为每只蚂蚁增加两个记忆体,可以解决原算法中的“未指派现象”;模拟信息素,从而使蚂蚁的移动更具目的性,加快聚类速度;引入“边界点”思想,从而不仅可以消除“停滞现象”,而且能避免“噪声”或异常数据对聚类结果的负面影响;引入动态调整相似度阈值概念,从而使聚类结果更具实际意义。实验证明,从熵值与纯度两个评价函数评价结果看,该算法的聚类效果较好,达到算法改进的目的。     

面向查询扩展的特征词频繁项集挖掘算法

为了获取高质量的扩展词,提出一种面向查询扩展的基于文本数据库的特征词频繁项集挖掘算法。该算法采用支持度衡量特征词频繁项集,给出新的剪枝策略,并结合原始查询,挖掘同时含有查询词项和非查询词项的特征词频繁项集,以提高挖掘效率。实验表明,与传统的挖掘算法相比,本算法更有效、更合理。