Affinity genetic algorithm

Based on some phenomena from human society and nature, we propose a binary affinity genetic algorithm (aGA) by adopting the following strategies: the population is adaptively updated to avoid stagnation; the newly generated individuals will be ensured to survive for some generations in order for them to have time to show their good genes; new individuals and the old ones are balanced to have the advantages of both. In order to quantitatively analyze the selective pressure, the concept of selection degree and a simple linear control equation are introduced. We can maintain the diversity of the evolutionary population by controlling the value of the selection degree. Performance of aGA is further enhanced by incorporating local search strategies. Partially supported by a National Key Basic Research Project of China and by a USA NSF grant CCR-0201253.     

Bootstrap bandwidth selection in kernel density estimation from a contaminated sample

In this paper we consider kernel estimation of a density when the data are contaminated by random noise. More specifically we deal with the problem of how to choose the bandwidth parameter in practice. A theoretical optimal bandwidth is defined as the minimizer of the mean integrated squared error. We propose a bootstrap procedure to estimate this optimal bandwidth, and show its consistency. These results remain valid for the case of no measurement error, and hence also summarize part of the theory of bootstrap bandwidth selection in ordinary kernel density estimation. The finite sample performance of the proposed bootstrap selection procedure is demonstrated with a simulation study. An application to a real data example illustrates the use of the method. This research was supported by ‘Projet d’Actions de Recherche Concertées’ (No. 98/03-217) from the Belgian government. Financial support from the IAP research network nr P5/24 of the Belgian State (Federal Office for Scientific, Technical and Cultural Affairs) is also gratefully acknowledged.     

关于完全多部图的带宽和的一个注记

本文得到完全多部图的带宽和的一个递推方程；并由此给出带宽和的一些精确值．     

高功率同轴波导Ubitron放大器的高频特性研究

 用三维非线性理论，对高功率同轴波导Ubitron放大器进行了研究。该Ubitron放大器采用环形相对论电子注与同轴波导的TE₀₁模相互作用。通过数值模拟，在Ku波段得到了2.24MW的输出功率，其效率为10.9%，带宽为35% 。数值计算结果表明：电子注的自场导致饱和功率减少，频带变窄，增益下降。使用摇摆器幅值渐变，器件工作效率从10.9%提高到12.3%。     

入射光面转动TeO2声光偏转器

本文提出了入射光面转动的新型工作模式ＴｅＯ２声光偏转器，入射光面转动Ｋ波矢位在（１１）平面，（１１０）平面是（１１０）－（００１）面绕（１１）轴转动一定角度而得，这种器件的特点是，比通常的偏转器具有最高的衍射效率和更宽的动态范围。     

对低信噪比非稳定信号的参数估计MESPRIT

对振幅衰减和信噪比极低的信号进行参数估计,最常用的傅氏变换以及大多数现代信号参数估计方法(如,最大熵法MEM、线性预测奇异分解法LPSVD等),其结果都不能令人满意.本文针对信号衰减、信噪比极低的特点,改进了基于旋转不变技术的信号参数的估计方法(MESPRIT),并给出几种估计方法的对比仿真结果.     

最优Logistic总体的选择

利用经验Bayes方法,我们提出了一套选择带控制的最优Logistic总体的方案,并给出了择优统计量的收敛速度.     

Hidden correlation between absorption peaks in achiral carbon nanotubes and nanoribbons

In this paper we study the effect of absorption peak correlation in finite length carbon nanotubes and graphene nanoribbons. It is shown, in the orthogonal π-orbital tight-binding model with the nearest neighbor approximation, that if the ribbon width is a half of the tube circumference the effect takes place for all achiral ribbons (zigzag, armchair and bearded), and corresponding tubes, starting from lengths of about 30?nm. This correlation should be useful in designing nanoribbon-based optoelectronics devices fully integrated into a single layer of graphene.     

基于正交频分复用无源光网络的动态带宽分配算法研究

介绍了一种应用于未来大容量、多业务接入场景下的称为光正交频分复用无源光网络的下一代接入网技术,并提出了一种基于此结构的称为基于服务质量需求的固定周期流水线轮询动态带宽分配算法.该算法通过应用二级带宽分配机制、带宽预申请机制和最小带宽申请优先原则等方法,有效地保障了在大容量、多业务接入场景下各个业务不同的服务质量需求.为...     

On explicit formulas for bandwidth and antibandwidth of hypercubes

The Hales numbered n-dimensional hypercube exhibits interesting recursive structures in n. These structures lead to a very simple proof of the well-known bandwidth formula for hypercubes proposed by Harper, whose proof was thought to be surprisingly difficult. Harper also proposed an optimal numbering for a related problem called the antibandwidth of hypercubes. In a recent publication, Raspaud et al. approximated the hypercube antibandwidth up to the third-order term. In this paper, we find the exact value in light of the above recursive structures.