Debugging programs that use macro-oriented data abstractions

Enhanced C (EC) is a set-oriented, extensible, C-like language. EC uses data abstractions to define new types. These data abstractions, called clusters, are macro-like devices that perform substitution on the typed syntax tree. Debugging programs that use clusters raise problems that are not encountered in ordinary programming languages. At compile time there is a need to determine and report whether the macro expansion will result in a legal program before this expansion actually takes place. At run-time the problems are how to account for replaced statements and how to handle variables whose types have been established by the clusters, variables that disappear, or variables whose names have been changed. This article presents these problems and their solutions as implemented by the EC compiler and the EC symbolic debugger. Similar debugging problems appear in other languages: The need to handle variables at run time is common to all languages that support data abstraction even if the abstractions are procedure oriented; also, a mild form of the problem of the replaced statement appears in inline procedure substitution of Ada. The solutions developed for the EC debugger apply to these cases as well.     

商务智能在ERP系统中的应用

ERP系统属于典型的联机事务处理系统,不可避免的存在许多不足,无法提供企业决策所需的决策信息。商务智能是一种正在快速发展的技术,它在ERP中的应用有效的解决ERP存在的问题。     

二维介质PBG结构的工程设计

针对介质材料中按二维菱形周期排列空气圆孔的PBG结构，采用平面波展开法结合迭代技术的理论分析程序，对结构尺寸与介质参数的不同组合进行了批量计算，根据对计算结果的分析，归纳出阻带范围与结构参数之间的函数关系，经数据拟合得出一组准确而快捷的工程设计公式，还给出了根据预期的阻带范围设计PBG结构参数的简明步骤，实例验证了该组公式的实用性。     

F150交换机告警关联规则的研究

为了提高电信网络运营效率，降低维护成本，电信运营企业在网络告警管理系统中需要引入数据挖掘技术。本文主要研究利用数据挖掘技术来进行故障的管理，即对告警进行关联性分析，详细分析了告警序列数据的关联规则挖掘算法，并在南昌本地网F150交换机的告警数据库中予以实现，同时对实际挖掘结果进行分析和整理，推导出一些实用的关联规则。     

rried out. The Lagrange multipliers are

boundary conditions. A cell structure which is independent to the nodes is used to evaluate the integrals of EFG     

Utilization of STEP AP 210 at The Boeing Company

Boeing has been working on the development and implementation of STEP AP 210 since its inception. Using a combination of internally funded activities, external government contracts and multi-company pilots, Boeing has developed prototype tools to utilize AP 210 and is poised to move these tools into production. This paper begins with a brief overview of STEP and AP 210. The status of available AP 210 vendor translators (data generators), along with viewers and analysis programs (data consumers) is covered. Discussion continues with present and planned usage of AP 210 in several companies with the primary emphasis on implementation at The Boeing Company. The document concludes with a summary of key points.     

现场总线技术在发电系统数据采集中的应用

介绍了现场总线网络在干熄焦汽轮机发电生产过程中所起的作用，并重点介绍了系统所完成的数据采集，监视和管理等功能。     

分散网络制造浅谈

网络社会的制造业将是一个全球化的分散型的制造体系.分散网络制造是基于互联网的制造活动,因此,它具开放的、虚拟的,以及资源和技术更合理配置的特点.其组织模式是多种多样的,按现今国防工业现状,宜采用项目领导小组统一协调和控制下的分阶段动态联盟更为合适.为此,分析了网络无序化、企业属性知识不足、利益分配不易等问题带来的困难,并提出了一些建议.     

The optimisation of higher order resampling methods in a multiprocessor environment

The processing of images obtained from satellites often involves highly repetitive calculations on very large amounts of data. This processing is extremely time consuming when these calculations are performed on sequential machines. Parallel computers are well suited to handling computationally expensive operations such as higher order interpolations on large data sets. This paper decribes work undertaken to develop parallel implementations of a set of resampling procedures on an Alliant VFX/4. Each resampling procedure implemented has been optimised in three stages. First, the algorithm has been restructured, where two-dimensional resampling is performed by two one-dimensional resampling operations. Second, each procedure has been reprogrammed in such a way that the autoparallelisation provided by the FX/Fortran compiler has been exploited. Thirdly, data dependent analysis of each procedure has been performed in order to achieve full optimization of each procedure; each procedure has been restructured where appropriate to circumvent vectorisation and concurrency inhibiting data dependencies. The nature and extent of the code optimization achieved for each procedure is presented in this paper. The original code for the most computationally expensive procedure, as targeted at a sequential machine, was found to have an execution time of 4900 seconds on the Alliant VFX/4 when compiled with regular compiler optimization options. Following algorithmic redesigning and reprogramming of the code, as indicated in stage 1 and stage 2, the execution time was reduced to 248 seconds. Restructuring of the code following data dependency analysis indicated in stage 3 in order to avoid data dependencies and allow concurrency and vectorisation, further reduced execution time to 162 seconds. The consequence of this work is that higher-order resampling methods which had not previous been practical are now routinely performed on the Alliant VFX/4 at the University of Dundee.