逻辑分析仪在教学实验中的应用

硬件教学实验必须由验证性向设计性转变，才能达到培养学生设计能力和处理问题的能力。而逻辑分析仪是数字系统设计的常用工具．对于实验和教学都起着不可忽视的作用。     

基于TMS320VC5410的最小系统设计

TMS320VC5410是TI公司生产的一款定点数字信号处理(DSP)芯片。基于DSP的最小系统是以其简洁的硬件结构来实现DSP的一般功能,广泛应用于工业生产、教学、科研、电子设计等领域。主要介绍了基于TMS320VC5410的最小系统硬件电路设计方案,阐述了重要电路部分的抗干扰设计和软件调试过程中应注意的若干问题。最后提出了简单易行的软件调试方法以及部分程序代码。     

GM300电台的调试原理及方法

GM300电台是一种性能优良的电台，目前在我国的地震勘探领域广泛应用。与其它类型的电台相比，GM300电台的调试方法完全不同。掌握其调试原理及方法是对该类电台进行正确维护的基础。本文从分析GM300电台调试原理入手，总结了该电台的调试方法。     

On the ontological expressiveness of information systems analysis and design grammars

Abstract. Information systems analysis and design (ISAD) methodologies provide facilities for describing existing or conceived real-world systems. These facilities are ontologically expressive if they are capable of describing all real-world phenomena completely and clearly. In this paper we formally examine the notion of the ontological expressiveness of a grammar and discuss some of its implications for the design and use of ISAD methodologies. We identify some generic ways in which ontological expressiveness may be undermined in a grammar and some potential consequences of these violations. We also examine ontological expressiveness within the context of some other desirable features that might be considered in the design of ISAD methodologies.     

Post-Supervised Template Induction for Information Extraction from Lists and Tables in Dynamic Web Sources

Dynamic web sites commonly return information in the form of lists and tables. Although hand crafting an extraction program for a specific template is time-consuming but straightforward, it is desirable to automatically generate template extraction programs from examples of lists and tables in html documents. Supervised approaches have been shown to achieve high accuracy, but they require manual labelling of training examples, which is also time consuming. Fully unsupervised approaches, which extract rows and columns by detecting regularities in the data, cannot provide sufficient accuracy for practical domains. We describe a novel technique, Post-supervised Learning, which exploits unsupervised learning to avoid the need for training examples, while minimally involving the user to achieve high accuracy. We have developed unsupervised algorithms to extract the number of rows and adopted a dynamic programming algorithm for extracting columns. Our method achieves high performance with minimal user input compared to fully supervised techniques.     

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.     

规则库冗余性控制策略的研究

冗余性控制是研究知识库组织、管理和维护中的一个问题．本文通过对智能型机译系统中规则知识表示方法的分析，提出了将冗余规则划分为显式冗余规则和隐式冗余规则分别予以处理的思想，给出了显式冗余规则的判别算法和部分隐式冗余规则的检测标准，并提出了控制机译系统规则库冗余性的基本原则.     

双向HFC网的上下通道异同点

双向HFC网络具有上下两个通道，它们的信号传输方式既有相同点也有不同点，具体说明信号流方向、信号类型、传输方式、光缆拓扑结构、信号测量方法、衰减器与均衡器位置、增益点选择等方面的不同，并说明它们在网络调试中的作用。     

Selectors Make Set-Based Analysis Too Hard

A set-based program analysis establishes constraints between sets of abstract values for all expressions in a program. Solving the system of constraints produces a conservative approximation to the program's runtime flow of values. Some practical set-based analyses use explicit selectors to extract the relevant values from an approximation set. For example, if the analysis needs to determine the possible return values of a procedure, it uses the appropriate selector to extract the relevant component from the abstract representation of the procedure. In this paper, we show that this selector-based approach complicates the constraint solving phase of the analysis too much and thus fails to scale up to realistic programming languages. We demonstrate this claim with a full-fledged value flow analysis for case-lambda, a multi-branched version of lambda. We show how both the theoretical underpinnings and the practical implementation become too complex. In response, we present a variant of set-based closure analysis that computes equivalent results in a much more efficient manner.