首页期刊导航|武汉大学自然科学学报（英文版）
期刊信息/Journal information
武汉大学自然科学学报（英文版）
武汉大学自然科学学报（英文版）

刘经南

双月刊

1007-1202

Whdy@whu.edu.cn

027-68752259

430072

湖北武昌珞珈山武汉大学梅园一舍

武汉大学自然科学学报（英文版）/Journal Wuhan University Journal of Natural SciencesCSCDCSTPCD北大核心
查看更多>>本刊创刊于1996年。本刊是自然科学综合性学术期刊，主要刊登自然科学各学科的最新研究成果。本刊已被《EI》、《CA》、《SA》、《AJ》、《JOURICK》、《MR》等作为刊源收录，《SCI》正在对本刊进行评估。
正式出版
收录年代

    A Class of Inverse Boundary Value Problems for(λ,1)Bi-Analytic Functions

    LIN Juan
    185-191页
    查看更多>>摘要：In this paper,a class of inverse boundary value problems for(λ,1)bi-analytic functions is given.Using the method of Riemann boundary value problem for analytic functions,the conditions of solvability and the expression of the solutions for the inverse problems are obtained
      原文链接:
    • NETL
    • NSTL
    • 万方数据

    The Number of Perfect Matchings in(3,6)-Fullerene

    YANG RuiYUAN Mingzhu
    192-200页
    查看更多>>摘要：A(3,6)-fullerene is a connected cubic plane graph whose faces are only triangles and hexagons,and has the connectivity 2 or 3.The(3,6)-fullerenes with connectivity 2 are the tubes consisting of l concentric hexagonal layers such that each layer consists of two hexa-gons,capped on each end by two adjacent triangles,denoted by T1(l≥1).A(3,6)-fullerene T1 with n vertices has exactly 24+1 perfect matchings.The structure of a(3,6)-fullerene G with connectivity 3 can be determined by only three parameters r,s and t,thus we denote it by G=(r,s,t),where r is the radius(number of rings),s is the size(number of spokes in each layer,s ≥ 4,s is even),and t is the torsion(0≤t＜s,t≡r mod 2).In this paper,the counting formula of the perfect matchings in G=(n+1,4,t)is given,and the number of perfect match-ings is obtained.Therefore,the correctness of the conclusion that every bridgeless cubic graph with p vertices has at least 23656 perfect matchings proposed by Esperet et al is verified for(3,6)-fullerene G=(n+1,4,t).
      原文链接:
    • NETL
    • NSTL
    • 万方数据

    I-Total Coloring and Ⅵ-Total Coloring of mC4 Vertex-Distinguished by Multiple Sets

    WANG NanaCHEN Xiang'en
    201-206页
    查看更多>>摘要：We give the optimal Ⅰ-(Ⅵ-)total colorings of mC4 which are vertex-distinguished by multiple sets by the use of the method of constructing a matrix whose entries are the suitable multiple sets or empty sets and the method of distributing color set in advance.Thereby we obtain Ⅰ-(Ⅵ-)total chromatic numbers of mC4 which are vertex-distinguished by multiple sets.
      原文链接:
    • NETL
    • NSTL
    • 万方数据

    Noether Theorem for Fractional Singular Systems

    SONG ChuanjingZHAI Xianghua
    207-216页
    查看更多>>摘要：Noether theorems for two fractional singular systems are discussed.One system involves mixed integer and Caputo fractional derivatives,and the other involves only Caputo fractional derivatives.Firstly,the fractional primary constraints and the fractional con-strained Hamilton equations are given.Then,the fractional Noether theorems of the two fractional singular systems are established,includ-ing the fractional Noether identities,the fractional Noether quasi-identities and the fractional conserved quantities.Finally,the results ob-tained are illustrated by two examples.
      原文链接:
    • NETL
    • NSTL
    • 维普
    • 万方数据

    The Non-Convergence of Steiner Symmetrizations

    WANG TianLIN Youjiang
    217-220页
    查看更多>>摘要：In this paper,we demonstrate the existence of iterated Steiner symmetrizations of K that does not converge,even if the se-quence of directions is dense in the unit sphere.
      原文链接:
    • NETL
    • NSTL
    • 维普
    • 万方数据

    On Packing Trees into Complete Bipartite Graphs

    PENG YanlingWANG Hong
    221-222页
    查看更多>>摘要：Let Bn(X,Y)denote the complete bipartite graph of order n with vertex partition sets X and Y.We prove that for each tree T of order n,there is a packing of k copies of T into a complete bipartite graph Bn+m(X,Y).The ideal of the work comes from the"Tree packing conjecture"made by Gyráfás and Lehel.Bollobás confirmed the"Tree packing conjecture"for many small trees,who showed that one can pack T1,T2,…,Tn/√2 into Kn and that a better bound would follow from a famous conjecture of Erdös.In a similar direction,Hobbs,Bour-geois and Kasiraj made the following conjecture:Any sequence of trees T2,…,Tn,with Ti having order i,can be packed into Kn-1,[n/2].Fur-ther Hobbs,Bourgeois and Kasiraj proved that any two trees can be packed into a complete bipartite graph Kn-1,[n/2].Motivated by these re-sults,Wang Hong proposed the conjecture:For each tree T of order n,there is a k-packing of T in some complete bipartite graph Bn+k-1(X,Y).In this paper,we prove a weak version of this conjecture.
      原文链接:
    • NETL
    • NSTL
    • 维普
    • 万方数据

    A Power Load Prediction by LSTM Model Based on the Double Attention Mechanism for Hospital Building

    FENG ZengxiGE XunZHOU YaojiaLI Jiale...
    223-236页
    查看更多>>摘要：This work proposed a LSTM(long short-term memory)model based on the double attention mechanism for power load predic-tion,to further improve the energy-saving potential and accurately control the distribution of power load into each department of the hospi-tal.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 at-tention 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 accu-racy and stability than the conventional LSTM,CNN-LSTM and attention-LSTM models.
      原文链接:
    • NETL
    • NSTL
    • 维普
    • 万方数据

    Fine-Tuning Pre-Trained CodeBERT for Code Search in Smart Contract

    JIN HuanLI Qinying
    237-245页
    查看更多>>摘要：Smart contracts,which automatically execute on decentralized platforms like Ethereum,require high security and low gas con-sumption.As a result,developers have a strong demand for semantic code search tools that utilize natural language queries to efficiently search for existing code snippets.However,existing code search models face a semantic gap between code and queries,which requires a large amount of training data.In this paper,we propose a fine-tuning approach to bridge the semantic gap in code search and improve the search accuracy.We collect 80 723 different pairs of<comment,code snippet>from Etherscan.io and use these pairs to fine-tune,validate,and test the pre-trained CodeBERT model.Using the fine-tuned model,we develop a code search engine specifically for smart contracts.We evaluate the Recall@k and Mean Reciprocal Rank(MRR)of the fine-tuned CodeBERT model using different proportions of the fine-tuned data.It is encouraging that even a small amount of fine-tuned data can produce satisfactory results.In addition,we perform a com-parative analysis between the fine-tuned CodeBERT model and the two state-of-the-art models.The experimental results show that the fine-tuned CodeBERT model has superior performance in terms of Recalll@k and MRR.These findings highlight the effectiveness of our fine-tuning approach and its potential to significantly improve the code search accuracy.
      原文链接:
    • NETL
    • NSTL
    • 维普
    • 万方数据

    Nonlinear Program Construction and Verification Method Based on Partition Recursion and Morgan's Refinement Rules

    WANG ChangjingCAO ZhongxiongYU ChulingWANG Changchang...
    246-256页
    查看更多>>摘要：The traditional program refinement strategy cannot be refined to an executable program,and there are issues such as low verifi-cation reliability and automation.To solve the above problems,this paper proposesa 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 in-variant is difficult to obtain and the refinement process is insufficiently detailed.At the same time,the method improves verification pro-cess automation and reduces the manual verification workload.
      原文链接:
    • NETL
    • NSTL
    • 万方数据

    Machine Learning-Based Quantitative Structure-Activity Relationship and ADMET Prediction Models for ERa Activity of Anti-Breast Cancer Drug Candidates

    XU Zonghuang
    257-270页
    查看更多>>摘要：Breast cancer is presently one of the most common malignancies worldwide,with a higher fatality rate.In this study,a quantita-tive structure-activity relationship(QSAR)model of compound biological activity and ADMET(Absorption,Distribution,Metabolism,Ex-cretion,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 regres-sion(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 pre-dicts 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 sen-sitivity 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.
      原文链接:
    • NETL
    • NSTL
    • 万方数据