解决矛盾问题的可拓模型与可拓知识的研究

可拓学是解决矛盾问题的学科,在可拓学的可拓模型原型的基础上,明确了计算机解决矛盾问题的可拓模型,它包括三部分:关联函数、可拓知识和推理算法,其中关联函数和可拓知识对不同的问题需要利用不同的原理,且它们是逐步变化的.在可拓知识中,关联函数的可拓变换需要通过计算证明其值是逐步增加的.这样,矛盾问题在计算机中才能得到解决.本文通过多个实例来说明解决矛盾问题的可拓模型及可拓知识的建立和实现.     

基于可拓集合的动态分类及其UML表示方法研究

可拓集合是分析事物的可变性和多变性的理论基础 .本文首先建立了物元与类之间的联系 ,在可拓集合零界的基础上建立了过渡类 ,为了形式化描述出多值分类 ,对关联函数进行约束 ,并利用可拓域与物元变换探讨了动态分类机制 ,最后采用 UML构造型扩展机制对动态分类的表示问题进行初步的研究 .     

可拓积分的极限定理

在可拓集合论、可拓测度论的基础上给出了可拓积分的概念，讨论了它的三个性质，并研究了可测函数的可拓积分的极限定理．     

正域为无限区间的初等关联函数构造

定义在有限区间上的初等关联函数在可拓论中发挥了重要作用.然而,对于一些量值表现为越大越好或越小越优的特征,如何描述事物的可拓域未有探讨.构造了正域为无限区间的初等关联函数并得到若干性质.模拟案例说明该函数的实用性.该关联函数符合数据处理的无量纲化和一致化要求,能消除数量量级和量纲的影响;使基元特征量值表现的四种类型都可以用初等关联函数表示,拓宽了关联函数描述事物符合要求程度的范围;正域为有限区间且在端点取最大值的初等关联函数是该函数的特例.     

可拓目标规划方法及其应用

本文基于可拓数学和物元分析理论，介绍了可拓集合、关联函数和可拓满意点等概念，提出了可拓优化的概念，建立了可拓目标规划模型，给出了可拓目标规划方法的算法．实例表明，可拓目标规划方法有一定的实用性．     

一元关联函数的可拓变换及其在昆虫种群生态学中的应用

本文依据一元关联函数的基本概念和初等关联函数的可拓变换定义 ,首次将关联函数的可拓变换应用于豆田天敌蝽类的生态研究 ,为控制害虫发生 ,更好地保护维持生态平衡的重要天敌类群提供理论根据 .     

求解不等式约束优化的可拓遗传算法

提出了求解不等式约束优化问题的可拓遗传算法.分别考虑种群中的可行解和不可行解,建立可拓关联函数对不可行解的优劣程度进行可拓评价,然后采用精英选择策略,确保每次迭代中均有一定数量和质量的不可行解被选择,从而避免种群陷入局部最优.引入了高斯变异维持种群多样性,提高算法搜索速度.通过对两个测试问题的实验和分析,验证了可拓遗传算法的可行性和有效性.     

三参数区间数下基于映射的可拓区间简单关联函数决策分析方法北大核心CSCD

针对属性值为三参数区数的多属性决策问题,文章提出了一种新的基于可拓区间简单关联度的多属性决策方法和框架.该方法定义了可拓三参数区间简单关联函数表达式,同时集成了区间计算和态度函数,并通过映射函数使得简单关联函数具备非线性的表达能力.由于态度函数能够较精确地反映决策者对各评价值的倾向态度,该方法通过态度函数的设置进行决策的不确定性分析,还能用可拓移动变换对决策进行动态性分析和规则发现.最后,通过算例分析说明了该方法的合理性和稳定性.     

可拓数据挖掘研究进展

可拓学研究用形式化模型解决矛盾问题的理论与方法,可拓数据挖掘是可拓学和数据挖掘结合的产物,它探讨利用可拓学方法和数据挖掘技术,去挖掘数据库中与可拓变换有关的知识,包括可拓分类知识、传导知识等可拓知识.随着经济全球化的推进,环境的多变促使了信息和知识的更新周期缩短,创新和解决矛盾问题越来越成为各行各业的重要工作.因此,如何挖掘可拓知识就成为数据挖掘研究的重要任务.研究表明,可拓数据挖掘将具有广阔的应用前景.将介绍可拓数据挖掘的集合论基础、基本知识和目前研究的主要内容,并提出今后需要进一步探讨的问题及其发展前景.     

多评价特征基元可拓集研究

在单评价特征基元可拓集的基础上,研究多评价特征基元可拓集的构造方法及其关联函数的建立方法,为多特征综合评价和多特征不相容问题求解提供理论依据和可操作的形式化、定量化方法,使多特征不相容问题的智能化处理成为可能.     

Computational Aspects of Nonparametric Bayesian Analysis with Applications to the Modeling of Multiple Binary Sequences

Abstract

We consider Markov mixture models for multiple longitudinal binary sequences. Prior uncertainty in the mixing distribution is characterized by a Dirichlet process centered on a matrix beta measure. We use this setting to evaluate and compare the performance of three competing algorithms that arise more generally in Dirichlet process mixture calculations: sequential imputations, Gibbs sampling, and a predictive recursion, for which an extension of the sequential calculations is introduced. This facilitates the estimation of quantities related to clustering structure which is not available in the original formulation. A numerical comparison is carried out in three examples. Our findings suggest that the sequential imputations method is most useful for relatively small problems, and that the predictive recursion can be an efficient preliminary tool for more reliable, but computationally intensive, Gibbs sampling implementations.     

