By integrating the merits of the map overlay method and the geographic information system (GIS), a GIS based map overlay method was developed to analyze comprehensively the environmental vulnerability around railway a...By integrating the merits of the map overlay method and the geographic information system (GIS), a GIS based map overlay method was developed to analyze comprehensively the environmental vulnerability around railway and its impact on the environment, which is adapted for the comprehensive assessment of railway environmental impact and the optimization of railway alignments. The assessment process of the GIS based map overlay method was presented, which includes deciding the system structure and weights of assessment factors, making environmental vulnerability grade maps, and evaluating the alternative alignments comprehensively to obtain the best one. With the GIS functions of spatial analysis, such as overlay analysis and buffer analysis, and functions of handling attribute data, the GIS based map overlay method overcomes the shortcomings of the existing map overlay method and the conclusion is more reasonable. In the end, a detailed case study was illustrated to verify the efficiency of the method.展开更多
After a code-table has been established by means of node association information from signal flow graph, the totally coded method (TCM) is applied merely in the domain of code operation beyond any figure-earching algo...After a code-table has been established by means of node association information from signal flow graph, the totally coded method (TCM) is applied merely in the domain of code operation beyond any figure-earching algorithm. The code-series (CS) have the holo-information nature, so that both the content and the sign of each gain-term can be determined via the coded method. The principle of this method is simple and it is suited for computer programming. The capability of the computer-aided analysis for switched current network (SIN) can be enhanced.展开更多
The graph overlay method is used to evaluate the noise impact of route alignment and the results can serve as a reference for the route alignment optimal selection. The geographic information system(GIS), with its pow...The graph overlay method is used to evaluate the noise impact of route alignment and the results can serve as a reference for the route alignment optimal selection. The geographic information system(GIS), with its powerful function of handling attribute data and spatial analysis, is adopted to calculate the noise comprehensive impact area of each alignment. With the graph overlay method, the noise vulnerability and noise impact distribution are both taken into account in the noise impact assessment of route alignment. With GIS, the efficiency of work and the reliability of result are greatly improved. By a combination of them, the noise impact on environment is fully presented in a visual way and the assessment result has vital value in route alignment optimal selection. A detailed case study is illustrated and the efficiency of the method is verified.展开更多
The imaging speed is a bottleneck for magnetic resonance imaging( MRI) since it appears. To alleviate this difficulty,a novel graph regularized sparse coding method for highly undersampled MRI reconstruction( GSCMRI) ...The imaging speed is a bottleneck for magnetic resonance imaging( MRI) since it appears. To alleviate this difficulty,a novel graph regularized sparse coding method for highly undersampled MRI reconstruction( GSCMRI) was proposed. The graph regularized sparse coding showed the potential in maintaining the geometrical information of the data. In this study, it was incorporated with two-level Bregman iterative procedure that updated the data term in outer-level and learned dictionary in innerlevel. Moreover,the graph regularized sparse coding and simple dictionary updating stages derived by the inner minimization made the proposed algorithm converge in few iterations, meanwhile achieving superior reconstruction performance. Extensive experimental results have demonstrated GSCMRI can consistently recover both real-valued MR images and complex-valued MR data efficiently,and outperform the current state-of-the-art approaches in terms of higher PSNR and lower HFEN values.展开更多
In this paper we have shown that the invariance of energy(kinetic energy,potential energy)and virtual work is the common feature of vector bond graph and finite element method in struc-tural dynamics.Then we have disc...In this paper we have shown that the invariance of energy(kinetic energy,potential energy)and virtual work is the common feature of vector bond graph and finite element method in struc-tural dynamics.Then we have discussed the vector bond graph representation of finite elementmethod in detail,there are:(1)the transformation of reference systems,(2)the transformation ofinertia matrices,stiffness matrices and vectors of joint force,(3)verctor bond graph representationof Lagrangian dynamic equation of structure.展开更多
目的探究抗菌包装领域研究的发展、研究热点及未来发展趋势,推动抗菌包装的发展。方法运用知识图谱与文献计量分析法,使用可视化分析软件CiteSpace对中国知网(CNKI)和Web of Science(WOS)数据库中2000—2024年抗菌包装领域的文献进行可...目的探究抗菌包装领域研究的发展、研究热点及未来发展趋势,推动抗菌包装的发展。方法运用知识图谱与文献计量分析法,使用可视化分析软件CiteSpace对中国知网(CNKI)和Web of Science(WOS)数据库中2000—2024年抗菌包装领域的文献进行可视化分析。结论相关文献的年发文量在整体上呈现出增长的趋势,尤其是英文文献的发文量增加显著;中文文献的研究成果在期刊分布上更为集中,外文文献则更为分散且学科覆盖更广;作者合作网络较为松散,其中国际的合作分化更为显著;通过对关键词分析显示,目前对抗菌包装的研究热点主要聚焦于抗菌材料、抗菌性能、食品保鲜应用,在未来的抗菌包装的研究中,抗菌包装的性能、新型抗菌成分与材料的开发和微观机制仍是主要研究热点,同时智能包装如环境响应型抗菌材料的研究、利用可生物降解材料与抗菌剂协同开发绿色抗菌材料将是未来的研究趋势。展开更多
陆地碳汇是碳循环的重要组成部分,在全球气候变化背景下其重要性日益凸显,相关研究受到了国内外学术界的广泛关注。采用文献计量方法,以1994—2024年间Web of Science核心合集SCI-E数据库以及CNKI数据库中所收录的共计8431篇相关文献为...陆地碳汇是碳循环的重要组成部分,在全球气候变化背景下其重要性日益凸显,相关研究受到了国内外学术界的广泛关注。采用文献计量方法,以1994—2024年间Web of Science核心合集SCI-E数据库以及CNKI数据库中所收录的共计8431篇相关文献为研究对象,运用CiteSpace软件绘制国内外文献共被引、作者共作以及关键词时间线等可视化图谱,分析了论文时间、学科、期刊以及来源国家的分布情况,给出了高影响机构、高产作者以及重要研究文献,并基于Burst检测探究了不同阶段关键词演化发展过程及未来趋势。结果表明:①近30 a来陆地碳汇发文量显著增长,2008年以后年均增幅12%,2019年以后年均增幅高达15%。②发文量较多的国家依次是中国、美国、德国、英国、加拿大等;高影响的研究机构主要有中国科学院、中国科学院大学、法国国家科学研究中心、美国农业部、巴黎-萨克雷大学等。③关键词演化过程主要分为3个阶段:1994—2008年侧重于碳循环基础理论研究,关键热词是碳循环、碳平衡和涡度相关等;2008—2019年研究热点从地球生态系统逐渐扩展到社会经济等方面,关键热词是净初级生产量、碳交换、生态补偿和低碳经济等;2019年至今紧密围绕全球碳减排目标与生态系统价值实现,关键热词是以碳中和、碳排放、温度敏感性、生态产品核算和碳交易;未来发展方向是碳汇监测核算、减排增汇提升方法、碳交易市场机制、深化国际合作等。研究成果可为厘清全球陆地碳汇发展脉络和研究热点、预测未来发展方向,以及促进我国双碳目标实现提供基础资料和政策建议。展开更多
Let G=(V,E)be a graph.For a vertex labeling f:V→Z2,it induces an edge labeling f+:E→Z2,where for each edge v1 v2∈E we have f+(v1 v2)=f(v1)+f(v2).For each i∈Z2,we use vf(i)(respectively,ef(i))to denote the number o...Let G=(V,E)be a graph.For a vertex labeling f:V→Z2,it induces an edge labeling f+:E→Z2,where for each edge v1 v2∈E we have f+(v1 v2)=f(v1)+f(v2).For each i∈Z2,we use vf(i)(respectively,ef(i))to denote the number of vertices(respectively,edges)with label i.A vertex labeling f of G is said to be friendly if vertices with different labels differ in size by at most one.The full friendly index set of a graph G,denoted by F F I(G),consists of all possible values of ef(1)-ef(0),where f ranges over all friendly labelings of G.In this paper,motivated by a problem raised by[6],we study the full friendly index sets of a family of cubic graphs.展开更多
Transmission line(TL)Parameter Identification(PI)method plays an essential role in the transmission system.The existing PI methods usually have two limitations:(1)These methods only model for single TL,and can not con...Transmission line(TL)Parameter Identification(PI)method plays an essential role in the transmission system.The existing PI methods usually have two limitations:(1)These methods only model for single TL,and can not consider the topology connection of multiple branches for simultaneous identification.(2)Transient bad data is ignored by methods,and the random selection of terminal section data may cause the distortion of PI and have serious consequences.Therefore,a multi-task PI model considering multiple TLs’spatial constraints and massive electrical section data is proposed in this paper.The Graph Attention Network module is used to draw a single TL into a node and calculate its influence coefficient in the transmission network.Multi-Task strategy of Hard Parameter Sharing is used to identify the conductance ofmultiple branches simultaneously.Experiments show that themethod has good accuracy and robustness.Due to the consideration of spatial constraints,the method can also obtain more accurate conductance values under different training and testing conditions.展开更多
Recommendation Information Systems(RIS)are pivotal in helping users in swiftly locating desired content from the vast amount of information available on the Internet.Graph Convolution Network(GCN)algorithms have been ...Recommendation Information Systems(RIS)are pivotal in helping users in swiftly locating desired content from the vast amount of information available on the Internet.Graph Convolution Network(GCN)algorithms have been employed to implement the RIS efficiently.However,the GCN algorithm faces limitations in terms of performance enhancement owing to the due to the embedding value-vanishing problem that occurs during the learning process.To address this issue,we propose a Weighted Forwarding method using the GCN(WF-GCN)algorithm.The proposed method involves multiplying the embedding results with different weights for each hop layer during graph learning.By applying the WF-GCN algorithm,which adjusts weights for each hop layer before forwarding to the next,nodes with many neighbors achieve higher embedding values.This approach facilitates the learning of more hop layers within the GCN framework.The efficacy of the WF-GCN was demonstrated through its application to various datasets.In the MovieLens dataset,the implementation of WF-GCN in LightGCN resulted in significant performance improvements,with recall and NDCG increasing by up to+163.64%and+132.04%,respectively.Similarly,in the Last.FM dataset,LightGCN using WF-GCN enhanced with WF-GCN showed substantial improvements,with the recall and NDCG metrics rising by up to+174.40%and+169.95%,respectively.Furthermore,the application of WF-GCN to Self-supervised Graph Learning(SGL)and Simple Graph Contrastive Learning(SimGCL)also demonstrated notable enhancements in both recall and NDCG across these datasets.展开更多
The 2-step domination problem is to find a minimum vertex set D of a graph such that every vertex of the graph is either in D or at distance two from some vertex of D. In the present paper, by using a labeling method,...The 2-step domination problem is to find a minimum vertex set D of a graph such that every vertex of the graph is either in D or at distance two from some vertex of D. In the present paper, by using a labeling method, we provide an O（m） time algorithm to solve the 2-step domination problem on block graphs, a superclass of trees.展开更多
文摘By integrating the merits of the map overlay method and the geographic information system (GIS), a GIS based map overlay method was developed to analyze comprehensively the environmental vulnerability around railway and its impact on the environment, which is adapted for the comprehensive assessment of railway environmental impact and the optimization of railway alignments. The assessment process of the GIS based map overlay method was presented, which includes deciding the system structure and weights of assessment factors, making environmental vulnerability grade maps, and evaluating the alternative alignments comprehensively to obtain the best one. With the GIS functions of spatial analysis, such as overlay analysis and buffer analysis, and functions of handling attribute data, the GIS based map overlay method overcomes the shortcomings of the existing map overlay method and the conclusion is more reasonable. In the end, a detailed case study was illustrated to verify the efficiency of the method.
文摘After a code-table has been established by means of node association information from signal flow graph, the totally coded method (TCM) is applied merely in the domain of code operation beyond any figure-earching algorithm. The code-series (CS) have the holo-information nature, so that both the content and the sign of each gain-term can be determined via the coded method. The principle of this method is simple and it is suited for computer programming. The capability of the computer-aided analysis for switched current network (SIN) can be enhanced.
基金Project (2004036125) supported by Postdoctoral Science Foundation of China project(2002F008 2003F012) supportedby the Science and Technology Research and Development Planning Projects of the Ministry of Railway of China
文摘The graph overlay method is used to evaluate the noise impact of route alignment and the results can serve as a reference for the route alignment optimal selection. The geographic information system(GIS), with its powerful function of handling attribute data and spatial analysis, is adopted to calculate the noise comprehensive impact area of each alignment. With the graph overlay method, the noise vulnerability and noise impact distribution are both taken into account in the noise impact assessment of route alignment. With GIS, the efficiency of work and the reliability of result are greatly improved. By a combination of them, the noise impact on environment is fully presented in a visual way and the assessment result has vital value in route alignment optimal selection. A detailed case study is illustrated and the efficiency of the method is verified.
基金National Natural Science Foundations of China(Nos.61362001,61102043,61262084)Technology Foundations of Department of Education of Jiangxi Province,China(Nos.GJJ12006,GJJ14196)Natural Science Foundations of Jiangxi Province,China(Nos.20132BAB211030,20122BAB211015)
文摘The imaging speed is a bottleneck for magnetic resonance imaging( MRI) since it appears. To alleviate this difficulty,a novel graph regularized sparse coding method for highly undersampled MRI reconstruction( GSCMRI) was proposed. The graph regularized sparse coding showed the potential in maintaining the geometrical information of the data. In this study, it was incorporated with two-level Bregman iterative procedure that updated the data term in outer-level and learned dictionary in innerlevel. Moreover,the graph regularized sparse coding and simple dictionary updating stages derived by the inner minimization made the proposed algorithm converge in few iterations, meanwhile achieving superior reconstruction performance. Extensive experimental results have demonstrated GSCMRI can consistently recover both real-valued MR images and complex-valued MR data efficiently,and outperform the current state-of-the-art approaches in terms of higher PSNR and lower HFEN values.
文摘In this paper we have shown that the invariance of energy(kinetic energy,potential energy)and virtual work is the common feature of vector bond graph and finite element method in struc-tural dynamics.Then we have discussed the vector bond graph representation of finite elementmethod in detail,there are:(1)the transformation of reference systems,(2)the transformation ofinertia matrices,stiffness matrices and vectors of joint force,(3)verctor bond graph representationof Lagrangian dynamic equation of structure.
文摘目的探究抗菌包装领域研究的发展、研究热点及未来发展趋势,推动抗菌包装的发展。方法运用知识图谱与文献计量分析法,使用可视化分析软件CiteSpace对中国知网(CNKI)和Web of Science(WOS)数据库中2000—2024年抗菌包装领域的文献进行可视化分析。结论相关文献的年发文量在整体上呈现出增长的趋势,尤其是英文文献的发文量增加显著;中文文献的研究成果在期刊分布上更为集中,外文文献则更为分散且学科覆盖更广;作者合作网络较为松散,其中国际的合作分化更为显著;通过对关键词分析显示,目前对抗菌包装的研究热点主要聚焦于抗菌材料、抗菌性能、食品保鲜应用,在未来的抗菌包装的研究中,抗菌包装的性能、新型抗菌成分与材料的开发和微观机制仍是主要研究热点,同时智能包装如环境响应型抗菌材料的研究、利用可生物降解材料与抗菌剂协同开发绿色抗菌材料将是未来的研究趋势。
文摘陆地碳汇是碳循环的重要组成部分,在全球气候变化背景下其重要性日益凸显,相关研究受到了国内外学术界的广泛关注。采用文献计量方法,以1994—2024年间Web of Science核心合集SCI-E数据库以及CNKI数据库中所收录的共计8431篇相关文献为研究对象,运用CiteSpace软件绘制国内外文献共被引、作者共作以及关键词时间线等可视化图谱,分析了论文时间、学科、期刊以及来源国家的分布情况,给出了高影响机构、高产作者以及重要研究文献,并基于Burst检测探究了不同阶段关键词演化发展过程及未来趋势。结果表明:①近30 a来陆地碳汇发文量显著增长,2008年以后年均增幅12%,2019年以后年均增幅高达15%。②发文量较多的国家依次是中国、美国、德国、英国、加拿大等;高影响的研究机构主要有中国科学院、中国科学院大学、法国国家科学研究中心、美国农业部、巴黎-萨克雷大学等。③关键词演化过程主要分为3个阶段:1994—2008年侧重于碳循环基础理论研究,关键热词是碳循环、碳平衡和涡度相关等;2008—2019年研究热点从地球生态系统逐渐扩展到社会经济等方面,关键热词是净初级生产量、碳交换、生态补偿和低碳经济等;2019年至今紧密围绕全球碳减排目标与生态系统价值实现,关键热词是以碳中和、碳排放、温度敏感性、生态产品核算和碳交易;未来发展方向是碳汇监测核算、减排增汇提升方法、碳交易市场机制、深化国际合作等。研究成果可为厘清全球陆地碳汇发展脉络和研究热点、预测未来发展方向,以及促进我国双碳目标实现提供基础资料和政策建议。
基金Supported by the National Natural Science Foundation of China(Grant No.11801149)Doctoral Fund of Henan Polytechnic University(Grant No.B2018-55)。
文摘Let G=(V,E)be a graph.For a vertex labeling f:V→Z2,it induces an edge labeling f+:E→Z2,where for each edge v1 v2∈E we have f+(v1 v2)=f(v1)+f(v2).For each i∈Z2,we use vf(i)(respectively,ef(i))to denote the number of vertices(respectively,edges)with label i.A vertex labeling f of G is said to be friendly if vertices with different labels differ in size by at most one.The full friendly index set of a graph G,denoted by F F I(G),consists of all possible values of ef(1)-ef(0),where f ranges over all friendly labelings of G.In this paper,motivated by a problem raised by[6],we study the full friendly index sets of a family of cubic graphs.
基金supported by the National Natural Science Foundation of PR China(42075130)the Postgraduate Research and Innovation Project of Jiangsu Province(1534052101133).
文摘Transmission line(TL)Parameter Identification(PI)method plays an essential role in the transmission system.The existing PI methods usually have two limitations:(1)These methods only model for single TL,and can not consider the topology connection of multiple branches for simultaneous identification.(2)Transient bad data is ignored by methods,and the random selection of terminal section data may cause the distortion of PI and have serious consequences.Therefore,a multi-task PI model considering multiple TLs’spatial constraints and massive electrical section data is proposed in this paper.The Graph Attention Network module is used to draw a single TL into a node and calculate its influence coefficient in the transmission network.Multi-Task strategy of Hard Parameter Sharing is used to identify the conductance ofmultiple branches simultaneously.Experiments show that themethod has good accuracy and robustness.Due to the consideration of spatial constraints,the method can also obtain more accurate conductance values under different training and testing conditions.
基金This work was supported by the Kyonggi University Research Grant 2022.
文摘Recommendation Information Systems(RIS)are pivotal in helping users in swiftly locating desired content from the vast amount of information available on the Internet.Graph Convolution Network(GCN)algorithms have been employed to implement the RIS efficiently.However,the GCN algorithm faces limitations in terms of performance enhancement owing to the due to the embedding value-vanishing problem that occurs during the learning process.To address this issue,we propose a Weighted Forwarding method using the GCN(WF-GCN)algorithm.The proposed method involves multiplying the embedding results with different weights for each hop layer during graph learning.By applying the WF-GCN algorithm,which adjusts weights for each hop layer before forwarding to the next,nodes with many neighbors achieve higher embedding values.This approach facilitates the learning of more hop layers within the GCN framework.The efficacy of the WF-GCN was demonstrated through its application to various datasets.In the MovieLens dataset,the implementation of WF-GCN in LightGCN resulted in significant performance improvements,with recall and NDCG increasing by up to+163.64%and+132.04%,respectively.Similarly,in the Last.FM dataset,LightGCN using WF-GCN enhanced with WF-GCN showed substantial improvements,with the recall and NDCG metrics rising by up to+174.40%and+169.95%,respectively.Furthermore,the application of WF-GCN to Self-supervised Graph Learning(SGL)and Simple Graph Contrastive Learning(SimGCL)also demonstrated notable enhancements in both recall and NDCG across these datasets.
基金Supported by the National Natural Science Foundation of China(Grant No.11271365)the Domestic Senior Visiting Scholar Program in Higher Occupation Colleges in Jiangsu Province(Grant No.2014FX075)
文摘The 2-step domination problem is to find a minimum vertex set D of a graph such that every vertex of the graph is either in D or at distance two from some vertex of D. In the present paper, by using a labeling method, we provide an O（m） time algorithm to solve the 2-step domination problem on block graphs, a superclass of trees.
