基于Vague-Fuzzy理论的深基坑支护方案评价应用

深基坑支护决策是典型的非结构或半结构决策问题,对其进行量化研究对于实现工程方案的科学决策具有重要的理论意义与实践价值.采用基于Vague-Fuzzy理论的深基坑支护决策评价方法.在研究评价指标Vague值确定方法的基础上,建立了Vague集近似转化为Fuzzy集的方法与模型,得到的模糊隶属度并可根据参数k的数学性质有目的地进行调整,从而实现深基坑支护决策的模糊评价.以某大厦深基坑支护拟采用的4种方案评价为例,对所建模型进行了实例研究,结果表明该方法是科学、实用的.     

模糊随机环境下的连续型变额生命年金

采用模糊随机理论,构建连续支付型变额生命年金模型.假定利率为三角模糊数,死亡率为随机变量.结合精算理论,给出了连续支付型变额生命年金精算现值的期望、方差以及分布函数和分位数的模糊表达式.最后,通过实证分析计算出一个在养老保险中常见的生命年金的相关值,验证模型的可行性.     

基于三角模糊数的凸合成模糊对策解的结构

将凸合成模糊对策的特征函数用三角模糊数的形式表示出来,并以三角模糊数表示局中人的参与度,从而建立了一个新的凸合成模糊合作对策的模型.在此模型的基础上,给出了凸合成模糊对策的三角核心和三角稳定集,并证明了上述解可由子对策的核心和稳定集表达出来.     

λ-模糊粗传递模型及其特性

根据实际中的三种信息传递情况,本文利用粗糙模糊集、模糊子集、截集等理论讨论了λ-模糊粗传递模型的特性,得到了λ-模糊粗传递模型与模糊粗传递模型的关系,给出了两种分解定理.以此为基础,分析了λ-模糊粗传递模型中信息的变化情况,给出了信息精确传递的条件,进一步得出了提高信息传递精确性的方法.λ-模糊粗传递是粗糙模糊集的一种新的应用.     

基于熵权法和多层次分析法的水环境模糊综合评价研究

结合我国水环境的现状和特点构建了水环境承载能力指标评价体系,运用熵权法确定各评价指标的客观权重,将其与多层次分析法的主观权重进行合成,根据该权值对水环境进行模糊综合评价,评价结果表明,模型比单一的模糊综合评价法能够符合水环境的实际状况,从而为管理决策提供科学有效的依据.在综合评价的基础上,提出了改善水环境承载能力的建议.     

模糊参数软区间集及其应用

将模糊参数软集与区间集相结合,定义了模糊参数软区间集的概念,研究了模糊参数软区间集的运算及其性质.然后,给出模糊参数软区间集在决策中的应用,说明了方法的可行性.推广了软区间集的相关研究结果.     

可变集—可变模糊集的发展及其在水资源系统中的应用

将可变模糊集理论,从模糊系统发展到可变模糊一清晰系统.给出可变集的对立公理与可变集定义,给出基于可变集的唯物辩证法三大基本规律的数学定理对立统一、质量互变与否定的否定定理.给出可变集在地区水资源可持续利用程度变化与发展态势的评估价原理、方法与应用实例.不仅对技术科学,而且对哲学等科学均有重要的科学意义.     

集对分析多元模糊评价法在水资源可再生能力评价中应用

水资源可再生能力受多种因素影响,因素间关系错综复杂,水资源可再生能力综合评价是一项复杂的系统工程.以集对分析理论为基础,用新定元准则、主同、超同和同化度等新概念发展集对分析,建立了一种新的流域水资源可再生能力评价模型—集对分析多元模糊评价模型(MFSPAFM).应用该模型对黄河流域及其上、中、下游典型省份的水资源可再生能力进行了综合评价,并与常规集对分析模型和可变模糊等模型评价结果进行了比较.实例应用显示该模型能够真实地反映水资源可再生能力状况,评价结果更符合客观实际.研究表明,集对分析多元模糊评价模型结构简单,计算简洁,可行有效,适用于水资源可再生能力综合评价.     

基于VIKOR和关联系数的犹豫三角模糊语言多属性决策方法

针对属性评价值为犹豫三角模糊语言集的多属性决策问题,提出一种基于VIKOR方法的犹豫三角模糊语言多属性决策方法.首先定义了犹豫三角模糊语言集的相关概念.然后运用VIKOR和关联系数方法,在可接受优势和决策过程稳定的条件下对方案进行择优,在理论分析的基础上,提出了这种新方法的计算步骤.并构建了确定最优属性权重的非线性规划模型,研究了当专家权重和属性权重未知情况下的犹豫三角模糊语言多属性决策方法.最后通过实例说明了该方法的有效性和可行性.     

多粒度模糊粗糙集的表示问题

研究了多粒度模糊粗糙集的表示问题。利用模糊集的分解定理思想首次用截集构造了多粒度模糊粗糙集模型,建立了基于截集的悲观和乐观多粒度模糊粗糙集模型。在该模型中,从模糊集的截集角度定义了悲观及其乐观多粒度模糊粗糙集的上下近似集,解决了多粒度模糊粗糙集的数学结构问题,证明了多粒度模糊粗糙集可以用一簇经典的多粒度粗糙集来表示。最后利用该模型证明了多粒度模糊粗糙集的一些结论。     

Porosity of Self-affine Sets

