露天多段深孔微差爆破孔网参数优化设计

本文对露天多段深扎微差爆破孔网参数进行了优化，使每排炮扎成直线排列，两排之间成交替正三角形排列，优化设计后，爆破作用比较均匀，大块率下降了56％，同时，爆破根底产生的机会和程度也大大下降。     

Discrete Wavelet Transform: Architectures, Design and Performance Issues

Due to the demand for real time wavelet processors in applications such as video compression [1], Internet communications compression [2], object recognition [3], and numerical analysis, many architectures for the Discrete Wavelet Transform (DWT) systems have been proposed. This paper surveys the different approaches to designing DWT architectures. The types of architectures depend on whether the application is 1-D, 2-D, or 3-D, as well as the style of architecture: systolic, semi-systolic, folded, digit-serial, etc. This paper presents an overview and evaluation of the architectures based on the criteria of latency, control, area, memory, and number of multipliers and adders. This paper will give the reader an indication of the advantages and disadvantages of each design.     

Implementation of RNS-Based Distributed Arithmetic Discrete Wavelet Transform Architectures Using Field-Programmable Logic

Currently there are design barriers inhibiting the implementation of high-precision digital signal processing (DSP) objects with field programmable logic (FPL) devices. This paper explores overcoming these barriers by fusing together the popular distributed arithmetic (DA) method with the residue number system (RNS) for use in FPL-centric designs. The new design paradigm is studied in the context of a high-performance filter bank and a discrete wavelet transform (DWT). The proposed design paradigm is facilitated by a new RNS accumulator structure based on a carry save adder (CSA). The reported methodology also introduces a polyphase filter structure that results in a reduced look-up table (LUT) budget. The 2C-DA and RNS-DA are compared, in the context of a FPL implementation strategy, using a discrete wavelet transform (DWT) filter bank as a common design theme. The results show that the RNS-DA, compared to a traditional 2C-DA design, enjoys a performance advantage that increases with precision (wordlength).     

宝浪油田宝北区块低渗透油藏层系优化研究

针对宝浪油田宝北区块低孔低渗油藏地质特征以及油层层数多、分布井段长、部分零散层动用难度大等问题 ,研究了宝北区有效厚度、油层层数、单井产能及单井控制地质储量等层系划分与组合的技术经济界限 ,并在此基础上进行了宝北区层系划分与组合优化论证 ,最终优选出宝北区开发层系     

炼油厂成品油罐区调度优化问题研究

研究了以集合论为基础的调度优化模型。给出了该离散型优化问题的求解算法。根据优化结果，在G2实时智能平台上开发了包含监视子系统和调度子系统的调度支持系统。在中国石化股份有限公司长岭分公司的试用结果表明，该调度系统可以提高炼油厂的生产效率，从而提高炼油厂的经济效益。     

换热器设计中适宜流体用量的确定

利用换热器的操作线来分析讨论流体用量对传热过程的操作费用和设备费用的影响，找出了换热器设计和选型中适宜流体用量的优化确定方法，简便，快捷，具有一定的适用性。     

Preparation and properties of nano-sized SnO2 powder

1　INTRODUCTIONSnO2isoneofthemainmaterialsusedingassensor.Becauseofthehumidityandgassensingfunction,itattractsmoreandmoreattentions.Butthepresentproblemishowtoimprovethestabilityandsensibilityofgassensor.Researchershavetakenmanymeasurestoresolvethisproble…     

离子注入中污染的产生及防护

本文概述了离子注入过程中污染产生的原因和防止污染的措施，特别强调了对微粒污染和金属污染的防护以满足ＵＬＳＩ加工对离子注入的要求。     

A survey of parallel execution strategies for transitive closure and logic programs

An important feature of database technology of the nineties is the use of parallelism for speeding up the execution of complex queries. This technology is being tested in several experimental database architectures and a few commercial systems for conventional select-project-join queries. In particular, hash-based fragmentation is used to distribute data to disks under the control of different processors in order to perform selections and joins in parallel. With the development of new query languages, and in particular with the definition of transitive closure queries and of more general logic programming queries, the new dimension of recursion has been added to query processing. Recursive queries are complex; at the same time, their regular structure is particularly suited for parallel execution, and parallelism may give a high efficiency gain. We survey the approaches to parallel execution of recursive queries that have been presented in the recent literature. We observe that research on parallel execution of recursive queries is separated into two distinct subareas, one focused on the transitive closure of Relational Algebra expressions, the other one focused on optimization of more general Datalog queries. Though the subareas seem radically different because of the approach and formalism used, they have many common features. This is not surprising, because most typical Datalog queries can be solved by means of the transitive closure of simple algebraic expressions. We first analyze the relationship between the transitive closure of expressions in Relational Algebra and Datalog programs. We then review sequential methods for evaluating transitive closure, distinguishing iterative and direct methods. We address the parallelization of these methods, by discussing various forms of parallelization. Data fragmentation plays an important role in obtaining parallel execution; we describe hash-based and semantic fragmentation. Finally, we consider Datalog queries, and present general methods for parallel rule execution; we recognize the similarities between these methods and the methods reviewed previously, when the former are applied to linear Datalog queries. We also provide a quantitative analysis that shows the impact of the initial data distribution on the performance of methods. Recommended by: Patrick Valduriez