可压缩流体网络的建模方法

本文运用网络分析手段,首次提出了任意拓扑结构可压缩流体网络动态特性的建模方法.该方法突破了目前在流体网络分析中普遍采用的“小扰动”线性化处理方法的局限。     

Canada baboon cruelty trial

A physiologist and the chief veterinarian at the University of Western Ontario are facing possible prosecution for cruelty to animals because of an experiment in which a baboon was kept for several months in a restraining chair. The case is believed to be the first in Canada brought against researchers following complaints by an animal welfare group. The experiment was supported by the Canadian Medical Research Council and the Ontario Heart and Stroke Fund, and the protocol and laboratory were approved by the Canadian Council on Animal Care.     

诱导空间的分子网收敛特征

研究了诱导空间的分子网收敛理论,给出诱导空间的几个与分子网收敛有关的刻画,从本质上揭示了诱导空间分子网收敛的特征及与之相关的闭包运算的内部结构。另外,作为应用,解决了《L-fuzzy拓扑空间论》中提出的关于序列式空间的几个问题。     

蓄电池容量自动测试仪

本文根据国标《CB5008.1～3—85》的规定,设计了一种蓄电池容量自动测试仪.该仪器利用8位单片计算机进行控制,完成测试过程中的自动恒流、自动测量时间和温度、自动进行数据处理、自动停机等功能.它的优点是操作简单,测量精度高,成本低.本文介绍了蓄电池容量的测量原理和计算方法,对单片机的硬件和软件系统都做了全面的叙述.     

DrugFET的研究（XⅢ）：四苯硼钠一烟碱FET的研制与应用

本文将离子敏感场效应晶体管（ＩＳＦＥＴ）与药物敏感膜相结合,研制成一种药物敏感场效应晶体管传感器（ＤｒｕｇＦＥＴ）。用四苯硼钠为电活性物质,邻苯二甲酸二辛酯为增塑剂,制成ｐｖｃ膜,对烟碱的线性范围为１．０×１０－２～２．０×１０－５ｍｏｌ／Ｌ,斜率为５７．５ｍｖ／ｐｃ,适宜ｐＨ范围为５．５～８．０,检出限为１．０×１０－６ｍｏｌ／Ｌ。用该传感器分析烟草中烟碱的含量,结果和分光光度法相一致。     

并殖吸虫第二中间宿主一新种——平和华溪蟹(十足目:短尾派)

本文记述了采自福建省平和县的淡水蟹华溪蟹属Sinopotamon一新种——平和华溪蟹S.pinheensesp.nov;蟹体内并殖吸虫囊蚴感染率为100％(21/21)。     

冷带轧机液压厚控系统动态数学模型分析与测试

分析了液压厚度控制系统动态数学模型．并与频率特性测试仪所测结果做了比较．得出了实用的被控对象结构图．为厚度控制系统的设计提供了理论依据．     

黄旗海产卤虫(Artemiapathenogenetica)成虫干片蛋白质、脂肪酸、氨基酸和矿物质的分析

对黄旗海产卤虫（Ａｒｔｅｍｉａｐａｔｈｅｎｏｇｅｎｅｔｉｃａ）成虫干片的蛋白质、脂肪酸、氨基酸和部分矿物质进行了初步分析．结果表明,粗蛋白含量为５４．１４％,脂肪酸中亚麻酸的含量为１５．０７％,蛋白质中的１７种氨基酸和部分矿物质的含量也很丰富,由此说明从盐碱湖中开发利用卤虫资源,使之成为新的食品源和优质饲料有着广泛的前景．     

测定草珊瑚中硒含量的方法研究

该文研究用萃取,荧光法、萃取－光度法、原子吸收光谱法分别测定草珊瑚中硒的含量。三种方法的测定结果较相近,均有较好的准确性和精密,方法简单易行。     

New bounds on time and number of processors for multiprocessor optimal schedules

Two problems for task schedules in a multiprocessor parallel system are discussed in this paper:

1. Given a partially ordered set of tasks represented by the vertices of an acyclic directed graph with their corresponding processing times, derive the lower bound on the minimum time(LBMT) needed to process the task graph for a given number of processors.
2. Determine the lower bound on minimum number of processors(LBMP) needed to complete those tasks in minimum time. It is shown that the proposed LBMT is sharper than previously known values and the computational aspects of these bounds are also discussed.