A nowhere-zero k-flow on a graph G=(V(G),E(G))is a pair(D,f),where D is an orientation on E(G)and f:E(G)→{±1,±2,,±(k-1)}is a function such that the total outflow equals to the total inflow at each vert...A nowhere-zero k-flow on a graph G=(V(G),E(G))is a pair(D,f),where D is an orientation on E(G)and f:E(G)→{±1,±2,,±(k-1)}is a function such that the total outflow equals to the total inflow at each vertex.This concept was introduced by Tutte as an extension of face colorings,and Tutte in 1954 conjectured that every bridgeless graph admits a nowhere-zero 5-flow,known as the 5-Flow Conjecture.This conjecture is verified for some graph classes and remains unresolved as of today.In this paper,we show that every bridgeless graph of Euler genus at most 20 admits a nowhere-zero 5-flow,which improves several known results.展开更多
Given two graphs G and H,the Ramsey number R(G,H)is the smallest positive integer N such that every 2-coloring of the edges of K_(N)contains either a red G or a blue H.Let K_(N-1)■K_(1,k)be the graph obtained from K_...Given two graphs G and H,the Ramsey number R(G,H)is the smallest positive integer N such that every 2-coloring of the edges of K_(N)contains either a red G or a blue H.Let K_(N-1)■K_(1,k)be the graph obtained from K_(N-1)by adding anew vertexνconnecting k vertices of K_(N-1).A graph G withχ(G)=k+1 is called edge-critical if G contains an edge e such thatχ(G-e)=k.A considerable amount of research has been conducted by previous scholars on Ramsey numbers ofgraphs.In this study,we show that for an edge-critical graph G with x(G)=k+1,when k≥2,1≥2,and n is sufficiently large,R(G,K_(1)+nK_(t))=knt+1 and r,(G,K_(1)+nK_(t))=(k-1)nt+1.展开更多
Urban combat environments pose complex and variable challenges for UAV path planning due to multidimensional factors,such as static and dynamic obstructions as well as risks of exposure to enemy detection,which threat...Urban combat environments pose complex and variable challenges for UAV path planning due to multidimensional factors,such as static and dynamic obstructions as well as risks of exposure to enemy detection,which threaten flight safety and mission success.Traditional path planning methods typically depend solely on the distribution of static obstacles to generate collision-free paths,without accounting for constraints imposed by enemy detection and strike capabilities.Such a simplified approach can yield safety-compromising routes in highly complex urban airspace.To address these limitations,this study proposes a multi-parameter path planning method based on reachable airspace visibility graphs,which integrates UAV performance constraints,environmental limitations,and exposure risks.An innovative heuristic algorithm is developed to balance operational safety and efficiency by both exposure risks and path length.In the case study set in a typical mixed-use urban area,analysis of airspace visibility graphs reveals significant variations in exposure risk at different regions and altitudes due to building encroachments.Path optimization results indicate that the method can effectively generate covert and efficient flight paths by dynamically adjusting the exposure index,which represents the likelihood of enemy detection,and the path length,which corresponds to mission execution time.展开更多
The detection and recognition of radar signals play a critical role in the maintenance of future electronic warfare(EW).So far,however,there are still problems with signal detection and recognition,especially in the l...The detection and recognition of radar signals play a critical role in the maintenance of future electronic warfare(EW).So far,however,there are still problems with signal detection and recognition,especially in the low probability of intercept(LPI)radar.This paper explores the usefulness of such an algorithm in the scenario of LPI radar signal detection and recognition based on visibility graphs(VG).More network and feature information can be extracted in the VG two-dimensional space,this algorithm can solve the problem of signal recognition using the autocorrelation function.Wavelet denoising processing is introduced into the signal to be tested,and the denoised signal is converted to the VG domain.Then,the signal detection is performed by using the constant false alarm of the VG average degree.Next,weight the converted graph.Finally,perform feature extraction on the weighted image,and use the feature to complete the recognition.It is testified that the proposed algorithm offers significant improvements,such as robustness to noise,and the detection and recognition accuracy,over the recent researches.展开更多
Since the beginning of the 21st century,advances in big data and artificial intelligence have driven a paradigm shift in the geosciences,moving the field from qualitative descriptions toward quantitative analysis,from...Since the beginning of the 21st century,advances in big data and artificial intelligence have driven a paradigm shift in the geosciences,moving the field from qualitative descriptions toward quantitative analysis,from observing phenomena to uncovering underlying mechanisms,from regional-scale investigations to global perspectives,and from experience-based inference toward data-and model-enabled intelligent prediction.AlphaEarth Foundations(AEF)is a next-generation geospatial intelligence platform that addresses these changes by introducing a unified 64-dimensional shared embedding space,enabling-for the first time-standardized representation and seamless integration of 12 distinct types of Earth observation data,including optical,radar,and lidar.This framework significantly improves data assimilation efficiency and resolves the persistent problem of“data silos”in geoscience research.AEF is helping redefine research methodologies and fostering breakthroughs,particularly in quantitative Earth system science.This paper systematically examines how AEF’s innovative architecture-featuring multi-source data fusion,high-dimensional feature representation learning,and a scalable computational framework-facilitates intelligent,precise,and realtime data-driven geoscientific research.Using case studies from resource and environmental applications,we demonstrate AEF’s broad potential and identify emerging innovation needs.Our findings show that AEF not only enhances the efficiency of solving traditional geoscientific problems but also stimulates novel research directions and methodological approaches.展开更多
Causality,the science of cause and effect,has made it possible to create a new family of models.Such models are often referred to as causal models.Unlike those of mathematical,numerical,empirical,or machine learning(M...Causality,the science of cause and effect,has made it possible to create a new family of models.Such models are often referred to as causal models.Unlike those of mathematical,numerical,empirical,or machine learning(ML)nature,causal models hope to tie the cause(s)to the effect(s)pertaining to a phenomenon(i.e.,data generating process)through causal principles.This paper presents one of the first works at creating causal models in the area of structural and construction engineering.To this end,this paper starts with a brief review of the principles of causality and then adopts four causal discovery algorithms,namely,PC(Peter-Clark),FCI(fast causal inference),GES(greedy equivalence search),and GRa SP(greedy relaxation of the sparsest permutation),have been used to examine four phenomena,including predicting the load-bearing capacity of axially loaded members,fire resistance of structural members,shear strength of beams,and resistance of walls against impulsive(blast)loading.Findings from this study reveal the possibility and merit of discovering complete and partial causal models.Finally,this study also proposes two simple metrics that can help assess the performance of causal discovery algorithms.展开更多
With the popularization of social media,public opi-nion information on emergencies spreads rapidly on the Internet,the impact of negative public opinions on an event has become more significant.Based on the organizati...With the popularization of social media,public opi-nion information on emergencies spreads rapidly on the Internet,the impact of negative public opinions on an event has become more significant.Based on the organizational form of public opinion information,the knowledge graph is used to construct the knowledge base of public opinion risk cases on the emer-gency network.The emotion recognition model of negative pub-lic opinion information based on the bi-directional long short-term memory(BiLSTM)network is studied in the model layer design,and a linear discriminant analysis(LDA)topic extraction method combined with association rules is proposed to extract and mine the semantics of negative public opinion topics to real-ize further in-depth analysis of information topics.Focusing on public health emergencies,knowledge acquisition and knowl-edge processing of public opinion information are conducted,and the experimental results show that the knowledge graph framework based on the construction can facilitate in-depth theme evolution analysis of public opinion events,thus demon-strating important research significance for reducing online pub-lic opinion risks.展开更多
Tracking and analyzing data from research projects is critical for understanding research trends and supporting the development of science and technology strategies.However,the data from these projects is often comple...Tracking and analyzing data from research projects is critical for understanding research trends and supporting the development of science and technology strategies.However,the data from these projects is often complex and inadequate,making it challenging for researchers to conduct in-depth data mining to improve policies or management.To address this problem,this paper adopts a top-down approach to construct a knowledge graph(KG)for research projects.Firstly,we construct an integrated ontology by referring to the metamodel of various architectures,which is called the meta-model integration conceptual reference model.Subsequently,we use the dependency parsing method to extract knowledge from unstructured textual data and use the entity alignment method based on weakly supervised learning to classify the extracted entities,completing the construction of the KG for the research projects.In addition,a knowledge inference model based on representation learning is employed to achieve knowledge completion and improve the KG.Finally,experiments are conducted on the KG for research projects and the results demonstrate the effectiveness of the proposed method in enriching incomplete data within the KG.展开更多
For every integer 4≤d≤11,an explicit construction of infinite families of 2d-regular unique-neighbor expanders is presented,which is a generalization of the 6-regular unique-neighbors initially developed by Alon and...For every integer 4≤d≤11,an explicit construction of infinite families of 2d-regular unique-neighbor expanders is presented,which is a generalization of the 6-regular unique-neighbors initially developed by Alon and Capalbo.Additionally,for values of d greater than 11,a sufficient condition is established for employing the same construction method.Our construction method involves the“line product”of large bipartite Ramanujan graphs and a sufficiently good unique-neighbor expander(a small gadget).展开更多
文摘A nowhere-zero k-flow on a graph G=(V(G),E(G))is a pair(D,f),where D is an orientation on E(G)and f:E(G)→{±1,±2,,±(k-1)}is a function such that the total outflow equals to the total inflow at each vertex.This concept was introduced by Tutte as an extension of face colorings,and Tutte in 1954 conjectured that every bridgeless graph admits a nowhere-zero 5-flow,known as the 5-Flow Conjecture.This conjecture is verified for some graph classes and remains unresolved as of today.In this paper,we show that every bridgeless graph of Euler genus at most 20 admits a nowhere-zero 5-flow,which improves several known results.
基金supported by the National Key Research and Development Program of China(2023YFA1010200,2020YFA0713100)the National Natural Science Foundation of China(12071453)the Innovation Program for Quantum Science and Technology(2021ZD0302902).
文摘Given two graphs G and H,the Ramsey number R(G,H)is the smallest positive integer N such that every 2-coloring of the edges of K_(N)contains either a red G or a blue H.Let K_(N-1)■K_(1,k)be the graph obtained from K_(N-1)by adding anew vertexνconnecting k vertices of K_(N-1).A graph G withχ(G)=k+1 is called edge-critical if G contains an edge e such thatχ(G-e)=k.A considerable amount of research has been conducted by previous scholars on Ramsey numbers ofgraphs.In this study,we show that for an edge-critical graph G with x(G)=k+1,when k≥2,1≥2,and n is sufficiently large,R(G,K_(1)+nK_(t))=knt+1 and r,(G,K_(1)+nK_(t))=(k-1)nt+1.
基金supported by the Ministry of Industry and Information Technology(No.23100002022102001)。
文摘Urban combat environments pose complex and variable challenges for UAV path planning due to multidimensional factors,such as static and dynamic obstructions as well as risks of exposure to enemy detection,which threaten flight safety and mission success.Traditional path planning methods typically depend solely on the distribution of static obstacles to generate collision-free paths,without accounting for constraints imposed by enemy detection and strike capabilities.Such a simplified approach can yield safety-compromising routes in highly complex urban airspace.To address these limitations,this study proposes a multi-parameter path planning method based on reachable airspace visibility graphs,which integrates UAV performance constraints,environmental limitations,and exposure risks.An innovative heuristic algorithm is developed to balance operational safety and efficiency by both exposure risks and path length.In the case study set in a typical mixed-use urban area,analysis of airspace visibility graphs reveals significant variations in exposure risk at different regions and altitudes due to building encroachments.Path optimization results indicate that the method can effectively generate covert and efficient flight paths by dynamically adjusting the exposure index,which represents the likelihood of enemy detection,and the path length,which corresponds to mission execution time.
基金This work was supported by the National Defence Pre-research Foundation of China(30502010103).
文摘The detection and recognition of radar signals play a critical role in the maintenance of future electronic warfare(EW).So far,however,there are still problems with signal detection and recognition,especially in the low probability of intercept(LPI)radar.This paper explores the usefulness of such an algorithm in the scenario of LPI radar signal detection and recognition based on visibility graphs(VG).More network and feature information can be extracted in the VG two-dimensional space,this algorithm can solve the problem of signal recognition using the autocorrelation function.Wavelet denoising processing is introduced into the signal to be tested,and the denoised signal is converted to the VG domain.Then,the signal detection is performed by using the constant false alarm of the VG average degree.Next,weight the converted graph.Finally,perform feature extraction on the weighted image,and use the feature to complete the recognition.It is testified that the proposed algorithm offers significant improvements,such as robustness to noise,and the detection and recognition accuracy,over the recent researches.
基金National Natural Science Foundation of China Key Project(No.42050103)Higher Education Disciplinary Innovation Program(No.B25052)+2 种基金the Guangdong Pearl River Talent Program Innovative and Entrepreneurial Team Project(No.2021ZT09H399)the Ministry of Education’s Frontiers Science Center for Deep-Time Digital Earth(DDE)(No.2652023001)Geological Survey Project of China Geological Survey(DD20240206201)。
文摘Since the beginning of the 21st century,advances in big data and artificial intelligence have driven a paradigm shift in the geosciences,moving the field from qualitative descriptions toward quantitative analysis,from observing phenomena to uncovering underlying mechanisms,from regional-scale investigations to global perspectives,and from experience-based inference toward data-and model-enabled intelligent prediction.AlphaEarth Foundations(AEF)is a next-generation geospatial intelligence platform that addresses these changes by introducing a unified 64-dimensional shared embedding space,enabling-for the first time-standardized representation and seamless integration of 12 distinct types of Earth observation data,including optical,radar,and lidar.This framework significantly improves data assimilation efficiency and resolves the persistent problem of“data silos”in geoscience research.AEF is helping redefine research methodologies and fostering breakthroughs,particularly in quantitative Earth system science.This paper systematically examines how AEF’s innovative architecture-featuring multi-source data fusion,high-dimensional feature representation learning,and a scalable computational framework-facilitates intelligent,precise,and realtime data-driven geoscientific research.Using case studies from resource and environmental applications,we demonstrate AEF’s broad potential and identify emerging innovation needs.Our findings show that AEF not only enhances the efficiency of solving traditional geoscientific problems but also stimulates novel research directions and methodological approaches.
文摘Causality,the science of cause and effect,has made it possible to create a new family of models.Such models are often referred to as causal models.Unlike those of mathematical,numerical,empirical,or machine learning(ML)nature,causal models hope to tie the cause(s)to the effect(s)pertaining to a phenomenon(i.e.,data generating process)through causal principles.This paper presents one of the first works at creating causal models in the area of structural and construction engineering.To this end,this paper starts with a brief review of the principles of causality and then adopts four causal discovery algorithms,namely,PC(Peter-Clark),FCI(fast causal inference),GES(greedy equivalence search),and GRa SP(greedy relaxation of the sparsest permutation),have been used to examine four phenomena,including predicting the load-bearing capacity of axially loaded members,fire resistance of structural members,shear strength of beams,and resistance of walls against impulsive(blast)loading.Findings from this study reveal the possibility and merit of discovering complete and partial causal models.Finally,this study also proposes two simple metrics that can help assess the performance of causal discovery algorithms.
基金supported by the National Social Science Foundation Major Project(22&ZD135)the National Social Science Fund National Emergency Management System Construction Research Project(20VYJ061).
文摘With the popularization of social media,public opi-nion information on emergencies spreads rapidly on the Internet,the impact of negative public opinions on an event has become more significant.Based on the organizational form of public opinion information,the knowledge graph is used to construct the knowledge base of public opinion risk cases on the emer-gency network.The emotion recognition model of negative pub-lic opinion information based on the bi-directional long short-term memory(BiLSTM)network is studied in the model layer design,and a linear discriminant analysis(LDA)topic extraction method combined with association rules is proposed to extract and mine the semantics of negative public opinion topics to real-ize further in-depth analysis of information topics.Focusing on public health emergencies,knowledge acquisition and knowl-edge processing of public opinion information are conducted,and the experimental results show that the knowledge graph framework based on the construction can facilitate in-depth theme evolution analysis of public opinion events,thus demon-strating important research significance for reducing online pub-lic opinion risks.
基金supported by the National Natural Science Foundation of China(72101263).
文摘Tracking and analyzing data from research projects is critical for understanding research trends and supporting the development of science and technology strategies.However,the data from these projects is often complex and inadequate,making it challenging for researchers to conduct in-depth data mining to improve policies or management.To address this problem,this paper adopts a top-down approach to construct a knowledge graph(KG)for research projects.Firstly,we construct an integrated ontology by referring to the metamodel of various architectures,which is called the meta-model integration conceptual reference model.Subsequently,we use the dependency parsing method to extract knowledge from unstructured textual data and use the entity alignment method based on weakly supervised learning to classify the extracted entities,completing the construction of the KG for the research projects.In addition,a knowledge inference model based on representation learning is employed to achieve knowledge completion and improve the KG.Finally,experiments are conducted on the KG for research projects and the results demonstrate the effectiveness of the proposed method in enriching incomplete data within the KG.
文摘For every integer 4≤d≤11,an explicit construction of infinite families of 2d-regular unique-neighbor expanders is presented,which is a generalization of the 6-regular unique-neighbors initially developed by Alon and Capalbo.Additionally,for values of d greater than 11,a sufficient condition is established for employing the same construction method.Our construction method involves the“line product”of large bipartite Ramanujan graphs and a sufficiently good unique-neighbor expander(a small gadget).
