Wuhan University Journal of Natural Sciences最新文献_第4页

Improved Design of Architecture of the Battlefield Situation Comprehensive Display System 战场态势综合显示系统体系结构改进设计

Wuhan University Journal of Natural Sciences Pub Date : 2023-08-01 DOI: 10.1051/wujns/2023284309

Yu Liu, Lili Zhang, Gangqiang Li

引用次数: 0

Existence of Global Attractor for a 3D Brinkman-Forchheimer Equfation in Some Poincaré Unbounded Domains 一类三维Brinkman-Forchheimer方程在poincar<s:1>无界区域上的全局吸引子的存在性

Wuhan University Journal of Natural Sciences Pub Date : 2023-08-01 DOI: 10.1051/wujns/2023284282

Xueli Song, Shuang Xu, Baoming Qiao

引用次数: 0

EPT: Data Augmentation with Embedded Prompt Tuning for Low-Resource Named Entity Recognition EPT:基于嵌入式提示调优的低资源命名实体识别数据增强

Wuhan University Journal of Natural Sciences Pub Date : 2023-08-01 DOI: 10.1051/wujns/2023284299

Hongfei Yu, Kunyu Ni, Rongkang Xu, Wenjun Yu, Yu Huang

引用次数: 0

Nonlinear Program Construction and Verification Method Based on Partition Recursion and Morgan's Refinement Rules 基于划分递归和Morgan精化规则的非线性程序构造与验证方法

Wuhan University Journal of Natural Sciences Pub Date : 2023-06-01 DOI: 10.1051/wujns/2023283246

Changjing Wang, Zhongxiong Cao, Chul-Hi Yu, Changchang Wang, Qing Huang, Z. Zuo

