Aims
Surveys and research on the applications of the hepatic venous pressure gradient (HVPG) are important for understanding the current status and future development of this technology in China. ...This article aimed to investigate the status of hepatic venous pressure gradient measurement in China in 2022.
Methods
We investigated the overall status of HVPG technology in China—including hospital distribution, hospital level, annual number of cases, catheters used, average cost, indications, and current challenges by using online questionnaire. By counting the number and percentages of cases of these results, we hope to clarify the current status of HVPG measurements in China.
Results
According to the survey, 85 hospitals in China used HVPG technology in 2022 distributed across 29 provinces. A total of 4989 HVPG measurements were performed in all of the surveyed hospitals in 2022, of which 2813 cases (56.4%) were measured alone. The average cost of HVPG measurement was 5646.8 ± 2327.9 CNY. Of the clinical teams who performed the measurements (sometimes multiple per hospital), 94.3% (82/87) used the balloon method, and the majority of the teams (72.4%, 63/87) used embolectomy catheters.
Conclusions
This survey clarified the clinical application status of HVPG in China and confirmed that some medical institutions in China have established a foundation for this technology. It is still necessary to continue promoting and popularizing this technology in the future.
A survey analysis of hepatic venous pressure gradient for portal hypertension in China.
Key points
Significant findings of the study
Some medical institutions in China have already mastered the technique and applied it in their clinical practices. However, promoting and popularizing hepatic venous pressure gradient (HVPG) is still necessary.
What this study adds
We analyzed the overall status of HVPG measurement technology in China.
Cellulases from fungi typically contain one catalytic domain with or without a cellulose-binding domain. We characterized an endo-acting cellulase PdCel5C from industrial cellulase-producing fungus ...Penicillium decumbens with distinctive domain composition. In addition to a cellulose-binding domain and a catalytic domain, PdCel5C contains two immunoglobulin (Ig)-like domains near the C-terminal end. Truncated mutation experiment reveals that the two Ig-like domains are important for the hydrolytic activity of PdCel5C. Moreover, PdCel5C releases cello-oligosaccharides from cellulosic substrates, which is different from that of most characterized cellulases in the same glycoside hydrolase family 5. To the best of our knowledge, this is the first report on the characterization of an Ig-like domain-containing cellulase in fungi. The results expand our understanding on the diversity of cellulases in fungi, and suggest possible shared catalytic mechanisms between bacterial and fungal cellulases.
Furan, an important product from catalytic pyrolysis of biomass, has the potential to be further converted into value-added chemicals or biofuels. This study investigated the conversion of furan into ...benzofuran over a Brønsted acid catalyst (Amberlyst 70) at 140-190 °C in various solvents. With water as the solvent, furan could barely make its way to benzofuran as its polymerization dominated. With methanol as the solvent, the polymerization of furan was suppressed and benzofuran formation was enhanced substantially. This is because in methanol, the reactive intermediates (
i.e.
, aldehydes) were stabilized and their involvement in polymerization reactions was suppressed. Other alcohols showed similar effects on suppressing polymerization. In dimethyl sulfoxide (DMSO), the polymerization of furan was also effectively suppressed. However, furan was not converted to benzofuran but to levulinic acid
via
a distinct reaction route.
Furan has distinct reaction pathways during acid treatment in methanol, water and dimethyl sulfoxide.
Aiming at the problems of distributed photovoltaic power stations, such as wide distribution and difficult scheduling, a cluster dynamic partitioning strategy based on distributed photovoltaic output ...prediction and improved clustering algorithm is proposed. Firstly, the output data of photovoltaic power station is analyzed for correlation, and new sample data is constructed and sent to the deep recurrent neural network for prediction, so as to obtain reliable output prediction results. Then, the grey wolf optimization algorithm is used to improve the K-means clustering algorithm, which is used to analyze the data set containing the output value and environmental parameters of photovoltaic power plants, so as to obtain the distributed photovoltaic power plant cluster with the best dynamic supply and demand balance. Finally, based on the IEEE 33 node system, the proposed strategy is tested and analyzed. The experimental results show that the modularity and dynamic supply and demand balance values of its cluster division are 0.783 and 0.819 respectively, and the photovoltaic output prediction effect is ideal.
Aiming at the problems of low accuracy, long time and large error of traditional distributed photovoltaics (D-PV) power prediction methods, a power prediction method of D-PV digital twin system based ...on GA-BP-NN is proposed. Firstly, by analyzing the basic principles and key features of the power system digital twin system, the digital twin structure system of the photovoltaic power generation power prediction system is constructed. Then, through the quantitative analysis of photovoltaic output fluctuation and photovoltaic operating status, a photovoltaic power generation power prediction model is built in the digital twin system based on the GA-BP-NN algorithm. Finally, the proposed D-PV power prediction method and the other two methods are compared and analyzed under the same conditions through simulation experiments. The results show that the power prediction accuracy and time consumption of the method proposed in this paper are the best in three different meteorological environments, the highest accuracy is 95.24%, and the minimum time consumption is 6.53s, and the algorithm performance is better than the other three comparisons algorithm.