Proper and Unit Trapezoid Orders and Graphs

We show that the class of trapezoid orders in which no trapezoid strictly contains any other trapezoid strictly contains the class of trapezoid orders in which every trapezoid can be drawn with unit area. This is different from the case of interval orders, where the class of proper interval orders is exactly the same as the class of unit interval orders.     

Being a Proper Trapezoid Ordered Set Is a Comparability Invariant

It is proved that if we replace an autonomous subset of a finite proper trapezoid ordered set with a proper trapezoid ordered set, then we obtain a proper trapezoid ordered set provided the autonomous subset is not an antichain, and analogously in the k-dimensional case. As corollaries we obtain that being a proper trapezoid ordered set is a comparability invariant, more generally, proper interval dimension is a comparability invariant.     

推广的梯形公式中间点的渐近性质

得到梯形公式和推广的梯形公式中间点的渐近性质的主要结果是limx→aξ-a/x-a=6/(n+3)(n+2)~(1/n).     

中矩形公式与梯形公式的注记

将数值积分中的中矩形公式与梯形公式推广到两个函数的情形,并讨论了中间值的渐近性质.     

Lipschitz条件下的加权梯形不等式和中点不等式

利用与一阶导数有关的积分恒等式,并通过引入参数求最值,在一 阶导函数满足Lipschitz条件的情况下,给出加权梯形不等式和中点不等式.     

带有梯形模糊数的均值-方差投资组合模型比较分析

采用梯形模糊数来描述证券的收益率,并建立基于梯形模糊数的收益最大化单目标均值-方差模型、风险最小化单目标均值-方差模型、和收益最大化风险最小化的双目标均值-方差模型.对上述三种模型进行实例分析,讨论投资比例系数上界为1和0.7两种不同情况下三种模型的对比,进而证明模型的可行性以及分析不同模型之间的差异性.     

Optimal Sequential and Parallel Algorithms to Compute All Cut Vertices on Trapezoid Graphs

In this paper, a sequential algorithm is presented to find all cut-vertices on trapezoid graphs. To every trapezoid graph G there is a corresponding trapezoid representation. If all the 4n corner points of n trapezoids, in a trapezoid representation of a trapezoid graph G with n vertices, are given, then the proposed sequential algorithm runs in O(n) time. Parallel implementation of this algorithm can be done in O(log n) time using O(n/ log n) processors on an EREW PRAM model.     

An Efficient Algorithm for Finding a Maximum Weight k-Independent Set on Trapezoid Graphs

The maximum weight k-independent set problem has applications in many practical problems like k-machines job scheduling problem, k-colourable subgraph problem, VLSI design layout and routing problem. Based on DAG (Directed Acyclic Graph) approach, an O(kn ²) time sequential algorithm is designed in this paper to solve the maximum weight k-independent set problem on weighted trapezoid graphs. The weights considered here are all non-negative and associated with each of the n vertices of the graph.     

基于改进得分函数的直觉梯形模糊数群体多属性决策方法

为考虑群体多属性决策问题中决策人的风险偏好,在直觉梯形模糊数的基础上,利用连续区间有序加权平均算子对直觉梯形模糊数进行化简,使其转换成直觉模糊数。并基于此提出了一种全新的得分函数。从而得到了一种全新的群体多属性决策方法,将其应用于具体算例中,给出了该方法的具体步骤并证明了有效性。     

MULTIFRACTAL FORMALISMS：BOXED VERSUS CENTERED INTERVALS

There are mainly two approaches to the multifractal analysis of measures. The first one, which is used in applications and in studying problems arising from dynamical systems, uses a hierarchy of boxes. The second one, which is more satisfactory from the viewpoint of geometric measure theory, uses more intrinsicconcepts. This article is an account of a work by J. Barral, F. Ben Nasr, and J. Peyriere [3] which pro-vides a bridge between these two theories.     

Classification of Krasner Hyperfields of Order 4

In this paper, first we introduce n-polygroups and characterize 2-polygroups of order 4 up to isomorphism. Then using 2-polygroups we introduce 2-Krasner hyperfields and we show that there exactly exists one 2-Krasner hyperfield of order 4. Moreover, we propose a hyperfield of order 4 which is not as a quotient hyperfield F/G. Finally, some programs written in MATLAB which are based on obtained results compute the number of polygroups, weak polygroups and Krasner hyperfields of order 4 up to isomorphism.     

