近于凸函数新子类的偏差定理和卷积性质

引进了近于凸函数的新子类.利用从属关系得到了偏差定理和卷积性质.所得结果推广了一些作者的相关结果,并得到有趣的新结果.     

关于拟p-内射模的一些研究(英文)

得到了关于拟p-内射模的一些结果,这些结果总结并且推广了p-内射环的一些结果.     

■混合序列加权和的强稳定性(英文)

本文给出了■混合序列加权和的强稳定性的一些结果,同时也给出了■混合序列的强大数定律的若干新结果,这些结果推广了独立随机变量序列的相应结果.     

模糊群决策结果的可信性评估

模糊数是群决策中常用的决策结果表达形式.研究了模糊群决策结果的可信性评估问题.认为群决策结果的可信性与模糊群决策结果的模糊度和一致度存在强相关,因此,模糊群决策结果可信性评估主要就是对群决策结果的模糊度和一致度的计算,创新提出了基于群隶属函数的模糊度和一致度的计算方法,并给出了基于模糊度和一致度的专家模糊数决策结果综合评价值的计算方法,最后,在此基础上求得专家模糊评估结果的可信度和群决策结果的可信度.     

语言分布评估信息下的群决策方法及其群体一致性分析

本文提出了基于语言分布评估加权平均(DAWA)算子的多属性群决策方法;定义了个体决策者评价结果与决策群体评价结果的次序一致性和数值一致性测度,以此分析决策群体评价结果的可靠性;最后,通过具体实例验证了群决策方法的有效性和实用性,分析了个体决策者评价结果与决策群体评价结果的次序一致性和数值一致性。     

NOD序列加权和的强收敛速度

该文研究了NOD序列加权和的强收敛速度, 获得了一些新的完全收敛性的结果. 该文的结果推广了陈瑞林$^{[1]}$在NA情形时的结果,部分推广了Stout$^{[2]}$在独立同分布情形时的结果.     

某些差分多项式的亏量

Halburd和Korhonen指出研究复域差分的值分布问题对进一步研究复域差分与差分方程具有十分重要的意义.本文得到了关于有限级亚纯函数的差分多项式的亏量为一些结果,其中部分结果可视为微分多项式相应结果的差分模拟.同时,我们在一定条件下给出了经典的Valiron-Mohon'ko定理的一个差分模拟结果,并且作为本文中的一个重要工具出现.这些结果推广了前人已有结果.     

NOD随机变量随机加权部分和的完全收敛性

本文研究了NOD随机变量双下标随机加权部分和的完全收敛性,获得了一些完全矩收敛结果和完全收敛结果,从而获得了Marcinkiewicz-Zygmund型强大数律.我们的结果推广了目前已有的一些结论.进一步,我们给出一些数据模拟工作来展示收敛性结果.     

一类奇异非线性两点边值问题的 Galerkin 解的误差估计

本文对一类奇异两点边值问题采用了对称的Galerkin方法.通过利用Green函数,对线性问题得到了拟最优的最大范数误差估计并将这一结果推广到了非线性问题.本文最后列举了一些数值试验结果,这些结果很好地验证了理论结果.     

关于广义Muirhead平均的Schur幂凸性

对广义Muirhead平均的Schur-幂凸性进行了讨论,给出了判定Muirhead平均的Schur-幂凸性的充要条件.结果改进了Chu和Xia在相关文献中的主要结果,Chu和Xia的结果是结果的特例.     

An algorithm for constructing star-shaped drawings of plane graphs

A straight-line planar drawing of a plane graph is called a convex drawing if every facial cycle is drawn as a convex polygon. Convex drawings of graphs is a well-established aesthetic in graph drawing, however not all planar graphs admit a convex drawing. Tutte [W.T. Tutte, Convex representations of graphs, Proc. of London Math. Soc. 10 (3) (1960) 304–320] showed that every triconnected plane graph admits a convex drawing for any given boundary drawn as a convex polygon. Thomassen [C. Thomassen, Plane representations of graphs, in: Progress in Graph Theory, Academic Press, 1984, pp. 43–69] gave a necessary and sufficient condition for a biconnected plane graph with a prescribed convex boundary to have a convex drawing.In this paper, we initiate a new notion of star-shaped drawing of a plane graph as a straight-line planar drawing such that each inner facial cycle is drawn as a star-shaped polygon, and the outer facial cycle is drawn as a convex polygon. A star-shaped drawing is a natural extension of a convex drawing, and a new aesthetic criteria for drawing planar graphs in a convex way as much as possible. We give a sufficient condition for a given set A of corners of a plane graph to admit a star-shaped drawing whose concave corners are given by the corners in A, and present a linear time algorithm for constructing such a star-shaped drawing.     

Box-Rectangular Drawings of Plane Graphs