基于可拓策略生成技术的商品搜索服务改进研究

购买者在使用商品搜索服务时所得搜索结果数量不符合其主观要求是一个典型而普遍的矛盾问题.在分析矛盾问题的基础上,提出以可拓策略生成技术改进商品搜索服务的方法.该方法通过对购买者提出的搜索要求进行发散分析及相关分析,以形成各种可能变换,并依据关联函数寻求问题的解变换,以及利用评价函数对解变换进行优选.给出了关于策略生成的基本算法,并实现于笔记本电脑导购网站平台上.实验及测试结果表明,系统能有效生成矛盾问题的解变换,从而改进了搜索服务的质量.     

Regularization of optimal design problems for bars and plates,part 2

For the problems of optimal design considered in Ref. 1, contradictions arising in the necessary conditions of optimality are eliminated by suitable extension of the initially given class of admissible materials. The extended class includes composites of some special (layered) microstructure. Elastic properties of such composites are described, and alternative (regularized) formulations of the optimal design problems are given. Necessary conditions of Weierstrass are shown to be satisfied, both for the case in which the strip of variations is small compared with the width of the layers and for the opposite case. Numerical results are given for the regularized problem of a bar of extremal torsional rigidity.The authors are indebted to Dr. N. A. Lavrov for performing numerical calculations.     

Normally Admissible Stratifications and Calculation of Normal Cones to a Finite Union of Polyhedral Sets

This paper considers computation of Fréchet and limiting normal cones to a finite union of polyhedra. To this aim, we introduce a new concept of normally admissible stratification which is convenient for calculations of such cones and provide its basic properties. We further derive formulas for the above mentioned cones and compare our approach to those already known in the literature. Finally, we apply this approach to a class of time dependent problems and provide an illustration on a special structure arising in delamination modeling.     

Automatic step size and order control in one-step collocation methods with higher derivatives

On the basis of symmetric E-methods with higher derivatives having the convergence order four, six, or eight, implicit extrapolation schemes are constructed for the numerical solution of ordinary differential equations. The combined step size and order control used in these schemes implements an automatic global error control in the extrapolation E-methods, which makes it possible to solve differential problems in automatic mode up to the accuracy specified by the user (without taking into account round-off errors). The theory of adjoint and symmetric methods presented in this paper is an extension of the results that are well known for the conventional Runge-Kutta schemes to methods involving higher derivatives. Since the implicit extrapolation based on multi-stage Runge-Kutta methods can be very time consuming, special emphasis is made on the efficiency of calculations. All the theoretical conclusions of this paper are confirmed by the numerical results obtained for test problems.     

Extension of high‐order compact schemes to time‐dependent problems

In this article, we present an extension of our previous approaches for steady‐state higher‐order compact (HOC) difference methods to time‐dependent problems. The formulation also provides a framework for similar treatment of other HOC spatial schemes. A stability analysis is provided for transient convection‐diffusion in 1D and transient diffusion in 2D. Supporting numerical experiments are included to illustrate stability and accuracy as well as oscillatory and dissipative behavior. © 2001 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 17: 657–672, 2001     

Generalization of a Relaxation Scheme for Systems of Forced Nonlinear Hyperbolic Conservation Laws with Spatially Dependent Flux Functions

A generalization of a finite difference method for calculating numerical solutions to systems of nonlinear hyperbolic conservation laws in one spatial variable is investigated. A previously developed numerical technique called the relaxation method is modified from its initial application to solve initial value problems for systems of nonlinear hyperbolic conservation laws. The relaxation method is generalized in three ways herein to include problems involving any combination of the following factors: systems of nonlinear hyperbolic conservation laws with spatially dependent flux functions, nonzero forcing terms, and correctly posed boundary values. An initial value problem for the forced inviscid Burgers' equation is used as an example to show excellent agreement between theoretical solutions and numerical calculations. An initial boundary value problem consisting of a system of four partial differential equations based on the two-layer shallow-water equations is solved numerically to display a more general applicability of the method than was previously known.     

Deterministic global optimization in ab-initio quantum chemistry

A large number of problems in ab-initio quantum chemistry involve finding the global minimum of the total system energy. These problems are traditionally solved by numerical approaches equivalent to local optimization. While these approaches are relatively efficient, they do not provide guarantees of global optimality unless a starting point sufficiently close to the global minimum is known apriori. Due to the enormous amount of computational effort required to solve these problems, more mathematically rigorous alternatives have so far received very little attention. Taking the above issue into consideration, this paper explores the use of deterministic global optimization in the context of Hartree-Fock theory, an important mathematical model applied in many quantum chemistry methods. In particular, it presents a general purpose approach for generating linear relaxations for problems arising from Hartree-Fock theory. This was then implemented as an extension to the ${{\tt COUENNE}}$ (Convex Over and Under ENvelopes for Nonlinear Estimation) branch and bound mixed integer non-linear programs solver. Proof of concept calculations that simultaneously optimise the orbital coefficients and the location of the nuclei in closed-shell Hartree-Fock calculations are presented and discussed.