检索结果-南通市图书馆

Ru/NiMnB spherical cluster pillar for highly proficient green hydrogen electrocatalyst at high current density

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Energy Chemistry 2025年第1期100卷 397-408页

作者： Md Ahasan Habib Shusen Lin Mehedi Hasan Joni Sumiya Akter Dristy Rutuja Mandavkar Jae-Hun Jeong Jihoon Lee Department of electronic Engineering College of Electronics and Information Kwangwoon University

Advanced OER/HER electrocatalytic alternatives are crucial for the wide adaptation of green hydrogen ***,Ru/NiMnB spherical cluster pillar （SCP）,denoted as Ru/NiMnB,is synthesized using a combination of electro-deposition and hydrothermal *** investigation of Ru doping in the NiMnB matrix revealed significant improvements in electrocatalytic *** Ru/NiMnB SCPs demonstrate superior OER/HER activity with low overpotentials of 150 and 103 mV at 50mA/cm2in 1 M KOH,making them highly competitive with state-of-the-art ***,the Ru/NiMnB SCPs exhibit a low 2-E cell voltage of 2.80 V at ultra-high current density of 2,000 m A/cm2in 1 M KOH,outperforming the standard benchmark electrodes of RuO2||Pt/C,thereby positioning Ru/NiMnB as one of the best bifunctional *** SCPs exhibit exceptional high-current characteristics,stability and corrosion resistance,as evidenced by continuous operation at 1,000 mA/cm2high-current density for over 150 h in 6 M KOH at elevated temperatures under harsh industrial *** a small amount of Ru incorporation significantly enhances the electrocatalytic performances of NiMnB,attributed to increased active sites and improved intrinsic properties such as conductivity,adsorption/desorption capability and reaction ***,Ru/NiMnB SCPs present a promising bi-functional electrode concept for efficient green H2production.

关键词： Potassium hydroxide

An Improved Practical Byzantine Fault-Tolerant Algorithm Based on XGBoost Grouping for Consortium Chains

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2025年第1期82卷 1295-1311页

作者： Xiaowei Wang Haiyang Zhang Jiasheng Zhang Yingkai Ge Kexin Cui Zifu Peng Zhengyi Li Lihua Wang college of electronic and info.mation Engineering Shandong University of Science and TechnologyQingdao266590China

In response to the challenges presented by the unreliable identity of the master node,high communication overhead,and limited network support size within the Practical Byzantine Fault-Tolerant(PBFT)algorithm for consortium chains,we propose an improved PBFT algorithm based on XGBoost grouping called XG-PBFT in this ***-PBFT constructs a dataset by training important parameters that affect node performance,which are used as classification indexes for *** XGBoost algorithm then is employed to train the dataset,and nodes joining the system will be grouped according to the trained grouping *** them,the nodes with higher parameter indexes will be assigned to the consensus group to participate in the consensus,and the rest of the nodes will be assigned to the general group to receive the consensus *** order to reduce the resource waste of the system,XG-PBFT optimizes the consensus protocol for the problem of high complexity of PBFT ***,we evaluate the performance of *** experimental results show that XG-PBFT can significantly improve the performance of throughput,consensus delay and communication complexity compared to the original PBFT algorithm,and the performance enhancement is significant compared to other algorithms in the case of a larger number of *** results demonstrate that the XG-PBFT algorithm is more suitable for large-scale consortium chains.

关键词： Consortium chain PBFT grouping reputation XGBoost

Inexact proximal gradient algorithm with random reshuffling for nonsmooth optimization

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Science China(info.mation Sciences) 2025年第1期68卷 219-237页

作者： Xia JIANG Yanyan FANG Xianlin ZENG Jian SUN Jie CHEN National Key Lab of Autonomous Intelligent Unmanned Systems School of AutomationBeijing Institute of Technology Beijing Institute of Technology Chongqing Innovation Center School of electronic and info.mation Engineering Tongji University

