用于油/水分离的环保无氟超疏水织物的制备与性能

针对目前用于油/水分离的超疏水材料普遍存在的原料不环保、不可降解、涂层耐久性差等缺点,采用简便的浸渍法,制备了一种环保、工艺简单且性能优良的超疏水材料。首先,使用水性聚氨酯（WPU）将聚甲基丙烯酸甲酯-甲基丙烯酸缩水甘油酯P（MMA-r-GMA）微球固定在棉织物表面,构造微纳米级粗糙结构。其次,通过水解-缩合反应,将无毒的十六烷基三甲氧基硅烷（HDTMS）与甲基三乙氧基硅烷（MTES）锚定在棉织物表面,制备得到超疏水棉织物。结果表明,改性棉织物接触角最高可达157.3（°）,滚动角为5（°）。同时具有很好的耐溶剂性,在酸碱溶液中浸泡30 min后,接触角几乎无变化。油水分离效率最高可达97.8%,即使在经过10次循环分离之后,油水分离效率仍然在95%以上。该超疏水织物具有出色的油水分离效率和优良的稳定性,可用于可持续且环保的油水分离领域。     

双基地雷达两极区ISAR超分辨成像

由于双基地雷达中两极区双基地角的时变特性,传统ISAR成像法无法获取高分辨的目标像.分析了两极区双基地角的时变性及对距离包络和方位的影响,就两极区目标运动模型中目标方位高次项提出了Radon-TCDS-Relax超分辨成像算法,对每个距离单元进行调频率和调频率变化率搜索并补偿其所对应的方位高次相位误差,用Radon-TCDS-Relax提取散射点实现TCD-RID成像.仿真实验与分析验证了本文方法的有效性.     

The delay effect on reaction–diffusion equations

In this work we study a reaction–diffusion problem with delay and we make an analysis of the stability of solutions by means of bifurcation theory. We take the delay constant as a parameter. Special conditions on the vector field assure existence of a spatially nonconstant positive equilibrium U_k , which is stable for small values of the delay. An increase of the delay destabilizes the equilibrium of U_k and leads to super or subcritical Hopf bifurcation.     

Effect of the simultaneous substitution of two transition metals on the structural, magnetic and electrical properties of La0.6Sr0.4Mn1−2xCrxFexO3

The structural, magnetic and electrical properties of Cr and Fe simultaneously substituted in the perovskite La_0.6Sr_0.4Mn_1−2xCr_xFe_xO₃ have been studied. The presence of Cr and Fe had no significant effect on the structural properties. Curie temperature and saturation magnetization decrease with increase in Cr and Fe contents. For x=0.20 and 0.25, a steep drop of zero field-cooled (ZFC) magnetization at low temperature signifies the formation of cluster- or spin-glass state. A weak hysteresis at low fields seems to be an indication of phase separation. All the resulting magnetization curves can be explained by a superposition of both ferromagnetic and antiferromagnetic components. All the samples are semiconducting throughout the temperature range studied. Resistivity can be described by the adiabatic small polaron hopping and the variable range hopping model. It was found that the transport mechanism is dominated by the VRH model with an increase of Mott localization energy, which explains the increase of resistivity.     

On the 3-restricted edge connectivity of permutation graphs

An edge cut W of a connected graph G is a k-restricted edge cut if G−W is disconnected, and every component of G−W has at least k vertices. The k-restricted edge connectivity is defined as the minimum cardinality over all k-restricted edge cuts. A permutation graph is obtained by taking two disjoint copies of a graph and adding a perfect matching between the two copies. The k-restricted edge connectivity of a permutation graph is upper bounded by the so-called minimum k-edge degree. In this paper some sufficient conditions guaranteeing optimal k-restricted edge connectivity and super k-restricted edge connectivity for permutation graphs are presented for k=2,3.     

Consecutive magic graphs

Let G be a graph of order n and size e. A vertex-magic total labeling is an assignment of the integers 1,2,…,n+e to the vertices and the edges of G, so that at each vertex, the vertex label and the labels on the edges incident at that vertex, add to a fixed constant, called the magic number of G. Such a labeling is a-vertex consecutive magic if the set of the labels of the vertices is {a+1,a+2,…,a+n}, and is b-edge consecutive magic if the set of labels of the edges is {b+1,b+2,…,b+e}. In this paper we prove that if an a-vertex consecutive magic graph has isolated vertices then the order and the size satisfy (n-1)²+n²=(2e+1)². Moreover, we show that every tree with even order is not a-vertex consecutive magic and, if a tree of odd order is a-vertex consecutive then a=n-1. Furthermore, we show that every a-vertex consecutive magic graph has minimum degree at least two if a=0, or both and 2a?e, and the minimum degree is at least three if both and 2a?e. Finally, we state analogous results for b-edge consecutive magic graphs.     

Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are (3,1)-colorable

Given a nonnegative integer $d$ and a positive integer $k$, a graph $G$ is said to be $(k,d)$-colorable if the vertices of $G$ can be colored with $k$ colors such that every vertex has at most $d$ neighbors receiving the same color as itself. Let $?$ be the family of planar graphs without $3$-cycles adjacent to cycles of length 3 or 5. This paper proves that everyone in $?$ is $(3,1)$-colorable. This is the best possible in the sense that there are members in $?$ which are not $(3,0)$-colorable.     

The Bargmann Symmetry Constraint and Binary Nonlinearization of the Super Dirac Systems

An explicit Bargmann symmetry constraint is computed and its associated binary nonlinearization of Lax pairs is carried out for the super Dirac systems. Under the obtained symmetry constraint, the n-th flow of the super Dirac hierarchy is decomposed into two super finite-diinensional integrable Hamiltonian systems, defined over the super- symmetry manifold R^4N{2N with the corresponding dynamical variables x and tn. The integrals of motion required for Liouville integrability are explicitly given.     

PVA改性PAMPS-PAM超高力学性能双网络水凝胶的制备

采用紫外光引发聚合制备了聚乙烯醇(PVA)改性的聚(2-丙烯酰胺基-2-甲基丙磺酸)-聚丙烯酰胺(PAMPS-PAM)双网络(DN)水凝胶.测定并比较了PVA改性前后PAMPS-PAM双网络水凝胶的溶胀动力学;通过扫描电子显微镜(SEM)观察了单网络水凝胶的结构;测定PVA改性前后PAMPS-PAM双网络水凝胶的压缩及拉伸性能.结果表明,经PVA改性后的PAMPS-PAM双网络水凝胶有较高的溶胀比;0.82%PVA用量的PAMPS-PAM双网络水凝胶在90%压缩形变率下仍保持完整、最大拉伸应力达到0.5 MPa,大幅提高PAMPS-PAM双网络水凝胶的力学性能.     

A conjecture on strong magic labelings of 2-regular graphs

Let sC₃ denote the disjoint union of s copies of C₃. For each integer t≥2 it is shown that the disjoint union C₅∪(2t)C₃ has a strong vertex-magic total labeling (and therefore it must also have a strong edge-magic total labeling). For each integer t≥3 it is shown that the disjoint union C₄∪(2t−1)C₃ has a strong vertex-magic total labeling. These results clarify a conjecture on the magic labeling of 2-regular graphs, which posited that no such labelings existed. It is also shown that for each integer t≥1 the disjoint union C₇∪(2t)C₃ has a strong vertex-magic total labeling. The construction employs a technique of shifting rows of (newly constructed) Kotzig arrays to label copies of C₃. The results add further weight to a conjecture of MacDougall regarding the existence of vertex-magic total labeling for regular graphs.