最大度大于等于7的平面图的线性荫度

图的染色问题在组合优化、计算机科学和Hessians矩阵的网络计算等方面具有非常重要的应用。其中图的染色中有一种重要的染色——线性荫度,它是一种非正常的边染色,即在简单无向图中,它的边可以分割成线性森林的最小数量。研究最大度$\bigtriangleup（G）\geq7$的平面图$G$的线性荫度,证明了对于两个固定的整数$i$,$j\in\{5,6,7\}$,如果图$G$中不存在相邻的含弦$i$,$j$-圈,则图$G$的线性荫度为$\lceil\frac\bigtriangleup2\rceil$。     

Microstructure of a-SiOx:H

A set of a-SiO_x:H (0.52 <x< 1.58) films are fabricated by plasma-enhanced-chemical-vapor-deposition (PECVD) method at the substrate temperature of 250°C. The microstructure and local bonding configurations of the films are investigated in detail using micro-Raman scattering, X-ray photoelectron spectroscopy (XPS) and Fourier transform infrared spectroscopy (FTIR). It is found that the films are structural inhomogeneous, with five phases of Si, Si₂O:H, SiO:H, Si₂O₃:H and SiO₂ that coexist. The phase of Si is composed of nonhydrogenated amorphous silicon (a-Si) clusters that are spatially isolated. The average size of the clusters decreases with the increasing oxygen concentration x in the films. The results indicate that the structure of the present films can be described by a multi-shell model, which suggests that a-Si cluster is surrounded in turn by the subshells of Si₂O:H, SiO:H, Si₂O₃:H, and SiO₂.     

Ideal Free Distribution in Two Patches

In this paper, the formats of Julia sets for a class of nonlinear complex dynamic systems with variable coefficients were studied under certain conditions. For the complex dynamic systems in piecewise cases, we proposed some methods to control the forms of their Julia sets and stable domains analytically. What’s more, we illustrated that our methods worked well by computational simulations. Our work provides a better understanding about how to control the Julia sets of certain complex dynamic systems.     

On the Hamming distances of repeated-root constacyclic codes of length 4ps

Let $p$ be an odd prime, $s$, $m$ be positive integers, $\gamma ,\lambda$ be nonzero elements of the finite field ${\mathbb{F}}_{p^m}$ such that ${\gamma }^{p^s}=\lambda$. In this paper, we show that, for any positive integer $\eta$, the Hamming distances of all repeated-root $\lambda$-constacyclic codes of length $\eta p^s$ can be determined by those of certain simple-root $\gamma$-constacyclic codes of length $\eta$. Using this result, Hamming distances of all constacyclic codes of length $4p^s$ are obtained. As an application, we identify all MDS $\lambda$-constacyclic codes of length $4p^s$.     

Global existence and blow-up for the generalized sixth-order Boussinesq equation

In this paper we prove local well-posedness in L²(R)$L^2\left(\mathbb{R}\right)$ and H¹(R)$H^1\left(\mathbb{R}\right)$ for the generalized sixth-order Boussinesq equation _utt=_uxx+β_uxxxx+_uxxxxxx+_(|u|αu)xx$u_{tt}=u_{xx}+\beta u_{xxxx}+u_{xxxxxx}+{\left({\left|u\right|}^{\alpha }u\right)}_{xx}$. Our proof relies in the oscillatory integrals estimates introduced by Kenig et al. (1991) [14]. We also show that, under suitable conditions, a global solution for the initial value problem exists. In addition, we derive the sufficient conditions for the blow-up of the solution to the problem.     

内生无限平面网格上基于策略互动的均衡网络结构及吸收集

在内生网络环境下,基于局中人的策略互动研究了均衡网络的结构特性,以及局中人策略选择的倾向性. 在动态进程的同一阶段,规定所有局中人同时进行策略更新,研究了网络生成的连接费用、互动支付等参数之间的相互关系及其对均衡结构或吸收集的影响. 主要贡献是将网络的内生性与无限网格上的策略互动联系在一起,得出不同连接费用水平之下的均衡结构、吸收集的准确特征.     

Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks

The connected dominating set plays an important role in ad hoc wireless networking. Many constructions for approximating the minimum connected dominating set have been proposed in the literature. In this paper, we propose a new one with Steiner tree, which produces approximation solution within a factor of 6.8 from optimal. This approximation algorithm can also be implemented distributedly.     

拟线性热方程的函数分离变量解

用群状结构法研究拟线性热方程的分离变量解,对于允许和型分离变量解的二阶拟线性热方程给出了一个完整的分类.说明了一些带有函数类型反应项的方程具有函数分离变量解,推广了前人的结论.     

Application of integral operator for regularized least-square regression

In this paper, we study the consistency of the regularized least-square regression in a general reproducing kernel Hilbert space. We characterize the compactness of the inclusion map from a reproducing kernel Hilbert space to the space of continuous functions and show that the capacity-based analysis by uniform covering numbers may fail in a very general setting. We prove the consistency and compute the learning rate by means of integral operator techniques. To this end, we study the properties of the integral operator. The analysis reveals that the essence of this approach is the isomorphism of the square root operator.