基于扩充的GIX/M/1/N排队系统的主动队列管理算法性能评价模型

为了评价主动队列管理(AQM Active Queue Management)算法的性能,通过在标准的排队系统GIX/M/1/N中嵌入主动队列管理(AQM)算法的方法,建立了一个扩充的GIX/M/1/N排队系统。利用该扩充的GIX/M/1/N排队系统和Internet业务流量自相似性的特征,提出了一种评价AQM算法在非响应业务流量下的性能的分析方法,并据此评价了TD,RED,GRED和Adaptive RED等4个经典的AQM算法。为了验证该分析方法的合理性,利用NS2进行了一系列的仿真实验。结果表明,该分析方法所得结果与仿真实验所得结果一致,因此该分析方法能用于评价AQM算法的性能。     

Reconstructing design parameters of a rectangular resonator via peak signal-to-noise ratio and global optimization algorithms

This article proposes an approach for reconstructing physical parameters of a sample in a rectangular resonator during microwave radiation, knowing a priori, its electric field distribution. The inverse problem was solved using two global optimization algorithms and the peak signal-to-noise ratio (PSNR) criterion. First, the Self-regulated Fretwidth Harmony Search algorithm (SFHS) identified suitable resonant frequencies for a given configuration. Next, the unified Particle Swarm Optimization (UPSO) optimized said configuration. Together, they became a maximization strategy of the PSNR through a dual optimization process. Results showed the ability of the approach for estimating the height of each sample block and the resonating frequency of the cavity. This process takes longer to finish as a higher PSNR is demanded (mainly due to the aforementioned dual optimization). Even so, it allows for more similar electric field distributions between both, the direct and inverse problems.     

EDA9033A在分布式风机性能测试系统中的应用

针对以单片机为核心的风机性能测试系统存在稳定性差、抗干扰能力差、精度低等问题,开发了以PLC为核心、采用互感式采集模块EDA9033A采集风机电参数的分布式风机性能测试系统,给出了该风机性能测试系统的结构,详细介绍了EDA9033A的硬件及软件设计。实际应用表明,EDA9033A采集的风机电参数结果稳定、快速、准确。     

Discrete particle swarm optimization based on estimation of distribution for terminal assignment problems

Terminal assignment problem (TEAP) is to determine minimum cost links to form a network by connecting a given set of terminals to a given collection of concentrators. This paper presents a novel discrete particle swarm optimization (PSO) based on estimation of distribution (EDA), named DPSO-EDA, for TEAP. EDAs sample new solutions from a probability model which characterizes the distribution of promising solutions in the search space at each generation. The DPSO-EDA incorporates the global statistical information collected from personal best solutions of all particles into the PSO, and therefore each particle has comprehensive learning and search ability. In the DPSO-EDA, a modified constraint handling method based on Hopfield neural network (HNN) is also introduced to fit nicely into the framework of the PSO and thus utilize the merit of the PSO. The DPSO-EDA adopts the asynchronous updating scheme. Further, the DPSO-EDA is applied to a problem directly related to TEAP, the task assignment problem (TAAP), in order to show that the DPSO-EDA can be generalized to other related combinatorial optimization problems. Simulation results on several problem instances show that the DPSO-EDA is better than previous methods.     

Further results of recursive evaluation for compound distribution with the severity distribution of mixed type

Yang et al. [J.P. Yang, S.H. Cheng, Q. Wu, Recursive equations for compound distribution with the severity distribution of the mixed type, Science in China Series A 48 (2005) 594-609] investigated a recursive procedure for a kind of compound distributions with the number of claims belonging to (a,b)-family and the severity distribution of the mixed type. In this paper, we extend their results by assuming that the claim number belongs to a larger class. As applications, the excess-of-loss reinsurance treaty is discussed and concrete examples are considered in some detail.     

A computer-enabled solution procedure for food wholesalers’ distribution decision in cities with a circular transportation infrastructure

This paper addresses the food distribution decision from a wholesaler's perspective, as the wholesalers are often faced with thorny issues such as when, where, how to deliver products at the lowest costs to best satisfy the retailers’ changing needs. This research relies on a distribution problem encountered at Northern Grocery Company in Beijing as an example to develop a two-stage solution procedure and subsequent computer-enabled programs for identifying efficient vehicle routing alternatives. The solution process, which integrates heuristic search algorithms and an integer programming model, can be applied to a wide range of distribution problems with specified route durations and a circular transportation network structure as exemplified by City of Beijing.     

A DSS for integrated distribution of empty and full containers

A DSS integrating empty and full containers transshipment operations is presented, addressing the typically unbalanced export/import containers trading problem. The problem is modeled as a network, where nodes represent customers, leasing companies, harbors and warehouses, while arcs represent transportation routes. The underlying mathematical model operates in stages, first prioritizing and adjusting full containers demands considering available empty containers supplies, and then statically optimizing costs. Transportation routes are registered and dynamically controlled, cyclically, for a given time horizon. The DSS is flexible, allowing several parameters to be configured. Experimental examples using randomly generated parameters were conducted to evaluate the effectiveness of the system.     

HK网络演化模型的研究和改进

研究一种高集聚度的无标度网络模型,以Holme和Kim（HK）模型为基础,通过引进新增节点所应该具备的连接动态性,改进HK模型的局部特性。分析和仿真表明,改进模型HK’不仅继承了HK模型的高聚类效应和无标度特性,且它的幂律指数可在2～3之间变化,网络成员间的竞争机制也与现实社会网络较接近。