Detecting pore size distribution of activated carbon by low-field nuclear magnetic resonance

In this study, the transverse relaxation time (T₂) of activated carbon (AC) in different relative environment humidity was detected firstly by low-field nuclear magnetic resonance (LFNMR). The pore size (diameter) of AC distributions was calculated by the relationship between T₂ and surface relaxation rate (ρ), where ρ was obtained by the detection of nine porous materials with known pore size. The results showed that the pore size distributions of AC calculated by ρ < 0.19 nm/ms were in good agreement with that obtained by nitrogen adsorption method and proved that LFNMR as a new detection method was feasible for characterizing AC pore size distribution.     

Effect of temperature on the interactions between cellulose and lignin via molecular dynamics simulations

Cellulose - Heating is essential in various biomass pre-treatments and thermal conversion processes. It is of practical significance to study the characteristics of cellulose-lignin and...     

Flower-like titanium dioxide as novel co-reaction accelerator for ultrasensitive “off–on” electrochemiluminescence aptasensor construction based on 2D g-C3N4 layer for thrombin detection

Journal of Solid State Electrochemistry - An ultrasensitive “signal-off–on” electrochemiluminescence (ECL) biosensor is constructed based on f1-TiO2/g-C3N4/PDA for thrombin...     

Correction to: Practical framework for data-driven RANS modeling with data augmentation

Acta Mechanica Sinica -     

基于MOF (Cu)@biochar气凝胶的制备及其在缓释氮肥上的应用

以羧甲基纤维素(CMC)、明胶和MOF(Cu)@biochar为原料,采用简单有效的冷冻干燥方法制备了(CMC/Gelatin/MOF(Cu)@biochar)杂化气凝胶,并用傅里叶变换红外光谱(FT-IR)、热重分析(TG)、X射线粉末衍射(XRD)、扫描电镜(SEM)和X射线光电子能谱(XPS)技术对其进行了表征;研究了MOF(Cu)@biochar含量、pH和不同的盐水溶液对杂化气凝胶溶胀行为的影响;以该气凝胶负载氯化铵,制备了一种新型缓释肥料(SRF),并研究了含2%(wt)SRF的沙性土壤的保水能力;SRF在土壤中第30天的累积释放率为79.4%;肥料在土壤中释放符合非Fickian扩散和阳离子交换的协同作用机理。     

On lower iteration complexity bounds for the convex concave saddle point problems

Mathematical Programming - In this paper, we study the lower iteration complexity bounds for finding the saddle point of a strongly convex and strongly concave saddle point problem: $$\min _x\max...