Pattern synthesis of time‐modulated conformal arrays by an improved differential evolution algorithm

In this article, an improved differential evolution algorithm (IDE) based on two different colonies is proposed and applied to time‐modulated conformal arrays syntheses. The whole population of IDE is divided into two parts. The one part searches the solution globally while the other searches the neighborhood of the solution provided by the previous one. Benchmark functions are provided to testify IDE. Furthermore, IDE is applied to synthetize sum‐difference patterns with a 1 × 16 elements time‐modulated circular array and low sidelobe level (SLL) patterns with an 8 × 12 elements time‐modulated cone array. After optimization, the sideband level (SBL) of the circular array at the first sideband frequency is ?1.00 dB. The SLL and SBL at the first sideband frequency of the cone array are lower than ?30.00 and ?20.00 dB, respectively. Experiment results verify the superior performance of IDE. Moreover, to accelerate the computation speed, graphics processing unit parallel computing technique is introduced into pattern synthesis and the acceleration ratios of more than 23 times can be achieved. © 2014 Wiley Periodicals, Inc. Int J RF and Microwave CAE 24:697–705, 2014.     

Synthesis of antenna arrays with an efficient multiobjective differential evolution algorithm

An efficient multiobjective differential evolution algorithm for array synthesis is proposed in this article. By introducing novel strategies in the generalized differential evolution (GDE3), the proposed algorithm can generate a better converged and distributed Pareto front than the standard GDE3. Five typical benchmark functions are optimized by the proposed improved GDE3 (IGDE) to verify its effectiveness. Furthermore, the proposed algorithm is applied in two‐pattern synthesis problems, including an unequal spaced linear array and a conformal array. The superior performance of the proposed IGDE demonstrates that it is an efficient and competitive algorithm in the function optimization, pattern synthesis, and other electromagnetic problems. © 2013 Wiley Periodicals, Inc. Int J RF and Microwave CAE 24:161–169, 2014.     

物理防晒剂配方应用

指出了防晒对人体的重要性，并给出了防晒产品提高效能的依据。重点讨论了如何使用TIOVEIL和SPECTRAVEIL分散液来取得最佳的效能，在达到最高的SPF值和UVA防护的同时保证最终产品的稳定和雅致外观。同时还给出了物理防晒产品TIOVEIL和SPECTRAVEIL的配方指导。     

A comparative analysis of evolutionary and memetic algorithms for community detection from signed social networks

To detect communities in signed networks consisting of both positive and negative links, two new evolutionary algorithms (EAs) and two new memetic algorithms (MAs) are proposed and compared. Furthermore, two measures, namely the improved modularity Q and the improved modularity density D-value, are used as the objective functions. The improved measures not only preserve all properties of the original ones, but also have the ability of dealing with negative links. Moreover, D-value can also control the partition to different resolutions. To fully investigate the performance of these four algorithms and the two objective functions, benchmark social networks and various large-scale randomly generated signed networks are used in the experiments. The experimental results not only show the capability and high efficiency of the four algorithms in successfully detecting communities from signed networks, but also indicate that the two MAs outperform the two EAs in terms of the solution quality and the computational cost. Moreover, by tuning the parameter in D-value, the four algorithms have the multi-resolution ability.     

RIAIL:大规模图上的可达性查询索引方法

图被广泛用来建模在社交网络、语义网、计算生物学和软件分析中的应用.可达性查询是图数据上的一种基础查询.当前,针对图上的可达性查询已经提出了一些索引算法,但是它们不能灵活地扩展到大的图数据.因此,提出了一种索引方法RIAIL(reachability index augmented by interval labeling).RIAIL将结点的标记信息表示成四元组.前两个元素是区间标记,编码生成树的可达性信息,后两个元素编码非树边的可达性信息.RIAIL查询时只需索引且索引创建代价小.最后,通过大量真实和人工生成数据集上的实验说明,RIAIL能够高效地处理可达性查询,并且可以简单地扩展到大的图数据.     

闭世界框架下灰色模糊多属性决策方法

针对D-S 证据理论在融合高度冲突的证据时可能导致与直观结果相悖的问题, 已有的基于修改数据模型的方法更多地考虑如何提高冲突证据结果的聚焦程度, 而没有考虑冲突成因以及如何通过冲突原因判断来削减证据之间的冲突. 对此, 提出一种闭世界框架下的灰色模糊多属性决策方法. 根据一般的灰色关联分析方法的基本思路, 将灰色关联度与欧氏距离有机结合, 构造出一种平均相似度对方案进行评价, 进而得到方案的排序结果. 最后, 通过实例分析验证了所提出方法的可行性和有效性.     

在线用户兴趣多样性的实证研究

在线用户的群体兴趣对于分析在线社会网络以及个性化推荐至关重要。研究的目的是引入信息熵这一指标来准确度量用户兴趣的多样性。分别在电影网站MovieLens和音乐网站Last．FM数据上进行实证分析,即统计度相同的用户所选产品的信息熵值。MovieLens的结果表明,随着用户度的增加,熵值出现先上升后下降的趋势,即度小的用户和度大的用户的兴趣比较专一,而一般用户的兴趣较为多样;而Last．FM的结果表明,度小用户的兴趣非常多样,但随着用户听过的音乐数量越多,兴趣越明确。通过建立随机模型与实证结果进行比较,可以发现绝大多数用户在真实数据集上的兴趣的多样性比随机情况要大,可见用户的兴趣对用户行为模式的影响显著。     

全生命周期软件过程风险管理模型研究

首先从软件过程的角度重新定义了过程风险的基本概念;然后结合CMMI和软件的生命周期分别从软件过程、生命周期和风险管理构建了三维结构的软件项目风险管理模型,提出了基于CMMI的全生命周期的过程风险策划、识别、评估和监控全过程模型;最后建立了软件研制风险管理系统,该系统在实际应用中取得了较好的效果。     

基于博弈论的百万富翁协议

在经典的百万富翁协议中,一方在得到最后的财富比较结果后,没有动机将结果告诉另一方,或者告诉另一方一个错误的结果。结合博弈论和密码算法,提出一种百万富翁协议。在此协议中,参与者背离协议的收益小于遵守协议的收益,遵守协议是参与者的最优策略,任何百万富翁的欺骗行为都能被鉴别和发现,因此理性的参与者有动机发送正确的数据。最后每个参与者都能公平地得到最后的财富比较结果。