In this paper, it is proved that any self-affine set satisfying the strong separation condition is uniformly porous. The author constructs a self-affine set which is not porous, although the open set condition holds. Besides, the author also gives a C^1 iterated function system such that its invariant set is not porous.     

Improving an Upper Bound on the Stability Number of a Graph

In previous works an upper bound on the stability number of a graph based on quadratic programming was introduced and several of its properties were given. The graphs for which this bound is attained has been known as graphs with convex-QP stability number. This paper proposes a new upper bound on the stability number whose determination is also done by quadratic programming. It is proved that the new bound improves the above mentioned bound and several computational tests asserting its interest for large graphs are presented. In addition a necessary and sufficient condition for a graph to attain the new bound is proved. As a consequence a graph with convex-QP stability number also attains the new bound. On the other hand it is shown the existence of graphs attaining the new bound that do not belong to the class of graphs with convex-QP stability number. This allows to assert that the class of graphs with convex-QP stability number is strictly included in the class of graphs that attain the introduced bound. Some conclusions and lines for future work finalize the paper.     

Sum of Cantor sets: Self-similarity and measure

In this note it is shown that the sum of two homogeneous Cantor sets is often a uniformly contracting self-similar set and it is given a sufficient condition for such a set to be of Lebesgue measure zero (in fact, of Hausdorff dimension less than one and positive Hausdorff measure at this dimension).

     

随机环境下的一类衍生的ARCH模型的极限行为

提出了随机环境下的幂变换门限自回归条件异方差模型,得出了其以几何速率收敛的充分条件.该模型反映了动力系统受随机环境干扰的现象,能更好的拟合现实世界中的诸多实际问题.另一方面,本文推广了自回归条件异方差模型,改善了模型的适应性程度,能够更好地适用于各种不同的金融市场价格行为波动的现象.     

基于粗糙集的铁路客运服务质量改善程度评价模型研究

通过对铁路客运服务质量的改善情况的研究,提出了基于粗糙集和马尔可夫过程的铁路客运服务质量改善程度评价模型.该模型利用马尔可夫过程得到各个指标的改善状况;引入粗糙集确定的指标权重得到服务质量总体改善情况.通过对调查问卷的数据进行分析,验证了以上模型的科学性和可行性.     

Tensammetric studies on corrosion inhibitors

The study of adsorption by the alternating current polarographic method is known as ‘tensammetry’. This technique has been extended to the study of the adsorption characteristics of organic corrosion inhibitors with a view to elucidate the mechanism of inhibition by such compounds. The usefulness of such studies in elucidating the mechanism of inhibition by dicyclohexylamine nitrite, which is now widely used as a vapour phase corrosion inhibitor, is brought out. For this purpose, results obtained by tensammetric studies have been compared with potential measurements on the one hand and direct corrosion tests on the other and discussed.     

Computing the minimal covering set

We present the first polynomial-time algorithm for computing the minimal covering set of a (weak) tournament. The algorithm draws upon a linear programming formulation of a subset of the minimal covering set known as the essential set. On the other hand, we show that no efficient algorithm exists for two variants of the minimal covering set–the minimal upward covering set and the minimal downward covering set–unless P equals NP. Finally, we observe a strong relationship between von Neumann–Morgenstern stable sets and upward covering on the one hand, and the Banks set and downward covering on the other.     

基于双论域模糊粗糙集的应急决策模型与方法

以突发危机事件应急决策为应用背景,讨论了双论域上模糊粗糙集的基本理论,建立了基于模糊相容关系的双论域模糊粗糙集模型. 在此基础上,把突发危机事件应急决策转化为一个具有模糊决策对象的双论域决策近似空间上的粗糙近似问题,构建了基于双论域模糊粗糙集的应急决策模型.首先在双论域近似空间中计算模糊决策对象的上(下)近似,进而结合经典非确定型决策的思想给出了突发危机事件应急决策的规则.同时,给出了模型的算法.该模型给出了一种在不完全信息环境下应急决策的方法,给出了在充分考虑决策者个人偏好信息基础上的决策置信度以及最优决策规则.该方法能够比较充分地符合应急决策信息不充分、资源有限以及时间紧迫的基本特征, 进而对突发危机事件应急决策提供科学的理论基础和现实的决策方法.最后,通过应用算例说明了模型的应用过程,结果验证了本文给出模型的有效性。     

基于动态集对同一度的政府政绩综合评价方法研究

政绩考核是对政府领导执政能力的综合评价,其方法直接影响着政府领导的发展观和政绩观.因此,本文依据科学发展观的要求,建立了客观、科学、可行的考核体系,将集对分析的同一度方法应用到政绩考核中.同时,对集对分析的同一度方法进行了改进——动态化,使其应用更科学、实用.     

Constraint Handling in Genetic Algorithms: The Set Partitioning Problem

In this paper we present a genetic algorithm-based heuristic for solving the set partitioning problem (SPP). The SPP is an important combinatorial optimisation problem used by many airlines as a mathematical model for flight crew scheduling.A key feature of the SPP is that it is a highly constrained problem, all constraints being equalities. New genetic algorithm (GA) components: separate fitness and unfitness scores, adaptive mutation, matching selection and ranking replacement, are introduced to enable a GA to effectively handle such constraints. These components are generalisable to any GA for constrained problems.We present a steady-state GA in conjunction with a specialised heuristic improvement operator for solving the SPP. The performance of our algorithm is evaluated on a large set of real-world problems. Computational results show that the genetic algorithm-based heuristic is capable of producing high-quality solutions.