知识库中精确知识的判定算法

研究了知识库中挖掘它所包含的精确知识的方法，给出知识库的相关概念及精确知识的定义，讨论了一种在所定义的知识库中提取并判定精确知识的算法．     

基于ASP的网络高中数学试题库的设计与实现

在分析了目前高中老师和学生对题库的需求的基础上,确定了建立高中数学题库的目标.介绍了题库系统的数据库设计和系统功能模块,并且详细讨论了系统实现的关键技术和系统安全问题.试验结果表明,该题库能满足不同用户的多样化需求.     

EQUILIBRIUM ALGORITHMS WITH NONMONOTONE LINE SEARCH TECHNIQUE FOR SOLVING THE TRAFFIC ASSIGNMENT PROBLEMS

This paper presents a unified bination algorithms （such as FrankWolfe problems. Global convergence results are framework of the nonmonotone convex comAlgorithm） for solving the traffic assignment established under mild conditions. The line search procedure used in our algorithm includes the nonmonotone Armijo rule, the non- monotone Goldstein rule and the nonmonotone Wolfe rule as special cases. So, the new algorithm can be viewed as a generalization of the regular convex combination algorithm.     

可变分区存储管理方式的模拟

论述了如何用C语言模拟可变分区存储管理方式的过程。形象地展示了操作系统中可变分区存储管理中采用的最佳适应算法的分配与回收过程，达到了理论与实践相联系的目的。     

Seismic 3D Prestack Time Migration on Parallel Computers

Ｓｅｉｓｍｉｃ３ＤＰｒｅｓｔａｃｋＴｉｍｅＭｉｇｒａｔｉｏｎｏｎＰａｒａｌｌｅｌＣｏｍｐｕｔｅｒｓ￥ＬｉｕＰｉｎｇ＆ＣｈｅｎＹｕｎｈｅ（ＷｕｈａｎＤｉｇｉｔａｌＥｎｇｉｎｅｅｒｉｎｇｉｎｓｔｉｔｕｔｅ，ＷｕｃｈａｎｇＰ．Ｏ．Ｂｏｘ７４２２３，Ｐ．Ｒ．...     

系统结构模型分部的底层要素法

本文从系统的底层要素出发，提出并证明了底层要素存在性、底层要素后果集并集的完全性以及它们在同一部分的充分必要条件，由此导出了系统结构模型分部的算法，实际应用进一步说明了这一方法的有效性。     

一类自适应松弛算法的算法模型

对于一类自适应松弛算法,本文提出了一个算法模型。在一些通常的假定下,证明了该模型生成的序列的收敛性定理。     

Using genetically-defined rodent strains for the identification of hippocampal traits relevant for two-way avoidance behavior: a non-invasive approach

Summary Genetically-defined rodent strains permit the identification of hippocampal traits which are of functional relevance for the performance of two-way avoidance behavior. This is exemplified here by analyzing the relationship between infrapyramidal mossy fibers (a tiny projection terminating upon the basal dendrites of hippocampal pyramidal neurons) and two-way avoidance learning in about 800 animals. The necessary steps include 1) identification of structural traits sensitive to selective breeding for extremes in two-way avoidance, 2) testing the robustness of the associations found by studying individual and genetical correlations between hippocampal traits and behavior, 3) establishing causal relationships by Mendelian crossing of strains with extreme structural traits and studying the behavioral consequences of such structural randomization, 4) confirming causal relationships by manipulating the structural variable in inbred (isogenic) strains, thereby eliminating the possibility of genetic linkage, and 5) ruling out the possibility of spurious associations by studying the correlations between the hippocampal trait and other behaviors known to depend on hippocampal functioning.In comparison with the classical lesion approach for identifying relationships between brain and behavior, the present procedure appears to be superior in two aspects: it is non-invasive, and it focuses automatically on those brain traits which are used by natural selection to shape behaviorally-defined animal populations, i.e., it reveals the natural regulators of behavior.     

钢丝绳断丝定量检测中径向随机晃动误差的补尝

本文论述了钢丝绳断丝定量检测中径向随机晃动误差存在的必然性及该误差对定量检测的影响,基于模拟实验结果,给出了适用于多种类型钢丝绳的V_H-S数学关系式;提出了波形因素的概念与形式,并用软件实现了钢丝绳断丝定量检测中径向随机晃动误差的补偿。     

The Young-Householder algorithm and the least squares multidimensional scaling of squared distances

It is shown that replacement of the zero diagonal elements of the symmetric data matrix of approximate squared distances by certain other quantities in the Young-Householder algorithm will yield a least squares fit to squared distances instead of to scalar products. Iterative algorithms for obtaining these replacement diagonal elements are described and relationships with the ELEGANT algorithm (de Leeuw 1975; Takane 1977) are discussed. In large residual situations a penalty function approach, motivated by the ELEGANT algorithm, is adopted. Empirical comparisons of the algorithms are given.An early version of this paper was presented at the Multidimensional Data Analysis Workshop, Pembroke College, Cambridge, July 1985. I want to thank Jan de Leeuw and Yoshio Takane for bringing the ELEGANT algorithm to my attention and for clarifying its rationale and notation. My thanks go also to Stephen du Toit for help with the ALSCAL computations reported in Section 7.