Fabrication of material-independent morphology gradients for high-throughput applications

Gradient surfaces allow rapid, high-throughput investigations and systematic studies in many disparate fields, including biology, tribology and adhesion. We describe a novel method for the fabrication of material-independent morphology gradients, involving a two-step process of particle erosion followed by a chemical polishing procedure that preferentially removes features with a small radius of curvature as a function of time. Gradients are fabricated on aluminium surfaces, but they may be readily transferred to other materials via a replication technique, which allows for the production of identical roughness gradient samples with any chosen surface chemistry. The gradients have been characterized by means of scanning electron microscopy and optical profilometry. Standard roughness parameters (Ra, Rq, Rz, Sm and Sk) were calculated from optical profilometry data. The roughness has also been assessed over different wavelength windows by means of a fast Fourier transformation approach.     

基于快速傅里叶变换和汉克耳变换的逆阿贝尔变换

激光等离子体实验中的轴对称的Ｘ光的体发射强度及光学全息干涉的测量,需要采用逆阿贝尔（Ａｂｅｌ）变换。用快速傅里叶变换（ＦＦＴ）和汉克耳（Ｈａｎｋｅｌ）变换的算法数值求解逆阿贝尔变换,具有精度高、可在频域内滤波的特点。     

时频分析在旋转机械状态监测及故障诊断中的应用

本文简要介绍了时频分析方法的发展及其在旋转机械状态监测、故障诊断领域中的应用。并以一个实际监测系统为例，对其检测信号应用时频分析的方法进行了数据处理，对用传统傅立叶变换处理的结果与采用时频分析方法处理的结果进行了对比分析．     

测量光纤外腔Fabry-Perot干涉仪的白光干涉术

提出了一种基于白光干涉术测量低锐度光纤外腔Fabry Perot干涉仪（EFPI）的方法用宽带光源注入F P腔,在接收端用一高锐度的可调谐光纤F P滤波器对EFPI的反射光谱进行扫描,获得了周期性变化的光谱输出为了测量出EFPI的腔长,对光谱信号进行傅里叶变换,得到光谱的周期,由此求出EFPI的绝对腔长证明了用低锐度EFPI的测量准确度由腔长决定F P腔越长,测量准确度越高在腔长分别是200 μm,400 μm和600 μm时,测量的腔长与实际腔长相同.     

高温拉曼光谱提高信噪比的途径分析

结合累积时间分辨和空间分辨建成了上海大学高温拉曼谱仪SU-HTRS(T/S).由于高温噪声的不可避免,采用了移动平均方法,傅里叶变换滤波和小波分析的方法对其进行了数据降噪处理.在不同噪声水平上分析了不同处理方式对谱峰中心位置、强度、面积的影响及处理后数据的光滑度的影响.三种方法比较起来,移动平均法快而简单,小波分析的去噪效果最好.     

Adaptation of a fast Fourier transform-based docking algorithm for protein design

Designing proteins with novel protein/protein binding properties can be achieved by combining the tools that have been developed independently for protein docking and protein design. We describe here the sequence-independent generation of protein dimer orientations by protein docking for use as scaffolds in protein sequence design algorithms. To dock monomers into sequence-independent dimer conformations, we use a reduced representation in which the side chains are approximated by spheres with atomic radii derived from known C2 symmetry-related homodimers. The interfaces of C2-related homodimers are usually more hydrophobic and protein core-like than the interfaces of heterodimers; we parameterize the radii for docking against this feature to capture and recreate the spatial characteristics of a hydrophobic interface. A fast Fourier transform-based geometric recognition algorithm is used for docking the reduced representation protein models. The resulting docking algorithm successfully predicted the wild-type homodimer orientations in 65 out of 121 dimer test cases. The success rate increases to approximately 70% for the subset of molecules with large surface area burial in the interface relative to their chain length. Forty-five of the predictions exhibited less than 1 A C(alpha) RMSD compared to the native X-ray structures. The reduced protein representation therefore appears to be a reasonable approximation and can be used to position protein backbones in plausible orientations for homodimer design.     

基于傅里叶变换的高精度条纹细分方法

针对传统傅里叶变换法在提取条纹图相位中存在的能量泄漏问题,提出了条纹图整周期裁剪的方法,可有效抑制能量泄漏对检相精度的影响,提高傅里叶变换法相位计算的精度。在此基础上,提出了一种基于傅里叶变换时移特性的叠栅条纹细分新方法。与传统傅里叶变换法相比,该方法求取相邻两帧条纹图间的相移,只需经过两次傅里叶变换,不需要截取条纹图的基频再逆变换回空域,因此计算量至少减少了一倍,计算速度大大提高。数值计算结果表明,对两束单色平面波形成的条纹,理想条件下细分精度高达10-12量级;对高斯包络调制的条纹,细分精度至少可达10-3量级。     

FFT-based algorithms for the string matching with mismatches problem

The string matching with mismatches problem requires finding the Hamming distance between a pattern P of length m and every length m substring of text T with length n. Fischer and Paterson's FFT-based algorithm solves the problem without error in O(σnlogm), where σ is the size of the alphabet Σ [SIAM–AMS Proc. 7 (1973) 113–125]. However, this in the worst case reduces to O(nmlogm). Atallah, Chyzak and Dumas used the idea of randomly mapping the letters of the alphabet to complex roots of unity to estimate the score vector in time O(nlogm) [Algorithmica 29 (2001) 468–486]. We show that the algorithm's score variance can be substantially lowered by using a bijective mapping, and specifically to zero in the case of binary and ternary alphabets. This result is extended via alphabet remappings to deterministically solve the string matching with mismatches problem with a constant factor of 2 improvement over Fischer–Paterson's method.     

求鳞状因子循环矩阵的逆阵及广义逆阵的快速付氏变换法

借助快速付立叶变换(FFT),本文给出一种求n阶鳞状因子循环矩阵的逆阵、自反g-逆、群逆、Moore-Penrose逆的快速算法,该算法的计算复杂性为O(nlog2n),最后给出的两个数值算例表明了该算法的有效性.