关于连续映射的等价命题

从不同角度描述了连续映射,重新安排了命题的顺序,并给出了最简洁的证明.     

Direct multicriteria clustering algorithms

In a multicriteria clustering problem, optimization over more than one criterion is required. The problem can be treated in different ways: by reduction to a clustering problem with the single criterion obtained as a combination of the given criteria; by constrained clustering algorithms where a selected critetion is considered as the clustering criterion and all others determine the constraints; or by direct algorithms. In this paper two types of direct algorithms for solving multicriteria clustering problem are proposed: the modified relocation algorithm, and the modified agglomerative algorithm. Different elaborations of these two types of algorithms are discussed and compared. Finally, two applications of the proposed algorithms are presented. Elaborated version of the talks presented at the First Conference of the International Federation of Classification Societies, Aachen, 1987, at the International Conference on Social Science Methodology, Dubrovnik, 1988, and at the Second Conference of the International Federation of Classification Societies, Charlottesville, 1989. This work was supported in part by the Research Council of Slovenia.     

提高Prolog实现的专家系统运行效率的方法

Prolog语言由于其表达专家知识的便利性和强大的推理能力,成为专家系统设计用得较多的语言.但是用Prolog实现一个大程序,特别是具有大量知识的专家系统中,其运行效率是很低的.因此,为了将一个系统投入实时运行,在软件设计时就应考虑效率优化.本文从知识库的组织、匹配方法的选取,以及运用启发式控制回溯等三方面探讨效率优化的方法.1 知识库的组织     

非线性系统的分层优化预测控制

提出了一种基于分层优化策略和动态最优控制解法的非线性系统预测控制算法,该方法大大减小了在线计算量,使实时控制成为可能.给出了详尽的理论推导,以一个仿真算例证明了算法的正确、可行与有效性.     

一类T_(BOS)~n 唯一路径簇构造与图形特性分析

应用布尔序集关系理论，研究了一类典型Ｔ _ＢＯＳ^ｎ 唯一路径簇的构造与实现方法．同时给出基本图形特性的分析．     

一类带跳跃非线性项的边值问题的非平凡解的存在性

设Ω为Ｒ＾ｎ（ｎ≥１）的有界光滑区域，ｇ∈Ｃ（Ｒ，Ｒ）。本文得到边值问题 －△ｕ＝ｇ（ｕ）在Ω内，ｕ＝０在δΩ上 在ｇ满足适当跳跃性和局部光滑性条件时存在两个非平凡解。     

基于参数估计的层次诊断模型研究及应用

针对大型系统多故障诊断的复杂性,提出利用抽象技术建立的简化层次模型进行诊断。把抽象技术分为结构抽象和行为抽象,结构抽象建立在系统的描述方法之上,采用的行为抽象技术为Box-Jenkins建模方法(B-J法)的参数模型。介绍了层次模型的一种形式化方式-抽象树的建立方法。利用不同层次的参数模型参数值序列之间的变化关系并采用由上至下的分层诊断策略进行故障诊断。仿真实例的结果表明减少了计算量,提高了诊断效率。     

半序集的内禀拓扑(Ⅱ)

在这篇文章中我们讨论了一个半序集的内禀拓扑的紧性和连通性,以及内禀拓扑与其在子集中的导出拓扑之间的关系,主要结果有:1.格L的区间拓扑是紧的,当且仅当L是备的;2.局部有限散度半序集P的区间拓扑是连通的,当且仅当P是稠的且条件备;3.格L中设M=[←,p],则M的区间拓扑(开区间拓扑)和L的区间拓扑(开区间拓扑)在M的导出拓扑等价.     

Application and realization of hierarchical network planning based on Web

Making use of Microsoft Visual Studio. NET platform, hierarchical network planning is realized in working procedure time-optimization of the construction by TBM. and hierarchical network graph of the construction by TBM is drawn based on browser. Then the theory of system realization is discussed, six components of system that can be reused are explained emphatically. The realization of hierarchical network panning in Internet provides available guarantee for controlling rate of progress in large-scale or middle-sized projects.