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

ZUO Dong-hong DU Xu YANG Zong-kai 《浙江大学学报(A卷英文版)》2007,8(8):1191-1198

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.  相似文献   

刚性常微分方程的数值解法在化学动力学中的应用   总被引：1，自引：0，他引：1  

金翔秋  林娟娟 《温州职业技术学院学报》2003,3(2):46-49

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

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

许建豪 《南宁职业技术学院学报》2011,(4):97-100

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

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

夏鹏  冯丹  王芳 《上海大学学报(英文版)》2011,15(6):574-588

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.  相似文献   

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

张福泉 《河北职业技术学院学报》2011,(4)

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

Improving the learning of Boolean queries by means of a multiobjective IQBE evolutionary algorithm     

O. Cordón  E. Herrera-Viedma  M. Luque 《Information processing & management》2006

The Inductive Query By Example (IQBE) paradigm allows a system to automatically derive queries for a specific Information Retrieval System (IRS). Classic IRSs based on this paradigm [Smith, M., & Smith, M. (1997). The use of genetic programming to build Boolean queries for text retrieval through relevance feedback. Journal of Information Science, 23(6), 423–431] generate a single solution (Boolean query) in each run, that with the best fitness value, which is usually based on a weighted combination of the basic performance criteria, precision and recall.  相似文献   

遗传算法在股票投资技术分析中的应用     

冯平  宣慧玉 《预测》2001,20(2):38-41

本文首先分析了股票投资技术分析的特点,然后阐述了遗传算法及基于遗传算法的分类器系统的基本理论.最后,详细讨论了遗传算法及分类器系统在两种最常用的股票投资技术分析方法(指标分析和图形分析)的计算机化中的运用问题.  相似文献   

基于图论的ANMP分群算法的简单实现     

余丽华 《广东广播电视大学学报》2011,20(2):104-107,111

针对分布式无线网络多跳、移动的特点,要实现整个网络的快速部署以及拓扑结构变化后的动态重建,最有效的方法是采用分群协议,并在linux环境下,利用基于图论的ANMP分群算法,实现自组网的分群。  相似文献   

TSP问题的智能优化算法研究     

李亮  孙玉秋 《楚雄师范学院学报》2011,26(3):1-4,10

智能优化算法比较常见的有模拟退火算法、遗传算法、人工鱼群算法、神经网络算法等。本文主要对前三种算法优化性能进行研究。首先介绍了三种算法的基本原理,然后总结了各自的优缺点并从原理和参数两个方面对三种算法进行了对比分析,以经典NP难题——TSP为例进行了仿真研究给出了未来针对TSP问题的研究重点。  相似文献   

浅议求解最短路径问题的两种算法     

高岚 《环球赛鸽科技》2015,(18)

本文通过对比求解最短路径问题的Dijkstra算法和Floyd算法的设计思想、求解过程和应用实例,讨论了两种算法的特点及适用领域。  相似文献