汽车组合仪表板控制系统设计

介绍了以PIC16F873单片机为控制核心的汽车组合仪表板控制系统的设计,简述了汽车组合仪表板的基本构成,介绍了汽车组合仪表板控制系统的组成和各部分功能,给出了数据采集处理电路、电源电路等部分硬件电路设计方案,并阐述了一些软件设计算法,如分段插补法和用于平滑指针的软件设计算法等。     

浅议物理实验教学环节改革

为进一步提高大学物理实验的教学质量，本文就实验课的预习、操作、实验报告的撰写及考核方法进行了探讨。     

Diagnostic Data Compression Techniques for Embedded Memories with Built-In Self-Test

A system-on-chip (SOC) usually consists of many memory cores with different sizes and functionality, and they typically represent a significant portion of the SOC and therefore dominate its yield. Diagnostics for yield enhancement of the memory cores thus is a very important issue. In this paper we present two data compression techniques that can be used to speed up the transmission of diagnostic data from the embedded RAM built-in self-test (BIST) circuit that has diagnostic support to the external tester. The proposed syndrome-accumulation approach compresses the faulty-cell address and March syndrome to about 28% of the original size on average under the March-17N diagnostic test algorithm. The key component of the compressor is a novel syndrome-accumulation circuit, which can be realized by a content-addressable memory. Experimental results show that the area overhead is about 0.9% for a 1Mb SRAM with 164 faults. A tree-based compression technique for word-oriented memories is also presented. By using a simplified Huffman coding scheme and partitioning each 256-bit Hamming syndrome into fixed-size symbols, the average compression ratio (size of original data to that of compressed data) is about 10, assuming 16-bit symbols. Also, the additional hardware to implement the tree-based compressor is very small. The proposed compression techniques effectively reduce the memory diagnosis time as well as the tester storage requirement.     

Recent developments in the statistical processing of textual data

Statisticians are accustomed to processing numerical, ordinal or nominal data. In many circumstances, such as socio-economic, epidemiologic sample surveys and documentary data bases, this data is juxtaposed with textual data (for example, responses to open questions in surveys). This article presents a series of language-independent procedures based upon applying multivariate techniques (such as correspondence analysis and clustering) to sets of generalized lexical profiles. The generalized lexical profile of a text is a vector whose components are the frequencies of each word (graphical form) or ‘repeated segment’ (sequence of words appearing with a significant frequency in the text). The processing of such large (and often sparse) vectors and matrices requires special algorithms. The main outputs are the following: (1) printouts of the characteristic words and characteristic responses for each category of respondent (these categories are generally derived from available nominal variables); (2) graphical displays of the proximities between words or segments and categories of respondents; (3) when analysing a combination of several texts: graphical displays of proximities between words or segments and each text, or between words or segments and groupings of texts. The systematic use of ‘repeated segments’ provides a valuable help in interpreting the results from a semantic point of view.     

Reformulation of the support set selection problem in the logical analysis of data

The paper is concerned with the problem of binary classification of data records, given an already classified training set of records. Among the various approaches to the problem, the methodology of the logical analysis of data (LAD) is considered. Such approach is based on discrete mathematics, with special emphasis on Boolean functions. With respect to the standard LAD procedure, enhancements based on probability considerations are presented. In particular, the problem of the selection of the optimal support set is formulated as a weighted set covering problem. Testable statistical hypothesis are used. Accuracy of the modified LAD procedure is compared to that of the standard LAD procedure on datasets of the UCI repository. Encouraging results are obtained and discussed.     

The crystal structure on the set of Mirkovi?-Vilonen polytopes

In an earlier work, we proved that MV polytopes parameterize both Lusztig's canonical basis and the Mirkovi?-Vilonen cycles on the affine Grassmannian. Each of these sets has a crystal structure (due to Kashiwara-Lusztig on the canonical basis side and due to Braverman-Finkelberg-Gaitsgory on the MV cycles side). We show that these two crystal structures agree. As an application, we consider a conjecture of Anderson-Mirkovi? which describes the BFG crystal structure on the level of MV polytopes. We prove their conjecture for sln and give a counterexample for sp₆. Finally we explain how Kashiwara data can be recovered from MV polytopes.     

Discrete storage processes and their Poisson flow and fluid flow approximations

Consider discrete storage processes that are modulated by environmental processes. Environmental processes cause interruptions in the input and/or output processes of the discrete storage processes. Due to the difficulties encountered in the exact analysis of such discrete storage systems, often Poisson flow and/or fluid flow models with the same modulating environmental processes are proposed as approximations for these systems. The analysis of Poisson flow and fluid flow models is much easier than that of the discrete storage processes. In this paper we give sufficient conditions under which the content of the discrete storage processes can be bounded by the Poisson flow and the fluid flow models. For example, we show that Poisson flow models and the fluid flow models developed by Kosten (and by Anick, Mitra and Sondhi) can be used to bound the performance of infinite (finite) source packetized voice/data communication systems. We also show that a Poisson flow model and the fluid flow model developed by Mitra can be used to bound the buffer content of a two stage automatic transfer line. The potential use of the bounding techniques presented in this paper, of course, transcends well beyond these examples.Supported in part by NSF grant DMS-9308149.     

成像光谱技术中机上实时数据压缩方法研究

根据成像光谱仪的特点用一系列串行的一维压缩实现二维图像压缩.提出了在机上对原始数据从光谱方向进行实时压缩的“二真值线性预测方法”.该法可做到压缩/复原后光谱特征信息不丢失.实验表明,对大多数光谱数据在1%的重建精度下,至少可获得2:1的压缩比.从总体而言,压缩后原始数据率可降低3～4倍.文中还对压缩数据的编码和误差进行了讨论.     

曝光数据流优化问题的蒙特卡罗算法

集成工艺中控制图形发生器产生掩模图形的数据流文件的数据排列顺序优化,是一个其结点数可达数千个之多的大规模旅行商问题(从镜头架的位置,即每个矩形的矩心为结点),常规算法早已不适用。本文采用多阶段蒙特卡罗算法并加以改进,补充了“分层优化模式”,邻接结点的预合并和在各个阶段末提取共同子路径并删去相关结点等一系列逐步缩小问题规模的措施,形成了一个实用的优化算法。相应的软件已成功地应用于薄膜磁头的数据流文件的优化。     

FTS-20E富里叶红外光谱仪数据系统改造

报道了ＦＴＳ－２０Ｆ富里叶红外光谱仪数据系统改造的工作采用ＩＢＭ４８６计算机及新的数据接口取代了陈旧的ＮＯＶＡ４数据系统，文章详细描述了其硬件设计和软件编辑，改造不仅更新了ＦＴＳ－２０Ｅ里叶红外光谱仪，而且还使其达到９０年代的水平。