Eco-friendly and low-cost amidoxime-functionalized microcrystalline cellulose/mesoporous silica composite for the selective adsorption of U(VI) from aqueous solution

Journal of Radioanalytical and Nuclear Chemistry - Eco-friendly and low-cost composite, amidoxime-functionalized microcrystalline cellulose/mesoporous silica (MCC/MS-AO), were synthesized by...     

Isoflavonoids from Astragalus membranaceus Hairy Roots

Chemistry of Natural Compounds -     

Revealing the Effect of Surface Composition on Multiwalled Carbon Nanotubes Supported Pt-Fe Alloy Electrocatalysts for Methanol Oxidation Performance

The designs of efficient and inexpensive Pt-based catalysts for methanol oxidation reaction (MOR) are essential to boost the commercialization of direct methanol fuel cells. Here, the highly catalytic performance PtFe alloys supported on multiwalled carbon nanotubes (MWCNTs) decorating nitrogen-doped carbon (NC) have been successfully prepared via co-engineering of the surface composition and electronic structure. The Pt₁Fe₃@NC/MWCNTs catalyst with moderate Fe³⁺ feeding content (0.86 mA/mg_Pt) exhibits 2.26-fold enhancement in MOR mass activity compared to pristine Pt/C catalyst (0.38 mA/mg_Pt). Furthermore, the CO oxidation initial potential of Pt₁Fe₃@NC/MWCNTs catalyst is lower relative to Pt/C catalyst (0.71 V and 0.80 V). Benefited from the optimal surface compositions, the anti-corrosion ability of MWCNT, strong electron interaction between PtFe alloys and MWCNTs and the N-doped carbon (NC) layer, the Pt₁Fe₃@NC/MWCNTs catalyst presents an improved MOR performance and anti-CO poisoning ability. This study would open up new perspective for designing efficient electrocatalysts for the DMFCs field.     

Graphene Saturable Absorber Mirror for Mode-Locked Orange Pulse Laser

Journal of Russian Laser Research - We demonstrate a passively-mode-locked Pr3+: LuLiF4 laser operated at the 604 nm orange wave-length, using monolayer graphene as a saturable absorber. The...     

Quantum Watermark Algorithm Based on Maximum Pixel Difference and Tent Map

International Journal of Theoretical Physics - A new quantum watermark algorithm is presented by combining maximum pixel difference partitioning with the least significant bit substitution...     

Large sets with multiplicity

Designs, Codes and Cryptography - Large sets of combinatorial designs has always been a fascinating topic in design theory. These designs form a partition of the whole space into combinatorial...     

$$L^2_f$$ L f 2 -harmonic 1-forms on smooth metric measure spaces with positive $$\lambda _1(\Delta _f)$$ λ 1 ( Δ f )

In this paper, we study vanishing and splitting results on a complete smooth metric measure space \((M^n,g,\mathrm {e}^{-f}\mathrm {d}v)\) with various negative m-Bakry-Émery Ricci curvature lower bounds in terms of the first eigenvalue \(\lambda _1(\Delta _f)\) of the weighted Laplacian \(\Delta _f\), i.e., \(\mathrm {Ric}_{m,n}\ge -a\lambda _1(\Delta _f)-b\) for \(0<a\le \dfrac{m}{m-1}, b\ge 0\). In particular, we consider three main cases for different a and b with or without conditions on \(\lambda _1(\Delta _f)\). These results are extensions of Dung and Vieira, and weighted generalizations of Li-Wang, Dung-Sung, and Vieira.

     

Visible-light-induced,autopromoted nickel-catalyzed three-component arylsulfonation of 1,3-enynes and mechanistic insights

Science China Chemistry - A light-induced, nickel-catalyzed three-component arylsulfonation of 1,3-enynes in the absence of photocatalyst is reported. This methodology exhibited mild conditions,...     

On s-hamiltonian line graphs of claw-free graphs

For an integer $s\ge 0$, a graph $G$ is $s$-hamiltonian if for any vertex subset $S?V\left(G\right)$ with $\left|S\right|\le s$, $G?S$ is hamiltonian, and $G$ is $s$-hamiltonian connected if for any vertex subset $S?V\left(G\right)$ with $\left|S\right|\le s$, $G?S$ is hamiltonian connected. Thomassen in 1984 conjectured that every 4-connected line graph is hamiltonian (see Thomassen, 1986), and Ku?zel and Xiong in 2004 conjectured that every 4-connected line graph is hamiltonian connected (see Ryjá?ek and Vrána, 2011). In Broersma and Veldman (1987), Broersma and Veldman raised the characterization problem of $s$-hamiltonian line graphs. In Lai and Shao (2013), it is conjectured that for $s\ge 2$, a line graph $L\left(G\right)$ is $s$-hamiltonian if and only if $L\left(G\right)$ is $(s+2)$-connected. In this paper we prove the following.(i) For an integer $s\ge 2$, the line graph $L\left(G\right)$ of a claw-free graph $G$ is $s$-hamiltonian if and only if $L\left(G\right)$ is $(s+2)$-connected.(ii) The line graph $L\left(G\right)$ of a claw-free graph $G$ is 1-hamiltonian connected if and only if $L\left(G\right)$ is 4-connected.