论科技论文英语摘要的表现形式

论述科技论文中英语摘要的文体风格、时态、语态和基本要求，并结合例句介绍了常用的表现形式，使之简洁、准确和流畅。     

强度型光纤传感器的信号检测系统

本文阐述了一种可提高强度型光纤传感器测量精度的检测系统。该系统利用同一检测电路交替检测信号、参考通道的输出信号，并将信号、参考两通道的检测结果相除，从而消除了因发光二极管光源波动及检测电路系统不稳定所带来的误差。采用同步相关技术抑制了噪声，提高了输出信噪比。实验证明，当时间常数ＲＣ为０．０５Ｓ时，采用该检测系统可获得优于千分之一的零点稳定性和优于２×１０３的输出信噪比。     

Efficient prolog programming

This paper presents some basic programming strategies for Prolog programmers. The strategies are based on knowledge about the operational behaviour of the Warren Abstract Machine (WAM). The aim is to provide simple principles for making programs both faster and less space-consuming. The programming hints given are mostly local, i.e. only a single clause or procedure need be considered at a time.     

流动的色彩--巴西著名设计师罗伯特·布雷·马克斯及其风景园林作品

20世纪中期,世界现代风景园林正经历分娩的阵痛,在南美国家巴西出现了一位让世界瞩目的设计大师,他用自己传奇的经历、独特的个性和不凡的艺术天赋带给世界园林景观新的元素、新的形式及新的艺术观,时至今日,他的影响仍波及世界的每个角落.     

A New Approach to Abstract Syntax with Variable Binding

The permutation model of set theory with atoms (FM-sets), devised by Fraenkel and Mostowski in the 1930s, supports notions of ‘name-abstraction’ and ‘fresh name’ that provide a new way to represent, compute with, and reason about the syntax of formal systems involving variable-binding operations. Inductively defined FM-sets involving the name-abstraction set former (together with Cartesian product and disjoint union) can correctly encode syntax modulo renaming of bound variables. In this way, the standard theory of algebraic data types can be extended to encompass signatures involving binding operators. In particular, there is an associated notion of structural recursion for defining syntax-manipulating functions (such as capture avoiding substitution, set of free variables, etc.) and a notion of proof by structural induction, both of which remain pleasingly close to informal practice in computer science. Received October 2000 / Accepted in revised form April 2001     

独特的网络小应用程序－Java Applet

本文介绍了重要的Ｉｎｔｅｒｎｅｔ工具Ｊａｖａ语言及其独特的小应用程序－Ｊａｖａａｐｐｌｅｔ，阐述了ａｐｐｌｅｔ的基本概念和它给Ｉｎｔｅｒｎｅｔ网带来的巨大影响，描述了ａｐｐｌｅｔ的生命期，以及使用ＡＷＴ建立ａｐｐｌｅｔ的一系列方法和ａｐｐｌｅｔ的安全机制，展望了Ｊａｖａ新思想对今后Ｉｎｔｅｒｎｅｔ的推动。     

基于REST架构的矿山数字移动办公平台

基于面向资源思想以及REST架构,首次提出了矿山资源抽象层的概念,将矿山中各个异构系统的功能、文档、界面、工作流等抽象为能够通过标准URI来唯一标识的抽象资源元数据,在决策或智能分析层通过对元数据的分析和处理来实现相应操作或得出相关的分析结果;提出了基于REST框架的矿山数字移动办公平台设计方案,并以神木张家峁矿业有限公司移动办公平台的建设为例,介绍了将多个异构系统快速集成在移动终端的实现方法。应用结果表明,该移动办公平台运行稳定,操作流畅,使得工作人员能够随时、随地、随手办公,大大提高了办公灵活性及效率。     

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.     

基于重子节点抽象语法树的软件缺陷预测

在实际软件项目开发过程中,软件缺陷预测能辅助测试人员找到项目中可能存在缺陷的位置,并通过抽象语法树（AST）获取项目模块中隐藏的结构和语义信息,此类信息有助于提高缺陷预测精度。提出基于重子节点抽象语法树的缺陷预测方法,在提取节点信息时保留节点的类型信息和对应代码语义的值信息,并使用特殊字符串代替没有值信息的节点。通过树链剖分思想将AST分割为重子节点和轻子节点,优先选择重子节点作为序列化向量中的节点,同时利用深度学习网络学习节点序列中的源代码结构和语言实现软件缺陷预测。实验结果表明,与DFS方法相比,该方法在基于注意力机制的循环神经网络深度学习模型上的F1值和AUC值平均提升约3%和4%,具有更好的缺陷预测效果。     

研究生“抽象代数”开放课程的建设

分析了抽象代数课程建设中存在的一些问题,介绍了教育信息化背景下抽象代数开放课程的建设,阐述了如何将信息技术渗透到抽象代数课程的建设中。