Study of the performances of an oxygen carrier: Experimental investigation of the binder's contribution and characterization of its structural modifications

The aim of this work is to investigate the contribution of the binder (NiAl₂O₄) on the performances of the oxygen carrier NiO/NiAl₂O₄. To this purpose, oxidation/reduction cycles have been performed in a fixed bed reactor using CO as a fuel. The results reveal that the binder can react with the fuel to form CO₂, and that its total reduction capacity increases with temperature. XRD characterizations performed on the binder (on the fresh and after several cycles) show a shift of the diffraction peaks of NiAl₂O₄ toward the ones of γ-alumina, which can be attributed to a progressive decomposition of NiAl₂O₄ to alumina and NiO.     

循环孔隙水压下混凝土常规三轴压缩损伤破坏特性分析

本文进行了孔隙水压不同循环次数(0次,10次,50次,100次和200次)以及不同应变速率下(10~(-5)/s,10~(-4)/s,10~(-3)/s和10~(-2)/s)混凝土常规三轴压缩试验,分析了混凝土峰值应变的变化规律、应力-应变曲线及损伤特性。结果表明:相同循环次数孔隙水压下,峰值应变随应变速率增加,整体呈现出增加的趋势;而相同应变速率下,峰值应变随孔隙水压循环次数的变化规律并不明显;在中低应变速率(10~(-5)~10~(-3)/s)下,混凝土的损伤变化受孔隙水压循环次数影响较大;当循环次数达到200次时,孔隙水压作用对混凝土产生较大的损伤。通过对循环孔隙水作用下混凝土动态损伤破坏机理的分析可知:混凝土的破坏过程实际上是内部裂纹不断形成、扩展、贯通,材料损伤不断产生、累积的过程;当损伤达到一定程度,混凝土发生宏观破坏,失去承载力。     

Facile non‐lithographic route to highly aligned silica nanopatterns using unidirectionally aligned polystyrene‐block‐polydimethylsiloxane films

Thin films (monolayer and bilayer) of cylinder forming polystyrene‐block‐polydimethylsiloxane (PS‐b‐PDMS) were shear aligned by the swelling and deswelling of a crosslinked PDMS pad that was physically adhered to the film during solvent vapor annealing. The nanostructures formed by self‐assembly were exposed to ultraviolet‐ozone to partially oxidize the PDMS, followed by calcination in air at 500 °C. In this process, the PS segments were fully decomposed, while the PDMS yielded silica nanostructures. The highly aligned PDMS cylinders were thus deposited as silica nanolines on the silicon substrate. Using a bilayer film, the center‐to‐center distance of these features were effectively halved from 38 to 19 nm. Similarly, by sequential shear‐alignment of two distinct layers, a rhombic array of silica nanolines was fabricated. This methodology provides a facile route to fabricating complex topographically patterned nanostructures. © 2015 Wiley Periodicals, Inc. J. Polym. Sci., Part B: Polym. Phys. 2015 , 53, 1058–1064     

Vertex-disjoint cycles in local tournaments

Let $r$ be a positive integer. The Bermond–Thomassen conjecture states that, a digraph of minimum out-degree at least $2r-1$ contains $r$ vertex-disjoint directed cycles. A digraph $D$ is called a local tournament if for every vertex $x$ of $D$, both the out-neighbours and the in-neighbours of $x$ induce tournaments. Note that tournaments form the subclass of local tournaments. In this paper, we verify that the Bermond–Thomassen conjecture holds for local tournaments. In particular, we prove that every local tournament $D$ with ${\delta }^{+}\left(D\right)\ge 2r-1$ contains $r$ disjoint cycles $C_1,C_2,\dots ,C_r$, satisfying that either $C_i$ has the length at most 4 or is a shortest cycle of the original digraph of $D-C_1-\dots -C_{i-1}$ for $1\le i\le r$.     

Some results about zero‐cycles on abelian and semi‐abelian varieties

In this short note we extend some results obtained in [7]. First, we prove that for an abelian variety A with good ordinary reduction over a finite extension of with p an odd prime, the Albanese kernel of A is the direct sum of its maximal divisible subgroup and a torsion group. Second, for a semi‐abelian variety G over a perfect field k, we construct a decreasing integral filtration of Suslin's singular homology group, , such that the successive quotients are isomorphic to a certain Somekawa K‐group.     

Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs

We show that for every there exists C > 0 such that if then asymptotically almost surely the random graph contains the k^th power of a Hamilton cycle. This determines the threshold for appearance of the square of a Hamilton cycle up to the logarithmic factor, improving a result of Kühn and Osthus. Moreover, our proof provides a randomized quasi‐polynomial algorithm for finding such powers of cycles. Using similar ideas, we also give a randomized quasi‐polynomial algorithm for finding a tight Hamilton cycle in the random k‐uniform hypergraph for . The proofs are based on the absorbing method and follow the strategy of Kühn and Osthus, and Allen et al. The new ingredient is a general Connecting Lemma which allows us to connect tuples of vertices using arbitrary structures at a nearly optimal value of p. Both the Connecting Lemma and its proof, which is based on Janson's inequality and a greedy embedding strategy, might be of independent interest.     

On the variety of triangles for a hyper-Kähler fourfold constructed by Debarre and Voisin

We study the similarities between the Fano varieties of lines on a cubic fourfold, a hyper-Kähler fourfold studied by Beauville and Donagi, and the hyper-Kähler fourfold constructed by Debarre and Voisin in [3]. We exhibit an analog of the notion of “triangle” for these varieties and prove that the 6-dimensional variety of “triangles” is a Lagrangian subvariety in the cube of the constructed hyper-Kähler fourfold.