基于二维二元语义和模糊AHP-TODIM的低碳供应商选择方法

针对专家给出二维语言评价信息的低碳供应商评选问题,提出一种基于二维二元语义和模糊AHP-TODIM的方法。该方法首先提出改进的二元语义模型,基于此定义二维二元语义及其加权平均算子。接着构建低碳供应商评价的指标体系。最后,将专家给出的二维语言评价信息转化为二维二元语义,使用模糊AHP法计算指标权重,并利用二维二元语义加权平均算子集结信息,在此基础上将TODIM方法扩展到二维二元语义环境以获取低碳供应商排序。案例分析说明了所提出的方法的有效性。     

凸多边形切割方法

本文讨论了二维平面上给定区域内的凸多边形切割问题 .按“顶点度数”该问题可以分为两种类型 .在两种类型下并给出了凸多边形的简单切割方法 .     

Area-efficient algorithms for straight-line tree drawings

We investigate several straight-line drawing problems for bounded-degree trees in the integer grid without edge crossings under various types of drawings: (1) upward drawings whose edges are drawn as vertically monotone chains, a sequence of line segments, from a parent to its children, (2) order-preserving drawings which preserve the left-to-right order of the children of each vertex, and (3) orthogonal straight-line drawings in which each edge is represented as a single vertical or horizontal segment.

Main contribution of this paper is a unified framework to reduce the upper bound on area for the straight-line drawing problems from O(nlogn) (Crescenzi et al., 1992) to O(nloglogn). This is the first solution of an open problem stated by Garg et al. (1993). We also show that any binary tree admits a small area drawing satisfying any given aspect ratio in the orthogonal straight-line drawing type.

Our results are briefly summarized as follows. Let T be a bounded-degree tree with n vertices. Firstly, we show that T admits an upward straight-line drawing with area O(nloglogn). If T is binary, we can obtain an O(nloglogn)-area upward orthogonal drawing in which each edge is drawn as a chain of at most two orthogonal segments and which has O(n/logn) bends in total. Secondly, we present O(nloglogn)-area (respectively, -volume) orthogonal straight-line drawing algorithms for binary trees with arbitrary aspect ratios in 2-dimension (respectively, 3-dimension). Finally, we present some experimental results which shows the area requirements, in practice, for (order-preserving) upward drawing are much smaller than theoretical bounds obtained through analysis.     

2-Dimension from the Topological Viewpoint

In this paper we study the 2-dimension of a finite poset from the topological point of view. We use homotopy theory of finite topological spaces and the concept of a beat point to improve the classical results on 2-dimension, giving a more complete answer to the problem of all possible 2-dimensions of an n-point poset.      

一类时滞反应扩散方程的周期解和概周期解

通过构造上、下控制函数，结合上、下解方法及相应的单调迭代方法研究了一类时滞反应扩散方程，证明了在反应项非单调时，如果一雏边值问题存在一对周期（或概周期）上、下解，则方程一定存在唯一的周期（或概周期）解．并给出了二维边值问题周期（或概周期）解存在唯一性的充分条件．推广了已有的一些结果。     

相对于余挠对的维数(英文)

本文介绍了右R-模的F-维数(C-维数)以及环R上整体F-维数(C-维数).利用同调方法,给出了平坦模维数的新刻画.另外,得到了von Neumann正则环和完全环的新刻画.     

A conservative parallel difference method for 2-dimension diffusion equation

In this paper, a conservative parallel difference scheme, which is based on domain decomposition method, for 2-dimension diffusion equation is proposed. In the construction of this scheme, we use the numerical solution on the previous time step to give a weighted approximation of the numerical flux. Then the sub-problems with Neumann boundary are computed by fully implicit scheme. What is more, only local message communication is needed in the program. We use the method of discrete functional analysis to give the proof of the unconditional stability and second-order convergence accuracy. Some numerical tests are given to verify the theory results.     

Variational approach to various nonlinear problems in geometry and physics

In this survey, we will summarize the existence results of nonlinear partial differential equations which arises from geometry or physics by using variational method. We use the method to study Kazdan-Warner problem, Chern-Simons-Higgs model, Toda systems, and the prescribed Q-curvature problem in 4-dimension.      

Optimization of structural design

Typical problems of optimal structural design are discussed to indicate mathematical techniques used in this field. An introductory example (Section 2) concerns the design of a beam for prescribed maximal deflection and shows how suitable discretization may lead to a problem of nonlinear programming, in this case, convex programming. The problem of optimal layout of a truss (Section 3) is discussed at some length. A new method of establishing optimality criteria (Section 4) is illustrated by the optimal design of a statically indeterminate beam of segmentwise constant or continuously varying cross section for given deflection under a single concentrated load. Other applications of this method (Section 5) are briefly discussed, and a simple example of multipurpose design (Section 6) concludes the paper.     

两类非线性发展方程的新的显式解

应用指数函数法,得到了(1+1)维Sinh-Gordon方程、(2+1)维Boiti-Leon-Manna-Pempinelli(BLMP)方程的一些新的显式解.