二流量试井工艺及资料解释分析方法

描述了二流量试井工艺的实现，从常规分析和双对数曲线拟合两上方面，给出了二流量试井的资料解释分析方法，分析认为二流量试井同样可以计算出正常关井测压力恢复（或压力降落）资料所解释的油藏及流体参数。这种试井方法不但可以减少因正常关井测压对产油量和注水量的影响，而且可以减缓因突然关、开井造成的套管变形或损坏。实践证明，该试井技术方法具有较好的经济效益和应用前景。     

Parallel associative combinator evaluation II

A new evaluation model for SK combinator expressions is presented and used as a basis for the design of a novel processor. The resulting machine architecture resembles a dataflow ring, but executions are constrained to be fully lazy. An automatic dynamic load sharing mechanism for a distributed multiprocessor architecture is suggested, and initial simulation results are presented.     

Signals,timers, and continuations for multithreaded user‐level protocols

Precise timing and asynchronous I/O are appealing features for many applications. Unix kernels provide such features on a per‐process basis, using signals to communicate asynchronous events to applications. Per‐process signals and timers are grossly inadequate for complex multithreaded applications that require per‐thread signals and timers that operate at finer granularity. To respond to this need, we present a scheme that integrates asynchronous (Unix) signals with user‐level threads, using the ARIADNE system as a platform. This is done with a view towards support for portable, multithreaded, and multiprotocol distributed applications, namely the CLAM (connectionless, lightweight, and multiway) communications library. In the same context, we propose the use of continuations as an efficient mechanism for reducing thread context‐switching and busy‐wait overheads in multithreaded protocols. Our proposal for integrating timers and signal‐handling mechanisms not only solves problems related to race conditions, but also offers an efficient and flexible interface for timing and signalling threads. Copyright © 2006 John Wiley & Sons, Ltd.     

Metaheuristic downhill simplex method in combinatorial optimization

The concept of combinatorial objects is formalized. It allows strict definition of a combinatorial optimization problem (COP). An efficient metaheuristic method to solve COPs (H-method) is considered. It includes stochastic local search algorithms as a built-in procedure. A parallel implementation of the H-method is set forth and analyzed. The results from a numerical experiment and solution of some well-known COPs on personal computers and on the SKIT cluster supercomputer are presented. The study was supported by INTAS (Project 06-1000017-8909). __________ Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 70–79, November–December 2007.     

甲壳素纤维/毛/绒双层织物的设计

通过分析甲壳素纤维各项性能,将其引入山羊绒产品中,对双层织物的设计进行探讨,并经过纺纱和织物试制,提出了设计与生产中应注意的问题,开发出了具有永久抗菌性的表层为羊绒、里层为甲壳素与改性羊毛混纺的系列产品.     

双抽机组工况图的画法分析

双抽机组热-电负荷关系非常复杂，运行人员难于分配。介绍一种较精确的工况图画法，可以为电厂运行人员提供可靠的基础。     

A stability classification method and its application to pipelined solution of linear recurrences

A new method of classification for numerical stability of parallel algorithms is proposed based on the theoretical foundation of forward error analysis. It partitions the algorithms according to their asymptotic stability—a measure introduced to relate the limiting behavior of the stability to the size of the problem. Using this method, the stability aspect of the pipelined solution technique for first-order and second-order linear recurrences—the core of a tridiagonal linear equation solver—is studied. In particular, it shows that the pipelined solution method of the first-order linear recurrences has the same degree of stability as the commonly used sequential evaluation algorithms. The stability problems of sequential and pipelined solution methods of the second-order linear recurrences are also studied.     

双相位共轭镜的工作条件参数分析

本文讨论了纯扩散机制的光折变晶体用作单作用区的双相位共轭镜（ＤＰＣＭ）时的阈值耦合强度和允许的输入光强比范围，并与双作用区的情况进行比较后，给出了在输入光强比远离１的条件下，双相位共轭镜的正常工作的条件参数。     

Locality-preserving hash functions for general purpose parallel computation

Consider the problem of efficiently simulating the shared-memory parallel random access machine (PRAM) model on massively parallel architectures with physically distributed memory. To prevent network congestion and memory bank contention, it may be advantageous to hash the shared memory address space. The decision on whether or not to use hashing depends on (1) the communication latency in the network and (2) the locality of memory accesses in the algorithm.We relate this decision directly to algorithmic issues by studying the complexity of hashing in the Block PRAM model of Aggarwal, Chandra, and Snir, a shared-memory model of parallel computation which accounts for communication locality. For this model, we exhibit a universal family of hash functions having optimal locality. The complexity of applying these hash functions to the shared address space of the Block PRAM (i.e., by permuting data elements) is asymptotically equivalent to the complexity of performing a square matrix transpose, and this result is best possible for all pairwise independent universal hash families. These complexity bounds provide theoretical evidence that hashing and randomized routing need not destroy communication locality, addressing an open question of Valiant.This work was started when the author was a student at Oxford University, supported by a National Science Foundation Graduate Fellowship and a Rhodes Scholarship. Any opinions, findings, conclusions, or recommendations expressed in this publication are those of the author and do not necessarily reflect the views of the National Science Foundation or the Rhodes Trust.     

广义de Bruijn多计算机互连网络

（ｄ，ｍ）ｄｅ Ｂｒｕｉｊｎ多计算机系统互连网络限制网络的规模必须为ｄ＾ｍ。本文把（ｄ，ｍ）ｄｅ Ｂｒｕｉｊｎ网络推广到了任意顶点情形，提出了广义ｄｅ Ｂｒｕｉｊｎ网络，研究了广义ｄｅ Ｂｒｕｉｊｎ网络的自路由性质，设计了路由算法，研究了广义ｄｅ Ｂｒｕｉｊｎ网络顶点度的性质和容错特性。