共查询到20条相似文献,搜索用时 136 毫秒
1.
2.
随着移动通信短信业务的迅速发展,现有的短信业务分布预测算法已经无法满足需求。提出了一种基于聚类分析和模拟退火的短信业务分布预测算法。根据电子地图、基站语音和短信业务统计数据,提取影响短信业务分布的相关属性,采用聚类分析方法中的自组织映射(Self Organizing Map,SOM)方法和k-means算法,将网络中基站进行分类,然后采用模拟退火算法和最小二乘法计算得到不同类型基站中的不同地物的短信日均业务密度值,从而达到对短信进行业务分布预测的目的。通过实际基站短信业务统计数据的验证,该算法大幅提高了短信业务分布预测的准确度。 相似文献
3.
4.
文章提出一种模拟退火(SA)与粒子群优化(PSO)算法相结合的算法来优化Elman神经网络权值和阈值。当PSO处于停滞状态时,利用粒子群优化算法的全局寻优性质,以及SA能跳出局部最优解的特性,在搜索到的最优位置处用模拟退火算法继续寻找最优解,并对具有动态递归性能的Elman神经网络进行学习训练,这样就能对忙时话务量进行预测。结果表明,与传统Elman神经网络和PSO-Elman神经网络相比,基于模拟退火粒子群算法训练的神经网络具有更高的预测精度和良好的自适应性。 相似文献
5.
6.
《信息技术》2017,(6):10-14
为了改善极限学习机(Extreme Learning Machine,ELM)收敛速度慢、预测精度不稳定、隐层神经元对网络参数敏感度低等缺点,文中提出了粒子群(Particle Swarm Optimization,PSO)并行模拟退火(Simulated Annealing,SA)优化ELM的算法(APSO-ELM)。该算法首先通过对ELM随机产生的初始权值和阈值进行优化,进化出较优解,然后对每组解进行模拟退火,从而提高算法摆脱局部极值点的能力,最后将优化退火后的解集,用来预测ELM的输出。算法仿真结果表明:改进的ELM可有效解决粒子群寻优过程易陷入局部最优的问题,其预测精度、收敛速度、隐层神经元的敏感度均优于其他常见ELM扩展算法。将改进的ELM应用在光伏发电输出功率预测上,可以预测光伏发电输出功率的变化规律,精度较高。 相似文献
7.
针对多径信道环境下非同步长码DS-CDMA信号扩频码及信息序列等参数的联合估计问题,该文提出了基于序贯蒙特卡罗(SMC)的盲估计算法。该算法采用混合重要密度函数对联合后验分布模型进行抽样,并迭代计算重要性权值,以完成所需状态参量的估计。同时为了减少算法的计算量,在算法的实现过程中,先估计出各用户的扩频码,再对观测数据进行处理,从而修正原有的迭代步骤,提出一种修正的SMC算法。仿真结果验证了算法对多种情况的适应性,且在时变的多径信道环境下也能获得较好的估计性能。 相似文献
8.
9.
为了研究遗传模拟退火算法在光散射模型参量反演中的迭代搜索性能问题,分别采用遗传模拟退火算法和单一遗传算法迭代搜索了几种介质的双向反射分布函数模型的相关参量。将两种算法的反演结果与在特定激光波长下的双向反射分布函数实验数据进行了对比,通过理论分析和实验验证,取得了两种算法所得到的拟合值,两种拟合值都与实验数据吻合得较好;同时比较了遗传模拟退火算法和单一遗传算法在迭代次数、计算时间和均方误差等之间的差异。结果表明,两种算法在不同介质表面双向反射分布函数模型参量反演时都可以得到满意的结果,且前者优化效果更优。这一结果对研究不同算法的迭代搜索性能是有帮助的。 相似文献
10.
为了研究遗传模拟退火算法在光散射模型参量反演中的迭代搜索性能问题,分别采用遗传模拟退火算法和单一遗传算法迭代搜索了几种介质的双向反射分布函数模型的相关参量.将两种算法的反演结果与在特定激光波长下的双向反射分布函数实验数据进行了对比,通过理论分析和实验验证,取得了两种算法所得到的拟合值,两种拟合值都与实验数据吻合得较好;同时比较了遗传模拟退火算法和单一遗传算法在迭代次数、计算时间和均方误差等之间的差异.结果表明,两种算法在不同介质表面双向反射分布函数模型参量反演时都可以得到满意的结果,且前者优化效果更优.这一结果对研究不同算法的迭代搜索性能是有帮助的. 相似文献
11.
12.
13.
当前,流量矩阵已经被广泛应用于异常检测、流量预测、流量工程等领域,但是现有研究仅仅发现流量矩阵存在线性结构。为了寻找流量矩阵中可能存在的非线性结构,构建流量矩阵模型并从实际因特网骨干网Abilene中采集流量矩阵数据集,应用经典的流形学习算法进行实测数据分析,发现这些高维(81维或121维)的流量矩阵数据集实际上是嵌入的固有维度为5维的低维流形,且其受采样密度和噪声数据等各种因素的影响呈现出不同的结构。 相似文献
14.
We consider modeling the statistical behavior of interactive and streaming traffics in high-speed downlink packet access (HSDPA) networks. Two important applications in these traffic categories are web-browsing (interactive service) and video streaming (streaming service). Web-browsing is characterized by its important sensitivity to delay. Video streaming on the other hand is less sensitive to delay, however, due to its large frame sizes, video traffic is more affected by the packet loss resulting from a limited buffer size at the base station. Taking these characteristics into account, we consider modeling the queuing delay probability density function (PDF) of the Web-browsing traffic, and modeling the queuing buffer size distribution of video streaming traffic. Specifically, we show that the queuing delay of the Web-browsing traffic follows an exponential distribution and that the queuing buffer size of video streaming traffic follows a weighted Weibull distribution. Model fitting based on simulated data is used to provide simple mathematical formulations for the different parameters that characterize the PDFs under consideration. The provided equations could be used, directly, in HSDPA network dimensioning and, as a reference, to satisfy a certain quality of service (QoS). 相似文献
15.
Addressing performance related issues of networks and ensuring better Quality of Service (QoS) for end-users calls for simple, tractable and realistic traffic models. The work reported here focuses on modelling the Wireless Internet traffic using realistic traffic traces collected over wireless networks and forecasting the end-to-end QoS parameters for the networks. A measurement framework is set-up to collect the QoS parameters and a traffic model is designed based on Hidden Markov Model considering joint distribution of End to End Delay (E2ED or d), Inter-Packet Delay Variation (IPDV) and Packet Size. States are mapped to the four traffic classes namely conversational, streaming, interactive, and background. The model is validated by forecasting QoS parameters and the results are shown to be within the tolerance limit. 相似文献
16.
With the rapid growth of satellite traffic, the ability to forecast traffic loads becomes vital for improving data transmission efficiency and resource management in satellite networks. To precisely forecast the short-term traffic loads in satellite networks, a forecasting algorithm based on principal component analysis and a generalized regression neural network (PCA-GRNN) is proposed. The PCA-GRNN algorithm exploits the hidden regularity of satellite networks and fully considers both the temporal and spatial correlations of satellite traffic. Specifically, it selects optimal time series of spatio-temporally correlated historical traffic from satellites as forecasting inputs and applies principal component analysis to reduce the input dimensions while preserving the main features of the data. Then, a generalized regression neural network is utilized to perform the final short-term load forecasting based on the obtained principal components. The PCA-GRNN algorithm is evaluated based on real-world traffic traces, and the results show that the PCA-GRNN method achieves a higher forecasting accuracy, has a shorter training time and is more robust than other state-of-the-art algorithms, even for incomplete traffic datasets. Therefore, the PCA-GRNN algorithm can be regarded as a preferred solution for use in real-time traffic forecasting for realistic satellite networks. 相似文献
17.
Degan Zhang Jiaxu Wang Hongrui Fan Ting Zhang Jinxin Gao Peng Yang 《International Journal of Communication Systems》2021,34(1):e4647
Traffic flow forecasting is one of the essential means to realize smart cities and smart transportation. The accurate and effective prediction will provide an important basis for decision‐making in smart transportation systems. This paper proposes a new method of traffic flow forecasting based on quantum particle swarm optimization (QPSO) strategy for intelligent transportation system (ITS). We establish a corresponding model based on the characteristics of the traffic flow data. The genetic simulated annealing algorithm is applied to the quantum particle swarm algorithm to obtain the optimized initial cluster center, and is applied to the parameter optimization of the radial basis neural network prediction model. The function approximation of radial basis neural network is used to obtain the required data. In addition, in order to compare the performance of the algorithms, a comparison study with other related algorithms such as QPSO radial basis function (QPSO‐RBF) is also performed. Simulation results show that compared with other algorithms, the proposed algorithm can reduce prediction errors and get better and more stable prediction results. 相似文献
18.
19.