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.     

从两次洪水分析中看非工程措施对防洪的影响

本文通过对赣江流域袁河“82·6”和“89·7”两次大洪水的分析比较,得出结论:准确的水情预报和水库工程正确的调度方式,能减轻下游防洪负担,最大限度地减少洪灾损失,夺取抗洪斗争的胜利。文中提醒人们,在防汛工作中,应把非工程措施提高到相当的地位来加以重视。     

Cisco路由器流量采集软件的研制

网络流量能反映网络的运行状态,是网络管理领域中重要的研究课题。随着网络技术的发展,网络应用的不断深入,网络的有效性、安全性分析尤显重要,直接分析网络实时流量,将具有非常重要的意义。NetFlow是Cisco公司为实现流量统计和流量分析而开发的一种协议,使用NetFlow可以方便地进行大规模的流量采集。通过对NetFlow协议原理与功能的分析,可以设计一种NetFlow流量分析器,该分析器能够对NetFlow流量数据进行采集、分析和显示,实现网络的异常流量监测、流量统计和综合流量分析,并能及时地发现网络攻击。     

一种新的修正恒模算法

阐述了恒模算法(CMA)、修正恒模算法(MCMA)和判决引导(DD)算法的基本原理。针对CMA和MCMA收敛速度慢,固定步长条件下收敛速度和剩余误差之间存在矛盾的缺陷,在分析CMA误差特性的基础上,利用DD算法误差函数的模值和判决器输出构造新的误差函数,提出了一种新的变步长MCMA。新算法在加快收敛速度的同时保持小的剩余误差。仿真结果表明,新算法比CMA和MCMA收敛速度快,均衡输出剩余码间干扰(ISI)小而且能克服相位偏移,具有很好的实用性。     

表面贴装过程仿真系统的研究与开发

文章从表面贴装技术(SMT)现状及特点开始,介绍多品种小批量电子产品中使用表面贴装技术存在的问题。针对这一情况对表面贴装过程仿真系统的需求进行了分析,并详细论述了仿真系统的文件预处理、仿真以及数据库维护三大主要模块设计,主要介绍采用OpenGL实现仿真模块的方法,同时展示仿真系统实现结果。最后总结了仿真系统的特点。     

以1,3-二(4-邻羟基苯亚胺次甲基)苯氧基丙烷为载体的铁离子(Ⅲ)电极的研究

以1,3-二(4-邻羟基苯亚胺次甲基)苯氧基丙烷为中性载体制备了PVC膜Fe3+离子选择性电极。该电极对Fe3+呈现出良好的选择性和近Nernst电位响应性能。电极斜率为21mV/dec,线性范围为3.0×10-5～1.0×10-1mol/L,检出限为1.0×10-5mol/L。采用交流阻抗技术研究了电极的响应机理,并将电极作为指示电极初步用于EDTA的电位滴定。     

基于2,4-二羟基苯甲酸铜(Ⅱ)为载体的硫氰酸根电极的电位响应

制备了基于一种简单的金属铜配合物2,4-二羟基苯甲酸铜(Ⅱ)(Cu(Ⅱ)DHBA)为载体的PVC膜硫氰酸根离子(SCN-)选择性电极。该电极在1.0×10-1～1.0×10-6mol/LSCN-浓度范围内呈现斜率为-59.5mV/dec的近Nernst电位响应,检测下限为9.1×10-7mol/L。利用紫外可见光谱及交流阻抗技术初步探讨了电极对SCN-呈现的选择性电位响应机理。该电极作为直接电位分析法的指示电极,成功运用于实验室废水中硫氰酸盐含量的测定。     

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

运用复杂网络理论的基本原理和有关方法,对理工医文等学科、专业之间的合作规律和人员合作方式进行探讨,以某高校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.