基于免疫粒子群优化的移动Sink路径规划算法

为了减少能量空洞和延长网络生命周期，在无线传感网中采用移动 Sink 的方式收集节点采集的数据是解决能 量效率问题的有效措施．采集路径的规划问题类似于旅行商问题，无法得到多项式时间的解．提出了将人工免疫算法和粒子群算法相结合，针对移动 sink 数据收集的路径规划问题寻求近似最优解，仿真结果表明: 与其他算法进行性能比较，所提出的优化算法能够有效减少能耗和缩短遍历路径．     

算法的相关性变换与划分带个数的关系

使用相关性变换法，划分并映射循环算法到具有固定尺寸的Ｓｙｓｔｏｌｉｃ阵列。下标集合被划分成若干条带，划分带的条数与变换后的Ｓｙｓｔｏｌｉｃ阵列算法的执行时间成正比。指出了Ｍｏｌｄｏｖａｎ给出的计算划分带条数的公式有很大局限性，给出了由空间变换计算划分带条数的方法。     

Scale Invariance Properties in the Simulated Annealing Algorithm

The Boltzmann distribution used in the steady-state analysis of the simulated annealing algorithm gives rise to several scale invariant properties. Scale invariance is first presented in the context of parallel independent processors and then extended to an abstract form based on lumping states together to form new aggregate states. These lumped or aggregate states possess all of the mathematical characteristics, forms and relationships of states (solutions) in the original problem in both first and second moments. These scale invariance properties therefore permit new ways of relating objective function values, conditional expectation values, stationary probabilities, rates of change of stationary probabilities and conditional variances. Such properties therefore provide potential applications in analysis, statistical inference and optimization. Directions for future research that take advantage of scale invariance are also discussed.     

Science Letters： A synthetic Toll-like receptor 2 ligand decreases allergic immune responses in a mouse rhinitis model sensitized to mite allergen

It has been proposed that activation of Toll-like receptors （TLRs） plays crucial roles in the polarization of adaptive immune responses. A synthetic Toll-like receptor 2 （TLR2） ligand, Pam3CSK4, has been reported to modulate the balance of Th1/Th2 responses. We evaluated the modulation effect of Pam3CSK4 on allergic immune response in a mouse rhinitis model sensitized to house dust mite allergen （HDM）. Mice were sensitized and challenged with Dermatophagoidesfarinae allergen （Der f）, and then the allergic mice were treated by Pam3CSK4. Nasal allergic symptoms and eosinophils were scored. Der f-specific cytokine responses were examined in the splenocytes and bronchoalveolar lavage fluid （BALF）. Serum level of total IgE was also detected. After establishing a mouse allergic rhinitis model with HDM, we have showed that Pam3CSK4 treatment not only ameliorated the nasal allergic symptoms remarkably but also decreased the eosinophils and total inflammation cells in BALF significantly. Analysis of cytokine profile found that IFN-7 released from either BALF or stimulated splenocytes increased markedly in Pam3CSK4-treated mice, while IL-13 decreased significantly. Moreover, serum level of total IgE was significantly lower in Pam3CSK4-treated mice than in the untreated. Thus, in an allergic rhinitis mouse model developed with HDM, Pam3CSK4 was shown to exhibit an antiallergic effect, indicating its potential application in allergic diseases.     

共轭斜量法在某些特征向量上收敛速度的估计

设 Ａ是对称正定矩阵，λ_1是 Ａ 的最大或最小特征值，χ_1是对应的特征向量．｛zk｝是用共轭斜量法求解方程组 Αχ＝ｂ时的近似解序列，ｅi＝Ａ～(_1)b-zi,本文给出了|x_1～Tei|较合理的上界估计式。从而为分析预处理共轭斜量法提供了进一步的理论基础。     

Robust handling of non‐linear constraints for GA optimization of aerodynamic shapes

A new approach to the robust handling of non‐linear constraints for GAs (genetic algorithms) optimization is proposed. A specific feature of the approach consists of the change in the conventional search strategy by employing search paths which pass through both feasible and infeasible points (contrary to the traditional approach where only feasible points may be included in a path). The method (driven by full Navier–Stokes computations) was applied to the problem of multiobjective optimization of aerodynamic shapes subject to various geometrical and aerodynamic constraints. The results demonstrated that the method retains high robustness of conventional GAs while keeping CFD computational volume to an acceptable level, which allowed the algorithm to be used in a demanding engineering environment. Copyright © 2004 John Wiley & Sons, Ltd.     

Gray code for derangements

We give a Gray code and constant average time generating algorithm for derangements, i.e., permutations with no fixed points. In our Gray code, each derangement is transformed into its successor either via one or two transpositions or a rotation of three elements. We generalize these results to permutations with number of fixed points bounded between two constants.     

Local approximations for maximum partial subgraph problem

We deal with MAXH₀-FREE PARTIAL SUBGRAPH. We mainly prove that 3-locally optimum solutions achieve approximation ratio (δ₀+1)/(B+2+ν₀), where B=max_v∈Vd_G(v), δ₀=min_v∈V(H0)d_H0(v) and ν₀=(|V(H₀)|+1)/δ₀. Next, we show that this ratio rises up to 3/(B+1) when H₀=K₃. Finally, we provide hardness results for MAXK₃-FREE PARTIAL SUBGRAPH.     

Equivalence of two linear programming relaxations for broadcast scheduling

A server needs to compute a broadcast schedule for n pages whose request times are known in advance. Outputting a page satisfies all outstanding requests for the page. The goal is to minimize the average waiting time of a client. In this paper, we show the equivalence of two apparently different relaxations that have been considered for this problem.     

Strongly polynomial-time approximation for a class of bicriteria problems

Consider the following problem: given a ground set and two minimization objectives of the same type find a subset from a given subset-class that minimizes the first objective subject to a budget constraint on the second objective. Using Megiddo's parametric method we improve an earlier weakly polynomial time algorithm.