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.     

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.     

Systematic robustness analysis of least squares mobile robot velocity estimation using a regular polygonal optical mouse array

This paper presents the robust velocity estimation of an omnidirectional mobile robot using a regular polygonal array of optical mice that are installed at the bottom of a mobile robot. First, the velocity kinematics from a mobile robot to an array of optical mice is derived, from which the least squares estimation of the mobile robot velocity is obtained as the simple average of the optical mouse velocity readings. Second, it is shown that a redundant number of optical mice contributes to the robustness of the least squares mobile robot velocity estimation against both measurement noises and partial malfunction of optical mice. Third, the sensitivity analysis of the least squares mobile robot velocity estimation to imprecise installation of optical mice is made, from which a practical method of optical mouse position calibration is devised. Finally, some experimental results using commercial optical mice are given to demonstrate the validity and performance of the proposed mobile robot velocity estimation. Copyright © 2011 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

Semantic analysis in XTRA,an English — Chinese machine translation system

This paper concerns the resolution of lexical ambiguity in a machine translation environment. We describe the integration of principles of selection restrictions. Preference Semantics, and intelligent relaxation of constraints in handling lexical ambiguity. The approach differs from many previous MT systems in that it is more powerful than brute force systems, while more realistic than systems that assume a large degree of coded encyclopedia information for full understanding.     

不同重力环境的空间机械臂自抗扰轨迹跟踪控制

针对空间机械臂在地面装调与空间应用时,由于重力环境变化导致机械臂模型发生变化的问题,提出了一种自抗扰控制算法,用于完成空间机械臂轨迹跟踪控制的任务.该算法通过将系统模型及未知外扰作为系统的总和扰动,并利用扩张状态观测器对该扰动进行观测且给予补偿,从而提高了系统抗扰的性能.当机械臂模型随重力环境变化而发生变化时,使用同一个自抗扰控制器对其末端轨迹进行控制,均能取得较好的控制效果.通过对系统的稳定性进行分析,证明了所设计控制器的有效性.将仿真结果与PD控制及自适应鲁棒控制做比较,结果表明该控制算法不仅能适应机械臂模型的变化而且还能有效抵抗系统的扰动,从而使系统具有较强的鲁棒性.     

基于分裂式K均值聚类的肤色检测方法

针对复杂图像背景及光照导致的肤色检测率不高的问题,提出一种基于分裂式K均值聚类的椭圆模型肤色检测方法。该方法对图像进行光线补偿处理,采用Gray World方法对图像进行颜色均衡,选择建立检测效率较高的椭圆肤色模型进行肤色检测,并在检测出的肤色区域上采用分裂式K均值聚类(FKM)进行二次的肤色判决,进一步准确检测出肤色区域。实验表明,所提出的检测算法能准确高效地检测出肤色区域,具有较高地准确率和较强的鲁棒性。