n人可信策略博弈

本文研究模糊支付n人策略博弈,由于支付信息的不完全性,模糊支付可视为模糊变量。基于可信性理论,在不同的决策环境中引入模糊排序方法表征支付者行为。因此,本文定义四种可信均衡,等价于纳什均衡。其次证明了可信均衡存在性定理。除此之外,在现实策略博弈中用算例说明四种可信均衡的现实意义。最后讨论四种可信均衡之间可能存在的关系。     

On Felbin-type Fuzzy 2-normed Spaces and Its Fuzzy Ⅰ-topologies

In this paper using the concept of Felbin-type fuzzy 2-norm ‖.,.‖ on a vector space,two Ⅰ-topologies τ‖.,.‖ and τ*‖.,.‖ is constructed.After making our elementary observations on this fuzzy Ⅰ-topologie...     

Hopf-algebraic renormalization of QED in the linear covariant gauge

In the context of massless quantum electrodynamics (QED) with a linear covariant gauge fixing, the connection between the counterterm and the Hopf-algebraic approach to renormalization is examined. The coproduct formula of Green’s functions contains two invariant charges, which give rise to different renormalization group functions. All formulas are tested by explicit computations to third loop order. The possibility of a finite electron self-energy by fixing a generalized linear covariant gauge is discussed. An analysis of subdivergences leads to the conclusion that such a gauge only exists in quenched QED.     

Linguistic cost-sensitive learning of genetic fuzzy classifiers for imprecise data

Cost-sensitive classification is based on a set of weights defining the expected cost of misclassifying an object. In this paper, a Genetic Fuzzy Classifier, which is able to extract fuzzy rules from interval or fuzzy valued data, is extended to this type of classification. This extension consists in enclosing the estimation of the expected misclassification risk of a classifier, when assessed on low quality data, in an interval or a fuzzy number. A cooperative-competitive genetic algorithm searches for the knowledge base whose fitness is primal with respect to a precedence relation between the values of this interval or fuzzy valued risk. In addition to this, the numerical estimation of this risk depends on the entrywise product of cost and confusion matrices. These have been, in turn, generalized to vague data. The flexible assignment of values to the cost function is also tackled, owing to the fact that the use of linguistic terms in the definition of the misclassification cost is allowed.     

共形空间${\mathbb Q}^{n+1}_1$中类空超曲面的拼挤问题

通过对第二共形基本形式的模长平方作拼挤,给出Clifford超柱面的一个共形特征.     

Handling uncertainties in toxicity modelling using a fuzzy filter

A fundamental concern in the Quantitative Structure-Activity Relationship approach to toxicity evaluation is the generalization of the model over a wide range of compounds. The data driven modelling of toxicity, due to the complex and ill-defined nature of eco-toxicological systems, is an uncertain process. The development of a toxicity predicting model without considering uncertainties may produce a model with a low generalization performance. This study presents a novel approach to toxicity modelling that handles the involved uncertainties using a fuzzy filter, and thus improves the generalization capability of the model. The method is illustrated by considering a data set dealing with the fathead minnow (Pimephales promelas) toxicity of 568 organic compounds.     

Fuzzy-PID分级控制变水量空调系统温度的研究

针对变水量空调系统温度控制的时变、大滞后、非线性特点,结合模糊控制和PID控制,设计了基于模糊规则切换的Fuzzy-PID分级控制器,并在Matlab/Simulink软件上进行了仿真。仿真结果表明,控制器同时具有模糊控制超调量小、鲁棒性好和PID控制精度高、响应速度快的优点。     

分布式航天器真空热试验测控系统设计

针对航天器真空热试验对数据采集、温度控制及系统功能的要求,设计开发了一套基于LXI总线的分布式测控系统。针对目前控制系统对于温度控制系统大滞后、非线性的控制性能不佳的缺点,采用模糊自整定PID算法提升了当前控制系统的控制品质,实现了对航天器的外热流模拟与温度控制。实际运行结果表明,该系统具有可靠性高、扩展性强、控制精度高等优点,并且试验准备时间比原有系统减少一半以上,提高了试验人员的工作效率。     

Cycle-maximal triangle-free graphs

We conjecture that the balanced complete bipartite graph _{K⌊n/2⌋,⌈n/2⌉}$K_{\lfloor n/2\rfloor ,\lceil n/2\rceil }$ contains more cycles than any other n$n$-vertex triangle-free graph, and we make some progress toward proving this. We give equivalent conditions for cycle-maximal triangle-free graphs; show bounds on the numbers of cycles in graphs depending on numbers of vertices and edges, girth, and homomorphisms to small fixed graphs; and use the bounds to show that among regular graphs, the conjecture holds. We also consider graphs that are close to being regular, with the minimum and maximum degrees differing by at most a positive integer k$k$. For k=1$k=1$, we show that any such counterexamples have n≤91$n\le 91$ and are not homomorphic to _C5$C_5$; and for any fixed k$k$ there exists a finite upper bound on the number of vertices in a counterexample. Finally, we describe an algorithm for efficiently computing the matrix permanent (a #P$\#P$-complete problem in general) in a special case used by our bounds.