ADAPTIVE RANKS CLONE AND k‐NEAREST NEIGHBOR LIST–BASED IMMUNE MULTI‐OBJECTIVE OPTIMIZATION

Artificial immune systems (AIS) are computational systems inspired by the principles and processes of the vertebrate immune system. The AIS‐based algorithms typically exploit the immune system's characteristics of learning and adaptability to solve some complicated problems. Although, several AIS‐based algorithms have proposed to solve multi‐objective optimization problems (MOPs), little focus have been placed on the issues that adaptively use the online discovered solutions. Here, we proposed an adaptive selection scheme and an adaptive ranks clone scheme by the online discovered solutions in different ranks. Accordingly, the dynamic information of the online antibody population is efficiently exploited, which is beneficial to the search process. Furthermore, it has been widely approved that one‐off deletion could not obtain excellent diversity in the final population; therefore, a k‐nearest neighbor list (where k is the number of objectives) is established and maintained to eliminate the solutions in the archive population. The k‐nearest neighbors of each antibody are founded and stored in a list memory. Once an antibody with minimal product of k‐nearest neighbors is deleted, the neighborhood relations of the remaining antibodies in the list memory are updated. Finally, the proposed algorithm is tested on 10 well‐known and frequently used multi‐objective problems and two many‐objective problems with 4, 6, and 8 objectives. Compared with five other state‐of‐the‐art multi‐objective algorithms, namely NSGA‐II, SPEA2, IBEA, HYPE, and NNIA, our method achieves comparable results in terms of convergence, diversity metrics, and computational time.     

结合变尺度法的改进类电磁机制算法

标准类电磁机制算法处理连续函数优化问题时存在最优参数选取和收敛速度问题.数值实验研究表明类电磁算法不具备初值敏感性,并在搜索后期算法收敛速度缓慢甚至可能出现停滞.数值实验分析指出粒子之间达成动态力平衡状态是造成算法停滞的可能原因之一,提出一种解决策略是摒弃EM算法后期搜索过程,结合变尺度法对EM算法前期搜索到的近似最优值进行二次优化.该混合计算方法将二者的优势相结合,实验结果表明新方法在保证计算实时性的同时,取得了较高的计算精度.最后,对EM算法本身构造提出一些改进意见,并初步建立用于连续函数优化的EM算法计算框架,为后续更深入的研究EM算法提供参考.     

Solving single-product economic lot-sizing problem with non-increasing setup cost,constant capacity and convex inventory cost in O(N log N) time

This paper considers an economic lot sizing model with constant capacity, non-increasing setup cost, and convex inventory cost function. Algorithms with computational time of O(N×TD_N)have been developed for solving the model, where N is the number of planning periods and TD_N is the total demand. This study partially characterizes the optimal planning structure of the model. A new efficient algorithm with computational time of O(N log N) has also been developed based on the partial optimal structure. Moreover, computational study demonstrates that the new algorithm is efficient.     

Defining syntax-directed translations by tree bimorphisms

We introduce a class of tree bimorphisms that define exactly the translations performed by syntax-directed translation schemata. We also show that these “quasi-alphabetic” tree bimorphisms preserve recognizability, and that their class is closed under composition and inverses.     

CCA-secure unidirectional proxy re-encryption in the adaptive corruption model without random oracles

Up to now, it is still an open question of how to construct a chosen-ciphertext secure unidirectional proxy re-encryption scheme in the adaptive corruption model. To address this problem, we propose a new unidirectional proxy re-encryption scheme, and prove its chosen-ciphertext security in the adaptive corruption model without random oracles. Compared with the best known unidirectional proxy re-encryption scheme proposed by Libert and Vergnaud in PKC’08, our scheme enjoys the advantages of both higher effi...     

Parameterized computational complexity of control problems in voting systems

Voting systems are common tools in a variety of areas. This paper studies parameterized computational complexity of control of Plurality, Condorcet and Approval voting systems, respectively. The types of controls considered include adding or deleting candidates or voters, under constructive or destructive setting. We obtain the following results: (1) constructive control by adding candidates in Plurality voting is W[2]-hard with respect to the parameter “number of added candidates”, (2) destructive control by adding candidates in Plurality voting is W[2]-hard with respect to the parameter “number of added candidates”, (3) constructive control by adding voters in Condorcet voting is W[1]-hard with respect to the parameter “number of added voters”, (4) constructive control by deleting voters in Condorcet voting is W[1]-hard with respect to the parameter “number of deleted voters”, (5) constructive control by adding voters in Approval voting is W[1]-hard with respect to the parameter “number of added voters”, and (6) constructive control by deleting voters in Approval voting is W[2]-hard with respect to the parameter “number of deleted voters”.     

基于PIC16F877A的变频恒压供水控制器设计

分析了高层建筑供水控制系统的技术要求,介绍了基于PIC16F877A单片机的变频恒压供水控制器的工作原理,提出了该装置的软硬件设计方法.相比目前的变频恒压控制系统,该装置的精简硬件设计有效地克服了系统可靠性差的问题;同时,基于PSO-PID智能算法的软件设计解决了系统动态响应慢和压力调节不稳定的缺点.该装置成本低、智能化程度高,生产实际中能够确保设备的使用寿命、能源的有效利用和供水质量.因此,具有很高的推广、应用价值.     

基于iSCSI的级联远程复制系统实现与优化

提出基于iSCSI的级联远程复制系统结构及其实现方法.对传统实现进行优化,一方面引入带双阈值的传输控制队列和引用计数模块,提高本地子系统的性能;另一方面通过添加元数据记录传输和数据一致性恢复功能,解决了两级子系统在网络环境差异较大时协同性差的问题.调节iSCSI参数,进一步优化系统性能.性能测试表明,优化的级联远程复制系统具有高可用性和良好的性能.