目录及其在分布式主题网关中的应用

介绍了目录的基本概念，分析了LDAP、WHOIS 、CIP目录协议的主要特点，研究了国外主要的主题网关项目(ISAAC、ROADS、DESIRE、Imesh ToolKit)中目录协议的应用情况，指出目录协议在分布式索引、查询路由中起着的重要作用。     

基于深度强化学习方法的无线多跳网络能量高效机会路由

由于机会路由能够利用无线信道的广播特性和有损特性,因此一直是提高无线网络路由性能的一个很有效的途径。提出一种基于深度强化学习的无线多跳网络能量高效机会路由算法,该算法使得智能体能够通过训练学习最优的路由策略,以通过机会路由的方式减少传输时间,同时平衡能耗延长网络寿命。此外,本算法还可以极大地缓解冷启动问题并获得较好的初始性能。仿真结果表明,与现有算法相比,该算法具有更好的性能。     

一种实用的MPLS约束路由算法

MPLS流量工程是保证网络QOS的有效途径,而显式路径的建立是MPLS流量工程实施的关键问题之一。本文在分析了最近最宽路径算法和负载均衡算法后,提出通过计算网络最大流,以带宽需求为主要依据,同时考虑其它QOS参数的约束路由算法。该算法最大优点是简单实用,与此同时,可以在一定程度上均衡系统的负载。     

Hybrid ants-like search algorithms for P2P media streaming distribution in ad hoc networks

Media streaming delivery in wireless ad hoc networks is challenging due to the stringent resource restrictions,po-tential high loss rate and the decentralized architecture. To support long and high-quality streams,one viable approach is that a media stream is partitioned into segments,and then the segments are replicated in a network and served in a peer-to-peer(P2P) fashion. However,the searching strategy for segments is one key problem with the approach. This paper proposes a hybrid ants-like search algorithm(HASA) for P2P media streaming distribution in ad hoc networks. It takes the advantages of random walks and ants-like algorithms for searching in unstructured P2P networks,such as low transmitting latency,less jitter times,and low unnecessary traffic. We quantify the performance of our scheme in terms of response time,jitter times,and network messages for media streaming distribution. Simulation results showed that it can effectively improve the search efficiency for P2P media streaming distribution in ad hoc networks.     

刚性常微分方程的数值解法在化学动力学中的应用

解刚性常微分方程已成为复杂化学反应研究的重要途径，本介绍了化学动力学计算中的刚性问题和数值解法，并着重讨论常用的吉尔(Gear)法和半隐式龙格库塔(Semi-implicit Runge-Kutta)法及其在化学动力学中的应用。     

基于电子商务的精确搜索引擎的研究与实现

随着科技的发展,电子商务日益活跃。现行的电子商务打折网站与生俱来的局限性,越来越跟不上时代的步伐。能否开发一个能够收集全球打折信息的电子商务网站,越来越引起人们的重视。采用精确搜索引擎算法的电子商务精确搜索引擎模型,具有很好的精确性和响应速度,能够查询到精确而全面的打折信息,有较高的实用价值。     

FARMER: A novel approach to file access correlation mining and evaluation reference model

File semantic has proven effective in optimizing large scale distributed file system. As a consequence of the elaborate and rich I/O interfaces between upper layer applications and file systems, file system can provide useful and insightful information about semantic. Hence, file semantic mining has become an increasingly important practice in both engineering and research community. Unfortunately, it is a challenge to exploit file semantic knowledge because a variety of factors could affect this information exploration process. Even worse, the challenges are exacerbated due to the intricate interdependency between these factors, and make it difficult to fully exploit the potentially important correlation among various semantic knowledges. This article proposes a file access correlation miming and evaluation reference (FARMER) model, where file is treated as a multivariate vector space, and each item within the vector corresponds a separate factor of the given file. The selection of factor depends on the application, examples of factors are file path, creator and executing program. If one particular factor occurs in both files, its value is non-zero. It is clear that the extent of inter-file relationships can be measured based on the likeness of their factor values in the semantic vectors. Benefit from this model, FARMER represents files as structured vectors of identifiers, and basic vector operations can be leveraged to quantify file correlation between two file vectors. FARMER model leverages linear regression model to estimate the strength of the relationship between file correlation and a set of influencing factors so that the “bad knowledge” can be filtered out. To demonstrate the ability of new FARMER model, FARMER is incorporated into a real large-scale object-based storage system as a case study to dynamically infer file correlations. In addition FARMER-enabled optimize service for metadata prefetching algorithm and object data layout algorithm is implemented. Experimental results show that is FARMER-enabled prefetching algorithm is shown to reduce the metadata operations latency by approximately 30%–40% when compared to a state-of-the-art metadata prefetching algorithm and a commonly used replacement policy.     

基于遗传算法的高校试题组卷系统的研究

阐述了高校组卷系统的原理,重点研究了作为系统关键的组卷策略运算过程,提出了一个改进的动态分层遗传算法作为高校组卷系统的组卷策略,最后通过实验检验其性能。     

OSPF路由表计算的实现技术

从OSPF路由协议特点入手 ,通过对路由计算算法的分析 ,提出了一种五级模块调用实现模型 ,并对各个功能模块的实现给予了描述     

Ad Hoc网络AODV路由选择协议的改进

在移动Ad Hoc网络环境中，链路失效和路由改变的事件经常发生．TCP应用在这样的环境中性能是低下的，因为它总是认为数据包的丢失是由于网络拥塞造成的．提出一种改进的AODV路由协议（E-AODV），此协议在选路时会选择一条稳定的路径，进而提高TCP的吞吐量．仿真结果表明E-AODV协议是有效的．