K-230B镗床万向护板的设计

介绍了大型机床地坑移动盖板的一般设计思想,根据机床原有功能和结构特点,设计兼顾防尘防屑和美观大方两大特点的活动盖板,为同类设计提供一些参考。     

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.     

考虑塑性铰外移的钢框架梁柱连接设计

介绍美国联邦突发事件管理局 (FEMA)对 1 994年北岭地震中焊接钢框架节点破坏原因的正式解释 ,说明塑性铰外移的必要性。此外 ,还介绍了塑性铰外移的两种基本形式以及狗骨式 (RBS)连接的有关设计规定和适用条件 ,其设计方法可供我国工程设计人员参考。     

D.yn11配电变压器过电流保护的特点

分析D．yn11配电变压器低压倒发生不同类型故障时，流过高压侧各相电流的大小及相位，从而比较保护用电流互感器在不同接线方式时过电流保护的灵敏度及可靠性；并提出过电流保护应注意的问题。     

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.     

A simplified cascade current‐source inverter interconnected to a single‐phase three‐wire distribution system and its application to electric energy storage systems with batteries

A novel current source inverter system interconnected to the single‐phase grid is proposed. It has the same construction as the conventional three‐phase current source inverter that is interconnected to the single‐phase three‐wire distribution system. Though the proposed circuit has no output transformer, it can be equivalently performed as the single‐phase double cascade inverter by diverting the pole transformer in the utility system. By controlling the appropriate scheme, the output currents can be obtained as the five‐level waveforms and their distortions can be decreased sufficiently. It is applied to the interactive electric energy storage system with batteries and the basic discharging characteristics are discussed experimentally. © 2004 Wiley Periodicals, Inc. Electr Eng Jpn, 150(2): 50–61, 2005; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/eej.10380     

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多计算机互连网络

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