Given a simple graph G and a positive integer k, the induced matching k-partition problem asks whether there exists a k-partition (V 1, V 2, ..., V k) of V(G) such that for each i(1≤i≤k), G[V i] is 1-regular. This p...Given a simple graph G and a positive integer k, the induced matching k-partition problem asks whether there exists a k-partition (V 1, V 2, ..., V k) of V(G) such that for each i(1≤i≤k), G[V i] is 1-regular. This paper studies the computational complexity of this problem for graphs with small diameters. The main results are as follows: Induced matching 2-partition problem of graphs with diameter 6 and induced matching 3-partition problem of graphs with diameter 2 are NP-complete; induced matching 2-partition problem of graphs with diameter 2 is polynomially solvable.展开更多
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 ...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 hexangons,capped on each end by two adjacent triangles,denoted by T_(l)(l≥1).A(3,6)-fullerene Tl with n vertices has exactly 2n/4+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 matchpings is obtained.Therefore,the correctness of the conclusion that every bridgeless cubic graph with p vertices has at least 2p/3656perfect matchings proposed by Esperet et al is verified for(3,6)-fullerene G=(n+1,4,t).展开更多
Enumeration of perfect matchings on graphs has a longstanding interest in combinatorial mathematics. In this paper, we obtain some explicit expressions of the number of perfect matchings for a type of Archimedean latt...Enumeration of perfect matchings on graphs has a longstanding interest in combinatorial mathematics. In this paper, we obtain some explicit expressions of the number of perfect matchings for a type of Archimedean lattices with toroidal boundary by applying Tesler's crossing orientations to obtain some Pfaffan orientations and enumerating their Pfaffans.展开更多
Let I with |I| = k be a matching of a graph G (briefly, I is called a k-matching). If I is not a proper subset of any other matching of G, then I is a maximal k-matching and m(gk, G) is used to denote the number of ma...Let I with |I| = k be a matching of a graph G (briefly, I is called a k-matching). If I is not a proper subset of any other matching of G, then I is a maximal k-matching and m(gk, G) is used to denote the number of maximal k-matchings of G. Let gk be a k-matching of G, if there exists a subset {e1, e2,…, ei} of E(G) \ gk, i (?)1, such that (1) for any j ∈ {1, 2,…,i}, gk + {ej} is a (k + l)-matching of G; (2) for any f ∈ E(G) \ (gk ∪ {e1,e2,…,ei}), gk + {f} is not a matching of G; then gk, is called an i wings k-matching of G and mi(gk,G) is used to denote the number of i wings k-matchings of G. In this paper, it is proved that both mi(gk,G) and m(gk,G) are edge reconstructible for every connected graph G, and as a corollary, it is shown that the matching polynomial is edge reconstructible.展开更多
The induced matching cover number of a graph G without isolated vertices, denoted by imc(G),is the minimum integer k such that G has k induced matchings {M1,M2,···,Mk}such that,V(M1)∪V(M2)∪··...The induced matching cover number of a graph G without isolated vertices, denoted by imc(G),is the minimum integer k such that G has k induced matchings {M1,M2,···,Mk}such that,V(M1)∪V(M2)∪···∪V(Mk)covers V(G).This paper shows that,if G is a 3-regular claw-free graph,then imc(G)∈{2,3}.展开更多
In 2012, Gutman and Wagner proposed the concept of the matching energy of a graph and pointed out that its chemical applications can go back to the 1970s. The matching energy of a graph is defined as the sum of the ab...In 2012, Gutman and Wagner proposed the concept of the matching energy of a graph and pointed out that its chemical applications can go back to the 1970s. The matching energy of a graph is defined as the sum of the absolute values of the zeros of its matching polynomial. Let u and v be the non-isolated vertices of the graphs G and H with the same order, respectively. Let wi?be a non-isolated vertex of graph Gi?where i=1, 2, …, k. We use Gu(k)?(respectively, Hv(k)) to denote the graph which is the coalescence of G (respectively, H) and G1, G2,…, Gk?by identifying the vertices u (respectively, v) and w1, w2,…, wk. In this paper, we first present a new technique of directly comparing the matching energies of Gu(k)?and Hv(k), which can tackle some quasi-order incomparable problems. As the applications of the technique, then we can determine the unicyclic graphs with perfect matchings of order 2n with the first to the ninth smallest matching energies for all n≥211.展开更多
This article extend the John E. Hopcroft and Richart M. Karp Algorithm (HK Algorithm) for maximum matchings in bipartite graphs to the non-bipartite case by providing a new approach to deal with the blossom in alterna...This article extend the John E. Hopcroft and Richart M. Karp Algorithm (HK Algorithm) for maximum matchings in bipartite graphs to the non-bipartite case by providing a new approach to deal with the blossom in alternating paths in the process of searching for augmenting paths, which different from well-known “shrinking” way of Edmonds and makes the algorithm for maximum matchings in general graphs more simple.展开更多
Let G be a properly colored bipartite graph. A rainbow matching of G is such a matching in which no two edges have the same color. Let G be a properly colored bipartite graph with bipartition (X,Y) and . We show that ...Let G be a properly colored bipartite graph. A rainbow matching of G is such a matching in which no two edges have the same color. Let G be a properly colored bipartite graph with bipartition (X,Y) and . We show that if , then G has a rainbow coloring of size at least .展开更多
Let k be a positive integer and G a bipartite graph with bipartition (X,Y). A perfect 1-k matching is an edge subset M of G such that each vertex in Y is incident with exactly one edge in M and each vertex in X is inc...Let k be a positive integer and G a bipartite graph with bipartition (X,Y). A perfect 1-k matching is an edge subset M of G such that each vertex in Y is incident with exactly one edge in M and each vertex in X is incident with exactly k edges in M. A perfect 1-k matching is an optimal semi-matching related to the load-balancing problem, where a semi-matching is an edge subset M such that each vertex in Y is incident with exactly one edge in M, and a vertex in X can be incident with an arbitrary number of edges in M. In this paper, we give three sufficient and necessary conditions for the existence of perfect 1-k matchings and for the existence of 1-k matchings covering | X |−dvertices in X, respectively, and characterize k-elementary bipartite graph which is a graph such that the subgraph induced by all k-allowed edges is connected, where an edge is k-allowed if it is contained in a perfect 1-k matching.展开更多
The spatial optimization of best management practices(BMPs) plays a critical role in precise watershed pollution control. However, the effectiveness of BMPs exhibits a complex nonlinear dependence on both configuratio...The spatial optimization of best management practices(BMPs) plays a critical role in precise watershed pollution control. However, the effectiveness of BMPs exhibits a complex nonlinear dependence on both configuration unit scale and rainfall intensity, often leading to widespread spatiotemporal mismatches during implementation. To fill this gap, this study proposes a new framework:(a) delineating configuration units based on the implementation scale differences between structural and nonstructural BMPs;(b) incorporating BMP reduction thresholds to enable dynamic adjustment of design scales according to inflow loads;and(c) developing a staged allocation strategy tailored to varying rainfall scenarios. The framework is exemplified by an agricultural catchment in the southeastern Liaohe watershed, China. The results showed that the framework could improve the assessment accuracy and cost-effectiveness of pollution control. Specifically, neglecting BMP reduction thresholds resulted in a 51.35% underestimation of treatment costs. Incorporating these thresholds and dynamically adjusting BMP design scales reduced treatment costs by 62.70%. Furthermore, the framework facilitated more precise localization of structural BMPs(1 km^(2)) and improved optimization efficiency by 95.91%. The proposed staged allocation strategy ensured water quality compliance under varying rainfall intensities. Structural BMPs primarily addressed pollution from light to moderate rainfall in the initial stage, while nonstructural BMPs targeted heavy rainfall pollution in the subsequent stage. The proposed framework may enhance the spatiotemporal adaptability of BMP configuration to respond to the threats posed by climate change and human activities. It can also be extended to other agriculture-dominated watersheds.展开更多
Stereo matching is a pivotal task in computer vision,enabling precise depth estimation from stereo image pairs,yet it encounters challenges in regions with reflections,repetitive textures,or fine structures.In this pa...Stereo matching is a pivotal task in computer vision,enabling precise depth estimation from stereo image pairs,yet it encounters challenges in regions with reflections,repetitive textures,or fine structures.In this paper,we propose a Semantic-Guided Parallax Attention Stereo Matching Network(SGPASMnet)that can be trained in unsupervised manner,building upon the Parallax Attention Stereo Matching Network(PASMnet).Our approach leverages unsupervised learning to address the scarcity of ground truth disparity in stereo matching datasets,facilitating robust training across diverse scene-specific datasets and enhancing generalization.SGPASMnet incorporates two novel components:a Cross-Scale Feature Interaction(CSFI)block and semantic feature augmentation using a pre-trained semantic segmentation model,SegFormer,seamlessly embedded into the parallax attention mechanism.The CSFI block enables effective fusion ofmulti-scale features,integrating coarse and fine details to enhance disparity estimation accuracy.Semantic features,extracted by SegFormer,enrich the parallax attention mechanism by providing high-level scene context,significantly improving performance in ambiguous regions.Our model unifies these enhancements within a cohesive architecture,comprising semantic feature extraction,an hourglass network,a semantic-guided cascaded parallax attentionmodule,outputmodule,and a disparity refinement network.Evaluations on the KITTI2015 dataset demonstrate that our unsupervised method achieves a lower error rate compared to the original PASMnet,highlighting the effectiveness of our enhancements in handling complex scenes.By harnessing unsupervised learning without ground truth disparity needed,SGPASMnet offers a scalable and robust solution for accurate stereo matching,with superior generalization across varied real-world applications.展开更多
The rapid advancement of 5G/6G communication and radar technology has exacerbated issues of electromagnetic wave(EMW)leakage,interference,and thermal management.Therefore,developing lightweight EMW absorbers that inte...The rapid advancement of 5G/6G communication and radar technology has exacerbated issues of electromagnetic wave(EMW)leakage,interference,and thermal management.Therefore,developing lightweight EMW absorbers that integrate strong absorption,broad bandwidth,and thermal stability is crucial.Herein,a 3D MXene sponge/NiFe@NC heterostructure with tunable pore architecture is constructed by pyrolyzing a polyurethane(PU)foam template uniformly coated with NiFe-decorated Ti_(3)C_(2)T_(x)MXene nanosheets.The resulting porous dielectric-magnetic network integrates interconnected MXene pathways with uniformly dispersed NiFe@NC nanoparticles,enabling a synergistic effect of dielectric-magnetic loss through conduction loss,dipole/interface polarization,and magnetic loss.Precise pore structure design enhances impedance matching and promotes multi-scattering and internal reflection of EMWs.Notably,an“EMW-pore matching”mechanism is proposed,whereby pore size governs the impedance matching at specific frequencies,enabling tunable absorption performance.The optimized absorber achieves a reflection loss(RL)of-67.84 dB,while radar cross-section(RCS)simulations confirm its exceptional attenuation and stealth potential.Additionally,the 3D skeleton derived from PU foam confers remarkable thermal resistance and flame retardancy.This pore-regulation strategy provides a scalable route to designing lightweight,broadband,and thermally stable EMW absorbers for next-generation communication and stealth applications.展开更多
Artificial intelligence(AI)is increasingly recognized as a transformative force in the field of solid organ transplantation.From enhancing donor-recipient matching to predicting clinical risks and tailoring immunosupp...Artificial intelligence(AI)is increasingly recognized as a transformative force in the field of solid organ transplantation.From enhancing donor-recipient matching to predicting clinical risks and tailoring immunosuppressive therapy,AI has the potential to improve both operational efficiency and patient outcomes.Despite these advancements,the perspectives of transplant professionals-those at the forefront of critical decision-making-remain insufficiently explored.To address this gap,this study utilizes a multi-round electronic Delphi approach to gather and analyses insights from global experts involved in organ transplantation.Participants are invited to complete structured surveys capturing demographic data,professional roles,institutional practices,and prior exposure to AI technologies.The survey also explores perceptions of AI’s potential benefits.Quantitative responses are analyzed using descriptive statistics,while open-ended qualitative responses undergo thematic analysis.Preliminary findings indicate a generally positive outlook on AI’s role in enhancing transplantation processes,particularly in areas such as donor matching and post-operative care.These mixed views reflect both optimism and caution among professionals tasked with integrating new technologies into high-stakes clinical workflows.By capturing a wide range of expert opinions,the findings will inform future policy development,regulatory considerations,and institutional readiness frameworks for the integration of AI into organ transplantation.展开更多
Accurately counting dense objects in complex and diverse backgrounds is a significant challenge in computer vision,with applications ranging from crowd counting to various other object counting tasks.To address this,w...Accurately counting dense objects in complex and diverse backgrounds is a significant challenge in computer vision,with applications ranging from crowd counting to various other object counting tasks.To address this,we propose HUANNet(High-Resolution Unified Attention Network),a convolutional neural network designed to capture both local features and rich semantic information through a high-resolution representation learning framework,while optimizing computational distribution across parallel branches.HUANNet introduces three core modules:the High-Resolution Attention Module(HRAM),which enhances feature extraction by optimizing multiresolution feature fusion;the Unified Multi-Scale Attention Module(UMAM),which integrates spatial,channel,and convolutional kernel information through an attention mechanism applied across multiple levels of the network;and the Grid-Assisted Point Matching Module(GPMM),which stabilizes and improves point-to-point matching by leveraging grid-based mechanisms.Extensive experiments show that HUANNet achieves competitive results on the ShanghaiTech Part A/B crowd counting datasets and sets new state-of-the-art performance on dense object counting datasets such as CARPK and XRAY-IECCD,demonstrating the effectiveness and versatility of HUANNet.展开更多
A comprehensive assessment of grain supply,demand,and ecosystem service flows is essential for identifying grain movement pathways,ensuring regional grain security,and guiding sustainable management strategies.However...A comprehensive assessment of grain supply,demand,and ecosystem service flows is essential for identifying grain movement pathways,ensuring regional grain security,and guiding sustainable management strategies.However,current studies primarily focus on short-term grain provision services while neglecting the spatiotemporal variations in grain flows across different scales.This gap limits the identification of dynamic matching relationships and the formulation of optimization strategies for balancing grain flows.This study examined the spatiotemporal evolution of grain supply and demand in the Beijing-Tianjin-Hebei(BTH)region from 1980 to 2020.Using the Enhanced TwoStep Floating Catchment Area method,the grain provision ecosystem service flows were quantified,the changes in supply–demand matching under different grain flow scenarios were analyzed and the optimal distance threshold for grain flows was investigated.The results revealed that grain production follows a spatial distribution pattern characterized by high levels in the southeast and low levels in the northwest.A significant mismatch exists between supply and demand,and it shows a scale effect.Deficit areas are mainly concentrated in the northwest,while surplus areas are mainly located in the central and southern regions.As the spatial scale increases,the ecosystem service supply–demand ratio(SDR)classification becomes more clustered,while it exhibits greater spatial SDR heterogeneity at smaller scales.This study examined two distinct scenarios of grain provision ecosystem service flow dynamics based on 100 and 200 km distance thresholds.The flow increased significantly,from 2.17 to 11.81million tons in the first scenario and from 2.41 to 12.37 million tons in the second scenario over nearly 40 years,forming a spatial movement pattern from the central and southern regions to the surrounding areas.Large flows were mainly concentrated in the interior of urban centers,with significant outflows between cities such as Baoding,Shijiazhuang,Xingtai,and Hengshui.At the county scale,supply–demand matching patterns remained consistent between the grain flows in the two scenarios.Notably,incorporating grain flow dynamics significantly reduced the number of grain-deficit areas compared to scenarios without grain flow.In 2020,grain-deficit counties decreased by28.79 and 37.88%,and cities by 12.50 and 25.0%under the two scenarios,respectively.Furthermore,the distance threshold for achieving optimal supply and demand matching at the county scale was longer than at the city scale in both grain flow scenarios.This study provides valuable insights into the dynamic relationships and heterogeneous patterns of grain matching,and expands the research perspective on grain and ecosystem service flows across various spatiotemporal scales.展开更多
Deep neural networks have achieved excellent classification results on several computer vision benchmarks.This has led to the popularity of machine learning as a service,where trained algorithms are hosted on the clou...Deep neural networks have achieved excellent classification results on several computer vision benchmarks.This has led to the popularity of machine learning as a service,where trained algorithms are hosted on the cloud and inference can be obtained on real-world data.In most applications,it is important to compress the vision data due to the enormous bandwidth and memory requirements.Video codecs exploit spatial and temporal correlations to achieve high compression ratios,but they are computationally expensive.This work computes the motion fields between consecutive frames to facilitate the efficient classification of videos.However,contrary to the normal practice of reconstructing the full-resolution frames through motion compensation,this work proposes to infer the class label from the block-based computed motion fields directly.Motion fields are a richer and more complex representation of motion vectors,where each motion vector carries the magnitude and direction information.This approach has two advantages:the cost of motion compensation and video decoding is avoided,and the dimensions of the input signal are highly reduced.This results in a shallower network for classification.The neural network can be trained using motion vectors in two ways:complex representations and magnitude-direction pairs.The proposed work trains a convolutional neural network on the direction and magnitude tensors of the motion fields.Our experimental results show 20×faster convergence during training,reduced overfitting,and accelerated inference on a hand gesture recognition dataset compared to full-resolution and downsampled frames.We validate the proposed methodology on the HGds dataset,achieving a testing accuracy of 99.21%,on the HMDB51 dataset,achieving 82.54%accuracy,and on the UCF101 dataset,achieving 97.13%accuracy,outperforming state-of-the-art methods in computational efficiency.展开更多
The research findings on the ground motion and liquefaction potential analyses during the 2018 Great Indonesia Earthquake(M_(w)7.5)are significant and crucial.The earthquake triggered soil-structure damage due to liqu...The research findings on the ground motion and liquefaction potential analyses during the 2018 Great Indonesia Earthquake(M_(w)7.5)are significant and crucial.The earthquake triggered soil-structure damage due to liquefaction.This study,which thoroughly investigated four sites at Palu,was conducted by performing a comprehensive ground motion parameter analysis.The ground motion characteristics were presented and justified,particularly for the most impacted direction.Ground motion predictions were analysed to define the spectral accelerations,and matching spectral accelerations were conducted to produce ground motions for each site.Non-linear seismic ground response analysis based on the hyperbolic model of pressure pressure-dependent was performed to investigate cyclic soil behaviour.The results revealed that ground motion is crucial in significant soil damage,and the earthquake energy could trigger deep liquefaction.As the most significant ground motion,the vertical ground motion is essential in determining deep liquefaction.The discussion on the impact of liquefaction based on the results of the numerical analysis is presented.Significant ground motion with a longer duration could have a substantial impact on deep liquefaction in the study area.These findings depict how the 2018 Indonesia Earthquake(M_(w)7.5)triggered a mega-liquefaction in Palu City.The results could enhance the understanding of the importance of seismic hazard assessment.It is recommended that site investigation and soil improvement should be planned to counteract liquefaction damage before construction.This study also suggests conducting seismic hazard assessments for city development to minimise the potential disaster impact in the study area.展开更多
In strategic decision-making tasks,determining how to assign limited costly resource towards the defender and the attacker is a central problem.However,it is hard for pre-allocated resource assignment to adapt to dyna...In strategic decision-making tasks,determining how to assign limited costly resource towards the defender and the attacker is a central problem.However,it is hard for pre-allocated resource assignment to adapt to dynamic fighting scenarios,and exists situations where the scenario and rule of the Colonel Blotto(CB)game are too restrictive in real world.To address these issues,a support stage is added as supplementary for pre-allocated results,in which a novel two-stage competitive resource assignment problem is formulated based on CB game and stochastic Lanchester equation(SLE).Further,the force attrition in these two stages is formulated as a stochastic progress to consider the complex fighting progress,including the case that the player with fewer resources defeats the player with more resources and wins the battlefield.For solving this two-stage resource assignment problem,nested solving and no-regret learning are proposed to search the optimal resource assignment strategies.Numerical experiments are taken to analyze the effectiveness of the proposed model and study the assignment strategies in various cases.展开更多
In this paper,we propose and analyze two second-order accurate finite difference schemes for the one-dimensional heat equation with concentrated capacity on a computa-tional domain=[a,b].We first transform the target ...In this paper,we propose and analyze two second-order accurate finite difference schemes for the one-dimensional heat equation with concentrated capacity on a computa-tional domain=[a,b].We first transform the target equation into the standard heat equation on the domain excluding the singular point equipped with an inner interface matching(IIM)condition on the singular point x=ξ∈(a,b),then adopt Taylor’s ex-pansion to approximate the IIM condition at the singular point and apply second-order finite difference method to approximate the standard heat equation at the nonsingular points.This discrete procedure allows us to choose different grid sizes to partition the two sub-domains[a,ξ]and[ξ,b],which ensures that x=ξ is a grid point,and hence the pro-posed schemes can be generalized to the heat equation with more than one concentrated capacities.We prove that the two proposed schemes are uniquely solvable.And through in-depth analysis of the local truncation errors,we rigorously prove that the two schemes are second-order accurate both in temporal and spatial directions in the maximum norm without any constraint on the grid ratio.Numerical experiments are carried out to verify our theoretical conclusions.展开更多
基金Supported by the National Natural Science Foundation of China( 1 0 371 1 1 2 ) and the Natural ScienceFoundation of Henan( 0 4 1 1 0 1 1 2 0 0 )
文摘Given a simple graph G and a positive integer k, the induced matching k-partition problem asks whether there exists a k-partition (V 1, V 2, ..., V k) of V(G) such that for each i(1≤i≤k), G[V i] is 1-regular. This paper studies the computational complexity of this problem for graphs with small diameters. The main results are as follows: Induced matching 2-partition problem of graphs with diameter 6 and induced matching 3-partition problem of graphs with diameter 2 are NP-complete; induced matching 2-partition problem of graphs with diameter 2 is polynomially solvable.
基金Supported by National Natural Science Foundation of China(11801148,11801149 and 11626089)the Foundation for the Doctor of Henan Polytechnic University(B2014-060)
文摘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 hexangons,capped on each end by two adjacent triangles,denoted by T_(l)(l≥1).A(3,6)-fullerene Tl with n vertices has exactly 2n/4+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 matchpings is obtained.Therefore,the correctness of the conclusion that every bridgeless cubic graph with p vertices has at least 2p/3656perfect matchings proposed by Esperet et al is verified for(3,6)-fullerene G=(n+1,4,t).
基金Supported by the National Natural Science Foundation of China(Grant No.11471273 11671186)
文摘Enumeration of perfect matchings on graphs has a longstanding interest in combinatorial mathematics. In this paper, we obtain some explicit expressions of the number of perfect matchings for a type of Archimedean lattices with toroidal boundary by applying Tesler's crossing orientations to obtain some Pfaffan orientations and enumerating their Pfaffans.
基金Research supported partially by NSFC (10001035) and(10371055)
文摘Let I with |I| = k be a matching of a graph G (briefly, I is called a k-matching). If I is not a proper subset of any other matching of G, then I is a maximal k-matching and m(gk, G) is used to denote the number of maximal k-matchings of G. Let gk be a k-matching of G, if there exists a subset {e1, e2,…, ei} of E(G) \ gk, i (?)1, such that (1) for any j ∈ {1, 2,…,i}, gk + {ej} is a (k + l)-matching of G; (2) for any f ∈ E(G) \ (gk ∪ {e1,e2,…,ei}), gk + {f} is not a matching of G; then gk, is called an i wings k-matching of G and mi(gk,G) is used to denote the number of i wings k-matchings of G. In this paper, it is proved that both mi(gk,G) and m(gk,G) are edge reconstructible for every connected graph G, and as a corollary, it is shown that the matching polynomial is edge reconstructible.
基金Supported by the National Natural Science Foundation of China（10771179）
文摘The induced matching cover number of a graph G without isolated vertices, denoted by imc(G),is the minimum integer k such that G has k induced matchings {M1,M2,···,Mk}such that,V(M1)∪V(M2)∪···∪V(Mk)covers V(G).This paper shows that,if G is a 3-regular claw-free graph,then imc(G)∈{2,3}.
文摘In 2012, Gutman and Wagner proposed the concept of the matching energy of a graph and pointed out that its chemical applications can go back to the 1970s. The matching energy of a graph is defined as the sum of the absolute values of the zeros of its matching polynomial. Let u and v be the non-isolated vertices of the graphs G and H with the same order, respectively. Let wi?be a non-isolated vertex of graph Gi?where i=1, 2, …, k. We use Gu(k)?(respectively, Hv(k)) to denote the graph which is the coalescence of G (respectively, H) and G1, G2,…, Gk?by identifying the vertices u (respectively, v) and w1, w2,…, wk. In this paper, we first present a new technique of directly comparing the matching energies of Gu(k)?and Hv(k), which can tackle some quasi-order incomparable problems. As the applications of the technique, then we can determine the unicyclic graphs with perfect matchings of order 2n with the first to the ninth smallest matching energies for all n≥211.
文摘This article extend the John E. Hopcroft and Richart M. Karp Algorithm (HK Algorithm) for maximum matchings in bipartite graphs to the non-bipartite case by providing a new approach to deal with the blossom in alternating paths in the process of searching for augmenting paths, which different from well-known “shrinking” way of Edmonds and makes the algorithm for maximum matchings in general graphs more simple.
文摘Let G be a properly colored bipartite graph. A rainbow matching of G is such a matching in which no two edges have the same color. Let G be a properly colored bipartite graph with bipartition (X,Y) and . We show that if , then G has a rainbow coloring of size at least .
文摘Let k be a positive integer and G a bipartite graph with bipartition (X,Y). A perfect 1-k matching is an edge subset M of G such that each vertex in Y is incident with exactly one edge in M and each vertex in X is incident with exactly k edges in M. A perfect 1-k matching is an optimal semi-matching related to the load-balancing problem, where a semi-matching is an edge subset M such that each vertex in Y is incident with exactly one edge in M, and a vertex in X can be incident with an arbitrary number of edges in M. In this paper, we give three sufficient and necessary conditions for the existence of perfect 1-k matchings and for the existence of 1-k matchings covering | X |−dvertices in X, respectively, and characterize k-elementary bipartite graph which is a graph such that the subgraph induced by all k-allowed edges is connected, where an edge is k-allowed if it is contained in a perfect 1-k matching.
基金supported by the Fund for Innovative Research Group of the National Natural Science Foundation of China (Grant No.52221003)。
文摘The spatial optimization of best management practices(BMPs) plays a critical role in precise watershed pollution control. However, the effectiveness of BMPs exhibits a complex nonlinear dependence on both configuration unit scale and rainfall intensity, often leading to widespread spatiotemporal mismatches during implementation. To fill this gap, this study proposes a new framework:(a) delineating configuration units based on the implementation scale differences between structural and nonstructural BMPs;(b) incorporating BMP reduction thresholds to enable dynamic adjustment of design scales according to inflow loads;and(c) developing a staged allocation strategy tailored to varying rainfall scenarios. The framework is exemplified by an agricultural catchment in the southeastern Liaohe watershed, China. The results showed that the framework could improve the assessment accuracy and cost-effectiveness of pollution control. Specifically, neglecting BMP reduction thresholds resulted in a 51.35% underestimation of treatment costs. Incorporating these thresholds and dynamically adjusting BMP design scales reduced treatment costs by 62.70%. Furthermore, the framework facilitated more precise localization of structural BMPs(1 km^(2)) and improved optimization efficiency by 95.91%. The proposed staged allocation strategy ensured water quality compliance under varying rainfall intensities. Structural BMPs primarily addressed pollution from light to moderate rainfall in the initial stage, while nonstructural BMPs targeted heavy rainfall pollution in the subsequent stage. The proposed framework may enhance the spatiotemporal adaptability of BMP configuration to respond to the threats posed by climate change and human activities. It can also be extended to other agriculture-dominated watersheds.
基金supported by the National Natural Science Foundation of China,No.62301497the Science and Technology Research Program of Henan,No.252102211024the Key Research and Development Program of Henan,No.231111212000.
文摘Stereo matching is a pivotal task in computer vision,enabling precise depth estimation from stereo image pairs,yet it encounters challenges in regions with reflections,repetitive textures,or fine structures.In this paper,we propose a Semantic-Guided Parallax Attention Stereo Matching Network(SGPASMnet)that can be trained in unsupervised manner,building upon the Parallax Attention Stereo Matching Network(PASMnet).Our approach leverages unsupervised learning to address the scarcity of ground truth disparity in stereo matching datasets,facilitating robust training across diverse scene-specific datasets and enhancing generalization.SGPASMnet incorporates two novel components:a Cross-Scale Feature Interaction(CSFI)block and semantic feature augmentation using a pre-trained semantic segmentation model,SegFormer,seamlessly embedded into the parallax attention mechanism.The CSFI block enables effective fusion ofmulti-scale features,integrating coarse and fine details to enhance disparity estimation accuracy.Semantic features,extracted by SegFormer,enrich the parallax attention mechanism by providing high-level scene context,significantly improving performance in ambiguous regions.Our model unifies these enhancements within a cohesive architecture,comprising semantic feature extraction,an hourglass network,a semantic-guided cascaded parallax attentionmodule,outputmodule,and a disparity refinement network.Evaluations on the KITTI2015 dataset demonstrate that our unsupervised method achieves a lower error rate compared to the original PASMnet,highlighting the effectiveness of our enhancements in handling complex scenes.By harnessing unsupervised learning without ground truth disparity needed,SGPASMnet offers a scalable and robust solution for accurate stereo matching,with superior generalization across varied real-world applications.
基金supported by the National Natural Science Foundation of China(52562043)Jiangxi Provincial Natural Science Foundation(20244BAB28050)。
文摘The rapid advancement of 5G/6G communication and radar technology has exacerbated issues of electromagnetic wave(EMW)leakage,interference,and thermal management.Therefore,developing lightweight EMW absorbers that integrate strong absorption,broad bandwidth,and thermal stability is crucial.Herein,a 3D MXene sponge/NiFe@NC heterostructure with tunable pore architecture is constructed by pyrolyzing a polyurethane(PU)foam template uniformly coated with NiFe-decorated Ti_(3)C_(2)T_(x)MXene nanosheets.The resulting porous dielectric-magnetic network integrates interconnected MXene pathways with uniformly dispersed NiFe@NC nanoparticles,enabling a synergistic effect of dielectric-magnetic loss through conduction loss,dipole/interface polarization,and magnetic loss.Precise pore structure design enhances impedance matching and promotes multi-scattering and internal reflection of EMWs.Notably,an“EMW-pore matching”mechanism is proposed,whereby pore size governs the impedance matching at specific frequencies,enabling tunable absorption performance.The optimized absorber achieves a reflection loss(RL)of-67.84 dB,while radar cross-section(RCS)simulations confirm its exceptional attenuation and stealth potential.Additionally,the 3D skeleton derived from PU foam confers remarkable thermal resistance and flame retardancy.This pore-regulation strategy provides a scalable route to designing lightweight,broadband,and thermally stable EMW absorbers for next-generation communication and stealth applications.
文摘Artificial intelligence(AI)is increasingly recognized as a transformative force in the field of solid organ transplantation.From enhancing donor-recipient matching to predicting clinical risks and tailoring immunosuppressive therapy,AI has the potential to improve both operational efficiency and patient outcomes.Despite these advancements,the perspectives of transplant professionals-those at the forefront of critical decision-making-remain insufficiently explored.To address this gap,this study utilizes a multi-round electronic Delphi approach to gather and analyses insights from global experts involved in organ transplantation.Participants are invited to complete structured surveys capturing demographic data,professional roles,institutional practices,and prior exposure to AI technologies.The survey also explores perceptions of AI’s potential benefits.Quantitative responses are analyzed using descriptive statistics,while open-ended qualitative responses undergo thematic analysis.Preliminary findings indicate a generally positive outlook on AI’s role in enhancing transplantation processes,particularly in areas such as donor matching and post-operative care.These mixed views reflect both optimism and caution among professionals tasked with integrating new technologies into high-stakes clinical workflows.By capturing a wide range of expert opinions,the findings will inform future policy development,regulatory considerations,and institutional readiness frameworks for the integration of AI into organ transplantation.
基金funded by the National Natural Science Foundation of China(62273213,62472262,62572287)Natural Science Foundation of Shandong Province(ZR2024MF144)+1 种基金Natural Science Foundation of Shandong Province for Innovation and Development Joint Funds(ZR2022LZH001)Taishan Scholarship Construction Engineering.
文摘Accurately counting dense objects in complex and diverse backgrounds is a significant challenge in computer vision,with applications ranging from crowd counting to various other object counting tasks.To address this,we propose HUANNet(High-Resolution Unified Attention Network),a convolutional neural network designed to capture both local features and rich semantic information through a high-resolution representation learning framework,while optimizing computational distribution across parallel branches.HUANNet introduces three core modules:the High-Resolution Attention Module(HRAM),which enhances feature extraction by optimizing multiresolution feature fusion;the Unified Multi-Scale Attention Module(UMAM),which integrates spatial,channel,and convolutional kernel information through an attention mechanism applied across multiple levels of the network;and the Grid-Assisted Point Matching Module(GPMM),which stabilizes and improves point-to-point matching by leveraging grid-based mechanisms.Extensive experiments show that HUANNet achieves competitive results on the ShanghaiTech Part A/B crowd counting datasets and sets new state-of-the-art performance on dense object counting datasets such as CARPK and XRAY-IECCD,demonstrating the effectiveness and versatility of HUANNet.
基金supported by the National Natural Science Foundation of China(42471336,52379021 and 42201278)the Hebei Province Backbone Talent Program,China(Returnee Platform for Overseas Study)(A20240028)+2 种基金the Hebei Province Statistical Science Research Project,China(2024HZ04)the Hebei Province Graduate Education and Teaching Reform Research Project,China(YJG2024046)the Innovation Ability Training Program for Postgraduate Students of Hebei Provincial Department of Education,China(CXZZSS2025048)。
文摘A comprehensive assessment of grain supply,demand,and ecosystem service flows is essential for identifying grain movement pathways,ensuring regional grain security,and guiding sustainable management strategies.However,current studies primarily focus on short-term grain provision services while neglecting the spatiotemporal variations in grain flows across different scales.This gap limits the identification of dynamic matching relationships and the formulation of optimization strategies for balancing grain flows.This study examined the spatiotemporal evolution of grain supply and demand in the Beijing-Tianjin-Hebei(BTH)region from 1980 to 2020.Using the Enhanced TwoStep Floating Catchment Area method,the grain provision ecosystem service flows were quantified,the changes in supply–demand matching under different grain flow scenarios were analyzed and the optimal distance threshold for grain flows was investigated.The results revealed that grain production follows a spatial distribution pattern characterized by high levels in the southeast and low levels in the northwest.A significant mismatch exists between supply and demand,and it shows a scale effect.Deficit areas are mainly concentrated in the northwest,while surplus areas are mainly located in the central and southern regions.As the spatial scale increases,the ecosystem service supply–demand ratio(SDR)classification becomes more clustered,while it exhibits greater spatial SDR heterogeneity at smaller scales.This study examined two distinct scenarios of grain provision ecosystem service flow dynamics based on 100 and 200 km distance thresholds.The flow increased significantly,from 2.17 to 11.81million tons in the first scenario and from 2.41 to 12.37 million tons in the second scenario over nearly 40 years,forming a spatial movement pattern from the central and southern regions to the surrounding areas.Large flows were mainly concentrated in the interior of urban centers,with significant outflows between cities such as Baoding,Shijiazhuang,Xingtai,and Hengshui.At the county scale,supply–demand matching patterns remained consistent between the grain flows in the two scenarios.Notably,incorporating grain flow dynamics significantly reduced the number of grain-deficit areas compared to scenarios without grain flow.In 2020,grain-deficit counties decreased by28.79 and 37.88%,and cities by 12.50 and 25.0%under the two scenarios,respectively.Furthermore,the distance threshold for achieving optimal supply and demand matching at the county scale was longer than at the city scale in both grain flow scenarios.This study provides valuable insights into the dynamic relationships and heterogeneous patterns of grain matching,and expands the research perspective on grain and ecosystem service flows across various spatiotemporal scales.
基金Supported by Princess Nourah bint Abdulrahman University Researchers Supporting Project number(PNURSP2025R896).
文摘Deep neural networks have achieved excellent classification results on several computer vision benchmarks.This has led to the popularity of machine learning as a service,where trained algorithms are hosted on the cloud and inference can be obtained on real-world data.In most applications,it is important to compress the vision data due to the enormous bandwidth and memory requirements.Video codecs exploit spatial and temporal correlations to achieve high compression ratios,but they are computationally expensive.This work computes the motion fields between consecutive frames to facilitate the efficient classification of videos.However,contrary to the normal practice of reconstructing the full-resolution frames through motion compensation,this work proposes to infer the class label from the block-based computed motion fields directly.Motion fields are a richer and more complex representation of motion vectors,where each motion vector carries the magnitude and direction information.This approach has two advantages:the cost of motion compensation and video decoding is avoided,and the dimensions of the input signal are highly reduced.This results in a shallower network for classification.The neural network can be trained using motion vectors in two ways:complex representations and magnitude-direction pairs.The proposed work trains a convolutional neural network on the direction and magnitude tensors of the motion fields.Our experimental results show 20×faster convergence during training,reduced overfitting,and accelerated inference on a hand gesture recognition dataset compared to full-resolution and downsampled frames.We validate the proposed methodology on the HGds dataset,achieving a testing accuracy of 99.21%,on the HMDB51 dataset,achieving 82.54%accuracy,and on the UCF101 dataset,achieving 97.13%accuracy,outperforming state-of-the-art methods in computational efficiency.
基金The World Class Professor(WCP)Program of the Directorate of Resources,Directorate General of Higher Education,Ministry of Education and Culture in 2023 supports this studythe JAPAN-ASEAN Science and Technology Innovation Platform(JASTIP-WP4)+3 种基金the University of Bengkulu's International Collaboration Research Fund(2183/UN30.15/LT/2019)for partial fundingthe C2F Fund for Postdoctoral Fellowship from Chulalongkorn Universitythe Thailand Science Research and Innovation Fund Chulalongkorn University(DISF68210001)the National Research Council of Thailand(N42A670572)。
文摘The research findings on the ground motion and liquefaction potential analyses during the 2018 Great Indonesia Earthquake(M_(w)7.5)are significant and crucial.The earthquake triggered soil-structure damage due to liquefaction.This study,which thoroughly investigated four sites at Palu,was conducted by performing a comprehensive ground motion parameter analysis.The ground motion characteristics were presented and justified,particularly for the most impacted direction.Ground motion predictions were analysed to define the spectral accelerations,and matching spectral accelerations were conducted to produce ground motions for each site.Non-linear seismic ground response analysis based on the hyperbolic model of pressure pressure-dependent was performed to investigate cyclic soil behaviour.The results revealed that ground motion is crucial in significant soil damage,and the earthquake energy could trigger deep liquefaction.As the most significant ground motion,the vertical ground motion is essential in determining deep liquefaction.The discussion on the impact of liquefaction based on the results of the numerical analysis is presented.Significant ground motion with a longer duration could have a substantial impact on deep liquefaction in the study area.These findings depict how the 2018 Indonesia Earthquake(M_(w)7.5)triggered a mega-liquefaction in Palu City.The results could enhance the understanding of the importance of seismic hazard assessment.It is recommended that site investigation and soil improvement should be planned to counteract liquefaction damage before construction.This study also suggests conducting seismic hazard assessments for city development to minimise the potential disaster impact in the study area.
基金supported by the National Natural Science Foundation of China(61702528,61806212,62173336)。
文摘In strategic decision-making tasks,determining how to assign limited costly resource towards the defender and the attacker is a central problem.However,it is hard for pre-allocated resource assignment to adapt to dynamic fighting scenarios,and exists situations where the scenario and rule of the Colonel Blotto(CB)game are too restrictive in real world.To address these issues,a support stage is added as supplementary for pre-allocated results,in which a novel two-stage competitive resource assignment problem is formulated based on CB game and stochastic Lanchester equation(SLE).Further,the force attrition in these two stages is formulated as a stochastic progress to consider the complex fighting progress,including the case that the player with fewer resources defeats the player with more resources and wins the battlefield.For solving this two-stage resource assignment problem,nested solving and no-regret learning are proposed to search the optimal resource assignment strategies.Numerical experiments are taken to analyze the effectiveness of the proposed model and study the assignment strategies in various cases.
基金supported by the National Natural Science Foundation of China(Grant No.11571181)by the Natural Science Foundation of Jiangsu Province(Grant No.BK20171454).
文摘In this paper,we propose and analyze two second-order accurate finite difference schemes for the one-dimensional heat equation with concentrated capacity on a computa-tional domain=[a,b].We first transform the target equation into the standard heat equation on the domain excluding the singular point equipped with an inner interface matching(IIM)condition on the singular point x=ξ∈(a,b),then adopt Taylor’s ex-pansion to approximate the IIM condition at the singular point and apply second-order finite difference method to approximate the standard heat equation at the nonsingular points.This discrete procedure allows us to choose different grid sizes to partition the two sub-domains[a,ξ]and[ξ,b],which ensures that x=ξ is a grid point,and hence the pro-posed schemes can be generalized to the heat equation with more than one concentrated capacities.We prove that the two proposed schemes are uniquely solvable.And through in-depth analysis of the local truncation errors,we rigorously prove that the two schemes are second-order accurate both in temporal and spatial directions in the maximum norm without any constraint on the grid ratio.Numerical experiments are carried out to verify our theoretical conclusions.
