The interprocedural analysis and automatic parallelization of Scheme programs

Lisp and its descendants are among the most important and widely used of programming languages. At the same time, parallelism in the architecture of computer systems is becoming commonplace. There is a pressing need to extend the technology of automatic parallelization that has become available to Fortran programmers of parallel machines, to the realm of Lisp programs and symbolic computing. In this paper we present a comprehensive approach to the compilation of Scheme programs for shared-memory multiprocessors. Our strategy has two principal components:interprocedural analysis andprogram restructuring. We introduceprocedure strings andstack configurations as a framework in which to reason about interprocedural side-effects and object lifetimes, and develop a system of interprocedural analysis, using abstract interpretation, that is used in the dependence analysis and memory management of Scheme programs. We introduce the transformations ofexit-loop translation andrecursion splitting to treat the control structures of iteration and recursion that arise commonly in Scheme programs. We propose an alternative representation for s-expressions that facilitates the parallel creation and access of lists. We have implemented these ideas in a parallelizing Scheme compiler and run-time system, and we complement the theory of our work with snapshots of programs during the restructuring process, and some preliminary performance results of the execution of object codes produced by the compiler.This work was supported in part by the National Science Foundation under Grant No. NSF MIP-8410110, the U.S. Department of Energy under Grant No. DE-FG02-85ER25001, the Office of Naval Research under Grant No. ONR N00014-88-K-0686, the U.S. Air Force Office of Scientific Research under Grant No. AFOSR-F49620-86-C-0136, and by a donation from the IBM Corportation.     

An efficient algorithm for maxdominance, with applications

Given a planar setS ofn points,maxdominance problems consist of computing, for everyp S, some function of the maxima of the subset ofS that is dominated byp. A number of geometric and graph-theoretic problems can be formulated as maxdominance problems, including the problem of computing a minimum independent dominating set in a permutation graph, the related problem of finding the shortest maximal increasing subsequence, the problem of enumerating restricted empty rectangles, and the related problem of computing the largest empty rectangle. We give an algorithm for optimally solving a class of maxdominance problems. A straightforward application of our algorithm yields improved time bounds for the above-mentioned problems. The techniques used in the algorithm are of independent interest, and include a linear-time tree computation that is likely to arise in other contexts.The research of this author was supported by the Office of Naval Research under Grants N00014-84-K-0502 and N00014-86-K-0689, and the National Science Foundation under Grant DCR-8451393, with matching funds from AT&T.This author's research was supported by the National Science Foundation under Grant DCR-8506361.     

基于复杂网络理论的高校内部理工医文合作研究分析

运用复杂网络理论的基本原理和有关方法,对理工医文等学科、专业之间的合作规律和人员合作方式进行探讨,以某高校2005-2010年医工合作情况作为实例展开研究,采用5年的合作数据作了计算分析,研究了高校内部理工医文开展学科交叉工作的特点及其运行情况、医工交叉合作中存在问题,客观分析其原因,提出了解决的办法,为今后开展高校系统的理工医文交叉合作,建设电子化交叉平台.     

A faster divide-and-conquer algorithm for constructing delaunay triangulations

An easily implemented modification to the divide-and-conquer algorithm for computing the Delaunay triangulation ofn sites in the plane is presented. The change reduces its (n logn) expected running time toO(n log logn) for a large class of distributions that includes the uniform distribution in the unit square. Experimental evidence presented demonstrates that the modified algorithm performs very well forn2¹⁶, the range of the experiments. It is conjectured that the average number of edges it creates—a good measure of its efficiency—is no more than twice optimal forn less than seven trillion. The improvement is shown to extend to the computation of the Delaunay triangulation in theL _p metric for 1<p.This research was supported by National Science Foundation Grants DCR-8352081 and DCR-8416190.     

管线用钢氢致裂纹(HIC)影响因素分析

研究了管线用钢的化学成分和金相组织对钢的氢致裂纹(HIC)性能的影响。研究认为,带状组织和马氏体含量对HIC性能有很大影响,S含量及Cep对HIC有不同程度影响。含有少量Cu、Ni的钢更适合在酸性环境下使用。     

浅析大型铸锻件质量体系

本文主要从质量体系的产生和发展、质量体系分析的资料、质量体系的环境分析及结构型式分析几个方面探讨分析了大型铸锻件的质量体系 ,可供大型铸锻件生产厂按 ISO90 0 0系列标准分析、设计、建立和完善大型铸锻件质量体系时参考。     

数控机床光栅尺部分故障实例分析

本文通过数控机床的故障实例，分析了光栅故障现象及原因和解决的办法。     

热型连铸过程的一维稳态传热模型

根据热型连铸技术原理，建立了热型连铸凝固过程一维稳态温度场的物理、数学模型。通过数值计算，得出了铸型出口温度、冷却距离、拉铸速度和喷水冷却强度等工艺参数对铸坯固液界面位置的影响。计算结果与试验结果吻合。     

二安替吡啉甲烷--变色酸分光光度法分析陶瓷中的钛

介绍了一种高选择性、精密度较好的快速分析陶瓷中钛方法。在酸性介质中,变色酸(XK)、二安替吡啉甲烷(IIAM)两种试剂与钛共同作用形成三元络和物,三元络合物最大吸收位于510nm处,摩尔比为Ti:XK:IIAM=1:2:2,是测定陶瓷中钛的快速分析方法。     

采矿法方案优选指标权数的动态分析

在采矿方案优选的研究中，其决策的正确与否，取决于参与计算的采矿法的定量、定性指标个数以及这些指标的权数。本文通过实例分析了指标权数的波动对采矿方案优劣排序的影响，以减小决策的风险。