Proximal gradient algorithms are popularly implemented to achieve convex optimization with nonsmooth regularization. Obtaining the exact solution of the proximal operator for nonsmooth regularization is challenging because errors exist in the computation of the gradient; consequently, the design and application of inexact proximal gradient algorithms have attracted considerable attention from researchers. This paper proposes computationally efficient basic and inexact proximal gradient descent algorithms with random reshuffling. The proposed stochastic algorithms take randomly reshuffled data to perform successive gradient descents and implement only one proximal operator after all data pass through. We prove the convergence results of the proposed proximal gradient algorithms under the sampling-without-replacement reshuffling *** computational errors exist in gradients and proximal operations, the proposed inexact proximal gradient algorithms can converge to an optimal solution neighborhood. Finally, we apply the proposed algorithms to compressed sensing and compare their efficiency with some popular algorithms.

关键词： proximal operator random reshuffling inexact computation compressed sensing nonsmooth optimization

Design and implementation of reconfigurable CNN accelerator architecture based on elastic storage

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2025年

作者： Shan Rui Xu Jianing Huo Ziqing college of electronic Engineering， Xi'an University of Post and Telecommunications

With the rapid iteration of neural network algorithms， higher requirements was placed on the computational performance and memory access bandwidth of neural network accelerators. Simply increasing bandwidth cannot improve energy efficiency， so improving data reuse rate is a hot research topic. From the perspective of supporting data reuse， a reconfigurable convolutional neural networks (CNN) accelerator based on elastic storage was designed in this paper. By supporting elastic memory access and flexible data flow， it reduces data movement between the processor and memory， eases the bandwidth pressure and enhances CNN acceleration performance. The experimental results indicate that conducting 1×1 convolution and 3×3 convolution when performing convolution calculations， the execution speed increased by 25.00% and 61.61%， respectively. The 3×3 maximum pooling speed was increased by 76.04%.

关键词：

Industrial Control Anomaly Detection Based on Distributed Linear Deep Learning

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2025年第1期82卷 1129-1150页

作者： Shijie Tang Yong Ding Huiyong Wang School of Computer Science and info.mation Security Guilin University of Electronic TechnologyGuilin541004China School of electronic Engineering and automation Guilin University of Electronic TechnologyGuilin541004China Guangxi Engineering Research Center of Industrial Internet Security and Blockchain Guilin University of Electronic TechnologyGuilin541004China Institute of Cyberspace Technology HKCT Institute for Higher EducationHong Kong999077China School of Mathematics&Computing Science Guilin University of Electronic TechnologyGuilin541004China

As more and more devices in Cyber-Physical Systems(CPS)are connected to the Internet,physical components such as programmable logic controller(PLC),sensors,and actuators are facing greater risks of network attacks,and fast and accurate attack detection techniques are *** key problem in distinguishing between normal and abnormal sequences is to model sequential changes in a large and diverse field of time *** address this issue,we propose an anomaly detection method based on distributed deep *** method uses a bilateral filtering algorithm for sequential sequences to remove noise in the time series,which can maintain the edge of discrete *** use a distributed linear deep learning model to establish a sequential prediction model and adjust the threshold for anomaly detection based on the prediction error of the validation *** method can not only detect abnormal attacks but also locate the sensors that cause *** conducted experiments on the Secure Water Treatment(SWAT)and Water Distribution(WADI)public *** experimental results show that our method is superior to the baseline method in identifying the types of attacks and detecting efficiency.

关键词： Anomaly detection CPS deep learning MLP(multi-layer perceptron)

Multi-party quantum private comparison of size relationship based on one-direction quantum walks on a circle

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Science China(info.mation Sciences) 2025年

作者： Jintao WANG Jiangyuan LIAN Tianyu YE college of info.mation & electronic Engineering Zhejiang Gongshang University

Quantum walks (QW) are the quantum counterpart of classical random walks, and portray a natural stochastic process when the walker randomly wanders around. In a discretetime QW system on a circle, when the walker particle generally steps towards two directions, i.e., clockwise and anticlockwise, this kind of QW is called two-direction quantum walks on a circle (TDQWC); and the walker particle always steps towards one direction or stays stationary, this kind of QW is called as one-direction quantum walks on a circle (ODQWC).

