基于策略的网管中策略条件“或”运算的问题及解决方法

当前,在各研究组织提出的策略信息模型中,策略条件都可以是由逻辑运算符“OR”或者“AND”联结的表达式。策略条件中的“OR”运算和“AND”运算给策略的表示带来了很大的方便性和灵活性。但是,策略条件中的“OR”运算可能会导致网管系统中产生三种类型的问题。文章研究了各研究组织提出的策略信息模型,指出了策略信息模型中策略条件“OR”运算可能导致的三类问题,并提出了解决此三类问题的方法。     

项目调度中的测试问题集选取研究

为了更好测试和比较项目调度问题求解算法的性能,通常需要利用测试问题集对相关算法进行测试和比较。对现有测试问题集的研究进行综述,并重点介绍国际上常用的两套标准问题集（Patterson问题集和PSPLIB标准问题库）和两款用于生成问题集的软件（单项目调度问题集生成器RanGen和多项目调度问题集生成器RCMPSP）,最后,提出项目调度问题中选取问题集的一般流程以及构建问题集的一般方法,并通过实例说明该问题集选取方法的有效性及应用前景。     

利用CSP求解极小碰集的方法

基于模型诊断是人工智能领域中具有挑战性的问题,包含了很多人工智能中的关键问题,其研究对整个人工智能领域起着重要推动作用.在基于模型诊断中,候选诊断结果通常由所有极小冲突集对应的所有极小碰集所描述,求出所有极小碰集是其核心问题之一.提出一种将极小碰集问题转换为约束满足问题的方法,该方法调用成熟的CSP求解器进行求解,扩展了约束可满足问题的应用领域.首次提出hard-冲突集和soft-冲突集的概念,并给出利用所提的方法分别求解具有一些特征的极小碰集：小于固定长度、不含特定元素及包含hard-冲突集和soft-冲突集.实验结果表明,提出的方法易于实现、扩展性强,对于特定类型极小碰集问题的求解效率较高.     

基于软粗糙集的犹豫模糊三支决策方法

三支决策理论采取“三分而治”的处理思路,为复杂问题求解提供了一种简洁高效的解决方案.对此,借助软集理论研究犹豫模糊集和三支决策方法,通过定义犹豫模糊集的值空间和值陪集,引入犹豫模糊集的典范软集、单位区间参数化软集和导出犹豫模糊集等概念,解决犹豫模糊集和软集的相互表示问题.此外,利用软粗糙集理论建立一种基于犹豫模糊集的广义粗糙模型,借助给定的预决策集,计算软上近似集并确定评价函数,进而提出一种基于软粗糙集的犹豫模糊三支决策方法.最后,通过两个数值实例和相关对比分析,验证所提出三支决策方法的合理性和有效性.     

The normal parameter reduction of soft sets and its algorithm

This paper is concerned with the reduction of soft sets and fuzzy soft sets. Firstly, the problems of suboptimal choice and added parameter set of soft sets are analyzed. Then, we introduce the definition of normal parameter reduction in soft sets to overcome these problems. In addition, a heuristic algorithm of normal parameter reduction is presented. Two new definitions, parameter important degree and decision partition, are proposed for analyzing the algorithm of normal parameter reduction. Furthermore, the normal parameter reduction is also investigated in fuzzy soft sets.     

Vague集转化为Fuzzy集的新方法

结合Vague集理论及投票模型下的解释,对Vague集向Fuzzy集转化的方法进行了分析,指出已有方法存在的不足之处,提出了一种Vague集转化为Fuzzy集的新方法,并证明了该方法的有效性。     

关于“Vague集向Fuzzy集的转换函数”的注记

结合Vague集理论及投票模型下的解释,对“Vague集向Fuzzy集的转化函数”进行了分析,指出了其存在的不足之处,提出了两种Vague集转化为Fuzzy集的新方法,并证明了其有效性。     

Vague集向Fuzzy集转化的方法分析

介绍了Vague集与Fuzzy集的特点,结合Vague集理论及投票模型下的解释,对Vague集向Fuzzy集转化的多种方法进行了分析,指出已有方法的不足,根据Vague集的三维特性并结合人的心理变化情况首次直观地提出一种新的有效非线性方法,并通过实例说明该方法的正确性和直观性。     

Singularities of sets used in the mesh method

In the paper, sets of nodes leading to singularities in mesh method analysis of problems in mechanics are defined precisely. Forms of singular sets determined by conic curve equations are presented. Examples of such sets are also given.     

离散Vague集的相似度

全面分析了近年来百余篇关于Vague集理论及应用的论文,将以往Vague集的相似度分为5类,指出了它们存在的一些不足之处。在此基础上,给出了更一般的离散Vague集间的相似度。     

Polynomial-Space Decidable Membership Problems for Recurrent Systems over Sets of Natural Numbers

