横流均匀环境中三维线源型正负浮力射流特性研究

本文利用混合有限分析法及交错网格。对横流均匀环境中三维线源型正负浮力射流及负浮力射流的特性进行研究，分析了不同工况下流速，温度和湍动能在断面上的分布及影响射流轨迹线的因素，讨论了轨迹线上温度的变化及浮力射流的贴壁现象。对三维长线源型负浮力射流，分析了流速比，喷口弗汝德数对负浮力射流的影响。     

Asymptotic stress intensity factor density profiles for smeared-tip method for cohesive fracture

The paper presents a computational approach and numerical data which facilitate the use of the smeared-tip method for cohesive fracture in large enough structures. In the recently developed K-version of the smeared tip method, the large-size asymptotic profile of the stress intensity factor density along a cohesive crack is considered as a material characteristic, which is uniquely related to the softening stress-displacement law of the cohesive crack. After reviewing the K-version, an accurate and efficient numerical algorithm for the computation of this asymptotic profile is presented. The algorithm is based on solving a singular Abel's integral equation. The profiles corresponding to various typical softening stress-displacement laws of the cohesive crack model are computed, tabulated and plotted. The profiles for a certain range of other typical softening laws can be approximately obtained by interpolation from the tables. Knowing the profile, one can obtain with the smeared-tip method an analytical expression for the large-size solution to fracture problems, including the first two asymptotic terms of the size effect law. Consequently, numerical solutions of the integral equations of the cohesive crack model as well as finite element simulations of the cohesive crack are made superfluous. However, when the fracture process zone is attached to a notch or to the body surface and the cohesive zone ends with a stress jump, the solution is expected to be accurate only for large-enough structures.     

Converting interpreters into compilers

There is an effective and quite general method of manually deriving compilers from programming-language interpreters without dealing directly with machine language. The method is an implementation of the largely theoretical and under-appreciated concept of partial computation, but can be understood on its own terms. It involves the translation of a source program's intermediate form into the interpreter's implementation language. This paper shows how the method can be used to transform both a sample iterative interpreter and a sample recursive interpreter into compilers. The result can be a large gain in program execution speed. Other advantages of the method, including the ease and practicality of applying it, are discussed.     

Tradeoffs in granularity and parallelization for a Monte Carlo shower simulation code

The EGS4 code, developed at Stanford Linear Accelerator Center, simulates electron-photon cascading phenomena. The original code is inherently sequential: processing one particle at a time. This paper reports on a series of experiments in parallelizing different versions of EGS4. Our parallel experiments were run on a 30-processor Sequent Balance B21 and a 6-processor Symmetry S27. We have considered the following approaches for parallel execution of this application code:

1. (1) Original sequential version modified for parallel processing: 1 processor;

2. (2) Version 1 run multiprocessed: 1 to 29 processors;

3. (3) Sequential version modified for large-grain parallel processing: 1 procssor;

4. (4) Version 3 run using the Sequent Microtasking Library: 1 to 29 processors.

For each approach, we discuss the relative advantages and disadvantages in the areas of coding effort, understandability and portability, as well as performance, and outline a new parallelization approach we are currently pursuing based on Large-Grain Data Flow techniques.     

铁电存储器FM3808在TMS320VC5402系统中的应用

FM3808是Ramtron公司生产的新型超低功耗非易失铁电存储器，该器件可支持对存储区的高速读写，并可进行近乎无限次的写入。FM3808内部除具有256kB的存储阵列外还集成了实时时钟和系统监控模块，因而功能十分强大。文中介绍了FM3808的性能特点、内部结构和工作原理，分析了TMS320VC5402 DSP的并行引导装载模式。给出了DSP与FM3808组成的并行引导接口方案。     

一种高并行度的H.264帧内预测器的VLSI设计

分析了帧内预测的17种模式,对于每个4×4大小块的16个像素点的不同模式的预测公式之间的相同运算,采用数字强度缩减的方法去除计算的冗余,提出了一种高并行度的帧内预测器,可以每个时钟周期处理16个像素点的预测值。基于SMIC0.18μm工艺,用verilog对该设计进行了VLSI实现,综合后的电路的关键路径最大时延为10ns,电路规模不超过1.4万门,数据吞吐率可以达到1600Msamples/s。从实现结果来看,与采用可重构方法的设计相比,该设计在相同的并行度下减小了电路面积,简化了控制逻辑。     

Delay-insensitive codes — an overview

The problem of delay-insensitive data communication is described. The notion of delay-insensitive code is defined, giving precise conditions under which delay-insensitive data communication is feasible. Examples of these codes are presented and analyzed. It appears that delay-insensitive codes are equivalent with antichains in partially ordered sets and with all unidirectional error-detecting codes. Tom Verhoeff received the B.S. and M.S. degrees in mathematics from Eindhoven University of Technology, The Netherlands, in 1985. He is currently an Assistant Professor at the Department of Mathematics and Computing Science of the same university. His main research interests are parallel computations, especially formalisms for their specification and design, and their implementation as delay-insensitive VLSI circuits.     

Secure Multi-Party Computation without Agreement

It has recently been shown that authenticated Byzantine agreement, in which more than a third of the parties are corrupted, cannot be securely realized under concurrent or parallel (stateless) composition. This result puts into question any usage of authenticated Byzantine agreement in a setting where many executions take place. In particular, this is true for the whole body of work of secure multi-party protocols in the case that a third or more of the parties are corrupted. This is because these protocols strongly rely on the extensive use of a broadcast channel, which is in turn realized using authenticated Byzantine agreement. We remark that it was accepted folklore that the use of a broadcast channel (or authenticated Byzantine agreement) is actually essential for achieving meaningful secure multi-party computation whenever a third or more of the parties are corrupted. In this paper we show that this folklore is false. We present a mild relaxation of the definition of secure computation allowing abort. Our new definition captures all the central security issues of secure computation, including privacy, correctness and independence of inputs. However, the novelty of the definition is in decoupling the issue of agreement from these issues. We then show that this relaxation suffices for achieving secure computation in a point-to-point network. That is, we show that secure multi-party computation for this definition can be achieved for any number of corrupted parties and without a broadcast channel (or trusted pre-processing phase as required for running authenticated Byzantine agreement). Furthermore, this is achieved by just replacing the broadcast channel in known protocols with a very simple and efficient echo-broadcast protocol. An important corollary of our result is the ability to obtain multi-party protocols that remain secure under composition, without assuming a broadcast channel.     

BKX-Ⅰ型并联机床的谐响应分析

应用有限元分析软件(ANSYS),对BKXⅠ型并联机床进行谐响应分析,分别得到了机床各节点沿机床的虚拟轴X、Y和Z向的位移谐响应曲线。在此基础上,还分析了该机床的谐响应规律,并明确了谐响应的特点,为改善此类机床的动态特性提供了一定的参考依据。     

Almost k-wise independence versus k-wise independence

We say that a distribution over {0,1}ⁿ is (ε,k)-wise independent if its restriction to every k coordinates results in a distribution that is ε-close to the uniform distribution. A natural question regarding (ε,k)-wise independent distributions is how close they are to some k-wise independent distribution. We show that there exist (ε,k)-wise independent distributions whose statistical distance is at least n^O(k)·ε from any k-wise independent distribution. In addition, we show that for any (ε,k)-wise independent distribution there exists some k-wise independent distribution, whose statistical distance is n^O(k)·ε.