In this paper we introduce a new drawing style of a plane graph G called a box-rectangular drawing. It is defined to be a drawing of G on an integer grid such that every vertex is drawn as a rectangle, called a box, each edge is drawn as either a horizontal line segment or a vertical line segment, and the contour of each face is drawn as a rectangle. We establish a necessary and sufficient condition for the existence of a box-rectangular drawing of G. We also give a linear-time algorithm to find a box-rectangular drawing of G if it exists.     

On farthest points of sets

For a convex closed bounded set in a Banach space, we study the existence and uniqueness problem for a point of this set that is the farthest point from a given point in space. In terms of the existence and uniqueness of the farthest point, as well as the Lipschitzian dependence of this point on a point in space, we obtain necessary and su.cient conditions for the strong convexity of a set in several infinite-dimensional spaces, in particular, in a Hilbert space. A set representable as the intersection of closed balls of a fixed radius is called a strongly convex set. We show that the condition “for each point in space that is sufficiently far from a set, there exists a unique farthest point of the set” is a criterion for the strong convexity of a set in a finite-dimensional normed space, where the norm ball is a strongly convex set and a generating set.     

The KdV soliton crosses a dissipative and dispersive border

We demonstrate the behavior of the soliton which, while moving in non-dissipative and dispersion-constant medium encounters a finite-width barrier with varying dissipation and/or dispersion; beyond the layer dispersion is constant (but not necessarily of the same value) and dissipation is null. The transmitted wave either retains the form of a soliton (though of different parameters) or scatters a into a number of them. And a reflection wave may be negligible or absent. This models a situation similar to a light passing from a humid air to a dry one through the vapor saturation/condensation area. Some rough estimations for a prediction of an output are given using the relative decay (or accumulation) of the KdV conserved quantities in a dissipative area; in particular for a restriction for a number of solitons in the transmitted signal.     

Scalarization of Henig Proper Efficient Points in a Normed Space

In a general normed space equipped with the order induced by a closed convex cone with a base, using a family of continuous monotone Minkowski functionals and a family of continuous norms, we obtain scalar characterizations of Henig proper efficient points of a general set and a bounded set, respectively. Moreover, we give a scalar characterization of a superefficient point of a set in a normed space equipped with the order induced by a closed convex cone with a bounded base.     

Staircase Parameterization in Dynamical Selection

This paper deals with a variant of a dynamical selection scheme introduced by Attouch and Cominetti for ill-posed convex minimization which combines approximation with the steepest descent method by mean of a suitable parameterization of the approximation parameter as a function of the time. This variant applies to a general inclusion with a maximal monotone operator by mean of a staircase parameterization. A discrete analogue is also considered. Applications to selecting a particular zero of a maximal monotone operator or a particular fixed point of a nonexpansive mapping via regularization techniques are presented. Finally, the alternative use of well-posedness by perturbations is discussed.     

Enumerating bases of self-dual matroids

We define involutively self-dual matroids and prove that an enumerator for their bases is the square of a related enumerator for their self-dual bases. This leads to a new proof of Tutte's theorem that the number of spanning trees of a central reflex is a perfect square, and it solves a problem posed by Kalai about higher dimensional spanning trees in simplicial complexes. We also give a weighted version of the latter result.We give an algebraic analogue relating to the critical group of a graph, a finite abelian group whose order is the number of spanning trees of the graph. We prove that the critical group of a central reflex is a direct sum of two copies of an abelian group, and conclude with an analogous result in Kalai's setting.     

管状曲面在曲线论中的应用

研究了围绕曲线的管状曲面上的曲率线,渐近线与测地线,给出它们的方程,揭示了这些曲线与Bertrand曲线或Mannheim曲线之间的关系,采用新的方法给出一条曲线是Bertrand曲线或Mannheim曲线的充要条件的另一种证明以及Mannheim侣线的曲率与挠率之间的关系．     

Mean-variance portfolio selection for a non-life insurance company

We consider a collective insurance risk model with a compound Cox claim process, in which the evolution of a claim intensity is described by a stochastic differential equation driven by a Brownian motion. The insurer operates in a financial market consisting of a risk-free asset with a constant force of interest and a risky asset which price is driven by a Lévy noise. We investigate two optimization problems. The first one is the classical mean-variance portfolio selection. In this case the efficient frontier is derived. The second optimization problem, except the mean-variance terminal objective, includes also a running cost penalizing deviations of the insurer’s wealth from a specified profit-solvency target which is a random process. In order to find optimal strategies we apply techniques from the stochastic control theory.     

Weak Convergence Theorems for Nonexpansive Mappings and Monotone Mappings

In this paper, we introduce an iteration process of finding a common element of the set of fixed points of a nonexpansive mapping and the set of solutions of a variational inequality problem for an inverse strongly-monotone mapping, and then obtain a weak convergence theorem. Using this result, we obtain a weak convergence theorem for a pair of a nonexpansive mapping and a strictly pseudocontractive mapping. Further, we consider the problem of finding a common element of the set of fixed points of a nonexpansive mapping and the set of zeros of an inverse strongly-monotone mapping.