有限区间内四阶样条小波的构造

用有限区间上的截断4阶B样条,构造了有限区间上的4阶样条小波。这些小波由边界小波和内部小波组成,对某一尺度,它们组成了有限维的小波空间。于是,任何有限区间上的函数皆可表示为该区间上的尺度函数和小波函数的有限和,即小波级数,这克服了用无穷区间上的小波进行有限信号处理时,在边界上误差较大的不足,同时将该小波用于偏微分方程具有同样重要的意义。     

基于区间二型梯形模糊集的应急物资储备动态协同决策模型

重大灾害下应急物资储备决策是阻止突发灾难蔓延的有效手段之一。针对救灾信息具备不确定性与复杂性特点,构建基于区间二型梯形模糊集的应急物资储备动态协同决策模型,并给出应急物资储备策略。利用区间二型模糊集理论的决策方案并结合比例分析法(COPRAS),构建常态环境下应急物资供应商选择的群决策模型,解决不相容群决策属性之间的冲突问题;进而,充分考虑“救灾阶段性动态时间因素”对储备决策的影响,构建动态救灾环境下应急物资储备结构模糊优化模型,实现常态决策与非常态应急决策之间的动态协同;最后,以2012年云南丽江“6.14”突发特大山洪灾害为实例进行数值分析,验证该动态协同决策模型的合理性与可行性,能有效解决动态救灾环境下应急物资储备结构优化问题。     

A Homological Lower Bound for Order Dimension of Lattices

We prove that if a finite lattice L has order dimension at most d, then the homology of the order complex of its proper part L vanishes in dimensions d – 1 and higher. If L can be embedded as a join-sublattice in N ^d , then L actually has the homotopy type of a simplicial complex with d vertices.     

Convex Drawings of Planar Graphs and the Order Dimension of 3-Polytopes

We define an analogue of Schnyder's tree decompositions for 3-connected planar graphs. Based on this structure we obtain: Let G be a 3-connected planar graph with f faces, then G has a convex drawing with its vertices embedded on the (f–1)×(f–1) grid. Let G be a 3-connected planar graph. The dimension of the incidence order of vertices, edges and bounded faces of G is at most 3.The second result is originally due to Brightwell and Trotter. Here we give a substantially simpler proof.     

非线性支持向量分类机解的二阶充分条件

优化问题解的二阶充分条件是研究其灵敏度分析的基础,支持向量分类机是新的数据挖掘优化问题.给出了支持向量分类机的解满足二阶充分条件成立定理;定理的假设条件是很弱的,用支持向量分类机求解实际问题,通常总假定这一条件成立;特别地,对线性可分支持向量机问题,其解满足二阶充分条件成为当然成立的事实.     

拟线性三阶演化方程的初步群分类

利用古典无穷小算法、等价性变换技巧和有限维抽象李代数的分类理论,给出了一般拟线性三阶演化方程在半单和一维至四维可解李代数下不变的群分类.证明了只存在3个不等价的方程在三维单李代数下不变,而且进一步证明在所有半单李代数下不变的不等价方程只有这3个.另外,还证明了存在2个、5个、29个和26个不等价的方程,分别在一维至四维可解李代数下不变.     

关于非退化的二阶曲线的分类研究

从抛物线的一种判定方法出发,借助于欧氏平面上非退化的二阶曲线的度量性质,通过对欧氏平面上非退化二阶曲线类型的研究,探究出确定非退化二阶曲线类型的若干定理。     

判定二阶线性矩阵微分系统振动性的新准则

利用一个线性变换给出了二阶矩陈微分系统(P(t)X′(t))′+Q(t)X(t)=0 t∈[t_0,∞)的振动性的新的判定准则,从而推广和改进了前人的结论.     

Order Dimension,Strong Bruhat Order and Lattice Properties for Posets

We determine the order dimension of the strong Bruhat order on finite Coxeter groups of types A, B and H. The order dimension is determined using a generalization of a theorem of Dilworth: dim (P)=width(Irr(P)), whenever P satisfies a simple order-theoretic condition called here the dissective property (or clivage). The result for dissective posets follows from an upper bound and lower bound on the dimension of any finite poset. The dissective property is related, via MacNeille completion, to the distributive property of lattices. We show a similar connection between quotients of the strong Bruhat order with respect to parabolic subgroups and lattice quotients.