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...     

人才吸引力因素与政策工具契合关系研究以河北省为例

人才是第一资源,人才引进培养是经济社会发展的一个关键,近年来我国各地纷纷出台吸引人才的重磅政策.为探求人才政策工具对人才的吸引力情况,在构建人才吸引力因素理论模型基础上,通过对178位人才问卷调查获得人才吸引力关键因素,对河北省163份人才政策文本进行数据挖掘,分析政策工具与人才吸引力因素的契合关系.研究得出创新氛围、人才培训培养、人才激励评价、创新创业支持、人才服务和薪资待遇等方面契合度高,政策效果较佳;工作场所仪器设备条件、配偶子女安置和住房补贴的契合关系为政策不足,应加大政策制定;人才载体和医疗社会保障的契合关系为政策冗余,需加强政策实施.     

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.

     

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.