The organization of biological sequences into constrained and unconstrained parts determines fundamental properties of genotype–phenotype maps

Biological information is stored in DNA, RNA and protein sequences, which can be understood as genotypes that are translated into phenotypes. The properties of genotype–phenotype (GP) maps have been studied in great detail for RNA secondary structure. These include a highly biased distribution of genotypes per phenotype, negative correlation of genotypic robustness and evolvability, positive correlation of phenotypic robustness and evolvability, shape-space covering, and a roughly logarithmic scaling of phenotypic robustness with phenotypic frequency. More recently similar properties have been discovered in other GP maps, suggesting that they may be fundamental to biological GP maps, in general, rather than specific to the RNA secondary structure map. Here we propose that the above properties arise from the fundamental organization of biological information into ‘constrained'' and ‘unconstrained'' sequences, in the broadest possible sense. As ‘constrained'' we describe sequences that affect the phenotype more immediately, and are therefore more sensitive to mutations, such as, e.g. protein-coding DNA or the stems in RNA secondary structure. ‘Unconstrained'' sequences, on the other hand, can mutate more freely without affecting the phenotype, such as, e.g. intronic or intergenic DNA or the loops in RNA secondary structure. To test our hypothesis we consider a highly simplified GP map that has genotypes with ‘coding'' and ‘non-coding'' parts. We term this the Fibonacci GP map, as it is equivalent to the Fibonacci code in information theory. Despite its simplicity the Fibonacci GP map exhibits all the above properties of much more complex and biologically realistic GP maps. These properties are therefore likely to be fundamental to many biological GP maps.     

分布式无线传感器网络通信协议研究

在归纳分布式无线传感器网络研究进展的基础上，给出了综合分布式无线传感器网络技术各个方面的协议体系结构，并在新的体系结构下，系统地阐述了分布式无线传感器网络通信协议研究的进展，介绍了典型的应用案例和国外相关计划的研究情况。最后，指明了这一处于发展初期的研究领域的未来发展方向。     

The rank one mixed μ problem and ‘kharitonov-type’ analysis

The general mixed μ problem has been shown to be NP hard, so that the exact solution of the general problem is computationally intractable, except for small problems. In this paper we consider not the general problem, but a particular special case of this problem, the rank one mixed μ problem. We show that for this case the mixed μ problem is equivalent to its upper bound (which is convex), and it can in fact be computed easily (and exactly). This special case is shown to be equivalent to the so-called ‘affine parameter variation’ problem (for a polynomial with perturbed coefficients) which has been examined in detail in the literature, and for which several celebrated ‘Kharitonov-type’ results have been proven.     

逻辑型多变量鲁棒自校正解耦间接算法

本文提出了一种多变量鲁棒自校正解耦间接算法。它采用一种新的正则化和相对死区实现了鲁棒自校正解耦控制。这种方法可以使系统跟踪特性不受死区界和正则化因子的影响。本文还给出了算法的鲁棒性分析和仿真结果。     

神经网络离散变结构控制的算法及其应用

本文首次将自适应线性神经元（Ａｄａｌｉｎｅ）用于离散变结构控制。以滑模面Ｓ（ｋ）＝０作为Ａｄａｌｉｎｅ元的希望输出，作为Ａｄａｌｉｎｅ元的实际输出，通过ＬＭＳ算法在线调整权值可保证滑态可达条件的满足。应用所提出的控制策略对泵控马达速度伺服系统进行控制，仿真表明控制效果是令人满意的。     

Adaptive predictive control algorithm based on Laguerre Functional Model

Laguerre Functional Model has many advantages such as good approximation capability for the variances of system time‐delay, order and other structural parameters, low computational complexity, and the facility of online parameter identification, etc., so this model is suitable for complex industrial process control. A series of successful applications have been gained in linear and non‐linear predictive control fields by the control algorithm based on Laguerre Functional Model, however, former researchers have not systemically brought forward the theoretical analyses of the stability, robustness, and steady‐state performance of this algorithm, which are the keys to guarantee the feasibility of the control algorithm fundamentally. Aimed at this problem, we introduce the principles of the Incremental Mode Linear Laguerre Predictive Control (IMLLPC) algorithm, and then systemically propose the theoretical analyses and proofs of the stability and robustness of the algorithm, in addition, we also put forward the steady‐state performance analysis. At last, the control performances of this algorithm on two different physical industrial plants are presented in detail, and a number of experimental results validate the feasibility and superiority of IMLLPC algorithm. Copyright © 2005 John Wiley & Sons, Ltd.     

零点位于左扇区的多项式菱形族

本文考虑多项式菱形族的左扇区稳定性,证明了多项式族左扇区稳定的充分必要条件是的至多4q(q—1)条特殊棱边左扇区稳定;进一步,在一定条件下,只要检验的4q个顶点多项式就可确定的左扇区稳定性。     

Robust pole assignment for incomplete nonlinear decoupling applied to robots

A robustness analysis and synthesis for incomplete nonlinear decoupling for a class of nonlinear systems is discussed. Rigid and elastic-joint robot models belong to this class. For the elastic case, a transformation facilitates the robustness analysis under a weak assumption. Charts with H ₁- and H - norms of closed-loop disturbance transfer functions of the nonlinear-decoupled system are presented for a robust pole assignment.     

一种基于Matlab图形用户界面的数字水印系统

数字水印技术是一种典型的信息网络安全有效保护措施。文章运用Maflab软件强大的GUI（图形用户界面）功能开发出一种基于小波变换的数字水印系统,该系统的构建是通过对载体彩色图像进行小波变换,然后将二值水印图像嵌入到小波变换后载体图像的低频子带中。实验结果证明,文章利用Matlab软件构建的数字水印系统在抗噪声攻击、JPEG压缩、小幅度剪切方面效果良好,稳健性强。     

Tracking control and robustness analysis for planar vertical takeoff and landing aircraft under bounded feedbacks

We study feedback tracking problems for the planar vertical takeoff and landing (PVTOL) aircraft dynamics, which is a benchmark model in aerospace engineering. We provide a survey of the literature on the model. Then we construct new feedback stabilizers for the PVTOL tracking dynamics. The novelty of our work is in the boundedness of our feedback controllers and their applicability to cases where the velocity measurements may not be available, coupled with the uniform global asymptotic stability and uniform local exponential stability of the closed‐loop tracking dynamics and the input‐to‐state stable performance of the closed‐loop tracking dynamics with respect to actuator errors. Our proofs are based on a new bounded backstepping result. We illustrate our work in a tracking problem along a circle. Copyright © 2011 John Wiley & Sons, Ltd.