Spectral multidomain approximation of elliptic problems with mixed conditions on the interfaces

The multidomain technique for elliptic problems, that allows the fulfillment of the interface conditions by means of a suitable combination of the continuity of the solution and of its normal derivative, is considered. Some choices of this combination are investigated and, in particular, a choice that allows the solution of the multidomain problem through two solutions for each subproblem, is proposed. The scheme has been discretized with a collocation method and some numerical tests are reported. Moreover the method is compared with the more classical Dirichlet/Neumann one as well as with the capacitance matrix method.This research has been supported by a grant from M.P.I. (40%).     

Compile-time copy elimination

Single-assignment and functional languages have value semantics that do not permit side-effects. This lack of side-effects makes automatic detection of parallelism and optimization for data locality in programs much easier. However, the same property poses a challenge in implementing these languages efficiently. This paper describes an optimizing compiler system that solves the key problem of aggregate copy elimination. The methods developed rely exclusively on compile-time algorithms, including interprocedural analysis, that are applied to an intermediate data flow representation. By dividing the problem into update-in-place and build-in-place analysis, a small set of relatively simple techniques—edge substitution, graph pattern matching, substructure sharing and substructure targeting—was found to be very powerful. If combined properly and implemented carefully, the algorithms eliminate unnecessary copy operations to a very high degree. No run-time overhead is imposed on the compiled programs.     

混凝土受拉断裂的破坏机理

本文从试验现象出发,建立了以数理统计为基础的混凝土受拉全过程曲线方程。研究表明,混凝土受拉应力应变全曲线是混凝土试件内部的粘结界面与水泥胶合物在外拉力作用下逐步断裂造成的。文章所建立的方法不仅可以解释许多试验现象,模拟混凝土受拉全曲线,而且还可以得出试验中难以测出的结果。     

发动机扭矩与转速关系经验公式试验研究

在对发动机外特性曲线扭矩与转速实验数据分析的基础上，对原有的经验公式进行了分析、改进，提出了新的经验公式．由这一经验公式所计算的数值，在最大扭矩与最大功率点之间，可与实验数据拟合得很好．与原经验曲线相比，新经验曲线与实验曲线的离差可下降50％以上．     

用红外热象技术研究有凸台热源倾斜板的散热

本文介绍红外热象技术在工程热物理研究中某些应用的探索。作为实例，通过热象技术，实验研究了具有水平凸台离散热源的倾斜板的散热，在研究它的自然对流换热部份结合利用激光全息干涉技术。此间着重于分析倾斜角对散热的影响。     

用高程与河道断面特性平均积分曲线图解河道水面线

从恒定、渐变流河段能量方程式中推导出以高程与河道断面特性平均积分曲线图解河道水面线的方法,并通过某河段水面线计算实例说明了此方法的计算图解步骤。对于同一河道,由于高程与河道断面特性平均积分曲线不变。故曲线可重复利用。因此,对进行多种设计标准的水面线计算可很方便地直接从曲线图上得出水面线结果。     

On the stability preserving property of the double bilinear transformation on a class of 2-D transfer functions

This paper addresses the BIBO (bounded-input bounded-output) stability of a class of discrete 2-D quarter-plane filters in the presence of nonessential singularities of the second kind (NSSK's) on the unit bidisk. Conditions under which the double bilinear transformation (DBT) preserves stability are derived. The results presented here also extend the class of systems whose stability can be predicted. Use of the inverse DBT to produce a continuous equivalent of the discrete 2-D transfer function allows easy application of a continuous-domain equivalent of a criterion developed by Dautov. The necessary and sufficient condition for stability derived in this work provides a simple check for the class of systems under consideration. From this class of systems, it is also possible to construct stable pairs of mutually inverse transfer functions.     

热敏绘图仪驱动模块及曲线输出通用算法

热敏绘图仪驱动模块由状态诊断、表头输出、曲线输出三部分组成。曲线输出的核心是曲线输出通用算法,它分三步进行:超界判断,填充字节和线型处理。该算法能完成对离散值的曲线处理、线型变换和超界处理。它不仅适用于热敏绘图仪的曲线记录,也适用于曲线的屏幕显示。     

Rectilinear steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors

We study the application of the geographic nearest neighbor approach to two problems. The first problem is the construction of an approximately minimum length rectilinear Steiner tree for a set ofn points in the plane. For this problem, we introduce a variation of a subgraph of sizeO(n) used by YaO [31] for constructing minimum spanning trees. Using this subgraph, we improve the running times of the heuristics discussed by Bern [6] fromO(n ² log n) toO(n log² n). The second problem is the construction of a rectilinear minimum spanning tree for a set ofn noncrossing line segments in the plane. We present an optimalO(n logn) algorithm for this problem. The rectilinear minimum spanning tree for a set of points can thus be computed optimally without using the Voronoi diagram. This algorithm can also be extended to obtain a rectilinear minimum spanning tree for a set of nonintersecting simple polygons.The results in this paper are a part of Y. C. Yee's Ph.D. thesis done at SUNY at Albany. He was supported in part by NSF Grants IRI-8703430 and CCR-8805782. S. S. Ravi was supported in part by NSF Grants DCI-86-03318 and CCR-89-05296.     

非串行生产线的建模,分析及设计

本文利用等效工作站理论和工件流平衡原理，推导出非串行离散事件生产线可以等价于串联系统，并归结为装配和拆卸两条定理，解决了系统的建模、分析与设计问题。