关键词：

Efficient OpenMP Based Z-curve Encoding and Decoding Algorithms

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2025年第1期82卷 1313-1327页

作者： Zicheng Zhou Shaowen Sun Teng Liang Mengjuan Li Fengling Xia School of electronic Science and Engineering University of Electronic Science and Technology of ChinaChengdu611731China Faculty of info.mation Engineering and automation Kunming University of Science and TechnologyKunming650500China School of Communications info.mation Engineering Yunnan Communications Vocational and Technical CollegeKunming650500China Library Yunnan Normal UniversityKunming650500China Faculty of Civil Aviation and Aeronautics Kunming University of Science and TechnologyKunming650500China

Z-curve’s encoding and decoding algorithms are primely important in many Z-curve-based *** bit interleaving algorithm is the current state-of-the-art algorithm for encoding and decoding *** simple,its efficiency is hindered by the step-by-step coordinate shifting and bitwise *** tackle this problem,we first propose the efficient encoding algorithm LTFe and the corresponding decoding algorithm LTFd,which adopt two optimization methods to boost the algorithm’s efficiency:1)we design efficient lookup tables(LT)that convert encoding and decoding operations into table-lookup operations;2)we design a bit detection mechanism that skips partial order of a coordinate or a Z-value with consecutive 0s in the front,avoiding unnecessary iterative *** propose order-parallel and point-parallel OpenMP-based algorithms to exploit the modern multi-core *** results on discrete,skewed,and real datasets indicate that our point-parallel algorithms can be up to 12.6×faster than the existing algorithms.

关键词： Z-curve lookup table OpenMP bit detection mechanism

Dynamic event-triggered data-driven iterative learning bipartite tracking control for nonlinear MASs with prescribed performance

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Science China(info.mation Sciences) 2025年第1期68卷 292-305页

作者： Tao SHI Wei-Wei CHE School of Mechatronic Engineering and automation Shanghai University State Key Laboratory of Synthetical automation for Process Industries Northeastern University college of info.mation Science and Engineering Northeastern University

This article proposes a distributed dynamic event-triggered data-driven iterative learning control(DET-DDILC)scheme under a predefined performance to tackle the bipartite tracking control problem for multiagent systems(MASs). An improved dynamic linearization technique is utilized to convert the nonlinear MASs into an iterative linear data model. First,a peer-to-peer mapping function is introduced to map the constrained distributed system output homeomorphism to an unconstrained one. In addition, a DET mechanism based on a time-iteration-varying function is devised to conserve network communication resources. Based on the unconstrained transformation and the designed DET mechanism, the DET-DDILC algorithm is devised to ensure that the bipartite tracking performance of MASs can be within the preset range. Finally, the effectiveness and feasibility of the designed control scheme are demonstrated via a simulation case by a comparison.

关键词： bipartite tracking control prescribed performance event-triggered iterative learning control multiagent systems

Substrate bias effects in p-channel GaN-on-Si transistors

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(info.mation Sciences) 2025年第1期68卷 404-405页

作者： Mengyao ZHAO Jie MA Lanlan YANG Chuanqi PAN Denggui WANG Jianjun ZHOU Sheng LI Jiaxing WEI Long ZHANG Siyang LIU Weifeng SUN National ASIC System Engineering Research Center School of Integrated Circuits Southeast University National Center of Technology Innovation for electronic Design automation Southeast University National Key Laboratory of Solid-State Microwave Devices and Circuits

The drain current （ID） of the n-channel GaN field-effecttransistor （n-FET） is influenced by the substrate-to-source bias voltage (VBS)（substrate bias effect）[1].Actually,nonzero VBSis also likely to occur in p-FET in real application,because the source electrode of p-FET is usually connected to high *** study reports the dependency between IDand VBSin p-FET for the first time,and analyzes the underlying mechanisms from the perspective of vertical electric field （EF） distribution.

关键词：

同方期刊数据库