Feedback controlled periodic states for different kinds of photorefractive nonlinear response

We investigate analytically and numerically the influence of the type of the photorefractive nonlinear response on the periodic states (attractors) which occur during feedback controlled 2W-coupling and correspond to almost 100% diffraction efficiency of the dynamic index grating. In addition to the case of the local response typical, for example, for LiNbO₃ crystals we consider the cases of nonlocal (diffusive) response (BaTiO₃, SBN) and resonant response (DC-biased BSO, BTO, and BGO crystals). It is shown that the conditions for the transition to the periodic states and their apparent characteristics are strongly different for the two limiting cases above. Received 16 July 2002 / Received in final form 29 October 2002 Published online 4 March 2003     

Exact solutions and geometric phase factor of time-dependent three-generator quantum systems

There exist a number of typical and interesting systems and/or models, which possess three-generator Lie-algebraic structure, in atomic physics, quantum optics, nuclear physics and laser physics. The well-known fact that all simple 3-generator algebras are either isomorphic to the algebra sl (2, C) or to one of its real forms enables us to treat these time-dependent quantum systems in a unified way. By making use of both the Lewis-Riesenfeld invariant theory and the invariant-related unitary transformation formulation, the present paper obtains exact solutions of the time-dependent Schr?dinger equations governing various three-generator Lie-algebraic quantum systems. For some quantum systems whose time-dependent Hamiltonians have no quasialgebraic structures, it is shown that the exact solutions can also be obtained by working in a sub-Hilbert-space corresponding to a particular eigenvalue of the conserved generator (i.e., the time-independent invariant that commutes with the time-dependent Hamiltonian). The topological property of geometric phase factors and its adiabatic limit in time-dependent systems is briefly discussed. Received 6 July 2002 / Received in final form 21 October 2002 Published online 11 February 2003     

A physical organic mechanistic approach to understanding the complex reaction network of hemostasis (blood clotting)

This review focuses on how the mechanistic approach of physical organic chemistry can be used to elucidate the mechanisms behind complex biochemical networks. The dynamics of biochemical reaction networks is difficult to describe by considering their individual reactions, just as the dynamics of organic reactions is difficult to describe by considering individual electrons and atomic nuclei. Physical organic chemists have developed a useful set of tools to predict the outcome of organic reactions by separating the interacting molecules into modules (functional groups), and defining general rules for how these modules interact (mechanisms). This review shows how these tools of physical organic chemistry may be used to describe reaction networks. In addition, it describes the application of these tools to develop a mechanistic understanding of the dynamics of the complex network of hemostasis, which regulates blood clotting. Copyright © 2007 John Wiley & Sons, Ltd.     

Inferring topological features of proteins from amino acid residue networks

Topological properties of native folds are obtained from statistical analysis of 160 low homology proteins covering the four structural classes. This is done analyzing one, two and three-vertex joint distribution of quantities related to the corresponding network of amino acid residues. Emphasis on the amino acid residue hydrophobicity leads to the definition of their center of mass as vertices in this contact network model with interactions represented by edges. The network analysis helps us to interpret experimental results such as hydrophobic scales and fraction of buried accessible surface area in terms of the network connectivity. Moreover, those networks show assortative mixing by degree. To explore the vertex-type dependent correlations, we build a network of hydrophobic and polar vertices. This procedure presents the wiring diagram of the topological structure of globular proteins leading to the following attachment probabilities between hydrophobic–hydrophobic 0.424(5), hydrophobic-polar 0.419(2) and polar–polar 0.157(3) residues.     

基于代数迭代算法的燃烧火焰温度场和气体浓度场重建研究

基于TDLAS(tunable diode laser absorption spectroscopy)技术,以水汽作为目标气体,采用直接吸收的测量方式,探测了甲烷空气预混平焰炉燃烧区域水汽的吸收光谱信号,通过ART(algebraic reconstruction technique)代数迭代算法对燃烧场温度和水汽浓度分布进行了模拟重建和实验研究,模拟重建采取5×5共25个网格的正方形重建区域,假定25个网格的一个温度浓度二维分布,模拟28条激光束从不同的角度方位穿越重建区域,得到模拟射线下的投影值,经ART算法重建,结果显示温度场和水汽浓度场的重建偏差均在1%以内。实验采用分布反馈式激光器作为光源,选取H₂O的7 153.722,7 153.748和7 154.354 cm-1三条吸收线作为测温谱线,其中前两条线不区分作为一条吸收线来处理。使用平移台多方位平行扫描,共获取30路光谱吸收信号,经数据处理、算法重建和双线比值法测温原理得到了圆形平焰炉16个不同区域的温度浓度值,且炉面偏向中心区域温度浓度值较高,边缘较小,结果表明代数迭代算法能够很好地实现燃烧区域温度场和水汽浓度场的反演。     

