Escherichia coli prlC gene encodes a trypsin-like proteinase regulating the cell cycle

BACKGROUND AND PURPOSE: Mood disorders are common after stroke and may impede physical, functional, and cognitive recovery, making early identification and treatment of potential importance. We aimed to compare the accuracy of the General Health Questionnaire (GHQ-30) and the Hospital Anxiety and Depression (HAD) Scale in detecting psychiatric morbidity after stroke and to determine the most suitable cutoff points for different purposes. METHODS: One hundred five hospital-referred stroke patients completed both the GHQ-30 and HAD Scale 6 months after onset before a blinded psychiatric assessment in which the Schedule for Affective Disorders and Schizophrenia with some supplementary questions was used to determine a DSM-IV (Diagnostic and Statistical Manual of Mental Disorders, Fourth Edition) diagnosis. Measures were compared in terms of sensitivity, specificity, and receiver operating characteristic curves. RESULTS: No significant differences were found between the GHQ-30 and the HAD Scale in identifying those patients with any DSM-IV diagnosis (P=0.95), grouped depression (P=0.56), or anxiety (P=0.25) disorders. The previously recommended cutoff points for identifying "cases" for the GHQ (4/5) and for the HAD Scale (8/9 and 11/12) were found to be suboptimal in this population. CONCLUSIONS: The GHQ-30 and HAD scale exhibited similar levels of sensitivity and specificity. Data are presented, taking into account the "cost" of false-positives and negatives, to allow a choice of cutoff points suitable for differing situations.     

Mechanical behaviour of metal–matrix composite deposits

The electroplating technique is used for producing thin sheets of copper- or nickel-based composites containing different volume fractions of -alumina dispersions. The microhardness and tensile behaviour of such composites, in both the as-deposited and the annealed state, are characterized. The strengthening mechanism of electroplated composites is found to be a combination of Orowan-type strengthening and the Hall–Petch effect.     

基于多目视觉的变形钢板三维测量方法

提出了一种使用4个相机测量变形钢板三维形状的方法;在没有纹理的钢板上画一些点,使用4个相机同时拍摄钢板;利用边缘检测算法找出钢板的边缘,利用特征点提取算法提取出4个图像中钢板上的特征点,并找到4个图像上精确的特征点匹配关系,然后测量出这些特征点的三维点;最后,以这些三维点为种子点向外区域增长,从而得到钢板的三维形状;实验对变形钢板进行三维测量,得到了钢板的精确的三维形状,结果验证了该方法的有效性和可行性。     

Implementation and evaluation of parallel FFT on Engineering and Scientific Computation Accelerator (ESCA) architecture

The fast Fourier transform (FFT) is a fundamental kernel of many computation-intensive scientific applications.This paper deals with an implementation of the FFT on the accelerator system,a heterogeneous multi-core architecture to accelerate computation-intensive parallel computing in scientific and engineering applications.The Engineering and Scientific Computation Accelerator (ESCA) consists of a control unit and a single instruction multiple data (SIMD) processing element (PE) array,in which PEs communicate with each other via a hierarchical two-level network-on-chip (NoC) with high bandwidth and low latency.We exploit the architecture features of ESCA to implement a parallel FFT algorithm efficiently.Experimental results show that both the proposed parallel FFT algorithm and the ESCA architecture are scalable.The 16-bit fixed-point parallel FFT performance of ESCA is compared with a published work to prove the superiority of the mapping algorithm and the hardware architecture.The floating-point parallel FFT performances of ESCA are evaluated and compared with those of the IBM Cell processor and GPU to demonstrate the computing power of the ESCA system for high performance applications.     

Map‐aided localization in sparse global positioning system environments using vision and particle filtering

A map‐aided localization approach using vision, inertial sensors when available, and a particle filter is proposed and empirically evaluated. The approach, termed PosteriorPose, uses a Bayesian particle filter to augment global positioning system (GPS) and inertial navigation solutions with vision‐based measurements of nearby lanes and stop lines referenced against a known map of environmental features. These map‐relative measurements are shown to improve the quality of the navigation solution when GPS is available, and they are shown to keep the navigation solution converged in extended GPS blackouts. Measurements are incorporated with careful hypothesis testing and error modeling to account for non‐Gaussian and multimodal errors committed by GPS and vision‐based detection algorithms. Using a set of data collected with Cornell's autonomous car, including a measure of truth via a high‐precision differential corrections service, an experimental investigation of important design elements of the PosteriorPose estimator is conducted. The algorithm is shown to statistically outperform a tightly coupled GPS/inertial navigation solution both in full GPS coverage and in extended GPS blackouts. Statistical performance is also studied as a function of road type, filter likelihood models, bias models, and filter integrity tests. © 2011 Wiley Periodicals, Inc.     

基于SIMD结构的多标准LDPC译码器的VLSI实现

近年来,支持多标准的LDPC译码器已逐渐成为研究的热点.与传统译码器相比,所设计的LDPC译码器具有以下优点:1.实现了一个码率、码长可配置结构,进而可以支持多种标准;2.采用了一种改进型TPMP算法,使译码器的存储器容量大大减少,避免了因分块LDPC码的非规则性所造成的数据冲突问题;3.采用基于SIMD处理器的硬件结构,实现了硬件的高度规整性,易于芯片布局布线;4.设计了一个6级可配置流水线,可分时构造校验节点处理单元和变量节点处理单元,提高了硬件利用率和系统数据吞吐率.用这种架构实现了一个同时支持CMMB和DTMB两个标准的多标准LDPC译码器;芯片规模为75万门,时钟频率为220MHz,数据吞吐率为300Mbps.     

Matlab符号代数方程求解函数的改进及其应用

Matlab求解符号代数方程的函数solve可能产生方程解输出混乱的问题。采用字符串演算函数eval及动态结构数组加以改进,建立了求解符号代数方程的函数SolEqu。理论分析和算例表明,函数SolEqu不仅避免了直接使用solve可能导致的错误结果,而且调用更加方便,其使用范围也与函数solve完全相同,可广泛用于一般代数方程的求解。     

The establishment of edge-based loop algebra theory of kinematic chains and its applications

Based on the edge-based array representation of loops in the topological graphs of kinematic chains, this paper first proposes three arithmetic operations of loops. Then the concept of the independent loop set as well as its determination rules is introduced, and a new structure decomposition algorithm of kinematic chains is presented. Based on the algorithm, an automatic and efficient method for rigid sub-chain detection and driving pair selection of kinematic chains is proposed. Finally, an index is proposed to assess computation complexity of kinematic analysis with respect to different driving pair selections.