Sufficient Conditions for a Digraph to be Supereulerian

A (di)graph is supereulerian if it contains a spanning eulerian sub(di)graph. This property is a relaxation of hamiltonicity. Inspired by this analogy with hamiltonian cycles and by similar results in supereulerian graph theory, we analyze a number of sufficient Ore type conditions for a digraph to be supereulerian. Furthermore, we study the following conjecture due to Thomassé and the first author: if the arc‐connectivity of a digraph is not smaller than its independence number, then the digraph is supereulerian. As a support for this conjecture we prove it for digraphs that are semicomplete multipartite or quasitransitive and verify the analogous statement for undirected graphs.     

张量广义特征值的S-型包含区域

设{A,B}为m阶n维正则张量对,通过将指标集N={1,2,…,n}划分为非空真子集S及其补集S珚=N/S,利用分类讨论的思想以及张量对{A,B}某些元素选取的任意性和不等式缩放技巧,解决了张量对{A,B}的特征值定位问题,并给出张量对{A,B}特征值的S-型包含区域.数值结果表明,所得包含区域比已有包含区域更精确.     

上海黄浦江两支流河流甲烷含量研究

甲烷是一种重要的温室气体,虽然目前大气中含量远小于二氧化碳,但排放增长率却大于后者.研究区域为上海市黄浦江支流苏州河和淀浦河,通过实验数据对比城郊春夏的甲烷排放的差异,探讨甲烷产生的机制及其与环境因子的关系,这将有助于研究河流甲烷排放对于环境变化的影响.研究结果认为河流甲烷主要来源于水中沉积物,其产生与水质、温度等因素相关;同时甲烷摩尔浓度与硝酸根离子质量体积比存在负相关性,与铵根离子质量体积比和有机碳质量分数存在正相关性.     

Vertex-disjoint rainbow triangles in edge-colored graphs

Let $G$ be an edge-colored graph of order $n$. The minimum color degree of $G$, denoted by ${\delta }^c\left(G\right)$, is the largest integer $k$ such that for every vertex $v$, there are at least $k$ distinct colors on edges incident to $v$. We say that an edge-colored graph is rainbow if all its edges have different colors. In this paper, we consider vertex-disjoint rainbow triangles in edge-colored graphs. Li (2013) showed that if ${\delta }^c\left(G\right)\ge (n+1)∕2$, then $G$ contains a rainbow triangle and the lower bound is tight. Motivated by this result, we prove that if $n\ge 20$ and ${\delta }^c\left(G\right)\ge (n+2)∕2$, then $G$ contains two vertex-disjoint rainbow triangles. In particular, we conjecture that if ${\delta }^c\left(G\right)\ge (n+k)∕2$, then $G$ contains $k$ vertex-disjoint rainbow triangles. For any integer $k\ge 2$, we show that if $n\ge 16k-12$ and ${\delta }^c\left(G\right)\ge n∕2+k-1$, then $G$ contains $k$ vertex-disjoint rainbow triangles. Moreover, we provide sufficient conditions for the existence of $k$ edge-disjoint rainbow triangles.     

Ⅰ级洁净手术室中无影灯直径的确定

采用高雷诺数K-ε二方程模型，从控制污染物的扩散范围和保证工作区乱流度这两个指标出发，对I级洁净手术室内无影灯直径进行了研究，为无影灯直径的选型提供了依据。     

蕴含W5可图序列的最小度和

Gould,Jacobson和Lehel考虑了下述经典Tur偄n型极值问题的变形:对于给定的图H,确定最小的正偶数σ(H,n),使得对于每一个n项可图序列π=(d1,d2,…,dn),当σ(π)=d1+d2+…+dn≥σ(H,n)时,π有一个实现G包含H作为可图的.本文确定了当n≥11时,σ(W5,n)之值,其中Wr是r个顶点的轮图.     

动态规划确定化学反应器序列最小占用时间的方法

通过用动态规划给出化学反应器序列最小占用时间的设计方法,提出了一个过程的最优化输出设计,该设计在输出产品浓度给定的条件下建立问题的基本设计量和数学模型,利用动态规划原则确定各阶段的占用时间,使总的占用时间为最小值,能够合理的确定各阶段反应器的体积以取得较好的经济效应.图3,表1,参8.     

The Chang-Łoś-Suszko theorem in a topological setting

The Chang-Łoś-Suszko theorem of first-order model theory characterizes universal-existential classes of models as just those elementary classes that are closed under unions of chains. This theorem can then be used to equate two model-theoretic closure conditions for elementary classes; namely unions of chains and existential substructures. In the present paper we prove a topological analogue and indicate some applications.     

Well-Posedness by Perturbations of Variational Problems

In this paper, we consider the extension of the notion of well-posedness by perturbations, introduced by Zolezzi for optimization problems, to other related variational problems like inclusion problems and fixed-point problems. Then, we study the conditions under which there is equivalence of the well-posedness in the above sense between different problems. Relations with the so-called diagonal well-posedness are also given. Finally, an application to staircase iteration methods is presented.