基于提升算法的二维DWT高效VLSI实现结构

以CDF9/7小波为例构造了一种二维DWT变换的高效VLSI结构。采用改进的提升算法,减少了关键路径上的延时。把乘法器系数表示为CSD形式,将乘法优化为最少的移位加操作。提出了一种行变换和列变换同时进行的方法和实现结构,并且整个结构采用流水线处理。通过VHDL的行为级仿真,得到的数据和软件仿真的结果相同,证明了该结构的正确性。和其它结构相比,该结构处理速度更快,并且硬件利用率可达100%。     

Evaluating methods for the reliability of a large 2‐dimensional rectangular k‐within‐consecutive‐(r,s)‐out‐of‐(m,n):F system

A 2‐dimensional rectangular k‐within‐consecutive‐(r, s)‐out‐of‐(m, n):F system consists of m × n components, and fails if and only if k or more components fail in an r × s submatrix. This system can be treated as a reliability model for TFT liquid crystal displays, wireless communication networks, etc. Although an effective method has been developed for evaluating the exact system reliability of small or medium‐sized systems, that method needs extremely high computing time and memory capacity when applied to larger systems. Therefore, developing upper and lower bounds and accurate approximations for system reliability is useful for large systems. In this paper, first, we propose new upper and lower bounds for the reliability of a 2‐dimensional rectangular k‐within‐consecutive‐(r, s)‐out‐of‐(m, n):F system. Secondly, we propose two limit theorems for that system. With these theorems we can obtain accurate approximations for system reliabilities when the system is large and component reliabilities are close to one. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Multiple subset sum with inclusive assignment set restrictions

In a traditional multiple subset sum problem (MSSP), there is a given set of items and a given set of bins (or knapsacks) with identical capacities. The objective is to select a subset of the items and pack them into the bins such that the total weight of the selected items is maximized. However, in many applications of the MSSP, the bins have assignment restrictions. In this article, we study the subset sum problem with inclusive assignment set restrictions, in which the assignment set of one item (i.e., the set of bins that the item may be assigned to) must be either a subset or a superset of the assignment set of another item. We develop an efficient 0.6492‐approximation algorithm and test its effectiveness via computational experiments. We also develop a polynomial time approximation scheme for this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

基于DoDAF的反导指控系统体系结构模型研究

首先简要介绍了美军反导指控系统和国防部体系结构框架(department of defense archi-tecture framework,DoDAF)的基本情况,确定了体系结构模型开发方法和步骤,然后利用Telelogic公司的system architect软件完成了作战视图、系统视图的分析与设计,为理解指控系统内在规律、开展指控系统顶层设计研究提供理论支持。     

一种改进Van Leer格式的构造与分析

基于传统的Van Leer格式提出了一种改进的Van Leer(NVL)格式,解决了Van Leer格式在低马赫数下数值耗散过大,不能求解有粘流场等问题,同时保持Van Leer格式的计算效率.通过二维平板流动算例比较了NVL格式与传统Van Leer格式的数值耗散程度,并以NACA0012翼型的亚声速和跨声速流场以及M6机翼的跨声速流场求解为算例,与Roe格式和传统Van Leer格式进行比较,进一步验证了NVL格式的低耗散性和高效性.     

两种改进Lagrange插值格式的对比分析

本文基于Lagrange插值多项式,给出了两种改进的Lagrange插值格式：Aitken插值和重心Lagrange插值。从算法的复杂性及数值稳定性两个方面进行了比较分析,结果表明重心形式的Lagrange插值是最优的。文末给出数值试验表明算法的有效性。     

灭火救援演习方案评估问题研究

灭火救援演习是最贴近实战的训练方式,对消防部队的基础和技能训练具有较强的指导与检验作用。就演习方案及灭火救援演习评估中存在的问题进行研究,将对日后演习成功起到一定的积极影响。     

防毒面具滤毒罐吸附剂的发展与展望

现有防毒面具滤毒罐主要使用活性炭或浸渍炭作为吸附剂,存在如存储周期和有效使用时间均较短的缺陷。在回顾防毒面具及其滤毒罐吸附剂的基础上,对防毒面具滤毒罐吸附剂的发展进行了展望。     

2-一致光滑Banach空间中k-严格伪压缩半群公共不动点的隐格式迭代算法

对于Banach空间中女一严格伪压缩半群的公共不动点给出了隐格式迭代算法,证明了一个强收敛定理,推广并扩展了相关结论。     

超临界二氧化碳流体中L-丙交酯开环聚合物的合成及表征

在超临界二氧化碳流体中用辛酸亚锡作催化剂,用左旋丙交酯开环聚合成功地合成了相对分子质量大于80 000,分散指数为2.5的聚左旋乳酸.深入研究了聚合温度、时间、压力、单体浓度、催化剂用量及超临界二氧化碳纯度等各种因素对聚左旋乳酸相对分子质量及其分布的影响,对聚合物的相对分子质量和分布采用凝胶渗析色谱、1HNMR谱、13...