Coloring mixed hypertrees

A mixed hypergraph is a triple (V,C,D) where V is its vertex set and C and D are families of subsets of V, called C-edges and D-edges, respectively. For a proper coloring, we require that each C-edge contains two vertices with the same color and each D-edge contains two vertices with different colors. The feasible set of a mixed hypergraph is the set of all k's for which there exists a proper coloring using exactly k colors. A hypergraph is a hypertree if there exists a tree such that the edges of the hypergraph induce connected subgraphs of the tree.We prove that feasible sets of mixed hypertrees are gap-free, i.e., intervals of integers, and we show that this is not true for precolored mixed hypertrees. The problem to decide whether a mixed hypertree can be colored by k colors is NP-complete in general; we investigate complexity of various restrictions of this problem and we characterize their complexity in most of the cases.     

各向异性接合材料界面端部场数值分析

为了求解各向异性接合材料界面端部奇异性应力场,建立了一种新型杂交元模型.该模型的独特之处在于:基于有限元特征法得到的奇异性场数值特征解建立了一种新型界面端奇异单元.通过算例证明,新型杂交元模型能够利用较少的单元数获得较为精确的数值结果.当前模型应用范围广泛,能够用于复杂结构的界面端部场求解.     

具有唯一4度最大度点的图的全色数

一个图Ｇ的全色数χ_T（Ｇ）是使得Ｖ（Ｇ）∪Ｅ（Ｇ）中相邻或相关联元素均染不同颜色的最少颜色数．文中证明了，若图Ｇ只有唯一的一个４度最大度点，则χ_T（Ｇ）＝Δ（Ｇ）＋１．     

不饱和链烃沸点的拓扑研究

基于邻接矩阵与边价 (fi)定义边价连接性指数 ( mF) ,其中的0 F ,1 F与 2 94种不饱和链烃 (包括烯烃、炔烃及烯炔烃 )的沸点 (Tb)关联 ,得到良好的数学模型 :ln( 70 0 -Tb) =6 5 2 3 3 1-0 0 0 4880 F2 -0 3 46771 F0 5(n =2 94,R =0 9979,R2 =0 995 8,F =3 490 4,S =5 12 ) ,该回归模型经Jackknife法检验具有总体稳健性 .可以预示 ,该指数将在定量构效关系研究中成为重要参数 .     

Cesium lead halide perovskite nanocrystals for ultraviolet and blue light blocking

Using cesium lead halide perovskite nanocrystals, CsPb(Cl/Br)_3, as a light absorber, we report a highly effective UV and blue light blocking film. The CsPb(Cl/Br)_3 nanocrystals are well dispersed in the ethyl cellulose(EC) matrix to compose a UV and blue light shielding film, and the absorption edge of the film is tunable by adjusting Cl to Br ratio using anion exchange. The CsPbCl_2 Br-EC film exhibits a transmittance of 5% at 459 nm, 90% at 478 nm and 95% in the range of 500–800 nm, which makes it excellent for UV and blue light shielding. In addition, the as-prepared EC-CsPb(Cl/Br)_3 film shows excellent photostability under UV irradiation. Results demonstrate that this EC-CsPb(Cl/Br)_3 based materials with sharp absorbance edges, tunable blocking wavelength, and high photostability can be useful for the applications in UV and blue light blocking and optical filters     

The Degree Preserving Spanning Tree Problem: Valid Inequalities and Branch-and-cut method

Given a connected undirected graph G, the Degree Preserving Spanning Tree Problem (DPSTP) consists in finding a spanning tree T of G that maximizes the number of vertices that have the same degree in T and in G. In this paper, we introduce Integer Programming formulations, valid inequalities and a Branch-and-cut algorithm for the DPSTP. Reinforced with new valid inequalities, the upper bounds provided by the formulation behind our Branch-and-cut method dominate previous DPSTP bounds in the literature.     

SINGLE AND DOUBLE EDGE INTERFACE CRACK SOLUTIONS FOR ARBITRARY FORMS OF MATERIAL COMBINATION

In this paper interfacial edge crack problems are considered by the application of the finite element method. The stress intensity factors are accurately determined from the ratio of crack-tip-stress value between the target given unknown and reference problems. The reference problem is chosen to produce the singular stress fields proportional to those of the given unknown problem. Here the original proportional method is improved through utilizing very refined meshes and post-processing technique of linear extrapolation. The results for a double-edge interface crack in a bonded strip are newly obtained and compared with those of a single-edge interface crack for different forms of combination of material. It is found that the stress intensity factors should be compared in the three different zones of relative crack lengths. Different from the case of a cracked homogeneous strip, the results for the double edge interface cracks are found to possibly be bigger than those for a single edge interface crack under the same relative crack length.     

A hybrid level set method for modelling detonation and combustion problems in complex geometries

We present an accurate and fast wave tracking method that uses parametric representations of tracked fronts, combined with modifications of level set methods that use narrow bands. Our strategy generates accurate computations of the front curvature and other geometric properties of the front. We introduce data structures that can store discrete representations of the location of the moving fronts and boundaries, as well as the corresponding level set fields, that are designed to reduce computational overhead and memory storage. We present an algorithm we call stack sweeping to efficiently sort and store data that is used to represent orientable fronts. Our implementation features two reciprocal procedures, a forward ‘front parameterization’ that constructs a parameterization of a front given a level set field and a backward ‘field construction’ that constructs an approximation of the signed normal distance to the front, given a parameterized representation of the front. These reciprocal procedures are used to achieve and maintain high spatial accuracy. Close to the front, precise computation of the normal distance is carried out by requiring that displacement vectors from grid points to the front be along a normal direction. For front curves in two dimensions, a cubic interpolation scheme is used, and G ¹ surface parameterization based on triangular patches is used for the three-dimensional implementation to compute the distances from grid points near the front. To demonstrate this new, high accuracy method we present validations and show examples of combustion-like applications that include detonation shock dynamics, material interface motions in a compressible multi-material simulation and the Stephan problem associated with dendrite solidification.     

Improved square coloring of planar graphs

Square coloring is a variant of graph coloring where vertices within distance two must receive different colors. When considering planar graphs, the most famous conjecture (Wegner, 1977) states that $\frac{3}{2}\mathrm{\Delta }+1$ colors are sufficient to square color every planar graph of maximum degree Δ. This conjecture has been proven asymptotically for graphs with large maximum degree. We consider here planar graphs with small maximum degree and show that $2\mathrm{\Delta }+7$ colors are sufficient, which improves the best known bounds when $6?\mathrm{\Delta }?31$.     

List star edge coloring of k-degenerate graphs

A star edge coloring of a graph is a proper edge coloring such that every connected 2-colored subgraph is a path with at most 3 edges. Deng et al. and Bezegová et al. independently show that the star chromatic index of a tree with maximum degree $\Delta$ is at most $?\frac{3\Delta }{2}?$, which is tight. In this paper, we study the list star edge coloring of $k$-degenerate graphs. Let $c{h}_{st}^{\prime }\left(G\right)$ be the list star chromatic index of $G$: the minimum $s$ such that for every $s$-list assignment $L$ for the edges, $G$ has a star edge coloring from $L$. By introducing a stronger coloring, we show with a very concise proof that the upper bound on the star chromatic index of trees also holds for list star chromatic index of trees, i.e. $c{h}_{st}^{\prime }\left(T\right)\le ?\frac{3\Delta }{2}?$ for any tree $T$ with maximum degree $\Delta$. And then by applying some orientation technique we present two upper bounds for list star chromatic index of $k$-degenerate graphs.