Multiple Scan Chain Design for Two-Pattern Testing

Non-standard fault models often require the application of two-pattern testing. A fully-automated approach for generating a multiple scan chain-based architecture is presented so that two-pattern test sets generated for the combinational core can be applied to the sequential circuit. Test time and area overhead constraints are considered.     

针对不同地质目标的叠前时间偏移成像解释评价

随着计算机硬件和地震勘探成像技术的发展，叠前时间偏移正逐步替代常规的NMO加DMO加叠后时间偏移成为地震数据成像处理方法的主流。但对于不同的地质目标，叠前时间偏移的成像效果是否优于常规NMO加DMO加叠后时间偏移的成像效果呢？为此，从地震数据成像处理方法、处理流程和处理参数等方面进行了讨论，并基于某地区三维数据常规处理结果和叠前时间偏移处理结果，针对不同地质目标进行了剖析与评价。认为：叠前时间偏移成像的垂向分辨率较常规处理明显降低，但对于空间波阻抗变化明显的河流和断层，叠前时间偏移成像的空间分辨率要高于常规处理；对于小于1／4波长的叠置薄储层，叠前时间偏移成像的垂向和空间分辨率低于常规处理结果。     

基于对比折射法的三维静校正技术及其应用

在地形起伏剧烈、速度和厚度横向变化大的地区，折射静校正技术的应用受到诸多限制，主要表现在不能准确地识别和拾取来自于地下连续地质界面的折射波，使得精确求取的长波长静校正量困难。为此，提出了一种基于对比折射法的三维静校正技术。介绍了这种静校正技术的方法原理和特点，基于对比折射法的折射波至拾取实质上是一个折射层的对比分析解释过程，因此能准确地拾取折射波至，精确地求解低速带的绝对延迟时；然后利用延迟时和近地表速度模型（等效，时深，空变）反演表层模型，最终一次性完成基准面静校正（包含低速带校正和高程校正）。在黄土塬、沙漠以及沙漠和山地的接合部等地区，利用基于对比折射法的三维静校正技术进行静校正处理，使资料的品质得到了明显改善，反射同相轴连续性好，信噪比和分辨率高，构造形态清晰可靠，提高了勘探精度。     

Adsp-21060的主机接口在实时图像处理中的应用

简要介绍了数字信号处理器Adsp 2 10 6 0和大规模可编程逻辑器件EP1K5 0。详细讨论了Adsp 2 10 6 0的主机接口工作模式以及一个实时图像跟踪处理器的硬件组成原理 ,在这个系统中EP1K5 0充当了主机。调试结果表明 ,所提出的硬件结构设计思想工作效率高 ,完全能够胜任实时图像处理的实际需要。     

东营凹陷王庄-宁海地区流体包裹体分析与流体充注研究

利用流体包裹体分析技术，系统地分析了东营凹陷王庄-宁海地区覆盖所有含油层位的流体包裹体样品。包裹体荧光观察和均一温度特征分析揭示了包裹体发育期次为5期，说明该区油藏存在5次流体充注过程；据此确定了备期烃类的成藏期次。东营组沉积时期和明化镇组沉积末期的油气运聚均在成藏后遭受大气淡水淋滤和降解作用。沙三段原油可能经历至少2期稠油化作用。荧光观察进一步证实该区主要发生2期充注、2期成藏。     

涡轮搅拌桨反应器混合过程的数值计算

利用CFD方法计算单层涡轮反应器搅拌槽内流体混合过程的速度场和浓度场,研究物料在搅拌槽内的混合过程,以及不同监测点对混合时间的影响。结果表明,搅拌槽内物料的混合主要受槽内流体的流动形式所影响;混合时间的长短与监测点位置有关;在搅拌桨的桨叶附近进行监测所得到的混合时间较短,在液面附近进行监测所得的混合时间较长。在实际生产和试验中,应注意对监测点位置的选取。     

石化企业实时数据管理引擎设计与实现

实时数据管理系统是流程企业控制信息网络与管理信息网络平滑集成的基础，为两者的数据通讯提供桥梁。介绍了笔者在炼油化工C企业IMS建设中的实时数据管理引擎设计与开发，具有其先进性与实用性。     

一种高精度的非平稳随机信号实时建模算法研究

针对传统的非平稳随机信号时变参数筹分模型算法的不足,论文把非平稳随机信号时变参数差分模型与一种带自适应遗忘因子的RLS算法结合起来,形成一种有效的非平稳随机信号实时建模算法,仿真分析表明该算法不仅能获得快的收敛速度而且能获得高的建模精度。     

Analysis of Distributed DDQ for QoS Router

In a packet switching network, congestion is unavoidable and affects the quality of real‐time traffic with such problems as delay and packet loss. Packet fair queuing (PFQ) algorithms are well‐known solutions for quality‐of‐service (QoS) guarantee by packet scheduling. Our approach is different from previous algorithms in that it uses hardware time achieved by sampling a counter triggered by a periodic clock signal. This clock signal can be provided to all the modules of a routing system to get synchronization. In this architecture, a variant of the PFQ algorithm, called digitized delay queuing (DDQ), can be distributed on many line interface modules. We derive the delay bounds in a single processor system and in a distributed architecture. The definition of traffic contribution improves the simplicity of the mathematical models. The effect of different time between modules in a distributed architecture is the key idea for understanding the delay behavior of a routing system. The number of bins required for the DDQ algorithm is also derived to make the system configuration clear. The analytical models developed in this paper form the basis of improvement and application to a combined input and output queuing (CIOQ) router architecture for a higher speed QoS network.     

Modeling and analysis of hierarchical cellular networks with bidirectional overflow and take-back strategies under generally distributed cell residence times

The rapid growth of wireless services and mobile users drives a great interest in cellular networks with a hierarchical structure. Hierarchical cellular networks (HCNs) can provide high system capacity, efficient channel utilization and inherent load-balancing capability. In this paper, we develop an analytical model and a performance analysis method for a two-layer HCN with bidirectional overflow and take-back strategies. Mobile users are divided into two classes. The call requests (including new and handoff calls) of fast and slow users are preferably assigned to the macrolayer and microlayer, respectively. A call from a fast user or slow user can overflow to its non-preferable layer if there is no channel available. The successful overflow call can be taken back to its preferable layer if a channel becomes available. Since the commonly used exponentially distributed assumption for cell residence time and then the channel occupancy time does not hold for emerging mobile networks, we model various cell residence times by general distributions to adapt to more flexible mobility environments. The channel occupancy times are derived in terms of the Laplace transforms of various cell residence times. The handoff rates, overflow rates and take-back rates of each layer are also derived in terms of the new call arrival rates and related probabilities. The stationary probabilities (and then the performance measures) are determined on the basis of the theory of multi-dimensional loss systems.