相机位姿估计的加速正交迭代算法

面对需要实时计算的相机位姿估计问题,针对经典的广泛应用的正交迭代算法,提出了一种加速正交迭代算法。其关键思想是将每一次迭代过程规整化,从而提炼出每一次迭代的重复计算,若将此重复计算在迭代开始前提前计算,则可以大幅度的减少迭代过程中的计算量,使得每一次迭代的计算复杂度从O(n)降低为O(1)。因此,可以在更短的时间内迭代更多的次数,从而获得更高的精度。进行了对比实验,结果显示本加速算法计算精度更高,速度更快。并通过实验提出了选择稳健n点透视(RPn P)计算初值,再使用加速正交迭代算法进行迭代运算的方法,在控制点不多的情况下,是一种精度接近最大似然估计,计算速度最快的算法。     

Interpreting non-random signatures in biomedical signals with Lempel-Ziv complexity

Lempel-Ziv complexity (LZ) [J. Ziv, A. Lempel, On the complexity of finite sequences, IEEE Trans. Inform. Theory 22 (1976) 75-81] and its variants have been used widely to identify non-random patterns in biomedical signals obtained across distinct physiological states. Non-random signatures of the complexity measure can occur under nonlinear deterministic as well as non-deterministic settings. Surrogate data testing have also been encouraged in the past in conjunction with complexity estimates to make a finer distinction between various classes of processes. In this brief letter, we make two important observations (1) Non-Gaussian noise at the dynamical level can elude existing surrogate algorithms namely: Phase-randomized surrogates (FT) amplitude-adjusted Fourier transform (AAFT) and iterated amplitude-adjusted Fourier transform (IAAFT). Thus any inference nonlinear determinism as an explanation for the non-randomness is incomplete (2) Decrease in complexity can be observed even across two linear processes with identical auto-correlation functions. The results are illustrated with a second-order auto-regressive process with Gaussian and non-Gaussian innovations. AR(2) processes have been used widely to model several physiological phenomena, hence their choice. The results presented encourage cautious interpretation of non-random signatures in experimental signals using complexity measures.     

Detecting communities in clustered networks based on group action on set

In this paper, we propose a well targeted algorithm (GAS algorithm) for detecting communities in high clustered networks by presenting group action technology on community division. During the processing of this algorithm, the underlying community structure of a clustered network emerges simultaneously as the corresponding partition of orbits by the permutation groups acting on the node set are achieved. As the derivation of the orbit partition, an algebraic structure r-cycle can be considered as the origin of the community. To be a priori estimation for the community structure of the algorithm, the community separability is introduced to indicate whether a network has distinct community structure. By executing the algorithm on several typical networks and the LFR benchmark, it shows that this GAS algorithm can detect communities accurately and effectively in high clustered networks. Furthermore, we compare the GAS algorithm and the clique percolation algorithm on the LFR benchmark. It is shown that the GAS algorithm is more accurate at detecting non-overlapping communities in clustered networks. It is suggested that algebraic techniques can uncover fresh light on detecting communities in complex networks.     

基于背景最佳滤波尺度的红外图像复杂度评价准则

提出一种基于背景最佳滤波尺度的红外图像复杂度评价准则来解决传统方法评价背景效果较差的问题. 同时, 这种方法还可以为红外图像滤波提供最佳高通滤波尺度信息, 从而对红外图像进行性能最佳滤波. 首先, 生成高斯仿真目标并与红外图像进行融合, 获得包含仿真目标及真实红外背景的图像. 然后, 在不同高斯滤波尺度下对图像滤波, 并计算滤波后仿真目标的信噪比. 最后, 取滤波后目标信噪比最大时的滤波尺度作为背景最佳滤波尺度, 使用该尺度可评价红外图像的复杂度. 另外, 本文还使用数学模型推导了红外图像最佳滤波尺度, 得出最佳滤波尺度的数学表达式. 大量实验表明: 1) 本文推导的最佳滤波尺度数学表达式与实验曲线吻合. 2) 这种方法在评价红外图像复杂度方面比传统的基于信息熵的方法效果要好很多. 并且这种方法获取的红外背景复杂度为滤波最佳尺度, 可以直接利用这项指标对图像进行最佳滤波从而更好地检测弱小目标. 3) 仿真目标尺度越大, 最佳滤波尺度也会相应增大. 因此, 在评价图像复杂度时, 应使用相同尺度的仿真目标, 不同图像之间才具备可比性. 同时, 最佳滤波尺度与仿真目标的强度无关. 4) 本文算法使用的滤波器宜用高斯及Butterworth高通滤波器实现. 5) 本文提出的方法不仅可以有效分析红外视频的复杂度, 并且可以通过复杂度的变化分析图像内容的突变.