Utilizing the Space‐Charge Region of the FeNi‐LDH/CoP p‐n Junction to Promote Performance in Oxygen Evolution Electrocatalysis

The modulation of electron density is an effective option for efficient alternative electrocatalysts. Here, p‐n junctions are constructed in 3D free‐standing FeNi‐LDH/CoP/carbon cloth (CC) electrode (LDH=layered double hydroxide). The positively charged FeNi‐LDH in the space‐charge region can significantly boost oxygen evolution reaction. Therefore, the j at 1.485 V (vs. RHE) of FeNi‐LDH/CoP/CC achieves ca. 10‐fold and ca. 100‐fold increases compared to those of FeNi‐LDH/CC and CoP/CC, respectively. Density functional theory calculation reveals OH^? has a stronger trend to adsorb on the surface of FeNi‐LDH side in the p‐n junction compared to individual FeNi‐LDH further verifying the synergistic effect in the p‐n junction. Additionally, it represents excellent activity toward water splitting. The utilization of heterojunctions would open up an entirely new possibility to purposefully regulate the electronic structure of active sites and promote their catalytic activities.     

New Develoopment of the Basic Theory of Extenics

In this paper,the new development of three basic theories of Extenics,incluing basic-element theory,extension set theory and extension logic theory ,has been introduced.And the new theoretical frame of Extenics has also been set forth.     

后基因组研究对社会和生活的影响

文章从基因研究的概念界定入手，揭示了其对人类社会生活的影响。     

含PM-映射的变分不等式

文章在自反Banach空间中，利用锐角原理讨论了含PM-映射的变分不等式解的存在性问题。     

浅谈基于浸润原理的事务安排算法

针对单个安排事务避免冲突的传统方法 ,提出一种基于浸润原理的事物安排算法。该算法采用漫布式将各个事务分摊到各个位置 ,根据条件计算权值 ,并有意造成冲突 ,从而发现冲突位置 ,最后从最不可能冲突的位置入手 ,逐步完成安排过程。该方法事务安排的复杂度为 O(n2× k× x) ,大大减少事务安排所需的时间 .     

粉末冶金陶瓷模工艺中的快速脱蜡新技术

粉末冶金陶瓷模工艺是一种先进的过净形成形工艺．本文报道该工艺中一种新的脱蜡技术．采用快速加热、管径集中热量和定向导热传热综合方法，在陶瓷模和大部分蜡模材料处于较低温度下，使蜡模材料来不及发生显著的热膨胀而直接蒸发，得到脱蜡干净、外形完整的陶瓷模．     

Zeeman效应实验一定能推断出原子的g_J值吗?

本文以实例对Zeeman效应一定能推断原子的gJ值问题做了否定的回答。     

矩阵方程A^TXB=C的正定和半正定解

给出了矩阵方程Ａ＾ＴＸＢ＝Ｃ在正定和半正定矩阵类中有解的充要条件及解的一般表达式。     

无向树图的k点连通最小扩充

解决了以最少边集扩充一个任意无向树图为k点连通图这一优化问题,提出了一个计算复杂度为D(|V|~4)的算法。为进一步研究可靠网络的计算机辅助设计打下基础。