纤维素纳米晶体手性复合材料:结构色的调控与应用

结构色在自然界中扮演了重要的角色,在昆虫外骨骼、鸟类羽毛以及植物果实中广泛分布.纤维素纳米晶体(CNCs)的水悬浮液达到一定浓度时会自组装形成左旋的手性向列液晶结构,这种手性向列结构在水分挥发后仍能保持并形成光子晶体虹彩薄膜,具有极强的手性和光子晶体的双重性质.膜内的周期性层状结构与光线产生干涉、衍射作用,表现出复杂的...     

含嘧啶环的1,3,4-噁二唑Mannich碱的合成及生物活性

以芳香酸为原料, 通过酯化、 肼解及环化反应制得中间体5-芳基取代-1,3,4-噁二唑-2-硫酮(C1~C3), 然后中间体与甲醛和取代氨基嘧啶(D1~D5)发生Mannich反应得到一系列新型含有嘧啶环的1,3,4-噁二唑类衍生物(E1~E15). 所得目标化合物的结构经元素分析、 IR及 ¹H NMR确认. 初步的生物活性测定结果表明, 大部分目标化合物对植物病原菌有很好的抑制作用, 其中化合物E3和E8的抑菌效果优于对照药三唑酮.     

含吡唑环的1,2,4-三唑希夫碱类衍生物的合成及生物活性

以自制的4-氨基-4,5-二氢-3-[(3,5-二甲基吡唑-1-基)甲基]-1,2,4-三唑-5-硫酮衍生物为中间体, 与取代苯甲醛反应合成了一系列新型含吡唑环的1,2,4-三唑希夫碱衍生物. 通过红外光谱、 核磁共振波谱、 高分辨质谱、 元素分析及X射线单晶衍射对目标化合物进行了结构表征, 并初步测试了其生物活性. 结果表明, 大部分化合物表现出较好的抑菌活性, 其中化合物G9, G10和G15的抑菌效果优于对照药三唑酮.     

Variational Problems of Surfaces in a Sphere

Let x : M → S~(n+p)(1) be an n-dimensional submanifold immersed in an(n + p)-dimensional unit sphere S~(n+p)(1).In this paper, we study n-dimensional submanifolds immersed in S~(n+p)(1) which are critical points of the functional S(x) =∫_M~S~((n/2) dv), where S is the squared length of the second fundamental form of the immersion x.When x : M → S~(2+p)(1) is a surface in S~(2+p)(1), the functional S(x) =∫_M~(S~(n/2) dv) represents double volume of image of Gaussian map.For the critical surface of S(x), we get a relationship between the integral of an extrinsic quantity of the surface and its Euler characteristic.Furthermore, we establish a rigidity theorem for the critical surface of S(x).     

基于cDNA宏阵列的系统聚类分析猪发育阶段的基因表达谱

取杜洛克猪胚胎第33,45,55，65．75天的背最长肌样本．用cDNA Macroarray分析方法和聚类分析技术分析了327个EST在骨骼肌内不同发育阶段的基因表达谱．结果表明有98条EST在不同发育时期显著差异表达．第33天和第45天两阶段基因表达状态相似．第55天和第65天基因表达状态相似．而第75天的基因表达与第55天和第65天两个阶段的基因表达具有相近的聚类关系．表达状态相近，基因功能相似的基因大都被聚类在一起．     

约束最小支撑树 ( C-MST)问题: 复杂性和上下界估计

本文首先建立了约束最小支撑树问题的模型 ,利用背包问题的复杂性 ,证明了该问题是 N P-完 全的 . 然后利用一个广义线性规划的对偶算法 ,对目标函数的上下界作出了估计 ,最后分析了解的平面 性质 .     

Score vectors of tournaments

A tournament T on any set X is a dyadic relation such that for any x, y ∈ X (a) (x, x) ? T and (b) if x ≠ y then (x, y) ∈ T iff (y, x) ? T. The score vector of T is the cardinal valued function defined by R(x) = |{y ∈ X : (x, y) ∈ T}|. We present theorems for infinite tournaments analogous to Landau's necessary and sufficient conditions that a vector be the score vector for some finite tournament. Included also is a new proof of Landau's theorem based on a simple application of the “marriage” theorem.     

Disjoint Paths in Decomposable Digraphs

The k‐linkage problem is as follows: given a digraph and a collection of k terminal pairs such that all these vertices are distinct; decide whether D has a collection of vertex disjoint paths such that is from to for . A digraph is k‐linked if it has a k‐linkage for every choice of 2k distinct vertices and every choice of k pairs as above. The k‐linkage problem is NP‐complete already for [11] and there exists no function such that every ‐strong digraph has a k‐linkage for every choice of 2k distinct vertices of D [17]. Recently, Chudnovsky et al. [9] gave a polynomial algorithm for the k‐linkage problem for any fixed k in (a generalization of) semicomplete multipartite digraphs. In this article, we use their result as well as the classical polynomial algorithm for the case of acyclic digraphs by Fortune et al. [11] to develop polynomial algorithms for the k‐linkage problem in locally semicomplete digraphs and several classes of decomposable digraphs, including quasi‐transitive digraphs and directed cographs. We also prove that the necessary condition of being ‐strong is also sufficient for round‐decomposable digraphs to be k‐linked, obtaining thus a best possible bound that improves a previous one of . Finally we settle a conjecture from [3] by proving that every 5‐strong locally semicomplete digraph is 2‐linked. This bound is also best possible (already for tournaments) [1].     

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.