CAS-BUS: A Test Access Mechanism and a Toolbox Environment for Core-Based System Chip Testing

As System on a Chip (SoC) testing faces new challenges, some new test architectures must be developed. This paper describes a Test Access Mechanism (TAM) named CAS-BUS that solves some of the new problems the test industry has to deal with. This TAM is scalable, flexible and dynamically reconfigurable. The CAS-BUS architecture is compatible with the IEEE P1500 standard proposal in its current state of development, and is controlled by Boundary Scan features.This basic CAS-BUS architecture has been extended with two independent variants. The first extension has been designed in order to manage SoC made up with both wrapped cores and non wrapped cores with Boundray Scan features. The second deals with a test pin expansion method in order to solve the I/O bandwidth problem. The proposed solution is based on a new compression/decompression mechanism which provides significant results in case of non correlated test patterns processing. This solution avoids TAM performance degradation.These test architectures are based on the CAS-BUS TAM and allow trade-offs to optimize both test time and area overhead. A tool-box environment is provided, in order to automatically generate the needed component to build the chosen SoC test architecture.     

平行机半在线排序问题研究(Ⅰ)

对半在线平行机排序问题的研究进展作了详细综述和进一步探讨。文章给出半在线排序问题的背景、定义、分类和求解。介绍它们定义和在不同机器环境和目标函数下半在线排序问题分类，以及第一类半在线模型的近似算法的设计及其竞争比分析。     

微光像增强器图像传递信噪比的测试研究

图像传递信噪比是微光像增强器的重要特性参数．能够全面定量地表征像增强器在探测弱辐射图像时的综合性能，对于确定像增强器的图像探测灵敏闽具有重要意义。针对其测试原理．采用高灵敏度低噪声CCD器件作为像管输出图像的探测接收器．并引入数字图像处理技术。利用设计的测试系统实现了典型目标图像传递信噪比的自动测试．多次实验结果表明．陔测试系统具有测试过程自动快速及测试数据准确稳定的优点．相同测试条件下的不确定度优于±3%。     

Statistical Inference with Fractional Brownian Motion

We give a test between two complex hypothesis; namely we test whether a fractional Brownian motion (fBm) has a linear trend against a certain non-linear trend. We study some related questions, like goodness-of-fit test and volatility estimation in these models.     

基于双因子认证技术的网络身份识别

本文提出了一种基于动态双因子认证技术的网络身份识别方法,用户每次登录的口令是利用系统时间和用户ID通过MD5加密算法计算得到,其通过MD5加密后生成的登录口令是随机的,这将进一步提高开放网络环境下身份识别的可靠性和安全性。同时,本文还提出网络身份识别技术可以应用到各类网站的服务器上,用来完成对用户身份的识别,以提高网络系统的安全性。     

一个线性约束优化问题的广义梯度投影法

本文对线性约束优化问题提出了一个新的广义梯度投影法，该算法采用了非精确线性搜索，并在每次迭代运算中结合了广义投影矩阵和变尺度方法的思想确定其搜索方向．在通常的假设条件下，证明了该算法的整体收敛性和超线性收敛速度．     

Mathematical Modeling, Control, Computer Simulation and Laboratory Experiments of a Spatial Servopneumatic Parallel Robot

In this paper, the special construction of a parallel robot, called spatial servopneumatic multi-axis test facility, will be discussed. The investigations include the following aspects: (i) the laboratory set-up of the robot, (ii) various results obtained in laboratory experiments, taking into account quite different control algorithms and command-input signals, (iii) a comparison of the laboratory experiments with the computer simulations of Part I of this paper, and ({vi}) a quality check of the results compared with the cost of the different controller realizations. The results of both the computer simulations and the laboratory experiments show: (i) The dynamic behavior of the parallel structure can be tremendously improved by using sophisticated nonlinear control algorithms. (ii) This improvement has to be paid by a drastically increased amount of work for deriving the model equations and control algorithms, and by augmented hardware cost of the sensing elements and controller electronics. (iii) Carefully developed model equations and identified model parameters provide theoretical models of the complex parallel structure that are very close to reality. This enables the design engineer to systematically investigate constructive alternatives of the design parameters, sensor and actuator concepts, and control strategies of the MAP prior to their hardware realization.This work has been supported by the German Science Foundation (DFG) under Contract No. Ha 1666/6-3.     

ISLAND—Inverse Square Law Acceleration Measurement Using iNertial Drift

By using a novel free-flying, rotating, optical bench aboard the International Space Station (ISS) as the basis for a measurement of differential acceleration between two gravitating bodies, in principle the Newtonian inverse-square law and the constant of gravitation, G, can be determined at the parts in 10⁶ level.     

量子算法的NMR实现方法

量子计算机是一种以量子耦合方式进行信息处理的装置[1 ] 。原则上 ,它能利用量子相干干涉方法以比传统计算机更快的速度进行诸如大数的因式分解、未排序数据库中的数据搜索等工作[2 ] 。建造大型量子计算机的主要困难是噪音、去耦和制造工艺。一方面 ,虽然离子陷阱和光学腔实验方法大有希望 ,但这些方法都还没有成功实现过量子计算。另一方面 ,因为隔离于自然环境 ,核自旋可以成为很好的“量子比特” ,可能以非传统方式使用核磁共振 (NMR)技术实现量子计算。本文介绍一种用NMR方法实现量子计算的方法 ,该方法能够用比传统方法少的步骤解决一个纯数学问题。基于该方法的简单量子计算机使用比传统计算机使用更少的函数“调用”判断一未知函数的类别。     

A new distributed approximation algorithm for constructing minimum connected dominating set in wireless ad hoc networks

In recent years, constructing a virtual backbone by nodes in a connected dominating set (CDS) has been proposed to improve the performance of ad hoc wireless networks. In general, a dominating set satisfies that every vertex in the graph is either in the set or adjacent to a vertex in the set. A CDS is a dominating set that also induces a connected sub‐graph. However, finding the minimum connected dominating set (MCDS) is a well‐known NP‐hard problem in graph theory. Approximation algorithms for MCDS have been proposed in the literature. Most of these algorithms suffer from a poor approximation ratio, and from high time complexity and message complexity. In this paper, we present a new distributed approximation algorithm that constructs a MCDS for wireless ad hoc networks based on a maximal independent set (MIS). Our algorithm, which is fully localized, has a constant approximation ratio, and O(n) time and O(n) message complexity. In this algorithm, each node only requires the knowledge of its one‐hop neighbours and there is only one shortest path connecting two dominators that are at most three hops away. We not only give theoretical performance analysis for our algorithm, but also conduct extensive simulation to compare our algorithm with other algorithms in the literature. Simulation results and theoretical analysis show that our algorithm has better efficiency and performance than others. Copyright © 2005 John Wiley & Sons, Ltd.