{"title":"Nonlinear Program Construction and Verification Method Based on Partition Recursion and Morgan's Refinement Rules","authors":"Changjing Wang, Zhongxiong Cao, Chul-Hi Yu, Changchang Wang, Qing Huang, Z. Zuo","doi":"10.1051/wujns/2023283246","DOIUrl":"https://doi.org/10.1051/wujns/2023283246","url":null,"abstract":"The traditional program refinement strategy cannot be refined to an executable program, and there are issues such as low verification reliability and automation. To solve the above problems, this paper proposes a nonlinear program construction and verification method based on partition recursion and Morgan's refinement rules. First, we use recursive definition technique to characterize the initial specification. The specification is then transformed into GCL(Guarded Command Language) programs using loop invariant derivation and Morgan's refinement rules. Furthermore, VCG (Verification Condition Generator) is used in the GCL program to generate the verification condition automatically. The Isabelle theorem prover then validates the GCL program's correctness. Finally, the GCL code generates a C++ executable program automatically via the conversion system. The effectiveness of this method is demonstrated using binary tree preorder traversal program construction and verification as an example. This method addresses the problem that the construction process's loop invariant is difficult to obtain and the refinement process is insufficiently detailed. At the same time, the method improves verification process automation and reduces the manual verification workload.","PeriodicalId":23976,"journal":{"name":"Wuhan University Journal of Natural Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46078195","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Noether Theorem for Fractional Singular Systems 分数奇异系统的Noether定理

Wuhan University Journal of Natural Sciences Pub Date : 2023-06-01 DOI: 10.1051/wujns/2023283207

Chuanjing Song, X. Zhai

引用次数: 0

I-Total Coloring and VI-Total Coloring of mC4 Vertex-Distinguished by Multiple Sets mC4多集可分辨顶点的I-全染色和VI全染色

Wuhan University Journal of Natural Sciences Pub Date : 2023-06-01 DOI: 10.1051/wujns/2023283201

Nana Wang, Xiangen Chen

引用次数: 0

On Packing Trees into Complete Bipartite Graphs 关于将树包装成完全二部图的问题

Wuhan University Journal of Natural Sciences Pub Date : 2023-06-01 DOI: 10.1051/wujns/2023283221

Yan Peng, Hong Wang

{"title":"On Packing Trees into Complete Bipartite Graphs","authors":"Yan Peng, Hong Wang","doi":"10.1051/wujns/2023283221","DOIUrl":"https://doi.org/10.1051/wujns/2023283221","url":null,"abstract":"Let [see formula in PDF] denote the complete bipartite graph of order [see formula in PDF] with vertex partition sets [see formula in PDF] and [see formula in PDF]. We prove that for each tree [see formula in PDF] of order [see formula in PDF], there is a packing of [see formula in PDF] copies of [see formula in PDF] into a complete bipartite graph [see formula in PDF]. The ideal of the work comes from the \"Tree packing conjecture\" made by Gyráfás and Lehel. Bollobás confirmed the \"Tree packing conjecture\" for many small trees, who showed that one can pack [see formula in PDF] into [see formula in PDF] and that a better bound would follow from a famous conjecture of Erd[see formula in PDF]s. In a similar direction, Hobbs, Bourgeois and Kasiraj made the following conjecture: Any sequence of trees [see formula in PDF], … , [see formula in PDF], with [see formula in PDF] having order [see formula in PDF], can be packed into [see formula in PDF]. Further Hobbs, Bourgeois and Kasiraj proved that any two trees can be packed into a complete bipartite graph [see formula in PDF]. Motivated by these results, Wang Hong proposed the conjecture: For each tree [see formula in PDF] of order [see formula in PDF], there is a [see formula in PDF]⁃packing of [see formula in PDF] in some complete bipartite graph [see formula in PDF]. In this paper, we prove a weak version of this conjecture.","PeriodicalId":23976,"journal":{"name":"Wuhan University Journal of Natural Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46626035","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

The Number of Perfect Matchings in (3,6)-Fullerene （3,6）-富勒烯的完全匹配数

Wuhan University Journal of Natural Sciences Pub Date : 2023-06-01 DOI: 10.1051/wujns/2023283192

Rui Yang, Mingzhu Yuan

{"title":"The Number of Perfect Matchings in (3,6)-Fullerene","authors":"Rui Yang, Mingzhu Yuan","doi":"10.1051/wujns/2023283192","DOIUrl":"https://doi.org/10.1051/wujns/2023283192","url":null,"abstract":"A [see formula in PDF]-fullerene is a connected cubic plane graph whose faces are only triangles and hexagons, and has the connectivity [see formula in PDF] or [see formula in PDF]. The [see formula in PDF]-fullerenes with connectivity [see formula in PDF] are the tubes consisting of [see formula in PDF] concentric hexagonal layers such that each layer consists of two hexagons, capped on each end by two adjacent triangles, denoted by [see formula in PDF]. A [see formula in PDF]-fullerene [see formula in PDF] with [see formula in PDF] vertices has exactly [see formula in PDF] perfect matchings. The structure of a [see formula in PDF]-fullerene [see formula in PDF] with connectivity [see formula in PDF] can be determined by only three parameters [see formula in PDF], [see formula in PDF] and[see formula in PDF], thus we denote it by [see formula in PDF], where [see formula in PDF] is the radius (number of rings), [see formula in PDF] is the size (number of spokes in each layer, [see formula in PDF], [see formula in PDF] is even), and [see formula in PDF] is the torsion ([see formula in PDF]). In this paper, the counting formula of the perfect matchings in [see formula in PDF]is given, and the number of perfect matchings is obtained. Therefore, the correctness of the conclusion that every bridgeless cubic graph with [see formula in PDF] vertices has at least [see formula in PDF] perfect matchings proposed by Esperet et al is verified for [see formula in PDF]-fullerene [see formula in PDF].","PeriodicalId":23976,"journal":{"name":"Wuhan University Journal of Natural Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47302752","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A Power Load Prediction by LSTM Model Based on the Double Attention Mechanism for Hospital Building 基于双重注意机制的LSTM模型的医院用电负荷预测

Wuhan University Journal of Natural Sciences Pub Date : 2023-06-01 DOI: 10.1051/wujns/2023283223

Zengxi Feng, Xun Ge, Yaojia Zhou, Jiale Li

{"title":"A Power Load Prediction by LSTM Model Based on the Double Attention Mechanism for Hospital Building","authors":"Zengxi Feng, Xun Ge, Yaojia Zhou, Jiale Li","doi":"10.1051/wujns/2023283223","DOIUrl":"https://doi.org/10.1051/wujns/2023283223","url":null,"abstract":"This work proposed a LSTM (long short-term memory) model based on the double attention mechanism for power load prediction, to further improve the energy-saving potential and accurately control the distribution of power load into each department of the hospital. Firstly, the key influencing factors of the power loads were screened based on the grey relational degree analysis. Secondly, in view of the characteristics of the power loads affected by various factors and time series changes, the feature attention mechanism and sequential attention mechanism were introduced on the basis of LSTM network. The former was used to analyze the relationship between the historical information and input variables autonomously to extract important features, and the latter was used to select the historical information at critical moments of LSTM network to improve the stability of long-term prediction effects. In the end, the experimental results from the power loads of Shanxi Eye Hospital show that the LSTM model based on the double attention mechanism has the higher forecasting accuracy and stability than the conventional LSTM, CNN-LSTM and attention-LSTM models.","PeriodicalId":23976,"journal":{"name":"Wuhan University Journal of Natural Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45762464","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Machine Learning-Based Quantitative Structure-Activity Relationship and ADMET Prediction Models for ERα Activity of Anti-Breast Cancer Drug Candidates 基于机器学习的癌症候选药物ERα活性定量构效关系及ADMET预测模型

Wuhan University Journal of Natural Sciences Pub Date : 2023-06-01 DOI: 10.1051/wujns/2023283257

Zong-Ren Xu

{"title":"Machine Learning-Based Quantitative Structure-Activity Relationship and ADMET Prediction Models for ERα Activity of Anti-Breast Cancer Drug Candidates","authors":"Zong-Ren Xu","doi":"10.1051/wujns/2023283257","DOIUrl":"https://doi.org/10.1051/wujns/2023283257","url":null,"abstract":"Breast cancer is presently one of the most common malignancies worldwide, with a higher fatality rate. In this study, a quantitative structure-activity relationship (QSAR) model of compound biological activity and ADMET (Absorption, Distribution, Metabolism, Excretion, Toxicity) properties prediction model were performed using estrogen receptor alpha (ERα) antagonist information collected from compound samples. We first utilized grey relation analysis (GRA) in conjunction with the random forest (RF) algorithm to identify the top 20 molecular descriptor variables that have the greatest influence on biological activity, and then we used Spearman correlation analysis to identify 16 independent variables. Second, a QSAR model of the compound were developed based on BP neural network (BPNN), genetic algorithm optimized BP neural network (GA-BPNN), and support vector regression (SVR). The BPNN, the SVR, and the logistic regression (LR) models were then used to identify and predict the ADMET properties of substances, with the prediction impacts of each model compared and assessed. The results reveal that a SVR model was used in QSAR quantitative prediction, and in the classification prediction of ADMET properties: the SVR model predicts the Caco-2 and hERG(human Ether-a-go-go Related Gene) properties, the LR model predicts the cytochrome P450 enzyme 3A4 subtype (CYP3A4) and Micronucleus (MN) properties, and the BPNN model predicts the Human Oral Bioavailability (HOB) properties. Finally, information entropy theory is used to validate the rationality of variable screening, and sensitivity analysis of the model demonstrates that the constructed model has high accuracy and stability, which can be used as a reference for screening probable active compounds and drug discovery.","PeriodicalId":23976,"journal":{"name":"Wuhan University Journal of Natural Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44026600","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0