A finite recurrent system over sets of natural numbers of dimension n is a pair composed of n n-ary functions over sets of natural numbers and an n-tuple of singleton sets of natural numbers. Every function is applied to the entries of the tuple and computes a set of natural numbers, that may also be empty. The results are composed into another tuple, and the process is started anew. Thus, a finite recurrent system defines an infinite sequence of n-tuples containing sets of natural numbers. The last entry of a generated n-tuple is called the output of a step, and the union of the output sets of all steps is the set defined by the finite recurrent system. Membership problems ask whether a given number is in a specified output set or in some output set. We study membership problems for special finite recurrent systems, whose functions are built from the set operations union, intersection and complementation and the arithmetical operations addition and multiplication. Sum and product of two sets of natural numbers are defined elementwise. We restrict the set of operations from which functions are built and determine the impact on the complexity of the membership problems. We focus on PSPACE-decidable membership problems and show completeness results for the complexity classes NL, NP and PSPACE.     

Statistics with fuzzy data in statistical quality control

Statistical quality control (SQC) is an important field where both theory of probability and theory of fuzzy sets may be used. In the paper we give a short overview of basic problems of SQC that have been solved using both these theories simultaneously. Some new results on the applications of fuzzy sets in SQC are presented in details. We also present problems which are still open, and whose solution should definitely increase the applicability of fuzzy sets in quality control.     

关于Vague集向模糊集转化的一种新方法

文章介绍了Vague集与Fuzzy集的特点,结合Vague集理论及投票模型下的解释,对Vague集向Fuzzy集转化的方法进行了分析,指出已有方法的不足,根据Vague集的三维表示图直观地提出了一种新的有效方法,并通过实例说明了该方法的有效性和直观性。     

基于粗集理论的知识系统证据推理研究

证据推理是处理不确定问题的重要方法，但灾用中存在许多问题，如假设的基本概率指派（bpa)往往由专家事先确定，带有较强的主观性，基于证据推理和粗集理论的基本关系，利用粗集约简，决策表确定基本概率指派等方法解决上述问题，并在此基础上，提出了一种决策表的证据推理方法，用于决策表的预测，实例表明，证据推理和粗集理论的结合可提高并对不确定问题的求解能力。     

求解掩盖故障的新方法

针对用单故障策略诊断多故障时可能出错的原因,提出一种确定性的,效率较高的求解掩盖故障的算法;首先通过定义寻找系统中可能存在的隐藏故障集;然后在隐藏故障集中寻找可能存在掩盖故障的故障元件集以及冲突集;其次通过建立冲突集簇的相关矩阵,把求解冲突集簇掩盖故障的问题转换为求解集合覆盖,并用确定性方法DNA粘贴模型来求解,获得全部真实解;最后通过实例验证,该方法是一种并行算法,可行、简单、有效。     

On polynomial time isomorphisms of some new complete sets

In this note we show that the recently discovered NP complete sets arising in number theory, the PTAPE complete sets arising in game theory, and EXTAPE complete sets arising from algebraic word problems are polynomial time isomorphic to the previously known complete sets in the corresponding classes.     

Vague集向Fuzzy集转化的方法模型

结合Vague集理论及投票模型下的解释,对Vague集向Fuzzy集转化的方法进行了分析,提出了一种新的转化方法模型,并从理论上解释了已有方法的合理性与不足。     

On certain problems of the structure of ultrafilters related to extensions of abstract control problems

We study the procedures for constructing ultrafilters in measurable spaces that are in a general sense based on Cartesian products. Our constructions intend to use ultrafilters as generalized elements in extension constructions for abstract reachability problems with asymptotic constraints. Constrains of this kind may arise, for instance, with sequential relaxation of boundary and intermediate conditions in control problems. In this case, families of sets of admissible regular controls in practically interesting cases represent filter bases, which makes it natural to use ultrafilters (maximal filters) that are admissible, in a certain sense, with respect to these families. We assume that counterparts of reachability sets considered in this work are sets in a topological space; the latter may be non-metrizable which occurs, for instance, in typical applications of the pointwise convergence topology. Such a topology may also be useful in impulse control problems, where one studies sheafs of motions as counterparts of reachability sets for exact and approximate satisfaction of trajectory constraints.     

On the reducibility of sets inside NP to sets with low information content

This paper studies for various natural problems in NP whether they can be reduced to sets with low information content, such as branches, P-selective sets, and membership comparable sets. The problems that are studied include the satisfiability problem, the graph automorphism problem, the undirected graph accessibility problem, the determinant function, and all logspace self-reducible languages. Some of these are complete for complexity classes within NP, but for others an exact complexity theoretic characterization is not known. Reducibility of these problems is studied in a general framework introduced in this paper: prover-verifier protocols with low-complexity provers. It is shown that all these natural problems indeed have such protocols. This fact is used to show, for certain reduction types, that these problems are not reducible to sets with low information content unless their complexity is much less than what it is currently believed to be. The general framework is also used to obtain a new characterization of the complexity class is the class of all logspace self-reducible sets in L^L-sel.     

基于类粒度的克隆代码群稳定性实证研究

克隆代码研究与软件工程中的各类问题密切相关.现有的克隆代码稳定性研究主要集中于克隆代码与非克隆代码的比较以及不同克隆代码类型之间的比较,少有研究对克隆代码的稳定性与克隆群所分布的面向对象类进行相关分析.基于面向对象类的粒度进行了克隆群稳定性实证研究,设计了4项与克隆群稳定性相关的研究问题,围绕这些研究问题,将克隆群分为...