微分代数方程的一类并行算法

本文提出求解微分代数方程的一类并行算法,进行误差估计。对于一个模型问题进行稳定性分析,画出稳定区域。计算实例表明算法是有效的。     

Variability in stepping direction explains the veering behavior of blind walkers.

Walking without vision results in veering, an inability to maintain a straight path that has important consequences for blind pedestrians. In this study, the authors addressed whether the source of veering in the absence of visual and auditory feedback is better attributed to errors in perceptual encoding or undetected motor error. Three experiments had the following results: No significant differences in the shapes of veering trajectories were found between blind and blindfolded participants; accuracy in detecting curved walking paths was not correlated with simple measures of veering behavior; and explicit perceptual cues to initial walking direction did not reduce veering. The authors present a model that accounts for the major characteristics of participants' veering behavior by postulating 3 independent sources of undetected motor error: initial orientation, consistent biases in step direction, and, most important, variable error in individual steps. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

饱和软土天然含水量估算指标及ω一e回归方程的建立

天然含水量ω是土的最基本物理量指标之一。采用数理统计方法，建立经验方程来修正土的天然含水量ω的测定值，使修正后的天然含水量数值与实际中的真值符合程度更为接近，效果甚好。     

Energy minimization and design for testability

The problem of fault detection in general combinational circuits is NP-complete. The only previous result on identifying easily testable circuits is due to Fujiwara who gave a polynomial time algorithm for detecting any single stuck fault inK-bounded circuits. Such circuits may only contain logic blocks with no more thanK input lines and the blocks are so connected that there is no reconvergent fanout among them. We introduce a new class of combinational circuits called the (k, K)-circuits and present a polynomial time algorithm to detect any single or multiple stuck fault in such circuits. We represent the circuit as an undirected graphG with a vertex for each gate and an edge between a pair of vertices whenever the corresponding gates have a connection. For a (k, K)-circuit,G is a subgraph of ak-tree, which, by definition, cannot have a clique of size greater thank+1. Basically, this is a restriction on gate interconnections rather than on the function of gates comprising the circuit. The (k, K)-circuits are a generalization of Fujiwara'sK-bounded circuits. Using the bidirectional neural network model of the circuit and the energy function minimization formulation of the fault detection problem, we present a test generation algorithm for single and multiple faults in (k, K)-circuits. This polynomial time aggorithm minimizes the energy function by recursively eliminating the variables.     

Zero aliasing ROM BIST

Signature analyzers are very efficient output response compactors for BIST design. The only limitation of signature analysis is the fault coverage reduction (aliasing) due to the information loss inherent to any data compaction. In this article, in order to increase the effectiveness of ROM BIST, we take advantage from the simplicity of the error patterns generated by ROMs and we show that aliasing free signature analysis can be achieved in ROM BIST.This work was performed when the author was on leave from Minsk Radio Engineering Institute, Computer Department, Belorus.     

线性联合检测算法在TD-SCDMA系统中的性能分析与比较

时分、同步码分多址（TD－SCDMA）系统是基于时分双工（TDD）的块传输系统，它使用了联合检测这项关键技术来抵抗符号间干扰（ISI）和多址干扰（MAI）。以上行链路为例，本文分析了三种线性联合检测算法－－匹配滤波块均衡器（MF－BLE）、迫零块均衡器（ZF－BLE）和最小均方误差块均衡器（MMSE－BLE）。从理论上，我们描述了这三种线性联合检测算法的基本原理，并对它们进行了比较（包括抗干扰性能和计算量）。随后，我们模拟了不同参数条件下（信道模型、码道数目、天线数目）这几种算法的性能，并与理论分析进行对照，得出一定结论。     

采用信息融合技术的IR／MMW复合导引头的目标跟踪

从误差测量环节入手，基于IR／MMW双模结构，采用信息融合处理技术提高其估计跟踪精度，最终达到降低制导误差，提高武器性能的目的，仿真结果验证了该方法的有效性。     

静电驱动悬臂梁数模转换器设计、分析与模拟

提出了一种新型的微电子机械数模转换器 (MEMDAC)———静电驱动悬臂梁数模转换器 .与传统的静电驱动悬臂梁执行器相比 ,新的结构能更精确地控制梁的挠度 .文中给出了此MEMDAC的设计、分析和模拟过程 .有限元(FEA)分析表明此MEMDAC的最大输出位移为 1 5 1μm ,分辨率为 0 1μm ,其最大非线性误差为 0 0 3μm .     

PLC陶瓷工业窑炉可靠性及自动巡检功能设计

介绍了由PLC组成的陶瓷刀具高温烧结窑的热工系统控制及自动故障巡检功能 ,讨论了系统设计中的主要环节及出现的问题     

An adaptive non‐conforming finite‐element method for Reissner–Mindlin plates

Adaptive algorithms are important tools for efficient finite‐element mesh design. In this paper, an error controlled adaptive mesh‐refining algorithm is proposed for a non‐conforming low‐order finite‐element method for the Reissner–Mindlin plate model. The algorithm is controlled by a reliable and efficient residual‐based a posteriori error estimate, which is robust with respect to the plate's thickness. Numerical evidence for this and the efficiency of the new algorithm is provided in the sense that non‐optimal convergence rates are optimally improved in our numerical experiments. Copyright © 2003 John Wiley & Sons, Ltd.