IBM PC与Nicolet数字示波器之间的通信

本文介绍了IBM pC/AT Nicolet 4094数字示波器之间的通信,采用了串行异步通信和并行通信两种方式,为材料动态力学性能试验瞬态波形的采集和处理提供了一种重要手段。

冲绳海槽北部PC-1岩芯24 cal.kaBP 以来孢粉记录的古环境信息

东海陆架是世界上最宽阔的陆架之一，面积达770 000 km2左右。在末次冰盛期（LGM），东海海平面下降120～130 m左右，绝大部分陆架暴露出海面。而冲绳海槽是第四纪以来一直保持海洋环境的东海深海区。本文以冲绳海槽北部PC-1岩芯为材料，通过分析该孔的孢粉，加上详细的AMS 14C测年，恢复了周边地区24 cal.kaBP以来的古植被，并推测古环境和古气候变化，重点讨论了LGM时期出露大陆架上发育的植被。 PC-1孔（31°27.5′N，128°24.8′E）位于黑潮支流对马暖流东侧，水深590 m，柱长812 cm。孢粉分析按间隔8 cm取样，个别为4~6 cm，共分析了103个孢粉样品。利用9个AMS 14C数据建立年龄标尺，用Calib5.1.0软件进行年龄校正。通过相邻样品深度的线性内插获得每个样品的年龄，采用外延法得到顶部和底部的校正年龄分别为351cal aBP、24 280 cal aBP，孢粉样品的时间分辨率平均为230 a。 根据孢粉百分比和沉积率的变化，可划分出四个带：Ⅰ带（812～715 cm，24.2～21.1 cal. kaBP）、Ⅱ带（715～451 cm，21.1～15.2 cal. kaBP）、Ⅲ带（451～251 cm，15.2～10.8 cal. kaBP）、Ⅳ带（251～0 cm，10.8～0.3 cal. kaBP），分别对应MIS 3末期、末次冰盛期、冰消期和全新世。末次冰盛期草本植物花粉占优势，孢粉沉积率较高，此时草本花粉主要来源于出露的大陆架，其上发育了以蒿属为主的草地植被，气候比较寒冷干燥；冰消期海平面开始回升，松属花粉含量升高，草本植物花粉含量下降；全新世以木本植物花粉占绝对优势，栗属－栲属花粉迅速增加，蕨类孢子含量升高，草本植物花粉含量锐减，孢粉沉积率降低，由于海平面回升，大陆架被淹没，此时孢粉主要来源于日本岛，九州地区生长了以栲属、栎属为主的常绿阔叶与落叶阔叶林，气候温暖湿润。 叶枝杉属花粉在整个岩芯中零星出现。叶枝杉属植物分布于菲律宾吕宋北部至塔斯马尼亚和新西兰气候潮湿的山地林中，该属花粉在岩芯中的出现，可能暗示了黑潮的影响或者是较强的夏季风。 草本植物与松属花粉百分比变化很好的反映了海平面的升降，松属花粉含量较高指示海平面较高。对岩芯中主要类型的花粉百分比进行了频谱分析，显示存在千年尺度的准周期变化，有明显的6.8，3.8，2.2，1.6 ka的周期。 孢粉样品中的炭屑统计表明，末次冰消期炭屑含量最高，可能因为末次冰消期降雨量增加，炭屑可被降水带到沉积地点沉积下来；全新世的炭屑浓度较高，尤其在晚全新世，出现了一个峰值，究其原因可能与气候变化和人类活动有关。

On equations for regular languages, finite automata, and sequential networks

We consider systems of equations of the form where A is the underlying alphabet, the Xi are variables, the Pi,a are boolean functions in the variables Xi, and each δi is either the empty word or the empty set. The symbols υ and denote concatenation and union of languages over A. We show that any such system has a unique solution which, moreover, is regular. These equations correspond to a type of automation, called boolean automation, which is a generalization of a nondeterministic automation. The equations are then used to determine the language accepted by a sequential network; they are obtainable directly from the network.

practical type checking of functions defined on context-free languages

A type checking method for the functional language LFC is presented. A distinct feature of LFC is that it uses Context-Free (CF) languages as data types to represent compound data structures. This makes LFC a dynamically typed language. To improve efficiency, a practical type checking method is presented, which consists of both static and dynamic type checking. Although the inclusion relation of CF.languages is not decidable,a special subset of the relation is decidable, i.e., the sentential form relation, which can be statically checked.Moreover, most of the expressions in actual LFC programs appear to satisfy this relation according to the statistic data of experiments. So, despite that the static type checking is not complete, it undertakes most of the type checking task. Consequently the run-time efficiency is effectively improved. Another feature of the type checking is that it converts the expressions with implicit structures to structured representation. Structure reconstruction technique is presented.

pattern matching compilation of functions defined in context-free languages

LFC is a functional language based on recursive functions defined in context-free languages. In this paper, a new pattern matching algorithm for LFC is presented, which can represent a sequence of patterns as an integer by an encoding method. It is a rather simple method and produces efficient case-expressions for pattern matching definitions of LFC. The algorithm can also be used for other functional languages, but for nested patterns it may become complicated and further studies are needed.

facilitating formal specification acquisition by using recursive functions on context-free languages

Although formal specification techniques are very useful in software development, the acquisition of formal specifications is a difficult task. This paper presents the formal specification language LFC, which is designed to facilitate the acquisition and validation of formal specifications. LFC uses context-free languages for syntactic aspect and relies on a new kind of recursive functions, i.e. recursive functions on context-free languages, for semantic aspect of specifications. Construction and validation of LFC specifications are machine-aided. The basic ideas behind LFC, the main aspects of LFC, and the use of LFC and illustrative examples are described.

on string languages generated by spiking neural p systems

We continue the study of spiking neural P systems by considering these computing devices as binary string generators: the set of spike trains of halting computations of a given system constitutes the language generated by that system. Although the "direct" generative capacity of spiking neural P systems is rather restricted (some very simple languages cannot be generated in this framework), regular languages are inverse-morphic images of languages of finite spiking neural P systems, and recursively enumerable languages are projections of inverse-morphic images of languages generated by spiking neural P systems.

可在IBM微机上运行的太阳能系统瞬态模拟程序——TRNSYS IBM-PC版

国际流行的太阳能系统瞬态模拟程序——TRNSYS是一个大型程序包，它只能在容量足够大的计算机上使用。本文介绍的是改进的TRNSYS，它可在IBM-PC微机上运行，能模拟各种太阳能系统，便于推广使用。本文对其结构及使用方法作出介绍，并以算例说明。

高抗冲聚苯硫醚（PPS）的研究；PC/PBA-cs-PMMA共混体系的研究

聚苯硫醚（PPS）是特种工程塑料中应用最广、价格最低的品种。但由于其耐冲击性差，限制了其做为结构材料的应用。本论文通过多种研究方法，研究了PPS抗冲击性差的根本原因和改善途径，从改变其聚集态结构入手，使韧性得到了很大改善，为高抗冲PPS的研制提供和积累了丰富了可靠的数据，其创新性成果体现在：提出了含刚性非晶相、可动（类液）非晶相和晶相的PPS三相模型并计算了各相的相对含量、测定了各相的密度；发现了PPS的冲击强度与其结晶度呈近似线性的关系。是十分有意义的基础性工作。用核壳乳液聚合物做为PC的增韧剂，有效地控制了共混物的形态结构、计算出了界面层厚度与界面张力，为制备具有综合性能的改性PC材料奠定了理论和实践基础。