Meng Jin

Meng Jin

Auto-generated profile, based on publicly available information

Meng Jin

Anhui Key Laboratory of Nanomaterials and Nanotechnology, Institute of Solid State Physics, HFIPS, Chinese Academy of Sciences, Hefei 230031, China

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 January 2024 in Energy & Environmental Science
Verified
Journal Article
Closed access
PDF file
SZShengbo Zhang
Shengbo Zhang
MJMeng Jin
Meng Jin
HXHui Xu
Hui Xu
XZXinyuan Zhang
Xinyuan Zhang
TSTongfei Shi
Tongfei Shi
HZHuijun Zhao
Huijun Zhao
An oxygen-coordinated cobalt single-atom catalyst was successfully fabricated, exhibiting exceptional electrocatalytic activity toward urea and H2O2 production. Subsequently, the value-added urea peroxide was efficiently synthesized.

8 March 2025 in Inorganic Chemistry Frontiers
Verified
Journal Article
Closed access
PDF file
JLJiafang Liu
Jiafang Liu
SZShengbo Zhang
Shengbo Zhang
ZMZhixian Mao
Zhixian Mao
WLWenyi Li
Wenyi Li
MJMeng Jin
Meng Jin
HZHaimin Zhang
Haimin Zhang
The construction of dual catalytic sites to regulate the adsorption and activation of CO2 and NO3 − is critically important for the selective electrosynthesis of urea. Here, we report a CuCo alloy nanoparticle-encapsulated N-doped carbon nanotube (CuCo@N-CNT) catalyst for efficient and selective electrosynthesis of urea. The results demonstrated that the carbon nanotubes and the molar ratio of Cu to Co have a key influence on the surface electronic structure of CuCo@N-CNTs, thus effectively regulating the adsorption and activation of CO2 and NO3 − to obtain high-efficiency urea synthesis. As a result, the fabricated Cu1Co1@N-CNTs exhibited the highest urea yield of 3489.01 ± 34.35 μg h−1 mgcat −1 with a faradaic efficiency of 73.69 ± 1.83% at −0.8 V (vs. RHE). The in situ spectroscopy and mass spectrometry measurements revealed that the first C–N coupling reaction involves the generation of *CONH2 species through *CO and *NH2 originated from the co-reduction of CO2 and NO3 − on Cu1Co1@N-CNTs. This can be further supported by theoretical calculation results. Furthermore, competitive side reactions such as CO2 reduction, H2 evolution and NO3 − reduction can be effectively suppressed by modulating the position of the d-band centre of CuCo alloy nanoparticles, promoting the electrosynthesis of urea.

26 August 2023 in Chemical Communications
Verified
Journal Article
Closed access
PDF file
DSDianding Sun
Dianding Sun
ZZZhong Zhao
Zhong Zhao
MJMeng Jin
Meng Jin
HZHaimin Zhang
Haimin Zhang
We investigate in detail the influence of O, S, and N functionalization of Pt3Co/C catalysts on the proton exchange membrane fuel cell (PEMFC).

2 May 2023 in RSC Advances
Verified
Journal Article
Open access
PDF file
ZZZhong Zhao
Zhong Zhao
SZShengbo Zhang
Shengbo Zhang
MJMeng Jin
Meng Jin
HZHaimin Zhang
Haimin Zhang
Pt–Ni(OH)2-5 catalyst fabricated via a vapour-phase hydrothermal method and pulsed laser deposition method exhibits good HER performance under alkaline conditions.

28 December 2012 in IEEE Transactions on Information Theory
Verified
Journal Article
Open access
JMJin Meng
Jin Meng
EYEn-Hui Yang
En-Hui Yang
Interactive encoding and decoding based on binary low-density parity-check codes with syndrome accumulation (SA-LDPC-IED) is proposed and investigated. Assume that the source alphabet is GF(2), and the side information alphabet is finite. It is first demonstrated how to convert any classical universal lossless code Cn (with block length n and side information available to both the encoder and decoder) into a universal SA-LDPC-IED scheme. It is then shown that with the word error probability approaching 0 subexponentially with n , the compression rate (including both the forward and backward rates) of the resulting SA-LDPC-IED scheme is upper bounded by a functional of that of Cn, which in turn approaches the compression rate of Cn for each and every individual sequence pair (xn, yn) and the conditional entropy rate H (X |Y) for any stationary, ergodic source and side information (X, Y) as the average variable node degree l̅ of the underlying LDPC code increases without bound. When applied to the class of binary source and side information (X, Y) correlated through a binary symmetrical channel with crossover probability unknown to both the encoder and decoder, the resulting SA-LDPC-IED scheme can be further simplified, yielding even improved rate performance versus the bit error probability when l̅ is not large. Simulation results (coupled with linear time belief propagation decoding) on binary source-side information pairs confirm the theoretic analysis and further show that the SA-LDPC-IED scheme consistently outperforms the Slepian-Wolf coding scheme based on the same underlying LDPC code. As a by-product, probability bounds involving LDPC established in the course are also interesting on their own and expected to have implications on the performance of LDPC for channel coding as well.

1 September 2009
Verified
Conference Paper
Closed access
JMJin Meng
Jin Meng
EYEn-Hui Yang
En-Hui Yang
In this paper we investigate the performance of linear interactive encoding and decoding based on syndrome accumulation(SA-IED) over binary LDPC ensembles. Assume that the source alphabet is GF(2), and the side information alphabet is finite. It is shown that we can construct universal SA-IED schemes, which are asymptotically optimal for any stationary ergodic source-side information pair. Our analysis further shows that the word error probability will approach 0 sub-exponentially with respect to the block length, while at the same time, the rate approaches H(X|Y) as the average variable node degree of the LDPC ensemble approaches ¿. Further, if the source and side information are correlated through a binary symmetrical memoryless channel, but the cross-over probability of the channel is not known to either the encoder or the decoder, our result on the performance of SA-IED can be further improved for LDPC ensembles with finite average variable node degree. Simulation results on binary source-side information pairs confirm the theoretical analysis above, and further show that SA-IED schemes using LDPC codes coupled with linear time belief propagation decoding consistently outperform Slepian-Wolf coding schemes based on LDPC codes.